- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] active(zeros) -> mark(cons(0,zeros)) [2] active(U11(tt,L)) -> mark(s(length(L))) [3] active(U21(tt)) -> mark(nil) [4] active(U31(tt,IL,M,N)) -> mark(cons(N,take(M,IL))) [5] active(and(tt,X)) -> mark(X) [6] active(isNat(0)) -> mark(tt) [7] active(isNat(length(V1))) -> mark(isNatList(V1)) [8] active(isNat(s(V1))) -> mark(isNat(V1)) [9] active(isNatIList(V)) -> mark(isNatList(V)) [10] active(isNatIList(zeros)) -> mark(tt) [11] active(isNatIList(cons(V1,V2))) -> mark(and(isNat(V1),isNatIList(V2))) [12] active(isNatList(nil)) -> mark(tt) [13] active(isNatList(cons(V1,V2))) -> mark(and(isNat(V1),isNatList(V2))) [14] active(isNatList(take(V1,V2))) -> mark(and(isNat(V1),isNatIList(V2))) [15] active(length(nil)) -> mark(0) [16] active(length(cons(N,L))) -> mark(U11(and(isNatList(L),isNat(N)),L)) [17] active(take(0,IL)) -> mark(U21(isNatIList(IL))) [18] active(take(s(M),cons(N,IL))) -> mark(U31(and(isNatIList(IL),and(isNat(M),isNat(N))),IL,M,N)) [19] mark(zeros) -> active(zeros) [20] mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) [21] mark(0) -> active(0) [22] mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) [23] mark(tt) -> active(tt) [24] mark(s(X)) -> active(s(mark(X))) [25] mark(length(X)) -> active(length(mark(X))) [26] mark(U21(X)) -> active(U21(mark(X))) [27] mark(nil) -> active(nil) [28] mark(U31(X1,X2,X3,X4)) -> active(U31(mark(X1),X2,X3,X4)) [29] mark(take(X1,X2)) -> active(take(mark(X1),mark(X2))) [30] mark(and(X1,X2)) -> active(and(mark(X1),X2)) [31] mark(isNat(X)) -> active(isNat(X)) [32] mark(isNatList(X)) -> active(isNatList(X)) [33] mark(isNatIList(X)) -> active(isNatIList(X)) [34] cons(mark(X1),X2) -> cons(X1,X2) [35] cons(X1,mark(X2)) -> cons(X1,X2) [36] cons(active(X1),X2) -> cons(X1,X2) [37] cons(X1,active(X2)) -> cons(X1,X2) [38] U11(mark(X1),X2) -> U11(X1,X2) [39] U11(X1,mark(X2)) -> U11(X1,X2) [40] U11(active(X1),X2) -> U11(X1,X2) [41] U11(X1,active(X2)) -> U11(X1,X2) [42] s(mark(X)) -> s(X) [43] s(active(X)) -> s(X) [44] length(mark(X)) -> length(X) [45] length(active(X)) -> length(X) [46] U21(mark(X)) -> U21(X) [47] U21(active(X)) -> U21(X) [48] U31(mark(X1),X2,X3,X4) -> U31(X1,X2,X3,X4) [49] U31(X1,mark(X2),X3,X4) -> U31(X1,X2,X3,X4) [50] U31(X1,X2,mark(X3),X4) -> U31(X1,X2,X3,X4) [51] U31(X1,X2,X3,mark(X4)) -> U31(X1,X2,X3,X4) [52] U31(active(X1),X2,X3,X4) -> U31(X1,X2,X3,X4) [53] U31(X1,active(X2),X3,X4) -> U31(X1,X2,X3,X4) [54] U31(X1,X2,active(X3),X4) -> U31(X1,X2,X3,X4) [55] U31(X1,X2,X3,active(X4)) -> U31(X1,X2,X3,X4) [56] take(mark(X1),X2) -> take(X1,X2) [57] take(X1,mark(X2)) -> take(X1,X2) [58] take(active(X1),X2) -> take(X1,X2) [59] take(X1,active(X2)) -> take(X1,X2) [60] and(mark(X1),X2) -> and(X1,X2) [61] and(X1,mark(X2)) -> and(X1,X2) [62] and(active(X1),X2) -> and(X1,X2) [63] and(X1,active(X2)) -> and(X1,X2) [64] isNat(mark(X)) -> isNat(X) [65] isNat(active(X)) -> isNat(X) [66] isNatList(mark(X)) -> isNatList(X) [67] isNatList(active(X)) -> isNatList(X) [68] isNatIList(mark(X)) -> isNatIList(X) [69] isNatIList(active(X)) -> isNatIList(X) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 12 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(cons(X1,X2)) >= Marked_active(cons(mark(X1),X2)) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(s(X)) >= Marked_active(s(mark(X))) ; Marked_mark(length(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(U11(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) ; Marked_mark(U21(X)) >= Marked_mark(X) ; Marked_mark(U21(X)) >= Marked_active(U21(mark(X))) ; Marked_mark(take(X1,X2)) >= Marked_mark(X1) ; Marked_mark(take(X1,X2)) >= Marked_mark(X2) ; Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) ; Marked_mark(U31(X1,X2,X3,X4)) >= Marked_mark(X1) ; Marked_mark(U31(X1,X2,X3,X4)) >= Marked_active(U31(mark(X1),X2,X3,X4)) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) ; Marked_mark(isNat(X)) >= Marked_active(isNat(X)) ; Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) ; Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList(L), isNat(N)),L)) ; Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) ; Marked_active(take(0,IL)) >= Marked_mark(U21(isNatIList(IL))) ; Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(U31(and(isNatIList(IL), and(isNat(M), isNat(N))), IL,M,N)) ; Marked_active(U31(tt,IL,M,N)) >= Marked_mark(cons(N,take(M,IL))) ; Marked_active(and(tt,X)) >= Marked_mark(X) ; Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) ; Marked_active(isNat(length(V1))) >= Marked_mark(isNatList(V1)) ; Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatList(V2))) ; Marked_active(isNatList(take(V1,V2))) >= Marked_mark(and(isNat(V1), isNatIList(V2))) ; Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatIList(V2))) ; Marked_active(isNatIList(V)) >= Marked_mark(isNatList(V)) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(cons(X1,X2)) > Marked_active(cons(mark(X1),X2)) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(s(X)) > Marked_active(s(mark(X))) ; } { Marked_mark(length(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(U11(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U11(X1,X2)) > Marked_active(U11(mark(X1),X2)) ; } { Marked_mark(U21(X)) > Marked_mark(X) ; } { Marked_mark(U21(X)) > Marked_active(U21(mark(X))) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(take(X1,X2)) > Marked_active(take(mark(X1),mark(X2))) ; } { Marked_mark(U31(X1,X2,X3,X4)) > Marked_mark(X1) ; } { Marked_mark(U31(X1,X2,X3,X4)) > Marked_active(U31(mark(X1),X2,X3,X4)) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_active(and(mark(X1),X2)) ; } { Marked_mark(isNat(X)) > Marked_active(isNat(X)) ; } { Marked_mark(isNatList(X)) > Marked_active(isNatList(X)) ; } { Marked_mark(isNatIList(X)) > Marked_active(isNatIList(X)) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(length(cons(N,L))) > Marked_mark(U11(and(isNatList(L),isNat(N)), L)) ; } { Marked_active(U11(tt,L)) > Marked_mark(s(length(L))) ; } { Marked_active(take(0,IL)) > Marked_mark(U21(isNatIList(IL))) ; } { Marked_active(take(s(M),cons(N,IL))) > Marked_mark(U31(and(isNatIList(IL), and(isNat(M), isNat(N))), IL,M,N)) ; } { Marked_active(U31(tt,IL,M,N)) > Marked_mark(cons(N,take(M,IL))) ; } { Marked_active(and(tt,X)) > Marked_mark(X) ; } { Marked_active(isNat(s(V1))) > Marked_mark(isNat(V1)) ; } { Marked_active(isNat(length(V1))) > Marked_mark(isNatList(V1)) ; } { Marked_active(isNatList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatList(V2))) ; } { Marked_active(isNatList(take(V1,V2))) > Marked_mark(and(isNat(V1), isNatIList(V2))) ; } { Marked_active(isNatIList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatIList(V2))) ; } { Marked_active(isNatIList(V)) > Marked_mark(isNatList(V)) ; } } === 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(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(nil) >= active(nil) constraint: mark(U21(X)) >= active(U21(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(isNat(X)) >= active(isNat(X)) constraint: mark(isNatList(X)) >= active(isNatList(X)) constraint: mark(isNatIList(X)) >= active(isNatIList(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) constraint: active(length(nil)) >= mark(0) constraint: active(U11(tt,L)) >= mark(s(length(L))) constraint: active(U21(tt)) >= mark(nil) constraint: active(take(0,IL)) >= mark(U21(isNatIList(IL))) constraint: active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) constraint: active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) constraint: active(and(tt,X)) >= mark(X) constraint: active(isNat(0)) >= mark(tt) constraint: active(isNat(s(V1))) >= mark(isNat(V1)) constraint: active(isNat(length(V1))) >= mark(isNatList(V1)) constraint: active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) constraint: active(isNatList(nil)) >= mark(tt) constraint: active(isNatList(take(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(zeros)) >= mark(tt) constraint: active(isNatIList(V)) >= mark(isNatList(V)) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: U11(mark(X1),X2) >= U11(X1,X2) constraint: U11(active(X1),X2) >= U11(X1,X2) constraint: U11(X1,mark(X2)) >= U11(X1,X2) constraint: U11(X1,active(X2)) >= U11(X1,X2) constraint: U21(mark(X)) >= U21(X) constraint: U21(active(X)) >= U21(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: isNat(mark(X)) >= isNat(X) constraint: isNat(active(X)) >= isNat(X) constraint: isNatList(mark(X)) >= isNatList(X) constraint: isNatList(active(X)) >= isNatList(X) constraint: isNatIList(mark(X)) >= isNatIList(X) constraint: isNatIList(active(X)) >= isNatIList(X) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(cons(X1,X2)) >= Marked_active(cons(mark(X1),X2)) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(s(X)) >= Marked_active(s(mark(X))) constraint: Marked_mark(length(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_mark(U11(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) constraint: Marked_mark(U21(X)) >= Marked_mark(X) constraint: Marked_mark(U21(X)) >= Marked_active(U21(mark(X))) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) constraint: Marked_mark(U31(X1,X2,X3,X4)) >= Marked_mark(X1) constraint: Marked_mark(U31(X1,X2,X3,X4)) >= Marked_active(U31(mark(X1), X2,X3,X4)) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) constraint: Marked_mark(isNat(X)) >= Marked_active(isNat(X)) constraint: Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) constraint: Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList( L), isNat(N)), L)) constraint: Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) constraint: Marked_active(take(0,IL)) >= Marked_mark(U21(isNatIList(IL))) constraint: Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(U31(and( isNatIList( IL), and( isNat( M), isNat(N))), IL,M, N)) constraint: Marked_active(U31(tt,IL,M,N)) >= Marked_mark(cons(N,take(M,IL))) constraint: Marked_active(and(tt,X)) >= Marked_mark(X) constraint: Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) constraint: Marked_active(isNat(length(V1))) >= Marked_mark(isNatList(V1)) constraint: Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and( isNat(V1), isNatList(V2))) constraint: Marked_active(isNatList(take(V1,V2))) >= Marked_mark(and( isNat(V1), isNatIList( V2))) constraint: Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and( isNat(V1), isNatIList( V2))) constraint: Marked_active(isNatIList(V)) >= Marked_mark(isNatList(V)) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_cons(mark(X1),X2) >= Marked_cons(X1,X2) ; Marked_cons(active(X1),X2) >= Marked_cons(X1,X2) ; Marked_cons(X1,mark(X2)) >= Marked_cons(X1,X2) ; Marked_cons(X1,active(X2)) >= Marked_cons(X1,X2) ; } + Disjunctions:{ { Marked_cons(mark(X1),X2) > Marked_cons(X1,X2) ; } { Marked_cons(active(X1),X2) > Marked_cons(X1,X2) ; } { Marked_cons(X1,mark(X2)) > Marked_cons(X1,X2) ; } { Marked_cons(X1,active(X2)) > Marked_cons(X1,X2) ; } } === 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(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(nil) >= active(nil) constraint: mark(U21(X)) >= active(U21(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(isNat(X)) >= active(isNat(X)) constraint: mark(isNatList(X)) >= active(isNatList(X)) constraint: mark(isNatIList(X)) >= active(isNatIList(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) constraint: active(length(nil)) >= mark(0) constraint: active(U11(tt,L)) >= mark(s(length(L))) constraint: active(U21(tt)) >= mark(nil) constraint: active(take(0,IL)) >= mark(U21(isNatIList(IL))) constraint: active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) constraint: active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) constraint: active(and(tt,X)) >= mark(X) constraint: active(isNat(0)) >= mark(tt) constraint: active(isNat(s(V1))) >= mark(isNat(V1)) constraint: active(isNat(length(V1))) >= mark(isNatList(V1)) constraint: active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) constraint: active(isNatList(nil)) >= mark(tt) constraint: active(isNatList(take(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(zeros)) >= mark(tt) constraint: active(isNatIList(V)) >= mark(isNatList(V)) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: U11(mark(X1),X2) >= U11(X1,X2) constraint: U11(active(X1),X2) >= U11(X1,X2) constraint: U11(X1,mark(X2)) >= U11(X1,X2) constraint: U11(X1,active(X2)) >= U11(X1,X2) constraint: U21(mark(X)) >= U21(X) constraint: U21(active(X)) >= U21(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: isNat(mark(X)) >= isNat(X) constraint: isNat(active(X)) >= isNat(X) constraint: isNatList(mark(X)) >= isNatList(X) constraint: isNatList(active(X)) >= isNatList(X) constraint: isNatIList(mark(X)) >= isNatIList(X) constraint: isNatIList(active(X)) >= isNatIList(X) constraint: Marked_cons(mark(X1),X2) >= Marked_cons(X1,X2) constraint: Marked_cons(active(X1),X2) >= Marked_cons(X1,X2) constraint: Marked_cons(X1,mark(X2)) >= Marked_cons(X1,X2) constraint: Marked_cons(X1,active(X2)) >= Marked_cons(X1,X2) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_U11(mark(X1),X2) >= Marked_U11(X1,X2) ; Marked_U11(active(X1),X2) >= Marked_U11(X1,X2) ; Marked_U11(X1,mark(X2)) >= Marked_U11(X1,X2) ; Marked_U11(X1,active(X2)) >= Marked_U11(X1,X2) ; } + Disjunctions:{ { Marked_U11(mark(X1),X2) > Marked_U11(X1,X2) ; } { Marked_U11(active(X1),X2) > Marked_U11(X1,X2) ; } { Marked_U11(X1,mark(X2)) > Marked_U11(X1,X2) ; } { Marked_U11(X1,active(X2)) > Marked_U11(X1,X2) ; } } === 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(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(nil) >= active(nil) constraint: mark(U21(X)) >= active(U21(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(isNat(X)) >= active(isNat(X)) constraint: mark(isNatList(X)) >= active(isNatList(X)) constraint: mark(isNatIList(X)) >= active(isNatIList(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) constraint: active(length(nil)) >= mark(0) constraint: active(U11(tt,L)) >= mark(s(length(L))) constraint: active(U21(tt)) >= mark(nil) constraint: active(take(0,IL)) >= mark(U21(isNatIList(IL))) constraint: active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) constraint: active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) constraint: active(and(tt,X)) >= mark(X) constraint: active(isNat(0)) >= mark(tt) constraint: active(isNat(s(V1))) >= mark(isNat(V1)) constraint: active(isNat(length(V1))) >= mark(isNatList(V1)) constraint: active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) constraint: active(isNatList(nil)) >= mark(tt) constraint: active(isNatList(take(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(zeros)) >= mark(tt) constraint: active(isNatIList(V)) >= mark(isNatList(V)) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: U11(mark(X1),X2) >= U11(X1,X2) constraint: U11(active(X1),X2) >= U11(X1,X2) constraint: U11(X1,mark(X2)) >= U11(X1,X2) constraint: U11(X1,active(X2)) >= U11(X1,X2) constraint: U21(mark(X)) >= U21(X) constraint: U21(active(X)) >= U21(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: isNat(mark(X)) >= isNat(X) constraint: isNat(active(X)) >= isNat(X) constraint: isNatList(mark(X)) >= isNatList(X) constraint: isNatList(active(X)) >= isNatList(X) constraint: isNatIList(mark(X)) >= isNatIList(X) constraint: isNatIList(active(X)) >= isNatIList(X) constraint: Marked_U11(mark(X1),X2) >= Marked_U11(X1,X2) constraint: Marked_U11(active(X1),X2) >= Marked_U11(X1,X2) constraint: Marked_U11(X1,mark(X2)) >= Marked_U11(X1,X2) constraint: Marked_U11(X1,active(X2)) >= Marked_U11(X1,X2) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_s(mark(X)) >= Marked_s(X) ; Marked_s(active(X)) >= Marked_s(X) ; } + Disjunctions:{ { Marked_s(mark(X)) > Marked_s(X) ; } { Marked_s(active(X)) > Marked_s(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(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(nil) >= active(nil) constraint: mark(U21(X)) >= active(U21(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(isNat(X)) >= active(isNat(X)) constraint: mark(isNatList(X)) >= active(isNatList(X)) constraint: mark(isNatIList(X)) >= active(isNatIList(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) constraint: active(length(nil)) >= mark(0) constraint: active(U11(tt,L)) >= mark(s(length(L))) constraint: active(U21(tt)) >= mark(nil) constraint: active(take(0,IL)) >= mark(U21(isNatIList(IL))) constraint: active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) constraint: active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) constraint: active(and(tt,X)) >= mark(X) constraint: active(isNat(0)) >= mark(tt) constraint: active(isNat(s(V1))) >= mark(isNat(V1)) constraint: active(isNat(length(V1))) >= mark(isNatList(V1)) constraint: active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) constraint: active(isNatList(nil)) >= mark(tt) constraint: active(isNatList(take(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(zeros)) >= mark(tt) constraint: active(isNatIList(V)) >= mark(isNatList(V)) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: U11(mark(X1),X2) >= U11(X1,X2) constraint: U11(active(X1),X2) >= U11(X1,X2) constraint: U11(X1,mark(X2)) >= U11(X1,X2) constraint: U11(X1,active(X2)) >= U11(X1,X2) constraint: U21(mark(X)) >= U21(X) constraint: U21(active(X)) >= U21(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: isNat(mark(X)) >= isNat(X) constraint: isNat(active(X)) >= isNat(X) constraint: isNatList(mark(X)) >= isNatList(X) constraint: isNatList(active(X)) >= isNatList(X) constraint: isNatIList(mark(X)) >= isNatIList(X) constraint: isNatIList(active(X)) >= isNatIList(X) constraint: Marked_s(mark(X)) >= Marked_s(X) constraint: Marked_s(active(X)) >= Marked_s(X) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_length(mark(X)) >= Marked_length(X) ; Marked_length(active(X)) >= Marked_length(X) ; } + Disjunctions:{ { Marked_length(mark(X)) > Marked_length(X) ; } { Marked_length(active(X)) > Marked_length(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(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(nil) >= active(nil) constraint: mark(U21(X)) >= active(U21(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(isNat(X)) >= active(isNat(X)) constraint: mark(isNatList(X)) >= active(isNatList(X)) constraint: mark(isNatIList(X)) >= active(isNatIList(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) constraint: active(length(nil)) >= mark(0) constraint: active(U11(tt,L)) >= mark(s(length(L))) constraint: active(U21(tt)) >= mark(nil) constraint: active(take(0,IL)) >= mark(U21(isNatIList(IL))) constraint: active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) constraint: active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) constraint: active(and(tt,X)) >= mark(X) constraint: active(isNat(0)) >= mark(tt) constraint: active(isNat(s(V1))) >= mark(isNat(V1)) constraint: active(isNat(length(V1))) >= mark(isNatList(V1)) constraint: active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) constraint: active(isNatList(nil)) >= mark(tt) constraint: active(isNatList(take(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(zeros)) >= mark(tt) constraint: active(isNatIList(V)) >= mark(isNatList(V)) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: U11(mark(X1),X2) >= U11(X1,X2) constraint: U11(active(X1),X2) >= U11(X1,X2) constraint: U11(X1,mark(X2)) >= U11(X1,X2) constraint: U11(X1,active(X2)) >= U11(X1,X2) constraint: U21(mark(X)) >= U21(X) constraint: U21(active(X)) >= U21(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: isNat(mark(X)) >= isNat(X) constraint: isNat(active(X)) >= isNat(X) constraint: isNatList(mark(X)) >= isNatList(X) constraint: isNatList(active(X)) >= isNatList(X) constraint: isNatIList(mark(X)) >= isNatIList(X) constraint: isNatIList(active(X)) >= isNatIList(X) constraint: Marked_length(mark(X)) >= Marked_length(X) constraint: Marked_length(active(X)) >= Marked_length(X) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_U21(mark(X)) >= Marked_U21(X) ; Marked_U21(active(X)) >= Marked_U21(X) ; } + Disjunctions:{ { Marked_U21(mark(X)) > Marked_U21(X) ; } { Marked_U21(active(X)) > Marked_U21(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(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(nil) >= active(nil) constraint: mark(U21(X)) >= active(U21(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(isNat(X)) >= active(isNat(X)) constraint: mark(isNatList(X)) >= active(isNatList(X)) constraint: mark(isNatIList(X)) >= active(isNatIList(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) constraint: active(length(nil)) >= mark(0) constraint: active(U11(tt,L)) >= mark(s(length(L))) constraint: active(U21(tt)) >= mark(nil) constraint: active(take(0,IL)) >= mark(U21(isNatIList(IL))) constraint: active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) constraint: active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) constraint: active(and(tt,X)) >= mark(X) constraint: active(isNat(0)) >= mark(tt) constraint: active(isNat(s(V1))) >= mark(isNat(V1)) constraint: active(isNat(length(V1))) >= mark(isNatList(V1)) constraint: active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) constraint: active(isNatList(nil)) >= mark(tt) constraint: active(isNatList(take(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(zeros)) >= mark(tt) constraint: active(isNatIList(V)) >= mark(isNatList(V)) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: U11(mark(X1),X2) >= U11(X1,X2) constraint: U11(active(X1),X2) >= U11(X1,X2) constraint: U11(X1,mark(X2)) >= U11(X1,X2) constraint: U11(X1,active(X2)) >= U11(X1,X2) constraint: U21(mark(X)) >= U21(X) constraint: U21(active(X)) >= U21(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: isNat(mark(X)) >= isNat(X) constraint: isNat(active(X)) >= isNat(X) constraint: isNatList(mark(X)) >= isNatList(X) constraint: isNatList(active(X)) >= isNatList(X) constraint: isNatIList(mark(X)) >= isNatIList(X) constraint: isNatIList(active(X)) >= isNatIList(X) constraint: Marked_U21(mark(X)) >= Marked_U21(X) constraint: Marked_U21(active(X)) >= Marked_U21(X) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_U31(mark(X1),X2,X3,X4) >= Marked_U31(X1,X2,X3,X4) ; Marked_U31(active(X1),X2,X3,X4) >= Marked_U31(X1,X2,X3,X4) ; Marked_U31(X1,mark(X2),X3,X4) >= Marked_U31(X1,X2,X3,X4) ; Marked_U31(X1,active(X2),X3,X4) >= Marked_U31(X1,X2,X3,X4) ; Marked_U31(X1,X2,mark(X3),X4) >= Marked_U31(X1,X2,X3,X4) ; Marked_U31(X1,X2,active(X3),X4) >= Marked_U31(X1,X2,X3,X4) ; Marked_U31(X1,X2,X3,mark(X4)) >= Marked_U31(X1,X2,X3,X4) ; Marked_U31(X1,X2,X3,active(X4)) >= Marked_U31(X1,X2,X3,X4) ; } + Disjunctions:{ { Marked_U31(mark(X1),X2,X3,X4) > Marked_U31(X1,X2,X3,X4) ; } { Marked_U31(active(X1),X2,X3,X4) > Marked_U31(X1,X2,X3,X4) ; } { Marked_U31(X1,mark(X2),X3,X4) > Marked_U31(X1,X2,X3,X4) ; } { Marked_U31(X1,active(X2),X3,X4) > Marked_U31(X1,X2,X3,X4) ; } { Marked_U31(X1,X2,mark(X3),X4) > Marked_U31(X1,X2,X3,X4) ; } { Marked_U31(X1,X2,active(X3),X4) > Marked_U31(X1,X2,X3,X4) ; } { Marked_U31(X1,X2,X3,mark(X4)) > Marked_U31(X1,X2,X3,X4) ; } { Marked_U31(X1,X2,X3,active(X4)) > Marked_U31(X1,X2,X3,X4) ; } } === 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(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(nil) >= active(nil) constraint: mark(U21(X)) >= active(U21(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(isNat(X)) >= active(isNat(X)) constraint: mark(isNatList(X)) >= active(isNatList(X)) constraint: mark(isNatIList(X)) >= active(isNatIList(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) constraint: active(length(nil)) >= mark(0) constraint: active(U11(tt,L)) >= mark(s(length(L))) constraint: active(U21(tt)) >= mark(nil) constraint: active(take(0,IL)) >= mark(U21(isNatIList(IL))) constraint: active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) constraint: active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) constraint: active(and(tt,X)) >= mark(X) constraint: active(isNat(0)) >= mark(tt) constraint: active(isNat(s(V1))) >= mark(isNat(V1)) constraint: active(isNat(length(V1))) >= mark(isNatList(V1)) constraint: active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) constraint: active(isNatList(nil)) >= mark(tt) constraint: active(isNatList(take(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(zeros)) >= mark(tt) constraint: active(isNatIList(V)) >= mark(isNatList(V)) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: U11(mark(X1),X2) >= U11(X1,X2) constraint: U11(active(X1),X2) >= U11(X1,X2) constraint: U11(X1,mark(X2)) >= U11(X1,X2) constraint: U11(X1,active(X2)) >= U11(X1,X2) constraint: U21(mark(X)) >= U21(X) constraint: U21(active(X)) >= U21(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: isNat(mark(X)) >= isNat(X) constraint: isNat(active(X)) >= isNat(X) constraint: isNatList(mark(X)) >= isNatList(X) constraint: isNatList(active(X)) >= isNatList(X) constraint: isNatIList(mark(X)) >= isNatIList(X) constraint: isNatIList(active(X)) >= isNatIList(X) constraint: Marked_U31(mark(X1),X2,X3,X4) >= Marked_U31(X1,X2,X3,X4) constraint: Marked_U31(active(X1),X2,X3,X4) >= Marked_U31(X1,X2,X3,X4) constraint: Marked_U31(X1,mark(X2),X3,X4) >= Marked_U31(X1,X2,X3,X4) constraint: Marked_U31(X1,active(X2),X3,X4) >= Marked_U31(X1,X2,X3,X4) constraint: Marked_U31(X1,X2,mark(X3),X4) >= Marked_U31(X1,X2,X3,X4) constraint: Marked_U31(X1,X2,active(X3),X4) >= Marked_U31(X1,X2,X3,X4) constraint: Marked_U31(X1,X2,X3,mark(X4)) >= Marked_U31(X1,X2,X3,X4) constraint: Marked_U31(X1,X2,X3,active(X4)) >= Marked_U31(X1,X2,X3,X4) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_take(mark(X1),X2) >= Marked_take(X1,X2) ; Marked_take(active(X1),X2) >= Marked_take(X1,X2) ; Marked_take(X1,mark(X2)) >= Marked_take(X1,X2) ; Marked_take(X1,active(X2)) >= Marked_take(X1,X2) ; } + Disjunctions:{ { Marked_take(mark(X1),X2) > Marked_take(X1,X2) ; } { Marked_take(active(X1),X2) > Marked_take(X1,X2) ; } { Marked_take(X1,mark(X2)) > Marked_take(X1,X2) ; } { Marked_take(X1,active(X2)) > Marked_take(X1,X2) ; } } === 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(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(nil) >= active(nil) constraint: mark(U21(X)) >= active(U21(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(isNat(X)) >= active(isNat(X)) constraint: mark(isNatList(X)) >= active(isNatList(X)) constraint: mark(isNatIList(X)) >= active(isNatIList(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) constraint: active(length(nil)) >= mark(0) constraint: active(U11(tt,L)) >= mark(s(length(L))) constraint: active(U21(tt)) >= mark(nil) constraint: active(take(0,IL)) >= mark(U21(isNatIList(IL))) constraint: active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) constraint: active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) constraint: active(and(tt,X)) >= mark(X) constraint: active(isNat(0)) >= mark(tt) constraint: active(isNat(s(V1))) >= mark(isNat(V1)) constraint: active(isNat(length(V1))) >= mark(isNatList(V1)) constraint: active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) constraint: active(isNatList(nil)) >= mark(tt) constraint: active(isNatList(take(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(zeros)) >= mark(tt) constraint: active(isNatIList(V)) >= mark(isNatList(V)) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: U11(mark(X1),X2) >= U11(X1,X2) constraint: U11(active(X1),X2) >= U11(X1,X2) constraint: U11(X1,mark(X2)) >= U11(X1,X2) constraint: U11(X1,active(X2)) >= U11(X1,X2) constraint: U21(mark(X)) >= U21(X) constraint: U21(active(X)) >= U21(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: isNat(mark(X)) >= isNat(X) constraint: isNat(active(X)) >= isNat(X) constraint: isNatList(mark(X)) >= isNatList(X) constraint: isNatList(active(X)) >= isNatList(X) constraint: isNatIList(mark(X)) >= isNatIList(X) constraint: isNatIList(active(X)) >= isNatIList(X) constraint: Marked_take(mark(X1),X2) >= Marked_take(X1,X2) constraint: Marked_take(active(X1),X2) >= Marked_take(X1,X2) constraint: Marked_take(X1,mark(X2)) >= Marked_take(X1,X2) constraint: Marked_take(X1,active(X2)) >= Marked_take(X1,X2) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_and(mark(X1),X2) >= Marked_and(X1,X2) ; Marked_and(active(X1),X2) >= Marked_and(X1,X2) ; Marked_and(X1,mark(X2)) >= Marked_and(X1,X2) ; Marked_and(X1,active(X2)) >= Marked_and(X1,X2) ; } + Disjunctions:{ { Marked_and(mark(X1),X2) > Marked_and(X1,X2) ; } { Marked_and(active(X1),X2) > Marked_and(X1,X2) ; } { Marked_and(X1,mark(X2)) > Marked_and(X1,X2) ; } { Marked_and(X1,active(X2)) > Marked_and(X1,X2) ; } } === 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(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(nil) >= active(nil) constraint: mark(U21(X)) >= active(U21(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(isNat(X)) >= active(isNat(X)) constraint: mark(isNatList(X)) >= active(isNatList(X)) constraint: mark(isNatIList(X)) >= active(isNatIList(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) constraint: active(length(nil)) >= mark(0) constraint: active(U11(tt,L)) >= mark(s(length(L))) constraint: active(U21(tt)) >= mark(nil) constraint: active(take(0,IL)) >= mark(U21(isNatIList(IL))) constraint: active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) constraint: active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) constraint: active(and(tt,X)) >= mark(X) constraint: active(isNat(0)) >= mark(tt) constraint: active(isNat(s(V1))) >= mark(isNat(V1)) constraint: active(isNat(length(V1))) >= mark(isNatList(V1)) constraint: active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) constraint: active(isNatList(nil)) >= mark(tt) constraint: active(isNatList(take(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(zeros)) >= mark(tt) constraint: active(isNatIList(V)) >= mark(isNatList(V)) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: U11(mark(X1),X2) >= U11(X1,X2) constraint: U11(active(X1),X2) >= U11(X1,X2) constraint: U11(X1,mark(X2)) >= U11(X1,X2) constraint: U11(X1,active(X2)) >= U11(X1,X2) constraint: U21(mark(X)) >= U21(X) constraint: U21(active(X)) >= U21(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: isNat(mark(X)) >= isNat(X) constraint: isNat(active(X)) >= isNat(X) constraint: isNatList(mark(X)) >= isNatList(X) constraint: isNatList(active(X)) >= isNatList(X) constraint: isNatIList(mark(X)) >= isNatIList(X) constraint: isNatIList(active(X)) >= isNatIList(X) constraint: Marked_and(mark(X1),X2) >= Marked_and(X1,X2) constraint: Marked_and(active(X1),X2) >= Marked_and(X1,X2) constraint: Marked_and(X1,mark(X2)) >= Marked_and(X1,X2) constraint: Marked_and(X1,active(X2)) >= Marked_and(X1,X2) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_isNat(mark(X)) >= Marked_isNat(X) ; Marked_isNat(active(X)) >= Marked_isNat(X) ; } + Disjunctions:{ { Marked_isNat(mark(X)) > Marked_isNat(X) ; } { Marked_isNat(active(X)) > Marked_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(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(nil) >= active(nil) constraint: mark(U21(X)) >= active(U21(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(isNat(X)) >= active(isNat(X)) constraint: mark(isNatList(X)) >= active(isNatList(X)) constraint: mark(isNatIList(X)) >= active(isNatIList(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) constraint: active(length(nil)) >= mark(0) constraint: active(U11(tt,L)) >= mark(s(length(L))) constraint: active(U21(tt)) >= mark(nil) constraint: active(take(0,IL)) >= mark(U21(isNatIList(IL))) constraint: active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) constraint: active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) constraint: active(and(tt,X)) >= mark(X) constraint: active(isNat(0)) >= mark(tt) constraint: active(isNat(s(V1))) >= mark(isNat(V1)) constraint: active(isNat(length(V1))) >= mark(isNatList(V1)) constraint: active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) constraint: active(isNatList(nil)) >= mark(tt) constraint: active(isNatList(take(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(zeros)) >= mark(tt) constraint: active(isNatIList(V)) >= mark(isNatList(V)) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: U11(mark(X1),X2) >= U11(X1,X2) constraint: U11(active(X1),X2) >= U11(X1,X2) constraint: U11(X1,mark(X2)) >= U11(X1,X2) constraint: U11(X1,active(X2)) >= U11(X1,X2) constraint: U21(mark(X)) >= U21(X) constraint: U21(active(X)) >= U21(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: isNat(mark(X)) >= isNat(X) constraint: isNat(active(X)) >= isNat(X) constraint: isNatList(mark(X)) >= isNatList(X) constraint: isNatList(active(X)) >= isNatList(X) constraint: isNatIList(mark(X)) >= isNatIList(X) constraint: isNatIList(active(X)) >= isNatIList(X) constraint: Marked_isNat(mark(X)) >= Marked_isNat(X) constraint: Marked_isNat(active(X)) >= Marked_isNat(X) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_isNatList(mark(X)) >= Marked_isNatList(X) ; Marked_isNatList(active(X)) >= Marked_isNatList(X) ; } + Disjunctions:{ { Marked_isNatList(mark(X)) > Marked_isNatList(X) ; } { Marked_isNatList(active(X)) > Marked_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(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(nil) >= active(nil) constraint: mark(U21(X)) >= active(U21(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(isNat(X)) >= active(isNat(X)) constraint: mark(isNatList(X)) >= active(isNatList(X)) constraint: mark(isNatIList(X)) >= active(isNatIList(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) constraint: active(length(nil)) >= mark(0) constraint: active(U11(tt,L)) >= mark(s(length(L))) constraint: active(U21(tt)) >= mark(nil) constraint: active(take(0,IL)) >= mark(U21(isNatIList(IL))) constraint: active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) constraint: active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) constraint: active(and(tt,X)) >= mark(X) constraint: active(isNat(0)) >= mark(tt) constraint: active(isNat(s(V1))) >= mark(isNat(V1)) constraint: active(isNat(length(V1))) >= mark(isNatList(V1)) constraint: active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) constraint: active(isNatList(nil)) >= mark(tt) constraint: active(isNatList(take(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(zeros)) >= mark(tt) constraint: active(isNatIList(V)) >= mark(isNatList(V)) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: U11(mark(X1),X2) >= U11(X1,X2) constraint: U11(active(X1),X2) >= U11(X1,X2) constraint: U11(X1,mark(X2)) >= U11(X1,X2) constraint: U11(X1,active(X2)) >= U11(X1,X2) constraint: U21(mark(X)) >= U21(X) constraint: U21(active(X)) >= U21(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: isNat(mark(X)) >= isNat(X) constraint: isNat(active(X)) >= isNat(X) constraint: isNatList(mark(X)) >= isNatList(X) constraint: isNatList(active(X)) >= isNatList(X) constraint: isNatIList(mark(X)) >= isNatIList(X) constraint: isNatIList(active(X)) >= isNatIList(X) constraint: Marked_isNatList(mark(X)) >= Marked_isNatList(X) constraint: Marked_isNatList(active(X)) >= Marked_isNatList(X) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_isNatIList(mark(X)) >= Marked_isNatIList(X) ; Marked_isNatIList(active(X)) >= Marked_isNatIList(X) ; } + Disjunctions:{ { Marked_isNatIList(mark(X)) > Marked_isNatIList(X) ; } { Marked_isNatIList(active(X)) > Marked_isNatIList(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(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(nil) >= active(nil) constraint: mark(U21(X)) >= active(U21(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(isNat(X)) >= active(isNat(X)) constraint: mark(isNatList(X)) >= active(isNatList(X)) constraint: mark(isNatIList(X)) >= active(isNatIList(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) constraint: active(length(nil)) >= mark(0) constraint: active(U11(tt,L)) >= mark(s(length(L))) constraint: active(U21(tt)) >= mark(nil) constraint: active(take(0,IL)) >= mark(U21(isNatIList(IL))) constraint: active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) constraint: active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) constraint: active(and(tt,X)) >= mark(X) constraint: active(isNat(0)) >= mark(tt) constraint: active(isNat(s(V1))) >= mark(isNat(V1)) constraint: active(isNat(length(V1))) >= mark(isNatList(V1)) constraint: active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) constraint: active(isNatList(nil)) >= mark(tt) constraint: active(isNatList(take(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(zeros)) >= mark(tt) constraint: active(isNatIList(V)) >= mark(isNatList(V)) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: U11(mark(X1),X2) >= U11(X1,X2) constraint: U11(active(X1),X2) >= U11(X1,X2) constraint: U11(X1,mark(X2)) >= U11(X1,X2) constraint: U11(X1,active(X2)) >= U11(X1,X2) constraint: U21(mark(X)) >= U21(X) constraint: U21(active(X)) >= U21(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: isNat(mark(X)) >= isNat(X) constraint: isNat(active(X)) >= isNat(X) constraint: isNatList(mark(X)) >= isNatList(X) constraint: isNatList(active(X)) >= isNatList(X) constraint: isNatIList(mark(X)) >= isNatIList(X) constraint: isNatIList(active(X)) >= isNatIList(X) constraint: Marked_isNatIList(mark(X)) >= Marked_isNatIList(X) constraint: Marked_isNatIList(active(X)) >= Marked_isNatIList(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(U11(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) ; Marked_mark(U21(X)) >= Marked_mark(X) ; Marked_mark(take(X1,X2)) >= Marked_mark(X1) ; Marked_mark(take(X1,X2)) >= Marked_mark(X2) ; Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) ; Marked_mark(U31(X1,X2,X3,X4)) >= Marked_mark(X1) ; Marked_mark(U31(X1,X2,X3,X4)) >= Marked_active(U31(mark(X1),X2,X3,X4)) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) ; Marked_mark(isNat(X)) >= Marked_active(isNat(X)) ; Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) ; Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList(L), isNat(N)),L)) ; Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) ; Marked_active(take(0,IL)) >= Marked_mark(U21(isNatIList(IL))) ; Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(U31(and(isNatIList(IL), and(isNat(M), isNat(N))), IL,M,N)) ; Marked_active(U31(tt,IL,M,N)) >= Marked_mark(cons(N,take(M,IL))) ; Marked_active(and(tt,X)) >= Marked_mark(X) ; Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) ; Marked_active(isNat(length(V1))) >= Marked_mark(isNatList(V1)) ; Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatList(V2))) ; Marked_active(isNatList(take(V1,V2))) >= Marked_mark(and(isNat(V1), isNatIList(V2))) ; Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatIList(V2))) ; Marked_active(isNatIList(V)) >= Marked_mark(isNatList(V)) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(U11(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U11(X1,X2)) > Marked_active(U11(mark(X1),X2)) ; } { Marked_mark(U21(X)) > Marked_mark(X) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(take(X1,X2)) > Marked_active(take(mark(X1),mark(X2))) ; } { Marked_mark(U31(X1,X2,X3,X4)) > Marked_mark(X1) ; } { Marked_mark(U31(X1,X2,X3,X4)) > Marked_active(U31(mark(X1),X2,X3,X4)) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_active(and(mark(X1),X2)) ; } { Marked_mark(isNat(X)) > Marked_active(isNat(X)) ; } { Marked_mark(isNatList(X)) > Marked_active(isNatList(X)) ; } { Marked_mark(isNatIList(X)) > Marked_active(isNatIList(X)) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(length(cons(N,L))) > Marked_mark(U11(and(isNatList(L),isNat(N)), L)) ; } { Marked_active(U11(tt,L)) > Marked_mark(s(length(L))) ; } { Marked_active(take(0,IL)) > Marked_mark(U21(isNatIList(IL))) ; } { Marked_active(take(s(M),cons(N,IL))) > Marked_mark(U31(and(isNatIList(IL), and(isNat(M), isNat(N))), IL,M,N)) ; } { Marked_active(U31(tt,IL,M,N)) > Marked_mark(cons(N,take(M,IL))) ; } { Marked_active(and(tt,X)) > Marked_mark(X) ; } { Marked_active(isNat(s(V1))) > Marked_mark(isNat(V1)) ; } { Marked_active(isNat(length(V1))) > Marked_mark(isNatList(V1)) ; } { Marked_active(isNatList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatList(V2))) ; } { Marked_active(isNatList(take(V1,V2))) > Marked_mark(and(isNat(V1), isNatIList(V2))) ; } { Marked_active(isNatIList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatIList(V2))) ; } { Marked_active(isNatIList(V)) > Marked_mark(isNatList(V)) ; } } === 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(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(nil) >= active(nil) constraint: mark(U21(X)) >= active(U21(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(isNat(X)) >= active(isNat(X)) constraint: mark(isNatList(X)) >= active(isNatList(X)) constraint: mark(isNatIList(X)) >= active(isNatIList(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) constraint: active(length(nil)) >= mark(0) constraint: active(U11(tt,L)) >= mark(s(length(L))) constraint: active(U21(tt)) >= mark(nil) constraint: active(take(0,IL)) >= mark(U21(isNatIList(IL))) constraint: active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) constraint: active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) constraint: active(and(tt,X)) >= mark(X) constraint: active(isNat(0)) >= mark(tt) constraint: active(isNat(s(V1))) >= mark(isNat(V1)) constraint: active(isNat(length(V1))) >= mark(isNatList(V1)) constraint: active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) constraint: active(isNatList(nil)) >= mark(tt) constraint: active(isNatList(take(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(zeros)) >= mark(tt) constraint: active(isNatIList(V)) >= mark(isNatList(V)) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: U11(mark(X1),X2) >= U11(X1,X2) constraint: U11(active(X1),X2) >= U11(X1,X2) constraint: U11(X1,mark(X2)) >= U11(X1,X2) constraint: U11(X1,active(X2)) >= U11(X1,X2) constraint: U21(mark(X)) >= U21(X) constraint: U21(active(X)) >= U21(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: isNat(mark(X)) >= isNat(X) constraint: isNat(active(X)) >= isNat(X) constraint: isNatList(mark(X)) >= isNatList(X) constraint: isNatList(active(X)) >= isNatList(X) constraint: isNatIList(mark(X)) >= isNatIList(X) constraint: isNatIList(active(X)) >= isNatIList(X) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_mark(U11(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) constraint: Marked_mark(U21(X)) >= Marked_mark(X) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) constraint: Marked_mark(U31(X1,X2,X3,X4)) >= Marked_mark(X1) constraint: Marked_mark(U31(X1,X2,X3,X4)) >= Marked_active(U31(mark(X1), X2,X3,X4)) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) constraint: Marked_mark(isNat(X)) >= Marked_active(isNat(X)) constraint: Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) constraint: Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList( L), isNat(N)), L)) constraint: Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) constraint: Marked_active(take(0,IL)) >= Marked_mark(U21(isNatIList(IL))) constraint: Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(U31(and( isNatIList( IL), and( isNat( M), isNat(N))), IL,M, N)) constraint: Marked_active(U31(tt,IL,M,N)) >= Marked_mark(cons(N,take(M,IL))) constraint: Marked_active(and(tt,X)) >= Marked_mark(X) constraint: Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) constraint: Marked_active(isNat(length(V1))) >= Marked_mark(isNatList(V1)) constraint: Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and( isNat(V1), isNatList(V2))) constraint: Marked_active(isNatList(take(V1,V2))) >= Marked_mark(and( isNat(V1), isNatIList( V2))) constraint: Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and( isNat(V1), isNatIList( V2))) constraint: Marked_active(isNatIList(V)) >= Marked_mark(isNatList(V)) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(U11(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) ; Marked_mark(U21(X)) >= Marked_mark(X) ; Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) ; Marked_mark(U31(X1,X2,X3,X4)) >= Marked_active(U31(mark(X1),X2,X3,X4)) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) ; Marked_mark(isNat(X)) >= Marked_active(isNat(X)) ; Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) ; Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList(L), isNat(N)),L)) ; Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) ; Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(U31(and(isNatIList(IL), and(isNat(M), isNat(N))), IL,M,N)) ; Marked_active(U31(tt,IL,M,N)) >= Marked_mark(cons(N,take(M,IL))) ; Marked_active(and(tt,X)) >= Marked_mark(X) ; Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) ; Marked_active(isNat(length(V1))) >= Marked_mark(isNatList(V1)) ; Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatList(V2))) ; Marked_active(isNatList(take(V1,V2))) >= Marked_mark(and(isNat(V1), isNatIList(V2))) ; Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatIList(V2))) ; Marked_active(isNatIList(V)) >= Marked_mark(isNatList(V)) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(U11(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U11(X1,X2)) > Marked_active(U11(mark(X1),X2)) ; } { Marked_mark(U21(X)) > Marked_mark(X) ; } { Marked_mark(take(X1,X2)) > Marked_active(take(mark(X1),mark(X2))) ; } { Marked_mark(U31(X1,X2,X3,X4)) > Marked_active(U31(mark(X1),X2,X3,X4)) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_active(and(mark(X1),X2)) ; } { Marked_mark(isNat(X)) > Marked_active(isNat(X)) ; } { Marked_mark(isNatList(X)) > Marked_active(isNatList(X)) ; } { Marked_mark(isNatIList(X)) > Marked_active(isNatIList(X)) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(length(cons(N,L))) > Marked_mark(U11(and(isNatList(L),isNat(N)), L)) ; } { Marked_active(U11(tt,L)) > Marked_mark(s(length(L))) ; } { Marked_active(take(s(M),cons(N,IL))) > Marked_mark(U31(and(isNatIList(IL), and(isNat(M), isNat(N))), IL,M,N)) ; } { Marked_active(U31(tt,IL,M,N)) > Marked_mark(cons(N,take(M,IL))) ; } { Marked_active(and(tt,X)) > Marked_mark(X) ; } { Marked_active(isNat(s(V1))) > Marked_mark(isNat(V1)) ; } { Marked_active(isNat(length(V1))) > Marked_mark(isNatList(V1)) ; } { Marked_active(isNatList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatList(V2))) ; } { Marked_active(isNatList(take(V1,V2))) > Marked_mark(and(isNat(V1), isNatIList(V2))) ; } { Marked_active(isNatIList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatIList(V2))) ; } { Marked_active(isNatIList(V)) > Marked_mark(isNatList(V)) ; } } === 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(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(nil) >= active(nil) constraint: mark(U21(X)) >= active(U21(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(isNat(X)) >= active(isNat(X)) constraint: mark(isNatList(X)) >= active(isNatList(X)) constraint: mark(isNatIList(X)) >= active(isNatIList(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) constraint: active(length(nil)) >= mark(0) constraint: active(U11(tt,L)) >= mark(s(length(L))) constraint: active(U21(tt)) >= mark(nil) constraint: active(take(0,IL)) >= mark(U21(isNatIList(IL))) constraint: active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) constraint: active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) constraint: active(and(tt,X)) >= mark(X) constraint: active(isNat(0)) >= mark(tt) constraint: active(isNat(s(V1))) >= mark(isNat(V1)) constraint: active(isNat(length(V1))) >= mark(isNatList(V1)) constraint: active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) constraint: active(isNatList(nil)) >= mark(tt) constraint: active(isNatList(take(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(zeros)) >= mark(tt) constraint: active(isNatIList(V)) >= mark(isNatList(V)) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: U11(mark(X1),X2) >= U11(X1,X2) constraint: U11(active(X1),X2) >= U11(X1,X2) constraint: U11(X1,mark(X2)) >= U11(X1,X2) constraint: U11(X1,active(X2)) >= U11(X1,X2) constraint: U21(mark(X)) >= U21(X) constraint: U21(active(X)) >= U21(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: isNat(mark(X)) >= isNat(X) constraint: isNat(active(X)) >= isNat(X) constraint: isNatList(mark(X)) >= isNatList(X) constraint: isNatList(active(X)) >= isNatList(X) constraint: isNatIList(mark(X)) >= isNatIList(X) constraint: isNatIList(active(X)) >= isNatIList(X) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_mark(U11(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) constraint: Marked_mark(U21(X)) >= Marked_mark(X) constraint: Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) constraint: Marked_mark(U31(X1,X2,X3,X4)) >= Marked_active(U31(mark(X1), X2,X3,X4)) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) constraint: Marked_mark(isNat(X)) >= Marked_active(isNat(X)) constraint: Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) constraint: Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList( L), isNat(N)), L)) constraint: Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) constraint: Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(U31(and( isNatIList( IL), and( isNat( M), isNat(N))), IL,M, N)) constraint: Marked_active(U31(tt,IL,M,N)) >= Marked_mark(cons(N,take(M,IL))) constraint: Marked_active(and(tt,X)) >= Marked_mark(X) constraint: Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) constraint: Marked_active(isNat(length(V1))) >= Marked_mark(isNatList(V1)) constraint: Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and( isNat(V1), isNatList(V2))) constraint: Marked_active(isNatList(take(V1,V2))) >= Marked_mark(and( isNat(V1), isNatIList( V2))) constraint: Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and( isNat(V1), isNatIList( V2))) constraint: Marked_active(isNatIList(V)) >= Marked_mark(isNatList(V)) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(U11(X1,X2)) >= Marked_mark(X1) ; Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) ; Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) ; Marked_mark(U31(X1,X2,X3,X4)) >= Marked_active(U31(mark(X1),X2,X3,X4)) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) ; Marked_mark(isNat(X)) >= Marked_active(isNat(X)) ; Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) ; Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList(L), isNat(N)),L)) ; Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) ; Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(U31(and(isNatIList(IL), and(isNat(M), isNat(N))), IL,M,N)) ; Marked_active(U31(tt,IL,M,N)) >= Marked_mark(cons(N,take(M,IL))) ; Marked_active(and(tt,X)) >= Marked_mark(X) ; Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) ; Marked_active(isNat(length(V1))) >= Marked_mark(isNatList(V1)) ; Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatList(V2))) ; Marked_active(isNatList(take(V1,V2))) >= Marked_mark(and(isNat(V1), isNatIList(V2))) ; Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatIList(V2))) ; Marked_active(isNatIList(V)) >= Marked_mark(isNatList(V)) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(U11(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(U11(X1,X2)) > Marked_active(U11(mark(X1),X2)) ; } { Marked_mark(take(X1,X2)) > Marked_active(take(mark(X1),mark(X2))) ; } { Marked_mark(U31(X1,X2,X3,X4)) > Marked_active(U31(mark(X1),X2,X3,X4)) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_active(and(mark(X1),X2)) ; } { Marked_mark(isNat(X)) > Marked_active(isNat(X)) ; } { Marked_mark(isNatList(X)) > Marked_active(isNatList(X)) ; } { Marked_mark(isNatIList(X)) > Marked_active(isNatIList(X)) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(length(cons(N,L))) > Marked_mark(U11(and(isNatList(L),isNat(N)), L)) ; } { Marked_active(U11(tt,L)) > Marked_mark(s(length(L))) ; } { Marked_active(take(s(M),cons(N,IL))) > Marked_mark(U31(and(isNatIList(IL), and(isNat(M), isNat(N))), IL,M,N)) ; } { Marked_active(U31(tt,IL,M,N)) > Marked_mark(cons(N,take(M,IL))) ; } { Marked_active(and(tt,X)) > Marked_mark(X) ; } { Marked_active(isNat(s(V1))) > Marked_mark(isNat(V1)) ; } { Marked_active(isNat(length(V1))) > Marked_mark(isNatList(V1)) ; } { Marked_active(isNatList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatList(V2))) ; } { Marked_active(isNatList(take(V1,V2))) > Marked_mark(and(isNat(V1), isNatIList(V2))) ; } { Marked_active(isNatIList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatIList(V2))) ; } { Marked_active(isNatIList(V)) > Marked_mark(isNatList(V)) ; } } === 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(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(nil) >= active(nil) constraint: mark(U21(X)) >= active(U21(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(isNat(X)) >= active(isNat(X)) constraint: mark(isNatList(X)) >= active(isNatList(X)) constraint: mark(isNatIList(X)) >= active(isNatIList(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) constraint: active(length(nil)) >= mark(0) constraint: active(U11(tt,L)) >= mark(s(length(L))) constraint: active(U21(tt)) >= mark(nil) constraint: active(take(0,IL)) >= mark(U21(isNatIList(IL))) constraint: active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) constraint: active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) constraint: active(and(tt,X)) >= mark(X) constraint: active(isNat(0)) >= mark(tt) constraint: active(isNat(s(V1))) >= mark(isNat(V1)) constraint: active(isNat(length(V1))) >= mark(isNatList(V1)) constraint: active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) constraint: active(isNatList(nil)) >= mark(tt) constraint: active(isNatList(take(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(zeros)) >= mark(tt) constraint: active(isNatIList(V)) >= mark(isNatList(V)) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: U11(mark(X1),X2) >= U11(X1,X2) constraint: U11(active(X1),X2) >= U11(X1,X2) constraint: U11(X1,mark(X2)) >= U11(X1,X2) constraint: U11(X1,active(X2)) >= U11(X1,X2) constraint: U21(mark(X)) >= U21(X) constraint: U21(active(X)) >= U21(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: isNat(mark(X)) >= isNat(X) constraint: isNat(active(X)) >= isNat(X) constraint: isNatList(mark(X)) >= isNatList(X) constraint: isNatList(active(X)) >= isNatList(X) constraint: isNatIList(mark(X)) >= isNatIList(X) constraint: isNatIList(active(X)) >= isNatIList(X) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_mark(U11(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) constraint: Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) constraint: Marked_mark(U31(X1,X2,X3,X4)) >= Marked_active(U31(mark(X1), X2,X3,X4)) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) constraint: Marked_mark(isNat(X)) >= Marked_active(isNat(X)) constraint: Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) constraint: Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList( L), isNat(N)), L)) constraint: Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) constraint: Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(U31(and( isNatIList( IL), and( isNat( M), isNat(N))), IL,M, N)) constraint: Marked_active(U31(tt,IL,M,N)) >= Marked_mark(cons(N,take(M,IL))) constraint: Marked_active(and(tt,X)) >= Marked_mark(X) constraint: Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) constraint: Marked_active(isNat(length(V1))) >= Marked_mark(isNatList(V1)) constraint: Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and( isNat(V1), isNatList(V2))) constraint: Marked_active(isNatList(take(V1,V2))) >= Marked_mark(and( isNat(V1), isNatIList( V2))) constraint: Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and( isNat(V1), isNatIList( V2))) constraint: Marked_active(isNatIList(V)) >= Marked_mark(isNatList(V)) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) ; Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) ; Marked_mark(U31(X1,X2,X3,X4)) >= Marked_active(U31(mark(X1),X2,X3,X4)) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) ; Marked_mark(isNat(X)) >= Marked_active(isNat(X)) ; Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) ; Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList(L), isNat(N)),L)) ; Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) ; Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(U31(and(isNatIList(IL), and(isNat(M), isNat(N))), IL,M,N)) ; Marked_active(U31(tt,IL,M,N)) >= Marked_mark(cons(N,take(M,IL))) ; Marked_active(and(tt,X)) >= Marked_mark(X) ; Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) ; Marked_active(isNat(length(V1))) >= Marked_mark(isNatList(V1)) ; Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatList(V2))) ; Marked_active(isNatList(take(V1,V2))) >= Marked_mark(and(isNat(V1), isNatIList(V2))) ; Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatIList(V2))) ; Marked_active(isNatIList(V)) >= Marked_mark(isNatList(V)) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(U11(X1,X2)) > Marked_active(U11(mark(X1),X2)) ; } { Marked_mark(take(X1,X2)) > Marked_active(take(mark(X1),mark(X2))) ; } { Marked_mark(U31(X1,X2,X3,X4)) > Marked_active(U31(mark(X1),X2,X3,X4)) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_active(and(mark(X1),X2)) ; } { Marked_mark(isNat(X)) > Marked_active(isNat(X)) ; } { Marked_mark(isNatList(X)) > Marked_active(isNatList(X)) ; } { Marked_mark(isNatIList(X)) > Marked_active(isNatIList(X)) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(length(cons(N,L))) > Marked_mark(U11(and(isNatList(L),isNat(N)), L)) ; } { Marked_active(U11(tt,L)) > Marked_mark(s(length(L))) ; } { Marked_active(take(s(M),cons(N,IL))) > Marked_mark(U31(and(isNatIList(IL), and(isNat(M), isNat(N))), IL,M,N)) ; } { Marked_active(U31(tt,IL,M,N)) > Marked_mark(cons(N,take(M,IL))) ; } { Marked_active(and(tt,X)) > Marked_mark(X) ; } { Marked_active(isNat(s(V1))) > Marked_mark(isNat(V1)) ; } { Marked_active(isNat(length(V1))) > Marked_mark(isNatList(V1)) ; } { Marked_active(isNatList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatList(V2))) ; } { Marked_active(isNatList(take(V1,V2))) > Marked_mark(and(isNat(V1), isNatIList(V2))) ; } { Marked_active(isNatIList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatIList(V2))) ; } { Marked_active(isNatIList(V)) > Marked_mark(isNatList(V)) ; } } === 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(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(nil) >= active(nil) constraint: mark(U21(X)) >= active(U21(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(isNat(X)) >= active(isNat(X)) constraint: mark(isNatList(X)) >= active(isNatList(X)) constraint: mark(isNatIList(X)) >= active(isNatIList(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) constraint: active(length(nil)) >= mark(0) constraint: active(U11(tt,L)) >= mark(s(length(L))) constraint: active(U21(tt)) >= mark(nil) constraint: active(take(0,IL)) >= mark(U21(isNatIList(IL))) constraint: active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) constraint: active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) constraint: active(and(tt,X)) >= mark(X) constraint: active(isNat(0)) >= mark(tt) constraint: active(isNat(s(V1))) >= mark(isNat(V1)) constraint: active(isNat(length(V1))) >= mark(isNatList(V1)) constraint: active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) constraint: active(isNatList(nil)) >= mark(tt) constraint: active(isNatList(take(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(zeros)) >= mark(tt) constraint: active(isNatIList(V)) >= mark(isNatList(V)) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: U11(mark(X1),X2) >= U11(X1,X2) constraint: U11(active(X1),X2) >= U11(X1,X2) constraint: U11(X1,mark(X2)) >= U11(X1,X2) constraint: U11(X1,active(X2)) >= U11(X1,X2) constraint: U21(mark(X)) >= U21(X) constraint: U21(active(X)) >= U21(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: isNat(mark(X)) >= isNat(X) constraint: isNat(active(X)) >= isNat(X) constraint: isNatList(mark(X)) >= isNatList(X) constraint: isNatList(active(X)) >= isNatList(X) constraint: isNatIList(mark(X)) >= isNatIList(X) constraint: isNatIList(active(X)) >= isNatIList(X) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) constraint: Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) constraint: Marked_mark(U31(X1,X2,X3,X4)) >= Marked_active(U31(mark(X1), X2,X3,X4)) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) constraint: Marked_mark(isNat(X)) >= Marked_active(isNat(X)) constraint: Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) constraint: Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList( L), isNat(N)), L)) constraint: Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) constraint: Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(U31(and( isNatIList( IL), and( isNat( M), isNat(N))), IL,M, N)) constraint: Marked_active(U31(tt,IL,M,N)) >= Marked_mark(cons(N,take(M,IL))) constraint: Marked_active(and(tt,X)) >= Marked_mark(X) constraint: Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) constraint: Marked_active(isNat(length(V1))) >= Marked_mark(isNatList(V1)) constraint: Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and( isNat(V1), isNatList(V2))) constraint: Marked_active(isNatList(take(V1,V2))) >= Marked_mark(and( isNat(V1), isNatIList( V2))) constraint: Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and( isNat(V1), isNatIList( V2))) constraint: Marked_active(isNatIList(V)) >= Marked_mark(isNatList(V)) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) ; Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) ; Marked_mark(U31(X1,X2,X3,X4)) >= Marked_active(U31(mark(X1),X2,X3,X4)) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) ; Marked_mark(isNat(X)) >= Marked_active(isNat(X)) ; Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) ; Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList(L), isNat(N)),L)) ; Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) ; Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(U31(and(isNatIList(IL), and(isNat(M), isNat(N))), IL,M,N)) ; Marked_active(U31(tt,IL,M,N)) >= Marked_mark(cons(N,take(M,IL))) ; Marked_active(and(tt,X)) >= Marked_mark(X) ; Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) ; Marked_active(isNat(length(V1))) >= Marked_mark(isNatList(V1)) ; Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatList(V2))) ; Marked_active(isNatList(take(V1,V2))) >= Marked_mark(and(isNat(V1), isNatIList(V2))) ; Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatIList(V2))) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(U11(X1,X2)) > Marked_active(U11(mark(X1),X2)) ; } { Marked_mark(take(X1,X2)) > Marked_active(take(mark(X1),mark(X2))) ; } { Marked_mark(U31(X1,X2,X3,X4)) > Marked_active(U31(mark(X1),X2,X3,X4)) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_active(and(mark(X1),X2)) ; } { Marked_mark(isNat(X)) > Marked_active(isNat(X)) ; } { Marked_mark(isNatList(X)) > Marked_active(isNatList(X)) ; } { Marked_mark(isNatIList(X)) > Marked_active(isNatIList(X)) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(length(cons(N,L))) > Marked_mark(U11(and(isNatList(L),isNat(N)), L)) ; } { Marked_active(U11(tt,L)) > Marked_mark(s(length(L))) ; } { Marked_active(take(s(M),cons(N,IL))) > Marked_mark(U31(and(isNatIList(IL), and(isNat(M), isNat(N))), IL,M,N)) ; } { Marked_active(U31(tt,IL,M,N)) > Marked_mark(cons(N,take(M,IL))) ; } { Marked_active(and(tt,X)) > Marked_mark(X) ; } { Marked_active(isNat(s(V1))) > Marked_mark(isNat(V1)) ; } { Marked_active(isNat(length(V1))) > Marked_mark(isNatList(V1)) ; } { Marked_active(isNatList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatList(V2))) ; } { Marked_active(isNatList(take(V1,V2))) > Marked_mark(and(isNat(V1), isNatIList(V2))) ; } { Marked_active(isNatIList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatIList(V2))) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(nil) >= active(nil) constraint: mark(U21(X)) >= active(U21(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(isNat(X)) >= active(isNat(X)) constraint: mark(isNatList(X)) >= active(isNatList(X)) constraint: mark(isNatIList(X)) >= active(isNatIList(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) constraint: active(length(nil)) >= mark(0) constraint: active(U11(tt,L)) >= mark(s(length(L))) constraint: active(U21(tt)) >= mark(nil) constraint: active(take(0,IL)) >= mark(U21(isNatIList(IL))) constraint: active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) constraint: active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) constraint: active(and(tt,X)) >= mark(X) constraint: active(isNat(0)) >= mark(tt) constraint: active(isNat(s(V1))) >= mark(isNat(V1)) constraint: active(isNat(length(V1))) >= mark(isNatList(V1)) constraint: active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) constraint: active(isNatList(nil)) >= mark(tt) constraint: active(isNatList(take(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(zeros)) >= mark(tt) constraint: active(isNatIList(V)) >= mark(isNatList(V)) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: U11(mark(X1),X2) >= U11(X1,X2) constraint: U11(active(X1),X2) >= U11(X1,X2) constraint: U11(X1,mark(X2)) >= U11(X1,X2) constraint: U11(X1,active(X2)) >= U11(X1,X2) constraint: U21(mark(X)) >= U21(X) constraint: U21(active(X)) >= U21(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: isNat(mark(X)) >= isNat(X) constraint: isNat(active(X)) >= isNat(X) constraint: isNatList(mark(X)) >= isNatList(X) constraint: isNatList(active(X)) >= isNatList(X) constraint: isNatIList(mark(X)) >= isNatIList(X) constraint: isNatIList(active(X)) >= isNatIList(X) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) constraint: Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) constraint: Marked_mark(U31(X1,X2,X3,X4)) >= Marked_active(U31(mark(X1), X2,X3,X4)) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) constraint: Marked_mark(isNat(X)) >= Marked_active(isNat(X)) constraint: Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) constraint: Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList( L), isNat(N)), L)) constraint: Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) constraint: Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(U31(and( isNatIList( IL), and( isNat( M), isNat(N))), IL,M, N)) constraint: Marked_active(U31(tt,IL,M,N)) >= Marked_mark(cons(N,take(M,IL))) constraint: Marked_active(and(tt,X)) >= Marked_mark(X) constraint: Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) constraint: Marked_active(isNat(length(V1))) >= Marked_mark(isNatList(V1)) constraint: Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and( isNat(V1), isNatList(V2))) constraint: Marked_active(isNatList(take(V1,V2))) >= Marked_mark(and( isNat(V1), isNatIList( V2))) constraint: Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and( isNat(V1), isNatIList( V2))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) ; Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) ; Marked_mark(U31(X1,X2,X3,X4)) >= Marked_active(U31(mark(X1),X2,X3,X4)) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) ; Marked_mark(isNat(X)) >= Marked_active(isNat(X)) ; Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) ; Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList(L), isNat(N)),L)) ; Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) ; Marked_active(U31(tt,IL,M,N)) >= Marked_mark(cons(N,take(M,IL))) ; Marked_active(and(tt,X)) >= Marked_mark(X) ; Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) ; Marked_active(isNat(length(V1))) >= Marked_mark(isNatList(V1)) ; Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatList(V2))) ; Marked_active(isNatList(take(V1,V2))) >= Marked_mark(and(isNat(V1), isNatIList(V2))) ; Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatIList(V2))) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(U11(X1,X2)) > Marked_active(U11(mark(X1),X2)) ; } { Marked_mark(take(X1,X2)) > Marked_active(take(mark(X1),mark(X2))) ; } { Marked_mark(U31(X1,X2,X3,X4)) > Marked_active(U31(mark(X1),X2,X3,X4)) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_active(and(mark(X1),X2)) ; } { Marked_mark(isNat(X)) > Marked_active(isNat(X)) ; } { Marked_mark(isNatList(X)) > Marked_active(isNatList(X)) ; } { Marked_mark(isNatIList(X)) > Marked_active(isNatIList(X)) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(length(cons(N,L))) > Marked_mark(U11(and(isNatList(L),isNat(N)), L)) ; } { Marked_active(U11(tt,L)) > Marked_mark(s(length(L))) ; } { Marked_active(U31(tt,IL,M,N)) > Marked_mark(cons(N,take(M,IL))) ; } { Marked_active(and(tt,X)) > Marked_mark(X) ; } { Marked_active(isNat(s(V1))) > Marked_mark(isNat(V1)) ; } { Marked_active(isNat(length(V1))) > Marked_mark(isNatList(V1)) ; } { Marked_active(isNatList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatList(V2))) ; } { Marked_active(isNatList(take(V1,V2))) > Marked_mark(and(isNat(V1), isNatIList(V2))) ; } { Marked_active(isNatIList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatIList(V2))) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(nil) >= active(nil) constraint: mark(U21(X)) >= active(U21(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(isNat(X)) >= active(isNat(X)) constraint: mark(isNatList(X)) >= active(isNatList(X)) constraint: mark(isNatIList(X)) >= active(isNatIList(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) constraint: active(length(nil)) >= mark(0) constraint: active(U11(tt,L)) >= mark(s(length(L))) constraint: active(U21(tt)) >= mark(nil) constraint: active(take(0,IL)) >= mark(U21(isNatIList(IL))) constraint: active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) constraint: active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) constraint: active(and(tt,X)) >= mark(X) constraint: active(isNat(0)) >= mark(tt) constraint: active(isNat(s(V1))) >= mark(isNat(V1)) constraint: active(isNat(length(V1))) >= mark(isNatList(V1)) constraint: active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) constraint: active(isNatList(nil)) >= mark(tt) constraint: active(isNatList(take(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(zeros)) >= mark(tt) constraint: active(isNatIList(V)) >= mark(isNatList(V)) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: U11(mark(X1),X2) >= U11(X1,X2) constraint: U11(active(X1),X2) >= U11(X1,X2) constraint: U11(X1,mark(X2)) >= U11(X1,X2) constraint: U11(X1,active(X2)) >= U11(X1,X2) constraint: U21(mark(X)) >= U21(X) constraint: U21(active(X)) >= U21(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: isNat(mark(X)) >= isNat(X) constraint: isNat(active(X)) >= isNat(X) constraint: isNatList(mark(X)) >= isNatList(X) constraint: isNatList(active(X)) >= isNatList(X) constraint: isNatIList(mark(X)) >= isNatIList(X) constraint: isNatIList(active(X)) >= isNatIList(X) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) constraint: Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) constraint: Marked_mark(U31(X1,X2,X3,X4)) >= Marked_active(U31(mark(X1), X2,X3,X4)) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) constraint: Marked_mark(isNat(X)) >= Marked_active(isNat(X)) constraint: Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) constraint: Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList( L), isNat(N)), L)) constraint: Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) constraint: Marked_active(U31(tt,IL,M,N)) >= Marked_mark(cons(N,take(M,IL))) constraint: Marked_active(and(tt,X)) >= Marked_mark(X) constraint: Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) constraint: Marked_active(isNat(length(V1))) >= Marked_mark(isNatList(V1)) constraint: Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and( isNat(V1), isNatList(V2))) constraint: Marked_active(isNatList(take(V1,V2))) >= Marked_mark(and( isNat(V1), isNatIList( V2))) constraint: Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and( isNat(V1), isNatIList( V2))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) ; Marked_mark(U31(X1,X2,X3,X4)) >= Marked_active(U31(mark(X1),X2,X3,X4)) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) ; Marked_mark(isNat(X)) >= Marked_active(isNat(X)) ; Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) ; Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList(L), isNat(N)),L)) ; Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) ; Marked_active(U31(tt,IL,M,N)) >= Marked_mark(cons(N,take(M,IL))) ; Marked_active(and(tt,X)) >= Marked_mark(X) ; Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) ; Marked_active(isNat(length(V1))) >= Marked_mark(isNatList(V1)) ; Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatList(V2))) ; Marked_active(isNatList(take(V1,V2))) >= Marked_mark(and(isNat(V1), isNatIList(V2))) ; Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatIList(V2))) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(U11(X1,X2)) > Marked_active(U11(mark(X1),X2)) ; } { Marked_mark(U31(X1,X2,X3,X4)) > Marked_active(U31(mark(X1),X2,X3,X4)) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_active(and(mark(X1),X2)) ; } { Marked_mark(isNat(X)) > Marked_active(isNat(X)) ; } { Marked_mark(isNatList(X)) > Marked_active(isNatList(X)) ; } { Marked_mark(isNatIList(X)) > Marked_active(isNatIList(X)) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(length(cons(N,L))) > Marked_mark(U11(and(isNatList(L),isNat(N)), L)) ; } { Marked_active(U11(tt,L)) > Marked_mark(s(length(L))) ; } { Marked_active(U31(tt,IL,M,N)) > Marked_mark(cons(N,take(M,IL))) ; } { Marked_active(and(tt,X)) > Marked_mark(X) ; } { Marked_active(isNat(s(V1))) > Marked_mark(isNat(V1)) ; } { Marked_active(isNat(length(V1))) > Marked_mark(isNatList(V1)) ; } { Marked_active(isNatList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatList(V2))) ; } { Marked_active(isNatList(take(V1,V2))) > Marked_mark(and(isNat(V1), isNatIList(V2))) ; } { Marked_active(isNatIList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatIList(V2))) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(nil) >= active(nil) constraint: mark(U21(X)) >= active(U21(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(isNat(X)) >= active(isNat(X)) constraint: mark(isNatList(X)) >= active(isNatList(X)) constraint: mark(isNatIList(X)) >= active(isNatIList(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) constraint: active(length(nil)) >= mark(0) constraint: active(U11(tt,L)) >= mark(s(length(L))) constraint: active(U21(tt)) >= mark(nil) constraint: active(take(0,IL)) >= mark(U21(isNatIList(IL))) constraint: active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) constraint: active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) constraint: active(and(tt,X)) >= mark(X) constraint: active(isNat(0)) >= mark(tt) constraint: active(isNat(s(V1))) >= mark(isNat(V1)) constraint: active(isNat(length(V1))) >= mark(isNatList(V1)) constraint: active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) constraint: active(isNatList(nil)) >= mark(tt) constraint: active(isNatList(take(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(zeros)) >= mark(tt) constraint: active(isNatIList(V)) >= mark(isNatList(V)) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: U11(mark(X1),X2) >= U11(X1,X2) constraint: U11(active(X1),X2) >= U11(X1,X2) constraint: U11(X1,mark(X2)) >= U11(X1,X2) constraint: U11(X1,active(X2)) >= U11(X1,X2) constraint: U21(mark(X)) >= U21(X) constraint: U21(active(X)) >= U21(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: isNat(mark(X)) >= isNat(X) constraint: isNat(active(X)) >= isNat(X) constraint: isNatList(mark(X)) >= isNatList(X) constraint: isNatList(active(X)) >= isNatList(X) constraint: isNatIList(mark(X)) >= isNatIList(X) constraint: isNatIList(active(X)) >= isNatIList(X) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) constraint: Marked_mark(U31(X1,X2,X3,X4)) >= Marked_active(U31(mark(X1), X2,X3,X4)) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) constraint: Marked_mark(isNat(X)) >= Marked_active(isNat(X)) constraint: Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) constraint: Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList( L), isNat(N)), L)) constraint: Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) constraint: Marked_active(U31(tt,IL,M,N)) >= Marked_mark(cons(N,take(M,IL))) constraint: Marked_active(and(tt,X)) >= Marked_mark(X) constraint: Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) constraint: Marked_active(isNat(length(V1))) >= Marked_mark(isNatList(V1)) constraint: Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and( isNat(V1), isNatList(V2))) constraint: Marked_active(isNatList(take(V1,V2))) >= Marked_mark(and( isNat(V1), isNatIList( V2))) constraint: Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and( isNat(V1), isNatIList( V2))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) ; Marked_mark(U31(X1,X2,X3,X4)) >= Marked_active(U31(mark(X1),X2,X3,X4)) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) ; Marked_mark(isNat(X)) >= Marked_active(isNat(X)) ; Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) ; Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList(L), isNat(N)),L)) ; Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) ; Marked_active(and(tt,X)) >= Marked_mark(X) ; Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) ; Marked_active(isNat(length(V1))) >= Marked_mark(isNatList(V1)) ; Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatList(V2))) ; Marked_active(isNatList(take(V1,V2))) >= Marked_mark(and(isNat(V1), isNatIList(V2))) ; Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatIList(V2))) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(U11(X1,X2)) > Marked_active(U11(mark(X1),X2)) ; } { Marked_mark(U31(X1,X2,X3,X4)) > Marked_active(U31(mark(X1),X2,X3,X4)) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_active(and(mark(X1),X2)) ; } { Marked_mark(isNat(X)) > Marked_active(isNat(X)) ; } { Marked_mark(isNatList(X)) > Marked_active(isNatList(X)) ; } { Marked_mark(isNatIList(X)) > Marked_active(isNatIList(X)) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(length(cons(N,L))) > Marked_mark(U11(and(isNatList(L),isNat(N)), L)) ; } { Marked_active(U11(tt,L)) > Marked_mark(s(length(L))) ; } { Marked_active(and(tt,X)) > Marked_mark(X) ; } { Marked_active(isNat(s(V1))) > Marked_mark(isNat(V1)) ; } { Marked_active(isNat(length(V1))) > Marked_mark(isNatList(V1)) ; } { Marked_active(isNatList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatList(V2))) ; } { Marked_active(isNatList(take(V1,V2))) > Marked_mark(and(isNat(V1), isNatIList(V2))) ; } { Marked_active(isNatIList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatIList(V2))) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(nil) >= active(nil) constraint: mark(U21(X)) >= active(U21(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(isNat(X)) >= active(isNat(X)) constraint: mark(isNatList(X)) >= active(isNatList(X)) constraint: mark(isNatIList(X)) >= active(isNatIList(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) constraint: active(length(nil)) >= mark(0) constraint: active(U11(tt,L)) >= mark(s(length(L))) constraint: active(U21(tt)) >= mark(nil) constraint: active(take(0,IL)) >= mark(U21(isNatIList(IL))) constraint: active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) constraint: active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) constraint: active(and(tt,X)) >= mark(X) constraint: active(isNat(0)) >= mark(tt) constraint: active(isNat(s(V1))) >= mark(isNat(V1)) constraint: active(isNat(length(V1))) >= mark(isNatList(V1)) constraint: active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) constraint: active(isNatList(nil)) >= mark(tt) constraint: active(isNatList(take(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(zeros)) >= mark(tt) constraint: active(isNatIList(V)) >= mark(isNatList(V)) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: U11(mark(X1),X2) >= U11(X1,X2) constraint: U11(active(X1),X2) >= U11(X1,X2) constraint: U11(X1,mark(X2)) >= U11(X1,X2) constraint: U11(X1,active(X2)) >= U11(X1,X2) constraint: U21(mark(X)) >= U21(X) constraint: U21(active(X)) >= U21(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: isNat(mark(X)) >= isNat(X) constraint: isNat(active(X)) >= isNat(X) constraint: isNatList(mark(X)) >= isNatList(X) constraint: isNatList(active(X)) >= isNatList(X) constraint: isNatIList(mark(X)) >= isNatIList(X) constraint: isNatIList(active(X)) >= isNatIList(X) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) constraint: Marked_mark(U31(X1,X2,X3,X4)) >= Marked_active(U31(mark(X1), X2,X3,X4)) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) constraint: Marked_mark(isNat(X)) >= Marked_active(isNat(X)) constraint: Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) constraint: Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList( L), isNat(N)), L)) constraint: Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) constraint: Marked_active(and(tt,X)) >= Marked_mark(X) constraint: Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) constraint: Marked_active(isNat(length(V1))) >= Marked_mark(isNatList(V1)) constraint: Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and( isNat(V1), isNatList(V2))) constraint: Marked_active(isNatList(take(V1,V2))) >= Marked_mark(and( isNat(V1), isNatIList( V2))) constraint: Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and( isNat(V1), isNatIList( V2))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) ; Marked_mark(isNat(X)) >= Marked_active(isNat(X)) ; Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) ; Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList(L), isNat(N)),L)) ; Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) ; Marked_active(and(tt,X)) >= Marked_mark(X) ; Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) ; Marked_active(isNat(length(V1))) >= Marked_mark(isNatList(V1)) ; Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatList(V2))) ; Marked_active(isNatList(take(V1,V2))) >= Marked_mark(and(isNat(V1), isNatIList(V2))) ; Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatIList(V2))) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(U11(X1,X2)) > Marked_active(U11(mark(X1),X2)) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_active(and(mark(X1),X2)) ; } { Marked_mark(isNat(X)) > Marked_active(isNat(X)) ; } { Marked_mark(isNatList(X)) > Marked_active(isNatList(X)) ; } { Marked_mark(isNatIList(X)) > Marked_active(isNatIList(X)) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(length(cons(N,L))) > Marked_mark(U11(and(isNatList(L),isNat(N)), L)) ; } { Marked_active(U11(tt,L)) > Marked_mark(s(length(L))) ; } { Marked_active(and(tt,X)) > Marked_mark(X) ; } { Marked_active(isNat(s(V1))) > Marked_mark(isNat(V1)) ; } { Marked_active(isNat(length(V1))) > Marked_mark(isNatList(V1)) ; } { Marked_active(isNatList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatList(V2))) ; } { Marked_active(isNatList(take(V1,V2))) > Marked_mark(and(isNat(V1), isNatIList(V2))) ; } { Marked_active(isNatIList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatIList(V2))) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(nil) >= active(nil) constraint: mark(U21(X)) >= active(U21(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(isNat(X)) >= active(isNat(X)) constraint: mark(isNatList(X)) >= active(isNatList(X)) constraint: mark(isNatIList(X)) >= active(isNatIList(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) constraint: active(length(nil)) >= mark(0) constraint: active(U11(tt,L)) >= mark(s(length(L))) constraint: active(U21(tt)) >= mark(nil) constraint: active(take(0,IL)) >= mark(U21(isNatIList(IL))) constraint: active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) constraint: active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) constraint: active(and(tt,X)) >= mark(X) constraint: active(isNat(0)) >= mark(tt) constraint: active(isNat(s(V1))) >= mark(isNat(V1)) constraint: active(isNat(length(V1))) >= mark(isNatList(V1)) constraint: active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) constraint: active(isNatList(nil)) >= mark(tt) constraint: active(isNatList(take(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(zeros)) >= mark(tt) constraint: active(isNatIList(V)) >= mark(isNatList(V)) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: U11(mark(X1),X2) >= U11(X1,X2) constraint: U11(active(X1),X2) >= U11(X1,X2) constraint: U11(X1,mark(X2)) >= U11(X1,X2) constraint: U11(X1,active(X2)) >= U11(X1,X2) constraint: U21(mark(X)) >= U21(X) constraint: U21(active(X)) >= U21(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: isNat(mark(X)) >= isNat(X) constraint: isNat(active(X)) >= isNat(X) constraint: isNatList(mark(X)) >= isNatList(X) constraint: isNatList(active(X)) >= isNatList(X) constraint: isNatIList(mark(X)) >= isNatIList(X) constraint: isNatIList(active(X)) >= isNatIList(X) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) constraint: Marked_mark(isNat(X)) >= Marked_active(isNat(X)) constraint: Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) constraint: Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList( L), isNat(N)), L)) constraint: Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) constraint: Marked_active(and(tt,X)) >= Marked_mark(X) constraint: Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) constraint: Marked_active(isNat(length(V1))) >= Marked_mark(isNatList(V1)) constraint: Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and( isNat(V1), isNatList(V2))) constraint: Marked_active(isNatList(take(V1,V2))) >= Marked_mark(and( isNat(V1), isNatIList( V2))) constraint: Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and( isNat(V1), isNatIList( V2))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) ; Marked_mark(isNat(X)) >= Marked_active(isNat(X)) ; Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) ; Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList(L), isNat(N)),L)) ; Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) ; Marked_active(and(tt,X)) >= Marked_mark(X) ; Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) ; Marked_active(isNat(length(V1))) >= Marked_mark(isNatList(V1)) ; Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatList(V2))) ; Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatIList(V2))) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(U11(X1,X2)) > Marked_active(U11(mark(X1),X2)) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_active(and(mark(X1),X2)) ; } { Marked_mark(isNat(X)) > Marked_active(isNat(X)) ; } { Marked_mark(isNatList(X)) > Marked_active(isNatList(X)) ; } { Marked_mark(isNatIList(X)) > Marked_active(isNatIList(X)) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(length(cons(N,L))) > Marked_mark(U11(and(isNatList(L),isNat(N)), L)) ; } { Marked_active(U11(tt,L)) > Marked_mark(s(length(L))) ; } { Marked_active(and(tt,X)) > Marked_mark(X) ; } { Marked_active(isNat(s(V1))) > Marked_mark(isNat(V1)) ; } { Marked_active(isNat(length(V1))) > Marked_mark(isNatList(V1)) ; } { Marked_active(isNatList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatList(V2))) ; } { Marked_active(isNatIList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatIList(V2))) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(nil) >= active(nil) constraint: mark(U21(X)) >= active(U21(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(isNat(X)) >= active(isNat(X)) constraint: mark(isNatList(X)) >= active(isNatList(X)) constraint: mark(isNatIList(X)) >= active(isNatIList(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) constraint: active(length(nil)) >= mark(0) constraint: active(U11(tt,L)) >= mark(s(length(L))) constraint: active(U21(tt)) >= mark(nil) constraint: active(take(0,IL)) >= mark(U21(isNatIList(IL))) constraint: active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) constraint: active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) constraint: active(and(tt,X)) >= mark(X) constraint: active(isNat(0)) >= mark(tt) constraint: active(isNat(s(V1))) >= mark(isNat(V1)) constraint: active(isNat(length(V1))) >= mark(isNatList(V1)) constraint: active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) constraint: active(isNatList(nil)) >= mark(tt) constraint: active(isNatList(take(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(zeros)) >= mark(tt) constraint: active(isNatIList(V)) >= mark(isNatList(V)) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: U11(mark(X1),X2) >= U11(X1,X2) constraint: U11(active(X1),X2) >= U11(X1,X2) constraint: U11(X1,mark(X2)) >= U11(X1,X2) constraint: U11(X1,active(X2)) >= U11(X1,X2) constraint: U21(mark(X)) >= U21(X) constraint: U21(active(X)) >= U21(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: isNat(mark(X)) >= isNat(X) constraint: isNat(active(X)) >= isNat(X) constraint: isNatList(mark(X)) >= isNatList(X) constraint: isNatList(active(X)) >= isNatList(X) constraint: isNatIList(mark(X)) >= isNatIList(X) constraint: isNatIList(active(X)) >= isNatIList(X) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) constraint: Marked_mark(isNat(X)) >= Marked_active(isNat(X)) constraint: Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) constraint: Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList( L), isNat(N)), L)) constraint: Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) constraint: Marked_active(and(tt,X)) >= Marked_mark(X) constraint: Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) constraint: Marked_active(isNat(length(V1))) >= Marked_mark(isNatList(V1)) constraint: Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and( isNat(V1), isNatList(V2))) constraint: Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and( isNat(V1), isNatIList( V2))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) ; Marked_mark(isNat(X)) >= Marked_active(isNat(X)) ; Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) ; Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) ; Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList(L), isNat(N)),L)) ; Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) ; Marked_active(and(tt,X)) >= Marked_mark(X) ; Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) ; Marked_active(isNat(length(V1))) >= Marked_mark(isNatList(V1)) ; Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatList(V2))) ; Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatIList(V2))) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(U11(X1,X2)) > Marked_active(U11(mark(X1),X2)) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_active(and(mark(X1),X2)) ; } { Marked_mark(isNat(X)) > Marked_active(isNat(X)) ; } { Marked_mark(isNatList(X)) > Marked_active(isNatList(X)) ; } { Marked_mark(isNatIList(X)) > Marked_active(isNatIList(X)) ; } { Marked_active(length(cons(N,L))) > Marked_mark(U11(and(isNatList(L),isNat(N)), L)) ; } { Marked_active(U11(tt,L)) > Marked_mark(s(length(L))) ; } { Marked_active(and(tt,X)) > Marked_mark(X) ; } { Marked_active(isNat(s(V1))) > Marked_mark(isNat(V1)) ; } { Marked_active(isNat(length(V1))) > Marked_mark(isNatList(V1)) ; } { Marked_active(isNatList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatList(V2))) ; } { Marked_active(isNatIList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatIList(V2))) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(nil) >= active(nil) constraint: mark(U21(X)) >= active(U21(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(isNat(X)) >= active(isNat(X)) constraint: mark(isNatList(X)) >= active(isNatList(X)) constraint: mark(isNatIList(X)) >= active(isNatIList(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) constraint: active(length(nil)) >= mark(0) constraint: active(U11(tt,L)) >= mark(s(length(L))) constraint: active(U21(tt)) >= mark(nil) constraint: active(take(0,IL)) >= mark(U21(isNatIList(IL))) constraint: active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) constraint: active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) constraint: active(and(tt,X)) >= mark(X) constraint: active(isNat(0)) >= mark(tt) constraint: active(isNat(s(V1))) >= mark(isNat(V1)) constraint: active(isNat(length(V1))) >= mark(isNatList(V1)) constraint: active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) constraint: active(isNatList(nil)) >= mark(tt) constraint: active(isNatList(take(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(zeros)) >= mark(tt) constraint: active(isNatIList(V)) >= mark(isNatList(V)) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: U11(mark(X1),X2) >= U11(X1,X2) constraint: U11(active(X1),X2) >= U11(X1,X2) constraint: U11(X1,mark(X2)) >= U11(X1,X2) constraint: U11(X1,active(X2)) >= U11(X1,X2) constraint: U21(mark(X)) >= U21(X) constraint: U21(active(X)) >= U21(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: isNat(mark(X)) >= isNat(X) constraint: isNat(active(X)) >= isNat(X) constraint: isNatList(mark(X)) >= isNatList(X) constraint: isNatList(active(X)) >= isNatList(X) constraint: isNatIList(mark(X)) >= isNatIList(X) constraint: isNatIList(active(X)) >= isNatIList(X) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) constraint: Marked_mark(isNat(X)) >= Marked_active(isNat(X)) constraint: Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) constraint: Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) constraint: Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList( L), isNat(N)), L)) constraint: Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) constraint: Marked_active(and(tt,X)) >= Marked_mark(X) constraint: Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) constraint: Marked_active(isNat(length(V1))) >= Marked_mark(isNatList(V1)) constraint: Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and( isNat(V1), isNatList(V2))) constraint: Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and( isNat(V1), isNatIList( V2))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) ; Marked_mark(isNat(X)) >= Marked_active(isNat(X)) ; Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) ; Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) ; Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList(L), isNat(N)),L)) ; Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) ; Marked_active(and(tt,X)) >= Marked_mark(X) ; Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) ; Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatList(V2))) ; Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatIList(V2))) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(U11(X1,X2)) > Marked_active(U11(mark(X1),X2)) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_active(and(mark(X1),X2)) ; } { Marked_mark(isNat(X)) > Marked_active(isNat(X)) ; } { Marked_mark(isNatList(X)) > Marked_active(isNatList(X)) ; } { Marked_mark(isNatIList(X)) > Marked_active(isNatIList(X)) ; } { Marked_active(length(cons(N,L))) > Marked_mark(U11(and(isNatList(L),isNat(N)), L)) ; } { Marked_active(U11(tt,L)) > Marked_mark(s(length(L))) ; } { Marked_active(and(tt,X)) > Marked_mark(X) ; } { Marked_active(isNat(s(V1))) > Marked_mark(isNat(V1)) ; } { Marked_active(isNatList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatList(V2))) ; } { Marked_active(isNatIList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatIList(V2))) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(nil) >= active(nil) constraint: mark(U21(X)) >= active(U21(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(isNat(X)) >= active(isNat(X)) constraint: mark(isNatList(X)) >= active(isNatList(X)) constraint: mark(isNatIList(X)) >= active(isNatIList(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) constraint: active(length(nil)) >= mark(0) constraint: active(U11(tt,L)) >= mark(s(length(L))) constraint: active(U21(tt)) >= mark(nil) constraint: active(take(0,IL)) >= mark(U21(isNatIList(IL))) constraint: active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) constraint: active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) constraint: active(and(tt,X)) >= mark(X) constraint: active(isNat(0)) >= mark(tt) constraint: active(isNat(s(V1))) >= mark(isNat(V1)) constraint: active(isNat(length(V1))) >= mark(isNatList(V1)) constraint: active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) constraint: active(isNatList(nil)) >= mark(tt) constraint: active(isNatList(take(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(zeros)) >= mark(tt) constraint: active(isNatIList(V)) >= mark(isNatList(V)) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: U11(mark(X1),X2) >= U11(X1,X2) constraint: U11(active(X1),X2) >= U11(X1,X2) constraint: U11(X1,mark(X2)) >= U11(X1,X2) constraint: U11(X1,active(X2)) >= U11(X1,X2) constraint: U21(mark(X)) >= U21(X) constraint: U21(active(X)) >= U21(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: isNat(mark(X)) >= isNat(X) constraint: isNat(active(X)) >= isNat(X) constraint: isNatList(mark(X)) >= isNatList(X) constraint: isNatList(active(X)) >= isNatList(X) constraint: isNatIList(mark(X)) >= isNatIList(X) constraint: isNatIList(active(X)) >= isNatIList(X) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) constraint: Marked_mark(isNat(X)) >= Marked_active(isNat(X)) constraint: Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) constraint: Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) constraint: Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList( L), isNat(N)), L)) constraint: Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) constraint: Marked_active(and(tt,X)) >= Marked_mark(X) constraint: Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) constraint: Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and( isNat(V1), isNatList(V2))) constraint: Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and( isNat(V1), isNatIList( V2))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(U11(X1,X2)) >= Marked_active(U11(mark(X1),X2)) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) ; Marked_mark(isNat(X)) >= Marked_active(isNat(X)) ; Marked_mark(isNatList(X)) >= Marked_active(isNatList(X)) ; Marked_mark(isNatIList(X)) >= Marked_active(isNatIList(X)) ; Marked_active(length(cons(N,L))) >= Marked_mark(U11(and(isNatList(L), isNat(N)),L)) ; Marked_active(U11(tt,L)) >= Marked_mark(s(length(L))) ; Marked_active(and(tt,X)) >= Marked_mark(X) ; Marked_active(isNat(s(V1))) >= Marked_mark(isNat(V1)) ; Marked_active(isNatList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatList(V2))) ; Marked_active(isNatIList(cons(V1,V2))) >= Marked_mark(and(isNat(V1), isNatIList(V2))) ; } + Disjunctions:{ { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(U11(X1,X2)) > Marked_active(U11(mark(X1),X2)) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_active(and(mark(X1),X2)) ; } { Marked_mark(isNat(X)) > Marked_active(isNat(X)) ; } { Marked_mark(isNatList(X)) > Marked_active(isNatList(X)) ; } { Marked_mark(isNatIList(X)) > Marked_active(isNatIList(X)) ; } { Marked_active(length(cons(N,L))) > Marked_mark(U11(and(isNatList(L),isNat(N)), L)) ; } { Marked_active(U11(tt,L)) > Marked_mark(s(length(L))) ; } { Marked_active(and(tt,X)) > Marked_mark(X) ; } { Marked_active(isNat(s(V1))) > Marked_mark(isNat(V1)) ; } { Marked_active(isNatList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatList(V2))) ; } { Marked_active(isNatIList(cons(V1,V2))) > Marked_mark(and(isNat(V1), isNatIList(V2))) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned === 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 === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === 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) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_U31(X1,mark(X2),X3,X4) >= Marked_U31(X1,X2,X3,X4) ; Marked_U31(X1,active(X2),X3,X4) >= Marked_U31(X1,X2,X3,X4) ; Marked_U31(X1,X2,mark(X3),X4) >= Marked_U31(X1,X2,X3,X4) ; Marked_U31(X1,X2,active(X3),X4) >= Marked_U31(X1,X2,X3,X4) ; Marked_U31(X1,X2,X3,mark(X4)) >= Marked_U31(X1,X2,X3,X4) ; Marked_U31(X1,X2,X3,active(X4)) >= Marked_U31(X1,X2,X3,X4) ; } + Disjunctions:{ { Marked_U31(X1,mark(X2),X3,X4) > Marked_U31(X1,X2,X3,X4) ; } { Marked_U31(X1,active(X2),X3,X4) > Marked_U31(X1,X2,X3,X4) ; } { Marked_U31(X1,X2,mark(X3),X4) > Marked_U31(X1,X2,X3,X4) ; } { Marked_U31(X1,X2,active(X3),X4) > Marked_U31(X1,X2,X3,X4) ; } { Marked_U31(X1,X2,X3,mark(X4)) > Marked_U31(X1,X2,X3,X4) ; } { Marked_U31(X1,X2,X3,active(X4)) > Marked_U31(X1,X2,X3,X4) ; } } === 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(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(nil) >= active(nil) constraint: mark(U21(X)) >= active(U21(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(isNat(X)) >= active(isNat(X)) constraint: mark(isNatList(X)) >= active(isNatList(X)) constraint: mark(isNatIList(X)) >= active(isNatIList(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) constraint: active(length(nil)) >= mark(0) constraint: active(U11(tt,L)) >= mark(s(length(L))) constraint: active(U21(tt)) >= mark(nil) constraint: active(take(0,IL)) >= mark(U21(isNatIList(IL))) constraint: active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) constraint: active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) constraint: active(and(tt,X)) >= mark(X) constraint: active(isNat(0)) >= mark(tt) constraint: active(isNat(s(V1))) >= mark(isNat(V1)) constraint: active(isNat(length(V1))) >= mark(isNatList(V1)) constraint: active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) constraint: active(isNatList(nil)) >= mark(tt) constraint: active(isNatList(take(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(zeros)) >= mark(tt) constraint: active(isNatIList(V)) >= mark(isNatList(V)) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: U11(mark(X1),X2) >= U11(X1,X2) constraint: U11(active(X1),X2) >= U11(X1,X2) constraint: U11(X1,mark(X2)) >= U11(X1,X2) constraint: U11(X1,active(X2)) >= U11(X1,X2) constraint: U21(mark(X)) >= U21(X) constraint: U21(active(X)) >= U21(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: isNat(mark(X)) >= isNat(X) constraint: isNat(active(X)) >= isNat(X) constraint: isNatList(mark(X)) >= isNatList(X) constraint: isNatList(active(X)) >= isNatList(X) constraint: isNatIList(mark(X)) >= isNatIList(X) constraint: isNatIList(active(X)) >= isNatIList(X) constraint: Marked_U31(X1,mark(X2),X3,X4) >= Marked_U31(X1,X2,X3,X4) constraint: Marked_U31(X1,active(X2),X3,X4) >= Marked_U31(X1,X2,X3,X4) constraint: Marked_U31(X1,X2,mark(X3),X4) >= Marked_U31(X1,X2,X3,X4) constraint: Marked_U31(X1,X2,active(X3),X4) >= Marked_U31(X1,X2,X3,X4) constraint: Marked_U31(X1,X2,X3,mark(X4)) >= Marked_U31(X1,X2,X3,X4) constraint: Marked_U31(X1,X2,X3,active(X4)) >= Marked_U31(X1,X2,X3,X4) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(s(X)) >= active(s(mark(X))) ; mark(length(X)) >= active(length(mark(X))) ; mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(nil) >= active(nil) ; mark(U21(X)) >= active(U21(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(isNat(X)) >= active(isNat(X)) ; mark(isNatList(X)) >= active(isNatList(X)) ; mark(isNatIList(X)) >= active(isNatIList(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) ; active(length(nil)) >= mark(0) ; active(U11(tt,L)) >= mark(s(length(L))) ; active(U21(tt)) >= mark(nil) ; active(take(0,IL)) >= mark(U21(isNatIList(IL))) ; active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) ; active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) ; active(and(tt,X)) >= mark(X) ; active(isNat(0)) >= mark(tt) ; active(isNat(s(V1))) >= mark(isNat(V1)) ; active(isNat(length(V1))) >= mark(isNatList(V1)) ; active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) ; active(isNatList(nil)) >= mark(tt) ; active(isNatList(take(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1),isNatIList(V2))) ; active(isNatIList(zeros)) >= mark(tt) ; active(isNatIList(V)) >= mark(isNatList(V)) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; U11(mark(X1),X2) >= U11(X1,X2) ; U11(active(X1),X2) >= U11(X1,X2) ; U11(X1,mark(X2)) >= U11(X1,X2) ; U11(X1,active(X2)) >= U11(X1,X2) ; U21(mark(X)) >= U21(X) ; U21(active(X)) >= U21(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) ; U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; isNat(mark(X)) >= isNat(X) ; isNat(active(X)) >= isNat(X) ; isNatList(mark(X)) >= isNatList(X) ; isNatList(active(X)) >= isNatList(X) ; isNatIList(mark(X)) >= isNatIList(X) ; isNatIList(active(X)) >= isNatIList(X) ; Marked_U31(X1,mark(X2),X3,X4) >= Marked_U31(X1,X2,X3,X4) ; Marked_U31(X1,active(X2),X3,X4) >= Marked_U31(X1,X2,X3,X4) ; Marked_U31(X1,X2,mark(X3),X4) >= Marked_U31(X1,X2,X3,X4) ; Marked_U31(X1,X2,active(X3),X4) >= Marked_U31(X1,X2,X3,X4) ; } + Disjunctions:{ { Marked_U31(X1,mark(X2),X3,X4) > Marked_U31(X1,X2,X3,X4) ; } { Marked_U31(X1,active(X2),X3,X4) > Marked_U31(X1,X2,X3,X4) ; } { Marked_U31(X1,X2,mark(X3),X4) > Marked_U31(X1,X2,X3,X4) ; } { Marked_U31(X1,X2,active(X3),X4) > Marked_U31(X1,X2,X3,X4) ; } } === 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(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(U11(X1,X2)) >= active(U11(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(nil) >= active(nil) constraint: mark(U21(X)) >= active(U21(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(U31(X1,X2,X3,X4)) >= active(U31(mark(X1),X2,X3,X4)) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(isNat(X)) >= active(isNat(X)) constraint: mark(isNatList(X)) >= active(isNatList(X)) constraint: mark(isNatIList(X)) >= active(isNatIList(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(length(cons(N,L))) >= mark(U11(and(isNatList(L),isNat(N)),L)) constraint: active(length(nil)) >= mark(0) constraint: active(U11(tt,L)) >= mark(s(length(L))) constraint: active(U21(tt)) >= mark(nil) constraint: active(take(0,IL)) >= mark(U21(isNatIList(IL))) constraint: active(take(s(M),cons(N,IL))) >= mark(U31(and(isNatIList(IL), and(isNat(M),isNat(N))), IL,M,N)) constraint: active(U31(tt,IL,M,N)) >= mark(cons(N,take(M,IL))) constraint: active(and(tt,X)) >= mark(X) constraint: active(isNat(0)) >= mark(tt) constraint: active(isNat(s(V1))) >= mark(isNat(V1)) constraint: active(isNat(length(V1))) >= mark(isNatList(V1)) constraint: active(isNatList(cons(V1,V2))) >= mark(and(isNat(V1),isNatList(V2))) constraint: active(isNatList(nil)) >= mark(tt) constraint: active(isNatList(take(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(cons(V1,V2))) >= mark(and(isNat(V1), isNatIList(V2))) constraint: active(isNatIList(zeros)) >= mark(tt) constraint: active(isNatIList(V)) >= mark(isNatList(V)) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: U11(mark(X1),X2) >= U11(X1,X2) constraint: U11(active(X1),X2) >= U11(X1,X2) constraint: U11(X1,mark(X2)) >= U11(X1,X2) constraint: U11(X1,active(X2)) >= U11(X1,X2) constraint: U21(mark(X)) >= U21(X) constraint: U21(active(X)) >= U21(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: U31(mark(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(active(X1),X2,X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,mark(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,active(X2),X3,X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,mark(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,active(X3),X4) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,mark(X4)) >= U31(X1,X2,X3,X4) constraint: U31(X1,X2,X3,active(X4)) >= U31(X1,X2,X3,X4) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: isNat(mark(X)) >= isNat(X) constraint: isNat(active(X)) >= isNat(X) constraint: isNatList(mark(X)) >= isNatList(X) constraint: isNatList(active(X)) >= isNatList(X) constraint: isNatIList(mark(X)) >= isNatIList(X) constraint: isNatIList(active(X)) >= isNatIList(X) constraint: Marked_U31(X1,mark(X2),X3,X4) >= Marked_U31(X1,X2,X3,X4) constraint: Marked_U31(X1,active(X2),X3,X4) >= Marked_U31(X1,X2,X3,X4) constraint: Marked_U31(X1,X2,mark(X3),X4) >= Marked_U31(X1,X2,X3,X4) constraint: Marked_U31(X1,X2,active(X3),X4) >= Marked_U31(X1,X2,X3,X4) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: NOT SOLVED No proof found Cime worked for 196.021330 seconds (real time) Cime Exit Status: 0