YES(?, 3043)

Initial complexity problem:
1:	T:
		(1, 1)    f0(a, b, c, d, e, f, g) -> f15(0, h, i, 0, e, f, g)
		(?, 1)    f15(a, b, c, d, e, f, g) -> f15(a, b, c, d + 1, e, f, g) [ 49 >= d ]
		(?, 1)    f25(a, b, c, d, e, f, g) -> f25(a, b, c, d, e + 1, f, g) [ 49 >= e ]
		(?, 1)    f33(a, b, c, d, e, f, g) -> f33(a + 1, b, c, d, e, f, g) [ 49 >= a ]
		(?, 1)    f42(a, b, c, d, e, f, g) -> f42(a, b, c, d, e, f + 1, g) [ 49 >= f ]
		(?, 1)    f52(a, b, c, d, e, f, g) -> f52(a, b, c, d, e, f, g + 1) [ 49 >= g ]
		(?, 1)    f60(a, b, c, d, e, f, g) -> f60(a + 1, b, c, d, e, f, g) [ 49 >= a ]
		(?, 1)    f60(a, b, c, d, e, f, g) -> f69(a, b, c, d, e, f, g) [ a >= 50 ]
		(?, 1)    f52(a, b, c, d, e, f, g) -> f60(0, b, c, d, e, f, g) [ g >= 50 ]
		(?, 1)    f42(a, b, c, d, e, f, g) -> f52(a, b, c, d, e, f, 0) [ f >= 50 ]
		(?, 1)    f33(a, b, c, d, e, f, g) -> f42(a, b, c, d, e, 0, g) [ a >= 50 ]
		(?, 1)    f25(a, b, c, d, e, f, g) -> f33(0, b, c, d, e, f, g) [ e >= 50 ]
		(?, 1)    f15(a, b, c, d, e, f, g) -> f25(a, b, c, d, 0, f, g) [ d >= 50 ]
	start location:	f0
	leaf cost:	0

Slicing away variables that do not contribute to conditions from problem 1 leaves variables [a, d, e, f, g].
We thus obtain the following problem:
2:	T:
		(?, 1)    f15(a, d, e, f, g) -> f25(a, d, 0, f, g) [ d >= 50 ]
		(?, 1)    f25(a, d, e, f, g) -> f33(0, d, e, f, g) [ e >= 50 ]
		(?, 1)    f33(a, d, e, f, g) -> f42(a, d, e, 0, g) [ a >= 50 ]
		(?, 1)    f42(a, d, e, f, g) -> f52(a, d, e, f, 0) [ f >= 50 ]
		(?, 1)    f52(a, d, e, f, g) -> f60(0, d, e, f, g) [ g >= 50 ]
		(?, 1)    f60(a, d, e, f, g) -> f69(a, d, e, f, g) [ a >= 50 ]
		(?, 1)    f60(a, d, e, f, g) -> f60(a + 1, d, e, f, g) [ 49 >= a ]
		(?, 1)    f52(a, d, e, f, g) -> f52(a, d, e, f, g + 1) [ 49 >= g ]
		(?, 1)    f42(a, d, e, f, g) -> f42(a, d, e, f + 1, g) [ 49 >= f ]
		(?, 1)    f33(a, d, e, f, g) -> f33(a + 1, d, e, f, g) [ 49 >= a ]
		(?, 1)    f25(a, d, e, f, g) -> f25(a, d, e + 1, f, g) [ 49 >= e ]
		(?, 1)    f15(a, d, e, f, g) -> f15(a, d + 1, e, f, g) [ 49 >= d ]
		(1, 1)    f0(a, d, e, f, g) -> f15(0, 0, e, f, g)
	start location:	f0
	leaf cost:	0

