- : unit = () - : 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(and(tt,X)) -> mark(X) [4] active(isNat(0)) -> mark(tt) [5] active(isNat(length(V1))) -> mark(isNatList(V1)) [6] active(isNat(s(V1))) -> mark(isNat(V1)) [7] active(isNatIList(V)) -> mark(isNatList(V)) [8] active(isNatIList(zeros)) -> mark(tt) [9] active(isNatIList(cons(V1,V2))) -> mark(and(isNat(V1),isNatIList(V2))) [10] active(isNatList(nil)) -> mark(tt) [11] active(isNatList(cons(V1,V2))) -> mark(and(isNat(V1),isNatList(V2))) [12] active(length(nil)) -> mark(0) [13] active(length(cons(N,L))) -> mark(U11(and(isNatList(L),isNat(N)),L)) [14] mark(zeros) -> active(zeros) [15] mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) [16] mark(0) -> active(0) [17] mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) [18] mark(tt) -> active(tt) [19] mark(s(X)) -> active(s(mark(X))) [20] mark(length(X)) -> active(length(mark(X))) [21] mark(and(X1,X2)) -> active(and(mark(X1),X2)) [22] mark(isNat(X)) -> active(isNat(X)) [23] mark(isNatList(X)) -> active(isNatList(X)) [24] mark(isNatIList(X)) -> active(isNatIList(X)) [25] mark(nil) -> active(nil) [26] cons(mark(X1),X2) -> cons(X1,X2) [27] cons(X1,mark(X2)) -> cons(X1,X2) [28] cons(active(X1),X2) -> cons(X1,X2) [29] cons(X1,active(X2)) -> cons(X1,X2) [30] U11(mark(X1),X2) -> U11(X1,X2) [31] U11(X1,mark(X2)) -> U11(X1,X2) [32] U11(active(X1),X2) -> U11(X1,X2) [33] U11(X1,active(X2)) -> U11(X1,X2) [34] s(mark(X)) -> s(X) [35] s(active(X)) -> s(X) [36] length(mark(X)) -> length(X) [37] length(active(X)) -> length(X) [38] and(mark(X1),X2) -> and(X1,X2) [39] and(X1,mark(X2)) -> and(X1,X2) [40] and(active(X1),X2) -> and(X1,X2) [41] and(X1,active(X2)) -> and(X1,X2) [42] isNat(mark(X)) -> isNat(X) [43] isNat(active(X)) -> isNat(X) [44] isNatList(mark(X)) -> isNatList(X) [45] isNatList(active(X)) -> isNatList(X) [46] isNatIList(mark(X)) -> isNatIList(X) [47] isNatIList(active(X)) -> isNatIList(X) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 9 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> } APPLY CRITERIA (Subterm criterion) 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(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)) ; mark(nil) >= active(nil) ; 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(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(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) ; 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(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))) ; 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(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))) ; } { 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(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: mark(nil) >= active(nil) 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(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(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: 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(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))) constraint: Marked_active(isNatIList(V)) >= Marked_mark(isNatList(V)) APPLY CRITERIA (Subterm criterion) ST: Marked_cons -> 2 APPLY CRITERIA (Subterm criterion) ST: Marked_U11 -> 2 APPLY CRITERIA (Subterm criterion) ST: Marked_s -> 1 APPLY CRITERIA (Subterm criterion) ST: Marked_length -> 1 APPLY CRITERIA (Subterm criterion) ST: Marked_and -> 2 APPLY CRITERIA (Subterm criterion) ST: Marked_isNat -> 1 APPLY CRITERIA (Subterm criterion) ST: Marked_isNatList -> 1 APPLY CRITERIA (Subterm criterion) ST: Marked_isNatIList -> 1 APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) 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(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)) ; mark(nil) >= active(nil) ; 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(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(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) ; 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(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(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))) ; 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(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(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))) ; } { 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(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: mark(nil) >= active(nil) 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(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(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: 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(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(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))) constraint: Marked_active(isNatIList(V)) >= Marked_mark(isNatList(V)) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) 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(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)) ; mark(nil) >= active(nil) ; 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(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(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) ; 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(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))) ; 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(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))) ; } { 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(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: mark(nil) >= active(nil) 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(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(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: 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(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))) constraint: Marked_active(isNatIList(V)) >= Marked_mark(isNatList(V)) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) 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(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)) ; mark(nil) >= active(nil) ; 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(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(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) ; 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(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_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(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(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: mark(nil) >= active(nil) 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(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(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: 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(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 (Subterm criterion) 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(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)) ; mark(nil) >= active(nil) ; 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(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(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) ; 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(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: mark(nil) >= active(nil) 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(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(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: 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 (Subterm criterion) 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(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)) ; mark(nil) >= active(nil) ; 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(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(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) ; 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(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: mark(nil) >= active(nil) 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(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(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: 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 (Subterm criterion) 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(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)) ; mark(nil) >= active(nil) ; 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(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(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) ; 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(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: mark(nil) >= active(nil) 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(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(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: 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 (Subterm criterion) 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(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)) ; mark(nil) >= active(nil) ; 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(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(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) ; 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 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(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: mark(nil) >= active(nil) 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(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(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: 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(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 (Subterm criterion) 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(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)) ; mark(nil) >= active(nil) ; 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(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(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) ; 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))) ; } + 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))) ; } } === 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(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: mark(nil) >= active(nil) 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(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(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: 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(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))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) 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(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)) ; mark(nil) >= active(nil) ; 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(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(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) ; 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_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))) ; } + 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_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))) ; } } === 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 : 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 (Simple graph) Found 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(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)) ; mark(nil) >= active(nil) ; 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(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(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) ; 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_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))) ; } APPLY CRITERIA (SOLVE_ORD) 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(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)) ; mark(nil) >= active(nil) ; 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(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(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) ; 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_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))) ; } + Disjunctions:{ } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === No solution found for these parameters.(3028 bt (3573) [786]) === 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 1 components: { --> --> --> --> } APPLY CRITERIA (Subterm criterion) ST: Marked_cons -> 1 APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Subterm criterion) ST: Marked_U11 -> 1 APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Subterm criterion) ST: Marked_and -> 1 APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: NOT SOLVED No proof found Cime worked for 153.104588 seconds (real time) Cime Exit Status: 0