YES(?, 1)

Initial complexity problem:
1:	T:
		(1, 1)    f0(a) -> f9(b)
	start location:	f0
	leaf cost:	0

Complexity upper bound 1

Time: 0.003 sec (SMT: 0.003 sec)