- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] dbl(0) -> 0 [2] dbl(s(X)) -> s(n__s(n__dbl(activate(X)))) [3] dbls(nil) -> nil [4] dbls(cons(X,Y)) -> cons(n__dbl(activate(X)),n__dbls(activate(Y))) [5] sel(0,cons(X,Y)) -> activate(X) [6] sel(s(X),cons(Y,Z)) -> sel(activate(X),activate(Z)) [7] indx(nil,X) -> nil [8] indx(cons(X,Y),Z) -> cons(n__sel(activate(X),activate(Z)),n__indx(activate(Y),activate(Z))) [9] from(X) -> cons(activate(X),n__from(n__s(activate(X)))) [10] s(X) -> n__s(X) [11] dbl(X) -> n__dbl(X) [12] dbls(X) -> n__dbls(X) [13] sel(X1,X2) -> n__sel(X1,X2) [14] indx(X1,X2) -> n__indx(X1,X2) [15] from(X) -> n__from(X) [16] activate(n__s(X)) -> s(X) [17] activate(n__dbl(X)) -> dbl(X) [18] activate(n__dbls(X)) -> dbls(X) [19] activate(n__sel(X1,X2)) -> sel(X1,X2) [20] activate(n__indx(X1,X2)) -> indx(X1,X2) [21] activate(n__from(X)) -> from(X) [22] activate(X) -> X Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { dbl(0) >= 0 ; dbl(s(X)) >= s(n__s(n__dbl(activate(X)))) ; dbl(X) >= n__dbl(X) ; s(X) >= n__s(X) ; activate(n__s(X)) >= s(X) ; activate(n__dbl(X)) >= dbl(X) ; activate(n__dbls(X)) >= dbls(X) ; activate(n__sel(X1,X2)) >= sel(X1,X2) ; activate(n__indx(X1,X2)) >= indx(X1,X2) ; activate(n__from(X)) >= from(X) ; activate(X) >= X ; dbls(nil) >= nil ; dbls(cons(X,Y)) >= cons(n__dbl(activate(X)),n__dbls(activate(Y))) ; dbls(X) >= n__dbls(X) ; sel(0,cons(X,Y)) >= activate(X) ; sel(s(X),cons(Y,Z)) >= sel(activate(X),activate(Z)) ; sel(X1,X2) >= n__sel(X1,X2) ; indx(nil,X) >= nil ; indx(cons(X,Y),Z) >= cons(n__sel(activate(X),activate(Z)), n__indx(activate(Y),activate(Z))) ; indx(X1,X2) >= n__indx(X1,X2) ; from(X) >= cons(activate(X),n__from(n__s(activate(X)))) ; from(X) >= n__from(X) ; Marked_activate(n__dbl(X)) >= Marked_dbl(X) ; Marked_activate(n__dbls(X)) >= Marked_dbls(X) ; Marked_activate(n__sel(X1,X2)) >= Marked_sel(X1,X2) ; Marked_activate(n__indx(X1,X2)) >= Marked_indx(X1,X2) ; Marked_activate(n__from(X)) >= Marked_from(X) ; Marked_from(X) >= Marked_activate(X) ; Marked_indx(cons(X,Y),Z) >= Marked_activate(X) ; Marked_indx(cons(X,Y),Z) >= Marked_activate(Y) ; Marked_indx(cons(X,Y),Z) >= Marked_activate(Z) ; Marked_sel(0,cons(X,Y)) >= Marked_activate(X) ; Marked_sel(s(X),cons(Y,Z)) >= Marked_activate(X) ; Marked_sel(s(X),cons(Y,Z)) >= Marked_activate(Z) ; Marked_sel(s(X),cons(Y,Z)) >= Marked_sel(activate(X),activate(Z)) ; Marked_dbls(cons(X,Y)) >= Marked_activate(X) ; Marked_dbls(cons(X,Y)) >= Marked_activate(Y) ; Marked_dbl(s(X)) >= Marked_activate(X) ; } + Disjunctions:{ { Marked_activate(n__dbl(X)) > Marked_dbl(X) ; } { Marked_activate(n__dbls(X)) > Marked_dbls(X) ; } { Marked_activate(n__sel(X1,X2)) > Marked_sel(X1,X2) ; } { Marked_activate(n__indx(X1,X2)) > Marked_indx(X1,X2) ; } { Marked_activate(n__from(X)) > Marked_from(X) ; } { Marked_from(X) > Marked_activate(X) ; } { Marked_indx(cons(X,Y),Z) > Marked_activate(X) ; } { Marked_indx(cons(X,Y),Z) > Marked_activate(Y) ; } { Marked_indx(cons(X,Y),Z) > Marked_activate(Z) ; } { Marked_sel(0,cons(X,Y)) > Marked_activate(X) ; } { Marked_sel(s(X),cons(Y,Z)) > Marked_activate(X) ; } { Marked_sel(s(X),cons(Y,Z)) > Marked_activate(Z) ; } { Marked_sel(s(X),cons(Y,Z)) > Marked_sel(activate(X),activate(Z)) ; } { Marked_dbls(cons(X,Y)) > Marked_activate(X) ; } { Marked_dbls(cons(X,Y)) > Marked_activate(Y) ; } { Marked_dbl(s(X)) > Marked_activate(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 : 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 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: { dbl(0) >= 0 ; dbl(s(X)) >= s(n__s(n__dbl(activate(X)))) ; dbl(X) >= n__dbl(X) ; s(X) >= n__s(X) ; activate(n__s(X)) >= s(X) ; activate(n__dbl(X)) >= dbl(X) ; activate(n__dbls(X)) >= dbls(X) ; activate(n__sel(X1,X2)) >= sel(X1,X2) ; activate(n__indx(X1,X2)) >= indx(X1,X2) ; activate(n__from(X)) >= from(X) ; activate(X) >= X ; dbls(nil) >= nil ; dbls(cons(X,Y)) >= cons(n__dbl(activate(X)),n__dbls(activate(Y))) ; dbls(X) >= n__dbls(X) ; sel(0,cons(X,Y)) >= activate(X) ; sel(s(X),cons(Y,Z)) >= sel(activate(X),activate(Z)) ; sel(X1,X2) >= n__sel(X1,X2) ; indx(nil,X) >= nil ; indx(cons(X,Y),Z) >= cons(n__sel(activate(X),activate(Z)), n__indx(activate(Y),activate(Z))) ; indx(X1,X2) >= n__indx(X1,X2) ; from(X) >= cons(activate(X),n__from(n__s(activate(X)))) ; from(X) >= n__from(X) ; Marked_activate(n__dbl(X)) >= Marked_dbl(X) ; Marked_activate(n__dbls(X)) >= Marked_dbls(X) ; Marked_activate(n__sel(X1,X2)) >= Marked_sel(X1,X2) ; Marked_activate(n__indx(X1,X2)) >= Marked_indx(X1,X2) ; Marked_activate(n__from(X)) >= Marked_from(X) ; Marked_from(X) > Marked_activate(X) ; Marked_indx(cons(X,Y),Z) > Marked_activate(X) ; Marked_indx(cons(X,Y),Z) > Marked_activate(Y) ; Marked_indx(cons(X,Y),Z) > Marked_activate(Z) ; Marked_sel(0,cons(X,Y)) > Marked_activate(X) ; Marked_sel(s(X),cons(Y,Z)) > Marked_activate(X) ; Marked_sel(s(X),cons(Y,Z)) > Marked_activate(Z) ; Marked_sel(s(X),cons(Y,Z)) > Marked_sel(activate(X),activate(Z)) ; Marked_dbls(cons(X,Y)) > Marked_activate(X) ; Marked_dbls(cons(X,Y)) > Marked_activate(Y) ; Marked_dbl(s(X)) > Marked_activate(X) ; } APPLY CRITERIA (SOLVE_ORD) Trying to solve the following constraints: { dbl(0) >= 0 ; dbl(s(X)) >= s(n__s(n__dbl(activate(X)))) ; dbl(X) >= n__dbl(X) ; s(X) >= n__s(X) ; activate(n__s(X)) >= s(X) ; activate(n__dbl(X)) >= dbl(X) ; activate(n__dbls(X)) >= dbls(X) ; activate(n__sel(X1,X2)) >= sel(X1,X2) ; activate(n__indx(X1,X2)) >= indx(X1,X2) ; activate(n__from(X)) >= from(X) ; activate(X) >= X ; dbls(nil) >= nil ; dbls(cons(X,Y)) >= cons(n__dbl(activate(X)),n__dbls(activate(Y))) ; dbls(X) >= n__dbls(X) ; sel(0,cons(X,Y)) >= activate(X) ; sel(s(X),cons(Y,Z)) >= sel(activate(X),activate(Z)) ; sel(X1,X2) >= n__sel(X1,X2) ; indx(nil,X) >= nil ; indx(cons(X,Y),Z) >= cons(n__sel(activate(X),activate(Z)), n__indx(activate(Y),activate(Z))) ; indx(X1,X2) >= n__indx(X1,X2) ; from(X) >= cons(activate(X),n__from(n__s(activate(X)))) ; from(X) >= n__from(X) ; Marked_activate(n__dbl(X)) >= Marked_dbl(X) ; Marked_activate(n__dbls(X)) >= Marked_dbls(X) ; Marked_activate(n__sel(X1,X2)) >= Marked_sel(X1,X2) ; Marked_activate(n__indx(X1,X2)) >= Marked_indx(X1,X2) ; Marked_activate(n__from(X)) >= Marked_from(X) ; Marked_from(X) > Marked_activate(X) ; Marked_indx(cons(X,Y),Z) > Marked_activate(X) ; Marked_indx(cons(X,Y),Z) > Marked_activate(Y) ; Marked_indx(cons(X,Y),Z) > Marked_activate(Z) ; Marked_sel(0,cons(X,Y)) > Marked_activate(X) ; Marked_sel(s(X),cons(Y,Z)) > Marked_activate(X) ; Marked_sel(s(X),cons(Y,Z)) > Marked_activate(Z) ; Marked_sel(s(X),cons(Y,Z)) > Marked_sel(activate(X),activate(Z)) ; Marked_dbls(cons(X,Y)) > Marked_activate(X) ; Marked_dbls(cons(X,Y)) > Marked_activate(Y) ; Marked_dbl(s(X)) > Marked_activate(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.(7582 bt (11064) [989]) === 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 56.696000 seconds (real time) Cime Exit Status: 0