YES(?, 2)

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

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

Complexity upper bound 2

Time: 0.006 sec (SMT: 0.006 sec)