Repeatedly removing leaves of the complexity graph in problem 2 produces the following problem:
3:	T:
		(?, 1)    f15(a, d, e, f, g) -> f25(a, d, 0, f, g) [ d >= 50 ]
		(?, 1)    f25(a, d, e, f, g) -> f33(0, d, e, f, g) [ e >= 50 ]
		(?, 1)    f33(a, d, e, f, g) -> f42(a, d, e, 0, g) [ a >= 50 ]
		(?, 1)    f42(a, d, e, f, g) -> f52(a, d, e, f, 0) [ f >= 50 ]
		(?, 1)    f52(a, d, e, f, g) -> f60(0, d, e, f, g) [ g >= 50 ]
		(?, 1)    f60(a, d, e, f, g) -> f60(a + 1, d, e, f, g) [ 49 >= a ]
		(?, 1)    f52(a, d, e, f, g) -> f52(a, d, e, f, g + 1) [ 49 >= g ]
		(?, 1)    f42(a, d, e, f, g) -> f42(a, d, e, f + 1, g) [ 49 >= f ]
		(?, 1)    f33(a, d, e, f, g) -> f33(a + 1, d, e, f, g) [ 49 >= a ]
		(?, 1)    f25(a, d, e, f, g) -> f25(a, d, e + 1, f, g) [ 49 >= e ]
		(?, 1)    f15(a, d, e, f, g) -> f15(a, d + 1, e, f, g) [ 49 >= d ]
		(1, 1)    f0(a, d, e, f, g) -> f15(0, 0, e, f, g)
	start location:	f0
	leaf cost:	1

A polynomial rank function with
	Pol(f15) = 49
	Pol(f25) = 48
	Pol(f33) = 47
	Pol(f42) = 46
	Pol(f52) = 45
	Pol(f60) = 44
	Pol(f0) = 49
orients all transitions weakly and the transitions
	f52(a, d, e, f, g) -> f60(0, d, e, f, g) [ g >= 50 ]
	f42(a, d, e, f, g) -> f52(a, d, e, f, 0) [ f >= 50 ]
	f33(a, d, e, f, g) -> f42(a, d, e, 0, g) [ a >= 50 ]
	f25(a, d, e, f, g) -> f33(0, d, e, f, g) [ e >= 50 ]
	f15(a, d, e, f, g) -> f25(a, d, 0, f, g) [ d >= 50 ]
strictly and produces the following problem:
4:	T:
		(49, 1)    f15(a, d, e, f, g) -> f25(a, d, 0, f, g) [ d >= 50 ]
		(49, 1)    f25(a, d, e, f, g) -> f33(0, d, e, f, g) [ e >= 50 ]
		(49, 1)    f33(a, d, e, f, g) -> f42(a, d, e, 0, g) [ a >= 50 ]
		(49, 1)    f42(a, d, e, f, g) -> f52(a, d, e, f, 0) [ f >= 50 ]
		(49, 1)    f52(a, d, e, f, g) -> f60(0, d, e, f, g) [ g >= 50 ]
		(?, 1)     f60(a, d, e, f, g) -> f60(a + 1, d, e, f, g) [ 49 >= a ]
		(?, 1)     f52(a, d, e, f, g) -> f52(a, d, e, f, g + 1) [ 49 >= g ]
		(?, 1)     f42(a, d, e, f, g) -> f42(a, d, e, f + 1, g) [ 49 >= f ]
		(?, 1)     f33(a, d, e, f, g) -> f33(a + 1, d, e, f, g) [ 49 >= a ]
		(?, 1)     f25(a, d, e, f, g) -> f25(a, d, e + 1, f, g) [ 49 >= e ]
		(?, 1)     f15(a, d, e, f, g) -> f15(a, d + 1, e, f, g) [ 49 >= d ]
		(1, 1)     f0(a, d, e, f, g) -> f15(0, 0, e, f, g)
	start location:	f0
	leaf cost:	1

A polynomial rank function with
	Pol(f15) = -V_2 + 98
	Pol(f25) = -V_2 - V_3 + 98
	Pol(f33) = -V_2 - V_3 + 98
	Pol(f42) = -V_2 - V_3 - V_4 + 98
	Pol(f52) = -V_2 - V_3 - V_4 - V_5 + 98
	Pol(f60) = -V_1 - V_2 - V_3 - V_4 - V_5 + 98
	Pol(f0) = 98
