YES(?, 4)

Initial complexity problem:
1:	T:
		(?, 1)    f8(a, b, c) -> f12(2, 1, c) [ a = 2 ]
		(?, 1)    f8(a, b, c) -> f12(a, 0, c) [ 1 >= a ]
		(?, 1)    f8(a, b, c) -> f12(a, 0, c) [ a >= 3 ]
		(1, 1)    f0(a, b, c) -> f12(1, 1, 1)
	start location:	f0
	leaf cost:	0

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

Complexity upper bound 4

Time: 0.011 sec (SMT: 0.010 sec)