- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] active(sel(s(X),cons(Y,Z))) -> mark(sel(X,Z)) [2] active(sel(0,cons(X,Z))) -> mark(X) [3] active(first(0,Z)) -> mark(nil) [4] active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) [5] active(from(X)) -> mark(cons(X,from(s(X)))) [6] active(sel1(s(X),cons(Y,Z))) -> mark(sel1(X,Z)) [7] active(sel1(0,cons(X,Z))) -> mark(quote(X)) [8] active(first1(0,Z)) -> mark(nil1) [9] active(first1(s(X),cons(Y,Z))) -> mark(cons1(quote(Y),first1(X,Z))) [10] active(quote(0)) -> mark(01) [11] active(quote1(cons(X,Z))) -> mark(cons1(quote(X),quote1(Z))) [12] active(quote1(nil)) -> mark(nil1) [13] active(quote(s(X))) -> mark(s1(quote(X))) [14] active(quote(sel(X,Z))) -> mark(sel1(X,Z)) [15] active(quote1(first(X,Z))) -> mark(first1(X,Z)) [16] active(unquote(01)) -> mark(0) [17] active(unquote(s1(X))) -> mark(s(unquote(X))) [18] active(unquote1(nil1)) -> mark(nil) [19] active(unquote1(cons1(X,Z))) -> mark(fcons(unquote(X),unquote1(Z))) [20] active(fcons(X,Z)) -> mark(cons(X,Z)) [21] active(sel(X1,X2)) -> sel(active(X1),X2) [22] active(sel(X1,X2)) -> sel(X1,active(X2)) [23] active(s(X)) -> s(active(X)) [24] active(cons(X1,X2)) -> cons(active(X1),X2) [25] active(first(X1,X2)) -> first(active(X1),X2) [26] active(first(X1,X2)) -> first(X1,active(X2)) [27] active(from(X)) -> from(active(X)) [28] active(sel1(X1,X2)) -> sel1(active(X1),X2) [29] active(sel1(X1,X2)) -> sel1(X1,active(X2)) [30] active(first1(X1,X2)) -> first1(active(X1),X2) [31] active(first1(X1,X2)) -> first1(X1,active(X2)) [32] active(cons1(X1,X2)) -> cons1(active(X1),X2) [33] active(cons1(X1,X2)) -> cons1(X1,active(X2)) [34] active(s1(X)) -> s1(active(X)) [35] active(unquote(X)) -> unquote(active(X)) [36] active(unquote1(X)) -> unquote1(active(X)) [37] active(fcons(X1,X2)) -> fcons(active(X1),X2) [38] active(fcons(X1,X2)) -> fcons(X1,active(X2)) [39] sel(mark(X1),X2) -> mark(sel(X1,X2)) [40] sel(X1,mark(X2)) -> mark(sel(X1,X2)) [41] s(mark(X)) -> mark(s(X)) [42] cons(mark(X1),X2) -> mark(cons(X1,X2)) [43] first(mark(X1),X2) -> mark(first(X1,X2)) [44] first(X1,mark(X2)) -> mark(first(X1,X2)) [45] from(mark(X)) -> mark(from(X)) [46] sel1(mark(X1),X2) -> mark(sel1(X1,X2)) [47] sel1(X1,mark(X2)) -> mark(sel1(X1,X2)) [48] first1(mark(X1),X2) -> mark(first1(X1,X2)) [49] first1(X1,mark(X2)) -> mark(first1(X1,X2)) [50] cons1(mark(X1),X2) -> mark(cons1(X1,X2)) [51] cons1(X1,mark(X2)) -> mark(cons1(X1,X2)) [52] s1(mark(X)) -> mark(s1(X)) [53] unquote(mark(X)) -> mark(unquote(X)) [54] unquote1(mark(X)) -> mark(unquote1(X)) [55] fcons(mark(X1),X2) -> mark(fcons(X1,X2)) [56] fcons(X1,mark(X2)) -> mark(fcons(X1,X2)) [57] proper(sel(X1,X2)) -> sel(proper(X1),proper(X2)) [58] proper(s(X)) -> s(proper(X)) [59] proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) [60] proper(0) -> ok(0) [61] proper(first(X1,X2)) -> first(proper(X1),proper(X2)) [62] proper(nil) -> ok(nil) [63] proper(from(X)) -> from(proper(X)) [64] proper(sel1(X1,X2)) -> sel1(proper(X1),proper(X2)) [65] proper(quote(X)) -> quote(proper(X)) [66] proper(first1(X1,X2)) -> first1(proper(X1),proper(X2)) [67] proper(nil1) -> ok(nil1) [68] proper(cons1(X1,X2)) -> cons1(proper(X1),proper(X2)) [69] proper(01) -> ok(01) [70] proper(quote1(X)) -> quote1(proper(X)) [71] proper(s1(X)) -> s1(proper(X)) [72] proper(unquote(X)) -> unquote(proper(X)) [73] proper(unquote1(X)) -> unquote1(proper(X)) [74] proper(fcons(X1,X2)) -> fcons(proper(X1),proper(X2)) [75] sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) [76] s(ok(X)) -> ok(s(X)) [77] cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) [78] first(ok(X1),ok(X2)) -> ok(first(X1,X2)) [79] from(ok(X)) -> ok(from(X)) [80] sel1(ok(X1),ok(X2)) -> ok(sel1(X1,X2)) [81] quote(ok(X)) -> ok(quote(X)) [82] first1(ok(X1),ok(X2)) -> ok(first1(X1,X2)) [83] cons1(ok(X1),ok(X2)) -> ok(cons1(X1,X2)) [84] quote1(ok(X)) -> ok(quote1(X)) [85] s1(ok(X)) -> ok(s1(X)) [86] unquote(ok(X)) -> ok(unquote(X)) [87] unquote1(ok(X)) -> ok(unquote1(X)) [88] fcons(ok(X1),ok(X2)) -> ok(fcons(X1,X2)) [89] top(mark(X)) -> top(proper(X)) [90] top(ok(X)) -> top(active(X)) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 17 components: { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> } { --> } { --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { 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)) ; active(sel(s(X),cons(Y,Z))) >= mark(sel(X,Z)) ; active(sel(0,cons(X,Z))) >= mark(X) ; active(sel(X1,X2)) >= sel(active(X1),X2) ; active(sel(X1,X2)) >= sel(X1,active(X2)) ; active(s(X)) >= s(active(X)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(0,Z)) >= mark(nil) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(sel1(s(X),cons(Y,Z))) >= mark(sel1(X,Z)) ; active(sel1(0,cons(X,Z))) >= mark(quote(X)) ; active(sel1(X1,X2)) >= sel1(active(X1),X2) ; active(sel1(X1,X2)) >= sel1(X1,active(X2)) ; active(quote(sel(X,Z))) >= mark(sel1(X,Z)) ; active(quote(s(X))) >= mark(s1(quote(X))) ; active(quote(0)) >= mark(01) ; active(first1(s(X),cons(Y,Z))) >= mark(cons1(quote(Y),first1(X,Z))) ; active(first1(0,Z)) >= mark(nil1) ; active(first1(X1,X2)) >= first1(active(X1),X2) ; active(first1(X1,X2)) >= first1(X1,active(X2)) ; active(cons1(X1,X2)) >= cons1(active(X1),X2) ; active(cons1(X1,X2)) >= cons1(X1,active(X2)) ; active(quote1(cons(X,Z))) >= mark(cons1(quote(X),quote1(Z))) ; active(quote1(nil)) >= mark(nil1) ; active(quote1(first(X,Z))) >= mark(first1(X,Z)) ; active(s1(X)) >= s1(active(X)) ; active(unquote(01)) >= mark(0) ; active(unquote(s1(X))) >= mark(s(unquote(X))) ; active(unquote(X)) >= unquote(active(X)) ; active(unquote1(nil1)) >= mark(nil) ; active(unquote1(cons1(X,Z))) >= mark(fcons(unquote(X),unquote1(Z))) ; active(unquote1(X)) >= unquote1(active(X)) ; active(fcons(X,Z)) >= mark(cons(X,Z)) ; active(fcons(X1,X2)) >= fcons(active(X1),X2) ; active(fcons(X1,X2)) >= fcons(X1,active(X2)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; sel1(mark(X1),X2) >= mark(sel1(X1,X2)) ; sel1(ok(X1),ok(X2)) >= ok(sel1(X1,X2)) ; sel1(X1,mark(X2)) >= mark(sel1(X1,X2)) ; quote(ok(X)) >= ok(quote(X)) ; first1(mark(X1),X2) >= mark(first1(X1,X2)) ; first1(ok(X1),ok(X2)) >= ok(first1(X1,X2)) ; first1(X1,mark(X2)) >= mark(first1(X1,X2)) ; cons1(mark(X1),X2) >= mark(cons1(X1,X2)) ; cons1(ok(X1),ok(X2)) >= ok(cons1(X1,X2)) ; cons1(X1,mark(X2)) >= mark(cons1(X1,X2)) ; quote1(ok(X)) >= ok(quote1(X)) ; s1(mark(X)) >= mark(s1(X)) ; s1(ok(X)) >= ok(s1(X)) ; unquote(mark(X)) >= mark(unquote(X)) ; unquote(ok(X)) >= ok(unquote(X)) ; unquote1(mark(X)) >= mark(unquote1(X)) ; unquote1(ok(X)) >= ok(unquote1(X)) ; fcons(mark(X1),X2) >= mark(fcons(X1,X2)) ; fcons(ok(X1),ok(X2)) >= ok(fcons(X1,X2)) ; fcons(X1,mark(X2)) >= mark(fcons(X1,X2)) ; proper(sel(X1,X2)) >= sel(proper(X1),proper(X2)) ; proper(s(X)) >= s(proper(X)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(sel1(X1,X2)) >= sel1(proper(X1),proper(X2)) ; proper(quote(X)) >= quote(proper(X)) ; proper(nil1) >= ok(nil1) ; proper(first1(X1,X2)) >= first1(proper(X1),proper(X2)) ; proper(cons1(X1,X2)) >= cons1(proper(X1),proper(X2)) ; proper(01) >= ok(01) ; proper(quote1(X)) >= quote1(proper(X)) ; proper(s1(X)) >= s1(proper(X)) ; proper(unquote(X)) >= unquote(proper(X)) ; proper(unquote1(X)) >= unquote1(proper(X)) ; proper(fcons(X1,X2)) >= fcons(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: { 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)) ; active(sel(s(X),cons(Y,Z))) >= mark(sel(X,Z)) ; active(sel(0,cons(X,Z))) >= mark(X) ; active(sel(X1,X2)) >= sel(active(X1),X2) ; active(sel(X1,X2)) >= sel(X1,active(X2)) ; active(s(X)) >= s(active(X)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(0,Z)) >= mark(nil) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(sel1(s(X),cons(Y,Z))) >= mark(sel1(X,Z)) ; active(sel1(0,cons(X,Z))) >= mark(quote(X)) ; active(sel1(X1,X2)) >= sel1(active(X1),X2) ; active(sel1(X1,X2)) >= sel1(X1,active(X2)) ; active(quote(sel(X,Z))) >= mark(sel1(X,Z)) ; active(quote(s(X))) >= mark(s1(quote(X))) ; active(quote(0)) >= mark(01) ; active(first1(s(X),cons(Y,Z))) >= mark(cons1(quote(Y),first1(X,Z))) ; active(first1(0,Z)) >= mark(nil1) ; active(first1(X1,X2)) >= first1(active(X1),X2) ; active(first1(X1,X2)) >= first1(X1,active(X2)) ; active(cons1(X1,X2)) >= cons1(active(X1),X2) ; active(cons1(X1,X2)) >= cons1(X1,active(X2)) ; active(quote1(cons(X,Z))) >= mark(cons1(quote(X),quote1(Z))) ; active(quote1(nil)) >= mark(nil1) ; active(quote1(first(X,Z))) >= mark(first1(X,Z)) ; active(s1(X)) >= s1(active(X)) ; active(unquote(01)) >= mark(0) ; active(unquote(s1(X))) >= mark(s(unquote(X))) ; active(unquote(X)) >= unquote(active(X)) ; active(unquote1(nil1)) >= mark(nil) ; active(unquote1(cons1(X,Z))) >= mark(fcons(unquote(X),unquote1(Z))) ; active(unquote1(X)) >= unquote1(active(X)) ; active(fcons(X,Z)) >= mark(cons(X,Z)) ; active(fcons(X1,X2)) >= fcons(active(X1),X2) ; active(fcons(X1,X2)) >= fcons(X1,active(X2)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; sel1(mark(X1),X2) >= mark(sel1(X1,X2)) ; sel1(ok(X1),ok(X2)) >= ok(sel1(X1,X2)) ; sel1(X1,mark(X2)) >= mark(sel1(X1,X2)) ; quote(ok(X)) >= ok(quote(X)) ; first1(mark(X1),X2) >= mark(first1(X1,X2)) ; first1(ok(X1),ok(X2)) >= ok(first1(X1,X2)) ; first1(X1,mark(X2)) >= mark(first1(X1,X2)) ; cons1(mark(X1),X2) >= mark(cons1(X1,X2)) ; cons1(ok(X1),ok(X2)) >= ok(cons1(X1,X2)) ; cons1(X1,mark(X2)) >= mark(cons1(X1,X2)) ; quote1(ok(X)) >= ok(quote1(X)) ; s1(mark(X)) >= mark(s1(X)) ; s1(ok(X)) >= ok(s1(X)) ; unquote(mark(X)) >= mark(unquote(X)) ; unquote(ok(X)) >= ok(unquote(X)) ; unquote1(mark(X)) >= mark(unquote1(X)) ; unquote1(ok(X)) >= ok(unquote1(X)) ; fcons(mark(X1),X2) >= mark(fcons(X1,X2)) ; fcons(ok(X1),ok(X2)) >= ok(fcons(X1,X2)) ; fcons(X1,mark(X2)) >= mark(fcons(X1,X2)) ; proper(sel(X1,X2)) >= sel(proper(X1),proper(X2)) ; proper(s(X)) >= s(proper(X)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(sel1(X1,X2)) >= sel1(proper(X1),proper(X2)) ; proper(quote(X)) >= quote(proper(X)) ; proper(nil1) >= ok(nil1) ; proper(first1(X1,X2)) >= first1(proper(X1),proper(X2)) ; proper(cons1(X1,X2)) >= cons1(proper(X1),proper(X2)) ; proper(01) >= ok(01) ; proper(quote1(X)) >= quote1(proper(X)) ; proper(s1(X)) >= s1(proper(X)) ; proper(unquote(X)) >= unquote(proper(X)) ; proper(unquote1(X)) >= unquote1(proper(X)) ; proper(fcons(X1,X2)) >= fcons(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: { 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)) ; active(sel(s(X),cons(Y,Z))) >= mark(sel(X,Z)) ; active(sel(0,cons(X,Z))) >= mark(X) ; active(sel(X1,X2)) >= sel(active(X1),X2) ; active(sel(X1,X2)) >= sel(X1,active(X2)) ; active(s(X)) >= s(active(X)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(0,Z)) >= mark(nil) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(sel1(s(X),cons(Y,Z))) >= mark(sel1(X,Z)) ; active(sel1(0,cons(X,Z))) >= mark(quote(X)) ; active(sel1(X1,X2)) >= sel1(active(X1),X2) ; active(sel1(X1,X2)) >= sel1(X1,active(X2)) ; active(quote(sel(X,Z))) >= mark(sel1(X,Z)) ; active(quote(s(X))) >= mark(s1(quote(X))) ; active(quote(0)) >= mark(01) ; active(first1(s(X),cons(Y,Z))) >= mark(cons1(quote(Y),first1(X,Z))) ; active(first1(0,Z)) >= mark(nil1) ; active(first1(X1,X2)) >= first1(active(X1),X2) ; active(first1(X1,X2)) >= first1(X1,active(X2)) ; active(cons1(X1,X2)) >= cons1(active(X1),X2) ; active(cons1(X1,X2)) >= cons1(X1,active(X2)) ; active(quote1(cons(X,Z))) >= mark(cons1(quote(X),quote1(Z))) ; active(quote1(nil)) >= mark(nil1) ; active(quote1(first(X,Z))) >= mark(first1(X,Z)) ; active(s1(X)) >= s1(active(X)) ; active(unquote(01)) >= mark(0) ; active(unquote(s1(X))) >= mark(s(unquote(X))) ; active(unquote(X)) >= unquote(active(X)) ; active(unquote1(nil1)) >= mark(nil) ; active(unquote1(cons1(X,Z))) >= mark(fcons(unquote(X),unquote1(Z))) ; active(unquote1(X)) >= unquote1(active(X)) ; active(fcons(X,Z)) >= mark(cons(X,Z)) ; active(fcons(X1,X2)) >= fcons(active(X1),X2) ; active(fcons(X1,X2)) >= fcons(X1,active(X2)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; sel1(mark(X1),X2) >= mark(sel1(X1,X2)) ; sel1(ok(X1),ok(X2)) >= ok(sel1(X1,X2)) ; sel1(X1,mark(X2)) >= mark(sel1(X1,X2)) ; quote(ok(X)) >= ok(quote(X)) ; first1(mark(X1),X2) >= mark(first1(X1,X2)) ; first1(ok(X1),ok(X2)) >= ok(first1(X1,X2)) ; first1(X1,mark(X2)) >= mark(first1(X1,X2)) ; cons1(mark(X1),X2) >= mark(cons1(X1,X2)) ; cons1(ok(X1),ok(X2)) >= ok(cons1(X1,X2)) ; cons1(X1,mark(X2)) >= mark(cons1(X1,X2)) ; quote1(ok(X)) >= ok(quote1(X)) ; s1(mark(X)) >= mark(s1(X)) ; s1(ok(X)) >= ok(s1(X)) ; unquote(mark(X)) >= mark(unquote(X)) ; unquote(ok(X)) >= ok(unquote(X)) ; unquote1(mark(X)) >= mark(unquote1(X)) ; unquote1(ok(X)) >= ok(unquote1(X)) ; fcons(mark(X1),X2) >= mark(fcons(X1,X2)) ; fcons(ok(X1),ok(X2)) >= ok(fcons(X1,X2)) ; fcons(X1,mark(X2)) >= mark(fcons(X1,X2)) ; proper(sel(X1,X2)) >= sel(proper(X1),proper(X2)) ; proper(s(X)) >= s(proper(X)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(sel1(X1,X2)) >= sel1(proper(X1),proper(X2)) ; proper(quote(X)) >= quote(proper(X)) ; proper(nil1) >= ok(nil1) ; proper(first1(X1,X2)) >= first1(proper(X1),proper(X2)) ; proper(cons1(X1,X2)) >= cons1(proper(X1),proper(X2)) ; proper(01) >= ok(01) ; proper(quote1(X)) >= quote1(proper(X)) ; proper(s1(X)) >= s1(proper(X)) ; proper(unquote(X)) >= unquote(proper(X)) ; proper(unquote1(X)) >= unquote1(proper(X)) ; proper(fcons(X1,X2)) >= fcons(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.946046 seconds (real time) Cime Exit Status: 0