orients all transitions weakly and the transition
	f15(a, d, e, f, g) -> f15(a, d + 1, e, f, g) [ 49 >= d ]
strictly and produces the following problem:
5:	T:
		(49, 1)    f15(a, d, e, f, g) -> f25(a, d, 0, f, g) [ d >= 50 ]
		(49, 1)    f25(a, d, e, f, g) -> f33(0, d, e, f, g) [ e >= 50 ]
		(49, 1)    f33(a, d, e, f, g) -> f42(a, d, e, 0, g) [ a >= 50 ]
		(49, 1)    f42(a, d, e, f, g) -> f52(a, d, e, f, 0) [ f >= 50 ]
		(49, 1)    f52(a, d, e, f, g) -> f60(0, d, e, f, g) [ g >= 50 ]
		(?, 1)     f60(a, d, e, f, g) -> f60(a + 1, d, e, f, g) [ 49 >= a ]
		(?, 1)     f52(a, d, e, f, g) -> f52(a, d, e, f, g + 1) [ 49 >= g ]
		(?, 1)     f42(a, d, e, f, g) -> f42(a, d, e, f + 1, g) [ 49 >= f ]
		(?, 1)     f33(a, d, e, f, g) -> f33(a + 1, d, e, f, g) [ 49 >= a ]
		(?, 1)     f25(a, d, e, f, g) -> f25(a, d, e + 1, f, g) [ 49 >= e ]
		(98, 1)    f15(a, d, e, f, g) -> f15(a, d + 1, e, f, g) [ 49 >= d ]
		(1, 1)     f0(a, d, e, f, g) -> f15(0, 0, e, f, g)
	start location:	f0
	leaf cost:	1

A polynomial rank function with
	Pol(f15) = 50
	Pol(f25) = -V_3 + 50
	Pol(f33) = -V_3 - 49
	Pol(f42) = -V_3 - V_4 - 49
	Pol(f52) = -V_3 - V_4 - V_5 - 49
	Pol(f60) = -V_1 - V_3 - V_4 - V_5 - 49
	Pol(f0) = 50
orients all transitions weakly and the transition
	f25(a, d, e, f, g) -> f25(a, d, e + 1, f, g) [ 49 >= e ]
strictly and produces the following problem:
6:	T:
		(49, 1)    f15(a, d, e, f, g) -> f25(a, d, 0, f, g) [ d >= 50 ]
		(49, 1)    f25(a, d, e, f, g) -> f33(0, d, e, f, g) [ e >= 50 ]
		(49, 1)    f33(a, d, e, f, g) -> f42(a, d, e, 0, g) [ a >= 50 ]
		(49, 1)    f42(a, d, e, f, g) -> f52(a, d, e, f, 0) [ f >= 50 ]
		(49, 1)    f52(a, d, e, f, g) -> f60(0, d, e, f, g) [ g >= 50 ]
		(?, 1)     f60(a, d, e, f, g) -> f60(a + 1, d, e, f, g) [ 49 >= a ]
		(?, 1)     f52(a, d, e, f, g) -> f52(a, d, e, f, g + 1) [ 49 >= g ]
		(?, 1)     f42(a, d, e, f, g) -> f42(a, d, e, f + 1, g) [ 49 >= f ]
		(?, 1)     f33(a, d, e, f, g) -> f33(a + 1, d, e, f, g) [ 49 >= a ]
		(50, 1)    f25(a, d, e, f, g) -> f25(a, d, e + 1, f, g) [ 49 >= e ]
		(98, 1)    f15(a, d, e, f, g) -> f15(a, d + 1, e, f, g) [ 49 >= d ]
		(1, 1)     f0(a, d, e, f, g) -> f15(0, 0, e, f, g)
	start location:	f0
	leaf cost:	1

