/export/starexec/sandbox/solver/bin/starexec_run_FirstOrder /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES We consider the system theBenchmark. We are asked to determine termination of the following first-order TRS. 0 : [] --> o U11 : [o * o] --> o U21 : [o * o * o] --> o activate : [o] --> o and : [o * o] --> o isNat : [o] --> o n!6220!62200 : [] --> o n!6220!6220isNat : [o] --> o n!6220!6220plus : [o * o] --> o n!6220!6220s : [o] --> o plus : [o * o] --> o s : [o] --> o tt : [] --> o U11(tt, X) => activate(X) U21(tt, X, Y) => s(plus(activate(Y), activate(X))) and(tt, X) => activate(X) isNat(n!6220!62200) => tt isNat(n!6220!6220plus(X, Y)) => and(isNat(activate(X)), n!6220!6220isNat(activate(Y))) isNat(n!6220!6220s(X)) => isNat(activate(X)) plus(X, 0) => U11(isNat(X), X) plus(X, s(Y)) => U21(and(isNat(Y), n!6220!6220isNat(X)), Y, X) 0 => n!6220!62200 plus(X, Y) => n!6220!6220plus(X, Y) isNat(X) => n!6220!6220isNat(X) s(X) => n!6220!6220s(X) activate(n!6220!62200) => 0 activate(n!6220!6220plus(X, Y)) => plus(activate(X), activate(Y)) activate(n!6220!6220isNat(X)) => isNat(X) activate(n!6220!6220s(X)) => s(activate(X)) activate(X) => X We use rule removal, following [Kop12, Theorem 2.23]. This gives the following requirements (possibly using Theorems 2.25 and 2.26 in [Kop12]): U11(tt, X) >? activate(X) U21(tt, X, Y) >? s(plus(activate(Y), activate(X))) and(tt, X) >? activate(X) isNat(n!6220!62200) >? tt isNat(n!6220!6220plus(X, Y)) >? and(isNat(activate(X)), n!6220!6220isNat(activate(Y))) isNat(n!6220!6220s(X)) >? isNat(activate(X)) plus(X, 0) >? U11(isNat(X), X) plus(X, s(Y)) >? U21(and(isNat(Y), n!6220!6220isNat(X)), Y, X) 0 >? n!6220!62200 plus(X, Y) >? n!6220!6220plus(X, Y) isNat(X) >? n!6220!6220isNat(X) s(X) >? n!6220!6220s(X) activate(n!6220!62200) >? 0 activate(n!6220!6220plus(X, Y)) >? plus(activate(X), activate(Y)) activate(n!6220!6220isNat(X)) >? isNat(X) activate(n!6220!6220s(X)) >? s(activate(X)) activate(X) >? X about to try horpo We use a recursive path ordering as defined in [Kop12, Chapter 5]. Argument functions: [[0]] = _|_ [[U21(x_1, x_2, x_3)]] = U21(x_2, x_3, x_1) [[activate(x_1)]] = x_1 [[n!6220!62200]] = _|_ [[n!6220!6220plus(x_1, x_2)]] = n!6220!6220plus(x_2, x_1) [[plus(x_1, x_2)]] = plus(x_2, x_1) [[tt]] = _|_ We choose Lex = {U21, n!6220!6220plus, plus} and Mul = {U11, and, isNat, n!6220!6220isNat, n!6220!6220s, s}, and the following precedence: U21 = n!6220!6220plus = plus > U11 > and = isNat = n!6220!6220isNat > n!6220!6220s = s Taking the argument function into account, and fixing the greater / greater equal choices, the constraints can be denoted as follows: U11(_|_, X) >= X U21(_|_, X, Y) >= s(plus(Y, X)) and(_|_, X) >= X isNat(_|_) >= _|_ isNat(n!6220!6220plus(X, Y)) >= and(isNat(X), n!6220!6220isNat(Y)) isNat(n!6220!6220s(X)) >= isNat(X) plus(X, _|_) > U11(isNat(X), X) plus(X, s(Y)) >= U21(and(isNat(Y), n!6220!6220isNat(X)), Y, X) _|_ >= _|_ plus(X, Y) >= n!6220!6220plus(X, Y) isNat(X) >= n!6220!6220isNat(X) s(X) >= n!6220!6220s(X) _|_ >= _|_ n!6220!6220plus(X, Y) >= plus(X, Y) n!6220!6220isNat(X) >= isNat(X) n!6220!6220s(X) >= s(X) X >= X With these choices, we have: 1] U11(_|_, X) >= X because [2], by (Star) 2] U11*(_|_, X) >= X because [3], by (Select) 3] X >= X by (Meta) 4] U21(_|_, X, Y) >= s(plus(Y, X)) because [5], by (Star) 5] U21*(_|_, X, Y) >= s(plus(Y, X)) because U21 > s and [6], by (Copy) 6] U21*(_|_, X, Y) >= plus(Y, X) because U21 = plus, [7], [8], [9] and [10], by (Stat) 7] X >= X by (Meta) 8] Y >= Y by (Meta) 9] U21*(_|_, X, Y) >= Y because [8], by (Select) 10] U21*(_|_, X, Y) >= X because [7], by (Select) 11] and(_|_, X) >= X because [12], by (Star) 12] and*(_|_, X) >= X because [13], by (Select) 13] X >= X by (Meta) 14] isNat(_|_) >= _|_ by (Bot) 15] isNat(n!6220!6220plus(X, Y)) >= and(isNat(X), n!6220!6220isNat(Y)) because [16], by (Star) 16] isNat*(n!6220!6220plus(X, Y)) >= and(isNat(X), n!6220!6220isNat(Y)) because isNat = and, isNat in Mul, [17] and [21], by (Stat) 17] n!6220!6220plus(X, Y) > isNat(X) because [18], by definition 18] n!6220!6220plus*(X, Y) >= isNat(X) because n!6220!6220plus > isNat and [19], by (Copy) 19] n!6220!6220plus*(X, Y) >= X because [20], by (Select) 20] X >= X by (Meta) 21] n!6220!6220plus(X, Y) > n!6220!6220isNat(Y) because [22], by definition 22] n!6220!6220plus*(X, Y) >= n!6220!6220isNat(Y) because n!6220!6220plus > n!6220!6220isNat and [23], by (Copy) 23] n!6220!6220plus*(X, Y) >= Y because [24], by (Select) 24] Y >= Y by (Meta) 25] isNat(n!6220!6220s(X)) >= isNat(X) because isNat in Mul and [26], by (Fun) 26] n!6220!6220s(X) >= X because [27], by (Star) 27] n!6220!6220s*(X) >= X because [20], by (Select) 28] plus(X, _|_) > U11(isNat(X), X) because [29], by definition 29] plus*(X, _|_) >= U11(isNat(X), X) because plus > U11, [30] and [31], by (Copy) 30] plus*(X, _|_) >= isNat(X) because plus > isNat and [31], by (Copy) 31] plus*(X, _|_) >= X because [8], by (Select) 32] plus(X, s(Y)) >= U21(and(isNat(Y), n!6220!6220isNat(X)), Y, X) because [33], by (Star) 33] plus*(X, s(Y)) >= U21(and(isNat(Y), n!6220!6220isNat(X)), Y, X) because plus = U21, [34], [36], [38] and [41], by (Stat) 34] s(Y) > Y because [35], by definition 35] s*(Y) >= Y because [7], by (Select) 36] plus*(X, s(Y)) >= and(isNat(Y), n!6220!6220isNat(X)) because plus > and, [37] and [40], by (Copy) 37] plus*(X, s(Y)) >= isNat(Y) because plus > isNat and [38], by (Copy) 38] plus*(X, s(Y)) >= Y because [39], by (Select) 39] s(Y) >= Y because [35], by (Star) 40] plus*(X, s(Y)) >= n!6220!6220isNat(X) because plus > n!6220!6220isNat and [41], by (Copy) 41] plus*(X, s(Y)) >= X because [8], by (Select) 42] _|_ >= _|_ by (Bot) 43] plus(X, Y) >= n!6220!6220plus(X, Y) because plus = n!6220!6220plus, [44] and [45], by (Fun) 44] X >= X by (Meta) 45] Y >= Y by (Meta) 46] isNat(X) >= n!6220!6220isNat(X) because isNat = n!6220!6220isNat, isNat in Mul and [47], by (Fun) 47] X >= X by (Meta) 48] s(X) >= n!6220!6220s(X) because s = n!6220!6220s, s in Mul and [47], by (Fun) 49] _|_ >= _|_ by (Bot) 50] n!6220!6220plus(X, Y) >= plus(X, Y) because n!6220!6220plus = plus, [51] and [52], by (Fun) 51] X >= X by (Meta) 52] Y >= Y by (Meta) 53] n!6220!6220isNat(X) >= isNat(X) because n!6220!6220isNat = isNat, n!6220!6220isNat in Mul and [47], by (Fun) 54] n!6220!6220s(X) >= s(X) because n!6220!6220s = s, n!6220!6220s in Mul and [55], by (Fun) 55] X >= X by (Meta) 56] X >= X by (Meta) We can thus remove the following rules: plus(X, 0) => U11(isNat(X), X) We use rule removal, following [Kop12, Theorem 2.23]. This gives the following requirements (possibly using Theorems 2.25 and 2.26 in [Kop12]): U11(tt, X) >? activate(X) U21(tt, X, Y) >? s(plus(activate(Y), activate(X))) and(tt, X) >? activate(X) isNat(n!6220!62200) >? tt isNat(n!6220!6220plus(X, Y)) >? and(isNat(activate(X)), n!6220!6220isNat(activate(Y))) isNat(n!6220!6220s(X)) >? isNat(activate(X)) plus(X, s(Y)) >? U21(and(isNat(Y), n!6220!6220isNat(X)), Y, X) 0 >? n!6220!62200 plus(X, Y) >? n!6220!6220plus(X, Y) isNat(X) >? n!6220!6220isNat(X) s(X) >? n!6220!6220s(X) activate(n!6220!62200) >? 0 activate(n!6220!6220plus(X, Y)) >? plus(activate(X), activate(Y)) activate(n!6220!6220isNat(X)) >? isNat(X) activate(n!6220!6220s(X)) >? s(activate(X)) activate(X) >? X about to try horpo We use a recursive path ordering as defined in [Kop12, Chapter 5]. Argument functions: [[0]] = _|_ [[U21(x_1, x_2, x_3)]] = U21(x_2, x_3, x_1) [[activate(x_1)]] = x_1 [[n!6220!62200]] = _|_ [[n!6220!6220plus(x_1, x_2)]] = n!6220!6220plus(x_2, x_1) [[plus(x_1, x_2)]] = plus(x_2, x_1) [[tt]] = _|_ We choose Lex = {U21, n!6220!6220plus, plus} and Mul = {U11, and, isNat, n!6220!6220isNat, n!6220!6220s, s}, and the following precedence: U11 > U21 = n!6220!6220plus = plus > n!6220!6220s = s > and > isNat = n!6220!6220isNat Taking the argument function into account, and fixing the greater / greater equal choices, the constraints can be denoted as follows: U11(_|_, X) >= X U21(_|_, X, Y) >= s(plus(Y, X)) and(_|_, X) >= X isNat(_|_) > _|_ isNat(n!6220!6220plus(X, Y)) >= and(isNat(X), n!6220!6220isNat(Y)) isNat(n!6220!6220s(X)) >= isNat(X) plus(X, s(Y)) >= U21(and(isNat(Y), n!6220!6220isNat(X)), Y, X) _|_ >= _|_ plus(X, Y) >= n!6220!6220plus(X, Y) isNat(X) >= n!6220!6220isNat(X) s(X) >= n!6220!6220s(X) _|_ >= _|_ n!6220!6220plus(X, Y) >= plus(X, Y) n!6220!6220isNat(X) >= isNat(X) n!6220!6220s(X) >= s(X) X >= X With these choices, we have: 1] U11(_|_, X) >= X because [2], by (Star) 2] U11*(_|_, X) >= X because [3], by (Select) 3] X >= X by (Meta) 4] U21(_|_, X, Y) >= s(plus(Y, X)) because [5], by (Star) 5] U21*(_|_, X, Y) >= s(plus(Y, X)) because U21 > s and [6], by (Copy) 6] U21*(_|_, X, Y) >= plus(Y, X) because U21 = plus, [7], [8], [9] and [10], by (Stat) 7] X >= X by (Meta) 8] Y >= Y by (Meta) 9] U21*(_|_, X, Y) >= Y because [8], by (Select) 10] U21*(_|_, X, Y) >= X because [7], by (Select) 11] and(_|_, X) >= X because [12], by (Star) 12] and*(_|_, X) >= X because [13], by (Select) 13] X >= X by (Meta) 14] isNat(_|_) > _|_ because [15], by definition 15] isNat*(_|_) >= _|_ by (Bot) 16] isNat(n!6220!6220plus(X, Y)) >= and(isNat(X), n!6220!6220isNat(Y)) because [17], by (Star) 17] isNat*(n!6220!6220plus(X, Y)) >= and(isNat(X), n!6220!6220isNat(Y)) because [18], by (Select) 18] n!6220!6220plus(X, Y) >= and(isNat(X), n!6220!6220isNat(Y)) because [19], by (Star) 19] n!6220!6220plus*(X, Y) >= and(isNat(X), n!6220!6220isNat(Y)) because n!6220!6220plus > and, [20] and [23], by (Copy) 20] n!6220!6220plus*(X, Y) >= isNat(X) because n!6220!6220plus > isNat and [21], by (Copy) 21] n!6220!6220plus*(X, Y) >= X because [22], by (Select) 22] X >= X by (Meta) 23] n!6220!6220plus*(X, Y) >= n!6220!6220isNat(Y) because n!6220!6220plus > n!6220!6220isNat and [24], by (Copy) 24] n!6220!6220plus*(X, Y) >= Y because [25], by (Select) 25] Y >= Y by (Meta) 26] isNat(n!6220!6220s(X)) >= isNat(X) because [27], by (Star) 27] isNat*(n!6220!6220s(X)) >= isNat(X) because [28], by (Select) 28] n!6220!6220s(X) >= isNat(X) because [29], by (Star) 29] n!6220!6220s*(X) >= isNat(X) because n!6220!6220s > isNat and [30], by (Copy) 30] n!6220!6220s*(X) >= X because [22], by (Select) 31] plus(X, s(Y)) >= U21(and(isNat(Y), n!6220!6220isNat(X)), Y, X) because [32], by (Star) 32] plus*(X, s(Y)) >= U21(and(isNat(Y), n!6220!6220isNat(X)), Y, X) because plus = U21, [33], [35], [37] and [40], by (Stat) 33] s(Y) > Y because [34], by definition 34] s*(Y) >= Y because [7], by (Select) 35] plus*(X, s(Y)) >= and(isNat(Y), n!6220!6220isNat(X)) because plus > and, [36] and [39], by (Copy) 36] plus*(X, s(Y)) >= isNat(Y) because plus > isNat and [37], by (Copy) 37] plus*(X, s(Y)) >= Y because [38], by (Select) 38] s(Y) >= Y because [34], by (Star) 39] plus*(X, s(Y)) >= n!6220!6220isNat(X) because plus > n!6220!6220isNat and [40], by (Copy) 40] plus*(X, s(Y)) >= X because [8], by (Select) 41] _|_ >= _|_ by (Bot) 42] plus(X, Y) >= n!6220!6220plus(X, Y) because plus = n!6220!6220plus, [43] and [44], by (Fun) 43] X >= X by (Meta) 44] Y >= Y by (Meta) 45] isNat(X) >= n!6220!6220isNat(X) because isNat = n!6220!6220isNat, isNat in Mul and [46], by (Fun) 46] X >= X by (Meta) 47] s(X) >= n!6220!6220s(X) because s = n!6220!6220s, s in Mul and [46], by (Fun) 48] _|_ >= _|_ by (Bot) 49] n!6220!6220plus(X, Y) >= plus(X, Y) because n!6220!6220plus = plus, [50] and [51], by (Fun) 50] X >= X by (Meta) 51] Y >= Y by (Meta) 52] n!6220!6220isNat(X) >= isNat(X) because n!6220!6220isNat = isNat, n!6220!6220isNat in Mul and [46], by (Fun) 53] n!6220!6220s(X) >= s(X) because n!6220!6220s = s, n!6220!6220s in Mul and [54], by (Fun) 54] X >= X by (Meta) 55] X >= X by (Meta) We can thus remove the following rules: isNat(n!6220!62200) => tt We use rule removal, following [Kop12, Theorem 2.23]. This gives the following requirements (possibly using Theorems 2.25 and 2.26 in [Kop12]): U11(tt, X) >? activate(X) U21(tt, X, Y) >? s(plus(activate(Y), activate(X))) and(tt, X) >? activate(X) isNat(n!6220!6220plus(X, Y)) >? and(isNat(activate(X)), n!6220!6220isNat(activate(Y))) isNat(n!6220!6220s(X)) >? isNat(activate(X)) plus(X, s(Y)) >? U21(and(isNat(Y), n!6220!6220isNat(X)), Y, X) 0 >? n!6220!62200 plus(X, Y) >? n!6220!6220plus(X, Y) isNat(X) >? n!6220!6220isNat(X) s(X) >? n!6220!6220s(X) activate(n!6220!62200) >? 0 activate(n!6220!6220plus(X, Y)) >? plus(activate(X), activate(Y)) activate(n!6220!6220isNat(X)) >? isNat(X) activate(n!6220!6220s(X)) >? s(activate(X)) activate(X) >? X about to try horpo We use a recursive path ordering as defined in [Kop12, Chapter 5]. Argument functions: [[0]] = _|_ [[U21(x_1, x_2, x_3)]] = U21(x_2, x_3, x_1) [[activate(x_1)]] = x_1 [[n!6220!62200]] = _|_ [[n!6220!6220plus(x_1, x_2)]] = n!6220!6220plus(x_2, x_1) [[plus(x_1, x_2)]] = plus(x_2, x_1) We choose Lex = {U21, n!6220!6220plus, plus} and Mul = {U11, and, isNat, n!6220!6220isNat, n!6220!6220s, s, tt}, and the following precedence: U11 > U21 = n!6220!6220plus = plus > isNat = n!6220!6220isNat > and > n!6220!6220s = s > tt Taking the argument function into account, and fixing the greater / greater equal choices, the constraints can be denoted as follows: U11(tt, X) >= X U21(tt, X, Y) >= s(plus(Y, X)) and(tt, X) >= X isNat(n!6220!6220plus(X, Y)) > and(isNat(X), n!6220!6220isNat(Y)) isNat(n!6220!6220s(X)) >= isNat(X) plus(X, s(Y)) > U21(and(isNat(Y), n!6220!6220isNat(X)), Y, X) _|_ >= _|_ plus(X, Y) >= n!6220!6220plus(X, Y) isNat(X) >= n!6220!6220isNat(X) s(X) >= n!6220!6220s(X) _|_ >= _|_ n!6220!6220plus(X, Y) >= plus(X, Y) n!6220!6220isNat(X) >= isNat(X) n!6220!6220s(X) >= s(X) X >= X With these choices, we have: 1] U11(tt, X) >= X because [2], by (Star) 2] U11*(tt, X) >= X because [3], by (Select) 3] X >= X by (Meta) 4] U21(tt, X, Y) >= s(plus(Y, X)) because [5], by (Star) 5] U21*(tt, X, Y) >= s(plus(Y, X)) because U21 > s and [6], by (Copy) 6] U21*(tt, X, Y) >= plus(Y, X) because U21 = plus, [7], [8], [9] and [10], by (Stat) 7] X >= X by (Meta) 8] Y >= Y by (Meta) 9] U21*(tt, X, Y) >= Y because [8], by (Select) 10] U21*(tt, X, Y) >= X because [7], by (Select) 11] and(tt, X) >= X because [12], by (Star) 12] and*(tt, X) >= X because [13], by (Select) 13] X >= X by (Meta) 14] isNat(n!6220!6220plus(X, Y)) > and(isNat(X), n!6220!6220isNat(Y)) because [15], by definition 15] isNat*(n!6220!6220plus(X, Y)) >= and(isNat(X), n!6220!6220isNat(Y)) because isNat > and, [16] and [21], by (Copy) 16] isNat*(n!6220!6220plus(X, Y)) >= isNat(X) because [17], by (Select) 17] n!6220!6220plus(X, Y) >= isNat(X) because [18], by (Star) 18] n!6220!6220plus*(X, Y) >= isNat(X) because n!6220!6220plus > isNat and [19], by (Copy) 19] n!6220!6220plus*(X, Y) >= X because [20], by (Select) 20] X >= X by (Meta) 21] isNat*(n!6220!6220plus(X, Y)) >= n!6220!6220isNat(Y) because isNat = n!6220!6220isNat, isNat in Mul and [22], by (Stat) 22] n!6220!6220plus(X, Y) > Y because [23], by definition 23] n!6220!6220plus*(X, Y) >= Y because [24], by (Select) 24] Y >= Y by (Meta) 25] isNat(n!6220!6220s(X)) >= isNat(X) because isNat in Mul and [26], by (Fun) 26] n!6220!6220s(X) >= X because [27], by (Star) 27] n!6220!6220s*(X) >= X because [20], by (Select) 28] plus(X, s(Y)) > U21(and(isNat(Y), n!6220!6220isNat(X)), Y, X) because [29], by definition 29] plus*(X, s(Y)) >= U21(and(isNat(Y), n!6220!6220isNat(X)), Y, X) because plus = U21, [30], [32], [34] and [37], by (Stat) 30] s(Y) > Y because [31], by definition 31] s*(Y) >= Y because [7], by (Select) 32] plus*(X, s(Y)) >= and(isNat(Y), n!6220!6220isNat(X)) because plus > and, [33] and [36], by (Copy) 33] plus*(X, s(Y)) >= isNat(Y) because plus > isNat and [34], by (Copy) 34] plus*(X, s(Y)) >= Y because [35], by (Select) 35] s(Y) >= Y because [31], by (Star) 36] plus*(X, s(Y)) >= n!6220!6220isNat(X) because plus > n!6220!6220isNat and [37], by (Copy) 37] plus*(X, s(Y)) >= X because [8], by (Select) 38] _|_ >= _|_ by (Bot) 39] plus(X, Y) >= n!6220!6220plus(X, Y) because plus = n!6220!6220plus, [40] and [41], by (Fun) 40] X >= X by (Meta) 41] Y >= Y by (Meta) 42] isNat(X) >= n!6220!6220isNat(X) because isNat = n!6220!6220isNat, isNat in Mul and [43], by (Fun) 43] X >= X by (Meta) 44] s(X) >= n!6220!6220s(X) because s = n!6220!6220s, s in Mul and [43], by (Fun) 45] _|_ >= _|_ by (Bot) 46] n!6220!6220plus(X, Y) >= plus(X, Y) because n!6220!6220plus = plus, [47] and [48], by (Fun) 47] X >= X by (Meta) 48] Y >= Y by (Meta) 49] n!6220!6220isNat(X) >= isNat(X) because n!6220!6220isNat = isNat, n!6220!6220isNat in Mul and [43], by (Fun) 50] n!6220!6220s(X) >= s(X) because n!6220!6220s = s, n!6220!6220s in Mul and [51], by (Fun) 51] X >= X by (Meta) 52] X >= X by (Meta) We can thus remove the following rules: isNat(n!6220!6220plus(X, Y)) => and(isNat(activate(X)), n!6220!6220isNat(activate(Y))) plus(X, s(Y)) => U21(and(isNat(Y), n!6220!6220isNat(X)), Y, X) We use rule removal, following [Kop12, Theorem 2.23]. This gives the following requirements (possibly using Theorems 2.25 and 2.26 in [Kop12]): U11(tt, X) >? activate(X) U21(tt, X, Y) >? s(plus(activate(Y), activate(X))) and(tt, X) >? activate(X) isNat(n!6220!6220s(X)) >? isNat(activate(X)) 0 >? n!6220!62200 plus(X, Y) >? n!6220!6220plus(X, Y) isNat(X) >? n!6220!6220isNat(X) s(X) >? n!6220!6220s(X) activate(n!6220!62200) >? 0 activate(n!6220!6220plus(X, Y)) >? plus(activate(X), activate(Y)) activate(n!6220!6220isNat(X)) >? isNat(X) activate(n!6220!6220s(X)) >? s(activate(X)) activate(X) >? X We orient these requirements with a polynomial interpretation in the natural numbers. The following interpretation satisfies the requirements: 0 = 0 U11 = \y0y1.3 + 3y0 + 3y1 U21 = \y0y1y2.3 + 3y0 + 3y1 + 3y2 activate = \y0.y0 and = \y0y1.3 + 3y0 + 3y1 isNat = \y0.y0 n!6220!62200 = 0 n!6220!6220isNat = \y0.y0 n!6220!6220plus = \y0y1.2y0 + 2y1 n!6220!6220s = \y0.y0 plus = \y0y1.2y0 + 2y1 s = \y0.y0 tt = 3 Using this interpretation, the requirements translate to: [[U11(tt, _x0)]] = 12 + 3x0 > x0 = [[activate(_x0)]] [[U21(tt, _x0, _x1)]] = 12 + 3x0 + 3x1 > 2x0 + 2x1 = [[s(plus(activate(_x1), activate(_x0)))]] [[and(tt, _x0)]] = 12 + 3x0 > x0 = [[activate(_x0)]] [[isNat(n!6220!6220s(_x0))]] = x0 >= x0 = [[isNat(activate(_x0))]] [[0]] = 0 >= 0 = [[n!6220!62200]] [[plus(_x0, _x1)]] = 2x0 + 2x1 >= 2x0 + 2x1 = [[n!6220!6220plus(_x0, _x1)]] [[isNat(_x0)]] = x0 >= x0 = [[n!6220!6220isNat(_x0)]] [[s(_x0)]] = x0 >= x0 = [[n!6220!6220s(_x0)]] [[activate(n!6220!62200)]] = 0 >= 0 = [[0]] [[activate(n!6220!6220plus(_x0, _x1))]] = 2x0 + 2x1 >= 2x0 + 2x1 = [[plus(activate(_x0), activate(_x1))]] [[activate(n!6220!6220isNat(_x0))]] = x0 >= x0 = [[isNat(_x0)]] [[activate(n!6220!6220s(_x0))]] = x0 >= x0 = [[s(activate(_x0))]] [[activate(_x0)]] = x0 >= x0 = [[_x0]] We can thus remove the following rules: U11(tt, X) => activate(X) U21(tt, X, Y) => s(plus(activate(Y), activate(X))) and(tt, X) => activate(X) We use rule removal, following [Kop12, Theorem 2.23]. This gives the following requirements (possibly using Theorems 2.25 and 2.26 in [Kop12]): isNat(n!6220!6220s(X)) >? isNat(activate(X)) 0 >? n!6220!62200 plus(X, Y) >? n!6220!6220plus(X, Y) isNat(X) >? n!6220!6220isNat(X) s(X) >? n!6220!6220s(X) activate(n!6220!62200) >? 0 activate(n!6220!6220plus(X, Y)) >? plus(activate(X), activate(Y)) activate(n!6220!6220isNat(X)) >? isNat(X) activate(n!6220!6220s(X)) >? s(activate(X)) activate(X) >? X We orient these requirements with a polynomial interpretation in the natural numbers. The following interpretation satisfies the requirements: 0 = 0 activate = \y0.2y0 isNat = \y0.y0 n!6220!62200 = 0 n!6220!6220isNat = \y0.y0 n!6220!6220plus = \y0y1.y0 + y1 n!6220!6220s = \y0.3 + 2y0 plus = \y0y1.y0 + y1 s = \y0.3 + 2y0 Using this interpretation, the requirements translate to: [[isNat(n!6220!6220s(_x0))]] = 3 + 2x0 > 2x0 = [[isNat(activate(_x0))]] [[0]] = 0 >= 0 = [[n!6220!62200]] [[plus(_x0, _x1)]] = x0 + x1 >= x0 + x1 = [[n!6220!6220plus(_x0, _x1)]] [[isNat(_x0)]] = x0 >= x0 = [[n!6220!6220isNat(_x0)]] [[s(_x0)]] = 3 + 2x0 >= 3 + 2x0 = [[n!6220!6220s(_x0)]] [[activate(n!6220!62200)]] = 0 >= 0 = [[0]] [[activate(n!6220!6220plus(_x0, _x1))]] = 2x0 + 2x1 >= 2x0 + 2x1 = [[plus(activate(_x0), activate(_x1))]] [[activate(n!6220!6220isNat(_x0))]] = 2x0 >= x0 = [[isNat(_x0)]] [[activate(n!6220!6220s(_x0))]] = 6 + 4x0 > 3 + 4x0 = [[s(activate(_x0))]] [[activate(_x0)]] = 2x0 >= x0 = [[_x0]] We can thus remove the following rules: isNat(n!6220!6220s(X)) => isNat(activate(X)) activate(n!6220!6220s(X)) => s(activate(X)) We use rule removal, following [Kop12, Theorem 2.23]. This gives the following requirements (possibly using Theorems 2.25 and 2.26 in [Kop12]): 0 >? n!6220!62200 plus(X, Y) >? n!6220!6220plus(X, Y) isNat(X) >? n!6220!6220isNat(X) s(X) >? n!6220!6220s(X) activate(n!6220!62200) >? 0 activate(n!6220!6220plus(X, Y)) >? plus(activate(X), activate(Y)) activate(n!6220!6220isNat(X)) >? isNat(X) activate(X) >? X We orient these requirements with a polynomial interpretation in the natural numbers. The following interpretation satisfies the requirements: 0 = 0 activate = \y0.y0 isNat = \y0.1 + y0 n!6220!62200 = 0 n!6220!6220isNat = \y0.1 + y0 n!6220!6220plus = \y0y1.2y0 + 2y1 n!6220!6220s = \y0.y0 plus = \y0y1.2y0 + 2y1 s = \y0.3 + 3y0 Using this interpretation, the requirements translate to: [[0]] = 0 >= 0 = [[n!6220!62200]] [[plus(_x0, _x1)]] = 2x0 + 2x1 >= 2x0 + 2x1 = [[n!6220!6220plus(_x0, _x1)]] [[isNat(_x0)]] = 1 + x0 >= 1 + x0 = [[n!6220!6220isNat(_x0)]] [[s(_x0)]] = 3 + 3x0 > x0 = [[n!6220!6220s(_x0)]] [[activate(n!6220!62200)]] = 0 >= 0 = [[0]] [[activate(n!6220!6220plus(_x0, _x1))]] = 2x0 + 2x1 >= 2x0 + 2x1 = [[plus(activate(_x0), activate(_x1))]] [[activate(n!6220!6220isNat(_x0))]] = 1 + x0 >= 1 + x0 = [[isNat(_x0)]] [[activate(_x0)]] = x0 >= x0 = [[_x0]] We can thus remove the following rules: s(X) => n!6220!6220s(X) We use rule removal, following [Kop12, Theorem 2.23]. This gives the following requirements (possibly using Theorems 2.25 and 2.26 in [Kop12]): 0 >? n!6220!62200 plus(X, Y) >? n!6220!6220plus(X, Y) isNat(X) >? n!6220!6220isNat(X) activate(n!6220!62200) >? 0 activate(n!6220!6220plus(X, Y)) >? plus(activate(X), activate(Y)) activate(n!6220!6220isNat(X)) >? isNat(X) activate(X) >? X We orient these requirements with a polynomial interpretation in the natural numbers. The following interpretation satisfies the requirements: 0 = 0 activate = \y0.2y0 isNat = \y0.2 + 2y0 n!6220!62200 = 0 n!6220!6220isNat = \y0.1 + 2y0 n!6220!6220plus = \y0y1.2y0 + 2y1 plus = \y0y1.2y0 + 2y1 Using this interpretation, the requirements translate to: [[0]] = 0 >= 0 = [[n!6220!62200]] [[plus(_x0, _x1)]] = 2x0 + 2x1 >= 2x0 + 2x1 = [[n!6220!6220plus(_x0, _x1)]] [[isNat(_x0)]] = 2 + 2x0 > 1 + 2x0 = [[n!6220!6220isNat(_x0)]] [[activate(n!6220!62200)]] = 0 >= 0 = [[0]] [[activate(n!6220!6220plus(_x0, _x1))]] = 4x0 + 4x1 >= 4x0 + 4x1 = [[plus(activate(_x0), activate(_x1))]] [[activate(n!6220!6220isNat(_x0))]] = 2 + 4x0 >= 2 + 2x0 = [[isNat(_x0)]] [[activate(_x0)]] = 2x0 >= x0 = [[_x0]] We can thus remove the following rules: isNat(X) => n!6220!6220isNat(X) We use rule removal, following [Kop12, Theorem 2.23]. This gives the following requirements (possibly using Theorems 2.25 and 2.26 in [Kop12]): 0 >? n!6220!62200 plus(X, Y) >? n!6220!6220plus(X, Y) activate(n!6220!62200) >? 0 activate(n!6220!6220plus(X, Y)) >? plus(activate(X), activate(Y)) activate(n!6220!6220isNat(X)) >? isNat(X) activate(X) >? X We orient these requirements with a polynomial interpretation in the natural numbers. The following interpretation satisfies the requirements: 0 = 0 activate = \y0.2y0 isNat = \y0.y0 n!6220!62200 = 0 n!6220!6220isNat = \y0.3 + 3y0 n!6220!6220plus = \y0y1.2 + y0 + 2y1 plus = \y0y1.3 + y0 + 2y1 Using this interpretation, the requirements translate to: [[0]] = 0 >= 0 = [[n!6220!62200]] [[plus(_x0, _x1)]] = 3 + x0 + 2x1 > 2 + x0 + 2x1 = [[n!6220!6220plus(_x0, _x1)]] [[activate(n!6220!62200)]] = 0 >= 0 = [[0]] [[activate(n!6220!6220plus(_x0, _x1))]] = 4 + 2x0 + 4x1 > 3 + 2x0 + 4x1 = [[plus(activate(_x0), activate(_x1))]] [[activate(n!6220!6220isNat(_x0))]] = 6 + 6x0 > x0 = [[isNat(_x0)]] [[activate(_x0)]] = 2x0 >= x0 = [[_x0]] We can thus remove the following rules: plus(X, Y) => n!6220!6220plus(X, Y) activate(n!6220!6220plus(X, Y)) => plus(activate(X), activate(Y)) activate(n!6220!6220isNat(X)) => isNat(X) We use rule removal, following [Kop12, Theorem 2.23]. This gives the following requirements (possibly using Theorems 2.25 and 2.26 in [Kop12]): 0 >? n!6220!62200 activate(n!6220!62200) >? 0 activate(X) >? X We orient these requirements with a polynomial interpretation in the natural numbers. The following interpretation satisfies the requirements: 0 = 3 activate = \y0.3 + 3y0 n!6220!62200 = 1 Using this interpretation, the requirements translate to: [[0]] = 3 > 1 = [[n!6220!62200]] [[activate(n!6220!62200)]] = 6 > 3 = [[0]] [[activate(_x0)]] = 3 + 3x0 > x0 = [[_x0]] We can thus remove the following rules: 0 => n!6220!62200 activate(n!6220!62200) => 0 activate(X) => X All rules were succesfully removed. Thus, termination of the original system has been reduced to termination of the beta-rule, which is well-known to hold. +++ Citations +++ [Kop12] C. Kop. Higher Order Termination. PhD Thesis, 2012.