YES(?, 2*a + 2*b + 2*c + 2*d + 1)

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

A polynomial rank function with
	Pol(eval) = V_1 - V_2
	Pol(start) = V_1 - V_2
orients all transitions weakly and the transitions
	eval(a, b, c, d, e) -> eval(a, b + 1, c, d, e + 1) [ a >= b + 1 /\ d >= c ]
	eval(a, b, c, d, e) -> eval(a, b + 1, c, d, e + 1) [ a >= b + 1 /\ c >= d + 1 ]
strictly and produces the following problem:
2:	T:
		(a + b, 1)    eval(a, b, c, d, e) -> eval(a, b + 1, c, d, e + 1) [ a >= b + 1 /\ c >= d + 1 ]
		(?, 1)        eval(a, b, c, d, e) -> eval(a, b, c, d + 1, e + 1) [ a >= b + 1 /\ c >= d + 1 ]
		(?, 1)        eval(a, b, c, d, e) -> eval(a, b, c, d + 1, e + 1) [ b >= a /\ c >= d + 1 ]
		(a + b, 1)    eval(a, b, c, d, e) -> eval(a, b + 1, c, d, e + 1) [ a >= b + 1 /\ d >= c ]
		(1, 1)        start(a, b, c, d, e) -> eval(a, b, c, d, e)
	start location:	start
	leaf cost:	0

A polynomial rank function with
	Pol(eval) = V_3 - V_4
	Pol(start) = V_3 - V_4
orients all transitions weakly and the transitions
	eval(a, b, c, d, e) -> eval(a, b, c, d + 1, e + 1) [ b >= a /\ c >= d + 1 ]
	eval(a, b, c, d, e) -> eval(a, b, c, d + 1, e + 1) [ a >= b + 1 /\ c >= d + 1 ]
strictly and produces the following problem:
3:	T:
		(a + b, 1)    eval(a, b, c, d, e) -> eval(a, b + 1, c, d, e + 1) [ a >= b + 1 /\ c >= d + 1 ]
		(c + d, 1)    eval(a, b, c, d, e) -> eval(a, b, c, d + 1, e + 1) [ a >= b + 1 /\ c >= d + 1 ]
		(c + d, 1)    eval(a, b, c, d, e) -> eval(a, b, c, d + 1, e + 1) [ b >= a /\ c >= d + 1 ]
		(a + b, 1)    eval(a, b, c, d, e) -> eval(a, b + 1, c, d, e + 1) [ a >= b + 1 /\ d >= c ]
		(1, 1)        start(a, b, c, d, e) -> eval(a, b, c, d, e)
	start location:	start
	leaf cost:	0

Complexity upper bound 2*a + 2*b + 2*c + 2*d + 1

Time: 0.286 sec (SMT: 0.270 sec)