A polynomial rank function with
	Pol(f15) = 50
	Pol(f25) = 50
	Pol(f33) = 50
	Pol(f42) = -V_4 + 50
	Pol(f52) = -V_4 - V_5 - 49
	Pol(f60) = -V_1 - V_4 - V_5 - 49
	Pol(f0) = 50
orients all transitions weakly and the transition
	f42(a, d, e, f, g) -> f42(a, d, e, f + 1, g) [ 49 >= f ]
strictly and produces the following problem:
7:	T:
		(49, 1)    f15(a, d, e, f, g) -> f25(a, d, 0, f, g) [ d >= 50 ]
		(49, 1)    f25(a, d, e, f, g) -> f33(0, d, e, f, g) [ e >= 50 ]
		(49, 1)    f33(a, d, e, f, g) -> f42(a, d, e, 0, g) [ a >= 50 ]
		(49, 1)    f42(a, d, e, f, g) -> f52(a, d, e, f, 0) [ f >= 50 ]
		(49, 1)    f52(a, d, e, f, g) -> f60(0, d, e, f, g) [ g >= 50 ]
		(?, 1)     f60(a, d, e, f, g) -> f60(a + 1, d, e, f, g) [ 49 >= a ]
		(?, 1)     f52(a, d, e, f, g) -> f52(a, d, e, f, g + 1) [ 49 >= g ]
		(50, 1)    f42(a, d, e, f, g) -> f42(a, d, e, f + 1, g) [ 49 >= f ]
		(?, 1)     f33(a, d, e, f, g) -> f33(a + 1, d, e, f, g) [ 49 >= a ]
		(50, 1)    f25(a, d, e, f, g) -> f25(a, d, e + 1, f, g) [ 49 >= e ]
		(98, 1)    f15(a, d, e, f, g) -> f15(a, d + 1, e, f, g) [ 49 >= d ]
		(1, 1)     f0(a, d, e, f, g) -> f15(0, 0, e, f, g)
	start location:	f0
	leaf cost:	1

A polynomial rank function with
	Pol(f15) = 98
	Pol(f25) = 98
	Pol(f33) = 98
	Pol(f42) = 50
	Pol(f52) = -V_5 + 50
	Pol(f60) = -V_1 - V_5 - 49
	Pol(f0) = 98
orients all transitions weakly and the transition
	f52(a, d, e, f, g) -> f52(a, d, e, f, g + 1) [ 49 >= g ]
strictly and produces the following problem:
8:	T:
		(49, 1)    f15(a, d, e, f, g) -> f25(a, d, 0, f, g) [ d >= 50 ]
		(49, 1)    f25(a, d, e, f, g) -> f33(0, d, e, f, g) [ e >= 50 ]
		(49, 1)    f33(a, d, e, f, g) -> f42(a, d, e, 0, g) [ a >= 50 ]
		(49, 1)    f42(a, d, e, f, g) -> f52(a, d, e, f, 0) [ f >= 50 ]
		(49, 1)    f52(a, d, e, f, g) -> f60(0, d, e, f, g) [ g >= 50 ]
		(?, 1)     f60(a, d, e, f, g) -> f60(a + 1, d, e, f, g) [ 49 >= a ]
		(98, 1)    f52(a, d, e, f, g) -> f52(a, d, e, f, g + 1) [ 49 >= g ]
		(50, 1)    f42(a, d, e, f, g) -> f42(a, d, e, f + 1, g) [ 49 >= f ]
		(?, 1)     f33(a, d, e, f, g) -> f33(a + 1, d, e, f, g) [ 49 >= a ]
		(50, 1)    f25(a, d, e, f, g) -> f25(a, d, e + 1, f, g) [ 49 >= e ]
		(98, 1)    f15(a, d, e, f, g) -> f15(a, d + 1, e, f, g) [ 49 >= d ]
		(1, 1)     f0(a, d, e, f, g) -> f15(0, 0, e, f, g)
	start location:	f0
	leaf cost:	1

