YES(?, 3)

Initial complexity problem:
1:	T:
		(1, 1)    f0(a, b, c, d, e, f) -> f17(h, g, i, d, e, f) [ 0 >= g + 2 ]
		(1, 1)    f0(a, b, c, d, e, f) -> f17(h, g, i, d, e, f) [ g >= 0 ]
		(1, 1)    f0(a, b, c, d, e, f) -> f17(h, -1, c, 0, g, i)
	start location:	f0
	leaf cost:	0

Complexity upper bound 3

Time: 0.053 sec (SMT: 0.051 sec)