- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] from(X) -> cons(X,n__from(n__s(X))) [2] length(n__nil) -> 0 [3] length(n__cons(X,Y)) -> s(length1(activate(Y))) [4] length1(X) -> length(activate(X)) [5] from(X) -> n__from(X) [6] s(X) -> n__s(X) [7] nil -> n__nil [8] cons(X1,X2) -> n__cons(X1,X2) [9] activate(n__from(X)) -> from(activate(X)) [10] activate(n__s(X)) -> s(activate(X)) [11] activate(n__nil) -> nil [12] activate(n__cons(X1,X2)) -> cons(activate(X1),X2) [13] activate(X) -> X Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 2 components: { --> --> } { --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { cons(X1,X2) >= n__cons(X1,X2) ; from(X) >= cons(X,n__from(n__s(X))) ; from(X) >= n__from(X) ; length(n__nil) >= 0 ; length(n__cons(X,Y)) >= s(length1(activate(Y))) ; s(X) >= n__s(X) ; length1(X) >= length(activate(X)) ; activate(n__from(X)) >= from(activate(X)) ; activate(n__s(X)) >= s(activate(X)) ; activate(n__nil) >= nil ; activate(n__cons(X1,X2)) >= cons(activate(X1),X2) ; activate(X) >= X ; nil >= n__nil ; Marked_length1(X) >= Marked_length(activate(X)) ; Marked_length(n__cons(X,Y)) >= Marked_length1(activate(Y)) ; } + Disjunctions:{ { Marked_length1(X) > Marked_length(activate(X)) ; } { Marked_length(n__cons(X,Y)) > Marked_length1(activate(Y)) ; } } === 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 (Simple graph) Found the following constraints: { cons(X1,X2) >= n__cons(X1,X2) ; from(X) >= cons(X,n__from(n__s(X))) ; from(X) >= n__from(X) ; length(n__nil) >= 0 ; length(n__cons(X,Y)) >= s(length1(activate(Y))) ; s(X) >= n__s(X) ; length1(X) >= length(activate(X)) ; activate(n__from(X)) >= from(activate(X)) ; activate(n__s(X)) >= s(activate(X)) ; activate(n__nil) >= nil ; activate(n__cons(X1,X2)) >= cons(activate(X1),X2) ; activate(X) >= X ; nil >= n__nil ; Marked_length1(X) >= Marked_length(activate(X)) ; Marked_length(n__cons(X,Y)) > Marked_length1(activate(Y)) ; } APPLY CRITERIA (SOLVE_ORD) Trying to solve the following constraints: { cons(X1,X2) >= n__cons(X1,X2) ; from(X) >= cons(X,n__from(n__s(X))) ; from(X) >= n__from(X) ; length(n__nil) >= 0 ; length(n__cons(X,Y)) >= s(length1(activate(Y))) ; s(X) >= n__s(X) ; length1(X) >= length(activate(X)) ; activate(n__from(X)) >= from(activate(X)) ; activate(n__s(X)) >= s(activate(X)) ; activate(n__nil) >= nil ; activate(n__cons(X1,X2)) >= cons(activate(X1),X2) ; activate(X) >= X ; nil >= n__nil ; Marked_length1(X) >= Marked_length(activate(X)) ; Marked_length(n__cons(X,Y)) > Marked_length1(activate(Y)) ; } + 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.(4990 bt (7078) [188]) === 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 1.761146 seconds (real time) Cime Exit Status: 0