YES(?, 2)

Initial complexity problem:
1:	T:
		(?, 1)    eval(a, b) -> eval(b, a) [ a >= b + 1 ]
		(1, 1)    start(a, b) -> eval(a, b)
	start location:	start
	leaf cost:	0

Repeatedly removing leaves of the complexity graph in problem 1 produces the following problem:
2:	T:
		(none)
	start location:	start
	leaf cost:	2

Complexity upper bound 2

Time: 0.012 sec (SMT: 0.011 sec)