- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] active(from(X)) -> mark(cons(X,from(s(X)))) [2] active(sel(0,cons(X,Y))) -> mark(X) [3] active(sel(s(X),cons(Y,Z))) -> mark(sel(X,Z)) [4] mark(from(X)) -> active(from(mark(X))) [5] mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) [6] mark(s(X)) -> active(s(mark(X))) [7] mark(sel(X1,X2)) -> active(sel(mark(X1),mark(X2))) [8] mark(0) -> active(0) [9] from(mark(X)) -> from(X) [10] from(active(X)) -> from(X) [11] cons(mark(X1),X2) -> cons(X1,X2) [12] cons(X1,mark(X2)) -> cons(X1,X2) [13] cons(active(X1),X2) -> cons(X1,X2) [14] cons(X1,active(X2)) -> cons(X1,X2) [15] s(mark(X)) -> s(X) [16] s(active(X)) -> s(X) [17] sel(mark(X1),X2) -> sel(X1,X2) [18] sel(X1,mark(X2)) -> sel(X1,X2) [19] sel(active(X1),X2) -> sel(X1,X2) [20] sel(X1,active(X2)) -> sel(X1,X2) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 5 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(from(X)) >= active(from(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(sel(X1,X2)) >= active(sel(mark(X1),mark(X2))) ; mark(0) >= active(0) ; 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) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(sel(s(X),cons(Y,Z))) >= mark(sel(X,Z)) ; active(sel(0,cons(X,Y))) >= mark(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(from(X)) >= Marked_mark(X) ; Marked_mark(from(X)) >= Marked_active(from(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(from(X)) >= Marked_mark(cons(X,from(s(X)))) ; 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(from(X)) > Marked_mark(X) ; } { Marked_mark(from(X)) > Marked_active(from(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(from(X)) > Marked_mark(cons(X,from(s(X)))) ; } { 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(from(X)) >= active(from(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(sel(X1,X2)) >= active(sel(mark(X1),mark(X2))) constraint: mark(0) >= active(0) 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: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(sel(s(X),cons(Y,Z))) >= mark(sel(X,Z)) constraint: active(sel(0,cons(X,Y))) >= mark(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(from(X)) >= Marked_mark(X) constraint: Marked_mark(from(X)) >= Marked_active(from(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(from(X)) >= Marked_mark(cons(X,from(s(X)))) 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 (Subterm criterion) ST: Marked_from -> 1 APPLY CRITERIA (Subterm criterion) ST: Marked_cons -> 2 APPLY CRITERIA (Subterm criterion) ST: Marked_s -> 1 APPLY CRITERIA (Subterm criterion) ST: Marked_sel -> 2 APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> -->