YES(?, 1)

Initial complexity problem:
1:	T:
		(1, 1)    f0(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, a1, b1, c1, d1, e1, f1, g1, h1, i1, j1, k1, l1, m1, n1, o1, p1, q1, r1, s1, t1, u1, v1) -> f75(2, w1, w1, w1, w1, w1, 2, x1, x1, x1, x1, x1, 2, y1, y1, y1, y1, y1, 2, z1, z1, z1, z1, z1, 2, a2, a2, a2, a2, a2, 2, b2, b2, b2, b2, b2, 2, c2, c2, c2, c2, c2, 2, d2, d2, d2, d2, d2)
	start location:	f0
	leaf cost:	0

Slicing away variables that do not contribute to conditions from problem 1 leaves variables [].
We thus obtain the following problem:
2:	T:
		(1, 1)    f0() -> f75()
	start location:	f0
	leaf cost:	0

Complexity upper bound 1

Time: 0.000 sec (SMT: 0.000 sec)