- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] active(U11(tt,N,X,XS)) -> mark(U12(splitAt(N,XS),X)) [2] active(U12(pair(YS,ZS),X)) -> mark(pair(cons(X,YS),ZS)) [3] active(afterNth(N,XS)) -> mark(snd(splitAt(N,XS))) [4] active(and(tt,X)) -> mark(X) [5] active(fst(pair(X,Y))) -> mark(X) [6] active(head(cons(N,XS))) -> mark(N) [7] active(natsFrom(N)) -> mark(cons(N,natsFrom(s(N)))) [8] active(sel(N,XS)) -> mark(head(afterNth(N,XS))) [9] active(snd(pair(X,Y))) -> mark(Y) [10] active(splitAt(0,XS)) -> mark(pair(nil,XS)) [11] active(splitAt(s(N),cons(X,XS))) -> mark(U11(tt,N,X,XS)) [12] active(tail(cons(N,XS))) -> mark(XS) [13] active(take(N,XS)) -> mark(fst(splitAt(N,XS))) [14] active(U11(X1,X2,X3,X4)) -> U11(active(X1),X2,X3,X4) [15] active(U12(X1,X2)) -> U12(active(X1),X2) [16] active(splitAt(X1,X2)) -> splitAt(active(X1),X2) [17] active(splitAt(X1,X2)) -> splitAt(X1,active(X2)) [18] active(pair(X1,X2)) -> pair(active(X1),X2) [19] active(pair(X1,X2)) -> pair(X1,active(X2)) [20] active(cons(X1,X2)) -> cons(active(X1),X2) [21] active(afterNth(X1,X2)) -> afterNth(active(X1),X2) [22] active(afterNth(X1,X2)) -> afterNth(X1,active(X2)) [23] active(snd(X)) -> snd(active(X)) [24] active(and(X1,X2)) -> and(active(X1),X2) [25] active(fst(X)) -> fst(active(X)) [26] active(head(X)) -> head(active(X)) [27] active(natsFrom(X)) -> natsFrom(active(X)) [28] active(s(X)) -> s(active(X)) [29] active(sel(X1,X2)) -> sel(active(X1),X2) [30] active(sel(X1,X2)) -> sel(X1,active(X2)) [31] active(tail(X)) -> tail(active(X)) [32] active(take(X1,X2)) -> take(active(X1),X2) [33] active(take(X1,X2)) -> take(X1,active(X2)) [34] U11(mark(X1),X2,X3,X4) -> mark(U11(X1,X2,X3,X4)) [35] U12(mark(X1),X2) -> mark(U12(X1,X2)) [36] splitAt(mark(X1),X2) -> mark(splitAt(X1,X2)) [37] splitAt(X1,mark(X2)) -> mark(splitAt(X1,X2)) [38] pair(mark(X1),X2) -> mark(pair(X1,X2)) [39] pair(X1,mark(X2)) -> mark(pair(X1,X2)) [40] cons(mark(X1),X2) -> mark(cons(X1,X2)) [41] afterNth(mark(X1),X2) -> mark(afterNth(X1,X2)) [42] afterNth(X1,mark(X2)) -> mark(afterNth(X1,X2)) [43] snd(mark(X)) -> mark(snd(X)) [44] and(mark(X1),X2) -> mark(and(X1,X2)) [45] fst(mark(X)) -> mark(fst(X)) [46] head(mark(X)) -> mark(head(X)) [47] natsFrom(mark(X)) -> mark(natsFrom(X)) [48] s(mark(X)) -> mark(s(X)) [49] sel(mark(X1),X2) -> mark(sel(X1,X2)) [50] sel(X1,mark(X2)) -> mark(sel(X1,X2)) [51] tail(mark(X)) -> mark(tail(X)) [52] take(mark(X1),X2) -> mark(take(X1,X2)) [53] take(X1,mark(X2)) -> mark(take(X1,X2)) [54] proper(U11(X1,X2,X3,X4)) -> U11(proper(X1),proper(X2),proper(X3),proper(X4)) [55] proper(tt) -> ok(tt) [56] proper(U12(X1,X2)) -> U12(proper(X1),proper(X2)) [57] proper(splitAt(X1,X2)) -> splitAt(proper(X1),proper(X2)) [58] proper(pair(X1,X2)) -> pair(proper(X1),proper(X2)) [59] proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) [60] proper(afterNth(X1,X2)) -> afterNth(proper(X1),proper(X2)) [61] proper(snd(X)) -> snd(proper(X)) [62] proper(and(X1,X2)) -> and(proper(X1),proper(X2)) [63] proper(fst(X)) -> fst(proper(X)) [64] proper(head(X)) -> head(proper(X)) [65] proper(natsFrom(X)) -> natsFrom(proper(X)) [66] proper(s(X)) -> s(proper(X)) [67] proper(sel(X1,X2)) -> sel(proper(X1),proper(X2)) [68] proper(0) -> ok(0) [69] proper(nil) -> ok(nil) [70] proper(tail(X)) -> tail(proper(X)) [71] proper(take(X1,X2)) -> take(proper(X1),proper(X2)) [72] U11(ok(X1),ok(X2),ok(X3),ok(X4)) -> ok(U11(X1,X2,X3,X4)) [73] U12(ok(X1),ok(X2)) -> ok(U12(X1,X2)) [74] splitAt(ok(X1),ok(X2)) -> ok(splitAt(X1,X2)) [75] pair(ok(X1),ok(X2)) -> ok(pair(X1,X2)) [76] cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) [77] afterNth(ok(X1),ok(X2)) -> ok(afterNth(X1,X2)) [78] snd(ok(X)) -> ok(snd(X)) [79] and(ok(X1),ok(X2)) -> ok(and(X1,X2)) [80] fst(ok(X)) -> ok(fst(X)) [81] head(ok(X)) -> ok(head(X)) [82] natsFrom(ok(X)) -> ok(natsFrom(X)) [83] s(ok(X)) -> ok(s(X)) [84] sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) [85] tail(ok(X)) -> ok(tail(X)) [86] take(ok(X1),ok(X2)) -> ok(take(X1,X2)) [87] top(mark(X)) -> top(proper(X)) [88] top(ok(X)) -> top(active(X)) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 18 components: { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { U12(mark(X1),X2) >= mark(U12(X1,X2)) ; U12(ok(X1),ok(X2)) >= ok(U12(X1,X2)) ; splitAt(mark(X1),X2) >= mark(splitAt(X1,X2)) ; splitAt(ok(X1),ok(X2)) >= ok(splitAt(X1,X2)) ; splitAt(X1,mark(X2)) >= mark(splitAt(X1,X2)) ; active(U12(pair(YS,ZS),X)) >= mark(pair(cons(X,YS),ZS)) ; active(U12(X1,X2)) >= U12(active(X1),X2) ; active(splitAt(s(N),cons(X,XS))) >= mark(U11(tt,N,X,XS)) ; active(splitAt(0,XS)) >= mark(pair(nil,XS)) ; active(splitAt(X1,X2)) >= splitAt(active(X1),X2) ; active(splitAt(X1,X2)) >= splitAt(X1,active(X2)) ; active(U11(tt,N,X,XS)) >= mark(U12(splitAt(N,XS),X)) ; active(U11(X1,X2,X3,X4)) >= U11(active(X1),X2,X3,X4) ; active(pair(X1,X2)) >= pair(active(X1),X2) ; active(pair(X1,X2)) >= pair(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(snd(pair(X,Y))) >= mark(Y) ; active(snd(X)) >= snd(active(X)) ; active(afterNth(N,XS)) >= mark(snd(splitAt(N,XS))) ; active(afterNth(X1,X2)) >= afterNth(active(X1),X2) ; active(afterNth(X1,X2)) >= afterNth(X1,active(X2)) ; active(and(tt,X)) >= mark(X) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(fst(pair(X,Y))) >= mark(X) ; active(fst(X)) >= fst(active(X)) ; active(head(cons(N,XS))) >= mark(N) ; active(head(X)) >= head(active(X)) ; active(natsFrom(N)) >= mark(cons(N,natsFrom(s(N)))) ; active(natsFrom(X)) >= natsFrom(active(X)) ; active(s(X)) >= s(active(X)) ; active(sel(N,XS)) >= mark(head(afterNth(N,XS))) ; active(sel(X1,X2)) >= sel(active(X1),X2) ; active(sel(X1,X2)) >= sel(X1,active(X2)) ; active(tail(cons(N,XS))) >= mark(XS) ; active(tail(X)) >= tail(active(X)) ; active(take(N,XS)) >= mark(fst(splitAt(N,XS))) ; active(take(X1,X2)) >= take(active(X1),X2) ; active(take(X1,X2)) >= take(X1,active(X2)) ; U11(mark(X1),X2,X3,X4) >= mark(U11(X1,X2,X3,X4)) ; U11(ok(X1),ok(X2),ok(X3),ok(X4)) >= ok(U11(X1,X2,X3,X4)) ; pair(mark(X1),X2) >= mark(pair(X1,X2)) ; pair(ok(X1),ok(X2)) >= ok(pair(X1,X2)) ; pair(X1,mark(X2)) >= mark(pair(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; snd(mark(X)) >= mark(snd(X)) ; snd(ok(X)) >= ok(snd(X)) ; afterNth(mark(X1),X2) >= mark(afterNth(X1,X2)) ; afterNth(ok(X1),ok(X2)) >= ok(afterNth(X1,X2)) ; afterNth(X1,mark(X2)) >= mark(afterNth(X1,X2)) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; fst(mark(X)) >= mark(fst(X)) ; fst(ok(X)) >= ok(fst(X)) ; head(mark(X)) >= mark(head(X)) ; head(ok(X)) >= ok(head(X)) ; natsFrom(mark(X)) >= mark(natsFrom(X)) ; natsFrom(ok(X)) >= ok(natsFrom(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; sel(mark(X1),X2) >= mark(sel(X1,X2)) ; sel(ok(X1),ok(X2)) >= ok(sel(X1,X2)) ; sel(X1,mark(X2)) >= mark(sel(X1,X2)) ; tail(mark(X)) >= mark(tail(X)) ; tail(ok(X)) >= ok(tail(X)) ; take(mark(X1),X2) >= mark(take(X1,X2)) ; take(ok(X1),ok(X2)) >= ok(take(X1,X2)) ; take(X1,mark(X2)) >= mark(take(X1,X2)) ; proper(U12(X1,X2)) >= U12(proper(X1),proper(X2)) ; proper(splitAt(X1,X2)) >= splitAt(proper(X1),proper(X2)) ; proper(U11(X1,X2,X3,X4)) >= U11(proper(X1),proper(X2),proper(X3),proper(X4)) ; proper(tt) >= ok(tt) ; proper(pair(X1,X2)) >= pair(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(snd(X)) >= snd(proper(X)) ; proper(afterNth(X1,X2)) >= afterNth(proper(X1),proper(X2)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(fst(X)) >= fst(proper(X)) ; proper(head(X)) >= head(proper(X)) ; proper(natsFrom(X)) >= natsFrom(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(sel(X1,X2)) >= sel(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(0) >= ok(0) ; proper(tail(X)) >= tail(proper(X)) ; proper(take(X1,X2)) >= take(proper(X1),proper(X2)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_top(mark(X)) >= Marked_top(proper(X)) ; Marked_top(ok(X)) >= Marked_top(active(X)) ; } + Disjunctions:{ { Marked_top(mark(X)) > Marked_top(proper(X)) ; } { Marked_top(ok(X)) > Marked_top(active(X)) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === Time out for these parameters. === TIMER virtual : 15.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 15.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. === TIMER virtual : 50.000000 === trying sub matrices of size: 1 Matrix interpretation constraints generated. Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. Termination constraints generated. Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 50.000000 === === STOPING TIMER real === Sat 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: { U12(mark(X1),X2) >= mark(U12(X1,X2)) ; U12(ok(X1),ok(X2)) >= ok(U12(X1,X2)) ; splitAt(mark(X1),X2) >= mark(splitAt(X1,X2)) ; splitAt(ok(X1),ok(X2)) >= ok(splitAt(X1,X2)) ; splitAt(X1,mark(X2)) >= mark(splitAt(X1,X2)) ; active(U12(pair(YS,ZS),X)) >= mark(pair(cons(X,YS),ZS)) ; active(U12(X1,X2)) >= U12(active(X1),X2) ; active(splitAt(s(N),cons(X,XS))) >= mark(U11(tt,N,X,XS)) ; active(splitAt(0,XS)) >= mark(pair(nil,XS)) ; active(splitAt(X1,X2)) >= splitAt(active(X1),X2) ; active(splitAt(X1,X2)) >= splitAt(X1,active(X2)) ; active(U11(tt,N,X,XS)) >= mark(U12(splitAt(N,XS),X)) ; active(U11(X1,X2,X3,X4)) >= U11(active(X1),X2,X3,X4) ; active(pair(X1,X2)) >= pair(active(X1),X2) ; active(pair(X1,X2)) >= pair(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(snd(pair(X,Y))) >= mark(Y) ; active(snd(X)) >= snd(active(X)) ; active(afterNth(N,XS)) >= mark(snd(splitAt(N,XS))) ; active(afterNth(X1,X2)) >= afterNth(active(X1),X2) ; active(afterNth(X1,X2)) >= afterNth(X1,active(X2)) ; active(and(tt,X)) >= mark(X) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(fst(pair(X,Y))) >= mark(X) ; active(fst(X)) >= fst(active(X)) ; active(head(cons(N,XS))) >= mark(N) ; active(head(X)) >= head(active(X)) ; active(natsFrom(N)) >= mark(cons(N,natsFrom(s(N)))) ; active(natsFrom(X)) >= natsFrom(active(X)) ; active(s(X)) >= s(active(X)) ; active(sel(N,XS)) >= mark(head(afterNth(N,XS))) ; active(sel(X1,X2)) >= sel(active(X1),X2) ; active(sel(X1,X2)) >= sel(X1,active(X2)) ; active(tail(cons(N,XS))) >= mark(XS) ; active(tail(X)) >= tail(active(X)) ; active(take(N,XS)) >= mark(fst(splitAt(N,XS))) ; active(take(X1,X2)) >= take(active(X1),X2) ; active(take(X1,X2)) >= take(X1,active(X2)) ; U11(mark(X1),X2,X3,X4) >= mark(U11(X1,X2,X3,X4)) ; U11(ok(X1),ok(X2),ok(X3),ok(X4)) >= ok(U11(X1,X2,X3,X4)) ; pair(mark(X1),X2) >= mark(pair(X1,X2)) ; pair(ok(X1),ok(X2)) >= ok(pair(X1,X2)) ; pair(X1,mark(X2)) >= mark(pair(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; snd(mark(X)) >= mark(snd(X)) ; snd(ok(X)) >= ok(snd(X)) ; afterNth(mark(X1),X2) >= mark(afterNth(X1,X2)) ; afterNth(ok(X1),ok(X2)) >= ok(afterNth(X1,X2)) ; afterNth(X1,mark(X2)) >= mark(afterNth(X1,X2)) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; fst(mark(X)) >= mark(fst(X)) ; fst(ok(X)) >= ok(fst(X)) ; head(mark(X)) >= mark(head(X)) ; head(ok(X)) >= ok(head(X)) ; natsFrom(mark(X)) >= mark(natsFrom(X)) ; natsFrom(ok(X)) >= ok(natsFrom(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; sel(mark(X1),X2) >= mark(sel(X1,X2)) ; sel(ok(X1),ok(X2)) >= ok(sel(X1,X2)) ; sel(X1,mark(X2)) >= mark(sel(X1,X2)) ; tail(mark(X)) >= mark(tail(X)) ; tail(ok(X)) >= ok(tail(X)) ; take(mark(X1),X2) >= mark(take(X1,X2)) ; take(ok(X1),ok(X2)) >= ok(take(X1,X2)) ; take(X1,mark(X2)) >= mark(take(X1,X2)) ; proper(U12(X1,X2)) >= U12(proper(X1),proper(X2)) ; proper(splitAt(X1,X2)) >= splitAt(proper(X1),proper(X2)) ; proper(U11(X1,X2,X3,X4)) >= U11(proper(X1),proper(X2),proper(X3),proper(X4)) ; proper(tt) >= ok(tt) ; proper(pair(X1,X2)) >= pair(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(snd(X)) >= snd(proper(X)) ; proper(afterNth(X1,X2)) >= afterNth(proper(X1),proper(X2)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(fst(X)) >= fst(proper(X)) ; proper(head(X)) >= head(proper(X)) ; proper(natsFrom(X)) >= natsFrom(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(sel(X1,X2)) >= sel(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(0) >= ok(0) ; proper(tail(X)) >= tail(proper(X)) ; proper(take(X1,X2)) >= take(proper(X1),proper(X2)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_top(mark(X)) > Marked_top(proper(X)) ; Marked_top(ok(X)) > Marked_top(active(X)) ; } APPLY CRITERIA (SOLVE_ORD) Trying to solve the following constraints: { U12(mark(X1),X2) >= mark(U12(X1,X2)) ; U12(ok(X1),ok(X2)) >= ok(U12(X1,X2)) ; splitAt(mark(X1),X2) >= mark(splitAt(X1,X2)) ; splitAt(ok(X1),ok(X2)) >= ok(splitAt(X1,X2)) ; splitAt(X1,mark(X2)) >= mark(splitAt(X1,X2)) ; active(U12(pair(YS,ZS),X)) >= mark(pair(cons(X,YS),ZS)) ; active(U12(X1,X2)) >= U12(active(X1),X2) ; active(splitAt(s(N),cons(X,XS))) >= mark(U11(tt,N,X,XS)) ; active(splitAt(0,XS)) >= mark(pair(nil,XS)) ; active(splitAt(X1,X2)) >= splitAt(active(X1),X2) ; active(splitAt(X1,X2)) >= splitAt(X1,active(X2)) ; active(U11(tt,N,X,XS)) >= mark(U12(splitAt(N,XS),X)) ; active(U11(X1,X2,X3,X4)) >= U11(active(X1),X2,X3,X4) ; active(pair(X1,X2)) >= pair(active(X1),X2) ; active(pair(X1,X2)) >= pair(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(snd(pair(X,Y))) >= mark(Y) ; active(snd(X)) >= snd(active(X)) ; active(afterNth(N,XS)) >= mark(snd(splitAt(N,XS))) ; active(afterNth(X1,X2)) >= afterNth(active(X1),X2) ; active(afterNth(X1,X2)) >= afterNth(X1,active(X2)) ; active(and(tt,X)) >= mark(X) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(fst(pair(X,Y))) >= mark(X) ; active(fst(X)) >= fst(active(X)) ; active(head(cons(N,XS))) >= mark(N) ; active(head(X)) >= head(active(X)) ; active(natsFrom(N)) >= mark(cons(N,natsFrom(s(N)))) ; active(natsFrom(X)) >= natsFrom(active(X)) ; active(s(X)) >= s(active(X)) ; active(sel(N,XS)) >= mark(head(afterNth(N,XS))) ; active(sel(X1,X2)) >= sel(active(X1),X2) ; active(sel(X1,X2)) >= sel(X1,active(X2)) ; active(tail(cons(N,XS))) >= mark(XS) ; active(tail(X)) >= tail(active(X)) ; active(take(N,XS)) >= mark(fst(splitAt(N,XS))) ; active(take(X1,X2)) >= take(active(X1),X2) ; active(take(X1,X2)) >= take(X1,active(X2)) ; U11(mark(X1),X2,X3,X4) >= mark(U11(X1,X2,X3,X4)) ; U11(ok(X1),ok(X2),ok(X3),ok(X4)) >= ok(U11(X1,X2,X3,X4)) ; pair(mark(X1),X2) >= mark(pair(X1,X2)) ; pair(ok(X1),ok(X2)) >= ok(pair(X1,X2)) ; pair(X1,mark(X2)) >= mark(pair(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; snd(mark(X)) >= mark(snd(X)) ; snd(ok(X)) >= ok(snd(X)) ; afterNth(mark(X1),X2) >= mark(afterNth(X1,X2)) ; afterNth(ok(X1),ok(X2)) >= ok(afterNth(X1,X2)) ; afterNth(X1,mark(X2)) >= mark(afterNth(X1,X2)) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; fst(mark(X)) >= mark(fst(X)) ; fst(ok(X)) >= ok(fst(X)) ; head(mark(X)) >= mark(head(X)) ; head(ok(X)) >= ok(head(X)) ; natsFrom(mark(X)) >= mark(natsFrom(X)) ; natsFrom(ok(X)) >= ok(natsFrom(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; sel(mark(X1),X2) >= mark(sel(X1,X2)) ; sel(ok(X1),ok(X2)) >= ok(sel(X1,X2)) ; sel(X1,mark(X2)) >= mark(sel(X1,X2)) ; tail(mark(X)) >= mark(tail(X)) ; tail(ok(X)) >= ok(tail(X)) ; take(mark(X1),X2) >= mark(take(X1,X2)) ; take(ok(X1),ok(X2)) >= ok(take(X1,X2)) ; take(X1,mark(X2)) >= mark(take(X1,X2)) ; proper(U12(X1,X2)) >= U12(proper(X1),proper(X2)) ; proper(splitAt(X1,X2)) >= splitAt(proper(X1),proper(X2)) ; proper(U11(X1,X2,X3,X4)) >= U11(proper(X1),proper(X2),proper(X3),proper(X4)) ; proper(tt) >= ok(tt) ; proper(pair(X1,X2)) >= pair(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(snd(X)) >= snd(proper(X)) ; proper(afterNth(X1,X2)) >= afterNth(proper(X1),proper(X2)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(fst(X)) >= fst(proper(X)) ; proper(head(X)) >= head(proper(X)) ; proper(natsFrom(X)) >= natsFrom(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(sel(X1,X2)) >= sel(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(0) >= ok(0) ; proper(tail(X)) >= tail(proper(X)) ; proper(take(X1,X2)) >= take(proper(X1),proper(X2)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_top(mark(X)) > Marked_top(proper(X)) ; Marked_top(ok(X)) > Marked_top(active(X)) ; } + Disjunctions:{ } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === Time out for these parameters. === TIMER virtual : 15.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 15.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. === TIMER virtual : 50.000000 === trying sub matrices of size: 1 Matrix interpretation constraints generated. Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. Termination constraints generated. Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 50.000000 === === STOPING TIMER real === Sat timeout reached === STOPING TIMER virtual === No solution found for these parameters. No solution found for these constraints. APPLY CRITERIA (ID_CRIT) NOT SOLVED No proof found Cime worked for 157.713151 seconds (real time) Cime Exit Status: 0