- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] active(f(X)) -> mark(cons(X,f(g(X)))) [2] active(g(0)) -> mark(s(0)) [3] active(g(s(X))) -> mark(s(s(g(X)))) [4] active(sel(0,cons(X,Y))) -> mark(X) [5] active(sel(s(X),cons(Y,Z))) -> mark(sel(X,Z)) [6] mark(f(X)) -> active(f(mark(X))) [7] mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) [8] mark(g(X)) -> active(g(mark(X))) [9] mark(0) -> active(0) [10] mark(s(X)) -> active(s(mark(X))) [11] mark(sel(X1,X2)) -> active(sel(mark(X1),mark(X2))) [12] f(mark(X)) -> f(X) [13] f(active(X)) -> f(X) [14] cons(mark(X1),X2) -> cons(X1,X2) [15] cons(X1,mark(X2)) -> cons(X1,X2) [16] cons(active(X1),X2) -> cons(X1,X2) [17] cons(X1,active(X2)) -> cons(X1,X2) [18] g(mark(X)) -> g(X) [19] g(active(X)) -> g(X) [20] s(mark(X)) -> s(X) [21] s(active(X)) -> s(X) [22] sel(mark(X1),X2) -> sel(X1,X2) [23] sel(X1,mark(X2)) -> sel(X1,X2) [24] sel(active(X1),X2) -> sel(X1,X2) [25] sel(X1,active(X2)) -> sel(X1,X2) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 6 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(f(X)) >= active(f(mark(X))) ; mark(g(X)) >= active(g(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(0) >= active(0) ; mark(sel(X1,X2)) >= active(sel(mark(X1),mark(X2))) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; f(mark(X)) >= f(X) ; f(active(X)) >= f(X) ; g(mark(X)) >= g(X) ; g(active(X)) >= g(X) ; active(f(X)) >= mark(cons(X,f(g(X)))) ; active(g(s(X))) >= mark(s(s(g(X)))) ; active(g(0)) >= mark(s(0)) ; active(sel(s(X),cons(Y,Z))) >= mark(sel(X,Z)) ; active(sel(0,cons(X,Y))) >= mark(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; sel(mark(X1),X2) >= sel(X1,X2) ; sel(active(X1),X2) >= sel(X1,X2) ; sel(X1,mark(X2)) >= sel(X1,X2) ; sel(X1,active(X2)) >= sel(X1,X2) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(cons(X1,X2)) >= Marked_active(cons(mark(X1),X2)) ; Marked_mark(f(X)) >= Marked_mark(X) ; Marked_mark(f(X)) >= Marked_active(f(mark(X))) ; Marked_mark(g(X)) >= Marked_mark(X) ; Marked_mark(g(X)) >= Marked_active(g(mark(X))) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(s(X)) >= Marked_active(s(mark(X))) ; Marked_mark(sel(X1,X2)) >= Marked_mark(X1) ; Marked_mark(sel(X1,X2)) >= Marked_mark(X2) ; Marked_mark(sel(X1,X2)) >= Marked_active(sel(mark(X1),mark(X2))) ; Marked_active(f(X)) >= Marked_mark(cons(X,f(g(X)))) ; Marked_active(g(s(X))) >= Marked_mark(s(s(g(X)))) ; Marked_active(g(0)) >= Marked_mark(s(0)) ; Marked_active(sel(s(X),cons(Y,Z))) >= Marked_mark(sel(X,Z)) ; Marked_active(sel(0,cons(X,Y))) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(cons(X1,X2)) > Marked_active(cons(mark(X1),X2)) ; } { Marked_mark(f(X)) > Marked_mark(X) ; } { Marked_mark(f(X)) > Marked_active(f(mark(X))) ; } { Marked_mark(g(X)) > Marked_mark(X) ; } { Marked_mark(g(X)) > Marked_active(g(mark(X))) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(s(X)) > Marked_active(s(mark(X))) ; } { Marked_mark(sel(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(sel(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(sel(X1,X2)) > Marked_active(sel(mark(X1),mark(X2))) ; } { Marked_active(f(X)) > Marked_mark(cons(X,f(g(X)))) ; } { Marked_active(g(s(X))) > Marked_mark(s(s(g(X)))) ; } { Marked_active(g(0)) > Marked_mark(s(0)) ; } { Marked_active(sel(s(X),cons(Y,Z))) > Marked_mark(sel(X,Z)) ; } { Marked_active(sel(0,cons(X,Y))) > Marked_mark(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 Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(f(X)) >= active(f(mark(X))) constraint: mark(g(X)) >= active(g(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(0) >= active(0) constraint: mark(sel(X1,X2)) >= active(sel(mark(X1),mark(X2))) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: f(mark(X)) >= f(X) constraint: f(active(X)) >= f(X) constraint: g(mark(X)) >= g(X) constraint: g(active(X)) >= g(X) constraint: active(f(X)) >= mark(cons(X,f(g(X)))) constraint: active(g(s(X))) >= mark(s(s(g(X)))) constraint: active(g(0)) >= mark(s(0)) constraint: active(sel(s(X),cons(Y,Z))) >= mark(sel(X,Z)) constraint: active(sel(0,cons(X,Y))) >= mark(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: sel(mark(X1),X2) >= sel(X1,X2) constraint: sel(active(X1),X2) >= sel(X1,X2) constraint: sel(X1,mark(X2)) >= sel(X1,X2) constraint: sel(X1,active(X2)) >= sel(X1,X2) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(cons(X1,X2)) >= Marked_active(cons(mark(X1),X2)) constraint: Marked_mark(f(X)) >= Marked_mark(X) constraint: Marked_mark(f(X)) >= Marked_active(f(mark(X))) constraint: Marked_mark(g(X)) >= Marked_mark(X) constraint: Marked_mark(g(X)) >= Marked_active(g(mark(X))) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(s(X)) >= Marked_active(s(mark(X))) constraint: Marked_mark(sel(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(sel(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(sel(X1,X2)) >= Marked_active(sel(mark(X1),mark(X2))) constraint: Marked_active(f(X)) >= Marked_mark(cons(X,f(g(X)))) constraint: Marked_active(g(s(X))) >= Marked_mark(s(s(g(X)))) constraint: Marked_active(g(0)) >= Marked_mark(s(0)) constraint: Marked_active(sel(s(X),cons(Y,Z))) >= Marked_mark(sel(X,Z)) constraint: Marked_active(sel(0,cons(X,Y))) >= Marked_mark(X) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(f(X)) >= active(f(mark(X))) ; mark(g(X)) >= active(g(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(0) >= active(0) ; mark(sel(X1,X2)) >= active(sel(mark(X1),mark(X2))) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; f(mark(X)) >= f(X) ; f(active(X)) >= f(X) ; g(mark(X)) >= g(X) ; g(active(X)) >= g(X) ; active(f(X)) >= mark(cons(X,f(g(X)))) ; active(g(s(X))) >= mark(s(s(g(X)))) ; active(g(0)) >= mark(s(0)) ; active(sel(s(X),cons(Y,Z))) >= mark(sel(X,Z)) ; active(sel(0,cons(X,Y))) >= mark(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; sel(mark(X1),X2) >= sel(X1,X2) ; sel(active(X1),X2) >= sel(X1,X2) ; sel(X1,mark(X2)) >= sel(X1,X2) ; sel(X1,active(X2)) >= sel(X1,X2) ; Marked_f(mark(X)) >= Marked_f(X) ; Marked_f(active(X)) >= Marked_f(X) ; } + Disjunctions:{ { Marked_f(mark(X)) > Marked_f(X) ; } { Marked_f(active(X)) > Marked_f(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 (ID_CRIT) NOT SOLVED No proof found Cime worked for 51.593891 seconds (real time) Cime Exit Status: 0