- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] a__and(tt,T) -> mark(T) [2] a__isNatIList(IL) -> a__isNatList(IL) [3] a__isNat(0) -> tt [4] a__isNat(s(N)) -> a__isNat(N) [5] a__isNat(length(L)) -> a__isNatList(L) [6] a__isNatIList(zeros) -> tt [7] a__isNatIList(cons(N,IL)) -> a__and(a__isNat(N),a__isNatIList(IL)) [8] a__isNatList(nil) -> tt [9] a__isNatList(cons(N,L)) -> a__and(a__isNat(N),a__isNatList(L)) [10] a__isNatList(take(N,IL)) -> a__and(a__isNat(N),a__isNatIList(IL)) [11] a__zeros -> cons(0,zeros) [12] a__take(0,IL) -> a__uTake1(a__isNatIList(IL)) [13] a__uTake1(tt) -> nil [14] a__take(s(M),cons(N,IL)) -> a__uTake2(a__and(a__isNat(M),a__and(a__isNat(N),a__isNatIList(IL))),M,N,IL) [15] a__uTake2(tt,M,N,IL) -> cons(mark(N),take(M,IL)) [16] a__length(cons(N,L)) -> a__uLength(a__and(a__isNat(N),a__isNatList(L)),L) [17] a__uLength(tt,L) -> s(a__length(mark(L))) [18] mark(and(X1,X2)) -> a__and(mark(X1),mark(X2)) [19] mark(isNatIList(X)) -> a__isNatIList(X) [20] mark(isNatList(X)) -> a__isNatList(X) [21] mark(isNat(X)) -> a__isNat(X) [22] mark(length(X)) -> a__length(mark(X)) [23] mark(zeros) -> a__zeros [24] mark(take(X1,X2)) -> a__take(mark(X1),mark(X2)) [25] mark(uTake1(X)) -> a__uTake1(mark(X)) [26] mark(uTake2(X1,X2,X3,X4)) -> a__uTake2(mark(X1),X2,X3,X4) [27] mark(uLength(X1,X2)) -> a__uLength(mark(X1),X2) [28] mark(tt) -> tt [29] mark(0) -> 0 [30] mark(s(X)) -> s(mark(X)) [31] mark(cons(X1,X2)) -> cons(mark(X1),X2) [32] mark(nil) -> nil [33] a__and(X1,X2) -> and(X1,X2) [34] a__isNatIList(X) -> isNatIList(X) [35] a__isNatList(X) -> isNatList(X) [36] a__isNat(X) -> isNat(X) [37] a__length(X) -> length(X) [38] a__zeros -> zeros [39] a__take(X1,X2) -> take(X1,X2) [40] a__uTake1(X) -> uTake1(X) [41] a__uTake2(X1,X2,X3,X4) -> uTake2(X1,X2,X3,X4) [42] a__uLength(X1,X2) -> uLength(X1,X2) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(tt) >= tt ; mark(0) >= 0 ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(zeros) >= a__zeros ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(nil) >= nil ; mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) ; mark(and(X1,X2)) >= a__and(mark(X1),mark(X2)) ; mark(isNatIList(X)) >= a__isNatIList(X) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(isNat(X)) >= a__isNat(X) ; mark(uTake1(X)) >= a__uTake1(mark(X)) ; mark(uTake2(X1,X2,X3,X4)) >= a__uTake2(mark(X1),X2,X3,X4) ; mark(uLength(X1,X2)) >= a__uLength(mark(X1),X2) ; a__and(tt,T) >= mark(T) ; a__and(X1,X2) >= and(X1,X2) ; a__isNatList(cons(N,L)) >= a__and(a__isNat(N),a__isNatList(L)) ; a__isNatList(nil) >= tt ; a__isNatList(take(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatList(X) >= isNatList(X) ; a__isNatIList(zeros) >= tt ; a__isNatIList(cons(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatIList(IL) >= a__isNatList(IL) ; a__isNatIList(X) >= isNatIList(X) ; a__isNat(0) >= tt ; a__isNat(s(N)) >= a__isNat(N) ; a__isNat(length(L)) >= a__isNatList(L) ; a__isNat(X) >= isNat(X) ; a__zeros >= zeros ; a__zeros >= cons(0,zeros) ; a__uTake1(tt) >= nil ; a__uTake1(X) >= uTake1(X) ; a__take(0,IL) >= a__uTake1(a__isNatIList(IL)) ; a__take(s(M),cons(N,IL)) >= a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N),a__isNatIList(IL))), M,N,IL) ; a__take(X1,X2) >= take(X1,X2) ; a__uTake2(tt,M,N,IL) >= cons(mark(N),take(M,IL)) ; a__uTake2(X1,X2,X3,X4) >= uTake2(X1,X2,X3,X4) ; a__uLength(tt,L) >= s(a__length(mark(L))) ; a__uLength(X1,X2) >= uLength(X1,X2) ; a__length(cons(N,L)) >= a__uLength(a__and(a__isNat(N),a__isNatList(L)),L) ; a__length(X) >= length(X) ; Marked_a__uLength(tt,L) >= Marked_a__length(mark(L)) ; Marked_a__uLength(tt,L) >= Marked_mark(L) ; Marked_a__uTake2(tt,M,N,IL) >= Marked_mark(N) ; Marked_a__take(0,IL) >= Marked_a__isNatIList(IL) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M,N,IL) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__isNat(N) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__isNat(M) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__isNatIList(IL) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__and(a__isNat(M), a__and(a__isNat(N),a__isNatIList(IL))) ; Marked_a__length(cons(N,L)) >= Marked_a__uLength(a__and(a__isNat(N), a__isNatList(L)), L) ; Marked_a__length(cons(N,L)) >= Marked_a__isNat(N) ; Marked_a__length(cons(N,L)) >= Marked_a__isNatList(L) ; Marked_a__length(cons(N,L)) >= Marked_a__and(a__isNat(N),a__isNatList(L)) ; Marked_a__isNat(s(N)) >= Marked_a__isNat(N) ; Marked_a__isNat(length(L)) >= Marked_a__isNatList(L) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__isNat(N) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__isNatList(L) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__and(a__isNat(N),a__isNatList(L)) ; Marked_a__isNatList(take(N,IL)) >= Marked_a__isNat(N) ; Marked_a__isNatList(take(N,IL)) >= Marked_a__isNatIList(IL) ; Marked_a__isNatList(take(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNat(N) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNatIList(IL) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; Marked_a__isNatIList(IL) >= Marked_a__isNatList(IL) ; Marked_a__and(tt,T) >= Marked_mark(T) ; 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(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(take(X1,X2)) >= Marked_a__take(mark(X1),mark(X2)) ; Marked_mark(take(X1,X2)) >= Marked_mark(X1) ; Marked_mark(take(X1,X2)) >= Marked_mark(X2) ; Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),mark(X2)) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_mark(X2) ; Marked_mark(isNatIList(X)) >= Marked_a__isNatIList(X) ; Marked_mark(isNatList(X)) >= Marked_a__isNatList(X) ; Marked_mark(isNat(X)) >= Marked_a__isNat(X) ; Marked_mark(uTake1(X)) >= Marked_mark(X) ; Marked_mark(uTake2(X1,X2,X3,X4)) >= Marked_a__uTake2(mark(X1),X2,X3,X4) ; Marked_mark(uTake2(X1,X2,X3,X4)) >= Marked_mark(X1) ; Marked_mark(uLength(X1,X2)) >= Marked_a__uLength(mark(X1),X2) ; Marked_mark(uLength(X1,X2)) >= Marked_mark(X1) ; } + Disjunctions:{ { Marked_a__uLength(tt,L) > Marked_a__length(mark(L)) ; } { Marked_a__uLength(tt,L) > Marked_mark(L) ; } { Marked_a__uTake2(tt,M,N,IL) > Marked_mark(N) ; } { Marked_a__take(0,IL) > Marked_a__isNatIList(IL) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M,N,IL) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__isNat(N) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__isNat(M) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__isNatIList(IL) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__and(a__isNat(M), a__and(a__isNat(N),a__isNatIList(IL))) ; } { Marked_a__length(cons(N,L)) > Marked_a__uLength(a__and(a__isNat(N), a__isNatList(L)),L) ; } { Marked_a__length(cons(N,L)) > Marked_a__isNat(N) ; } { Marked_a__length(cons(N,L)) > Marked_a__isNatList(L) ; } { Marked_a__length(cons(N,L)) > Marked_a__and(a__isNat(N),a__isNatList(L)) ; } { Marked_a__isNat(s(N)) > Marked_a__isNat(N) ; } { Marked_a__isNat(length(L)) > Marked_a__isNatList(L) ; } { Marked_a__isNatList(cons(N,L)) > Marked_a__isNat(N) ; } { Marked_a__isNatList(cons(N,L)) > Marked_a__isNatList(L) ; } { Marked_a__isNatList(cons(N,L)) > Marked_a__and(a__isNat(N),a__isNatList(L)) ; } { Marked_a__isNatList(take(N,IL)) > Marked_a__isNat(N) ; } { Marked_a__isNatList(take(N,IL)) > Marked_a__isNatIList(IL) ; } { Marked_a__isNatList(take(N,IL)) > Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__isNat(N) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__isNatIList(IL) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; } { Marked_a__isNatIList(IL) > Marked_a__isNatList(IL) ; } { Marked_a__and(tt,T) > Marked_mark(T) ; } { 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(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(take(X1,X2)) > Marked_a__take(mark(X1),mark(X2)) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(and(X1,X2)) > Marked_a__and(mark(X1),mark(X2)) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(isNatIList(X)) > Marked_a__isNatIList(X) ; } { Marked_mark(isNatList(X)) > Marked_a__isNatList(X) ; } { Marked_mark(isNat(X)) > Marked_a__isNat(X) ; } { Marked_mark(uTake1(X)) > Marked_mark(X) ; } { Marked_mark(uTake2(X1,X2,X3,X4)) > Marked_a__uTake2(mark(X1),X2,X3,X4) ; } { Marked_mark(uTake2(X1,X2,X3,X4)) > Marked_mark(X1) ; } { Marked_mark(uLength(X1,X2)) > Marked_a__uLength(mark(X1),X2) ; } { Marked_mark(uLength(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: mark(tt) >= tt constraint: mark(0) >= 0 constraint: mark(s(X)) >= s(mark(X)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(zeros) >= a__zeros constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(nil) >= nil constraint: mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) constraint: mark(and(X1,X2)) >= a__and(mark(X1),mark(X2)) constraint: mark(isNatIList(X)) >= a__isNatIList(X) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(isNat(X)) >= a__isNat(X) constraint: mark(uTake1(X)) >= a__uTake1(mark(X)) constraint: mark(uTake2(X1,X2,X3,X4)) >= a__uTake2(mark(X1),X2,X3,X4) constraint: mark(uLength(X1,X2)) >= a__uLength(mark(X1),X2) constraint: a__and(tt,T) >= mark(T) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isNatList(cons(N,L)) >= a__and(a__isNat(N),a__isNatList(L)) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(take(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) constraint: a__isNatList(X) >= isNatList(X) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(cons(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) constraint: a__isNatIList(IL) >= a__isNatList(IL) constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__isNat(0) >= tt constraint: a__isNat(s(N)) >= a__isNat(N) constraint: a__isNat(length(L)) >= a__isNatList(L) constraint: a__isNat(X) >= isNat(X) constraint: a__zeros >= zeros constraint: a__zeros >= cons(0,zeros) constraint: a__uTake1(tt) >= nil constraint: a__uTake1(X) >= uTake1(X) constraint: a__take(0,IL) >= a__uTake1(a__isNatIList(IL)) constraint: a__take(s(M),cons(N,IL)) >= a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M,N,IL) constraint: a__take(X1,X2) >= take(X1,X2) constraint: a__uTake2(tt,M,N,IL) >= cons(mark(N),take(M,IL)) constraint: a__uTake2(X1,X2,X3,X4) >= uTake2(X1,X2,X3,X4) constraint: a__uLength(tt,L) >= s(a__length(mark(L))) constraint: a__uLength(X1,X2) >= uLength(X1,X2) constraint: a__length(cons(N,L)) >= a__uLength(a__and(a__isNat(N), a__isNatList(L)),L) constraint: a__length(X) >= length(X) constraint: Marked_a__uLength(tt,L) >= Marked_a__length(mark(L)) constraint: Marked_a__uLength(tt,L) >= Marked_mark(L) constraint: Marked_a__uTake2(tt,M,N,IL) >= Marked_mark(N) constraint: Marked_a__take(0,IL) >= Marked_a__isNatIList(IL) constraint: Marked_a__take(s(M),cons(N,IL)) >= Marked_a__uTake2(a__and( a__isNat( M), a__and( a__isNat( N), a__isNatIList( IL))), M,N,IL) constraint: Marked_a__take(s(M),cons(N,IL)) >= Marked_a__isNat(N) constraint: Marked_a__take(s(M),cons(N,IL)) >= Marked_a__isNat(M) constraint: Marked_a__take(s(M),cons(N,IL)) >= Marked_a__isNatIList(IL) constraint: Marked_a__take(s(M),cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) constraint: Marked_a__take(s(M),cons(N,IL)) >= Marked_a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))) constraint: Marked_a__length(cons(N,L)) >= Marked_a__uLength(a__and(a__isNat(N), a__isNatList(L)), L) constraint: Marked_a__length(cons(N,L)) >= Marked_a__isNat(N) constraint: Marked_a__length(cons(N,L)) >= Marked_a__isNatList(L) constraint: Marked_a__length(cons(N,L)) >= Marked_a__and(a__isNat(N), a__isNatList(L)) constraint: Marked_a__isNat(s(N)) >= Marked_a__isNat(N) constraint: Marked_a__isNat(length(L)) >= Marked_a__isNatList(L) constraint: Marked_a__isNatList(cons(N,L)) >= Marked_a__isNat(N) constraint: Marked_a__isNatList(cons(N,L)) >= Marked_a__isNatList(L) constraint: Marked_a__isNatList(cons(N,L)) >= Marked_a__and(a__isNat(N), a__isNatList(L)) constraint: Marked_a__isNatList(take(N,IL)) >= Marked_a__isNat(N) constraint: Marked_a__isNatList(take(N,IL)) >= Marked_a__isNatIList(IL) constraint: Marked_a__isNatList(take(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) constraint: Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNat(N) constraint: Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNatIList(IL) constraint: Marked_a__isNatIList(cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) constraint: Marked_a__isNatIList(IL) >= Marked_a__isNatList(IL) constraint: Marked_a__and(tt,T) >= Marked_mark(T) 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(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(take(X1,X2)) >= Marked_a__take(mark(X1),mark(X2)) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),mark(X2)) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(isNatIList(X)) >= Marked_a__isNatIList(X) constraint: Marked_mark(isNatList(X)) >= Marked_a__isNatList(X) constraint: Marked_mark(isNat(X)) >= Marked_a__isNat(X) constraint: Marked_mark(uTake1(X)) >= Marked_mark(X) constraint: Marked_mark(uTake2(X1,X2,X3,X4)) >= Marked_a__uTake2(mark(X1), X2,X3,X4) constraint: Marked_mark(uTake2(X1,X2,X3,X4)) >= Marked_mark(X1) constraint: Marked_mark(uLength(X1,X2)) >= Marked_a__uLength(mark(X1),X2) constraint: Marked_mark(uLength(X1,X2)) >= Marked_mark(X1) APPLY CRITERIA (Graph splitting) Found 2 components: { --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(tt) >= tt ; mark(0) >= 0 ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(zeros) >= a__zeros ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(nil) >= nil ; mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) ; mark(and(X1,X2)) >= a__and(mark(X1),mark(X2)) ; mark(isNatIList(X)) >= a__isNatIList(X) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(isNat(X)) >= a__isNat(X) ; mark(uTake1(X)) >= a__uTake1(mark(X)) ; mark(uTake2(X1,X2,X3,X4)) >= a__uTake2(mark(X1),X2,X3,X4) ; mark(uLength(X1,X2)) >= a__uLength(mark(X1),X2) ; a__and(tt,T) >= mark(T) ; a__and(X1,X2) >= and(X1,X2) ; a__isNatList(cons(N,L)) >= a__and(a__isNat(N),a__isNatList(L)) ; a__isNatList(nil) >= tt ; a__isNatList(take(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatList(X) >= isNatList(X) ; a__isNatIList(zeros) >= tt ; a__isNatIList(cons(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatIList(IL) >= a__isNatList(IL) ; a__isNatIList(X) >= isNatIList(X) ; a__isNat(0) >= tt ; a__isNat(s(N)) >= a__isNat(N) ; a__isNat(length(L)) >= a__isNatList(L) ; a__isNat(X) >= isNat(X) ; a__zeros >= zeros ; a__zeros >= cons(0,zeros) ; a__uTake1(tt) >= nil ; a__uTake1(X) >= uTake1(X) ; a__take(0,IL) >= a__uTake1(a__isNatIList(IL)) ; a__take(s(M),cons(N,IL)) >= a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N),a__isNatIList(IL))), M,N,IL) ; a__take(X1,X2) >= take(X1,X2) ; a__uTake2(tt,M,N,IL) >= cons(mark(N),take(M,IL)) ; a__uTake2(X1,X2,X3,X4) >= uTake2(X1,X2,X3,X4) ; a__uLength(tt,L) >= s(a__length(mark(L))) ; a__uLength(X1,X2) >= uLength(X1,X2) ; a__length(cons(N,L)) >= a__uLength(a__and(a__isNat(N),a__isNatList(L)),L) ; a__length(X) >= length(X) ; Marked_a__uLength(tt,L) >= Marked_a__length(mark(L)) ; Marked_a__length(cons(N,L)) >= Marked_a__uLength(a__and(a__isNat(N), a__isNatList(L)), L) ; } + Disjunctions:{ { Marked_a__uLength(tt,L) > Marked_a__length(mark(L)) ; } { Marked_a__length(cons(N,L)) > Marked_a__uLength(a__and(a__isNat(N), a__isNatList(L)),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 === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === Time out for these parameters. === TIMER virtual : 15.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 15.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. === TIMER virtual : 50.000000 === trying sub matrices of size: 1 Matrix interpretation constraints generated. Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. Termination constraints generated. Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 50.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(tt) >= tt constraint: mark(0) >= 0 constraint: mark(s(X)) >= s(mark(X)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(zeros) >= a__zeros constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(nil) >= nil constraint: mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) constraint: mark(and(X1,X2)) >= a__and(mark(X1),mark(X2)) constraint: mark(isNatIList(X)) >= a__isNatIList(X) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(isNat(X)) >= a__isNat(X) constraint: mark(uTake1(X)) >= a__uTake1(mark(X)) constraint: mark(uTake2(X1,X2,X3,X4)) >= a__uTake2(mark(X1),X2,X3,X4) constraint: mark(uLength(X1,X2)) >= a__uLength(mark(X1),X2) constraint: a__and(tt,T) >= mark(T) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isNatList(cons(N,L)) >= a__and(a__isNat(N),a__isNatList(L)) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(take(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) constraint: a__isNatList(X) >= isNatList(X) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(cons(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) constraint: a__isNatIList(IL) >= a__isNatList(IL) constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__isNat(0) >= tt constraint: a__isNat(s(N)) >= a__isNat(N) constraint: a__isNat(length(L)) >= a__isNatList(L) constraint: a__isNat(X) >= isNat(X) constraint: a__zeros >= zeros constraint: a__zeros >= cons(0,zeros) constraint: a__uTake1(tt) >= nil constraint: a__uTake1(X) >= uTake1(X) constraint: a__take(0,IL) >= a__uTake1(a__isNatIList(IL)) constraint: a__take(s(M),cons(N,IL)) >= a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M,N,IL) constraint: a__take(X1,X2) >= take(X1,X2) constraint: a__uTake2(tt,M,N,IL) >= cons(mark(N),take(M,IL)) constraint: a__uTake2(X1,X2,X3,X4) >= uTake2(X1,X2,X3,X4) constraint: a__uLength(tt,L) >= s(a__length(mark(L))) constraint: a__uLength(X1,X2) >= uLength(X1,X2) constraint: a__length(cons(N,L)) >= a__uLength(a__and(a__isNat(N), a__isNatList(L)),L) constraint: a__length(X) >= length(X) constraint: Marked_a__uLength(tt,L) >= Marked_a__length(mark(L)) constraint: Marked_a__length(cons(N,L)) >= Marked_a__uLength(a__and(a__isNat(N), a__isNatList(L)), L) APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(tt) >= tt ; mark(0) >= 0 ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(zeros) >= a__zeros ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(nil) >= nil ; mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) ; mark(and(X1,X2)) >= a__and(mark(X1),mark(X2)) ; mark(isNatIList(X)) >= a__isNatIList(X) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(isNat(X)) >= a__isNat(X) ; mark(uTake1(X)) >= a__uTake1(mark(X)) ; mark(uTake2(X1,X2,X3,X4)) >= a__uTake2(mark(X1),X2,X3,X4) ; mark(uLength(X1,X2)) >= a__uLength(mark(X1),X2) ; a__and(tt,T) >= mark(T) ; a__and(X1,X2) >= and(X1,X2) ; a__isNatList(cons(N,L)) >= a__and(a__isNat(N),a__isNatList(L)) ; a__isNatList(nil) >= tt ; a__isNatList(take(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatList(X) >= isNatList(X) ; a__isNatIList(zeros) >= tt ; a__isNatIList(cons(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatIList(IL) >= a__isNatList(IL) ; a__isNatIList(X) >= isNatIList(X) ; a__isNat(0) >= tt ; a__isNat(s(N)) >= a__isNat(N) ; a__isNat(length(L)) >= a__isNatList(L) ; a__isNat(X) >= isNat(X) ; a__zeros >= zeros ; a__zeros >= cons(0,zeros) ; a__uTake1(tt) >= nil ; a__uTake1(X) >= uTake1(X) ; a__take(0,IL) >= a__uTake1(a__isNatIList(IL)) ; a__take(s(M),cons(N,IL)) >= a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N),a__isNatIList(IL))), M,N,IL) ; a__take(X1,X2) >= take(X1,X2) ; a__uTake2(tt,M,N,IL) >= cons(mark(N),take(M,IL)) ; a__uTake2(X1,X2,X3,X4) >= uTake2(X1,X2,X3,X4) ; a__uLength(tt,L) >= s(a__length(mark(L))) ; a__uLength(X1,X2) >= uLength(X1,X2) ; a__length(cons(N,L)) >= a__uLength(a__and(a__isNat(N),a__isNatList(L)),L) ; a__length(X) >= length(X) ; Marked_a__uTake2(tt,M,N,IL) >= Marked_mark(N) ; Marked_a__take(0,IL) >= Marked_a__isNatIList(IL) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M,N,IL) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__isNat(N) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__isNat(M) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__isNatIList(IL) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__and(a__isNat(M), a__and(a__isNat(N),a__isNatIList(IL))) ; Marked_a__isNat(s(N)) >= Marked_a__isNat(N) ; Marked_a__isNat(length(L)) >= Marked_a__isNatList(L) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__isNat(N) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__isNatList(L) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__and(a__isNat(N),a__isNatList(L)) ; Marked_a__isNatList(take(N,IL)) >= Marked_a__isNat(N) ; Marked_a__isNatList(take(N,IL)) >= Marked_a__isNatIList(IL) ; Marked_a__isNatList(take(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNat(N) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNatIList(IL) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; Marked_a__isNatIList(IL) >= Marked_a__isNatList(IL) ; Marked_a__and(tt,T) >= Marked_mark(T) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(take(X1,X2)) >= Marked_a__take(mark(X1),mark(X2)) ; Marked_mark(take(X1,X2)) >= Marked_mark(X1) ; Marked_mark(take(X1,X2)) >= Marked_mark(X2) ; Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),mark(X2)) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_mark(X2) ; Marked_mark(isNatIList(X)) >= Marked_a__isNatIList(X) ; Marked_mark(isNatList(X)) >= Marked_a__isNatList(X) ; Marked_mark(isNat(X)) >= Marked_a__isNat(X) ; Marked_mark(uTake1(X)) >= Marked_mark(X) ; Marked_mark(uTake2(X1,X2,X3,X4)) >= Marked_a__uTake2(mark(X1),X2,X3,X4) ; Marked_mark(uTake2(X1,X2,X3,X4)) >= Marked_mark(X1) ; } + Disjunctions:{ { Marked_a__uTake2(tt,M,N,IL) > Marked_mark(N) ; } { Marked_a__take(0,IL) > Marked_a__isNatIList(IL) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M,N,IL) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__isNat(N) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__isNat(M) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__isNatIList(IL) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__and(a__isNat(M), a__and(a__isNat(N),a__isNatIList(IL))) ; } { Marked_a__isNat(s(N)) > Marked_a__isNat(N) ; } { Marked_a__isNat(length(L)) > Marked_a__isNatList(L) ; } { Marked_a__isNatList(cons(N,L)) > Marked_a__isNat(N) ; } { Marked_a__isNatList(cons(N,L)) > Marked_a__isNatList(L) ; } { Marked_a__isNatList(cons(N,L)) > Marked_a__and(a__isNat(N),a__isNatList(L)) ; } { Marked_a__isNatList(take(N,IL)) > Marked_a__isNat(N) ; } { Marked_a__isNatList(take(N,IL)) > Marked_a__isNatIList(IL) ; } { Marked_a__isNatList(take(N,IL)) > Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__isNat(N) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__isNatIList(IL) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; } { Marked_a__isNatIList(IL) > Marked_a__isNatList(IL) ; } { Marked_a__and(tt,T) > Marked_mark(T) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(take(X1,X2)) > Marked_a__take(mark(X1),mark(X2)) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(and(X1,X2)) > Marked_a__and(mark(X1),mark(X2)) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(isNatIList(X)) > Marked_a__isNatIList(X) ; } { Marked_mark(isNatList(X)) > Marked_a__isNatList(X) ; } { Marked_mark(isNat(X)) > Marked_a__isNat(X) ; } { Marked_mark(uTake1(X)) > Marked_mark(X) ; } { Marked_mark(uTake2(X1,X2,X3,X4)) > Marked_a__uTake2(mark(X1),X2,X3,X4) ; } { Marked_mark(uTake2(X1,X2,X3,X4)) > 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: mark(tt) >= tt constraint: mark(0) >= 0 constraint: mark(s(X)) >= s(mark(X)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(zeros) >= a__zeros constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(nil) >= nil constraint: mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) constraint: mark(and(X1,X2)) >= a__and(mark(X1),mark(X2)) constraint: mark(isNatIList(X)) >= a__isNatIList(X) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(isNat(X)) >= a__isNat(X) constraint: mark(uTake1(X)) >= a__uTake1(mark(X)) constraint: mark(uTake2(X1,X2,X3,X4)) >= a__uTake2(mark(X1),X2,X3,X4) constraint: mark(uLength(X1,X2)) >= a__uLength(mark(X1),X2) constraint: a__and(tt,T) >= mark(T) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isNatList(cons(N,L)) >= a__and(a__isNat(N),a__isNatList(L)) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(take(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) constraint: a__isNatList(X) >= isNatList(X) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(cons(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) constraint: a__isNatIList(IL) >= a__isNatList(IL) constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__isNat(0) >= tt constraint: a__isNat(s(N)) >= a__isNat(N) constraint: a__isNat(length(L)) >= a__isNatList(L) constraint: a__isNat(X) >= isNat(X) constraint: a__zeros >= zeros constraint: a__zeros >= cons(0,zeros) constraint: a__uTake1(tt) >= nil constraint: a__uTake1(X) >= uTake1(X) constraint: a__take(0,IL) >= a__uTake1(a__isNatIList(IL)) constraint: a__take(s(M),cons(N,IL)) >= a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M,N,IL) constraint: a__take(X1,X2) >= take(X1,X2) constraint: a__uTake2(tt,M,N,IL) >= cons(mark(N),take(M,IL)) constraint: a__uTake2(X1,X2,X3,X4) >= uTake2(X1,X2,X3,X4) constraint: a__uLength(tt,L) >= s(a__length(mark(L))) constraint: a__uLength(X1,X2) >= uLength(X1,X2) constraint: a__length(cons(N,L)) >= a__uLength(a__and(a__isNat(N), a__isNatList(L)),L) constraint: a__length(X) >= length(X) constraint: Marked_a__uTake2(tt,M,N,IL) >= Marked_mark(N) constraint: Marked_a__take(0,IL) >= Marked_a__isNatIList(IL) constraint: Marked_a__take(s(M),cons(N,IL)) >= Marked_a__uTake2(a__and( a__isNat( M), a__and( a__isNat( N), a__isNatIList( IL))), M,N,IL) constraint: Marked_a__take(s(M),cons(N,IL)) >= Marked_a__isNat(N) constraint: Marked_a__take(s(M),cons(N,IL)) >= Marked_a__isNat(M) constraint: Marked_a__take(s(M),cons(N,IL)) >= Marked_a__isNatIList(IL) constraint: Marked_a__take(s(M),cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) constraint: Marked_a__take(s(M),cons(N,IL)) >= Marked_a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))) constraint: Marked_a__isNat(s(N)) >= Marked_a__isNat(N) constraint: Marked_a__isNat(length(L)) >= Marked_a__isNatList(L) constraint: Marked_a__isNatList(cons(N,L)) >= Marked_a__isNat(N) constraint: Marked_a__isNatList(cons(N,L)) >= Marked_a__isNatList(L) constraint: Marked_a__isNatList(cons(N,L)) >= Marked_a__and(a__isNat(N), a__isNatList(L)) constraint: Marked_a__isNatList(take(N,IL)) >= Marked_a__isNat(N) constraint: Marked_a__isNatList(take(N,IL)) >= Marked_a__isNatIList(IL) constraint: Marked_a__isNatList(take(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) constraint: Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNat(N) constraint: Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNatIList(IL) constraint: Marked_a__isNatIList(cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) constraint: Marked_a__isNatIList(IL) >= Marked_a__isNatList(IL) constraint: Marked_a__and(tt,T) >= Marked_mark(T) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(take(X1,X2)) >= Marked_a__take(mark(X1),mark(X2)) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),mark(X2)) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(isNatIList(X)) >= Marked_a__isNatIList(X) constraint: Marked_mark(isNatList(X)) >= Marked_a__isNatList(X) constraint: Marked_mark(isNat(X)) >= Marked_a__isNat(X) constraint: Marked_mark(uTake1(X)) >= Marked_mark(X) constraint: Marked_mark(uTake2(X1,X2,X3,X4)) >= Marked_a__uTake2(mark(X1), X2,X3,X4) constraint: Marked_mark(uTake2(X1,X2,X3,X4)) >= Marked_mark(X1) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(tt) >= tt ; mark(0) >= 0 ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(zeros) >= a__zeros ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(nil) >= nil ; mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) ; mark(and(X1,X2)) >= a__and(mark(X1),mark(X2)) ; mark(isNatIList(X)) >= a__isNatIList(X) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(isNat(X)) >= a__isNat(X) ; mark(uTake1(X)) >= a__uTake1(mark(X)) ; mark(uTake2(X1,X2,X3,X4)) >= a__uTake2(mark(X1),X2,X3,X4) ; mark(uLength(X1,X2)) >= a__uLength(mark(X1),X2) ; a__and(tt,T) >= mark(T) ; a__and(X1,X2) >= and(X1,X2) ; a__isNatList(cons(N,L)) >= a__and(a__isNat(N),a__isNatList(L)) ; a__isNatList(nil) >= tt ; a__isNatList(take(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatList(X) >= isNatList(X) ; a__isNatIList(zeros) >= tt ; a__isNatIList(cons(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatIList(IL) >= a__isNatList(IL) ; a__isNatIList(X) >= isNatIList(X) ; a__isNat(0) >= tt ; a__isNat(s(N)) >= a__isNat(N) ; a__isNat(length(L)) >= a__isNatList(L) ; a__isNat(X) >= isNat(X) ; a__zeros >= zeros ; a__zeros >= cons(0,zeros) ; a__uTake1(tt) >= nil ; a__uTake1(X) >= uTake1(X) ; a__take(0,IL) >= a__uTake1(a__isNatIList(IL)) ; a__take(s(M),cons(N,IL)) >= a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N),a__isNatIList(IL))), M,N,IL) ; a__take(X1,X2) >= take(X1,X2) ; a__uTake2(tt,M,N,IL) >= cons(mark(N),take(M,IL)) ; a__uTake2(X1,X2,X3,X4) >= uTake2(X1,X2,X3,X4) ; a__uLength(tt,L) >= s(a__length(mark(L))) ; a__uLength(X1,X2) >= uLength(X1,X2) ; a__length(cons(N,L)) >= a__uLength(a__and(a__isNat(N),a__isNatList(L)),L) ; a__length(X) >= length(X) ; Marked_a__uTake2(tt,M,N,IL) >= Marked_mark(N) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M,N,IL) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__isNat(N) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__isNat(M) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__isNatIList(IL) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__and(a__isNat(M), a__and(a__isNat(N),a__isNatIList(IL))) ; Marked_a__isNat(s(N)) >= Marked_a__isNat(N) ; Marked_a__isNat(length(L)) >= Marked_a__isNatList(L) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__isNat(N) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__isNatList(L) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__and(a__isNat(N),a__isNatList(L)) ; Marked_a__isNatList(take(N,IL)) >= Marked_a__isNat(N) ; Marked_a__isNatList(take(N,IL)) >= Marked_a__isNatIList(IL) ; Marked_a__isNatList(take(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNat(N) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNatIList(IL) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; Marked_a__isNatIList(IL) >= Marked_a__isNatList(IL) ; Marked_a__and(tt,T) >= Marked_mark(T) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(take(X1,X2)) >= Marked_a__take(mark(X1),mark(X2)) ; Marked_mark(take(X1,X2)) >= Marked_mark(X1) ; Marked_mark(take(X1,X2)) >= Marked_mark(X2) ; Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),mark(X2)) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_mark(X2) ; Marked_mark(isNatIList(X)) >= Marked_a__isNatIList(X) ; Marked_mark(isNatList(X)) >= Marked_a__isNatList(X) ; Marked_mark(isNat(X)) >= Marked_a__isNat(X) ; Marked_mark(uTake1(X)) >= Marked_mark(X) ; Marked_mark(uTake2(X1,X2,X3,X4)) >= Marked_a__uTake2(mark(X1),X2,X3,X4) ; Marked_mark(uTake2(X1,X2,X3,X4)) >= Marked_mark(X1) ; } + Disjunctions:{ { Marked_a__uTake2(tt,M,N,IL) > Marked_mark(N) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M,N,IL) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__isNat(N) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__isNat(M) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__isNatIList(IL) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__and(a__isNat(M), a__and(a__isNat(N),a__isNatIList(IL))) ; } { Marked_a__isNat(s(N)) > Marked_a__isNat(N) ; } { Marked_a__isNat(length(L)) > Marked_a__isNatList(L) ; } { Marked_a__isNatList(cons(N,L)) > Marked_a__isNat(N) ; } { Marked_a__isNatList(cons(N,L)) > Marked_a__isNatList(L) ; } { Marked_a__isNatList(cons(N,L)) > Marked_a__and(a__isNat(N),a__isNatList(L)) ; } { Marked_a__isNatList(take(N,IL)) > Marked_a__isNat(N) ; } { Marked_a__isNatList(take(N,IL)) > Marked_a__isNatIList(IL) ; } { Marked_a__isNatList(take(N,IL)) > Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__isNat(N) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__isNatIList(IL) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; } { Marked_a__isNatIList(IL) > Marked_a__isNatList(IL) ; } { Marked_a__and(tt,T) > Marked_mark(T) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(take(X1,X2)) > Marked_a__take(mark(X1),mark(X2)) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(and(X1,X2)) > Marked_a__and(mark(X1),mark(X2)) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(isNatIList(X)) > Marked_a__isNatIList(X) ; } { Marked_mark(isNatList(X)) > Marked_a__isNatList(X) ; } { Marked_mark(isNat(X)) > Marked_a__isNat(X) ; } { Marked_mark(uTake1(X)) > Marked_mark(X) ; } { Marked_mark(uTake2(X1,X2,X3,X4)) > Marked_a__uTake2(mark(X1),X2,X3,X4) ; } { Marked_mark(uTake2(X1,X2,X3,X4)) > 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: mark(tt) >= tt constraint: mark(0) >= 0 constraint: mark(s(X)) >= s(mark(X)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(zeros) >= a__zeros constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(nil) >= nil constraint: mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) constraint: mark(and(X1,X2)) >= a__and(mark(X1),mark(X2)) constraint: mark(isNatIList(X)) >= a__isNatIList(X) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(isNat(X)) >= a__isNat(X) constraint: mark(uTake1(X)) >= a__uTake1(mark(X)) constraint: mark(uTake2(X1,X2,X3,X4)) >= a__uTake2(mark(X1),X2,X3,X4) constraint: mark(uLength(X1,X2)) >= a__uLength(mark(X1),X2) constraint: a__and(tt,T) >= mark(T) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isNatList(cons(N,L)) >= a__and(a__isNat(N),a__isNatList(L)) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(take(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) constraint: a__isNatList(X) >= isNatList(X) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(cons(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) constraint: a__isNatIList(IL) >= a__isNatList(IL) constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__isNat(0) >= tt constraint: a__isNat(s(N)) >= a__isNat(N) constraint: a__isNat(length(L)) >= a__isNatList(L) constraint: a__isNat(X) >= isNat(X) constraint: a__zeros >= zeros constraint: a__zeros >= cons(0,zeros) constraint: a__uTake1(tt) >= nil constraint: a__uTake1(X) >= uTake1(X) constraint: a__take(0,IL) >= a__uTake1(a__isNatIList(IL)) constraint: a__take(s(M),cons(N,IL)) >= a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M,N,IL) constraint: a__take(X1,X2) >= take(X1,X2) constraint: a__uTake2(tt,M,N,IL) >= cons(mark(N),take(M,IL)) constraint: a__uTake2(X1,X2,X3,X4) >= uTake2(X1,X2,X3,X4) constraint: a__uLength(tt,L) >= s(a__length(mark(L))) constraint: a__uLength(X1,X2) >= uLength(X1,X2) constraint: a__length(cons(N,L)) >= a__uLength(a__and(a__isNat(N), a__isNatList(L)),L) constraint: a__length(X) >= length(X) constraint: Marked_a__uTake2(tt,M,N,IL) >= Marked_mark(N) constraint: Marked_a__take(s(M),cons(N,IL)) >= Marked_a__uTake2(a__and( a__isNat( M), a__and( a__isNat( N), a__isNatIList( IL))), M,N,IL) constraint: Marked_a__take(s(M),cons(N,IL)) >= Marked_a__isNat(N) constraint: Marked_a__take(s(M),cons(N,IL)) >= Marked_a__isNat(M) constraint: Marked_a__take(s(M),cons(N,IL)) >= Marked_a__isNatIList(IL) constraint: Marked_a__take(s(M),cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) constraint: Marked_a__take(s(M),cons(N,IL)) >= Marked_a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))) constraint: Marked_a__isNat(s(N)) >= Marked_a__isNat(N) constraint: Marked_a__isNat(length(L)) >= Marked_a__isNatList(L) constraint: Marked_a__isNatList(cons(N,L)) >= Marked_a__isNat(N) constraint: Marked_a__isNatList(cons(N,L)) >= Marked_a__isNatList(L) constraint: Marked_a__isNatList(cons(N,L)) >= Marked_a__and(a__isNat(N), a__isNatList(L)) constraint: Marked_a__isNatList(take(N,IL)) >= Marked_a__isNat(N) constraint: Marked_a__isNatList(take(N,IL)) >= Marked_a__isNatIList(IL) constraint: Marked_a__isNatList(take(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) constraint: Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNat(N) constraint: Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNatIList(IL) constraint: Marked_a__isNatIList(cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) constraint: Marked_a__isNatIList(IL) >= Marked_a__isNatList(IL) constraint: Marked_a__and(tt,T) >= Marked_mark(T) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(take(X1,X2)) >= Marked_a__take(mark(X1),mark(X2)) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),mark(X2)) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(isNatIList(X)) >= Marked_a__isNatIList(X) constraint: Marked_mark(isNatList(X)) >= Marked_a__isNatList(X) constraint: Marked_mark(isNat(X)) >= Marked_a__isNat(X) constraint: Marked_mark(uTake1(X)) >= Marked_mark(X) constraint: Marked_mark(uTake2(X1,X2,X3,X4)) >= Marked_a__uTake2(mark(X1), X2,X3,X4) constraint: Marked_mark(uTake2(X1,X2,X3,X4)) >= Marked_mark(X1) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(tt) >= tt ; mark(0) >= 0 ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(zeros) >= a__zeros ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(nil) >= nil ; mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) ; mark(and(X1,X2)) >= a__and(mark(X1),mark(X2)) ; mark(isNatIList(X)) >= a__isNatIList(X) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(isNat(X)) >= a__isNat(X) ; mark(uTake1(X)) >= a__uTake1(mark(X)) ; mark(uTake2(X1,X2,X3,X4)) >= a__uTake2(mark(X1),X2,X3,X4) ; mark(uLength(X1,X2)) >= a__uLength(mark(X1),X2) ; a__and(tt,T) >= mark(T) ; a__and(X1,X2) >= and(X1,X2) ; a__isNatList(cons(N,L)) >= a__and(a__isNat(N),a__isNatList(L)) ; a__isNatList(nil) >= tt ; a__isNatList(take(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatList(X) >= isNatList(X) ; a__isNatIList(zeros) >= tt ; a__isNatIList(cons(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatIList(IL) >= a__isNatList(IL) ; a__isNatIList(X) >= isNatIList(X) ; a__isNat(0) >= tt ; a__isNat(s(N)) >= a__isNat(N) ; a__isNat(length(L)) >= a__isNatList(L) ; a__isNat(X) >= isNat(X) ; a__zeros >= zeros ; a__zeros >= cons(0,zeros) ; a__uTake1(tt) >= nil ; a__uTake1(X) >= uTake1(X) ; a__take(0,IL) >= a__uTake1(a__isNatIList(IL)) ; a__take(s(M),cons(N,IL)) >= a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N),a__isNatIList(IL))), M,N,IL) ; a__take(X1,X2) >= take(X1,X2) ; a__uTake2(tt,M,N,IL) >= cons(mark(N),take(M,IL)) ; a__uTake2(X1,X2,X3,X4) >= uTake2(X1,X2,X3,X4) ; a__uLength(tt,L) >= s(a__length(mark(L))) ; a__uLength(X1,X2) >= uLength(X1,X2) ; a__length(cons(N,L)) >= a__uLength(a__and(a__isNat(N),a__isNatList(L)),L) ; a__length(X) >= length(X) ; Marked_a__uTake2(tt,M,N,IL) >= Marked_mark(N) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M,N,IL) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__isNat(N) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__isNat(M) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__isNatIList(IL) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__and(a__isNat(M), a__and(a__isNat(N),a__isNatIList(IL))) ; Marked_a__isNat(s(N)) >= Marked_a__isNat(N) ; Marked_a__isNat(length(L)) >= Marked_a__isNatList(L) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__isNat(N) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__isNatList(L) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__and(a__isNat(N),a__isNatList(L)) ; Marked_a__isNatList(take(N,IL)) >= Marked_a__isNat(N) ; Marked_a__isNatList(take(N,IL)) >= Marked_a__isNatIList(IL) ; Marked_a__isNatList(take(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNat(N) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNatIList(IL) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; Marked_a__isNatIList(IL) >= Marked_a__isNatList(IL) ; Marked_a__and(tt,T) >= Marked_mark(T) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(take(X1,X2)) >= Marked_a__take(mark(X1),mark(X2)) ; Marked_mark(take(X1,X2)) >= Marked_mark(X1) ; Marked_mark(take(X1,X2)) >= Marked_mark(X2) ; Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),mark(X2)) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_mark(X2) ; Marked_mark(isNatIList(X)) >= Marked_a__isNatIList(X) ; Marked_mark(isNatList(X)) >= Marked_a__isNatList(X) ; Marked_mark(isNat(X)) >= Marked_a__isNat(X) ; Marked_mark(uTake2(X1,X2,X3,X4)) >= Marked_a__uTake2(mark(X1),X2,X3,X4) ; Marked_mark(uTake2(X1,X2,X3,X4)) >= Marked_mark(X1) ; } + Disjunctions:{ { Marked_a__uTake2(tt,M,N,IL) > Marked_mark(N) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M,N,IL) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__isNat(N) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__isNat(M) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__isNatIList(IL) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__and(a__isNat(M), a__and(a__isNat(N),a__isNatIList(IL))) ; } { Marked_a__isNat(s(N)) > Marked_a__isNat(N) ; } { Marked_a__isNat(length(L)) > Marked_a__isNatList(L) ; } { Marked_a__isNatList(cons(N,L)) > Marked_a__isNat(N) ; } { Marked_a__isNatList(cons(N,L)) > Marked_a__isNatList(L) ; } { Marked_a__isNatList(cons(N,L)) > Marked_a__and(a__isNat(N),a__isNatList(L)) ; } { Marked_a__isNatList(take(N,IL)) > Marked_a__isNat(N) ; } { Marked_a__isNatList(take(N,IL)) > Marked_a__isNatIList(IL) ; } { Marked_a__isNatList(take(N,IL)) > Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__isNat(N) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__isNatIList(IL) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; } { Marked_a__isNatIList(IL) > Marked_a__isNatList(IL) ; } { Marked_a__and(tt,T) > Marked_mark(T) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(take(X1,X2)) > Marked_a__take(mark(X1),mark(X2)) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(and(X1,X2)) > Marked_a__and(mark(X1),mark(X2)) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(isNatIList(X)) > Marked_a__isNatIList(X) ; } { Marked_mark(isNatList(X)) > Marked_a__isNatList(X) ; } { Marked_mark(isNat(X)) > Marked_a__isNat(X) ; } { Marked_mark(uTake2(X1,X2,X3,X4)) > Marked_a__uTake2(mark(X1),X2,X3,X4) ; } { Marked_mark(uTake2(X1,X2,X3,X4)) > 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: mark(tt) >= tt constraint: mark(0) >= 0 constraint: mark(s(X)) >= s(mark(X)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(zeros) >= a__zeros constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(nil) >= nil constraint: mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) constraint: mark(and(X1,X2)) >= a__and(mark(X1),mark(X2)) constraint: mark(isNatIList(X)) >= a__isNatIList(X) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(isNat(X)) >= a__isNat(X) constraint: mark(uTake1(X)) >= a__uTake1(mark(X)) constraint: mark(uTake2(X1,X2,X3,X4)) >= a__uTake2(mark(X1),X2,X3,X4) constraint: mark(uLength(X1,X2)) >= a__uLength(mark(X1),X2) constraint: a__and(tt,T) >= mark(T) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isNatList(cons(N,L)) >= a__and(a__isNat(N),a__isNatList(L)) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(take(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) constraint: a__isNatList(X) >= isNatList(X) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(cons(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) constraint: a__isNatIList(IL) >= a__isNatList(IL) constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__isNat(0) >= tt constraint: a__isNat(s(N)) >= a__isNat(N) constraint: a__isNat(length(L)) >= a__isNatList(L) constraint: a__isNat(X) >= isNat(X) constraint: a__zeros >= zeros constraint: a__zeros >= cons(0,zeros) constraint: a__uTake1(tt) >= nil constraint: a__uTake1(X) >= uTake1(X) constraint: a__take(0,IL) >= a__uTake1(a__isNatIList(IL)) constraint: a__take(s(M),cons(N,IL)) >= a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M,N,IL) constraint: a__take(X1,X2) >= take(X1,X2) constraint: a__uTake2(tt,M,N,IL) >= cons(mark(N),take(M,IL)) constraint: a__uTake2(X1,X2,X3,X4) >= uTake2(X1,X2,X3,X4) constraint: a__uLength(tt,L) >= s(a__length(mark(L))) constraint: a__uLength(X1,X2) >= uLength(X1,X2) constraint: a__length(cons(N,L)) >= a__uLength(a__and(a__isNat(N), a__isNatList(L)),L) constraint: a__length(X) >= length(X) constraint: Marked_a__uTake2(tt,M,N,IL) >= Marked_mark(N) constraint: Marked_a__take(s(M),cons(N,IL)) >= Marked_a__uTake2(a__and( a__isNat( M), a__and( a__isNat( N), a__isNatIList( IL))), M,N,IL) constraint: Marked_a__take(s(M),cons(N,IL)) >= Marked_a__isNat(N) constraint: Marked_a__take(s(M),cons(N,IL)) >= Marked_a__isNat(M) constraint: Marked_a__take(s(M),cons(N,IL)) >= Marked_a__isNatIList(IL) constraint: Marked_a__take(s(M),cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) constraint: Marked_a__take(s(M),cons(N,IL)) >= Marked_a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))) constraint: Marked_a__isNat(s(N)) >= Marked_a__isNat(N) constraint: Marked_a__isNat(length(L)) >= Marked_a__isNatList(L) constraint: Marked_a__isNatList(cons(N,L)) >= Marked_a__isNat(N) constraint: Marked_a__isNatList(cons(N,L)) >= Marked_a__isNatList(L) constraint: Marked_a__isNatList(cons(N,L)) >= Marked_a__and(a__isNat(N), a__isNatList(L)) constraint: Marked_a__isNatList(take(N,IL)) >= Marked_a__isNat(N) constraint: Marked_a__isNatList(take(N,IL)) >= Marked_a__isNatIList(IL) constraint: Marked_a__isNatList(take(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) constraint: Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNat(N) constraint: Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNatIList(IL) constraint: Marked_a__isNatIList(cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) constraint: Marked_a__isNatIList(IL) >= Marked_a__isNatList(IL) constraint: Marked_a__and(tt,T) >= Marked_mark(T) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(take(X1,X2)) >= Marked_a__take(mark(X1),mark(X2)) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),mark(X2)) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(isNatIList(X)) >= Marked_a__isNatIList(X) constraint: Marked_mark(isNatList(X)) >= Marked_a__isNatList(X) constraint: Marked_mark(isNat(X)) >= Marked_a__isNat(X) constraint: Marked_mark(uTake2(X1,X2,X3,X4)) >= Marked_a__uTake2(mark(X1), X2,X3,X4) constraint: Marked_mark(uTake2(X1,X2,X3,X4)) >= Marked_mark(X1) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(tt) >= tt ; mark(0) >= 0 ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(zeros) >= a__zeros ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(nil) >= nil ; mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) ; mark(and(X1,X2)) >= a__and(mark(X1),mark(X2)) ; mark(isNatIList(X)) >= a__isNatIList(X) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(isNat(X)) >= a__isNat(X) ; mark(uTake1(X)) >= a__uTake1(mark(X)) ; mark(uTake2(X1,X2,X3,X4)) >= a__uTake2(mark(X1),X2,X3,X4) ; mark(uLength(X1,X2)) >= a__uLength(mark(X1),X2) ; a__and(tt,T) >= mark(T) ; a__and(X1,X2) >= and(X1,X2) ; a__isNatList(cons(N,L)) >= a__and(a__isNat(N),a__isNatList(L)) ; a__isNatList(nil) >= tt ; a__isNatList(take(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatList(X) >= isNatList(X) ; a__isNatIList(zeros) >= tt ; a__isNatIList(cons(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatIList(IL) >= a__isNatList(IL) ; a__isNatIList(X) >= isNatIList(X) ; a__isNat(0) >= tt ; a__isNat(s(N)) >= a__isNat(N) ; a__isNat(length(L)) >= a__isNatList(L) ; a__isNat(X) >= isNat(X) ; a__zeros >= zeros ; a__zeros >= cons(0,zeros) ; a__uTake1(tt) >= nil ; a__uTake1(X) >= uTake1(X) ; a__take(0,IL) >= a__uTake1(a__isNatIList(IL)) ; a__take(s(M),cons(N,IL)) >= a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N),a__isNatIList(IL))), M,N,IL) ; a__take(X1,X2) >= take(X1,X2) ; a__uTake2(tt,M,N,IL) >= cons(mark(N),take(M,IL)) ; a__uTake2(X1,X2,X3,X4) >= uTake2(X1,X2,X3,X4) ; a__uLength(tt,L) >= s(a__length(mark(L))) ; a__uLength(X1,X2) >= uLength(X1,X2) ; a__length(cons(N,L)) >= a__uLength(a__and(a__isNat(N),a__isNatList(L)),L) ; a__length(X) >= length(X) ; Marked_a__uTake2(tt,M,N,IL) >= Marked_mark(N) ; Marked_a__isNat(s(N)) >= Marked_a__isNat(N) ; Marked_a__isNat(length(L)) >= Marked_a__isNatList(L) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__isNat(N) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__isNatList(L) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__and(a__isNat(N),a__isNatList(L)) ; Marked_a__isNatList(take(N,IL)) >= Marked_a__isNat(N) ; Marked_a__isNatList(take(N,IL)) >= Marked_a__isNatIList(IL) ; Marked_a__isNatList(take(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNat(N) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNatIList(IL) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; Marked_a__isNatIList(IL) >= Marked_a__isNatList(IL) ; Marked_a__and(tt,T) >= Marked_mark(T) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),mark(X2)) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_mark(X2) ; Marked_mark(isNatIList(X)) >= Marked_a__isNatIList(X) ; Marked_mark(isNatList(X)) >= Marked_a__isNatList(X) ; Marked_mark(isNat(X)) >= Marked_a__isNat(X) ; Marked_mark(uTake2(X1,X2,X3,X4)) >= Marked_a__uTake2(mark(X1),X2,X3,X4) ; Marked_mark(uTake2(X1,X2,X3,X4)) >= Marked_mark(X1) ; } + Disjunctions:{ { Marked_a__uTake2(tt,M,N,IL) > Marked_mark(N) ; } { Marked_a__isNat(s(N)) > Marked_a__isNat(N) ; } { Marked_a__isNat(length(L)) > Marked_a__isNatList(L) ; } { Marked_a__isNatList(cons(N,L)) > Marked_a__isNat(N) ; } { Marked_a__isNatList(cons(N,L)) > Marked_a__isNatList(L) ; } { Marked_a__isNatList(cons(N,L)) > Marked_a__and(a__isNat(N),a__isNatList(L)) ; } { Marked_a__isNatList(take(N,IL)) > Marked_a__isNat(N) ; } { Marked_a__isNatList(take(N,IL)) > Marked_a__isNatIList(IL) ; } { Marked_a__isNatList(take(N,IL)) > Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__isNat(N) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__isNatIList(IL) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; } { Marked_a__isNatIList(IL) > Marked_a__isNatList(IL) ; } { Marked_a__and(tt,T) > Marked_mark(T) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_a__and(mark(X1),mark(X2)) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(isNatIList(X)) > Marked_a__isNatIList(X) ; } { Marked_mark(isNatList(X)) > Marked_a__isNatList(X) ; } { Marked_mark(isNat(X)) > Marked_a__isNat(X) ; } { Marked_mark(uTake2(X1,X2,X3,X4)) > Marked_a__uTake2(mark(X1),X2,X3,X4) ; } { Marked_mark(uTake2(X1,X2,X3,X4)) > 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: mark(tt) >= tt constraint: mark(0) >= 0 constraint: mark(s(X)) >= s(mark(X)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(zeros) >= a__zeros constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(nil) >= nil constraint: mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) constraint: mark(and(X1,X2)) >= a__and(mark(X1),mark(X2)) constraint: mark(isNatIList(X)) >= a__isNatIList(X) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(isNat(X)) >= a__isNat(X) constraint: mark(uTake1(X)) >= a__uTake1(mark(X)) constraint: mark(uTake2(X1,X2,X3,X4)) >= a__uTake2(mark(X1),X2,X3,X4) constraint: mark(uLength(X1,X2)) >= a__uLength(mark(X1),X2) constraint: a__and(tt,T) >= mark(T) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isNatList(cons(N,L)) >= a__and(a__isNat(N),a__isNatList(L)) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(take(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) constraint: a__isNatList(X) >= isNatList(X) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(cons(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) constraint: a__isNatIList(IL) >= a__isNatList(IL) constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__isNat(0) >= tt constraint: a__isNat(s(N)) >= a__isNat(N) constraint: a__isNat(length(L)) >= a__isNatList(L) constraint: a__isNat(X) >= isNat(X) constraint: a__zeros >= zeros constraint: a__zeros >= cons(0,zeros) constraint: a__uTake1(tt) >= nil constraint: a__uTake1(X) >= uTake1(X) constraint: a__take(0,IL) >= a__uTake1(a__isNatIList(IL)) constraint: a__take(s(M),cons(N,IL)) >= a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M,N,IL) constraint: a__take(X1,X2) >= take(X1,X2) constraint: a__uTake2(tt,M,N,IL) >= cons(mark(N),take(M,IL)) constraint: a__uTake2(X1,X2,X3,X4) >= uTake2(X1,X2,X3,X4) constraint: a__uLength(tt,L) >= s(a__length(mark(L))) constraint: a__uLength(X1,X2) >= uLength(X1,X2) constraint: a__length(cons(N,L)) >= a__uLength(a__and(a__isNat(N), a__isNatList(L)),L) constraint: a__length(X) >= length(X) constraint: Marked_a__uTake2(tt,M,N,IL) >= Marked_mark(N) constraint: Marked_a__isNat(s(N)) >= Marked_a__isNat(N) constraint: Marked_a__isNat(length(L)) >= Marked_a__isNatList(L) constraint: Marked_a__isNatList(cons(N,L)) >= Marked_a__isNat(N) constraint: Marked_a__isNatList(cons(N,L)) >= Marked_a__isNatList(L) constraint: Marked_a__isNatList(cons(N,L)) >= Marked_a__and(a__isNat(N), a__isNatList(L)) constraint: Marked_a__isNatList(take(N,IL)) >= Marked_a__isNat(N) constraint: Marked_a__isNatList(take(N,IL)) >= Marked_a__isNatIList(IL) constraint: Marked_a__isNatList(take(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) constraint: Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNat(N) constraint: Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNatIList(IL) constraint: Marked_a__isNatIList(cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) constraint: Marked_a__isNatIList(IL) >= Marked_a__isNatList(IL) constraint: Marked_a__and(tt,T) >= Marked_mark(T) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),mark(X2)) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(isNatIList(X)) >= Marked_a__isNatIList(X) constraint: Marked_mark(isNatList(X)) >= Marked_a__isNatList(X) constraint: Marked_mark(isNat(X)) >= Marked_a__isNat(X) constraint: Marked_mark(uTake2(X1,X2,X3,X4)) >= Marked_a__uTake2(mark(X1), X2,X3,X4) constraint: Marked_mark(uTake2(X1,X2,X3,X4)) >= Marked_mark(X1) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(tt) >= tt ; mark(0) >= 0 ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(zeros) >= a__zeros ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(nil) >= nil ; mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) ; mark(and(X1,X2)) >= a__and(mark(X1),mark(X2)) ; mark(isNatIList(X)) >= a__isNatIList(X) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(isNat(X)) >= a__isNat(X) ; mark(uTake1(X)) >= a__uTake1(mark(X)) ; mark(uTake2(X1,X2,X3,X4)) >= a__uTake2(mark(X1),X2,X3,X4) ; mark(uLength(X1,X2)) >= a__uLength(mark(X1),X2) ; a__and(tt,T) >= mark(T) ; a__and(X1,X2) >= and(X1,X2) ; a__isNatList(cons(N,L)) >= a__and(a__isNat(N),a__isNatList(L)) ; a__isNatList(nil) >= tt ; a__isNatList(take(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatList(X) >= isNatList(X) ; a__isNatIList(zeros) >= tt ; a__isNatIList(cons(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatIList(IL) >= a__isNatList(IL) ; a__isNatIList(X) >= isNatIList(X) ; a__isNat(0) >= tt ; a__isNat(s(N)) >= a__isNat(N) ; a__isNat(length(L)) >= a__isNatList(L) ; a__isNat(X) >= isNat(X) ; a__zeros >= zeros ; a__zeros >= cons(0,zeros) ; a__uTake1(tt) >= nil ; a__uTake1(X) >= uTake1(X) ; a__take(0,IL) >= a__uTake1(a__isNatIList(IL)) ; a__take(s(M),cons(N,IL)) >= a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N),a__isNatIList(IL))), M,N,IL) ; a__take(X1,X2) >= take(X1,X2) ; a__uTake2(tt,M,N,IL) >= cons(mark(N),take(M,IL)) ; a__uTake2(X1,X2,X3,X4) >= uTake2(X1,X2,X3,X4) ; a__uLength(tt,L) >= s(a__length(mark(L))) ; a__uLength(X1,X2) >= uLength(X1,X2) ; a__length(cons(N,L)) >= a__uLength(a__and(a__isNat(N),a__isNatList(L)),L) ; a__length(X) >= length(X) ; Marked_a__isNat(s(N)) >= Marked_a__isNat(N) ; Marked_a__isNat(length(L)) >= Marked_a__isNatList(L) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__isNat(N) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__isNatList(L) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__and(a__isNat(N),a__isNatList(L)) ; Marked_a__isNatList(take(N,IL)) >= Marked_a__isNat(N) ; Marked_a__isNatList(take(N,IL)) >= Marked_a__isNatIList(IL) ; Marked_a__isNatList(take(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNat(N) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNatIList(IL) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; Marked_a__isNatIList(IL) >= Marked_a__isNatList(IL) ; Marked_a__and(tt,T) >= Marked_mark(T) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),mark(X2)) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_mark(X2) ; Marked_mark(isNatIList(X)) >= Marked_a__isNatIList(X) ; Marked_mark(isNatList(X)) >= Marked_a__isNatList(X) ; Marked_mark(isNat(X)) >= Marked_a__isNat(X) ; } + Disjunctions:{ { Marked_a__isNat(s(N)) > Marked_a__isNat(N) ; } { Marked_a__isNat(length(L)) > Marked_a__isNatList(L) ; } { Marked_a__isNatList(cons(N,L)) > Marked_a__isNat(N) ; } { Marked_a__isNatList(cons(N,L)) > Marked_a__isNatList(L) ; } { Marked_a__isNatList(cons(N,L)) > Marked_a__and(a__isNat(N),a__isNatList(L)) ; } { Marked_a__isNatList(take(N,IL)) > Marked_a__isNat(N) ; } { Marked_a__isNatList(take(N,IL)) > Marked_a__isNatIList(IL) ; } { Marked_a__isNatList(take(N,IL)) > Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__isNat(N) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__isNatIList(IL) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; } { Marked_a__isNatIList(IL) > Marked_a__isNatList(IL) ; } { Marked_a__and(tt,T) > Marked_mark(T) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_a__and(mark(X1),mark(X2)) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(isNatIList(X)) > Marked_a__isNatIList(X) ; } { Marked_mark(isNatList(X)) > Marked_a__isNatList(X) ; } { Marked_mark(isNat(X)) > Marked_a__isNat(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: mark(tt) >= tt constraint: mark(0) >= 0 constraint: mark(s(X)) >= s(mark(X)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(zeros) >= a__zeros constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(nil) >= nil constraint: mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) constraint: mark(and(X1,X2)) >= a__and(mark(X1),mark(X2)) constraint: mark(isNatIList(X)) >= a__isNatIList(X) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(isNat(X)) >= a__isNat(X) constraint: mark(uTake1(X)) >= a__uTake1(mark(X)) constraint: mark(uTake2(X1,X2,X3,X4)) >= a__uTake2(mark(X1),X2,X3,X4) constraint: mark(uLength(X1,X2)) >= a__uLength(mark(X1),X2) constraint: a__and(tt,T) >= mark(T) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isNatList(cons(N,L)) >= a__and(a__isNat(N),a__isNatList(L)) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(take(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) constraint: a__isNatList(X) >= isNatList(X) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(cons(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) constraint: a__isNatIList(IL) >= a__isNatList(IL) constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__isNat(0) >= tt constraint: a__isNat(s(N)) >= a__isNat(N) constraint: a__isNat(length(L)) >= a__isNatList(L) constraint: a__isNat(X) >= isNat(X) constraint: a__zeros >= zeros constraint: a__zeros >= cons(0,zeros) constraint: a__uTake1(tt) >= nil constraint: a__uTake1(X) >= uTake1(X) constraint: a__take(0,IL) >= a__uTake1(a__isNatIList(IL)) constraint: a__take(s(M),cons(N,IL)) >= a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M,N,IL) constraint: a__take(X1,X2) >= take(X1,X2) constraint: a__uTake2(tt,M,N,IL) >= cons(mark(N),take(M,IL)) constraint: a__uTake2(X1,X2,X3,X4) >= uTake2(X1,X2,X3,X4) constraint: a__uLength(tt,L) >= s(a__length(mark(L))) constraint: a__uLength(X1,X2) >= uLength(X1,X2) constraint: a__length(cons(N,L)) >= a__uLength(a__and(a__isNat(N), a__isNatList(L)),L) constraint: a__length(X) >= length(X) constraint: Marked_a__isNat(s(N)) >= Marked_a__isNat(N) constraint: Marked_a__isNat(length(L)) >= Marked_a__isNatList(L) constraint: Marked_a__isNatList(cons(N,L)) >= Marked_a__isNat(N) constraint: Marked_a__isNatList(cons(N,L)) >= Marked_a__isNatList(L) constraint: Marked_a__isNatList(cons(N,L)) >= Marked_a__and(a__isNat(N), a__isNatList(L)) constraint: Marked_a__isNatList(take(N,IL)) >= Marked_a__isNat(N) constraint: Marked_a__isNatList(take(N,IL)) >= Marked_a__isNatIList(IL) constraint: Marked_a__isNatList(take(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) constraint: Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNat(N) constraint: Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNatIList(IL) constraint: Marked_a__isNatIList(cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) constraint: Marked_a__isNatIList(IL) >= Marked_a__isNatList(IL) constraint: Marked_a__and(tt,T) >= Marked_mark(T) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),mark(X2)) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(isNatIList(X)) >= Marked_a__isNatIList(X) constraint: Marked_mark(isNatList(X)) >= Marked_a__isNatList(X) constraint: Marked_mark(isNat(X)) >= Marked_a__isNat(X) APPLY CRITERIA (Graph splitting) Found 2 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(tt) >= tt ; mark(0) >= 0 ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(zeros) >= a__zeros ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(nil) >= nil ; mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) ; mark(and(X1,X2)) >= a__and(mark(X1),mark(X2)) ; mark(isNatIList(X)) >= a__isNatIList(X) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(isNat(X)) >= a__isNat(X) ; mark(uTake1(X)) >= a__uTake1(mark(X)) ; mark(uTake2(X1,X2,X3,X4)) >= a__uTake2(mark(X1),X2,X3,X4) ; mark(uLength(X1,X2)) >= a__uLength(mark(X1),X2) ; a__and(tt,T) >= mark(T) ; a__and(X1,X2) >= and(X1,X2) ; a__isNatList(cons(N,L)) >= a__and(a__isNat(N),a__isNatList(L)) ; a__isNatList(nil) >= tt ; a__isNatList(take(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatList(X) >= isNatList(X) ; a__isNatIList(zeros) >= tt ; a__isNatIList(cons(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatIList(IL) >= a__isNatList(IL) ; a__isNatIList(X) >= isNatIList(X) ; a__isNat(0) >= tt ; a__isNat(s(N)) >= a__isNat(N) ; a__isNat(length(L)) >= a__isNatList(L) ; a__isNat(X) >= isNat(X) ; a__zeros >= zeros ; a__zeros >= cons(0,zeros) ; a__uTake1(tt) >= nil ; a__uTake1(X) >= uTake1(X) ; a__take(0,IL) >= a__uTake1(a__isNatIList(IL)) ; a__take(s(M),cons(N,IL)) >= a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N),a__isNatIList(IL))), M,N,IL) ; a__take(X1,X2) >= take(X1,X2) ; a__uTake2(tt,M,N,IL) >= cons(mark(N),take(M,IL)) ; a__uTake2(X1,X2,X3,X4) >= uTake2(X1,X2,X3,X4) ; a__uLength(tt,L) >= s(a__length(mark(L))) ; a__uLength(X1,X2) >= uLength(X1,X2) ; a__length(cons(N,L)) >= a__uLength(a__and(a__isNat(N),a__isNatList(L)),L) ; a__length(X) >= length(X) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__isNatList(L) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__and(a__isNat(N),a__isNatList(L)) ; Marked_a__isNatList(take(N,IL)) >= Marked_a__isNatIList(IL) ; Marked_a__isNatList(take(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNatIList(IL) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; Marked_a__isNatIList(IL) >= Marked_a__isNatList(IL) ; Marked_a__and(tt,T) >= Marked_mark(T) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),mark(X2)) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_mark(X2) ; Marked_mark(isNatIList(X)) >= Marked_a__isNatIList(X) ; Marked_mark(isNatList(X)) >= Marked_a__isNatList(X) ; } + Disjunctions:{ { Marked_a__isNatList(cons(N,L)) > Marked_a__isNatList(L) ; } { Marked_a__isNatList(cons(N,L)) > Marked_a__and(a__isNat(N),a__isNatList(L)) ; } { Marked_a__isNatList(take(N,IL)) > Marked_a__isNatIList(IL) ; } { Marked_a__isNatList(take(N,IL)) > Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__isNatIList(IL) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; } { Marked_a__isNatIList(IL) > Marked_a__isNatList(IL) ; } { Marked_a__and(tt,T) > Marked_mark(T) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_a__and(mark(X1),mark(X2)) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(isNatIList(X)) > Marked_a__isNatIList(X) ; } { Marked_mark(isNatList(X)) > Marked_a__isNatList(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: mark(tt) >= tt constraint: mark(0) >= 0 constraint: mark(s(X)) >= s(mark(X)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(zeros) >= a__zeros constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(nil) >= nil constraint: mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) constraint: mark(and(X1,X2)) >= a__and(mark(X1),mark(X2)) constraint: mark(isNatIList(X)) >= a__isNatIList(X) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(isNat(X)) >= a__isNat(X) constraint: mark(uTake1(X)) >= a__uTake1(mark(X)) constraint: mark(uTake2(X1,X2,X3,X4)) >= a__uTake2(mark(X1),X2,X3,X4) constraint: mark(uLength(X1,X2)) >= a__uLength(mark(X1),X2) constraint: a__and(tt,T) >= mark(T) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isNatList(cons(N,L)) >= a__and(a__isNat(N),a__isNatList(L)) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(take(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) constraint: a__isNatList(X) >= isNatList(X) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(cons(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) constraint: a__isNatIList(IL) >= a__isNatList(IL) constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__isNat(0) >= tt constraint: a__isNat(s(N)) >= a__isNat(N) constraint: a__isNat(length(L)) >= a__isNatList(L) constraint: a__isNat(X) >= isNat(X) constraint: a__zeros >= zeros constraint: a__zeros >= cons(0,zeros) constraint: a__uTake1(tt) >= nil constraint: a__uTake1(X) >= uTake1(X) constraint: a__take(0,IL) >= a__uTake1(a__isNatIList(IL)) constraint: a__take(s(M),cons(N,IL)) >= a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M,N,IL) constraint: a__take(X1,X2) >= take(X1,X2) constraint: a__uTake2(tt,M,N,IL) >= cons(mark(N),take(M,IL)) constraint: a__uTake2(X1,X2,X3,X4) >= uTake2(X1,X2,X3,X4) constraint: a__uLength(tt,L) >= s(a__length(mark(L))) constraint: a__uLength(X1,X2) >= uLength(X1,X2) constraint: a__length(cons(N,L)) >= a__uLength(a__and(a__isNat(N), a__isNatList(L)),L) constraint: a__length(X) >= length(X) constraint: Marked_a__isNatList(cons(N,L)) >= Marked_a__isNatList(L) constraint: Marked_a__isNatList(cons(N,L)) >= Marked_a__and(a__isNat(N), a__isNatList(L)) constraint: Marked_a__isNatList(take(N,IL)) >= Marked_a__isNatIList(IL) constraint: Marked_a__isNatList(take(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) constraint: Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNatIList(IL) constraint: Marked_a__isNatIList(cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) constraint: Marked_a__isNatIList(IL) >= Marked_a__isNatList(IL) constraint: Marked_a__and(tt,T) >= Marked_mark(T) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),mark(X2)) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(isNatIList(X)) >= Marked_a__isNatIList(X) constraint: Marked_mark(isNatList(X)) >= Marked_a__isNatList(X) APPLY CRITERIA (Subterm criterion) ST: Marked_a__isNat -> 1 APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(tt) >= tt ; mark(0) >= 0 ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(zeros) >= a__zeros ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(nil) >= nil ; mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) ; mark(and(X1,X2)) >= a__and(mark(X1),mark(X2)) ; mark(isNatIList(X)) >= a__isNatIList(X) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(isNat(X)) >= a__isNat(X) ; mark(uTake1(X)) >= a__uTake1(mark(X)) ; mark(uTake2(X1,X2,X3,X4)) >= a__uTake2(mark(X1),X2,X3,X4) ; mark(uLength(X1,X2)) >= a__uLength(mark(X1),X2) ; a__and(tt,T) >= mark(T) ; a__and(X1,X2) >= and(X1,X2) ; a__isNatList(cons(N,L)) >= a__and(a__isNat(N),a__isNatList(L)) ; a__isNatList(nil) >= tt ; a__isNatList(take(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatList(X) >= isNatList(X) ; a__isNatIList(zeros) >= tt ; a__isNatIList(cons(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatIList(IL) >= a__isNatList(IL) ; a__isNatIList(X) >= isNatIList(X) ; a__isNat(0) >= tt ; a__isNat(s(N)) >= a__isNat(N) ; a__isNat(length(L)) >= a__isNatList(L) ; a__isNat(X) >= isNat(X) ; a__zeros >= zeros ; a__zeros >= cons(0,zeros) ; a__uTake1(tt) >= nil ; a__uTake1(X) >= uTake1(X) ; a__take(0,IL) >= a__uTake1(a__isNatIList(IL)) ; a__take(s(M),cons(N,IL)) >= a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N),a__isNatIList(IL))), M,N,IL) ; a__take(X1,X2) >= take(X1,X2) ; a__uTake2(tt,M,N,IL) >= cons(mark(N),take(M,IL)) ; a__uTake2(X1,X2,X3,X4) >= uTake2(X1,X2,X3,X4) ; a__uLength(tt,L) >= s(a__length(mark(L))) ; a__uLength(X1,X2) >= uLength(X1,X2) ; a__length(cons(N,L)) >= a__uLength(a__and(a__isNat(N),a__isNatList(L)),L) ; a__length(X) >= length(X) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__isNatList(L) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__and(a__isNat(N),a__isNatList(L)) ; Marked_a__isNatList(take(N,IL)) >= Marked_a__isNatIList(IL) ; Marked_a__isNatList(take(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNatIList(IL) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; Marked_a__isNatIList(IL) >= Marked_a__isNatList(IL) ; Marked_a__and(tt,T) >= Marked_mark(T) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),mark(X2)) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_mark(X2) ; Marked_mark(isNatIList(X)) >= Marked_a__isNatIList(X) ; Marked_mark(isNatList(X)) >= Marked_a__isNatList(X) ; } + Disjunctions:{ { Marked_a__isNatList(cons(N,L)) > Marked_a__isNatList(L) ; } { Marked_a__isNatList(cons(N,L)) > Marked_a__and(a__isNat(N),a__isNatList(L)) ; } { Marked_a__isNatList(take(N,IL)) > Marked_a__isNatIList(IL) ; } { Marked_a__isNatList(take(N,IL)) > Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__isNatIList(IL) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; } { Marked_a__isNatIList(IL) > Marked_a__isNatList(IL) ; } { Marked_a__and(tt,T) > Marked_mark(T) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(and(X1,X2)) > Marked_a__and(mark(X1),mark(X2)) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(isNatIList(X)) > Marked_a__isNatIList(X) ; } { Marked_mark(isNatList(X)) > Marked_a__isNatList(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: mark(tt) >= tt constraint: mark(0) >= 0 constraint: mark(s(X)) >= s(mark(X)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(zeros) >= a__zeros constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(nil) >= nil constraint: mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) constraint: mark(and(X1,X2)) >= a__and(mark(X1),mark(X2)) constraint: mark(isNatIList(X)) >= a__isNatIList(X) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(isNat(X)) >= a__isNat(X) constraint: mark(uTake1(X)) >= a__uTake1(mark(X)) constraint: mark(uTake2(X1,X2,X3,X4)) >= a__uTake2(mark(X1),X2,X3,X4) constraint: mark(uLength(X1,X2)) >= a__uLength(mark(X1),X2) constraint: a__and(tt,T) >= mark(T) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isNatList(cons(N,L)) >= a__and(a__isNat(N),a__isNatList(L)) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(take(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) constraint: a__isNatList(X) >= isNatList(X) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(cons(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) constraint: a__isNatIList(IL) >= a__isNatList(IL) constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__isNat(0) >= tt constraint: a__isNat(s(N)) >= a__isNat(N) constraint: a__isNat(length(L)) >= a__isNatList(L) constraint: a__isNat(X) >= isNat(X) constraint: a__zeros >= zeros constraint: a__zeros >= cons(0,zeros) constraint: a__uTake1(tt) >= nil constraint: a__uTake1(X) >= uTake1(X) constraint: a__take(0,IL) >= a__uTake1(a__isNatIList(IL)) constraint: a__take(s(M),cons(N,IL)) >= a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M,N,IL) constraint: a__take(X1,X2) >= take(X1,X2) constraint: a__uTake2(tt,M,N,IL) >= cons(mark(N),take(M,IL)) constraint: a__uTake2(X1,X2,X3,X4) >= uTake2(X1,X2,X3,X4) constraint: a__uLength(tt,L) >= s(a__length(mark(L))) constraint: a__uLength(X1,X2) >= uLength(X1,X2) constraint: a__length(cons(N,L)) >= a__uLength(a__and(a__isNat(N), a__isNatList(L)),L) constraint: a__length(X) >= length(X) constraint: Marked_a__isNatList(cons(N,L)) >= Marked_a__isNatList(L) constraint: Marked_a__isNatList(cons(N,L)) >= Marked_a__and(a__isNat(N), a__isNatList(L)) constraint: Marked_a__isNatList(take(N,IL)) >= Marked_a__isNatIList(IL) constraint: Marked_a__isNatList(take(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) constraint: Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNatIList(IL) constraint: Marked_a__isNatIList(cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) constraint: Marked_a__isNatIList(IL) >= Marked_a__isNatList(IL) constraint: Marked_a__and(tt,T) >= Marked_mark(T) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),mark(X2)) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(isNatIList(X)) >= Marked_a__isNatIList(X) constraint: Marked_mark(isNatList(X)) >= Marked_a__isNatList(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(tt) >= tt ; mark(0) >= 0 ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(zeros) >= a__zeros ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(nil) >= nil ; mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) ; mark(and(X1,X2)) >= a__and(mark(X1),mark(X2)) ; mark(isNatIList(X)) >= a__isNatIList(X) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(isNat(X)) >= a__isNat(X) ; mark(uTake1(X)) >= a__uTake1(mark(X)) ; mark(uTake2(X1,X2,X3,X4)) >= a__uTake2(mark(X1),X2,X3,X4) ; mark(uLength(X1,X2)) >= a__uLength(mark(X1),X2) ; a__and(tt,T) >= mark(T) ; a__and(X1,X2) >= and(X1,X2) ; a__isNatList(cons(N,L)) >= a__and(a__isNat(N),a__isNatList(L)) ; a__isNatList(nil) >= tt ; a__isNatList(take(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatList(X) >= isNatList(X) ; a__isNatIList(zeros) >= tt ; a__isNatIList(cons(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatIList(IL) >= a__isNatList(IL) ; a__isNatIList(X) >= isNatIList(X) ; a__isNat(0) >= tt ; a__isNat(s(N)) >= a__isNat(N) ; a__isNat(length(L)) >= a__isNatList(L) ; a__isNat(X) >= isNat(X) ; a__zeros >= zeros ; a__zeros >= cons(0,zeros) ; a__uTake1(tt) >= nil ; a__uTake1(X) >= uTake1(X) ; a__take(0,IL) >= a__uTake1(a__isNatIList(IL)) ; a__take(s(M),cons(N,IL)) >= a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N),a__isNatIList(IL))), M,N,IL) ; a__take(X1,X2) >= take(X1,X2) ; a__uTake2(tt,M,N,IL) >= cons(mark(N),take(M,IL)) ; a__uTake2(X1,X2,X3,X4) >= uTake2(X1,X2,X3,X4) ; a__uLength(tt,L) >= s(a__length(mark(L))) ; a__uLength(X1,X2) >= uLength(X1,X2) ; a__length(cons(N,L)) >= a__uLength(a__and(a__isNat(N),a__isNatList(L)),L) ; a__length(X) >= length(X) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__isNatList(L) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__and(a__isNat(N),a__isNatList(L)) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNatIList(IL) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; Marked_a__isNatIList(IL) >= Marked_a__isNatList(IL) ; Marked_a__and(tt,T) >= Marked_mark(T) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),mark(X2)) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_mark(X2) ; Marked_mark(isNatIList(X)) >= Marked_a__isNatIList(X) ; Marked_mark(isNatList(X)) >= Marked_a__isNatList(X) ; } + Disjunctions:{ { Marked_a__isNatList(cons(N,L)) > Marked_a__isNatList(L) ; } { Marked_a__isNatList(cons(N,L)) > Marked_a__and(a__isNat(N),a__isNatList(L)) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__isNatIList(IL) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; } { Marked_a__isNatIList(IL) > Marked_a__isNatList(IL) ; } { Marked_a__and(tt,T) > Marked_mark(T) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(and(X1,X2)) > Marked_a__and(mark(X1),mark(X2)) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(isNatIList(X)) > Marked_a__isNatIList(X) ; } { Marked_mark(isNatList(X)) > Marked_a__isNatList(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: mark(tt) >= tt constraint: mark(0) >= 0 constraint: mark(s(X)) >= s(mark(X)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(zeros) >= a__zeros constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(nil) >= nil constraint: mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) constraint: mark(and(X1,X2)) >= a__and(mark(X1),mark(X2)) constraint: mark(isNatIList(X)) >= a__isNatIList(X) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(isNat(X)) >= a__isNat(X) constraint: mark(uTake1(X)) >= a__uTake1(mark(X)) constraint: mark(uTake2(X1,X2,X3,X4)) >= a__uTake2(mark(X1),X2,X3,X4) constraint: mark(uLength(X1,X2)) >= a__uLength(mark(X1),X2) constraint: a__and(tt,T) >= mark(T) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isNatList(cons(N,L)) >= a__and(a__isNat(N),a__isNatList(L)) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(take(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) constraint: a__isNatList(X) >= isNatList(X) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(cons(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) constraint: a__isNatIList(IL) >= a__isNatList(IL) constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__isNat(0) >= tt constraint: a__isNat(s(N)) >= a__isNat(N) constraint: a__isNat(length(L)) >= a__isNatList(L) constraint: a__isNat(X) >= isNat(X) constraint: a__zeros >= zeros constraint: a__zeros >= cons(0,zeros) constraint: a__uTake1(tt) >= nil constraint: a__uTake1(X) >= uTake1(X) constraint: a__take(0,IL) >= a__uTake1(a__isNatIList(IL)) constraint: a__take(s(M),cons(N,IL)) >= a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M,N,IL) constraint: a__take(X1,X2) >= take(X1,X2) constraint: a__uTake2(tt,M,N,IL) >= cons(mark(N),take(M,IL)) constraint: a__uTake2(X1,X2,X3,X4) >= uTake2(X1,X2,X3,X4) constraint: a__uLength(tt,L) >= s(a__length(mark(L))) constraint: a__uLength(X1,X2) >= uLength(X1,X2) constraint: a__length(cons(N,L)) >= a__uLength(a__and(a__isNat(N), a__isNatList(L)),L) constraint: a__length(X) >= length(X) constraint: Marked_a__isNatList(cons(N,L)) >= Marked_a__isNatList(L) constraint: Marked_a__isNatList(cons(N,L)) >= Marked_a__and(a__isNat(N), a__isNatList(L)) constraint: Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNatIList(IL) constraint: Marked_a__isNatIList(cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) constraint: Marked_a__isNatIList(IL) >= Marked_a__isNatList(IL) constraint: Marked_a__and(tt,T) >= Marked_mark(T) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),mark(X2)) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(isNatIList(X)) >= Marked_a__isNatIList(X) constraint: Marked_mark(isNatList(X)) >= Marked_a__isNatList(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(tt) >= tt ; mark(0) >= 0 ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(zeros) >= a__zeros ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(nil) >= nil ; mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) ; mark(and(X1,X2)) >= a__and(mark(X1),mark(X2)) ; mark(isNatIList(X)) >= a__isNatIList(X) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(isNat(X)) >= a__isNat(X) ; mark(uTake1(X)) >= a__uTake1(mark(X)) ; mark(uTake2(X1,X2,X3,X4)) >= a__uTake2(mark(X1),X2,X3,X4) ; mark(uLength(X1,X2)) >= a__uLength(mark(X1),X2) ; a__and(tt,T) >= mark(T) ; a__and(X1,X2) >= and(X1,X2) ; a__isNatList(cons(N,L)) >= a__and(a__isNat(N),a__isNatList(L)) ; a__isNatList(nil) >= tt ; a__isNatList(take(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatList(X) >= isNatList(X) ; a__isNatIList(zeros) >= tt ; a__isNatIList(cons(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatIList(IL) >= a__isNatList(IL) ; a__isNatIList(X) >= isNatIList(X) ; a__isNat(0) >= tt ; a__isNat(s(N)) >= a__isNat(N) ; a__isNat(length(L)) >= a__isNatList(L) ; a__isNat(X) >= isNat(X) ; a__zeros >= zeros ; a__zeros >= cons(0,zeros) ; a__uTake1(tt) >= nil ; a__uTake1(X) >= uTake1(X) ; a__take(0,IL) >= a__uTake1(a__isNatIList(IL)) ; a__take(s(M),cons(N,IL)) >= a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N),a__isNatIList(IL))), M,N,IL) ; a__take(X1,X2) >= take(X1,X2) ; a__uTake2(tt,M,N,IL) >= cons(mark(N),take(M,IL)) ; a__uTake2(X1,X2,X3,X4) >= uTake2(X1,X2,X3,X4) ; a__uLength(tt,L) >= s(a__length(mark(L))) ; a__uLength(X1,X2) >= uLength(X1,X2) ; a__length(cons(N,L)) >= a__uLength(a__and(a__isNat(N),a__isNatList(L)),L) ; a__length(X) >= length(X) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__isNatList(L) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__and(a__isNat(N),a__isNatList(L)) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNatIList(IL) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; Marked_a__and(tt,T) >= Marked_mark(T) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),mark(X2)) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_mark(X2) ; Marked_mark(isNatIList(X)) >= Marked_a__isNatIList(X) ; Marked_mark(isNatList(X)) >= Marked_a__isNatList(X) ; } + Disjunctions:{ { Marked_a__isNatList(cons(N,L)) > Marked_a__isNatList(L) ; } { Marked_a__isNatList(cons(N,L)) > Marked_a__and(a__isNat(N),a__isNatList(L)) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__isNatIList(IL) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; } { Marked_a__and(tt,T) > Marked_mark(T) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(and(X1,X2)) > Marked_a__and(mark(X1),mark(X2)) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(isNatIList(X)) > Marked_a__isNatIList(X) ; } { Marked_mark(isNatList(X)) > Marked_a__isNatList(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 === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === Time out for these parameters. === TIMER virtual : 15.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 15.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. === TIMER virtual : 50.000000 === trying sub matrices of size: 1 Matrix interpretation constraints generated. Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. Termination constraints generated. Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 50.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(tt) >= tt constraint: mark(0) >= 0 constraint: mark(s(X)) >= s(mark(X)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(zeros) >= a__zeros constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(nil) >= nil constraint: mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) constraint: mark(and(X1,X2)) >= a__and(mark(X1),mark(X2)) constraint: mark(isNatIList(X)) >= a__isNatIList(X) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(isNat(X)) >= a__isNat(X) constraint: mark(uTake1(X)) >= a__uTake1(mark(X)) constraint: mark(uTake2(X1,X2,X3,X4)) >= a__uTake2(mark(X1),X2,X3,X4) constraint: mark(uLength(X1,X2)) >= a__uLength(mark(X1),X2) constraint: a__and(tt,T) >= mark(T) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isNatList(cons(N,L)) >= a__and(a__isNat(N),a__isNatList(L)) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(take(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) constraint: a__isNatList(X) >= isNatList(X) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(cons(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) constraint: a__isNatIList(IL) >= a__isNatList(IL) constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__isNat(0) >= tt constraint: a__isNat(s(N)) >= a__isNat(N) constraint: a__isNat(length(L)) >= a__isNatList(L) constraint: a__isNat(X) >= isNat(X) constraint: a__zeros >= zeros constraint: a__zeros >= cons(0,zeros) constraint: a__uTake1(tt) >= nil constraint: a__uTake1(X) >= uTake1(X) constraint: a__take(0,IL) >= a__uTake1(a__isNatIList(IL)) constraint: a__take(s(M),cons(N,IL)) >= a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M,N,IL) constraint: a__take(X1,X2) >= take(X1,X2) constraint: a__uTake2(tt,M,N,IL) >= cons(mark(N),take(M,IL)) constraint: a__uTake2(X1,X2,X3,X4) >= uTake2(X1,X2,X3,X4) constraint: a__uLength(tt,L) >= s(a__length(mark(L))) constraint: a__uLength(X1,X2) >= uLength(X1,X2) constraint: a__length(cons(N,L)) >= a__uLength(a__and(a__isNat(N), a__isNatList(L)),L) constraint: a__length(X) >= length(X) constraint: Marked_a__isNatList(cons(N,L)) >= Marked_a__isNatList(L) constraint: Marked_a__isNatList(cons(N,L)) >= Marked_a__and(a__isNat(N), a__isNatList(L)) constraint: Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNatIList(IL) constraint: Marked_a__isNatIList(cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) constraint: Marked_a__and(tt,T) >= Marked_mark(T) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),mark(X2)) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(isNatIList(X)) >= Marked_a__isNatIList(X) constraint: Marked_mark(isNatList(X)) >= Marked_a__isNatList(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(tt) >= tt ; mark(0) >= 0 ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(zeros) >= a__zeros ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(nil) >= nil ; mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) ; mark(and(X1,X2)) >= a__and(mark(X1),mark(X2)) ; mark(isNatIList(X)) >= a__isNatIList(X) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(isNat(X)) >= a__isNat(X) ; mark(uTake1(X)) >= a__uTake1(mark(X)) ; mark(uTake2(X1,X2,X3,X4)) >= a__uTake2(mark(X1),X2,X3,X4) ; mark(uLength(X1,X2)) >= a__uLength(mark(X1),X2) ; a__and(tt,T) >= mark(T) ; a__and(X1,X2) >= and(X1,X2) ; a__isNatList(cons(N,L)) >= a__and(a__isNat(N),a__isNatList(L)) ; a__isNatList(nil) >= tt ; a__isNatList(take(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatList(X) >= isNatList(X) ; a__isNatIList(zeros) >= tt ; a__isNatIList(cons(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatIList(IL) >= a__isNatList(IL) ; a__isNatIList(X) >= isNatIList(X) ; a__isNat(0) >= tt ; a__isNat(s(N)) >= a__isNat(N) ; a__isNat(length(L)) >= a__isNatList(L) ; a__isNat(X) >= isNat(X) ; a__zeros >= zeros ; a__zeros >= cons(0,zeros) ; a__uTake1(tt) >= nil ; a__uTake1(X) >= uTake1(X) ; a__take(0,IL) >= a__uTake1(a__isNatIList(IL)) ; a__take(s(M),cons(N,IL)) >= a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N),a__isNatIList(IL))), M,N,IL) ; a__take(X1,X2) >= take(X1,X2) ; a__uTake2(tt,M,N,IL) >= cons(mark(N),take(M,IL)) ; a__uTake2(X1,X2,X3,X4) >= uTake2(X1,X2,X3,X4) ; a__uLength(tt,L) >= s(a__length(mark(L))) ; a__uLength(X1,X2) >= uLength(X1,X2) ; a__length(cons(N,L)) >= a__uLength(a__and(a__isNat(N),a__isNatList(L)),L) ; a__length(X) >= length(X) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__isNatList(L) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__and(a__isNat(N),a__isNatList(L)) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__isNatIList(IL) ; Marked_a__isNatIList(cons(N,IL)) >= Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; Marked_a__and(tt,T) >= Marked_mark(T) ; Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),mark(X2)) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_mark(X2) ; Marked_mark(isNatIList(X)) >= Marked_a__isNatIList(X) ; Marked_mark(isNatList(X)) >= Marked_a__isNatList(X) ; } + Disjunctions:{ { Marked_a__isNatList(cons(N,L)) > Marked_a__isNatList(L) ; } { Marked_a__isNatList(cons(N,L)) > Marked_a__and(a__isNat(N),a__isNatList(L)) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__isNatIList(IL) ; } { Marked_a__isNatIList(cons(N,IL)) > Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; } { Marked_a__and(tt,T) > Marked_mark(T) ; } { Marked_mark(and(X1,X2)) > Marked_a__and(mark(X1),mark(X2)) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(isNatIList(X)) > Marked_a__isNatIList(X) ; } { Marked_mark(isNatList(X)) > Marked_a__isNatList(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 === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === Time out for these parameters. === TIMER virtual : 15.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 15.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. === TIMER virtual : 50.000000 === trying sub matrices of size: 1 Matrix interpretation constraints generated. Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. Termination constraints generated. Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 50.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. No solution found for these constraints. APPLY CRITERIA (Simple graph) Found the following constraints: { mark(tt) >= tt ; mark(0) >= 0 ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(zeros) >= a__zeros ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(nil) >= nil ; mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) ; mark(and(X1,X2)) >= a__and(mark(X1),mark(X2)) ; mark(isNatIList(X)) >= a__isNatIList(X) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(isNat(X)) >= a__isNat(X) ; mark(uTake1(X)) >= a__uTake1(mark(X)) ; mark(uTake2(X1,X2,X3,X4)) >= a__uTake2(mark(X1),X2,X3,X4) ; mark(uLength(X1,X2)) >= a__uLength(mark(X1),X2) ; a__and(tt,T) >= mark(T) ; a__and(X1,X2) >= and(X1,X2) ; a__isNatList(cons(N,L)) >= a__and(a__isNat(N),a__isNatList(L)) ; a__isNatList(nil) >= tt ; a__isNatList(take(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatList(X) >= isNatList(X) ; a__isNatIList(zeros) >= tt ; a__isNatIList(cons(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatIList(IL) >= a__isNatList(IL) ; a__isNatIList(X) >= isNatIList(X) ; a__isNat(0) >= tt ; a__isNat(s(N)) >= a__isNat(N) ; a__isNat(length(L)) >= a__isNatList(L) ; a__isNat(X) >= isNat(X) ; a__zeros >= zeros ; a__zeros >= cons(0,zeros) ; a__uTake1(tt) >= nil ; a__uTake1(X) >= uTake1(X) ; a__take(0,IL) >= a__uTake1(a__isNatIList(IL)) ; a__take(s(M),cons(N,IL)) >= a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N),a__isNatIList(IL))), M,N,IL) ; a__take(X1,X2) >= take(X1,X2) ; a__uTake2(tt,M,N,IL) >= cons(mark(N),take(M,IL)) ; a__uTake2(X1,X2,X3,X4) >= uTake2(X1,X2,X3,X4) ; a__uLength(tt,L) >= s(a__length(mark(L))) ; a__uLength(X1,X2) >= uLength(X1,X2) ; a__length(cons(N,L)) >= a__uLength(a__and(a__isNat(N),a__isNatList(L)),L) ; a__length(X) >= length(X) ; Marked_a__isNatList(cons(N,L)) > Marked_a__isNatList(L) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__and(a__isNat(N),a__isNatList(L)) ; Marked_a__isNatIList(cons(N,IL)) > Marked_a__isNatIList(IL) ; Marked_a__isNatIList(cons(N,IL)) > Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; Marked_a__and(tt,T) > Marked_mark(T) ; Marked_mark(and(X1,X2)) > Marked_a__and(mark(X1),mark(X2)) ; Marked_mark(and(X1,X2)) > Marked_mark(X1) ; Marked_mark(and(X1,X2)) > Marked_mark(X2) ; Marked_mark(isNatIList(X)) >= Marked_a__isNatIList(X) ; Marked_mark(isNatList(X)) >= Marked_a__isNatList(X) ; } APPLY CRITERIA (SOLVE_ORD) Trying to solve the following constraints: { mark(tt) >= tt ; mark(0) >= 0 ; mark(s(X)) >= s(mark(X)) ; mark(length(X)) >= a__length(mark(X)) ; mark(zeros) >= a__zeros ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(nil) >= nil ; mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) ; mark(and(X1,X2)) >= a__and(mark(X1),mark(X2)) ; mark(isNatIList(X)) >= a__isNatIList(X) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(isNat(X)) >= a__isNat(X) ; mark(uTake1(X)) >= a__uTake1(mark(X)) ; mark(uTake2(X1,X2,X3,X4)) >= a__uTake2(mark(X1),X2,X3,X4) ; mark(uLength(X1,X2)) >= a__uLength(mark(X1),X2) ; a__and(tt,T) >= mark(T) ; a__and(X1,X2) >= and(X1,X2) ; a__isNatList(cons(N,L)) >= a__and(a__isNat(N),a__isNatList(L)) ; a__isNatList(nil) >= tt ; a__isNatList(take(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatList(X) >= isNatList(X) ; a__isNatIList(zeros) >= tt ; a__isNatIList(cons(N,IL)) >= a__and(a__isNat(N),a__isNatIList(IL)) ; a__isNatIList(IL) >= a__isNatList(IL) ; a__isNatIList(X) >= isNatIList(X) ; a__isNat(0) >= tt ; a__isNat(s(N)) >= a__isNat(N) ; a__isNat(length(L)) >= a__isNatList(L) ; a__isNat(X) >= isNat(X) ; a__zeros >= zeros ; a__zeros >= cons(0,zeros) ; a__uTake1(tt) >= nil ; a__uTake1(X) >= uTake1(X) ; a__take(0,IL) >= a__uTake1(a__isNatIList(IL)) ; a__take(s(M),cons(N,IL)) >= a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N),a__isNatIList(IL))), M,N,IL) ; a__take(X1,X2) >= take(X1,X2) ; a__uTake2(tt,M,N,IL) >= cons(mark(N),take(M,IL)) ; a__uTake2(X1,X2,X3,X4) >= uTake2(X1,X2,X3,X4) ; a__uLength(tt,L) >= s(a__length(mark(L))) ; a__uLength(X1,X2) >= uLength(X1,X2) ; a__length(cons(N,L)) >= a__uLength(a__and(a__isNat(N),a__isNatList(L)),L) ; a__length(X) >= length(X) ; Marked_a__isNatList(cons(N,L)) > Marked_a__isNatList(L) ; Marked_a__isNatList(cons(N,L)) >= Marked_a__and(a__isNat(N),a__isNatList(L)) ; Marked_a__isNatIList(cons(N,IL)) > Marked_a__isNatIList(IL) ; Marked_a__isNatIList(cons(N,IL)) > Marked_a__and(a__isNat(N), a__isNatIList(IL)) ; Marked_a__and(tt,T) > Marked_mark(T) ; Marked_mark(and(X1,X2)) > Marked_a__and(mark(X1),mark(X2)) ; Marked_mark(and(X1,X2)) > Marked_mark(X1) ; Marked_mark(and(X1,X2)) > Marked_mark(X2) ; Marked_mark(isNatIList(X)) >= Marked_a__isNatIList(X) ; Marked_mark(isNatList(X)) >= Marked_a__isNatList(X) ; } + Disjunctions:{ } === 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 === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === Time out for these parameters. === TIMER virtual : 15.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 15.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. === TIMER virtual : 50.000000 === trying sub matrices of size: 1 Matrix interpretation constraints generated. Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. Termination constraints generated. Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 50.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. No solution found for these constraints. APPLY CRITERIA (ID_CRIT) APPLY CRITERIA (Graph splitting) Found 0 components: NOT SOLVED No proof found Cime worked for 172.097160 seconds (real time) Cime Exit Status: 0