- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] active(from(X)) -> mark(cons(X,from(s(X)))) [2] active(after(0,XS)) -> mark(XS) [3] active(after(s(N),cons(X,XS))) -> mark(after(N,XS)) [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(after(X1,X2)) -> active(after(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] after(mark(X1),X2) -> after(X1,X2) [18] after(X1,mark(X2)) -> after(X1,X2) [19] after(active(X1),X2) -> after(X1,X2) [20] after(X1,active(X2)) -> after(X1,X2) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 5 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } 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(after(X1,X2)) >= active(after(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(after(s(N),cons(X,XS))) >= mark(after(N,XS)) ; active(after(0,XS)) >= mark(XS) ; after(mark(X1),X2) >= after(X1,X2) ; after(active(X1),X2) >= after(X1,X2) ; after(X1,mark(X2)) >= after(X1,X2) ; after(X1,active(X2)) >= after(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(after(X1,X2)) >= Marked_mark(X1) ; Marked_mark(after(X1,X2)) >= Marked_mark(X2) ; Marked_mark(after(X1,X2)) >= Marked_active(after(mark(X1),mark(X2))) ; Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) ; Marked_active(after(s(N),cons(X,XS))) >= Marked_mark(after(N,XS)) ; Marked_active(after(0,XS)) >= Marked_mark(XS) ; } + 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(after(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(after(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(after(X1,X2)) > Marked_active(after(mark(X1),mark(X2))) ; } { Marked_active(from(X)) > Marked_mark(cons(X,from(s(X)))) ; } { Marked_active(after(s(N),cons(X,XS))) > Marked_mark(after(N,XS)) ; } { Marked_active(after(0,XS)) > Marked_mark(XS) ; } } === 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(after(X1,X2)) >= active(after(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(after(s(N),cons(X,XS))) >= mark(after(N,XS)) constraint: active(after(0,XS)) >= mark(XS) constraint: after(mark(X1),X2) >= after(X1,X2) constraint: after(active(X1),X2) >= after(X1,X2) constraint: after(X1,mark(X2)) >= after(X1,X2) constraint: after(X1,active(X2)) >= after(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(after(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(after(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(after(X1,X2)) >= Marked_active(after(mark(X1),mark(X2))) constraint: Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) constraint: Marked_active(after(s(N),cons(X,XS))) >= Marked_mark(after(N,XS)) constraint: Marked_active(after(0,XS)) >= Marked_mark(XS) 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(after(X1,X2)) >= active(after(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(after(s(N),cons(X,XS))) >= mark(after(N,XS)) ; active(after(0,XS)) >= mark(XS) ; after(mark(X1),X2) >= after(X1,X2) ; after(active(X1),X2) >= after(X1,X2) ; after(X1,mark(X2)) >= after(X1,X2) ; after(X1,active(X2)) >= after(X1,X2) ; Marked_from(mark(X)) >= Marked_from(X) ; Marked_from(active(X)) >= Marked_from(X) ; } + Disjunctions:{ { Marked_from(mark(X)) > Marked_from(X) ; } { Marked_from(active(X)) > Marked_from(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(after(X1,X2)) >= active(after(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(after(s(N),cons(X,XS))) >= mark(after(N,XS)) constraint: active(after(0,XS)) >= mark(XS) constraint: after(mark(X1),X2) >= after(X1,X2) constraint: after(active(X1),X2) >= after(X1,X2) constraint: after(X1,mark(X2)) >= after(X1,X2) constraint: after(X1,active(X2)) >= after(X1,X2) constraint: Marked_from(mark(X)) >= Marked_from(X) constraint: Marked_from(active(X)) >= Marked_from(X) 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(after(X1,X2)) >= active(after(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(after(s(N),cons(X,XS))) >= mark(after(N,XS)) ; active(after(0,XS)) >= mark(XS) ; after(mark(X1),X2) >= after(X1,X2) ; after(active(X1),X2) >= after(X1,X2) ; after(X1,mark(X2)) >= after(X1,X2) ; after(X1,active(X2)) >= after(X1,X2) ; Marked_cons(mark(X1),X2) >= Marked_cons(X1,X2) ; Marked_cons(active(X1),X2) >= Marked_cons(X1,X2) ; Marked_cons(X1,mark(X2)) >= Marked_cons(X1,X2) ; Marked_cons(X1,active(X2)) >= Marked_cons(X1,X2) ; } + Disjunctions:{ { Marked_cons(mark(X1),X2) > Marked_cons(X1,X2) ; } { Marked_cons(active(X1),X2) > Marked_cons(X1,X2) ; } { Marked_cons(X1,mark(X2)) > Marked_cons(X1,X2) ; } { Marked_cons(X1,active(X2)) > Marked_cons(X1,X2) ; } } === 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(after(X1,X2)) >= active(after(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(after(s(N),cons(X,XS))) >= mark(after(N,XS)) constraint: active(after(0,XS)) >= mark(XS) constraint: after(mark(X1),X2) >= after(X1,X2) constraint: after(active(X1),X2) >= after(X1,X2) constraint: after(X1,mark(X2)) >= after(X1,X2) constraint: after(X1,active(X2)) >= after(X1,X2) constraint: Marked_cons(mark(X1),X2) >= Marked_cons(X1,X2) constraint: Marked_cons(active(X1),X2) >= Marked_cons(X1,X2) constraint: Marked_cons(X1,mark(X2)) >= Marked_cons(X1,X2) constraint: Marked_cons(X1,active(X2)) >= Marked_cons(X1,X2) 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(after(X1,X2)) >= active(after(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(after(s(N),cons(X,XS))) >= mark(after(N,XS)) ; active(after(0,XS)) >= mark(XS) ; after(mark(X1),X2) >= after(X1,X2) ; after(active(X1),X2) >= after(X1,X2) ; after(X1,mark(X2)) >= after(X1,X2) ; after(X1,active(X2)) >= after(X1,X2) ; Marked_s(mark(X)) >= Marked_s(X) ; Marked_s(active(X)) >= Marked_s(X) ; } + Disjunctions:{ { Marked_s(mark(X)) > Marked_s(X) ; } { Marked_s(active(X)) > Marked_s(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(after(X1,X2)) >= active(after(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(after(s(N),cons(X,XS))) >= mark(after(N,XS)) constraint: active(after(0,XS)) >= mark(XS) constraint: after(mark(X1),X2) >= after(X1,X2) constraint: after(active(X1),X2) >= after(X1,X2) constraint: after(X1,mark(X2)) >= after(X1,X2) constraint: after(X1,active(X2)) >= after(X1,X2) constraint: Marked_s(mark(X)) >= Marked_s(X) constraint: Marked_s(active(X)) >= Marked_s(X) 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(after(X1,X2)) >= active(after(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(after(s(N),cons(X,XS))) >= mark(after(N,XS)) ; active(after(0,XS)) >= mark(XS) ; after(mark(X1),X2) >= after(X1,X2) ; after(active(X1),X2) >= after(X1,X2) ; after(X1,mark(X2)) >= after(X1,X2) ; after(X1,active(X2)) >= after(X1,X2) ; Marked_after(mark(X1),X2) >= Marked_after(X1,X2) ; Marked_after(active(X1),X2) >= Marked_after(X1,X2) ; Marked_after(X1,mark(X2)) >= Marked_after(X1,X2) ; Marked_after(X1,active(X2)) >= Marked_after(X1,X2) ; } + Disjunctions:{ { Marked_after(mark(X1),X2) > Marked_after(X1,X2) ; } { Marked_after(active(X1),X2) > Marked_after(X1,X2) ; } { Marked_after(X1,mark(X2)) > Marked_after(X1,X2) ; } { Marked_after(X1,active(X2)) > Marked_after(X1,X2) ; } } === 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(after(X1,X2)) >= active(after(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(after(s(N),cons(X,XS))) >= mark(after(N,XS)) constraint: active(after(0,XS)) >= mark(XS) constraint: after(mark(X1),X2) >= after(X1,X2) constraint: after(active(X1),X2) >= after(X1,X2) constraint: after(X1,mark(X2)) >= after(X1,X2) constraint: after(X1,active(X2)) >= after(X1,X2) constraint: Marked_after(mark(X1),X2) >= Marked_after(X1,X2) constraint: Marked_after(active(X1),X2) >= Marked_after(X1,X2) constraint: Marked_after(X1,mark(X2)) >= Marked_after(X1,X2) constraint: Marked_after(X1,active(X2)) >= Marked_after(X1,X2) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> -->