- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] a__zeros -> cons(0,zeros) [2] a__U11(tt,L) -> s(a__length(mark(L))) [3] a__U21(tt) -> nil [4] a__U31(tt,IL,M,N) -> cons(mark(N),take(M,IL)) [5] a__and(tt,X) -> mark(X) [6] a__isNat(0) -> tt [7] a__isNat(length(V1)) -> a__isNatList(V1) [8] a__isNat(s(V1)) -> a__isNat(V1) [9] a__isNatIList(V) -> a__isNatList(V) [10] a__isNatIList(zeros) -> tt [11] a__isNatIList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatIList(V2)) [12] a__isNatList(nil) -> tt [13] a__isNatList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatList(V2)) [14] a__isNatList(take(V1,V2)) -> a__and(a__isNat(V1),isNatIList(V2)) [15] a__length(nil) -> 0 [16] a__length(cons(N,L)) -> a__U11(a__and(a__isNatList(L),isNat(N)),L) [17] a__take(0,IL) -> a__U21(a__isNatIList(IL)) [18] a__take(s(M),cons(N,IL)) -> a__U31(a__and(a__isNatIList(IL),and(isNat(M),isNat(N))),IL,M,N) [19] mark(zeros) -> a__zeros [20] mark(U11(X1,X2)) -> a__U11(mark(X1),X2) [21] mark(length(X)) -> a__length(mark(X)) [22] mark(U21(X)) -> a__U21(mark(X)) [23] mark(U31(X1,X2,X3,X4)) -> a__U31(mark(X1),X2,X3,X4) [24] mark(take(X1,X2)) -> a__take(mark(X1),mark(X2)) [25] mark(and(X1,X2)) -> a__and(mark(X1),X2) [26] mark(isNat(X)) -> a__isNat(X) [27] mark(isNatList(X)) -> a__isNatList(X) [28] mark(isNatIList(X)) -> a__isNatIList(X) [29] mark(cons(X1,X2)) -> cons(mark(X1),X2) [30] mark(0) -> 0 [31] mark(tt) -> tt [32] mark(s(X)) -> s(mark(X)) [33] mark(nil) -> nil [34] a__zeros -> zeros [35] a__U11(X1,X2) -> U11(X1,X2) [36] a__length(X) -> length(X) [37] a__U21(X) -> U21(X) [38] a__U31(X1,X2,X3,X4) -> U31(X1,X2,X3,X4) [39] a__take(X1,X2) -> take(X1,X2) [40] a__and(X1,X2) -> and(X1,X2) [41] a__isNat(X) -> isNat(X) [42] a__isNatList(X) -> isNatList(X) [43] a__isNatIList(X) -> isNatIList(X) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a__zeros >= cons(0,zeros) ; a__zeros >= zeros ; a__length(cons(N,L)) >= a__U11(a__and(a__isNatList(L),isNat(N)),L) ; a__length(nil) >= 0 ; a__length(X) >= length(X) ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(0) >= 0 ; mark(zeros) >= a__zeros ; mark(s(X)) >= s(mark(X)) ; mark(tt) >= tt ; mark(nil) >= nil ; mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) ; mark(length(X)) >= a__length(mark(X)) ; mark(isNatIList(X)) >= a__isNatIList(X) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(isNat(X)) >= a__isNat(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U21(X)) >= a__U21(mark(X)) ; mark(U31(X1,X2,X3,X4)) >= a__U31(mark(X1),X2,X3,X4) ; a__U11(tt,L) >= s(a__length(mark(L))) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U21(tt) >= nil ; a__U21(X) >= U21(X) ; a__U31(tt,IL,M,N) >= cons(mark(N),take(M,IL)) ; a__U31(X1,X2,X3,X4) >= U31(X1,X2,X3,X4) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isNat(0) >= tt ; a__isNat(s(V1)) >= a__isNat(V1) ; a__isNat(length(V1)) >= a__isNatList(V1) ; a__isNat(X) >= isNat(X) ; a__isNatList(cons(V1,V2)) >= a__and(a__isNat(V1),isNatList(V2)) ; a__isNatList(nil) >= tt ; a__isNatList(take(V1,V2)) >= a__and(a__isNat(V1),isNatIList(V2)) ; a__isNatList(X) >= isNatList(X) ; a__isNatIList(cons(V1,V2)) >= a__and(a__isNat(V1),isNatIList(V2)) ; a__isNatIList(zeros) >= tt ; a__isNatIList(X) >= isNatIList(X) ; a__isNatIList(V) >= a__isNatList(V) ; a__take(0,IL) >= a__U21(a__isNatIList(IL)) ; a__take(s(M),cons(N,IL)) >= a__U31(a__and(a__isNatIList(IL), and(isNat(M),isNat(N))),IL,M,N) ; a__take(X1,X2) >= take(X1,X2) ; Marked_a__isNatIList(cons(V1,V2)) >= Marked_a__isNat(V1) ; Marked_a__isNatIList(cons(V1,V2)) >= Marked_a__and(a__isNat(V1), isNatIList(V2)) ; Marked_a__isNatIList(V) >= Marked_a__isNatList(V) ; Marked_a__isNatList(cons(V1,V2)) >= Marked_a__isNat(V1) ; Marked_a__isNatList(cons(V1,V2)) >= Marked_a__and(a__isNat(V1),isNatList(V2)) ; Marked_a__isNatList(take(V1,V2)) >= Marked_a__isNat(V1) ; Marked_a__isNatList(take(V1,V2)) >= Marked_a__and(a__isNat(V1), isNatIList(V2)) ; Marked_a__isNat(s(V1)) >= Marked_a__isNat(V1) ; Marked_a__isNat(length(V1)) >= Marked_a__isNatList(V1) ; Marked_a__and(tt,X) >= Marked_mark(X) ; Marked_a__take(0,IL) >= Marked_a__isNatIList(IL) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__isNatIList(IL) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__and(a__isNatIList(IL), and(isNat(M),isNat(N))) ; Marked_a__take(s(M),cons(N,IL)) >= Marked_a__U31(a__and(a__isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N) ; Marked_a__U31(tt,IL,M,N) >= Marked_mark(N) ; Marked_a__length(cons(N,L)) >= Marked_a__isNatList(L) ; Marked_a__length(cons(N,L)) >= Marked_a__and(a__isNatList(L),isNat(N)) ; Marked_a__length(cons(N,L)) >= Marked_a__U11(a__and(a__isNatList(L),isNat(N)), L) ; Marked_a__U11(tt,L) >= Marked_a__length(mark(L)) ; Marked_a__U11(tt,L) >= Marked_mark(L) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(s(X)) >= Marked_mark(X) ; 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(length(X)) >= Marked_a__length(mark(X)) ; Marked_mark(length(X)) >= Marked_mark(X) ; 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(and(X1,X2)) >= Marked_a__and(mark(X1),X2) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U11(X1,X2)) >= Marked_a__U11(mark(X1),X2) ; Marked_mark(U11(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U21(X)) >= Marked_mark(X) ; Marked_mark(U31(X1,X2,X3,X4)) >= Marked_a__U31(mark(X1),X2,X3,X4) ; Marked_mark(U31(X1,X2,X3,X4)) >= Marked_mark(X1) ; } + Disjunctions:{ { Marked_a__isNatIList(cons(V1,V2)) > Marked_a__isNat(V1) ; } { Marked_a__isNatIList(cons(V1,V2)) > Marked_a__and(a__isNat(V1), isNatIList(V2)) ; } { Marked_a__isNatIList(V) > Marked_a__isNatList(V) ; } { Marked_a__isNatList(cons(V1,V2)) > Marked_a__isNat(V1) ; } { Marked_a__isNatList(cons(V1,V2)) > Marked_a__and(a__isNat(V1),isNatList(V2)) ; } { Marked_a__isNatList(take(V1,V2)) > Marked_a__isNat(V1) ; } { Marked_a__isNatList(take(V1,V2)) > Marked_a__and(a__isNat(V1),isNatIList(V2)) ; } { Marked_a__isNat(s(V1)) > Marked_a__isNat(V1) ; } { Marked_a__isNat(length(V1)) > Marked_a__isNatList(V1) ; } { Marked_a__and(tt,X) > Marked_mark(X) ; } { Marked_a__take(0,IL) > Marked_a__isNatIList(IL) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__isNatIList(IL) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__and(a__isNatIList(IL), and(isNat(M),isNat(N))) ; } { Marked_a__take(s(M),cons(N,IL)) > Marked_a__U31(a__and(a__isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N) ; } { Marked_a__U31(tt,IL,M,N) > Marked_mark(N) ; } { Marked_a__length(cons(N,L)) > Marked_a__isNatList(L) ; } { Marked_a__length(cons(N,L)) > Marked_a__and(a__isNatList(L),isNat(N)) ; } { Marked_a__length(cons(N,L)) > Marked_a__U11(a__and(a__isNatList(L),isNat(N)), L) ; } { Marked_a__U11(tt,L) > Marked_a__length(mark(L)) ; } { Marked_a__U11(tt,L) > Marked_mark(L) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { 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(length(X)) > Marked_a__length(mark(X)) ; } { Marked_mark(length(X)) > Marked_mark(X) ; } { 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(and(X1,X2)) > Marked_a__and(mark(X1),X2) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U11(X1,X2)) > Marked_a__U11(mark(X1),X2) ; } { Marked_mark(U11(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U21(X)) > Marked_mark(X) ; } { Marked_mark(U31(X1,X2,X3,X4)) > Marked_a__U31(mark(X1),X2,X3,X4) ; } { Marked_mark(U31(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: a__zeros >= cons(0,zeros) constraint: a__zeros >= zeros constraint: a__length(cons(N,L)) >= a__U11(a__and(a__isNatList(L),isNat(N)),L) constraint: a__length(nil) >= 0 constraint: a__length(X) >= length(X) constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(0) >= 0 constraint: mark(zeros) >= a__zeros constraint: mark(s(X)) >= s(mark(X)) constraint: mark(tt) >= tt constraint: mark(nil) >= nil constraint: mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(isNatIList(X)) >= a__isNatIList(X) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(isNat(X)) >= a__isNat(X) constraint: mark(and(X1,X2)) >= a__and(mark(X1),X2) constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2) constraint: mark(U21(X)) >= a__U21(mark(X)) constraint: mark(U31(X1,X2,X3,X4)) >= a__U31(mark(X1),X2,X3,X4) constraint: a__U11(tt,L) >= s(a__length(mark(L))) constraint: a__U11(X1,X2) >= U11(X1,X2) constraint: a__U21(tt) >= nil constraint: a__U21(X) >= U21(X) constraint: a__U31(tt,IL,M,N) >= cons(mark(N),take(M,IL)) constraint: a__U31(X1,X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: a__and(tt,X) >= mark(X) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isNat(0) >= tt constraint: a__isNat(s(V1)) >= a__isNat(V1) constraint: a__isNat(length(V1)) >= a__isNatList(V1) constraint: a__isNat(X) >= isNat(X) constraint: a__isNatList(cons(V1,V2)) >= a__and(a__isNat(V1),isNatList(V2)) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(take(V1,V2)) >= a__and(a__isNat(V1),isNatIList(V2)) constraint: a__isNatList(X) >= isNatList(X) constraint: a__isNatIList(cons(V1,V2)) >= a__and(a__isNat(V1),isNatIList(V2)) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__isNatIList(V) >= a__isNatList(V) constraint: a__take(0,IL) >= a__U21(a__isNatIList(IL)) constraint: a__take(s(M),cons(N,IL)) >= a__U31(a__and(a__isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N) constraint: a__take(X1,X2) >= take(X1,X2) constraint: Marked_a__isNatIList(cons(V1,V2)) >= Marked_a__isNat(V1) constraint: Marked_a__isNatIList(cons(V1,V2)) >= Marked_a__and(a__isNat(V1), isNatIList(V2)) constraint: Marked_a__isNatIList(V) >= Marked_a__isNatList(V) constraint: Marked_a__isNatList(cons(V1,V2)) >= Marked_a__isNat(V1) constraint: Marked_a__isNatList(cons(V1,V2)) >= Marked_a__and(a__isNat(V1), isNatList(V2)) constraint: Marked_a__isNatList(take(V1,V2)) >= Marked_a__isNat(V1) constraint: Marked_a__isNatList(take(V1,V2)) >= Marked_a__and(a__isNat(V1), isNatIList(V2)) constraint: Marked_a__isNat(s(V1)) >= Marked_a__isNat(V1) constraint: Marked_a__isNat(length(V1)) >= Marked_a__isNatList(V1) constraint: Marked_a__and(tt,X) >= Marked_mark(X) constraint: Marked_a__take(0,IL) >= Marked_a__isNatIList(IL) 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__isNatIList(IL), and(isNat(M),isNat(N))) constraint: Marked_a__take(s(M),cons(N,IL)) >= Marked_a__U31(a__and(a__isNatIList( IL), and(isNat(M), isNat(N))), IL,M,N) constraint: Marked_a__U31(tt,IL,M,N) >= Marked_mark(N) constraint: Marked_a__length(cons(N,L)) >= Marked_a__isNatList(L) constraint: Marked_a__length(cons(N,L)) >= Marked_a__and(a__isNatList(L), isNat(N)) constraint: Marked_a__length(cons(N,L)) >= Marked_a__U11(a__and(a__isNatList(L), isNat(N)),L) constraint: Marked_a__U11(tt,L) >= Marked_a__length(mark(L)) constraint: Marked_a__U11(tt,L) >= Marked_mark(L) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(s(X)) >= Marked_mark(X) 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(length(X)) >= Marked_a__length(mark(X)) constraint: Marked_mark(length(X)) >= Marked_mark(X) 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(and(X1,X2)) >= Marked_a__and(mark(X1),X2) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U11(X1,X2)) >= Marked_a__U11(mark(X1),X2) constraint: Marked_mark(U11(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U21(X)) >= Marked_mark(X) constraint: Marked_mark(U31(X1,X2,X3,X4)) >= Marked_a__U31(mark(X1),X2,X3,X4) constraint: Marked_mark(U31(X1,X2,X3,X4)) >= Marked_mark(X1) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a__zeros >= cons(0,zeros) ; a__zeros >= zeros ; a__length(cons(N,L)) >= a__U11(a__and(a__isNatList(L),isNat(N)),L) ; a__length(nil) >= 0 ; a__length(X) >= length(X) ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(0) >= 0 ; mark(zeros) >= a__zeros ; mark(s(X)) >= s(mark(X)) ; mark(tt) >= tt ; mark(nil) >= nil ; mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) ; mark(length(X)) >= a__length(mark(X)) ; mark(isNatIList(X)) >= a__isNatIList(X) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(isNat(X)) >= a__isNat(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U21(X)) >= a__U21(mark(X)) ; mark(U31(X1,X2,X3,X4)) >= a__U31(mark(X1),X2,X3,X4) ; a__U11(tt,L) >= s(a__length(mark(L))) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U21(tt) >= nil ; a__U21(X) >= U21(X) ; a__U31(tt,IL,M,N) >= cons(mark(N),take(M,IL)) ; a__U31(X1,X2,X3,X4) >= U31(X1,X2,X3,X4) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isNat(0) >= tt ; a__isNat(s(V1)) >= a__isNat(V1) ; a__isNat(length(V1)) >= a__isNatList(V1) ; a__isNat(X) >= isNat(X) ; a__isNatList(cons(V1,V2)) >= a__and(a__isNat(V1),isNatList(V2)) ; a__isNatList(nil) >= tt ; a__isNatList(take(V1,V2)) >= a__and(a__isNat(V1),isNatIList(V2)) ; a__isNatList(X) >= isNatList(X) ; a__isNatIList(cons(V1,V2)) >= a__and(a__isNat(V1),isNatIList(V2)) ; a__isNatIList(zeros) >= tt ; a__isNatIList(X) >= isNatIList(X) ; a__isNatIList(V) >= a__isNatList(V) ; a__take(0,IL) >= a__U21(a__isNatIList(IL)) ; a__take(s(M),cons(N,IL)) >= a__U31(a__and(a__isNatIList(IL), and(isNat(M),isNat(N))),IL,M,N) ; a__take(X1,X2) >= take(X1,X2) ; Marked_a__isNatIList(cons(V1,V2)) >= Marked_a__isNat(V1) ; Marked_a__isNatIList(cons(V1,V2)) >= Marked_a__and(a__isNat(V1), isNatIList(V2)) ; Marked_a__isNatIList(V) >= Marked_a__isNatList(V) ; Marked_a__isNatList(cons(V1,V2)) >= Marked_a__isNat(V1) ; Marked_a__isNatList(cons(V1,V2)) >= Marked_a__and(a__isNat(V1),isNatList(V2)) ; Marked_a__isNatList(take(V1,V2)) >= Marked_a__isNat(V1) ; Marked_a__isNatList(take(V1,V2)) >= Marked_a__and(a__isNat(V1), isNatIList(V2)) ; Marked_a__isNat(s(V1)) >= Marked_a__isNat(V1) ; Marked_a__isNat(length(V1)) >= Marked_a__isNatList(V1) ; Marked_a__and(tt,X) >= Marked_mark(X) ; Marked_a__length(cons(N,L)) >= Marked_a__isNatList(L) ; Marked_a__length(cons(N,L)) >= Marked_a__and(a__isNatList(L),isNat(N)) ; Marked_a__length(cons(N,L)) >= Marked_a__U11(a__and(a__isNatList(L),isNat(N)), L) ; Marked_a__U11(tt,L) >= Marked_a__length(mark(L)) ; Marked_a__U11(tt,L) >= Marked_mark(L) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_a__length(mark(X)) ; Marked_mark(length(X)) >= Marked_mark(X) ; Marked_mark(isNatIList(X)) >= Marked_a__isNatIList(X) ; Marked_mark(isNatList(X)) >= Marked_a__isNatList(X) ; Marked_mark(isNat(X)) >= Marked_a__isNat(X) ; Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),X2) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U11(X1,X2)) >= Marked_a__U11(mark(X1),X2) ; Marked_mark(U11(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U21(X)) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_a__isNatIList(cons(V1,V2)) > Marked_a__isNat(V1) ; } { Marked_a__isNatIList(cons(V1,V2)) > Marked_a__and(a__isNat(V1), isNatIList(V2)) ; } { Marked_a__isNatIList(V) > Marked_a__isNatList(V) ; } { Marked_a__isNatList(cons(V1,V2)) > Marked_a__isNat(V1) ; } { Marked_a__isNatList(cons(V1,V2)) > Marked_a__and(a__isNat(V1),isNatList(V2)) ; } { Marked_a__isNatList(take(V1,V2)) > Marked_a__isNat(V1) ; } { Marked_a__isNatList(take(V1,V2)) > Marked_a__and(a__isNat(V1),isNatIList(V2)) ; } { Marked_a__isNat(s(V1)) > Marked_a__isNat(V1) ; } { Marked_a__isNat(length(V1)) > Marked_a__isNatList(V1) ; } { Marked_a__and(tt,X) > Marked_mark(X) ; } { Marked_a__length(cons(N,L)) > Marked_a__isNatList(L) ; } { Marked_a__length(cons(N,L)) > Marked_a__and(a__isNatList(L),isNat(N)) ; } { Marked_a__length(cons(N,L)) > Marked_a__U11(a__and(a__isNatList(L),isNat(N)), L) ; } { Marked_a__U11(tt,L) > Marked_a__length(mark(L)) ; } { Marked_a__U11(tt,L) > Marked_mark(L) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_a__length(mark(X)) ; } { Marked_mark(length(X)) > Marked_mark(X) ; } { Marked_mark(isNatIList(X)) > Marked_a__isNatIList(X) ; } { Marked_mark(isNatList(X)) > Marked_a__isNatList(X) ; } { Marked_mark(isNat(X)) > Marked_a__isNat(X) ; } { Marked_mark(and(X1,X2)) > Marked_a__and(mark(X1),X2) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U11(X1,X2)) > Marked_a__U11(mark(X1),X2) ; } { Marked_mark(U11(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U21(X)) > Marked_mark(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a__zeros >= cons(0,zeros) constraint: a__zeros >= zeros constraint: a__length(cons(N,L)) >= a__U11(a__and(a__isNatList(L),isNat(N)),L) constraint: a__length(nil) >= 0 constraint: a__length(X) >= length(X) constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(0) >= 0 constraint: mark(zeros) >= a__zeros constraint: mark(s(X)) >= s(mark(X)) constraint: mark(tt) >= tt constraint: mark(nil) >= nil constraint: mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(isNatIList(X)) >= a__isNatIList(X) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(isNat(X)) >= a__isNat(X) constraint: mark(and(X1,X2)) >= a__and(mark(X1),X2) constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2) constraint: mark(U21(X)) >= a__U21(mark(X)) constraint: mark(U31(X1,X2,X3,X4)) >= a__U31(mark(X1),X2,X3,X4) constraint: a__U11(tt,L) >= s(a__length(mark(L))) constraint: a__U11(X1,X2) >= U11(X1,X2) constraint: a__U21(tt) >= nil constraint: a__U21(X) >= U21(X) constraint: a__U31(tt,IL,M,N) >= cons(mark(N),take(M,IL)) constraint: a__U31(X1,X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: a__and(tt,X) >= mark(X) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isNat(0) >= tt constraint: a__isNat(s(V1)) >= a__isNat(V1) constraint: a__isNat(length(V1)) >= a__isNatList(V1) constraint: a__isNat(X) >= isNat(X) constraint: a__isNatList(cons(V1,V2)) >= a__and(a__isNat(V1),isNatList(V2)) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(take(V1,V2)) >= a__and(a__isNat(V1),isNatIList(V2)) constraint: a__isNatList(X) >= isNatList(X) constraint: a__isNatIList(cons(V1,V2)) >= a__and(a__isNat(V1),isNatIList(V2)) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__isNatIList(V) >= a__isNatList(V) constraint: a__take(0,IL) >= a__U21(a__isNatIList(IL)) constraint: a__take(s(M),cons(N,IL)) >= a__U31(a__and(a__isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N) constraint: a__take(X1,X2) >= take(X1,X2) constraint: Marked_a__isNatIList(cons(V1,V2)) >= Marked_a__isNat(V1) constraint: Marked_a__isNatIList(cons(V1,V2)) >= Marked_a__and(a__isNat(V1), isNatIList(V2)) constraint: Marked_a__isNatIList(V) >= Marked_a__isNatList(V) constraint: Marked_a__isNatList(cons(V1,V2)) >= Marked_a__isNat(V1) constraint: Marked_a__isNatList(cons(V1,V2)) >= Marked_a__and(a__isNat(V1), isNatList(V2)) constraint: Marked_a__isNatList(take(V1,V2)) >= Marked_a__isNat(V1) constraint: Marked_a__isNatList(take(V1,V2)) >= Marked_a__and(a__isNat(V1), isNatIList(V2)) constraint: Marked_a__isNat(s(V1)) >= Marked_a__isNat(V1) constraint: Marked_a__isNat(length(V1)) >= Marked_a__isNatList(V1) constraint: Marked_a__and(tt,X) >= Marked_mark(X) constraint: Marked_a__length(cons(N,L)) >= Marked_a__isNatList(L) constraint: Marked_a__length(cons(N,L)) >= Marked_a__and(a__isNatList(L), isNat(N)) constraint: Marked_a__length(cons(N,L)) >= Marked_a__U11(a__and(a__isNatList(L), isNat(N)),L) constraint: Marked_a__U11(tt,L) >= Marked_a__length(mark(L)) constraint: Marked_a__U11(tt,L) >= Marked_mark(L) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_a__length(mark(X)) constraint: Marked_mark(length(X)) >= Marked_mark(X) constraint: Marked_mark(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(and(X1,X2)) >= Marked_a__and(mark(X1),X2) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U11(X1,X2)) >= Marked_a__U11(mark(X1),X2) constraint: Marked_mark(U11(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U21(X)) >= Marked_mark(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a__zeros >= cons(0,zeros) ; a__zeros >= zeros ; a__length(cons(N,L)) >= a__U11(a__and(a__isNatList(L),isNat(N)),L) ; a__length(nil) >= 0 ; a__length(X) >= length(X) ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(0) >= 0 ; mark(zeros) >= a__zeros ; mark(s(X)) >= s(mark(X)) ; mark(tt) >= tt ; mark(nil) >= nil ; mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) ; mark(length(X)) >= a__length(mark(X)) ; mark(isNatIList(X)) >= a__isNatIList(X) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(isNat(X)) >= a__isNat(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U21(X)) >= a__U21(mark(X)) ; mark(U31(X1,X2,X3,X4)) >= a__U31(mark(X1),X2,X3,X4) ; a__U11(tt,L) >= s(a__length(mark(L))) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U21(tt) >= nil ; a__U21(X) >= U21(X) ; a__U31(tt,IL,M,N) >= cons(mark(N),take(M,IL)) ; a__U31(X1,X2,X3,X4) >= U31(X1,X2,X3,X4) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isNat(0) >= tt ; a__isNat(s(V1)) >= a__isNat(V1) ; a__isNat(length(V1)) >= a__isNatList(V1) ; a__isNat(X) >= isNat(X) ; a__isNatList(cons(V1,V2)) >= a__and(a__isNat(V1),isNatList(V2)) ; a__isNatList(nil) >= tt ; a__isNatList(take(V1,V2)) >= a__and(a__isNat(V1),isNatIList(V2)) ; a__isNatList(X) >= isNatList(X) ; a__isNatIList(cons(V1,V2)) >= a__and(a__isNat(V1),isNatIList(V2)) ; a__isNatIList(zeros) >= tt ; a__isNatIList(X) >= isNatIList(X) ; a__isNatIList(V) >= a__isNatList(V) ; a__take(0,IL) >= a__U21(a__isNatIList(IL)) ; a__take(s(M),cons(N,IL)) >= a__U31(a__and(a__isNatIList(IL), and(isNat(M),isNat(N))),IL,M,N) ; a__take(X1,X2) >= take(X1,X2) ; Marked_a__isNatIList(cons(V1,V2)) >= Marked_a__isNat(V1) ; Marked_a__isNatIList(cons(V1,V2)) >= Marked_a__and(a__isNat(V1), isNatIList(V2)) ; Marked_a__isNatIList(V) >= Marked_a__isNatList(V) ; Marked_a__isNatList(cons(V1,V2)) >= Marked_a__isNat(V1) ; Marked_a__isNatList(cons(V1,V2)) >= Marked_a__and(a__isNat(V1),isNatList(V2)) ; Marked_a__isNatList(take(V1,V2)) >= Marked_a__isNat(V1) ; Marked_a__isNatList(take(V1,V2)) >= Marked_a__and(a__isNat(V1), isNatIList(V2)) ; Marked_a__isNat(s(V1)) >= Marked_a__isNat(V1) ; Marked_a__isNat(length(V1)) >= Marked_a__isNatList(V1) ; Marked_a__and(tt,X) >= Marked_mark(X) ; Marked_a__length(cons(N,L)) >= Marked_a__isNatList(L) ; Marked_a__length(cons(N,L)) >= Marked_a__and(a__isNatList(L),isNat(N)) ; Marked_a__length(cons(N,L)) >= Marked_a__U11(a__and(a__isNatList(L),isNat(N)), L) ; Marked_a__U11(tt,L) >= Marked_a__length(mark(L)) ; Marked_a__U11(tt,L) >= Marked_mark(L) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_a__length(mark(X)) ; Marked_mark(length(X)) >= Marked_mark(X) ; Marked_mark(isNatIList(X)) >= Marked_a__isNatIList(X) ; Marked_mark(isNatList(X)) >= Marked_a__isNatList(X) ; Marked_mark(isNat(X)) >= Marked_a__isNat(X) ; Marked_mark(and(X1,X2)) >= Marked_a__and(mark(X1),X2) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U11(X1,X2)) >= Marked_a__U11(mark(X1),X2) ; Marked_mark(U11(X1,X2)) >= Marked_mark(X1) ; } + Disjunctions:{ { Marked_a__isNatIList(cons(V1,V2)) > Marked_a__isNat(V1) ; } { Marked_a__isNatIList(cons(V1,V2)) > Marked_a__and(a__isNat(V1), isNatIList(V2)) ; } { Marked_a__isNatIList(V) > Marked_a__isNatList(V) ; } { Marked_a__isNatList(cons(V1,V2)) > Marked_a__isNat(V1) ; } { Marked_a__isNatList(cons(V1,V2)) > Marked_a__and(a__isNat(V1),isNatList(V2)) ; } { Marked_a__isNatList(take(V1,V2)) > Marked_a__isNat(V1) ; } { Marked_a__isNatList(take(V1,V2)) > Marked_a__and(a__isNat(V1),isNatIList(V2)) ; } { Marked_a__isNat(s(V1)) > Marked_a__isNat(V1) ; } { Marked_a__isNat(length(V1)) > Marked_a__isNatList(V1) ; } { Marked_a__and(tt,X) > Marked_mark(X) ; } { Marked_a__length(cons(N,L)) > Marked_a__isNatList(L) ; } { Marked_a__length(cons(N,L)) > Marked_a__and(a__isNatList(L),isNat(N)) ; } { Marked_a__length(cons(N,L)) > Marked_a__U11(a__and(a__isNatList(L),isNat(N)), L) ; } { Marked_a__U11(tt,L) > Marked_a__length(mark(L)) ; } { Marked_a__U11(tt,L) > Marked_mark(L) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_a__length(mark(X)) ; } { Marked_mark(length(X)) > Marked_mark(X) ; } { Marked_mark(isNatIList(X)) > Marked_a__isNatIList(X) ; } { Marked_mark(isNatList(X)) > Marked_a__isNatList(X) ; } { Marked_mark(isNat(X)) > Marked_a__isNat(X) ; } { Marked_mark(and(X1,X2)) > Marked_a__and(mark(X1),X2) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U11(X1,X2)) > Marked_a__U11(mark(X1),X2) ; } { Marked_mark(U11(X1,X2)) > Marked_mark(X1) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: a__zeros >= cons(0,zeros) constraint: a__zeros >= zeros constraint: a__length(cons(N,L)) >= a__U11(a__and(a__isNatList(L),isNat(N)),L) constraint: a__length(nil) >= 0 constraint: a__length(X) >= length(X) constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2) constraint: mark(0) >= 0 constraint: mark(zeros) >= a__zeros constraint: mark(s(X)) >= s(mark(X)) constraint: mark(tt) >= tt constraint: mark(nil) >= nil constraint: mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) constraint: mark(length(X)) >= a__length(mark(X)) constraint: mark(isNatIList(X)) >= a__isNatIList(X) constraint: mark(isNatList(X)) >= a__isNatList(X) constraint: mark(isNat(X)) >= a__isNat(X) constraint: mark(and(X1,X2)) >= a__and(mark(X1),X2) constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2) constraint: mark(U21(X)) >= a__U21(mark(X)) constraint: mark(U31(X1,X2,X3,X4)) >= a__U31(mark(X1),X2,X3,X4) constraint: a__U11(tt,L) >= s(a__length(mark(L))) constraint: a__U11(X1,X2) >= U11(X1,X2) constraint: a__U21(tt) >= nil constraint: a__U21(X) >= U21(X) constraint: a__U31(tt,IL,M,N) >= cons(mark(N),take(M,IL)) constraint: a__U31(X1,X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: a__and(tt,X) >= mark(X) constraint: a__and(X1,X2) >= and(X1,X2) constraint: a__isNat(0) >= tt constraint: a__isNat(s(V1)) >= a__isNat(V1) constraint: a__isNat(length(V1)) >= a__isNatList(V1) constraint: a__isNat(X) >= isNat(X) constraint: a__isNatList(cons(V1,V2)) >= a__and(a__isNat(V1),isNatList(V2)) constraint: a__isNatList(nil) >= tt constraint: a__isNatList(take(V1,V2)) >= a__and(a__isNat(V1),isNatIList(V2)) constraint: a__isNatList(X) >= isNatList(X) constraint: a__isNatIList(cons(V1,V2)) >= a__and(a__isNat(V1),isNatIList(V2)) constraint: a__isNatIList(zeros) >= tt constraint: a__isNatIList(X) >= isNatIList(X) constraint: a__isNatIList(V) >= a__isNatList(V) constraint: a__take(0,IL) >= a__U21(a__isNatIList(IL)) constraint: a__take(s(M),cons(N,IL)) >= a__U31(a__and(a__isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N) constraint: a__take(X1,X2) >= take(X1,X2) constraint: Marked_a__isNatIList(cons(V1,V2)) >= Marked_a__isNat(V1) constraint: Marked_a__isNatIList(cons(V1,V2)) >= Marked_a__and(a__isNat(V1), isNatIList(V2)) constraint: Marked_a__isNatIList(V) >= Marked_a__isNatList(V) constraint: Marked_a__isNatList(cons(V1,V2)) >= Marked_a__isNat(V1) constraint: Marked_a__isNatList(cons(V1,V2)) >= Marked_a__and(a__isNat(V1), isNatList(V2)) constraint: Marked_a__isNatList(take(V1,V2)) >= Marked_a__isNat(V1) constraint: Marked_a__isNatList(take(V1,V2)) >= Marked_a__and(a__isNat(V1), isNatIList(V2)) constraint: Marked_a__isNat(s(V1)) >= Marked_a__isNat(V1) constraint: Marked_a__isNat(length(V1)) >= Marked_a__isNatList(V1) constraint: Marked_a__and(tt,X) >= Marked_mark(X) constraint: Marked_a__length(cons(N,L)) >= Marked_a__isNatList(L) constraint: Marked_a__length(cons(N,L)) >= Marked_a__and(a__isNatList(L), isNat(N)) constraint: Marked_a__length(cons(N,L)) >= Marked_a__U11(a__and(a__isNatList(L), isNat(N)),L) constraint: Marked_a__U11(tt,L) >= Marked_a__length(mark(L)) constraint: Marked_a__U11(tt,L) >= Marked_mark(L) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_a__length(mark(X)) constraint: Marked_mark(length(X)) >= Marked_mark(X) constraint: Marked_mark(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(and(X1,X2)) >= Marked_a__and(mark(X1),X2) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U11(X1,X2)) >= Marked_a__U11(mark(X1),X2) constraint: Marked_mark(U11(X1,X2)) >= Marked_mark(X1) APPLY CRITERIA (Graph splitting) Found 2 components: { --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { a__zeros >= cons(0,zeros) ; a__zeros >= zeros ; a__length(cons(N,L)) >= a__U11(a__and(a__isNatList(L),isNat(N)),L) ; a__length(nil) >= 0 ; a__length(X) >= length(X) ; mark(cons(X1,X2)) >= cons(mark(X1),X2) ; mark(0) >= 0 ; mark(zeros) >= a__zeros ; mark(s(X)) >= s(mark(X)) ; mark(tt) >= tt ; mark(nil) >= nil ; mark(take(X1,X2)) >= a__take(mark(X1),mark(X2)) ; mark(length(X)) >= a__length(mark(X)) ; mark(isNatIList(X)) >= a__isNatIList(X) ; mark(isNatList(X)) >= a__isNatList(X) ; mark(isNat(X)) >= a__isNat(X) ; mark(and(X1,X2)) >= a__and(mark(X1),X2) ; mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ; mark(U21(X)) >= a__U21(mark(X)) ; mark(U31(X1,X2,X3,X4)) >= a__U31(mark(X1),X2,X3,X4) ; a__U11(tt,L) >= s(a__length(mark(L))) ; a__U11(X1,X2) >= U11(X1,X2) ; a__U21(tt) >= nil ; a__U21(X) >= U21(X) ; a__U31(tt,IL,M,N) >= cons(mark(N),take(M,IL)) ; a__U31(X1,X2,X3,X4) >= U31(X1,X2,X3,X4) ; a__and(tt,X) >= mark(X) ; a__and(X1,X2) >= and(X1,X2) ; a__isNat(0) >= tt ; a__isNat(s(V1)) >= a__isNat(V1) ; a__isNat(length(V1)) >= a__isNatList(V1) ; a__isNat(X) >= isNat(X) ; a__isNatList(cons(V1,V2)) >= a__and(a__isNat(V1),isNatList(V2)) ; a__isNatList(nil) >= tt ; a__isNatList(take(V1,V2)) >= a__and(a__isNat(V1),isNatIList(V2)) ; a__isNatList(X) >= isNatList(X) ; a__isNatIList(cons(V1,V2)) >= a__and(a__isNat(V1),isNatIList(V2)) ; a__isNatIList(zeros) >= tt ; a__isNatIList(X) >= isNatIList(X) ; a__isNatIList(V) >= a__isNatList(V) ; a__take(0,IL) >= a__U21(a__isNatIList(IL)) ; a__take(s(M),cons(N,IL)) >= a__U31(a__and(a__isNatIList(IL), and(isNat(M),isNat(N))),IL,M,N) ; a__take(X1,X2) >= take(X1,X2) ; Marked_a__length(cons(N,L)) >= Marked_a__U11(a__and(a__isNatList(L),isNat(N)), L) ; Marked_a__U11(tt,L) >= Marked_a__length(mark(L)) ; } + Disjunctions:{ { Marked_a__length(cons(N,L)) > Marked_a__U11(a__and(a__isNatList(L),isNat(N)), L) ; } { Marked_a__U11(tt,L) > Marked_a__length(mark(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 timeout reached === STOPING TIMER virtual === No solution found for these parameters. No solution found for these constraints. APPLY CRITERIA (ID_CRIT) NOT SOLVED No proof found Cime worked for 81.176965 seconds (real time) Cime Exit Status: 0