A polynomial rank function with
	Pol(f15) = 50
	Pol(f25) = 50
	Pol(f33) = 50
	Pol(f42) = 50
	Pol(f52) = 50
	Pol(f60) = -V_1 + 50
	Pol(f0) = 50
orients all transitions weakly and the transition
	f60(a, d, e, f, g) -> f60(a + 1, d, e, f, g) [ 49 >= a ]
strictly and produces the following problem:
9:	T:
		(49, 1)    f15(a, d, e, f, g) -> f25(a, d, 0, f, g) [ d >= 50 ]
		(49, 1)    f25(a, d, e, f, g) -> f33(0, d, e, f, g) [ e >= 50 ]
		(49, 1)    f33(a, d, e, f, g) -> f42(a, d, e, 0, g) [ a >= 50 ]
		(49, 1)    f42(a, d, e, f, g) -> f52(a, d, e, f, 0) [ f >= 50 ]
		(49, 1)    f52(a, d, e, f, g) -> f60(0, d, e, f, g) [ g >= 50 ]
		(50, 1)    f60(a, d, e, f, g) -> f60(a + 1, d, e, f, g) [ 49 >= a ]
		(98, 1)    f52(a, d, e, f, g) -> f52(a, d, e, f, g + 1) [ 49 >= g ]
		(50, 1)    f42(a, d, e, f, g) -> f42(a, d, e, f + 1, g) [ 49 >= f ]
		(?, 1)     f33(a, d, e, f, g) -> f33(a + 1, d, e, f, g) [ 49 >= a ]
		(50, 1)    f25(a, d, e, f, g) -> f25(a, d, e + 1, f, g) [ 49 >= e ]
		(98, 1)    f15(a, d, e, f, g) -> f15(a, d + 1, e, f, g) [ 49 >= d ]
		(1, 1)     f0(a, d, e, f, g) -> f15(0, 0, e, f, g)
	start location:	f0
	leaf cost:	1

A polynomial rank function with
	Pol(f33) = -V_1 + 50
