- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] active(zeros) -> mark(cons(0,zeros)) [2] active(and(tt,X)) -> mark(X) [3] active(length(nil)) -> mark(0) [4] active(length(cons(N,L))) -> mark(s(length(L))) [5] active(take(0,IL)) -> mark(nil) [6] active(take(s(M),cons(N,IL))) -> mark(cons(N,take(M,IL))) [7] active(cons(X1,X2)) -> cons(active(X1),X2) [8] active(and(X1,X2)) -> and(active(X1),X2) [9] active(length(X)) -> length(active(X)) [10] active(s(X)) -> s(active(X)) [11] active(take(X1,X2)) -> take(active(X1),X2) [12] active(take(X1,X2)) -> take(X1,active(X2)) [13] cons(mark(X1),X2) -> mark(cons(X1,X2)) [14] and(mark(X1),X2) -> mark(and(X1,X2)) [15] length(mark(X)) -> mark(length(X)) [16] s(mark(X)) -> mark(s(X)) [17] take(mark(X1),X2) -> mark(take(X1,X2)) [18] take(X1,mark(X2)) -> mark(take(X1,X2)) [19] proper(zeros) -> ok(zeros) [20] proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) [21] proper(0) -> ok(0) [22] proper(and(X1,X2)) -> and(proper(X1),proper(X2)) [23] proper(tt) -> ok(tt) [24] proper(length(X)) -> length(proper(X)) [25] proper(nil) -> ok(nil) [26] proper(s(X)) -> s(proper(X)) [27] proper(take(X1,X2)) -> take(proper(X1),proper(X2)) [28] cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) [29] and(ok(X1),ok(X2)) -> ok(and(X1,X2)) [30] length(ok(X)) -> ok(length(X)) [31] s(ok(X)) -> ok(s(X)) [32] take(ok(X1),ok(X2)) -> ok(take(X1,X2)) [33] top(mark(X)) -> top(proper(X)) [34] top(ok(X)) -> top(active(X)) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 8 components: { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(and(tt,X)) >= mark(X) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(length(cons(N,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; active(length(X)) >= length(active(X)) ; active(s(X)) >= s(active(X)) ; active(take(0,IL)) >= mark(nil) ; active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) ; active(take(X1,X2)) >= take(active(X1),X2) ; active(take(X1,X2)) >= take(X1,active(X2)) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; length(mark(X)) >= mark(length(X)) ; length(ok(X)) >= ok(length(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(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(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(zeros) >= ok(zeros) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(tt) >= ok(tt) ; proper(length(X)) >= length(proper(X)) ; proper(nil) >= ok(nil) ; proper(s(X)) >= s(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 === === 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: { cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(and(tt,X)) >= mark(X) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(length(cons(N,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; active(length(X)) >= length(active(X)) ; active(s(X)) >= s(active(X)) ; active(take(0,IL)) >= mark(nil) ; active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) ; active(take(X1,X2)) >= take(active(X1),X2) ; active(take(X1,X2)) >= take(X1,active(X2)) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; length(mark(X)) >= mark(length(X)) ; length(ok(X)) >= ok(length(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(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(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(zeros) >= ok(zeros) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(tt) >= ok(tt) ; proper(length(X)) >= length(proper(X)) ; proper(nil) >= ok(nil) ; proper(s(X)) >= s(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: { cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(zeros) >= mark(cons(0,zeros)) ; active(and(tt,X)) >= mark(X) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(length(cons(N,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; active(length(X)) >= length(active(X)) ; active(s(X)) >= s(active(X)) ; active(take(0,IL)) >= mark(nil) ; active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) ; active(take(X1,X2)) >= take(active(X1),X2) ; active(take(X1,X2)) >= take(X1,active(X2)) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; length(mark(X)) >= mark(length(X)) ; length(ok(X)) >= ok(length(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(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(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(zeros) >= ok(zeros) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(tt) >= ok(tt) ; proper(length(X)) >= length(proper(X)) ; proper(nil) >= ok(nil) ; proper(s(X)) >= s(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 === No solution found for these parameters.(1184 bt (1684) [61]) === 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 92.882860 seconds (real time) Cime Exit Status: 0