- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) [2] a____(X,nil) -> mark(X) [3] a____(nil,X) -> mark(X) [4] a__U11(tt) -> tt [5] a__U21(tt,V2) -> a__U22(a__isList(V2)) [6] a__U22(tt) -> tt [7] a__U31(tt) -> tt [8] a__U41(tt,V2) -> a__U42(a__isNeList(V2)) [9] a__U42(tt) -> tt [10] a__U51(tt,V2) -> a__U52(a__isList(V2)) [11] a__U52(tt) -> tt [12] a__U61(tt) -> tt [13] a__U71(tt,P) -> a__U72(a__isPal(P)) [14] a__U72(tt) -> tt [15] a__U81(tt) -> tt [16] a__isList(V) -> a__U11(a__isNeList(V)) [17] a__isList(nil) -> tt [18] a__isList(__(V1,V2)) -> a__U21(a__isList(V1),V2) [19] a__isNeList(V) -> a__U31(a__isQid(V)) [20] a__isNeList(__(V1,V2)) -> a__U41(a__isList(V1),V2) [21] a__isNeList(__(V1,V2)) -> a__U51(a__isNeList(V1),V2) [22] a__isNePal(V) -> a__U61(a__isQid(V)) [23] a__isNePal(__(I,__(P,I))) -> a__U71(a__isQid(I),P) [24] a__isPal(V) -> a__U81(a__isNePal(V)) [25] a__isPal(nil) -> tt [26] a__isQid(a) -> tt [27] a__isQid(e) -> tt [28] a__isQid(i) -> tt [29] a__isQid(o) -> tt [30] a__isQid(u) -> tt [31] mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) [32] mark(U11(X)) -> a__U11(mark(X)) [33] mark(U21(X1,X2)) -> a__U21(mark(X1),X2) [34] mark(U22(X)) -> a__U22(mark(X)) [35] mark(isList(X)) -> a__isList(X) [36] mark(U31(X)) -> a__U31(mark(X)) [37] mark(U41(X1,X2)) -> a__U41(mark(X1),X2) [38] mark(U42(X)) -> a__U42(mark(X)) [39] mark(isNeList(X)) -> a__isNeList(X) [40] mark(U51(X1,X2)) -> a__U51(mark(X1),X2) [41] mark(U52(X)) -> a__U52(mark(X)) [42] mark(U61(X)) -> a__U61(mark(X)) [43] mark(U71(X1,X2)) -> a__U71(mark(X1),X2) [44] mark(U72(X)) -> a__U72(mark(X)) [45] mark(isPal(X)) -> a__isPal(X) [46] mark(U81(X)) -> a__U81(mark(X)) [47] mark(isQid(X)) -> a__isQid(X) [48] mark(isNePal(X)) -> a__isNePal(X) [49] mark(nil) -> nil [50] mark(tt) -> tt [51] mark(a) -> a [52] mark(e) -> e [53] mark(i) -> i [54] mark(o) -> o [55] mark(u) -> u [56] a____(X1,X2) -> __(X1,X2) [57] a__U11(X) -> U11(X) [58] a__U21(X1,X2) -> U21(X1,X2) [59] a__U22(X) -> U22(X) [60] a__isList(X) -> isList(X) [61] a__U31(X) -> U31(X) [62] a__U41(X1,X2) -> U41(X1,X2) [63] a__U42(X) -> U42(X) [64] a__isNeList(X) -> isNeList(X) [65] a__U51(X1,X2) -> U51(X1,X2) [66] a__U52(X) -> U52(X) [67] a__U61(X) -> U61(X) [68] a__U71(X1,X2) -> U71(X1,X2) [69] a__U72(X) -> U72(X) [70] a__isPal(X) -> isPal(X) [71] a__U81(X) -> U81(X) [72] a__isQid(X) -> isQid(X) [73] a__isNePal(X) -> isNePal(X) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 3 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) ; a____(nil,X) >= mark(X) ; a____(X,nil) >= mark(X) ; a____(X1,X2) >= __(X1,X2) ; mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) ; mark(nil) >= nil ; mark(tt) >= tt ; mark(a) >= a ; mark(e) >= e ; mark(i) >= i ; mark(o) >= o ; mark(u) >= u ; mark(U11(X)) >= a__U11(mark(X)) ; mark(U21(X1,X2)) >= a__U21(mark(X1),X2) ; mark(U22(X)) >= a__U22(mark(X)) ; mark(isList(X)) >= a__isList(X) ; mark(U31(X)) >= a__U31(mark(X)) ; mark(U41(X1,X2)) >= a__U41(mark(X1),X2) ; mark(U42(X)) >= a__U42(mark(X)) ; mark(isNeList(X)) >= a__isNeList(X) ; mark(U51(X1,X2)) >= a__U51(mark(X1),X2) ; mark(U52(X)) >= a__U52(mark(X)) ; mark(U61(X)) >= a__U61(mark(X)) ; mark(U71(X1,X2)) >= a__U71(mark(X1),X2) ; mark(U72(X)) >= a__U72(mark(X)) ; mark(isPal(X)) >= a__isPal(X) ; mark(U81(X)) >= a__U81(mark(X)) ; mark(isQid(X)) >= a__isQid(X) ; mark(isNePal(X)) >= a__isNePal(X) ; a__U11(tt) >= tt ; a__U11(X) >= U11(X) ; a__U22(tt) >= tt ; a__U22(X) >= U22(X) ; a__isList(__(V1,V2)) >= a__U21(a__isList(V1),V2) ; a__isList(nil) >= tt ; a__isList(X) >= isList(X) ; a__isList(V) >= a__U11(a__isNeList(V)) ; a__U21(tt,V2) >= a__U22(a__isList(V2)) ; a__U21(X1,X2) >= U21(X1,X2) ; a__U31(tt) >= tt ; a__U31(X) >= U31(X) ; a__U42(tt) >= tt ; a__U42(X) >= U42(X) ; a__isNeList(__(V1,V2)) >= a__U41(a__isList(V1),V2) ; a__isNeList(__(V1,V2)) >= a__U51(a__isNeList(V1),V2) ; a__isNeList(X) >= isNeList(X) ; a__isNeList(V) >= a__U31(a__isQid(V)) ; a__U41(tt,V2) >= a__U42(a__isNeList(V2)) ; a__U41(X1,X2) >= U41(X1,X2) ; a__U52(tt) >= tt ; a__U52(X) >= U52(X) ; a__U51(tt,V2) >= a__U52(a__isList(V2)) ; a__U51(X1,X2) >= U51(X1,X2) ; a__U61(tt) >= tt ; a__U61(X) >= U61(X) ; a__U72(tt) >= tt ; a__U72(X) >= U72(X) ; a__isPal(nil) >= tt ; a__isPal(X) >= isPal(X) ; a__isPal(V) >= a__U81(a__isNePal(V)) ; a__U71(tt,P) >= a__U72(a__isPal(P)) ; a__U71(X1,X2) >= U71(X1,X2) ; a__U81(tt) >= tt ; a__U81(X) >= U81(X) ; a__isQid(a) >= tt ; a__isQid(e) >= tt ; a__isQid(i) >= tt ; a__isQid(o) >= tt ; a__isQid(u) >= tt ; a__isQid(X) >= isQid(X) ; a__isNePal(__(I,__(P,I))) >= a__U71(a__isQid(I),P) ; a__isNePal(X) >= isNePal(X) ; a__isNePal(V) >= a__U61(a__isQid(V)) ; Marked_a____(__(X,Y),Z) >= Marked_a____(mark(X),a____(mark(Y),mark(Z))) ; Marked_a____(__(X,Y),Z) >= Marked_a____(mark(Y),mark(Z)) ; Marked_a____(__(X,Y),Z) >= Marked_mark(X) ; Marked_a____(__(X,Y),Z) >= Marked_mark(Y) ; Marked_a____(__(X,Y),Z) >= Marked_mark(Z) ; Marked_a____(nil,X) >= Marked_mark(X) ; Marked_a____(X,nil) >= Marked_mark(X) ; Marked_mark(__(X1,X2)) >= Marked_a____(mark(X1),mark(X2)) ; Marked_mark(__(X1,X2)) >= Marked_mark(X1) ; Marked_mark(__(X1,X2)) >= Marked_mark(X2) ; Marked_mark(U11(X)) >= Marked_mark(X) ; Marked_mark(U21(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U22(X)) >= Marked_mark(X) ; Marked_mark(U31(X)) >= Marked_mark(X) ; Marked_mark(U41(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U42(X)) >= Marked_mark(X) ; Marked_mark(U51(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U52(X)) >= Marked_mark(X) ; Marked_mark(U61(X)) >= Marked_mark(X) ; Marked_mark(U71(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U72(X)) >= Marked_mark(X) ; Marked_mark(U81(X)) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_a____(__(X,Y),Z) > Marked_a____(mark(X),a____(mark(Y),mark(Z))) ; } { Marked_a____(__(X,Y),Z) > Marked_a____(mark(Y),mark(Z)) ; } { Marked_a____(__(X,Y),Z) > Marked_mark(X) ; } { Marked_a____(__(X,Y),Z) > Marked_mark(Y) ; } { Marked_a____(__(X,Y),Z) > Marked_mark(Z) ; } { Marked_a____(nil,X) > Marked_mark(X) ; } { Marked_a____(X,nil) > Marked_mark(X) ; } { Marked_mark(__(X1,X2)) > Marked_a____(mark(X1),mark(X2)) ; } { Marked_mark(__(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(__(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(U11(X)) > Marked_mark(X) ; } { Marked_mark(U21(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U22(X)) > Marked_mark(X) ; } { Marked_mark(U31(X)) > Marked_mark(X) ; } { Marked_mark(U41(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U42(X)) > Marked_mark(X) ; } { Marked_mark(U51(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U52(X)) > Marked_mark(X) ; } { Marked_mark(U61(X)) > Marked_mark(X) ; } { Marked_mark(U71(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U72(X)) > Marked_mark(X) ; } { Marked_mark(U81(X)) > Marked_mark(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) constraint: a____(nil,X) >= mark(X) constraint: a____(X,nil) >= mark(X) constraint: a____(X1,X2) >= __(X1,X2) constraint: mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) constraint: mark(nil) >= nil constraint: mark(tt) >= tt constraint: mark(a) >= a constraint: mark(e) >= e constraint: mark(i) >= i constraint: mark(o) >= o constraint: mark(u) >= u constraint: mark(U11(X)) >= a__U11(mark(X)) constraint: mark(U21(X1,X2)) >= a__U21(mark(X1),X2) constraint: mark(U22(X)) >= a__U22(mark(X)) constraint: mark(isList(X)) >= a__isList(X) constraint: mark(U31(X)) >= a__U31(mark(X)) constraint: mark(U41(X1,X2)) >= a__U41(mark(X1),X2) constraint: mark(U42(X)) >= a__U42(mark(X)) constraint: mark(isNeList(X)) >= a__isNeList(X) constraint: mark(U51(X1,X2)) >= a__U51(mark(X1),X2) constraint: mark(U52(X)) >= a__U52(mark(X)) constraint: mark(U61(X)) >= a__U61(mark(X)) constraint: mark(U71(X1,X2)) >= a__U71(mark(X1),X2) constraint: mark(U72(X)) >= a__U72(mark(X)) constraint: mark(isPal(X)) >= a__isPal(X) constraint: mark(U81(X)) >= a__U81(mark(X)) constraint: mark(isQid(X)) >= a__isQid(X) constraint: mark(isNePal(X)) >= a__isNePal(X) constraint: a__U11(tt) >= tt constraint: a__U11(X) >= U11(X) constraint: a__U22(tt) >= tt constraint: a__U22(X) >= U22(X) constraint: a__isList(__(V1,V2)) >= a__U21(a__isList(V1),V2) constraint: a__isList(nil) >= tt constraint: a__isList(X) >= isList(X) constraint: a__isList(V) >= a__U11(a__isNeList(V)) constraint: a__U21(tt,V2) >= a__U22(a__isList(V2)) constraint: a__U21(X1,X2) >= U21(X1,X2) constraint: a__U31(tt) >= tt constraint: a__U31(X) >= U31(X) constraint: a__U42(tt) >= tt constraint: a__U42(X) >= U42(X) constraint: a__isNeList(__(V1,V2)) >= a__U41(a__isList(V1),V2) constraint: a__isNeList(__(V1,V2)) >= a__U51(a__isNeList(V1),V2) constraint: a__isNeList(X) >= isNeList(X) constraint: a__isNeList(V) >= a__U31(a__isQid(V)) constraint: a__U41(tt,V2) >= a__U42(a__isNeList(V2)) constraint: a__U41(X1,X2) >= U41(X1,X2) constraint: a__U52(tt) >= tt constraint: a__U52(X) >= U52(X) constraint: a__U51(tt,V2) >= a__U52(a__isList(V2)) constraint: a__U51(X1,X2) >= U51(X1,X2) constraint: a__U61(tt) >= tt constraint: a__U61(X) >= U61(X) constraint: a__U72(tt) >= tt constraint: a__U72(X) >= U72(X) constraint: a__isPal(nil) >= tt constraint: a__isPal(X) >= isPal(X) constraint: a__isPal(V) >= a__U81(a__isNePal(V)) constraint: a__U71(tt,P) >= a__U72(a__isPal(P)) constraint: a__U71(X1,X2) >= U71(X1,X2) constraint: a__U81(tt) >= tt constraint: a__U81(X) >= U81(X) constraint: a__isQid(a) >= tt constraint: a__isQid(e) >= tt constraint: a__isQid(i) >= tt constraint: a__isQid(o) >= tt constraint: a__isQid(u) >= tt constraint: a__isQid(X) >= isQid(X) constraint: a__isNePal(__(I,__(P,I))) >= a__U71(a__isQid(I),P) constraint: a__isNePal(X) >= isNePal(X) constraint: a__isNePal(V) >= a__U61(a__isQid(V)) constraint: Marked_a____(__(X,Y),Z) >= Marked_a____(mark(X), a____(mark(Y),mark(Z))) constraint: Marked_a____(__(X,Y),Z) >= Marked_a____(mark(Y),mark(Z)) constraint: Marked_a____(__(X,Y),Z) >= Marked_mark(X) constraint: Marked_a____(__(X,Y),Z) >= Marked_mark(Y) constraint: Marked_a____(__(X,Y),Z) >= Marked_mark(Z) constraint: Marked_a____(nil,X) >= Marked_mark(X) constraint: Marked_a____(X,nil) >= Marked_mark(X) constraint: Marked_mark(__(X1,X2)) >= Marked_a____(mark(X1),mark(X2)) constraint: Marked_mark(__(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(__(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(U11(X)) >= Marked_mark(X) constraint: Marked_mark(U21(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U22(X)) >= Marked_mark(X) constraint: Marked_mark(U31(X)) >= Marked_mark(X) constraint: Marked_mark(U41(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U42(X)) >= Marked_mark(X) constraint: Marked_mark(U51(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U52(X)) >= Marked_mark(X) constraint: Marked_mark(U61(X)) >= Marked_mark(X) constraint: Marked_mark(U71(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U72(X)) >= Marked_mark(X) constraint: Marked_mark(U81(X)) >= Marked_mark(X) APPLY CRITERIA (Subterm criterion) ST: Marked_a__U51 -> 2 Marked_a__isNeList -> 1 Marked_a__U41 -> 2 Marked_a__isList -> 1 Marked_a__U21 -> 2 APPLY CRITERIA (Subterm criterion) ST: Marked_a__isNePal -> 1 Marked_a__isPal -> 1 Marked_a__U71 -> 2 APPLY CRITERIA (Graph splitting) Found 2 components: { --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) ; a____(nil,X) >= mark(X) ; a____(X,nil) >= mark(X) ; a____(X1,X2) >= __(X1,X2) ; mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) ; mark(nil) >= nil ; mark(tt) >= tt ; mark(a) >= a ; mark(e) >= e ; mark(i) >= i ; mark(o) >= o ; mark(u) >= u ; mark(U11(X)) >= a__U11(mark(X)) ; mark(U21(X1,X2)) >= a__U21(mark(X1),X2) ; mark(U22(X)) >= a__U22(mark(X)) ; mark(isList(X)) >= a__isList(X) ; mark(U31(X)) >= a__U31(mark(X)) ; mark(U41(X1,X2)) >= a__U41(mark(X1),X2) ; mark(U42(X)) >= a__U42(mark(X)) ; mark(isNeList(X)) >= a__isNeList(X) ; mark(U51(X1,X2)) >= a__U51(mark(X1),X2) ; mark(U52(X)) >= a__U52(mark(X)) ; mark(U61(X)) >= a__U61(mark(X)) ; mark(U71(X1,X2)) >= a__U71(mark(X1),X2) ; mark(U72(X)) >= a__U72(mark(X)) ; mark(isPal(X)) >= a__isPal(X) ; mark(U81(X)) >= a__U81(mark(X)) ; mark(isQid(X)) >= a__isQid(X) ; mark(isNePal(X)) >= a__isNePal(X) ; a__U11(tt) >= tt ; a__U11(X) >= U11(X) ; a__U22(tt) >= tt ; a__U22(X) >= U22(X) ; a__isList(__(V1,V2)) >= a__U21(a__isList(V1),V2) ; a__isList(nil) >= tt ; a__isList(X) >= isList(X) ; a__isList(V) >= a__U11(a__isNeList(V)) ; a__U21(tt,V2) >= a__U22(a__isList(V2)) ; a__U21(X1,X2) >= U21(X1,X2) ; a__U31(tt) >= tt ; a__U31(X) >= U31(X) ; a__U42(tt) >= tt ; a__U42(X) >= U42(X) ; a__isNeList(__(V1,V2)) >= a__U41(a__isList(V1),V2) ; a__isNeList(__(V1,V2)) >= a__U51(a__isNeList(V1),V2) ; a__isNeList(X) >= isNeList(X) ; a__isNeList(V) >= a__U31(a__isQid(V)) ; a__U41(tt,V2) >= a__U42(a__isNeList(V2)) ; a__U41(X1,X2) >= U41(X1,X2) ; a__U52(tt) >= tt ; a__U52(X) >= U52(X) ; a__U51(tt,V2) >= a__U52(a__isList(V2)) ; a__U51(X1,X2) >= U51(X1,X2) ; a__U61(tt) >= tt ; a__U61(X) >= U61(X) ; a__U72(tt) >= tt ; a__U72(X) >= U72(X) ; a__isPal(nil) >= tt ; a__isPal(X) >= isPal(X) ; a__isPal(V) >= a__U81(a__isNePal(V)) ; a__U71(tt,P) >= a__U72(a__isPal(P)) ; a__U71(X1,X2) >= U71(X1,X2) ; a__U81(tt) >= tt ; a__U81(X) >= U81(X) ; a__isQid(a) >= tt ; a__isQid(e) >= tt ; a__isQid(i) >= tt ; a__isQid(o) >= tt ; a__isQid(u) >= tt ; a__isQid(X) >= isQid(X) ; a__isNePal(__(I,__(P,I))) >= a__U71(a__isQid(I),P) ; a__isNePal(X) >= isNePal(X) ; a__isNePal(V) >= a__U61(a__isQid(V)) ; Marked_a____(__(X,Y),Z) >= Marked_a____(mark(X),a____(mark(Y),mark(Z))) ; } + Disjunctions:{ { Marked_a____(__(X,Y),Z) > Marked_a____(mark(X),a____(mark(Y),mark(Z))) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a____(__(X,Y),Z) >= a____(mark(X),a____(mark(Y),mark(Z))) constraint: a____(nil,X) >= mark(X) constraint: a____(X,nil) >= mark(X) constraint: a____(X1,X2) >= __(X1,X2) constraint: mark(__(X1,X2)) >= a____(mark(X1),mark(X2)) constraint: mark(nil) >= nil constraint: mark(tt) >= tt constraint: mark(a) >= a constraint: mark(e) >= e constraint: mark(i) >= i constraint: mark(o) >= o constraint: mark(u) >= u constraint: mark(U11(X)) >= a__U11(mark(X)) constraint: mark(U21(X1,X2)) >= a__U21(mark(X1),X2) constraint: mark(U22(X)) >= a__U22(mark(X)) constraint: mark(isList(X)) >= a__isList(X) constraint: mark(U31(X)) >= a__U31(mark(X)) constraint: mark(U41(X1,X2)) >= a__U41(mark(X1),X2) constraint: mark(U42(X)) >= a__U42(mark(X)) constraint: mark(isNeList(X)) >= a__isNeList(X) constraint: mark(U51(X1,X2)) >= a__U51(mark(X1),X2) constraint: mark(U52(X)) >= a__U52(mark(X)) constraint: mark(U61(X)) >= a__U61(mark(X)) constraint: mark(U71(X1,X2)) >= a__U71(mark(X1),X2) constraint: mark(U72(X)) >= a__U72(mark(X)) constraint: mark(isPal(X)) >= a__isPal(X) constraint: mark(U81(X)) >= a__U81(mark(X)) constraint: mark(isQid(X)) >= a__isQid(X) constraint: mark(isNePal(X)) >= a__isNePal(X) constraint: a__U11(tt) >= tt constraint: a__U11(X) >= U11(X) constraint: a__U22(tt) >= tt constraint: a__U22(X) >= U22(X) constraint: a__isList(__(V1,V2)) >= a__U21(a__isList(V1),V2) constraint: a__isList(nil) >= tt constraint: a__isList(X) >= isList(X) constraint: a__isList(V) >= a__U11(a__isNeList(V)) constraint: a__U21(tt,V2) >= a__U22(a__isList(V2)) constraint: a__U21(X1,X2) >= U21(X1,X2) constraint: a__U31(tt) >= tt constraint: a__U31(X) >= U31(X) constraint: a__U42(tt) >= tt constraint: a__U42(X) >= U42(X) constraint: a__isNeList(__(V1,V2)) >= a__U41(a__isList(V1),V2) constraint: a__isNeList(__(V1,V2)) >= a__U51(a__isNeList(V1),V2) constraint: a__isNeList(X) >= isNeList(X) constraint: a__isNeList(V) >= a__U31(a__isQid(V)) constraint: a__U41(tt,V2) >= a__U42(a__isNeList(V2)) constraint: a__U41(X1,X2) >= U41(X1,X2) constraint: a__U52(tt) >= tt constraint: a__U52(X) >= U52(X) constraint: a__U51(tt,V2) >= a__U52(a__isList(V2)) constraint: a__U51(X1,X2) >= U51(X1,X2) constraint: a__U61(tt) >= tt constraint: a__U61(X) >= U61(X) constraint: a__U72(tt) >= tt constraint: a__U72(X) >= U72(X) constraint: a__isPal(nil) >= tt constraint: a__isPal(X) >= isPal(X) constraint: a__isPal(V) >= a__U81(a__isNePal(V)) constraint: a__U71(tt,P) >= a__U72(a__isPal(P)) constraint: a__U71(X1,X2) >= U71(X1,X2) constraint: a__U81(tt) >= tt constraint: a__U81(X) >= U81(X) constraint: a__isQid(a) >= tt constraint: a__isQid(e) >= tt constraint: a__isQid(i) >= tt constraint: a__isQid(o) >= tt constraint: a__isQid(u) >= tt constraint: a__isQid(X) >= isQid(X) constraint: a__isNePal(__(I,__(P,I))) >= a__U71(a__isQid(I),P) constraint: a__isNePal(X) >= isNePal(X) constraint: a__isNePal(V) >= a__U61(a__isQid(V)) constraint: Marked_a____(__(X,Y),Z) >= Marked_a____(mark(X), a____(mark(Y),mark(Z))) APPLY CRITERIA (Subterm criterion) ST: Marked_mark -> 1 APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: SOLVED { TRS termination of: [1] a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) [2] a____(X,nil) -> mark(X) [3] a____(nil,X) -> mark(X) [4] a__U11(tt) -> tt [5] a__U21(tt,V2) -> a__U22(a__isList(V2)) [6] a__U22(tt) -> tt [7] a__U31(tt) -> tt [8] a__U41(tt,V2) -> a__U42(a__isNeList(V2)) [9] a__U42(tt) -> tt [10] a__U51(tt,V2) -> a__U52(a__isList(V2)) [11] a__U52(tt) -> tt [12] a__U61(tt) -> tt [13] a__U71(tt,P) -> a__U72(a__isPal(P)) [14] a__U72(tt) -> tt [15] a__U81(tt) -> tt [16] a__isList(V) -> a__U11(a__isNeList(V)) [17] a__isList(nil) -> tt [18] a__isList(__(V1,V2)) -> a__U21(a__isList(V1),V2) [19] a__isNeList(V) -> a__U31(a__isQid(V)) [20] a__isNeList(__(V1,V2)) -> a__U41(a__isList(V1),V2) [21] a__isNeList(__(V1,V2)) -> a__U51(a__isNeList(V1),V2) [22] a__isNePal(V) -> a__U61(a__isQid(V)) [23] a__isNePal(__(I,__(P,I))) -> a__U71(a__isQid(I),P) [24] a__isPal(V) -> a__U81(a__isNePal(V)) [25] a__isPal(nil) -> tt [26] a__isQid(a) -> tt [27] a__isQid(e) -> tt [28] a__isQid(i) -> tt [29] a__isQid(o) -> tt [30] a__isQid(u) -> tt [31] mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) [32] mark(U11(X)) -> a__U11(mark(X)) [33] mark(U21(X1,X2)) -> a__U21(mark(X1),X2) [34] mark(U22(X)) -> a__U22(mark(X)) [35] mark(isList(X)) -> a__isList(X) [36] mark(U31(X)) -> a__U31(mark(X)) [37] mark(U41(X1,X2)) -> a__U41(mark(X1),X2) [38] mark(U42(X)) -> a__U42(mark(X)) [39] mark(isNeList(X)) -> a__isNeList(X) [40] mark(U51(X1,X2)) -> a__U51(mark(X1),X2) [41] mark(U52(X)) -> a__U52(mark(X)) [42] mark(U61(X)) -> a__U61(mark(X)) [43] mark(U71(X1,X2)) -> a__U71(mark(X1),X2) [44] mark(U72(X)) -> a__U72(mark(X)) [45] mark(isPal(X)) -> a__isPal(X) [46] mark(U81(X)) -> a__U81(mark(X)) [47] mark(isQid(X)) -> a__isQid(X) [48] mark(isNePal(X)) -> a__isNePal(X) [49] mark(nil) -> nil [50] mark(tt) -> tt [51] mark(a) -> a [52] mark(e) -> e [53] mark(i) -> i [54] mark(o) -> o [55] mark(u) -> u [56] a____(X1,X2) -> __(X1,X2) [57] a__U11(X) -> U11(X) [58] a__U21(X1,X2) -> U21(X1,X2) [59] a__U22(X) -> U22(X) [60] a__isList(X) -> isList(X) [61] a__U31(X) -> U31(X) [62] a__U41(X1,X2) -> U41(X1,X2) [63] a__U42(X) -> U42(X) [64] a__isNeList(X) -> isNeList(X) [65] a__U51(X1,X2) -> U51(X1,X2) [66] a__U52(X) -> U52(X) [67] a__U61(X) -> U61(X) [68] a__U71(X1,X2) -> U71(X1,X2) [69] a__U72(X) -> U72(X) [70] a__isPal(X) -> isPal(X) [71] a__U81(X) -> U81(X) [72] a__isQid(X) -> isQid(X) [73] a__isNePal(X) -> isNePal(X) , CRITERION: MDP [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ a____ ] (X0,X1) = 1*X1 + 1*X0 + 2; [ U41 ] (X0,X1) = 1*X0; [ a__U72 ] (X0) = 2*X0; [ a__U21 ] (X0,X1) = 2*X0; [ isPal ] (X0) = 0; [ i ] () = 0; [ tt ] () = 0; [ U52 ] (X0) = 1*X0; [ a__isQid ] (X0) = 0; [ a__U41 ] (X0,X1) = 1*X0; [ U21 ] (X0,X1) = 2*X0; [ __ ] (X0,X1) = 1*X1 + 1*X0 + 2; [ isNeList ] (X0) = 0; [ a__U71 ] (X0,X1) = 1*X0; [ a__U42 ] (X0) = 1*X0; [ isQid ] (X0) = 0; [ u ] () = 0; [ a__U22 ] (X0) = 2*X0; [ U71 ] (X0,X1) = 1*X0; [ a ] () = 0; [ a__U51 ] (X0,X1) = 2*X0; [ isList ] (X0) = 0; [ Marked_mark ] (X0) = 3*X0; [ mark ] (X0) = 1*X0; [ U42 ] (X0) = 1*X0; [ a__isPal ] (X0) = 0; [ a__U31 ] (X0) = 1*X0; [ U81 ] (X0) = 1*X0; [ o ] () = 0; [ a__U11 ] (X0) = 1*X0; [ U61 ] (X0) = 2*X0; [ a__isNePal ] (X0) = 0; [ a__U52 ] (X0) = 1*X0; [ U22 ] (X0) = 2*X0; [ Marked_a____ ] (X0,X1) = 3*X1 + 3*X0; [ nil ] () = 2; [ U51 ] (X0,X1) = 2*X0; [ a__U81 ] (X0) = 1*X0; [ a__isNeList ] (X0) = 0; [ isNePal ] (X0) = 0; [ U11 ] (X0) = 1*X0; [ a__isList ] (X0) = 0; [ U72 ] (X0) = 2*X0; [ e ] () = 0; [ a__U61 ] (X0) = 2*X0; [ U31 ] (X0) = 1*X0; removing < Marked_a____(__(X,Y),Z),Marked_mark(Z)>< Marked_a____(nil,X),Marked_mark(X)>< Marked_mark(__(X1,X2)),Marked_mark(X1)> [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ a____ ] (X0,X1) = 1 + 2*X0 + 1*X1 + 0; [ U41 ] (X0,X1) = 0; [ a__U72 ] (X0) = 0; [ a__U21 ] (X0,X1) = 0; [ isPal ] (X0) = 0; [ i ] () = 0; [ tt ] () = 0; [ U52 ] (X0) = 0; [ a__isQid ] (X0) = 0; [ a__U41 ] (X0,X1) = 0; [ U21 ] (X0,X1) = 0; [ __ ] (X0,X1) = 1 + 2*X0 + 1*X1 + 0; [ isNeList ] (X0) = 0; [ a__U71 ] (X0,X1) = 1 + 0; [ a__U42 ] (X0) = 0; [ isQid ] (X0) = 0; [ u ] () = 0; [ a__U22 ] (X0) = 0; [ U71 ] (X0,X1) = 1 + 0; [ a ] () = 0; [ a__U51 ] (X0,X1) = 0; [ isList ] (X0) = 2 + 0; [ mark ] (X0) = 1*X0 + 0; [ U42 ] (X0) = 0; [ a__isPal ] (X0) = 0; [ a__U31 ] (X0) = 0; [ U81 ] (X0) = 0; [ o ] () = 0; [ a__U11 ] (X0) = 0; [ U61 ] (X0) = 0; [ a__isNePal ] (X0) = 1 + 0; [ a__U52 ] (X0) = 0; [ U22 ] (X0) = 0; [ Marked_a____ ] (X0,X1) = 1*X0 + 0; [ nil ] () = 0; [ U51 ] (X0,X1) = 0; [ a__U81 ] (X0) = 0; [ a__isNeList ] (X0) = 0; [ isNePal ] (X0) = 1 + 0; [ U11 ] (X0) = 0; [ a__isList ] (X0) = 2 + 0; [ U72 ] (X0) = 0; [ e ] () = 0; [ a__U61 ] (X0) = 0; [ U31 ] (X0) = 0; ]} { DP termination of: , CRITERION: ST [ { DP termination of: , CRITERION: SG [ ]} ]} ]} ]} { DP termination of: , CRITERION: ST [ { DP termination of: , CRITERION: SG [ ]} ]} { DP termination of: , CRITERION: ST [ { DP termination of: , CRITERION: SG [ ]} ]} ]} ]} Cime worked for 0.503830 seconds (real time) Cime Exit Status: 0