and size complexities
	S("f0(a, d, e, f, g) -> f15(0, 0, e, f, g)", 0-0) = 0
	S("f0(a, d, e, f, g) -> f15(0, 0, e, f, g)", 0-1) = 0
	S("f0(a, d, e, f, g) -> f15(0, 0, e, f, g)", 0-2) = e
	S("f0(a, d, e, f, g) -> f15(0, 0, e, f, g)", 0-3) = f
	S("f0(a, d, e, f, g) -> f15(0, 0, e, f, g)", 0-4) = g
	S("f15(a, d, e, f, g) -> f15(a, d + 1, e, f, g) [ 49 >= d ]", 0-0) = 0
	S("f15(a, d, e, f, g) -> f15(a, d + 1, e, f, g) [ 49 >= d ]", 0-1) = 50
	S("f15(a, d, e, f, g) -> f15(a, d + 1, e, f, g) [ 49 >= d ]", 0-2) = e
	S("f15(a, d, e, f, g) -> f15(a, d + 1, e, f, g) [ 49 >= d ]", 0-3) = f
	S("f15(a, d, e, f, g) -> f15(a, d + 1, e, f, g) [ 49 >= d ]", 0-4) = g
	S("f25(a, d, e, f, g) -> f25(a, d, e + 1, f, g) [ 49 >= e ]", 0-0) = 0
	S("f25(a, d, e, f, g) -> f25(a, d, e + 1, f, g) [ 49 >= e ]", 0-1) = 50
	S("f25(a, d, e, f, g) -> f25(a, d, e + 1, f, g) [ 49 >= e ]", 0-2) = 50
	S("f25(a, d, e, f, g) -> f25(a, d, e + 1, f, g) [ 49 >= e ]", 0-3) = f
	S("f25(a, d, e, f, g) -> f25(a, d, e + 1, f, g) [ 49 >= e ]", 0-4) = g
	S("f33(a, d, e, f, g) -> f33(a + 1, d, e, f, g) [ 49 >= a ]", 0-0) = 50
	S("f33(a, d, e, f, g) -> f33(a + 1, d, e, f, g) [ 49 >= a ]", 0-1) = 50
	S("f33(a, d, e, f, g) -> f33(a + 1, d, e, f, g) [ 49 >= a ]", 0-2) = 50
	S("f33(a, d, e, f, g) -> f33(a + 1, d, e, f, g) [ 49 >= a ]", 0-3) = f
	S("f33(a, d, e, f, g) -> f33(a + 1, d, e, f, g) [ 49 >= a ]", 0-4) = g
	S("f42(a, d, e, f, g) -> f42(a, d, e, f + 1, g) [ 49 >= f ]", 0-0) = 50
	S("f42(a, d, e, f, g) -> f42(a, d, e, f + 1, g) [ 49 >= f ]", 0-1) = 50
	S("f42(a, d, e, f, g) -> f42(a, d, e, f + 1, g) [ 49 >= f ]", 0-2) = 50
	S("f42(a, d, e, f, g) -> f42(a, d, e, f + 1, g) [ 49 >= f ]", 0-3) = 50
	S("f42(a, d, e, f, g) -> f42(a, d, e, f + 1, g) [ 49 >= f ]", 0-4) = g
	S("f52(a, d, e, f, g) -> f52(a, d, e, f, g + 1) [ 49 >= g ]", 0-0) = 50
	S("f52(a, d, e, f, g) -> f52(a, d, e, f, g + 1) [ 49 >= g ]", 0-1) = 50
	S("f52(a, d, e, f, g) -> f52(a, d, e, f, g + 1) [ 49 >= g ]", 0-2) = 50
	S("f52(a, d, e, f, g) -> f52(a, d, e, f, g + 1) [ 49 >= g ]", 0-3) = 50
	S("f52(a, d, e, f, g) -> f52(a, d, e, f, g + 1) [ 49 >= g ]", 0-4) = 50
	S("f60(a, d, e, f, g) -> f60(a + 1, d, e, f, g) [ 49 >= a ]", 0-0) = 50
	S("f60(a, d, e, f, g) -> f60(a + 1, d, e, f, g) [ 49 >= a ]", 0-1) = 50
	S("f60(a, d, e, f, g) -> f60(a + 1, d, e, f, g) [ 49 >= a ]", 0-2) = 50
	S("f60(a, d, e, f, g) -> f60(a + 1, d, e, f, g) [ 49 >= a ]", 0-3) = 50
	S("f60(a, d, e, f, g) -> f60(a + 1, d, e, f, g) [ 49 >= a ]", 0-4) = 50
	S("f52(a, d, e, f, g) -> f60(0, d, e, f, g) [ g >= 50 ]", 0-0) = 0
	S("f52(a, d, e, f, g) -> f60(0, d, e, f, g) [ g >= 50 ]", 0-1) = 50
	S("f52(a, d, e, f, g) -> f60(0, d, e, f, g) [ g >= 50 ]", 0-2) = 50
	S("f52(a, d, e, f, g) -> f60(0, d, e, f, g) [ g >= 50 ]", 0-3) = 50
	S("f52(a, d, e, f, g) -> f60(0, d, e, f, g) [ g >= 50 ]", 0-4) = 50
	S("f42(a, d, e, f, g) -> f52(a, d, e, f, 0) [ f >= 50 ]", 0-0) = 50
	S("f42(a, d, e, f, g) -> f52(a, d, e, f, 0) [ f >= 50 ]", 0-1) = 50
	S("f42(a, d, e, f, g) -> f52(a, d, e, f, 0) [ f >= 50 ]", 0-2) = 50
	S("f42(a, d, e, f, g) -> f52(a, d, e, f, 0) [ f >= 50 ]", 0-3) = 50
	S("f42(a, d, e, f, g) -> f52(a, d, e, f, 0) [ f >= 50 ]", 0-4) = 0
	S("f33(a, d, e, f, g) -> f42(a, d, e, 0, g) [ a >= 50 ]", 0-0) = 50
	S("f33(a, d, e, f, g) -> f42(a, d, e, 0, g) [ a >= 50 ]", 0-1) = 50
	S("f33(a, d, e, f, g) -> f42(a, d, e, 0, g) [ a >= 50 ]", 0-2) = 50
	S("f33(a, d, e, f, g) -> f42(a, d, e, 0, g) [ a >= 50 ]", 0-3) = 0
	S("f33(a, d, e, f, g) -> f42(a, d, e, 0, g) [ a >= 50 ]", 0-4) = g
	S("f25(a, d, e, f, g) -> f33(0, d, e, f, g) [ e >= 50 ]", 0-0) = 0
	S("f25(a, d, e, f, g) -> f33(0, d, e, f, g) [ e >= 50 ]", 0-1) = 50
	S("f25(a, d, e, f, g) -> f33(0, d, e, f, g) [ e >= 50 ]", 0-2) = 50
	S("f25(a, d, e, f, g) -> f33(0, d, e, f, g) [ e >= 50 ]", 0-3) = f
	S("f25(a, d, e, f, g) -> f33(0, d, e, f, g) [ e >= 50 ]", 0-4) = g
	S("f15(a, d, e, f, g) -> f25(a, d, 0, f, g) [ d >= 50 ]", 0-0) = 0
	S("f15(a, d, e, f, g) -> f25(a, d, 0, f, g) [ d >= 50 ]", 0-1) = 50
	S("f15(a, d, e, f, g) -> f25(a, d, 0, f, g) [ d >= 50 ]", 0-2) = 0
	S("f15(a, d, e, f, g) -> f25(a, d, 0, f, g) [ d >= 50 ]", 0-3) = f
	S("f15(a, d, e, f, g) -> f25(a, d, 0, f, g) [ d >= 50 ]", 0-4) = g
