- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) [2] active(fst(pair(XS,YS))) -> mark(XS) [3] active(snd(pair(XS,YS))) -> mark(YS) [4] active(splitAt(0,XS)) -> mark(pair(nil,XS)) [5] active(splitAt(s(N),cons(X,XS))) -> mark(u(splitAt(N,XS),N,X,XS)) [6] active(u(pair(YS,ZS),N,X,XS)) -> mark(pair(cons(X,YS),ZS)) [7] active(head(cons(N,XS))) -> mark(N) [8] active(tail(cons(N,XS))) -> mark(XS) [9] active(sel(N,XS)) -> mark(head(afterNth(N,XS))) [10] active(take(N,XS)) -> mark(fst(splitAt(N,XS))) [11] active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) [12] mark(natsFrom(X)) -> active(natsFrom(mark(X))) [13] mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) [14] mark(s(X)) -> active(s(mark(X))) [15] mark(fst(X)) -> active(fst(mark(X))) [16] mark(pair(X1,X2)) -> active(pair(mark(X1),mark(X2))) [17] mark(snd(X)) -> active(snd(mark(X))) [18] mark(splitAt(X1,X2)) -> active(splitAt(mark(X1),mark(X2))) [19] mark(0) -> active(0) [20] mark(nil) -> active(nil) [21] mark(u(X1,X2,X3,X4)) -> active(u(mark(X1),X2,X3,X4)) [22] mark(head(X)) -> active(head(mark(X))) [23] mark(tail(X)) -> active(tail(mark(X))) [24] mark(sel(X1,X2)) -> active(sel(mark(X1),mark(X2))) [25] mark(afterNth(X1,X2)) -> active(afterNth(mark(X1),mark(X2))) [26] mark(take(X1,X2)) -> active(take(mark(X1),mark(X2))) [27] natsFrom(mark(X)) -> natsFrom(X) [28] natsFrom(active(X)) -> natsFrom(X) [29] cons(mark(X1),X2) -> cons(X1,X2) [30] cons(X1,mark(X2)) -> cons(X1,X2) [31] cons(active(X1),X2) -> cons(X1,X2) [32] cons(X1,active(X2)) -> cons(X1,X2) [33] s(mark(X)) -> s(X) [34] s(active(X)) -> s(X) [35] fst(mark(X)) -> fst(X) [36] fst(active(X)) -> fst(X) [37] pair(mark(X1),X2) -> pair(X1,X2) [38] pair(X1,mark(X2)) -> pair(X1,X2) [39] pair(active(X1),X2) -> pair(X1,X2) [40] pair(X1,active(X2)) -> pair(X1,X2) [41] snd(mark(X)) -> snd(X) [42] snd(active(X)) -> snd(X) [43] splitAt(mark(X1),X2) -> splitAt(X1,X2) [44] splitAt(X1,mark(X2)) -> splitAt(X1,X2) [45] splitAt(active(X1),X2) -> splitAt(X1,X2) [46] splitAt(X1,active(X2)) -> splitAt(X1,X2) [47] u(mark(X1),X2,X3,X4) -> u(X1,X2,X3,X4) [48] u(X1,mark(X2),X3,X4) -> u(X1,X2,X3,X4) [49] u(X1,X2,mark(X3),X4) -> u(X1,X2,X3,X4) [50] u(X1,X2,X3,mark(X4)) -> u(X1,X2,X3,X4) [51] u(active(X1),X2,X3,X4) -> u(X1,X2,X3,X4) [52] u(X1,active(X2),X3,X4) -> u(X1,X2,X3,X4) [53] u(X1,X2,active(X3),X4) -> u(X1,X2,X3,X4) [54] u(X1,X2,X3,active(X4)) -> u(X1,X2,X3,X4) [55] head(mark(X)) -> head(X) [56] head(active(X)) -> head(X) [57] tail(mark(X)) -> tail(X) [58] tail(active(X)) -> tail(X) [59] sel(mark(X1),X2) -> sel(X1,X2) [60] sel(X1,mark(X2)) -> sel(X1,X2) [61] sel(active(X1),X2) -> sel(X1,X2) [62] sel(X1,active(X2)) -> sel(X1,X2) [63] afterNth(mark(X1),X2) -> afterNth(X1,X2) [64] afterNth(X1,mark(X2)) -> afterNth(X1,X2) [65] afterNth(active(X1),X2) -> afterNth(X1,X2) [66] afterNth(X1,active(X2)) -> afterNth(X1,X2) [67] take(mark(X1),X2) -> take(X1,X2) [68] take(X1,mark(X2)) -> take(X1,X2) [69] take(active(X1),X2) -> take(X1,X2) [70] take(X1,active(X2)) -> take(X1,X2) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 14 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(natsFrom(X)) >= active(natsFrom(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(fst(X)) >= active(fst(mark(X))) ; mark(pair(X1,X2)) >= active(pair(mark(X1),mark(X2))) ; mark(snd(X)) >= active(snd(mark(X))) ; mark(nil) >= active(nil) ; mark(splitAt(X1,X2)) >= active(splitAt(mark(X1),mark(X2))) ; mark(0) >= active(0) ; mark(u(X1,X2,X3,X4)) >= active(u(mark(X1),X2,X3,X4)) ; mark(head(X)) >= active(head(mark(X))) ; mark(tail(X)) >= active(tail(mark(X))) ; mark(afterNth(X1,X2)) >= active(afterNth(mark(X1),mark(X2))) ; mark(sel(X1,X2)) >= active(sel(mark(X1),mark(X2))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; 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) ; natsFrom(mark(X)) >= natsFrom(X) ; natsFrom(active(X)) >= natsFrom(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; active(natsFrom(N)) >= mark(cons(N,natsFrom(s(N)))) ; active(fst(pair(XS,YS))) >= mark(XS) ; active(snd(pair(XS,YS))) >= mark(YS) ; active(splitAt(s(N),cons(X,XS))) >= mark(u(splitAt(N,XS),N,X,XS)) ; active(splitAt(0,XS)) >= mark(pair(nil,XS)) ; active(u(pair(YS,ZS),N,X,XS)) >= mark(pair(cons(X,YS),ZS)) ; active(head(cons(N,XS))) >= mark(N) ; active(tail(cons(N,XS))) >= mark(XS) ; active(afterNth(N,XS)) >= mark(snd(splitAt(N,XS))) ; active(sel(N,XS)) >= mark(head(afterNth(N,XS))) ; active(take(N,XS)) >= mark(fst(splitAt(N,XS))) ; fst(mark(X)) >= fst(X) ; fst(active(X)) >= fst(X) ; pair(mark(X1),X2) >= pair(X1,X2) ; pair(active(X1),X2) >= pair(X1,X2) ; pair(X1,mark(X2)) >= pair(X1,X2) ; pair(X1,active(X2)) >= pair(X1,X2) ; snd(mark(X)) >= snd(X) ; snd(active(X)) >= snd(X) ; splitAt(mark(X1),X2) >= splitAt(X1,X2) ; splitAt(active(X1),X2) >= splitAt(X1,X2) ; splitAt(X1,mark(X2)) >= splitAt(X1,X2) ; splitAt(X1,active(X2)) >= splitAt(X1,X2) ; u(mark(X1),X2,X3,X4) >= u(X1,X2,X3,X4) ; u(active(X1),X2,X3,X4) >= u(X1,X2,X3,X4) ; u(X1,mark(X2),X3,X4) >= u(X1,X2,X3,X4) ; u(X1,active(X2),X3,X4) >= u(X1,X2,X3,X4) ; u(X1,X2,mark(X3),X4) >= u(X1,X2,X3,X4) ; u(X1,X2,active(X3),X4) >= u(X1,X2,X3,X4) ; u(X1,X2,X3,mark(X4)) >= u(X1,X2,X3,X4) ; u(X1,X2,X3,active(X4)) >= u(X1,X2,X3,X4) ; head(mark(X)) >= head(X) ; head(active(X)) >= head(X) ; tail(mark(X)) >= tail(X) ; tail(active(X)) >= tail(X) ; afterNth(mark(X1),X2) >= afterNth(X1,X2) ; afterNth(active(X1),X2) >= afterNth(X1,X2) ; afterNth(X1,mark(X2)) >= afterNth(X1,X2) ; afterNth(X1,active(X2)) >= afterNth(X1,X2) ; sel(mark(X1),X2) >= sel(X1,X2) ; sel(active(X1),X2) >= sel(X1,X2) ; sel(X1,mark(X2)) >= sel(X1,X2) ; sel(X1,active(X2)) >= sel(X1,X2) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(cons(X1,X2)) >= Marked_active(cons(mark(X1),X2)) ; Marked_mark(natsFrom(X)) >= Marked_mark(X) ; Marked_mark(natsFrom(X)) >= Marked_active(natsFrom(mark(X))) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(s(X)) >= Marked_active(s(mark(X))) ; Marked_mark(fst(X)) >= Marked_mark(X) ; Marked_mark(fst(X)) >= Marked_active(fst(mark(X))) ; Marked_mark(pair(X1,X2)) >= Marked_mark(X1) ; Marked_mark(pair(X1,X2)) >= Marked_mark(X2) ; Marked_mark(pair(X1,X2)) >= Marked_active(pair(mark(X1),mark(X2))) ; Marked_mark(snd(X)) >= Marked_mark(X) ; Marked_mark(snd(X)) >= Marked_active(snd(mark(X))) ; Marked_mark(splitAt(X1,X2)) >= Marked_mark(X1) ; Marked_mark(splitAt(X1,X2)) >= Marked_mark(X2) ; Marked_mark(splitAt(X1,X2)) >= Marked_active(splitAt(mark(X1),mark(X2))) ; Marked_mark(u(X1,X2,X3,X4)) >= Marked_mark(X1) ; Marked_mark(u(X1,X2,X3,X4)) >= Marked_active(u(mark(X1),X2,X3,X4)) ; Marked_mark(head(X)) >= Marked_mark(X) ; Marked_mark(head(X)) >= Marked_active(head(mark(X))) ; Marked_mark(tail(X)) >= Marked_mark(X) ; Marked_mark(tail(X)) >= Marked_active(tail(mark(X))) ; Marked_mark(afterNth(X1,X2)) >= Marked_mark(X1) ; Marked_mark(afterNth(X1,X2)) >= Marked_mark(X2) ; Marked_mark(afterNth(X1,X2)) >= Marked_active(afterNth(mark(X1),mark(X2))) ; Marked_mark(sel(X1,X2)) >= Marked_mark(X1) ; Marked_mark(sel(X1,X2)) >= Marked_mark(X2) ; Marked_mark(sel(X1,X2)) >= Marked_active(sel(mark(X1),mark(X2))) ; Marked_mark(take(X1,X2)) >= Marked_mark(X1) ; Marked_mark(take(X1,X2)) >= Marked_mark(X2) ; Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) ; Marked_active(natsFrom(N)) >= Marked_mark(cons(N,natsFrom(s(N)))) ; Marked_active(fst(pair(XS,YS))) >= Marked_mark(XS) ; Marked_active(snd(pair(XS,YS))) >= Marked_mark(YS) ; Marked_active(splitAt(s(N),cons(X,XS))) >= Marked_mark(u(splitAt(N,XS), N,X,XS)) ; Marked_active(splitAt(0,XS)) >= Marked_mark(pair(nil,XS)) ; Marked_active(u(pair(YS,ZS),N,X,XS)) >= Marked_mark(pair(cons(X,YS),ZS)) ; Marked_active(head(cons(N,XS))) >= Marked_mark(N) ; Marked_active(tail(cons(N,XS))) >= Marked_mark(XS) ; Marked_active(afterNth(N,XS)) >= Marked_mark(snd(splitAt(N,XS))) ; Marked_active(sel(N,XS)) >= Marked_mark(head(afterNth(N,XS))) ; Marked_active(take(N,XS)) >= Marked_mark(fst(splitAt(N,XS))) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(cons(X1,X2)) > Marked_active(cons(mark(X1),X2)) ; } { Marked_mark(natsFrom(X)) > Marked_mark(X) ; } { Marked_mark(natsFrom(X)) > Marked_active(natsFrom(mark(X))) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(s(X)) > Marked_active(s(mark(X))) ; } { Marked_mark(fst(X)) > Marked_mark(X) ; } { Marked_mark(fst(X)) > Marked_active(fst(mark(X))) ; } { Marked_mark(pair(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(pair(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(pair(X1,X2)) > Marked_active(pair(mark(X1),mark(X2))) ; } { Marked_mark(snd(X)) > Marked_mark(X) ; } { Marked_mark(snd(X)) > Marked_active(snd(mark(X))) ; } { Marked_mark(splitAt(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(splitAt(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(splitAt(X1,X2)) > Marked_active(splitAt(mark(X1),mark(X2))) ; } { Marked_mark(u(X1,X2,X3,X4)) > Marked_mark(X1) ; } { Marked_mark(u(X1,X2,X3,X4)) > Marked_active(u(mark(X1),X2,X3,X4)) ; } { Marked_mark(head(X)) > Marked_mark(X) ; } { Marked_mark(head(X)) > Marked_active(head(mark(X))) ; } { Marked_mark(tail(X)) > Marked_mark(X) ; } { Marked_mark(tail(X)) > Marked_active(tail(mark(X))) ; } { Marked_mark(afterNth(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(afterNth(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(afterNth(X1,X2)) > Marked_active(afterNth(mark(X1),mark(X2))) ; } { Marked_mark(sel(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(sel(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(sel(X1,X2)) > Marked_active(sel(mark(X1),mark(X2))) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(take(X1,X2)) > Marked_active(take(mark(X1),mark(X2))) ; } { Marked_active(natsFrom(N)) > Marked_mark(cons(N,natsFrom(s(N)))) ; } { Marked_active(fst(pair(XS,YS))) > Marked_mark(XS) ; } { Marked_active(snd(pair(XS,YS))) > Marked_mark(YS) ; } { Marked_active(splitAt(s(N),cons(X,XS))) > Marked_mark(u(splitAt(N,XS),N,X,XS)) ; } { Marked_active(splitAt(0,XS)) > Marked_mark(pair(nil,XS)) ; } { Marked_active(u(pair(YS,ZS),N,X,XS)) > Marked_mark(pair(cons(X,YS),ZS)) ; } { Marked_active(head(cons(N,XS))) > Marked_mark(N) ; } { Marked_active(tail(cons(N,XS))) > Marked_mark(XS) ; } { Marked_active(afterNth(N,XS)) > Marked_mark(snd(splitAt(N,XS))) ; } { Marked_active(sel(N,XS)) > Marked_mark(head(afterNth(N,XS))) ; } { Marked_active(take(N,XS)) > Marked_mark(fst(splitAt(N,XS))) ; } } === 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(natsFrom(X)) >= active(natsFrom(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(fst(X)) >= active(fst(mark(X))) constraint: mark(pair(X1,X2)) >= active(pair(mark(X1),mark(X2))) constraint: mark(snd(X)) >= active(snd(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(splitAt(X1,X2)) >= active(splitAt(mark(X1),mark(X2))) constraint: mark(0) >= active(0) constraint: mark(u(X1,X2,X3,X4)) >= active(u(mark(X1),X2,X3,X4)) constraint: mark(head(X)) >= active(head(mark(X))) constraint: mark(tail(X)) >= active(tail(mark(X))) constraint: mark(afterNth(X1,X2)) >= active(afterNth(mark(X1),mark(X2))) constraint: mark(sel(X1,X2)) >= active(sel(mark(X1),mark(X2))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) 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: natsFrom(mark(X)) >= natsFrom(X) constraint: natsFrom(active(X)) >= natsFrom(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: active(natsFrom(N)) >= mark(cons(N,natsFrom(s(N)))) constraint: active(fst(pair(XS,YS))) >= mark(XS) constraint: active(snd(pair(XS,YS))) >= mark(YS) constraint: active(splitAt(s(N),cons(X,XS))) >= mark(u(splitAt(N,XS),N,X,XS)) constraint: active(splitAt(0,XS)) >= mark(pair(nil,XS)) constraint: active(u(pair(YS,ZS),N,X,XS)) >= mark(pair(cons(X,YS),ZS)) constraint: active(head(cons(N,XS))) >= mark(N) constraint: active(tail(cons(N,XS))) >= mark(XS) constraint: active(afterNth(N,XS)) >= mark(snd(splitAt(N,XS))) constraint: active(sel(N,XS)) >= mark(head(afterNth(N,XS))) constraint: active(take(N,XS)) >= mark(fst(splitAt(N,XS))) constraint: fst(mark(X)) >= fst(X) constraint: fst(active(X)) >= fst(X) constraint: pair(mark(X1),X2) >= pair(X1,X2) constraint: pair(active(X1),X2) >= pair(X1,X2) constraint: pair(X1,mark(X2)) >= pair(X1,X2) constraint: pair(X1,active(X2)) >= pair(X1,X2) constraint: snd(mark(X)) >= snd(X) constraint: snd(active(X)) >= snd(X) constraint: splitAt(mark(X1),X2) >= splitAt(X1,X2) constraint: splitAt(active(X1),X2) >= splitAt(X1,X2) constraint: splitAt(X1,mark(X2)) >= splitAt(X1,X2) constraint: splitAt(X1,active(X2)) >= splitAt(X1,X2) constraint: u(mark(X1),X2,X3,X4) >= u(X1,X2,X3,X4) constraint: u(active(X1),X2,X3,X4) >= u(X1,X2,X3,X4) constraint: u(X1,mark(X2),X3,X4) >= u(X1,X2,X3,X4) constraint: u(X1,active(X2),X3,X4) >= u(X1,X2,X3,X4) constraint: u(X1,X2,mark(X3),X4) >= u(X1,X2,X3,X4) constraint: u(X1,X2,active(X3),X4) >= u(X1,X2,X3,X4) constraint: u(X1,X2,X3,mark(X4)) >= u(X1,X2,X3,X4) constraint: u(X1,X2,X3,active(X4)) >= u(X1,X2,X3,X4) constraint: head(mark(X)) >= head(X) constraint: head(active(X)) >= head(X) constraint: tail(mark(X)) >= tail(X) constraint: tail(active(X)) >= tail(X) constraint: afterNth(mark(X1),X2) >= afterNth(X1,X2) constraint: afterNth(active(X1),X2) >= afterNth(X1,X2) constraint: afterNth(X1,mark(X2)) >= afterNth(X1,X2) constraint: afterNth(X1,active(X2)) >= afterNth(X1,X2) constraint: sel(mark(X1),X2) >= sel(X1,X2) constraint: sel(active(X1),X2) >= sel(X1,X2) constraint: sel(X1,mark(X2)) >= sel(X1,X2) constraint: sel(X1,active(X2)) >= sel(X1,X2) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(cons(X1,X2)) >= Marked_active(cons(mark(X1),X2)) constraint: Marked_mark(natsFrom(X)) >= Marked_mark(X) constraint: Marked_mark(natsFrom(X)) >= Marked_active(natsFrom(mark(X))) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(s(X)) >= Marked_active(s(mark(X))) constraint: Marked_mark(fst(X)) >= Marked_mark(X) constraint: Marked_mark(fst(X)) >= Marked_active(fst(mark(X))) constraint: Marked_mark(pair(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(pair(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(pair(X1,X2)) >= Marked_active(pair(mark(X1),mark(X2))) constraint: Marked_mark(snd(X)) >= Marked_mark(X) constraint: Marked_mark(snd(X)) >= Marked_active(snd(mark(X))) constraint: Marked_mark(splitAt(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(splitAt(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(splitAt(X1,X2)) >= Marked_active(splitAt(mark(X1), mark(X2))) constraint: Marked_mark(u(X1,X2,X3,X4)) >= Marked_mark(X1) constraint: Marked_mark(u(X1,X2,X3,X4)) >= Marked_active(u(mark(X1),X2,X3,X4)) constraint: Marked_mark(head(X)) >= Marked_mark(X) constraint: Marked_mark(head(X)) >= Marked_active(head(mark(X))) constraint: Marked_mark(tail(X)) >= Marked_mark(X) constraint: Marked_mark(tail(X)) >= Marked_active(tail(mark(X))) constraint: Marked_mark(afterNth(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(afterNth(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(afterNth(X1,X2)) >= Marked_active(afterNth(mark(X1), mark(X2))) constraint: Marked_mark(sel(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(sel(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(sel(X1,X2)) >= Marked_active(sel(mark(X1),mark(X2))) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) constraint: Marked_active(natsFrom(N)) >= Marked_mark(cons(N,natsFrom(s(N)))) constraint: Marked_active(fst(pair(XS,YS))) >= Marked_mark(XS) constraint: Marked_active(snd(pair(XS,YS))) >= Marked_mark(YS) constraint: Marked_active(splitAt(s(N),cons(X,XS))) >= Marked_mark(u( splitAt( N, XS), N, X, XS)) constraint: Marked_active(splitAt(0,XS)) >= Marked_mark(pair(nil,XS)) constraint: Marked_active(u(pair(YS,ZS),N,X,XS)) >= Marked_mark(pair( cons(X,YS), ZS)) constraint: Marked_active(head(cons(N,XS))) >= Marked_mark(N) constraint: Marked_active(tail(cons(N,XS))) >= Marked_mark(XS) constraint: Marked_active(afterNth(N,XS)) >= Marked_mark(snd(splitAt(N,XS))) constraint: Marked_active(sel(N,XS)) >= Marked_mark(head(afterNth(N,XS))) constraint: Marked_active(take(N,XS)) >= Marked_mark(fst(splitAt(N,XS))) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(natsFrom(X)) >= active(natsFrom(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(fst(X)) >= active(fst(mark(X))) ; mark(pair(X1,X2)) >= active(pair(mark(X1),mark(X2))) ; mark(snd(X)) >= active(snd(mark(X))) ; mark(nil) >= active(nil) ; mark(splitAt(X1,X2)) >= active(splitAt(mark(X1),mark(X2))) ; mark(0) >= active(0) ; mark(u(X1,X2,X3,X4)) >= active(u(mark(X1),X2,X3,X4)) ; mark(head(X)) >= active(head(mark(X))) ; mark(tail(X)) >= active(tail(mark(X))) ; mark(afterNth(X1,X2)) >= active(afterNth(mark(X1),mark(X2))) ; mark(sel(X1,X2)) >= active(sel(mark(X1),mark(X2))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; 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) ; natsFrom(mark(X)) >= natsFrom(X) ; natsFrom(active(X)) >= natsFrom(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; active(natsFrom(N)) >= mark(cons(N,natsFrom(s(N)))) ; active(fst(pair(XS,YS))) >= mark(XS) ; active(snd(pair(XS,YS))) >= mark(YS) ; active(splitAt(s(N),cons(X,XS))) >= mark(u(splitAt(N,XS),N,X,XS)) ; active(splitAt(0,XS)) >= mark(pair(nil,XS)) ; active(u(pair(YS,ZS),N,X,XS)) >= mark(pair(cons(X,YS),ZS)) ; active(head(cons(N,XS))) >= mark(N) ; active(tail(cons(N,XS))) >= mark(XS) ; active(afterNth(N,XS)) >= mark(snd(splitAt(N,XS))) ; active(sel(N,XS)) >= mark(head(afterNth(N,XS))) ; active(take(N,XS)) >= mark(fst(splitAt(N,XS))) ; fst(mark(X)) >= fst(X) ; fst(active(X)) >= fst(X) ; pair(mark(X1),X2) >= pair(X1,X2) ; pair(active(X1),X2) >= pair(X1,X2) ; pair(X1,mark(X2)) >= pair(X1,X2) ; pair(X1,active(X2)) >= pair(X1,X2) ; snd(mark(X)) >= snd(X) ; snd(active(X)) >= snd(X) ; splitAt(mark(X1),X2) >= splitAt(X1,X2) ; splitAt(active(X1),X2) >= splitAt(X1,X2) ; splitAt(X1,mark(X2)) >= splitAt(X1,X2) ; splitAt(X1,active(X2)) >= splitAt(X1,X2) ; u(mark(X1),X2,X3,X4) >= u(X1,X2,X3,X4) ; u(active(X1),X2,X3,X4) >= u(X1,X2,X3,X4) ; u(X1,mark(X2),X3,X4) >= u(X1,X2,X3,X4) ; u(X1,active(X2),X3,X4) >= u(X1,X2,X3,X4) ; u(X1,X2,mark(X3),X4) >= u(X1,X2,X3,X4) ; u(X1,X2,active(X3),X4) >= u(X1,X2,X3,X4) ; u(X1,X2,X3,mark(X4)) >= u(X1,X2,X3,X4) ; u(X1,X2,X3,active(X4)) >= u(X1,X2,X3,X4) ; head(mark(X)) >= head(X) ; head(active(X)) >= head(X) ; tail(mark(X)) >= tail(X) ; tail(active(X)) >= tail(X) ; afterNth(mark(X1),X2) >= afterNth(X1,X2) ; afterNth(active(X1),X2) >= afterNth(X1,X2) ; afterNth(X1,mark(X2)) >= afterNth(X1,X2) ; afterNth(X1,active(X2)) >= afterNth(X1,X2) ; sel(mark(X1),X2) >= sel(X1,X2) ; sel(active(X1),X2) >= sel(X1,X2) ; sel(X1,mark(X2)) >= sel(X1,X2) ; sel(X1,active(X2)) >= sel(X1,X2) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; Marked_natsFrom(mark(X)) >= Marked_natsFrom(X) ; Marked_natsFrom(active(X)) >= Marked_natsFrom(X) ; } + Disjunctions:{ { Marked_natsFrom(mark(X)) > Marked_natsFrom(X) ; } { Marked_natsFrom(active(X)) > Marked_natsFrom(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === 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 === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. No solution found for these constraints. APPLY CRITERIA (ID_CRIT) NOT SOLVED No proof found Cime worked for 54.369148 seconds (real time) Cime Exit Status: 0