YES(?, 1)

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

Complexity upper bound 1

Time: 0.005 sec (SMT: 0.005 sec)