- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] a__zeros -> cons(0,zeros) [2] a__U11(tt) -> tt [3] a__U21(tt) -> tt [4] a__U31(tt) -> tt [5] a__U41(tt,V2) -> a__U42(a__isNatIList(V2)) [6] a__U42(tt) -> tt [7] a__U51(tt,V2) -> a__U52(a__isNatList(V2)) [8] a__U52(tt) -> tt [9] a__U61(tt,L,N) -> a__U62(a__isNat(N),L) [10] a__U62(tt,L) -> s(a__length(mark(L))) [11] a__isNat(0) -> tt [12] a__isNat(length(V1)) -> a__U11(a__isNatList(V1)) [13] a__isNat(s(V1)) -> a__U21(a__isNat(V1)) [14] a__isNatIList(V) -> a__U31(a__isNatList(V)) [15] a__isNatIList(zeros) -> tt [16] a__isNatIList(cons(V1,V2)) -> a__U41(a__isNat(V1),V2) [17] a__isNatList(nil) -> tt [18] a__isNatList(cons(V1,V2)) -> a__U51(a__isNat(V1),V2) [19] a__length(nil) -> 0 [20] a__length(cons(N,L)) -> a__U61(a__isNatList(L),L,N) [21] mark(zeros) -> a__zeros [22] mark(U11(X)) -> a__U11(mark(X)) [23] mark(U21(X)) -> a__U21(mark(X)) [24] mark(U31(X)) -> a__U31(mark(X)) [25] mark(U41(X1,X2)) -> a__U41(mark(X1),X2) [26] mark(U42(X)) -> a__U42(mark(X)) [27] mark(isNatIList(X)) -> a__isNatIList(X) [28] mark(U51(X1,X2)) -> a__U51(mark(X1),X2) [29] mark(U52(X)) -> a__U52(mark(X)) [30] mark(isNatList(X)) -> a__isNatList(X) [31] mark(U61(X1,X2,X3)) -> a__U61(mark(X1),X2,X3) [32] mark(U62(X1,X2)) -> a__U62(mark(X1),X2) [33] mark(isNat(X)) -> a__isNat(X) [34] mark(length(X)) -> a__length(mark(X)) [35] mark(cons(X1,X2)) -> cons(mark(X1),X2) [36] mark(0) -> 0 [37] mark(tt) -> tt [38] mark(s(X)) -> s(mark(X)) [39] mark(nil) -> nil [40] a__zeros -> zeros [41] a__U11(X) -> U11(X) [42] a__U21(X) -> U21(X) [43] a__U31(X) -> U31(X) [44] a__U41(X1,X2) -> U41(X1,X2) [45] a__U42(X) -> U42(X) [46] a__isNatIList(X) -> isNatIList(X) [47] a__U51(X1,X2) -> U51(X1,X2) [48] a__U52(X) -> U52(X) [49] a__isNatList(X) -> isNatList(X) [50] a__U61(X1,X2,X3) -> U61(X1,X2,X3) [51] a__U62(X1,X2) -> U62(X1,X2) [52] a__isNat(X) -> isNat(X) [53] a__length(X) -> length(X) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 3 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> } { --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a__zeros >= cons(0,zeros) ; a__zeros >= zeros ; a__U11(tt) >= tt ; a__U11(X) >= U11(X) ; a__U21(tt) >= tt ; a__U21(X) >= U21(X) ; a__U31(tt) >= tt ; a__U31(X) >= U31(X) ; a__U42(tt) >= tt ; a__U42(X) >= U42(X) ; a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) ; a__isNatIList(zeros) >= tt ; a__isNatIList(V) >= a__U31(a__isNatList(V)) ; a__isNatIList(X) >= isNatIList(X) ; a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) ; a__U41(X1,X2) >= U41(X1,X2) ; a__U52(tt) >= tt ; a__U52(X) >= U52(X) ; a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) ; a__isNatList(nil) >= tt ; a__isNatList(X) >= isNatList(X) ; a__U51(tt,V2) >= a__U52(a__isNatList(V2)) ; a__U51(X1,X2) >= U51(X1,X2) ; a__U62(tt,L) >= s(a__length(mark(L))) ; a__U62(X1,X2) >= U62(X1,X2) ; a__isNat(0) >= tt ; a__isNat(s(V1)) >= a__U21(a__isNat(V1)) ; a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) ; a__isNat(X) >= isNat(X) ; a__U61(tt,L,N) >= a__U62(a__isNat(N),L) ; a__U61(X1,X2,X3) >= U61(X1,X2,X3) ; a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) ; a__length(nil) >= 0 ; a__length(X) >= length(X) ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(0) >= 0 ; mark(zeros) >= a__zeros ; mark(tt) >= tt ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(nil) >= nil ; mark(U11(X)) >= a__U11(mark(X)) ; mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) ; mark(U51(X1,X2)) >= a__U51(mark(X1),X2) ; mark(U52(X)) >= a__U52(mark(X)) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) ; mark(U62(X1,X2)) >= a__U62(mark(X1),X2) ; mark(isNat(X)) >= a__isNat(X) ; Marked_a__length(cons(N,L)) >= Marked_a__U61(a__isNatList(L),L,N) ; Marked_a__U62(tt,L) >= Marked_a__length(mark(L)) ; Marked_a__U62(tt,L) >= Marked_mark(L) ; Marked_a__U61(tt,L,N) >= Marked_a__U62(a__isNat(N),L) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_a__length(mark(X)) ; Marked_mark(length(X)) >= Marked_mark(X) ; Marked_mark(U11(X)) >= Marked_mark(X) ; Marked_mark(U21(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(X1,X2,X3)) >= Marked_a__U61(mark(X1),X2,X3) ; Marked_mark(U61(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(U62(X1,X2)) >= Marked_a__U62(mark(X1),X2) ; Marked_mark(U62(X1,X2)) >= Marked_mark(X1) ; } + Disjunctions:{ { Marked_a__length(cons(N,L)) > Marked_a__U61(a__isNatList(L),L,N) ; } { Marked_a__U62(tt,L) > Marked_a__length(mark(L)) ; } { Marked_a__U62(tt,L) > Marked_mark(L) ; } { Marked_a__U61(tt,L,N) > Marked_a__U62(a__isNat(N),L) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_a__length(mark(X)) ; } { Marked_mark(length(X)) > Marked_mark(X) ; } { Marked_mark(U11(X)) > Marked_mark(X) ; } { Marked_mark(U21(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(X1,X2,X3)) > Marked_a__U61(mark(X1),X2,X3) ; } { Marked_mark(U61(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(U62(X1,X2)) > Marked_a__U62(mark(X1),X2) ; } { Marked_mark(U62(X1,X2)) > Marked_mark(X1) ; } } === 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__zeros >= cons(0,zeros) constraint: a__zeros >= zeros constraint: a__U11(tt) >= tt constraint: a__U11(X) >= U11(X) constraint: a__U21(tt) >= tt constraint: a__U21(X) >= U21(X) constraint: a__U31(tt) >= tt constraint: a__U31(X) >= U31(X) constraint: a__U42(tt) >= tt constraint: a__U42(X) >= U42(X) constraint: a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(V) >= a__U31(a__isNatList(V)) constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) constraint: a__U41(X1,X2) >= U41(X1,X2) constraint: a__U52(tt) >= tt constraint: a__U52(X) >= U52(X) constraint: a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(X) >= isNatList(X) constraint: a__U51(tt,V2) >= a__U52(a__isNatList(V2)) constraint: a__U51(X1,X2) >= U51(X1,X2) constraint: a__U62(tt,L) >= s(a__length(mark(L))) constraint: a__U62(X1,X2) >= U62(X1,X2) constraint: a__isNat(0) >= tt constraint: a__isNat(s(V1)) >= a__U21(a__isNat(V1)) constraint: a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) constraint: a__isNat(X) >= isNat(X) constraint: a__U61(tt,L,N) >= a__U62(a__isNat(N),L) constraint: a__U61(X1,X2,X3) >= U61(X1,X2,X3) constraint: a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) constraint: a__length(nil) >= 0 constraint: a__length(X) >= length(X) constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(0) >= 0 constraint: mark(zeros) >= a__zeros constraint: mark(tt) >= tt constraint: mark(s(X)) >= s(mark(X)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(nil) >= nil constraint: mark(U11(X)) >= a__U11(mark(X)) constraint: mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) constraint: mark(U51(X1,X2)) >= a__U51(mark(X1),X2) constraint: mark(U52(X)) >= a__U52(mark(X)) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) constraint: mark(U62(X1,X2)) >= a__U62(mark(X1),X2) constraint: mark(isNat(X)) >= a__isNat(X) constraint: Marked_a__length(cons(N,L)) >= Marked_a__U61(a__isNatList(L),L,N) constraint: Marked_a__U62(tt,L) >= Marked_a__length(mark(L)) constraint: Marked_a__U62(tt,L) >= Marked_mark(L) constraint: Marked_a__U61(tt,L,N) >= Marked_a__U62(a__isNat(N),L) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_a__length(mark(X)) constraint: Marked_mark(length(X)) >= Marked_mark(X) constraint: Marked_mark(U11(X)) >= Marked_mark(X) constraint: Marked_mark(U21(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(X1,X2,X3)) >= Marked_a__U61(mark(X1),X2,X3) constraint: Marked_mark(U61(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(U62(X1,X2)) >= Marked_a__U62(mark(X1),X2) constraint: Marked_mark(U62(X1,X2)) >= Marked_mark(X1) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a__zeros >= cons(0,zeros) ; a__zeros >= zeros ; a__U11(tt) >= tt ; a__U11(X) >= U11(X) ; a__U21(tt) >= tt ; a__U21(X) >= U21(X) ; a__U31(tt) >= tt ; a__U31(X) >= U31(X) ; a__U42(tt) >= tt ; a__U42(X) >= U42(X) ; a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) ; a__isNatIList(zeros) >= tt ; a__isNatIList(V) >= a__U31(a__isNatList(V)) ; a__isNatIList(X) >= isNatIList(X) ; a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) ; a__U41(X1,X2) >= U41(X1,X2) ; a__U52(tt) >= tt ; a__U52(X) >= U52(X) ; a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) ; a__isNatList(nil) >= tt ; a__isNatList(X) >= isNatList(X) ; a__U51(tt,V2) >= a__U52(a__isNatList(V2)) ; a__U51(X1,X2) >= U51(X1,X2) ; a__U62(tt,L) >= s(a__length(mark(L))) ; a__U62(X1,X2) >= U62(X1,X2) ; a__isNat(0) >= tt ; a__isNat(s(V1)) >= a__U21(a__isNat(V1)) ; a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) ; a__isNat(X) >= isNat(X) ; a__U61(tt,L,N) >= a__U62(a__isNat(N),L) ; a__U61(X1,X2,X3) >= U61(X1,X2,X3) ; a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) ; a__length(nil) >= 0 ; a__length(X) >= length(X) ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(0) >= 0 ; mark(zeros) >= a__zeros ; mark(tt) >= tt ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(nil) >= nil ; mark(U11(X)) >= a__U11(mark(X)) ; mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) ; mark(U51(X1,X2)) >= a__U51(mark(X1),X2) ; mark(U52(X)) >= a__U52(mark(X)) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) ; mark(U62(X1,X2)) >= a__U62(mark(X1),X2) ; mark(isNat(X)) >= a__isNat(X) ; Marked_a__isNatIList(cons(V1,V2)) >= Marked_a__U41(a__isNat(V1),V2) ; Marked_a__U41(tt,V2) >= Marked_a__isNatIList(V2) ; } + Disjunctions:{ { Marked_a__isNatIList(cons(V1,V2)) > Marked_a__U41(a__isNat(V1),V2) ; } { Marked_a__U41(tt,V2) > Marked_a__isNatIList(V2) ; } } === 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__zeros >= cons(0,zeros) constraint: a__zeros >= zeros constraint: a__U11(tt) >= tt constraint: a__U11(X) >= U11(X) constraint: a__U21(tt) >= tt constraint: a__U21(X) >= U21(X) constraint: a__U31(tt) >= tt constraint: a__U31(X) >= U31(X) constraint: a__U42(tt) >= tt constraint: a__U42(X) >= U42(X) constraint: a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(V) >= a__U31(a__isNatList(V)) constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) constraint: a__U41(X1,X2) >= U41(X1,X2) constraint: a__U52(tt) >= tt constraint: a__U52(X) >= U52(X) constraint: a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(X) >= isNatList(X) constraint: a__U51(tt,V2) >= a__U52(a__isNatList(V2)) constraint: a__U51(X1,X2) >= U51(X1,X2) constraint: a__U62(tt,L) >= s(a__length(mark(L))) constraint: a__U62(X1,X2) >= U62(X1,X2) constraint: a__isNat(0) >= tt constraint: a__isNat(s(V1)) >= a__U21(a__isNat(V1)) constraint: a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) constraint: a__isNat(X) >= isNat(X) constraint: a__U61(tt,L,N) >= a__U62(a__isNat(N),L) constraint: a__U61(X1,X2,X3) >= U61(X1,X2,X3) constraint: a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) constraint: a__length(nil) >= 0 constraint: a__length(X) >= length(X) constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(0) >= 0 constraint: mark(zeros) >= a__zeros constraint: mark(tt) >= tt constraint: mark(s(X)) >= s(mark(X)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(nil) >= nil constraint: mark(U11(X)) >= a__U11(mark(X)) constraint: mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) constraint: mark(U51(X1,X2)) >= a__U51(mark(X1),X2) constraint: mark(U52(X)) >= a__U52(mark(X)) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) constraint: mark(U62(X1,X2)) >= a__U62(mark(X1),X2) constraint: mark(isNat(X)) >= a__isNat(X) constraint: Marked_a__isNatIList(cons(V1,V2)) >= Marked_a__U41(a__isNat(V1),V2) constraint: Marked_a__U41(tt,V2) >= Marked_a__isNatIList(V2) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a__zeros >= cons(0,zeros) ; a__zeros >= zeros ; a__U11(tt) >= tt ; a__U11(X) >= U11(X) ; a__U21(tt) >= tt ; a__U21(X) >= U21(X) ; a__U31(tt) >= tt ; a__U31(X) >= U31(X) ; a__U42(tt) >= tt ; a__U42(X) >= U42(X) ; a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) ; a__isNatIList(zeros) >= tt ; a__isNatIList(V) >= a__U31(a__isNatList(V)) ; a__isNatIList(X) >= isNatIList(X) ; a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) ; a__U41(X1,X2) >= U41(X1,X2) ; a__U52(tt) >= tt ; a__U52(X) >= U52(X) ; a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) ; a__isNatList(nil) >= tt ; a__isNatList(X) >= isNatList(X) ; a__U51(tt,V2) >= a__U52(a__isNatList(V2)) ; a__U51(X1,X2) >= U51(X1,X2) ; a__U62(tt,L) >= s(a__length(mark(L))) ; a__U62(X1,X2) >= U62(X1,X2) ; a__isNat(0) >= tt ; a__isNat(s(V1)) >= a__U21(a__isNat(V1)) ; a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) ; a__isNat(X) >= isNat(X) ; a__U61(tt,L,N) >= a__U62(a__isNat(N),L) ; a__U61(X1,X2,X3) >= U61(X1,X2,X3) ; a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) ; a__length(nil) >= 0 ; a__length(X) >= length(X) ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(0) >= 0 ; mark(zeros) >= a__zeros ; mark(tt) >= tt ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(nil) >= nil ; mark(U11(X)) >= a__U11(mark(X)) ; mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) ; mark(U51(X1,X2)) >= a__U51(mark(X1),X2) ; mark(U52(X)) >= a__U52(mark(X)) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) ; mark(U62(X1,X2)) >= a__U62(mark(X1),X2) ; mark(isNat(X)) >= a__isNat(X) ; Marked_a__isNat(s(V1)) >= Marked_a__isNat(V1) ; Marked_a__isNat(length(V1)) >= Marked_a__isNatList(V1) ; Marked_a__isNatList(cons(V1,V2)) >= Marked_a__isNat(V1) ; Marked_a__isNatList(cons(V1,V2)) >= Marked_a__U51(a__isNat(V1),V2) ; Marked_a__U51(tt,V2) >= Marked_a__isNatList(V2) ; } + Disjunctions:{ { Marked_a__isNat(s(V1)) > Marked_a__isNat(V1) ; } { Marked_a__isNat(length(V1)) > Marked_a__isNatList(V1) ; } { Marked_a__isNatList(cons(V1,V2)) > Marked_a__isNat(V1) ; } { Marked_a__isNatList(cons(V1,V2)) > Marked_a__U51(a__isNat(V1),V2) ; } { Marked_a__U51(tt,V2) > Marked_a__isNatList(V2) ; } } === 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__zeros >= cons(0,zeros) constraint: a__zeros >= zeros constraint: a__U11(tt) >= tt constraint: a__U11(X) >= U11(X) constraint: a__U21(tt) >= tt constraint: a__U21(X) >= U21(X) constraint: a__U31(tt) >= tt constraint: a__U31(X) >= U31(X) constraint: a__U42(tt) >= tt constraint: a__U42(X) >= U42(X) constraint: a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(V) >= a__U31(a__isNatList(V)) constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) constraint: a__U41(X1,X2) >= U41(X1,X2) constraint: a__U52(tt) >= tt constraint: a__U52(X) >= U52(X) constraint: a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(X) >= isNatList(X) constraint: a__U51(tt,V2) >= a__U52(a__isNatList(V2)) constraint: a__U51(X1,X2) >= U51(X1,X2) constraint: a__U62(tt,L) >= s(a__length(mark(L))) constraint: a__U62(X1,X2) >= U62(X1,X2) constraint: a__isNat(0) >= tt constraint: a__isNat(s(V1)) >= a__U21(a__isNat(V1)) constraint: a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) constraint: a__isNat(X) >= isNat(X) constraint: a__U61(tt,L,N) >= a__U62(a__isNat(N),L) constraint: a__U61(X1,X2,X3) >= U61(X1,X2,X3) constraint: a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) constraint: a__length(nil) >= 0 constraint: a__length(X) >= length(X) constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(0) >= 0 constraint: mark(zeros) >= a__zeros constraint: mark(tt) >= tt constraint: mark(s(X)) >= s(mark(X)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(nil) >= nil constraint: mark(U11(X)) >= a__U11(mark(X)) constraint: mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) constraint: mark(U51(X1,X2)) >= a__U51(mark(X1),X2) constraint: mark(U52(X)) >= a__U52(mark(X)) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) constraint: mark(U62(X1,X2)) >= a__U62(mark(X1),X2) constraint: mark(isNat(X)) >= a__isNat(X) constraint: Marked_a__isNat(s(V1)) >= Marked_a__isNat(V1) constraint: Marked_a__isNat(length(V1)) >= Marked_a__isNatList(V1) constraint: Marked_a__isNatList(cons(V1,V2)) >= Marked_a__isNat(V1) constraint: Marked_a__isNatList(cons(V1,V2)) >= Marked_a__U51(a__isNat(V1),V2) constraint: Marked_a__U51(tt,V2) >= Marked_a__isNatList(V2) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a__zeros >= cons(0,zeros) ; a__zeros >= zeros ; a__U11(tt) >= tt ; a__U11(X) >= U11(X) ; a__U21(tt) >= tt ; a__U21(X) >= U21(X) ; a__U31(tt) >= tt ; a__U31(X) >= U31(X) ; a__U42(tt) >= tt ; a__U42(X) >= U42(X) ; a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) ; a__isNatIList(zeros) >= tt ; a__isNatIList(V) >= a__U31(a__isNatList(V)) ; a__isNatIList(X) >= isNatIList(X) ; a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) ; a__U41(X1,X2) >= U41(X1,X2) ; a__U52(tt) >= tt ; a__U52(X) >= U52(X) ; a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) ; a__isNatList(nil) >= tt ; a__isNatList(X) >= isNatList(X) ; a__U51(tt,V2) >= a__U52(a__isNatList(V2)) ; a__U51(X1,X2) >= U51(X1,X2) ; a__U62(tt,L) >= s(a__length(mark(L))) ; a__U62(X1,X2) >= U62(X1,X2) ; a__isNat(0) >= tt ; a__isNat(s(V1)) >= a__U21(a__isNat(V1)) ; a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) ; a__isNat(X) >= isNat(X) ; a__U61(tt,L,N) >= a__U62(a__isNat(N),L) ; a__U61(X1,X2,X3) >= U61(X1,X2,X3) ; a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) ; a__length(nil) >= 0 ; a__length(X) >= length(X) ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(0) >= 0 ; mark(zeros) >= a__zeros ; mark(tt) >= tt ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(nil) >= nil ; mark(U11(X)) >= a__U11(mark(X)) ; mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) ; mark(U51(X1,X2)) >= a__U51(mark(X1),X2) ; mark(U52(X)) >= a__U52(mark(X)) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) ; mark(U62(X1,X2)) >= a__U62(mark(X1),X2) ; mark(isNat(X)) >= a__isNat(X) ; Marked_a__length(cons(N,L)) >= Marked_a__U61(a__isNatList(L),L,N) ; Marked_a__U62(tt,L) >= Marked_a__length(mark(L)) ; Marked_a__U62(tt,L) >= Marked_mark(L) ; Marked_a__U61(tt,L,N) >= Marked_a__U62(a__isNat(N),L) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_a__length(mark(X)) ; Marked_mark(length(X)) >= Marked_mark(X) ; Marked_mark(U11(X)) >= Marked_mark(X) ; Marked_mark(U21(X)) >= Marked_mark(X) ; Marked_mark(U31(X)) >= Marked_mark(X) ; 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(X1,X2,X3)) >= Marked_a__U61(mark(X1),X2,X3) ; Marked_mark(U61(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(U62(X1,X2)) >= Marked_a__U62(mark(X1),X2) ; Marked_mark(U62(X1,X2)) >= Marked_mark(X1) ; } + Disjunctions:{ { Marked_a__length(cons(N,L)) > Marked_a__U61(a__isNatList(L),L,N) ; } { Marked_a__U62(tt,L) > Marked_a__length(mark(L)) ; } { Marked_a__U62(tt,L) > Marked_mark(L) ; } { Marked_a__U61(tt,L,N) > Marked_a__U62(a__isNat(N),L) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_a__length(mark(X)) ; } { Marked_mark(length(X)) > Marked_mark(X) ; } { Marked_mark(U11(X)) > Marked_mark(X) ; } { Marked_mark(U21(X)) > Marked_mark(X) ; } { Marked_mark(U31(X)) > Marked_mark(X) ; } { 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(X1,X2,X3)) > Marked_a__U61(mark(X1),X2,X3) ; } { Marked_mark(U61(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(U62(X1,X2)) > Marked_a__U62(mark(X1),X2) ; } { Marked_mark(U62(X1,X2)) > Marked_mark(X1) ; } } === 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__zeros >= cons(0,zeros) constraint: a__zeros >= zeros constraint: a__U11(tt) >= tt constraint: a__U11(X) >= U11(X) constraint: a__U21(tt) >= tt constraint: a__U21(X) >= U21(X) constraint: a__U31(tt) >= tt constraint: a__U31(X) >= U31(X) constraint: a__U42(tt) >= tt constraint: a__U42(X) >= U42(X) constraint: a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(V) >= a__U31(a__isNatList(V)) constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) constraint: a__U41(X1,X2) >= U41(X1,X2) constraint: a__U52(tt) >= tt constraint: a__U52(X) >= U52(X) constraint: a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(X) >= isNatList(X) constraint: a__U51(tt,V2) >= a__U52(a__isNatList(V2)) constraint: a__U51(X1,X2) >= U51(X1,X2) constraint: a__U62(tt,L) >= s(a__length(mark(L))) constraint: a__U62(X1,X2) >= U62(X1,X2) constraint: a__isNat(0) >= tt constraint: a__isNat(s(V1)) >= a__U21(a__isNat(V1)) constraint: a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) constraint: a__isNat(X) >= isNat(X) constraint: a__U61(tt,L,N) >= a__U62(a__isNat(N),L) constraint: a__U61(X1,X2,X3) >= U61(X1,X2,X3) constraint: a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) constraint: a__length(nil) >= 0 constraint: a__length(X) >= length(X) constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(0) >= 0 constraint: mark(zeros) >= a__zeros constraint: mark(tt) >= tt constraint: mark(s(X)) >= s(mark(X)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(nil) >= nil constraint: mark(U11(X)) >= a__U11(mark(X)) constraint: mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) constraint: mark(U51(X1,X2)) >= a__U51(mark(X1),X2) constraint: mark(U52(X)) >= a__U52(mark(X)) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) constraint: mark(U62(X1,X2)) >= a__U62(mark(X1),X2) constraint: mark(isNat(X)) >= a__isNat(X) constraint: Marked_a__length(cons(N,L)) >= Marked_a__U61(a__isNatList(L),L,N) constraint: Marked_a__U62(tt,L) >= Marked_a__length(mark(L)) constraint: Marked_a__U62(tt,L) >= Marked_mark(L) constraint: Marked_a__U61(tt,L,N) >= Marked_a__U62(a__isNat(N),L) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_a__length(mark(X)) constraint: Marked_mark(length(X)) >= Marked_mark(X) constraint: Marked_mark(U11(X)) >= Marked_mark(X) constraint: Marked_mark(U21(X)) >= Marked_mark(X) constraint: Marked_mark(U31(X)) >= Marked_mark(X) 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(X1,X2,X3)) >= Marked_a__U61(mark(X1),X2,X3) constraint: Marked_mark(U61(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(U62(X1,X2)) >= Marked_a__U62(mark(X1),X2) constraint: Marked_mark(U62(X1,X2)) >= Marked_mark(X1) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a__zeros >= cons(0,zeros) ; a__zeros >= zeros ; a__U11(tt) >= tt ; a__U11(X) >= U11(X) ; a__U21(tt) >= tt ; a__U21(X) >= U21(X) ; a__U31(tt) >= tt ; a__U31(X) >= U31(X) ; a__U42(tt) >= tt ; a__U42(X) >= U42(X) ; a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) ; a__isNatIList(zeros) >= tt ; a__isNatIList(V) >= a__U31(a__isNatList(V)) ; a__isNatIList(X) >= isNatIList(X) ; a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) ; a__U41(X1,X2) >= U41(X1,X2) ; a__U52(tt) >= tt ; a__U52(X) >= U52(X) ; a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) ; a__isNatList(nil) >= tt ; a__isNatList(X) >= isNatList(X) ; a__U51(tt,V2) >= a__U52(a__isNatList(V2)) ; a__U51(X1,X2) >= U51(X1,X2) ; a__U62(tt,L) >= s(a__length(mark(L))) ; a__U62(X1,X2) >= U62(X1,X2) ; a__isNat(0) >= tt ; a__isNat(s(V1)) >= a__U21(a__isNat(V1)) ; a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) ; a__isNat(X) >= isNat(X) ; a__U61(tt,L,N) >= a__U62(a__isNat(N),L) ; a__U61(X1,X2,X3) >= U61(X1,X2,X3) ; a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) ; a__length(nil) >= 0 ; a__length(X) >= length(X) ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(0) >= 0 ; mark(zeros) >= a__zeros ; mark(tt) >= tt ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(nil) >= nil ; mark(U11(X)) >= a__U11(mark(X)) ; mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) ; mark(U51(X1,X2)) >= a__U51(mark(X1),X2) ; mark(U52(X)) >= a__U52(mark(X)) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) ; mark(U62(X1,X2)) >= a__U62(mark(X1),X2) ; mark(isNat(X)) >= a__isNat(X) ; Marked_a__length(cons(N,L)) >= Marked_a__U61(a__isNatList(L),L,N) ; Marked_a__U62(tt,L) >= Marked_a__length(mark(L)) ; Marked_a__U62(tt,L) >= Marked_mark(L) ; Marked_a__U61(tt,L,N) >= Marked_a__U62(a__isNat(N),L) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_a__length(mark(X)) ; Marked_mark(length(X)) >= Marked_mark(X) ; Marked_mark(U11(X)) >= Marked_mark(X) ; Marked_mark(U21(X)) >= Marked_mark(X) ; 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(X1,X2,X3)) >= Marked_a__U61(mark(X1),X2,X3) ; Marked_mark(U61(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(U62(X1,X2)) >= Marked_a__U62(mark(X1),X2) ; Marked_mark(U62(X1,X2)) >= Marked_mark(X1) ; } + Disjunctions:{ { Marked_a__length(cons(N,L)) > Marked_a__U61(a__isNatList(L),L,N) ; } { Marked_a__U62(tt,L) > Marked_a__length(mark(L)) ; } { Marked_a__U62(tt,L) > Marked_mark(L) ; } { Marked_a__U61(tt,L,N) > Marked_a__U62(a__isNat(N),L) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_a__length(mark(X)) ; } { Marked_mark(length(X)) > Marked_mark(X) ; } { Marked_mark(U11(X)) > Marked_mark(X) ; } { Marked_mark(U21(X)) > Marked_mark(X) ; } { 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(X1,X2,X3)) > Marked_a__U61(mark(X1),X2,X3) ; } { Marked_mark(U61(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(U62(X1,X2)) > Marked_a__U62(mark(X1),X2) ; } { Marked_mark(U62(X1,X2)) > Marked_mark(X1) ; } } === 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__zeros >= cons(0,zeros) constraint: a__zeros >= zeros constraint: a__U11(tt) >= tt constraint: a__U11(X) >= U11(X) constraint: a__U21(tt) >= tt constraint: a__U21(X) >= U21(X) constraint: a__U31(tt) >= tt constraint: a__U31(X) >= U31(X) constraint: a__U42(tt) >= tt constraint: a__U42(X) >= U42(X) constraint: a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(V) >= a__U31(a__isNatList(V)) constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) constraint: a__U41(X1,X2) >= U41(X1,X2) constraint: a__U52(tt) >= tt constraint: a__U52(X) >= U52(X) constraint: a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(X) >= isNatList(X) constraint: a__U51(tt,V2) >= a__U52(a__isNatList(V2)) constraint: a__U51(X1,X2) >= U51(X1,X2) constraint: a__U62(tt,L) >= s(a__length(mark(L))) constraint: a__U62(X1,X2) >= U62(X1,X2) constraint: a__isNat(0) >= tt constraint: a__isNat(s(V1)) >= a__U21(a__isNat(V1)) constraint: a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) constraint: a__isNat(X) >= isNat(X) constraint: a__U61(tt,L,N) >= a__U62(a__isNat(N),L) constraint: a__U61(X1,X2,X3) >= U61(X1,X2,X3) constraint: a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) constraint: a__length(nil) >= 0 constraint: a__length(X) >= length(X) constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(0) >= 0 constraint: mark(zeros) >= a__zeros constraint: mark(tt) >= tt constraint: mark(s(X)) >= s(mark(X)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(nil) >= nil constraint: mark(U11(X)) >= a__U11(mark(X)) constraint: mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) constraint: mark(U51(X1,X2)) >= a__U51(mark(X1),X2) constraint: mark(U52(X)) >= a__U52(mark(X)) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) constraint: mark(U62(X1,X2)) >= a__U62(mark(X1),X2) constraint: mark(isNat(X)) >= a__isNat(X) constraint: Marked_a__length(cons(N,L)) >= Marked_a__U61(a__isNatList(L),L,N) constraint: Marked_a__U62(tt,L) >= Marked_a__length(mark(L)) constraint: Marked_a__U62(tt,L) >= Marked_mark(L) constraint: Marked_a__U61(tt,L,N) >= Marked_a__U62(a__isNat(N),L) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_a__length(mark(X)) constraint: Marked_mark(length(X)) >= Marked_mark(X) constraint: Marked_mark(U11(X)) >= Marked_mark(X) constraint: Marked_mark(U21(X)) >= Marked_mark(X) 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(X1,X2,X3)) >= Marked_a__U61(mark(X1),X2,X3) constraint: Marked_mark(U61(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(U62(X1,X2)) >= Marked_a__U62(mark(X1),X2) constraint: Marked_mark(U62(X1,X2)) >= Marked_mark(X1) APPLY CRITERIA (Graph splitting) Found 2 components: { --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a__zeros >= cons(0,zeros) ; a__zeros >= zeros ; a__U11(tt) >= tt ; a__U11(X) >= U11(X) ; a__U21(tt) >= tt ; a__U21(X) >= U21(X) ; a__U31(tt) >= tt ; a__U31(X) >= U31(X) ; a__U42(tt) >= tt ; a__U42(X) >= U42(X) ; a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) ; a__isNatIList(zeros) >= tt ; a__isNatIList(V) >= a__U31(a__isNatList(V)) ; a__isNatIList(X) >= isNatIList(X) ; a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) ; a__U41(X1,X2) >= U41(X1,X2) ; a__U52(tt) >= tt ; a__U52(X) >= U52(X) ; a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) ; a__isNatList(nil) >= tt ; a__isNatList(X) >= isNatList(X) ; a__U51(tt,V2) >= a__U52(a__isNatList(V2)) ; a__U51(X1,X2) >= U51(X1,X2) ; a__U62(tt,L) >= s(a__length(mark(L))) ; a__U62(X1,X2) >= U62(X1,X2) ; a__isNat(0) >= tt ; a__isNat(s(V1)) >= a__U21(a__isNat(V1)) ; a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) ; a__isNat(X) >= isNat(X) ; a__U61(tt,L,N) >= a__U62(a__isNat(N),L) ; a__U61(X1,X2,X3) >= U61(X1,X2,X3) ; a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) ; a__length(nil) >= 0 ; a__length(X) >= length(X) ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(0) >= 0 ; mark(zeros) >= a__zeros ; mark(tt) >= tt ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(nil) >= nil ; mark(U11(X)) >= a__U11(mark(X)) ; mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) ; mark(U51(X1,X2)) >= a__U51(mark(X1),X2) ; mark(U52(X)) >= a__U52(mark(X)) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) ; mark(U62(X1,X2)) >= a__U62(mark(X1),X2) ; mark(isNat(X)) >= a__isNat(X) ; Marked_a__length(cons(N,L)) >= Marked_a__U61(a__isNatList(L),L,N) ; Marked_a__U62(tt,L) >= Marked_a__length(mark(L)) ; Marked_a__U61(tt,L,N) >= Marked_a__U62(a__isNat(N),L) ; } + Disjunctions:{ { Marked_a__length(cons(N,L)) > Marked_a__U61(a__isNatList(L),L,N) ; } { Marked_a__U62(tt,L) > Marked_a__length(mark(L)) ; } { Marked_a__U61(tt,L,N) > Marked_a__U62(a__isNat(N),L) ; } } === 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__zeros >= cons(0,zeros) constraint: a__zeros >= zeros constraint: a__U11(tt) >= tt constraint: a__U11(X) >= U11(X) constraint: a__U21(tt) >= tt constraint: a__U21(X) >= U21(X) constraint: a__U31(tt) >= tt constraint: a__U31(X) >= U31(X) constraint: a__U42(tt) >= tt constraint: a__U42(X) >= U42(X) constraint: a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(V) >= a__U31(a__isNatList(V)) constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) constraint: a__U41(X1,X2) >= U41(X1,X2) constraint: a__U52(tt) >= tt constraint: a__U52(X) >= U52(X) constraint: a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(X) >= isNatList(X) constraint: a__U51(tt,V2) >= a__U52(a__isNatList(V2)) constraint: a__U51(X1,X2) >= U51(X1,X2) constraint: a__U62(tt,L) >= s(a__length(mark(L))) constraint: a__U62(X1,X2) >= U62(X1,X2) constraint: a__isNat(0) >= tt constraint: a__isNat(s(V1)) >= a__U21(a__isNat(V1)) constraint: a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) constraint: a__isNat(X) >= isNat(X) constraint: a__U61(tt,L,N) >= a__U62(a__isNat(N),L) constraint: a__U61(X1,X2,X3) >= U61(X1,X2,X3) constraint: a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) constraint: a__length(nil) >= 0 constraint: a__length(X) >= length(X) constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(0) >= 0 constraint: mark(zeros) >= a__zeros constraint: mark(tt) >= tt constraint: mark(s(X)) >= s(mark(X)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(nil) >= nil constraint: mark(U11(X)) >= a__U11(mark(X)) constraint: mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) constraint: mark(U51(X1,X2)) >= a__U51(mark(X1),X2) constraint: mark(U52(X)) >= a__U52(mark(X)) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) constraint: mark(U62(X1,X2)) >= a__U62(mark(X1),X2) constraint: mark(isNat(X)) >= a__isNat(X) constraint: Marked_a__length(cons(N,L)) >= Marked_a__U61(a__isNatList(L),L,N) constraint: Marked_a__U62(tt,L) >= Marked_a__length(mark(L)) constraint: Marked_a__U61(tt,L,N) >= Marked_a__U62(a__isNat(N),L) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a__zeros >= cons(0,zeros) ; a__zeros >= zeros ; a__U11(tt) >= tt ; a__U11(X) >= U11(X) ; a__U21(tt) >= tt ; a__U21(X) >= U21(X) ; a__U31(tt) >= tt ; a__U31(X) >= U31(X) ; a__U42(tt) >= tt ; a__U42(X) >= U42(X) ; a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) ; a__isNatIList(zeros) >= tt ; a__isNatIList(V) >= a__U31(a__isNatList(V)) ; a__isNatIList(X) >= isNatIList(X) ; a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) ; a__U41(X1,X2) >= U41(X1,X2) ; a__U52(tt) >= tt ; a__U52(X) >= U52(X) ; a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) ; a__isNatList(nil) >= tt ; a__isNatList(X) >= isNatList(X) ; a__U51(tt,V2) >= a__U52(a__isNatList(V2)) ; a__U51(X1,X2) >= U51(X1,X2) ; a__U62(tt,L) >= s(a__length(mark(L))) ; a__U62(X1,X2) >= U62(X1,X2) ; a__isNat(0) >= tt ; a__isNat(s(V1)) >= a__U21(a__isNat(V1)) ; a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) ; a__isNat(X) >= isNat(X) ; a__U61(tt,L,N) >= a__U62(a__isNat(N),L) ; a__U61(X1,X2,X3) >= U61(X1,X2,X3) ; a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) ; a__length(nil) >= 0 ; a__length(X) >= length(X) ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(0) >= 0 ; mark(zeros) >= a__zeros ; mark(tt) >= tt ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(nil) >= nil ; mark(U11(X)) >= a__U11(mark(X)) ; mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) ; mark(U51(X1,X2)) >= a__U51(mark(X1),X2) ; mark(U52(X)) >= a__U52(mark(X)) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) ; mark(U62(X1,X2)) >= a__U62(mark(X1),X2) ; mark(isNat(X)) >= a__isNat(X) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(U11(X)) >= Marked_mark(X) ; Marked_mark(U21(X)) >= Marked_mark(X) ; Marked_mark(U42(X)) >= Marked_mark(X) ; Marked_mark(U51(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U52(X)) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(U11(X)) > Marked_mark(X) ; } { Marked_mark(U21(X)) > Marked_mark(X) ; } { Marked_mark(U42(X)) > Marked_mark(X) ; } { Marked_mark(U51(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U52(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__zeros >= cons(0,zeros) constraint: a__zeros >= zeros constraint: a__U11(tt) >= tt constraint: a__U11(X) >= U11(X) constraint: a__U21(tt) >= tt constraint: a__U21(X) >= U21(X) constraint: a__U31(tt) >= tt constraint: a__U31(X) >= U31(X) constraint: a__U42(tt) >= tt constraint: a__U42(X) >= U42(X) constraint: a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(V) >= a__U31(a__isNatList(V)) constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) constraint: a__U41(X1,X2) >= U41(X1,X2) constraint: a__U52(tt) >= tt constraint: a__U52(X) >= U52(X) constraint: a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(X) >= isNatList(X) constraint: a__U51(tt,V2) >= a__U52(a__isNatList(V2)) constraint: a__U51(X1,X2) >= U51(X1,X2) constraint: a__U62(tt,L) >= s(a__length(mark(L))) constraint: a__U62(X1,X2) >= U62(X1,X2) constraint: a__isNat(0) >= tt constraint: a__isNat(s(V1)) >= a__U21(a__isNat(V1)) constraint: a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) constraint: a__isNat(X) >= isNat(X) constraint: a__U61(tt,L,N) >= a__U62(a__isNat(N),L) constraint: a__U61(X1,X2,X3) >= U61(X1,X2,X3) constraint: a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) constraint: a__length(nil) >= 0 constraint: a__length(X) >= length(X) constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(0) >= 0 constraint: mark(zeros) >= a__zeros constraint: mark(tt) >= tt constraint: mark(s(X)) >= s(mark(X)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(nil) >= nil constraint: mark(U11(X)) >= a__U11(mark(X)) constraint: mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) constraint: mark(U51(X1,X2)) >= a__U51(mark(X1),X2) constraint: mark(U52(X)) >= a__U52(mark(X)) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) constraint: mark(U62(X1,X2)) >= a__U62(mark(X1),X2) constraint: mark(isNat(X)) >= a__isNat(X) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(U11(X)) >= Marked_mark(X) constraint: Marked_mark(U21(X)) >= Marked_mark(X) 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) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a__zeros >= cons(0,zeros) ; a__zeros >= zeros ; a__U11(tt) >= tt ; a__U11(X) >= U11(X) ; a__U21(tt) >= tt ; a__U21(X) >= U21(X) ; a__U31(tt) >= tt ; a__U31(X) >= U31(X) ; a__U42(tt) >= tt ; a__U42(X) >= U42(X) ; a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) ; a__isNatIList(zeros) >= tt ; a__isNatIList(V) >= a__U31(a__isNatList(V)) ; a__isNatIList(X) >= isNatIList(X) ; a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) ; a__U41(X1,X2) >= U41(X1,X2) ; a__U52(tt) >= tt ; a__U52(X) >= U52(X) ; a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) ; a__isNatList(nil) >= tt ; a__isNatList(X) >= isNatList(X) ; a__U51(tt,V2) >= a__U52(a__isNatList(V2)) ; a__U51(X1,X2) >= U51(X1,X2) ; a__U62(tt,L) >= s(a__length(mark(L))) ; a__U62(X1,X2) >= U62(X1,X2) ; a__isNat(0) >= tt ; a__isNat(s(V1)) >= a__U21(a__isNat(V1)) ; a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) ; a__isNat(X) >= isNat(X) ; a__U61(tt,L,N) >= a__U62(a__isNat(N),L) ; a__U61(X1,X2,X3) >= U61(X1,X2,X3) ; a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) ; a__length(nil) >= 0 ; a__length(X) >= length(X) ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(0) >= 0 ; mark(zeros) >= a__zeros ; mark(tt) >= tt ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(nil) >= nil ; mark(U11(X)) >= a__U11(mark(X)) ; mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) ; mark(U51(X1,X2)) >= a__U51(mark(X1),X2) ; mark(U52(X)) >= a__U52(mark(X)) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) ; mark(U62(X1,X2)) >= a__U62(mark(X1),X2) ; mark(isNat(X)) >= a__isNat(X) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(U11(X)) >= Marked_mark(X) ; Marked_mark(U21(X)) >= Marked_mark(X) ; Marked_mark(U42(X)) >= Marked_mark(X) ; Marked_mark(U51(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U52(X)) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(U11(X)) > Marked_mark(X) ; } { Marked_mark(U21(X)) > Marked_mark(X) ; } { Marked_mark(U42(X)) > Marked_mark(X) ; } { Marked_mark(U51(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U52(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__zeros >= cons(0,zeros) constraint: a__zeros >= zeros constraint: a__U11(tt) >= tt constraint: a__U11(X) >= U11(X) constraint: a__U21(tt) >= tt constraint: a__U21(X) >= U21(X) constraint: a__U31(tt) >= tt constraint: a__U31(X) >= U31(X) constraint: a__U42(tt) >= tt constraint: a__U42(X) >= U42(X) constraint: a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(V) >= a__U31(a__isNatList(V)) constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) constraint: a__U41(X1,X2) >= U41(X1,X2) constraint: a__U52(tt) >= tt constraint: a__U52(X) >= U52(X) constraint: a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(X) >= isNatList(X) constraint: a__U51(tt,V2) >= a__U52(a__isNatList(V2)) constraint: a__U51(X1,X2) >= U51(X1,X2) constraint: a__U62(tt,L) >= s(a__length(mark(L))) constraint: a__U62(X1,X2) >= U62(X1,X2) constraint: a__isNat(0) >= tt constraint: a__isNat(s(V1)) >= a__U21(a__isNat(V1)) constraint: a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) constraint: a__isNat(X) >= isNat(X) constraint: a__U61(tt,L,N) >= a__U62(a__isNat(N),L) constraint: a__U61(X1,X2,X3) >= U61(X1,X2,X3) constraint: a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) constraint: a__length(nil) >= 0 constraint: a__length(X) >= length(X) constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(0) >= 0 constraint: mark(zeros) >= a__zeros constraint: mark(tt) >= tt constraint: mark(s(X)) >= s(mark(X)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(nil) >= nil constraint: mark(U11(X)) >= a__U11(mark(X)) constraint: mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) constraint: mark(U51(X1,X2)) >= a__U51(mark(X1),X2) constraint: mark(U52(X)) >= a__U52(mark(X)) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) constraint: mark(U62(X1,X2)) >= a__U62(mark(X1),X2) constraint: mark(isNat(X)) >= a__isNat(X) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(U11(X)) >= Marked_mark(X) constraint: Marked_mark(U21(X)) >= Marked_mark(X) 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) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a__zeros >= cons(0,zeros) ; a__zeros >= zeros ; a__U11(tt) >= tt ; a__U11(X) >= U11(X) ; a__U21(tt) >= tt ; a__U21(X) >= U21(X) ; a__U31(tt) >= tt ; a__U31(X) >= U31(X) ; a__U42(tt) >= tt ; a__U42(X) >= U42(X) ; a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) ; a__isNatIList(zeros) >= tt ; a__isNatIList(V) >= a__U31(a__isNatList(V)) ; a__isNatIList(X) >= isNatIList(X) ; a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) ; a__U41(X1,X2) >= U41(X1,X2) ; a__U52(tt) >= tt ; a__U52(X) >= U52(X) ; a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) ; a__isNatList(nil) >= tt ; a__isNatList(X) >= isNatList(X) ; a__U51(tt,V2) >= a__U52(a__isNatList(V2)) ; a__U51(X1,X2) >= U51(X1,X2) ; a__U62(tt,L) >= s(a__length(mark(L))) ; a__U62(X1,X2) >= U62(X1,X2) ; a__isNat(0) >= tt ; a__isNat(s(V1)) >= a__U21(a__isNat(V1)) ; a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) ; a__isNat(X) >= isNat(X) ; a__U61(tt,L,N) >= a__U62(a__isNat(N),L) ; a__U61(X1,X2,X3) >= U61(X1,X2,X3) ; a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) ; a__length(nil) >= 0 ; a__length(X) >= length(X) ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(0) >= 0 ; mark(zeros) >= a__zeros ; mark(tt) >= tt ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(nil) >= nil ; mark(U11(X)) >= a__U11(mark(X)) ; mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) ; mark(U51(X1,X2)) >= a__U51(mark(X1),X2) ; mark(U52(X)) >= a__U52(mark(X)) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) ; mark(U62(X1,X2)) >= a__U62(mark(X1),X2) ; mark(isNat(X)) >= a__isNat(X) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(U21(X)) >= Marked_mark(X) ; Marked_mark(U42(X)) >= Marked_mark(X) ; Marked_mark(U51(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U52(X)) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(U21(X)) > Marked_mark(X) ; } { Marked_mark(U42(X)) > Marked_mark(X) ; } { Marked_mark(U51(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U52(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__zeros >= cons(0,zeros) constraint: a__zeros >= zeros constraint: a__U11(tt) >= tt constraint: a__U11(X) >= U11(X) constraint: a__U21(tt) >= tt constraint: a__U21(X) >= U21(X) constraint: a__U31(tt) >= tt constraint: a__U31(X) >= U31(X) constraint: a__U42(tt) >= tt constraint: a__U42(X) >= U42(X) constraint: a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(V) >= a__U31(a__isNatList(V)) constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) constraint: a__U41(X1,X2) >= U41(X1,X2) constraint: a__U52(tt) >= tt constraint: a__U52(X) >= U52(X) constraint: a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(X) >= isNatList(X) constraint: a__U51(tt,V2) >= a__U52(a__isNatList(V2)) constraint: a__U51(X1,X2) >= U51(X1,X2) constraint: a__U62(tt,L) >= s(a__length(mark(L))) constraint: a__U62(X1,X2) >= U62(X1,X2) constraint: a__isNat(0) >= tt constraint: a__isNat(s(V1)) >= a__U21(a__isNat(V1)) constraint: a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) constraint: a__isNat(X) >= isNat(X) constraint: a__U61(tt,L,N) >= a__U62(a__isNat(N),L) constraint: a__U61(X1,X2,X3) >= U61(X1,X2,X3) constraint: a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) constraint: a__length(nil) >= 0 constraint: a__length(X) >= length(X) constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(0) >= 0 constraint: mark(zeros) >= a__zeros constraint: mark(tt) >= tt constraint: mark(s(X)) >= s(mark(X)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(nil) >= nil constraint: mark(U11(X)) >= a__U11(mark(X)) constraint: mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) constraint: mark(U51(X1,X2)) >= a__U51(mark(X1),X2) constraint: mark(U52(X)) >= a__U52(mark(X)) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) constraint: mark(U62(X1,X2)) >= a__U62(mark(X1),X2) constraint: mark(isNat(X)) >= a__isNat(X) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(U21(X)) >= Marked_mark(X) 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) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a__zeros >= cons(0,zeros) ; a__zeros >= zeros ; a__U11(tt) >= tt ; a__U11(X) >= U11(X) ; a__U21(tt) >= tt ; a__U21(X) >= U21(X) ; a__U31(tt) >= tt ; a__U31(X) >= U31(X) ; a__U42(tt) >= tt ; a__U42(X) >= U42(X) ; a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) ; a__isNatIList(zeros) >= tt ; a__isNatIList(V) >= a__U31(a__isNatList(V)) ; a__isNatIList(X) >= isNatIList(X) ; a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) ; a__U41(X1,X2) >= U41(X1,X2) ; a__U52(tt) >= tt ; a__U52(X) >= U52(X) ; a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) ; a__isNatList(nil) >= tt ; a__isNatList(X) >= isNatList(X) ; a__U51(tt,V2) >= a__U52(a__isNatList(V2)) ; a__U51(X1,X2) >= U51(X1,X2) ; a__U62(tt,L) >= s(a__length(mark(L))) ; a__U62(X1,X2) >= U62(X1,X2) ; a__isNat(0) >= tt ; a__isNat(s(V1)) >= a__U21(a__isNat(V1)) ; a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) ; a__isNat(X) >= isNat(X) ; a__U61(tt,L,N) >= a__U62(a__isNat(N),L) ; a__U61(X1,X2,X3) >= U61(X1,X2,X3) ; a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) ; a__length(nil) >= 0 ; a__length(X) >= length(X) ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(0) >= 0 ; mark(zeros) >= a__zeros ; mark(tt) >= tt ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(nil) >= nil ; mark(U11(X)) >= a__U11(mark(X)) ; mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) ; mark(U51(X1,X2)) >= a__U51(mark(X1),X2) ; mark(U52(X)) >= a__U52(mark(X)) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) ; mark(U62(X1,X2)) >= a__U62(mark(X1),X2) ; mark(isNat(X)) >= a__isNat(X) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(U21(X)) >= Marked_mark(X) ; Marked_mark(U42(X)) >= Marked_mark(X) ; Marked_mark(U52(X)) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(U21(X)) > Marked_mark(X) ; } { Marked_mark(U42(X)) > Marked_mark(X) ; } { Marked_mark(U52(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__zeros >= cons(0,zeros) constraint: a__zeros >= zeros constraint: a__U11(tt) >= tt constraint: a__U11(X) >= U11(X) constraint: a__U21(tt) >= tt constraint: a__U21(X) >= U21(X) constraint: a__U31(tt) >= tt constraint: a__U31(X) >= U31(X) constraint: a__U42(tt) >= tt constraint: a__U42(X) >= U42(X) constraint: a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(V) >= a__U31(a__isNatList(V)) constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) constraint: a__U41(X1,X2) >= U41(X1,X2) constraint: a__U52(tt) >= tt constraint: a__U52(X) >= U52(X) constraint: a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(X) >= isNatList(X) constraint: a__U51(tt,V2) >= a__U52(a__isNatList(V2)) constraint: a__U51(X1,X2) >= U51(X1,X2) constraint: a__U62(tt,L) >= s(a__length(mark(L))) constraint: a__U62(X1,X2) >= U62(X1,X2) constraint: a__isNat(0) >= tt constraint: a__isNat(s(V1)) >= a__U21(a__isNat(V1)) constraint: a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) constraint: a__isNat(X) >= isNat(X) constraint: a__U61(tt,L,N) >= a__U62(a__isNat(N),L) constraint: a__U61(X1,X2,X3) >= U61(X1,X2,X3) constraint: a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) constraint: a__length(nil) >= 0 constraint: a__length(X) >= length(X) constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(0) >= 0 constraint: mark(zeros) >= a__zeros constraint: mark(tt) >= tt constraint: mark(s(X)) >= s(mark(X)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(nil) >= nil constraint: mark(U11(X)) >= a__U11(mark(X)) constraint: mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) constraint: mark(U51(X1,X2)) >= a__U51(mark(X1),X2) constraint: mark(U52(X)) >= a__U52(mark(X)) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) constraint: mark(U62(X1,X2)) >= a__U62(mark(X1),X2) constraint: mark(isNat(X)) >= a__isNat(X) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(U21(X)) >= Marked_mark(X) constraint: Marked_mark(U42(X)) >= Marked_mark(X) constraint: Marked_mark(U52(X)) >= Marked_mark(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a__zeros >= cons(0,zeros) ; a__zeros >= zeros ; a__U11(tt) >= tt ; a__U11(X) >= U11(X) ; a__U21(tt) >= tt ; a__U21(X) >= U21(X) ; a__U31(tt) >= tt ; a__U31(X) >= U31(X) ; a__U42(tt) >= tt ; a__U42(X) >= U42(X) ; a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) ; a__isNatIList(zeros) >= tt ; a__isNatIList(V) >= a__U31(a__isNatList(V)) ; a__isNatIList(X) >= isNatIList(X) ; a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) ; a__U41(X1,X2) >= U41(X1,X2) ; a__U52(tt) >= tt ; a__U52(X) >= U52(X) ; a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) ; a__isNatList(nil) >= tt ; a__isNatList(X) >= isNatList(X) ; a__U51(tt,V2) >= a__U52(a__isNatList(V2)) ; a__U51(X1,X2) >= U51(X1,X2) ; a__U62(tt,L) >= s(a__length(mark(L))) ; a__U62(X1,X2) >= U62(X1,X2) ; a__isNat(0) >= tt ; a__isNat(s(V1)) >= a__U21(a__isNat(V1)) ; a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) ; a__isNat(X) >= isNat(X) ; a__U61(tt,L,N) >= a__U62(a__isNat(N),L) ; a__U61(X1,X2,X3) >= U61(X1,X2,X3) ; a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) ; a__length(nil) >= 0 ; a__length(X) >= length(X) ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(0) >= 0 ; mark(zeros) >= a__zeros ; mark(tt) >= tt ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(nil) >= nil ; mark(U11(X)) >= a__U11(mark(X)) ; mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) ; mark(U51(X1,X2)) >= a__U51(mark(X1),X2) ; mark(U52(X)) >= a__U52(mark(X)) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) ; mark(U62(X1,X2)) >= a__U62(mark(X1),X2) ; mark(isNat(X)) >= a__isNat(X) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(U21(X)) >= Marked_mark(X) ; Marked_mark(U42(X)) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(U21(X)) > Marked_mark(X) ; } { Marked_mark(U42(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__zeros >= cons(0,zeros) constraint: a__zeros >= zeros constraint: a__U11(tt) >= tt constraint: a__U11(X) >= U11(X) constraint: a__U21(tt) >= tt constraint: a__U21(X) >= U21(X) constraint: a__U31(tt) >= tt constraint: a__U31(X) >= U31(X) constraint: a__U42(tt) >= tt constraint: a__U42(X) >= U42(X) constraint: a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(V) >= a__U31(a__isNatList(V)) constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) constraint: a__U41(X1,X2) >= U41(X1,X2) constraint: a__U52(tt) >= tt constraint: a__U52(X) >= U52(X) constraint: a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(X) >= isNatList(X) constraint: a__U51(tt,V2) >= a__U52(a__isNatList(V2)) constraint: a__U51(X1,X2) >= U51(X1,X2) constraint: a__U62(tt,L) >= s(a__length(mark(L))) constraint: a__U62(X1,X2) >= U62(X1,X2) constraint: a__isNat(0) >= tt constraint: a__isNat(s(V1)) >= a__U21(a__isNat(V1)) constraint: a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) constraint: a__isNat(X) >= isNat(X) constraint: a__U61(tt,L,N) >= a__U62(a__isNat(N),L) constraint: a__U61(X1,X2,X3) >= U61(X1,X2,X3) constraint: a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) constraint: a__length(nil) >= 0 constraint: a__length(X) >= length(X) constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(0) >= 0 constraint: mark(zeros) >= a__zeros constraint: mark(tt) >= tt constraint: mark(s(X)) >= s(mark(X)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(nil) >= nil constraint: mark(U11(X)) >= a__U11(mark(X)) constraint: mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) constraint: mark(U51(X1,X2)) >= a__U51(mark(X1),X2) constraint: mark(U52(X)) >= a__U52(mark(X)) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) constraint: mark(U62(X1,X2)) >= a__U62(mark(X1),X2) constraint: mark(isNat(X)) >= a__isNat(X) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(U21(X)) >= Marked_mark(X) constraint: Marked_mark(U42(X)) >= Marked_mark(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a__zeros >= cons(0,zeros) ; a__zeros >= zeros ; a__U11(tt) >= tt ; a__U11(X) >= U11(X) ; a__U21(tt) >= tt ; a__U21(X) >= U21(X) ; a__U31(tt) >= tt ; a__U31(X) >= U31(X) ; a__U42(tt) >= tt ; a__U42(X) >= U42(X) ; a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) ; a__isNatIList(zeros) >= tt ; a__isNatIList(V) >= a__U31(a__isNatList(V)) ; a__isNatIList(X) >= isNatIList(X) ; a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) ; a__U41(X1,X2) >= U41(X1,X2) ; a__U52(tt) >= tt ; a__U52(X) >= U52(X) ; a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) ; a__isNatList(nil) >= tt ; a__isNatList(X) >= isNatList(X) ; a__U51(tt,V2) >= a__U52(a__isNatList(V2)) ; a__U51(X1,X2) >= U51(X1,X2) ; a__U62(tt,L) >= s(a__length(mark(L))) ; a__U62(X1,X2) >= U62(X1,X2) ; a__isNat(0) >= tt ; a__isNat(s(V1)) >= a__U21(a__isNat(V1)) ; a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) ; a__isNat(X) >= isNat(X) ; a__U61(tt,L,N) >= a__U62(a__isNat(N),L) ; a__U61(X1,X2,X3) >= U61(X1,X2,X3) ; a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) ; a__length(nil) >= 0 ; a__length(X) >= length(X) ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(0) >= 0 ; mark(zeros) >= a__zeros ; mark(tt) >= tt ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(nil) >= nil ; mark(U11(X)) >= a__U11(mark(X)) ; mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) ; mark(U51(X1,X2)) >= a__U51(mark(X1),X2) ; mark(U52(X)) >= a__U52(mark(X)) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) ; mark(U62(X1,X2)) >= a__U62(mark(X1),X2) ; mark(isNat(X)) >= a__isNat(X) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(U21(X)) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(U21(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__zeros >= cons(0,zeros) constraint: a__zeros >= zeros constraint: a__U11(tt) >= tt constraint: a__U11(X) >= U11(X) constraint: a__U21(tt) >= tt constraint: a__U21(X) >= U21(X) constraint: a__U31(tt) >= tt constraint: a__U31(X) >= U31(X) constraint: a__U42(tt) >= tt constraint: a__U42(X) >= U42(X) constraint: a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(V) >= a__U31(a__isNatList(V)) constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) constraint: a__U41(X1,X2) >= U41(X1,X2) constraint: a__U52(tt) >= tt constraint: a__U52(X) >= U52(X) constraint: a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(X) >= isNatList(X) constraint: a__U51(tt,V2) >= a__U52(a__isNatList(V2)) constraint: a__U51(X1,X2) >= U51(X1,X2) constraint: a__U62(tt,L) >= s(a__length(mark(L))) constraint: a__U62(X1,X2) >= U62(X1,X2) constraint: a__isNat(0) >= tt constraint: a__isNat(s(V1)) >= a__U21(a__isNat(V1)) constraint: a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) constraint: a__isNat(X) >= isNat(X) constraint: a__U61(tt,L,N) >= a__U62(a__isNat(N),L) constraint: a__U61(X1,X2,X3) >= U61(X1,X2,X3) constraint: a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) constraint: a__length(nil) >= 0 constraint: a__length(X) >= length(X) constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(0) >= 0 constraint: mark(zeros) >= a__zeros constraint: mark(tt) >= tt constraint: mark(s(X)) >= s(mark(X)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(nil) >= nil constraint: mark(U11(X)) >= a__U11(mark(X)) constraint: mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) constraint: mark(U51(X1,X2)) >= a__U51(mark(X1),X2) constraint: mark(U52(X)) >= a__U52(mark(X)) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) constraint: mark(U62(X1,X2)) >= a__U62(mark(X1),X2) constraint: mark(isNat(X)) >= a__isNat(X) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(U21(X)) >= Marked_mark(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a__zeros >= cons(0,zeros) ; a__zeros >= zeros ; a__U11(tt) >= tt ; a__U11(X) >= U11(X) ; a__U21(tt) >= tt ; a__U21(X) >= U21(X) ; a__U31(tt) >= tt ; a__U31(X) >= U31(X) ; a__U42(tt) >= tt ; a__U42(X) >= U42(X) ; a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) ; a__isNatIList(zeros) >= tt ; a__isNatIList(V) >= a__U31(a__isNatList(V)) ; a__isNatIList(X) >= isNatIList(X) ; a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) ; a__U41(X1,X2) >= U41(X1,X2) ; a__U52(tt) >= tt ; a__U52(X) >= U52(X) ; a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) ; a__isNatList(nil) >= tt ; a__isNatList(X) >= isNatList(X) ; a__U51(tt,V2) >= a__U52(a__isNatList(V2)) ; a__U51(X1,X2) >= U51(X1,X2) ; a__U62(tt,L) >= s(a__length(mark(L))) ; a__U62(X1,X2) >= U62(X1,X2) ; a__isNat(0) >= tt ; a__isNat(s(V1)) >= a__U21(a__isNat(V1)) ; a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) ; a__isNat(X) >= isNat(X) ; a__U61(tt,L,N) >= a__U62(a__isNat(N),L) ; a__U61(X1,X2,X3) >= U61(X1,X2,X3) ; a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) ; a__length(nil) >= 0 ; a__length(X) >= length(X) ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(0) >= 0 ; mark(zeros) >= a__zeros ; mark(tt) >= tt ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(nil) >= nil ; mark(U11(X)) >= a__U11(mark(X)) ; mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) ; mark(U51(X1,X2)) >= a__U51(mark(X1),X2) ; mark(U52(X)) >= a__U52(mark(X)) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) ; mark(U62(X1,X2)) >= a__U62(mark(X1),X2) ; mark(isNat(X)) >= a__isNat(X) ; Marked_mark(U21(X)) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_mark(U21(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__zeros >= cons(0,zeros) constraint: a__zeros >= zeros constraint: a__U11(tt) >= tt constraint: a__U11(X) >= U11(X) constraint: a__U21(tt) >= tt constraint: a__U21(X) >= U21(X) constraint: a__U31(tt) >= tt constraint: a__U31(X) >= U31(X) constraint: a__U42(tt) >= tt constraint: a__U42(X) >= U42(X) constraint: a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(V) >= a__U31(a__isNatList(V)) constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) constraint: a__U41(X1,X2) >= U41(X1,X2) constraint: a__U52(tt) >= tt constraint: a__U52(X) >= U52(X) constraint: a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(X) >= isNatList(X) constraint: a__U51(tt,V2) >= a__U52(a__isNatList(V2)) constraint: a__U51(X1,X2) >= U51(X1,X2) constraint: a__U62(tt,L) >= s(a__length(mark(L))) constraint: a__U62(X1,X2) >= U62(X1,X2) constraint: a__isNat(0) >= tt constraint: a__isNat(s(V1)) >= a__U21(a__isNat(V1)) constraint: a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) constraint: a__isNat(X) >= isNat(X) constraint: a__U61(tt,L,N) >= a__U62(a__isNat(N),L) constraint: a__U61(X1,X2,X3) >= U61(X1,X2,X3) constraint: a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) constraint: a__length(nil) >= 0 constraint: a__length(X) >= length(X) constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(0) >= 0 constraint: mark(zeros) >= a__zeros constraint: mark(tt) >= tt constraint: mark(s(X)) >= s(mark(X)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(nil) >= nil constraint: mark(U11(X)) >= a__U11(mark(X)) constraint: mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) constraint: mark(U51(X1,X2)) >= a__U51(mark(X1),X2) constraint: mark(U52(X)) >= a__U52(mark(X)) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) constraint: mark(U62(X1,X2)) >= a__U62(mark(X1),X2) constraint: mark(isNat(X)) >= a__isNat(X) constraint: Marked_mark(U21(X)) >= Marked_mark(X) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a__zeros >= cons(0,zeros) ; a__zeros >= zeros ; a__U11(tt) >= tt ; a__U11(X) >= U11(X) ; a__U21(tt) >= tt ; a__U21(X) >= U21(X) ; a__U31(tt) >= tt ; a__U31(X) >= U31(X) ; a__U42(tt) >= tt ; a__U42(X) >= U42(X) ; a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) ; a__isNatIList(zeros) >= tt ; a__isNatIList(V) >= a__U31(a__isNatList(V)) ; a__isNatIList(X) >= isNatIList(X) ; a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) ; a__U41(X1,X2) >= U41(X1,X2) ; a__U52(tt) >= tt ; a__U52(X) >= U52(X) ; a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) ; a__isNatList(nil) >= tt ; a__isNatList(X) >= isNatList(X) ; a__U51(tt,V2) >= a__U52(a__isNatList(V2)) ; a__U51(X1,X2) >= U51(X1,X2) ; a__U62(tt,L) >= s(a__length(mark(L))) ; a__U62(X1,X2) >= U62(X1,X2) ; a__isNat(0) >= tt ; a__isNat(s(V1)) >= a__U21(a__isNat(V1)) ; a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) ; a__isNat(X) >= isNat(X) ; a__U61(tt,L,N) >= a__U62(a__isNat(N),L) ; a__U61(X1,X2,X3) >= U61(X1,X2,X3) ; a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) ; a__length(nil) >= 0 ; a__length(X) >= length(X) ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(0) >= 0 ; mark(zeros) >= a__zeros ; mark(tt) >= tt ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(nil) >= nil ; mark(U11(X)) >= a__U11(mark(X)) ; mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) ; mark(U51(X1,X2)) >= a__U51(mark(X1),X2) ; mark(U52(X)) >= a__U52(mark(X)) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) ; mark(U62(X1,X2)) >= a__U62(mark(X1),X2) ; mark(isNat(X)) >= a__isNat(X) ; Marked_a__isNat(s(V1)) >= Marked_a__isNat(V1) ; } + Disjunctions:{ { Marked_a__isNat(s(V1)) > Marked_a__isNat(V1) ; } } === 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__zeros >= cons(0,zeros) constraint: a__zeros >= zeros constraint: a__U11(tt) >= tt constraint: a__U11(X) >= U11(X) constraint: a__U21(tt) >= tt constraint: a__U21(X) >= U21(X) constraint: a__U31(tt) >= tt constraint: a__U31(X) >= U31(X) constraint: a__U42(tt) >= tt constraint: a__U42(X) >= U42(X) constraint: a__isNatIList(cons(V1,V2)) >= a__U41(a__isNat(V1),V2) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(V) >= a__U31(a__isNatList(V)) constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__U41(tt,V2) >= a__U42(a__isNatIList(V2)) constraint: a__U41(X1,X2) >= U41(X1,X2) constraint: a__U52(tt) >= tt constraint: a__U52(X) >= U52(X) constraint: a__isNatList(cons(V1,V2)) >= a__U51(a__isNat(V1),V2) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(X) >= isNatList(X) constraint: a__U51(tt,V2) >= a__U52(a__isNatList(V2)) constraint: a__U51(X1,X2) >= U51(X1,X2) constraint: a__U62(tt,L) >= s(a__length(mark(L))) constraint: a__U62(X1,X2) >= U62(X1,X2) constraint: a__isNat(0) >= tt constraint: a__isNat(s(V1)) >= a__U21(a__isNat(V1)) constraint: a__isNat(length(V1)) >= a__U11(a__isNatList(V1)) constraint: a__isNat(X) >= isNat(X) constraint: a__U61(tt,L,N) >= a__U62(a__isNat(N),L) constraint: a__U61(X1,X2,X3) >= U61(X1,X2,X3) constraint: a__length(cons(N,L)) >= a__U61(a__isNatList(L),L,N) constraint: a__length(nil) >= 0 constraint: a__length(X) >= length(X) constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(0) >= 0 constraint: mark(zeros) >= a__zeros constraint: mark(tt) >= tt constraint: mark(s(X)) >= s(mark(X)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(nil) >= nil constraint: mark(U11(X)) >= a__U11(mark(X)) constraint: mark(U21(X)) >= a__U21(mark(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(isNatIList(X)) >= a__isNatIList(X) constraint: mark(U51(X1,X2)) >= a__U51(mark(X1),X2) constraint: mark(U52(X)) >= a__U52(mark(X)) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(U61(X1,X2,X3)) >= a__U61(mark(X1),X2,X3) constraint: mark(U62(X1,X2)) >= a__U62(mark(X1),X2) constraint: mark(isNat(X)) >= a__isNat(X) constraint: Marked_a__isNat(s(V1)) >= Marked_a__isNat(V1) APPLY CRITERIA (Graph splitting) Found 0 components: SOLVED { TRS termination of: [1] a__zeros -> cons(0,zeros) [2] a__U11(tt) -> tt [3] a__U21(tt) -> tt [4] a__U31(tt) -> tt [5] a__U41(tt,V2) -> a__U42(a__isNatIList(V2)) [6] a__U42(tt) -> tt [7] a__U51(tt,V2) -> a__U52(a__isNatList(V2)) [8] a__U52(tt) -> tt [9] a__U61(tt,L,N) -> a__U62(a__isNat(N),L) [10] a__U62(tt,L) -> s(a__length(mark(L))) [11] a__isNat(0) -> tt [12] a__isNat(length(V1)) -> a__U11(a__isNatList(V1)) [13] a__isNat(s(V1)) -> a__U21(a__isNat(V1)) [14] a__isNatIList(V) -> a__U31(a__isNatList(V)) [15] a__isNatIList(zeros) -> tt [16] a__isNatIList(cons(V1,V2)) -> a__U41(a__isNat(V1),V2) [17] a__isNatList(nil) -> tt [18] a__isNatList(cons(V1,V2)) -> a__U51(a__isNat(V1),V2) [19] a__length(nil) -> 0 [20] a__length(cons(N,L)) -> a__U61(a__isNatList(L),L,N) [21] mark(zeros) -> a__zeros [22] mark(U11(X)) -> a__U11(mark(X)) [23] mark(U21(X)) -> a__U21(mark(X)) [24] mark(U31(X)) -> a__U31(mark(X)) [25] mark(U41(X1,X2)) -> a__U41(mark(X1),X2) [26] mark(U42(X)) -> a__U42(mark(X)) [27] mark(isNatIList(X)) -> a__isNatIList(X) [28] mark(U51(X1,X2)) -> a__U51(mark(X1),X2) [29] mark(U52(X)) -> a__U52(mark(X)) [30] mark(isNatList(X)) -> a__isNatList(X) [31] mark(U61(X1,X2,X3)) -> a__U61(mark(X1),X2,X3) [32] mark(U62(X1,X2)) -> a__U62(mark(X1),X2) [33] mark(isNat(X)) -> a__isNat(X) [34] mark(length(X)) -> a__length(mark(X)) [35] mark(cons(X1,X2)) -> cons(mark(X1),X2) [36] mark(0) -> 0 [37] mark(tt) -> tt [38] mark(s(X)) -> s(mark(X)) [39] mark(nil) -> nil [40] a__zeros -> zeros [41] a__U11(X) -> U11(X) [42] a__U21(X) -> U21(X) [43] a__U31(X) -> U31(X) [44] a__U41(X1,X2) -> U41(X1,X2) [45] a__U42(X) -> U42(X) [46] a__isNatIList(X) -> isNatIList(X) [47] a__U51(X1,X2) -> U51(X1,X2) [48] a__U52(X) -> U52(X) [49] a__isNatList(X) -> isNatList(X) [50] a__U61(X1,X2,X3) -> U61(X1,X2,X3) [51] a__U62(X1,X2) -> U62(X1,X2) [52] a__isNat(X) -> isNat(X) [53] a__length(X) -> length(X) , CRITERION: MDP [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ cons ] (X0,X1) = 1*X1 + 2*X0; [ U62 ] (X0,X1) = 1*X1 + 1*X0; [ a__U61 ] (X0,X1,X2) = 1*X1 + 2*X0; [ Marked_mark ] (X0) = 2*X0 + 1; [ a__U42 ] (X0) = 1*X0; [ U31 ] (X0) = 2*X0; [ tt ] () = 0; [ Marked_a__U62 ] (X0,X1) = 2*X1 + 1; [ length ] (X0) = 1*X0; [ a__isNatList ] (X0) = 0; [ U51 ] (X0,X1) = 2*X0; [ zeros ] () = 0; [ Marked_a__length ] (X0) = 2*X0 + 1; [ a__length ] (X0) = 1*X0; [ a__U41 ] (X0,X1) = 2*X1 + 2*X0 + 1; [ U42 ] (X0) = 1*X0; [ a__U21 ] (X0) = 2*X0; [ U11 ] (X0) = 2*X0; [ a__U62 ] (X0,X1) = 1*X1 + 1*X0; [ isNatList ] (X0) = 0; [ 0 ] () = 0; [ isNat ] (X0) = 0; [ s ] (X0) = 1*X0; [ a__isNatIList ] (X0) = 2*X0 + 1; [ U41 ] (X0,X1) = 2*X1 + 2*X0 + 1; [ a__U11 ] (X0) = 2*X0; [ Marked_a__U61 ] (X0,X1,X2) = 2*X1 + 1; [ nil ] () = 0; [ a__U51 ] (X0,X1) = 2*X0; [ U52 ] (X0) = 2*X0; [ a__zeros ] () = 0; [ mark ] (X0) = 1*X0; [ a__U52 ] (X0) = 2*X0; [ isNatIList ] (X0) = 2*X0 + 1; [ a__U31 ] (X0) = 2*X0; [ U21 ] (X0) = 2*X0; [ a__isNat ] (X0) = 0; [ U61 ] (X0,X1,X2) = 1*X1 + 2*X0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ cons ] (X0,X1) = 2*X1 + 2*X0; [ U62 ] (X0,X1) = 1*X1 + 2*X0; [ a__U61 ] (X0,X1,X2) = 2*X1 + 2*X0; [ Marked_mark ] (X0) = 1*X0; [ a__U42 ] (X0) = 1*X0; [ U31 ] (X0) = 1*X0 + 1; [ tt ] () = 0; [ Marked_a__U62 ] (X0,X1) = 1*X1; [ length ] (X0) = 1*X0; [ a__isNatList ] (X0) = 0; [ U51 ] (X0,X1) = 1*X0; [ zeros ] () = 0; [ Marked_a__length ] (X0) = 1*X0; [ a__length ] (X0) = 1*X0; [ a__U41 ] (X0,X1) = 2*X1 + 1; [ U42 ] (X0) = 1*X0; [ a__U21 ] (X0) = 1*X0; [ U11 ] (X0) = 1*X0; [ a__U62 ] (X0,X1) = 1*X1 + 2*X0; [ isNatList ] (X0) = 0; [ 0 ] () = 0; [ isNat ] (X0) = 0; [ s ] (X0) = 1*X0; [ a__isNatIList ] (X0) = 1*X0 + 1; [ U41 ] (X0,X1) = 2*X1 + 1; [ a__U11 ] (X0) = 1*X0; [ Marked_a__U61 ] (X0,X1,X2) = 1*X1; [ nil ] () = 0; [ a__U51 ] (X0,X1) = 1*X0; [ U52 ] (X0) = 2*X0; [ a__zeros ] () = 0; [ mark ] (X0) = 1*X0; [ a__U52 ] (X0) = 2*X0; [ isNatIList ] (X0) = 1*X0 + 1; [ a__U31 ] (X0) = 1*X0 + 1; [ U21 ] (X0) = 1*X0; [ a__isNat ] (X0) = 0; [ U61 ] (X0,X1,X2) = 2*X1 + 2*X0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ cons ] (X0,X1) = 1*X1 + 2*X0; [ U62 ] (X0,X1) = 1*X1 + 1*X0 + 1; [ a__U61 ] (X0,X1,X2) = 1*X1 + 2*X0 + 1; [ Marked_mark ] (X0) = 1*X0; [ a__U42 ] (X0) = 2*X0; [ U31 ] (X0) = 0; [ tt ] () = 0; [ Marked_a__U62 ] (X0,X1) = 1*X1; [ length ] (X0) = 1*X0 + 1; [ a__isNatList ] (X0) = 0; [ U51 ] (X0,X1) = 2*X0; [ zeros ] () = 0; [ Marked_a__length ] (X0) = 1*X0; [ a__length ] (X0) = 1*X0 + 1; [ a__U41 ] (X0,X1) = 0; [ U42 ] (X0) = 2*X0; [ a__U21 ] (X0) = 1*X0; [ U11 ] (X0) = 2*X0; [ a__U62 ] (X0,X1) = 1*X1 + 1*X0 + 1; [ isNatList ] (X0) = 0; [ 0 ] () = 0; [ isNat ] (X0) = 0; [ s ] (X0) = 1*X0; [ a__isNatIList ] (X0) = 0; [ U41 ] (X0,X1) = 0; [ a__U11 ] (X0) = 2*X0; [ Marked_a__U61 ] (X0,X1,X2) = 1*X1; [ nil ] () = 0; [ a__U51 ] (X0,X1) = 2*X0; [ U52 ] (X0) = 2*X0; [ a__zeros ] () = 0; [ mark ] (X0) = 1*X0; [ a__U52 ] (X0) = 2*X0; [ isNatIList ] (X0) = 0; [ a__U31 ] (X0) = 0; [ U21 ] (X0) = 1*X0; [ a__isNat ] (X0) = 0; [ U61 ] (X0,X1,X2) = 1*X1 + 2*X0 + 1; removing < Marked_mark(U61(X1,X2,X3)),Marked_mark(X1)>< Marked_mark(U62(X1,X2)),Marked_mark(X1)>< Marked_mark(length(X)),Marked_mark(X)> [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ cons ] (X0,X1) = 2*X1; [ U62 ] (X0,X1) = 2; [ a__U61 ] (X0,X1,X2) = 2*X0; [ a__U42 ] (X0) = 2; [ U31 ] (X0) = 1; [ tt ] () = 1; [ Marked_a__U62 ] (X0,X1) = 2*X1; [ length ] (X0) = 1*X0; [ a__isNatList ] (X0) = 1*X0; [ U51 ] (X0,X1) = 1*X1; [ zeros ] () = 0; [ Marked_a__length ] (X0) = 2*X0; [ a__length ] (X0) = 1*X0; [ a__U41 ] (X0,X1) = 2; [ U42 ] (X0) = 2; [ a__U21 ] (X0) = 1; [ U11 ] (X0) = 1*X0; [ a__U62 ] (X0,X1) = 2; [ isNatList ] (X0) = 1*X0; [ 0 ] () = 2; [ isNat ] (X0) = 1*X0; [ s ] (X0) = 2; [ a__isNatIList ] (X0) = 2; [ U41 ] (X0,X1) = 2; [ a__U11 ] (X0) = 1*X0; [ Marked_a__U61 ] (X0,X1,X2) = 2*X1 + 2*X0; [ nil ] () = 2; [ a__U51 ] (X0,X1) = 1*X1; [ U52 ] (X0) = 1*X0; [ a__zeros ] () = 0; [ mark ] (X0) = 1*X0; [ a__U52 ] (X0) = 1*X0; [ isNatIList ] (X0) = 2; [ a__U31 ] (X0) = 1; [ U21 ] (X0) = 1; [ a__isNat ] (X0) = 1*X0; [ U61 ] (X0,X1,X2) = 2*X0; removing [ { DP termination of: , CRITERION: SG [ ]} ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ cons ] (X0,X1) = 2*X0 + 1; [ U62 ] (X0,X1) = 2; [ a__U61 ] (X0,X1,X2) = 2; [ Marked_mark ] (X0) = 3*X0; [ a__U42 ] (X0) = 1*X0; [ U31 ] (X0) = 0; [ tt ] () = 0; [ length ] (X0) = 2; [ a__isNatList ] (X0) = 0; [ U51 ] (X0,X1) = 1*X0; [ zeros ] () = 2; [ a__length ] (X0) = 2; [ a__U41 ] (X0,X1) = 0; [ U42 ] (X0) = 1*X0; [ a__U21 ] (X0) = 2*X0; [ U11 ] (X0) = 2*X0; [ a__U62 ] (X0,X1) = 2; [ isNatList ] (X0) = 0; [ 0 ] () = 0; [ isNat ] (X0) = 0; [ s ] (X0) = 1*X0; [ a__isNatIList ] (X0) = 0; [ U41 ] (X0,X1) = 0; [ a__U11 ] (X0) = 2*X0; [ nil ] () = 0; [ a__U51 ] (X0,X1) = 1*X0; [ U52 ] (X0) = 2*X0; [ a__zeros ] () = 2; [ mark ] (X0) = 2*X0; [ a__U52 ] (X0) = 2*X0; [ isNatIList ] (X0) = 0; [ a__U31 ] (X0) = 0; [ U21 ] (X0) = 2*X0; [ a__isNat ] (X0) = 0; [ U61 ] (X0,X1,X2) = 2; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ cons ] (X0,X1) = 2*X1 + 2*X0; [ U62 ] (X0,X1) = 2*X1 + 1; [ a__U61 ] (X0,X1,X2) = 2*X1 + 1*X0 + 1; [ Marked_mark ] (X0) = 3*X0; [ a__U42 ] (X0) = 2*X0; [ U31 ] (X0) = 0; [ tt ] () = 0; [ length ] (X0) = 2*X0 + 1; [ a__isNatList ] (X0) = 2*X0; [ U51 ] (X0,X1) = 2*X1 + 2*X0; [ zeros ] () = 0; [ a__length ] (X0) = 2*X0 + 1; [ a__U41 ] (X0,X1) = 0; [ U42 ] (X0) = 2*X0; [ a__U21 ] (X0) = 1*X0; [ U11 ] (X0) = 2*X0 + 2; [ a__U62 ] (X0,X1) = 2*X1 + 1; [ isNatList ] (X0) = 2*X0; [ 0 ] () = 0; [ isNat ] (X0) = 2*X0; [ s ] (X0) = 1*X0; [ a__isNatIList ] (X0) = 0; [ U41 ] (X0,X1) = 0; [ a__U11 ] (X0) = 2*X0 + 2; [ nil ] () = 0; [ a__U51 ] (X0,X1) = 2*X1 + 2*X0; [ U52 ] (X0) = 1*X0; [ a__zeros ] () = 0; [ mark ] (X0) = 1*X0; [ a__U52 ] (X0) = 1*X0; [ isNatIList ] (X0) = 0; [ a__U31 ] (X0) = 0; [ U21 ] (X0) = 1*X0; [ a__isNat ] (X0) = 2*X0; [ U61 ] (X0,X1,X2) = 2*X1 + 1*X0 + 1; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ cons ] (X0,X1) = 0; [ U62 ] (X0,X1) = 0; [ a__U61 ] (X0,X1,X2) = 0; [ Marked_mark ] (X0) = 3*X0; [ a__U42 ] (X0) = 1*X0; [ U31 ] (X0) = 0; [ tt ] () = 0; [ length ] (X0) = 0; [ a__isNatList ] (X0) = 1; [ U51 ] (X0,X1) = 1*X0 + 1; [ zeros ] () = 0; [ a__length ] (X0) = 0; [ a__U41 ] (X0,X1) = 0; [ U42 ] (X0) = 1*X0; [ a__U21 ] (X0) = 2*X0; [ U11 ] (X0) = 0; [ a__U62 ] (X0,X1) = 0; [ isNatList ] (X0) = 1; [ 0 ] () = 0; [ isNat ] (X0) = 0; [ s ] (X0) = 1*X0; [ a__isNatIList ] (X0) = 0; [ U41 ] (X0,X1) = 0; [ a__U11 ] (X0) = 0; [ nil ] () = 0; [ a__U51 ] (X0,X1) = 1*X0 + 1; [ U52 ] (X0) = 1*X0; [ a__zeros ] () = 0; [ mark ] (X0) = 1*X0; [ a__U52 ] (X0) = 1*X0; [ isNatIList ] (X0) = 0; [ a__U31 ] (X0) = 0; [ U21 ] (X0) = 2*X0; [ a__isNat ] (X0) = 0; [ U61 ] (X0,X1,X2) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ cons ] (X0,X1) = 1*X1 + 2; [ U62 ] (X0,X1) = 0; [ a__U61 ] (X0,X1,X2) = 0; [ Marked_mark ] (X0) = 3*X0; [ a__U42 ] (X0) = 2*X0; [ U31 ] (X0) = 0; [ tt ] () = 0; [ length ] (X0) = 0; [ a__isNatList ] (X0) = 1*X0; [ U51 ] (X0,X1) = 1*X1 + 1; [ zeros ] () = 1; [ a__length ] (X0) = 0; [ a__U41 ] (X0,X1) = 0; [ U42 ] (X0) = 2*X0; [ a__U21 ] (X0) = 2*X0; [ U11 ] (X0) = 0; [ a__U62 ] (X0,X1) = 0; [ isNatList ] (X0) = 1*X0; [ 0 ] () = 0; [ isNat ] (X0) = 0; [ s ] (X0) = 2*X0; [ a__isNatIList ] (X0) = 0; [ U41 ] (X0,X1) = 0; [ a__U11 ] (X0) = 0; [ nil ] () = 0; [ a__U51 ] (X0,X1) = 1*X1 + 1; [ U52 ] (X0) = 1*X0 + 1; [ a__zeros ] () = 3; [ mark ] (X0) = 3*X0; [ a__U52 ] (X0) = 1*X0 + 1; [ isNatIList ] (X0) = 0; [ a__U31 ] (X0) = 0; [ U21 ] (X0) = 2*X0; [ a__isNat ] (X0) = 0; [ U61 ] (X0,X1,X2) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ cons ] (X0,X1) = 3*X1 + 2; [ U62 ] (X0,X1) = 2*X0 + 2; [ a__U61 ] (X0,X1,X2) = 2; [ Marked_mark ] (X0) = 3*X0; [ a__U42 ] (X0) = 1*X0 + 1; [ U31 ] (X0) = 0; [ tt ] () = 0; [ length ] (X0) = 1; [ a__isNatList ] (X0) = 2; [ U51 ] (X0,X1) = 1; [ zeros ] () = 0; [ a__length ] (X0) = 2; [ a__U41 ] (X0,X1) = 3*X1 + 2*X0 + 2; [ U42 ] (X0) = 1*X0 + 1; [ a__U21 ] (X0) = 1*X0; [ U11 ] (X0) = 0; [ a__U62 ] (X0,X1) = 2*X0 + 2; [ isNatList ] (X0) = 0; [ 0 ] () = 0; [ isNat ] (X0) = 0; [ s ] (X0) = 1*X0; [ a__isNatIList ] (X0) = 3*X0; [ U41 ] (X0,X1) = 3*X1 + 2*X0 + 2; [ a__U11 ] (X0) = 0; [ nil ] () = 0; [ a__U51 ] (X0,X1) = 2; [ U52 ] (X0) = 0; [ a__zeros ] () = 2; [ mark ] (X0) = 3*X0 + 2; [ a__U52 ] (X0) = 0; [ isNatIList ] (X0) = 3*X0; [ a__U31 ] (X0) = 0; [ U21 ] (X0) = 1*X0; [ a__isNat ] (X0) = 0; [ U61 ] (X0,X1,X2) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ cons ] (X0,X1) = 3*X1; [ U62 ] (X0,X1) = 2*X1 + 1; [ a__U61 ] (X0,X1,X2) = 2*X1 + 2*X0; [ Marked_mark ] (X0) = 3*X0; [ a__U42 ] (X0) = 1*X0; [ U31 ] (X0) = 1*X0; [ tt ] () = 2; [ length ] (X0) = 2*X0; [ a__isNatList ] (X0) = 2*X0; [ U51 ] (X0,X1) = 2*X1; [ zeros ] () = 0; [ a__length ] (X0) = 2*X0; [ a__U41 ] (X0,X1) = 2*X1 + 2; [ U42 ] (X0) = 1*X0; [ a__U21 ] (X0) = 1*X0; [ U11 ] (X0) = 2; [ a__U62 ] (X0,X1) = 2*X1 + 1; [ isNatList ] (X0) = 2*X0; [ 0 ] () = 0; [ isNat ] (X0) = 2; [ s ] (X0) = 1*X0 + 1; [ a__isNatIList ] (X0) = 2*X0 + 2; [ U41 ] (X0,X1) = 2*X1 + 2; [ a__U11 ] (X0) = 2; [ nil ] () = 1; [ a__U51 ] (X0,X1) = 2*X1; [ U52 ] (X0) = 1*X0; [ a__zeros ] () = 0; [ mark ] (X0) = 1*X0; [ a__U52 ] (X0) = 1*X0; [ isNatIList ] (X0) = 2*X0 + 2; [ a__U31 ] (X0) = 1*X0; [ U21 ] (X0) = 1*X0; [ a__isNat ] (X0) = 2; [ U61 ] (X0,X1,X2) = 2*X1 + 2*X0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ cons ] (X0,X1) = 3*X1 + 0; [ U62 ] (X0,X1) = 2 + 1*X1 + 0; [ a__U61 ] (X0,X1,X2) = 2*X0 + 1*X1 + 0; [ Marked_mark ] (X0) = 3*X0 + 0; [ a__U42 ] (X0) = 1*X0 + 0; [ U31 ] (X0) = 2*X0 + 0; [ tt ] () = 2 + 0; [ length ] (X0) = 1*X0 + 0; [ a__isNatList ] (X0) = 1*X0 + 0; [ U51 ] (X0,X1) = 1*X1 + 0; [ zeros ] () = 0; [ a__length ] (X0) = 1*X0 + 0; [ a__U41 ] (X0,X1) = 2 + 2*X1 + 0; [ U42 ] (X0) = 1*X0 + 0; [ a__U21 ] (X0) = 2 + 1*X0 + 0; [ U11 ] (X0) = 1*X0 + 0; [ a__U62 ] (X0,X1) = 2 + 1*X1 + 0; [ isNatList ] (X0) = 1*X0 + 0; [ 0 ] () = 2 + 0; [ isNat ] (X0) = 1*X0 + 0; [ s ] (X0) = 2 + 1*X0 + 0; [ a__isNatIList ] (X0) = 2 + 2*X0 + 0; [ U41 ] (X0,X1) = 2 + 2*X1 + 0; [ a__U11 ] (X0) = 1*X0 + 0; [ nil ] () = 2 + 0; [ a__U51 ] (X0,X1) = 1*X1 + 0; [ U52 ] (X0) = 1*X0 + 0; [ a__zeros ] () = 0; [ mark ] (X0) = 1*X0 + 0; [ a__U52 ] (X0) = 1*X0 + 0; [ isNatIList ] (X0) = 2 + 2*X0 + 0; [ a__U31 ] (X0) = 2*X0 + 0; [ U21 ] (X0) = 2 + 1*X0 + 0; [ a__isNat ] (X0) = 1*X0 + 0; [ U61 ] (X0,X1,X2) = 2*X0 + 1*X1 + 0; ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ cons ] (X0,X1) = 3 + 1*X0 + 2*X1 + 0; [ U62 ] (X0,X1) = 0; [ a__U61 ] (X0,X1,X2) = 3 + 0; [ a__U42 ] (X0) = 0; [ U31 ] (X0) = 0; [ tt ] () = 0; [ length ] (X0) = 2 + 0; [ a__isNatList ] (X0) = 0; [ U51 ] (X0,X1) = 0; [ zeros ] () = 0; [ a__length ] (X0) = 3 + 0; [ a__U41 ] (X0,X1) = 0; [ U42 ] (X0) = 0; [ a__U21 ] (X0) = 0; [ U11 ] (X0) = 0; [ a__U62 ] (X0,X1) = 0; [ isNatList ] (X0) = 0; [ 0 ] () = 0; [ isNat ] (X0) = 0; [ s ] (X0) = 0; [ a__isNatIList ] (X0) = 2 + 0; [ Marked_a__isNatIList ] (X0) = 1 + 3*X0 + 0; [ U41 ] (X0,X1) = 0; [ a__U11 ] (X0) = 0; [ nil ] () = 0; [ a__U51 ] (X0,X1) = 0; [ U52 ] (X0) = 0; [ a__zeros ] () = 3 + 0; [ mark ] (X0) = 3 + 2*X0 + 0; [ a__U52 ] (X0) = 0; [ Marked_a__U41 ] (X0,X1) = 2 + 1*X0 + 3*X1 + 0; [ isNatIList ] (X0) = 0; [ a__U31 ] (X0) = 0; [ U21 ] (X0) = 0; [ a__isNat ] (X0) = 2 + 0; [ U61 ] (X0,X1,X2) = 0; ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ cons ] (X0,X1) = 3*X1 + 2*X0 + 2; [ U62 ] (X0,X1) = 2*X1 + 2*X0 + 2; [ a__U61 ] (X0,X1,X2) = 3*X1 + 2; [ a__U42 ] (X0) = 0; [ Marked_a__U51 ] (X0,X1) = 3*X1 + 3; [ U31 ] (X0) = 0; [ tt ] () = 0; [ length ] (X0) = 1*X0; [ a__isNatList ] (X0) = 0; [ U51 ] (X0,X1) = 0; [ zeros ] () = 0; [ a__length ] (X0) = 1*X0; [ a__U41 ] (X0,X1) = 1*X0; [ U42 ] (X0) = 0; [ a__U21 ] (X0) = 1*X0; [ Marked_a__isNatList ] (X0) = 2*X0 + 1; [ U11 ] (X0) = 0; [ a__U62 ] (X0,X1) = 3*X1 + 2*X0 + 2; [ isNatList ] (X0) = 0; [ 0 ] () = 0; [ isNat ] (X0) = 0; [ s ] (X0) = 1*X0; [ a__isNatIList ] (X0) = 0; [ U41 ] (X0,X1) = 1*X0; [ a__U11 ] (X0) = 0; [ nil ] () = 0; [ a__U51 ] (X0,X1) = 0; [ U52 ] (X0) = 1*X0; [ a__zeros ] () = 2; [ Marked_a__isNat ] (X0) = 2*X0 + 2; [ mark ] (X0) = 3*X0 + 2; [ a__U52 ] (X0) = 1*X0; [ isNatIList ] (X0) = 0; [ a__U31 ] (X0) = 0; [ U21 ] (X0) = 1*X0; [ a__isNat ] (X0) = 0; [ U61 ] (X0,X1,X2) = 3*X1; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ cons ] (X0,X1) = 2*X1 + 0; [ U62 ] (X0,X1) = 1 + 2*X1 + 0; [ a__U61 ] (X0,X1,X2) = 2*X0 + 2*X1 + 0; [ a__U42 ] (X0) = 2 + 0; [ U31 ] (X0) = 1*X0 + 0; [ tt ] () = 2 + 0; [ length ] (X0) = 2*X0 + 0; [ a__isNatList ] (X0) = 1*X0 + 0; [ U51 ] (X0,X1) = 1*X1 + 0; [ zeros ] () = 0; [ a__length ] (X0) = 2*X0 + 0; [ a__U41 ] (X0,X1) = 2 + 0; [ U42 ] (X0) = 2 + 0; [ a__U21 ] (X0) = 1*X0 + 0; [ U11 ] (X0) = 1 + 1*X0 + 0; [ a__U62 ] (X0,X1) = 1 + 2*X1 + 0; [ isNatList ] (X0) = 1*X0 + 0; [ 0 ] () = 1 + 0; [ isNat ] (X0) = 1 + 1*X0 + 0; [ s ] (X0) = 1 + 1*X0 + 0; [ a__isNatIList ] (X0) = 2 + 1*X0 + 0; [ U41 ] (X0,X1) = 2 + 0; [ a__U11 ] (X0) = 1 + 1*X0 + 0; [ nil ] () = 2 + 0; [ a__U51 ] (X0,X1) = 1*X1 + 0; [ U52 ] (X0) = 1*X0 + 0; [ a__zeros ] () = 0; [ Marked_a__isNat ] (X0) = 3*X0 + 0; [ mark ] (X0) = 1*X0 + 0; [ a__U52 ] (X0) = 1*X0 + 0; [ isNatIList ] (X0) = 2 + 1*X0 + 0; [ a__U31 ] (X0) = 1*X0 + 0; [ U21 ] (X0) = 1*X0 + 0; [ a__isNat ] (X0) = 1 + 1*X0 + 0; [ U61 ] (X0,X1,X2) = 2*X0 + 2*X1 + 0; ]} ]} ]} ]} ]} Cime worked for 2.210399 seconds (real time) Cime Exit Status: 0