YES(?, 2)

Initial complexity problem:
1:	T:
		(1, 1)    f0(a, b, c) -> f11(0, 1, e) [ 99 >= d ]
		(1, 1)    f0(a, b, c) -> f11(0, 1, e)
	start location:	f0
	leaf cost:	0

Complexity upper bound 2

Time: 0.018 sec (SMT: 0.017 sec)