MAYBE

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

Complexity upper bound ?

Time: 1.027 sec (SMT: 0.981 sec)