orients the transition
	f33(a, d, e, f, g) -> f33(a + 1, d, e, f, g) [ 49 >= a ]
weakly and the transition
	f33(a, d, e, f, g) -> f33(a + 1, d, e, f, g) [ 49 >= a ]
strictly and produces the following problem:
10:	T:
		(49, 1)      f15(a, d, e, f, g) -> f25(a, d, 0, f, g) [ d >= 50 ]
		(49, 1)      f25(a, d, e, f, g) -> f33(0, d, e, f, g) [ e >= 50 ]
		(49, 1)      f33(a, d, e, f, g) -> f42(a, d, e, 0, g) [ a >= 50 ]
		(49, 1)      f42(a, d, e, f, g) -> f52(a, d, e, f, 0) [ f >= 50 ]
		(49, 1)      f52(a, d, e, f, g) -> f60(0, d, e, f, g) [ g >= 50 ]
		(50, 1)      f60(a, d, e, f, g) -> f60(a + 1, d, e, f, g) [ 49 >= a ]
		(98, 1)      f52(a, d, e, f, g) -> f52(a, d, e, f, g + 1) [ 49 >= g ]
		(50, 1)      f42(a, d, e, f, g) -> f42(a, d, e, f + 1, g) [ 49 >= f ]
		(2450, 1)    f33(a, d, e, f, g) -> f33(a + 1, d, e, f, g) [ 49 >= a ]
		(50, 1)      f25(a, d, e, f, g) -> f25(a, d, e + 1, f, g) [ 49 >= e ]
		(98, 1)      f15(a, d, e, f, g) -> f15(a, d + 1, e, f, g) [ 49 >= d ]
		(1, 1)       f0(a, d, e, f, g) -> f15(0, 0, e, f, g)
	start location:	f0
	leaf cost:	1

Complexity upper bound 3043

Time: 0.652 sec (SMT: 0.600 sec)