- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] active(2nd(cons(X,cons(Y,Z)))) -> mark(Y) [2] active(from(X)) -> mark(cons(X,from(s(X)))) [3] mark(2nd(X)) -> active(2nd(mark(X))) [4] mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) [5] mark(from(X)) -> active(from(mark(X))) [6] mark(s(X)) -> active(s(mark(X))) [7] 2nd(mark(X)) -> 2nd(X) [8] 2nd(active(X)) -> 2nd(X) [9] cons(mark(X1),X2) -> cons(X1,X2) [10] cons(X1,mark(X2)) -> cons(X1,X2) [11] cons(active(X1),X2) -> cons(X1,X2) [12] cons(X1,active(X2)) -> cons(X1,X2) [13] from(mark(X)) -> from(X) [14] from(active(X)) -> from(X) [15] s(mark(X)) -> s(X) [16] s(active(X)) -> s(X) 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(2nd(X)) >= active(2nd(mark(X))) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(from(X)) >= active(from(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; active(2nd(cons(X,cons(Y,Z)))) >= mark(Y) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; 2nd(mark(X)) >= 2nd(X) ; 2nd(active(X)) >= 2nd(X) ; 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) ; Marked_mark(2nd(X)) >= Marked_mark(X) ; Marked_mark(2nd(X)) >= Marked_active(2nd(mark(X))) ; 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_active(2nd(cons(X,cons(Y,Z)))) >= Marked_mark(Y) ; Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) ; } + Disjunctions:{ { Marked_mark(2nd(X)) > Marked_mark(X) ; } { Marked_mark(2nd(X)) > Marked_active(2nd(mark(X))) ; } { 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_active(2nd(cons(X,cons(Y,Z)))) > Marked_mark(Y) ; } { Marked_active(from(X)) > Marked_mark(cons(X,from(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(2nd(X)) >= active(2nd(mark(X))) 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: active(2nd(cons(X,cons(Y,Z)))) >= mark(Y) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: 2nd(mark(X)) >= 2nd(X) constraint: 2nd(active(X)) >= 2nd(X) 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: Marked_mark(2nd(X)) >= Marked_mark(X) constraint: Marked_mark(2nd(X)) >= Marked_active(2nd(mark(X))) 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_active(2nd(cons(X,cons(Y,Z)))) >= Marked_mark(Y) constraint: Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) APPLY CRITERIA (Subterm criterion) ST: Marked_2nd -> 1 APPLY CRITERIA (Subterm criterion) ST: Marked_cons -> 2 APPLY CRITERIA (Subterm criterion) ST: Marked_from -> 1 APPLY CRITERIA (Subterm criterion) ST: Marked_s -> 1 APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(2nd(X)) >= active(2nd(mark(X))) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(from(X)) >= active(from(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; active(2nd(cons(X,cons(Y,Z)))) >= mark(Y) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; 2nd(mark(X)) >= 2nd(X) ; 2nd(active(X)) >= 2nd(X) ; 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) ; Marked_mark(2nd(X)) >= Marked_mark(X) ; Marked_mark(2nd(X)) >= Marked_active(2nd(mark(X))) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; 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_active(2nd(cons(X,cons(Y,Z)))) >= Marked_mark(Y) ; Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) ; } + Disjunctions:{ { Marked_mark(2nd(X)) > Marked_mark(X) ; } { Marked_mark(2nd(X)) > Marked_active(2nd(mark(X))) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { 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_active(2nd(cons(X,cons(Y,Z)))) > Marked_mark(Y) ; } { Marked_active(from(X)) > Marked_mark(cons(X,from(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(2nd(X)) >= active(2nd(mark(X))) 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: active(2nd(cons(X,cons(Y,Z)))) >= mark(Y) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: 2nd(mark(X)) >= 2nd(X) constraint: 2nd(active(X)) >= 2nd(X) 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: Marked_mark(2nd(X)) >= Marked_mark(X) constraint: Marked_mark(2nd(X)) >= Marked_active(2nd(mark(X))) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) 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_active(2nd(cons(X,cons(Y,Z)))) >= Marked_mark(Y) constraint: Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(2nd(X)) >= active(2nd(mark(X))) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(from(X)) >= active(from(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; active(2nd(cons(X,cons(Y,Z)))) >= mark(Y) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; 2nd(mark(X)) >= 2nd(X) ; 2nd(active(X)) >= 2nd(X) ; 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) ; Marked_mark(2nd(X)) >= Marked_mark(X) ; Marked_mark(2nd(X)) >= Marked_active(2nd(mark(X))) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(from(X)) >= Marked_mark(X) ; Marked_mark(from(X)) >= Marked_active(from(mark(X))) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_active(2nd(cons(X,cons(Y,Z)))) >= Marked_mark(Y) ; Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) ; } + Disjunctions:{ { Marked_mark(2nd(X)) > Marked_mark(X) ; } { Marked_mark(2nd(X)) > Marked_active(2nd(mark(X))) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(from(X)) > Marked_mark(X) ; } { Marked_mark(from(X)) > Marked_active(from(mark(X))) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_active(2nd(cons(X,cons(Y,Z)))) > Marked_mark(Y) ; } { Marked_active(from(X)) > Marked_mark(cons(X,from(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 === 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 === === 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 === === 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 Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(2nd(X)) >= active(2nd(mark(X))) 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: active(2nd(cons(X,cons(Y,Z)))) >= mark(Y) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: 2nd(mark(X)) >= 2nd(X) constraint: 2nd(active(X)) >= 2nd(X) 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: Marked_mark(2nd(X)) >= Marked_mark(X) constraint: Marked_mark(2nd(X)) >= Marked_active(2nd(mark(X))) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) 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_active(2nd(cons(X,cons(Y,Z)))) >= Marked_mark(Y) constraint: Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(2nd(X)) >= active(2nd(mark(X))) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(from(X)) >= active(from(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; active(2nd(cons(X,cons(Y,Z)))) >= mark(Y) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; 2nd(mark(X)) >= 2nd(X) ; 2nd(active(X)) >= 2nd(X) ; 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) ; Marked_mark(2nd(X)) >= Marked_mark(X) ; Marked_mark(2nd(X)) >= Marked_active(2nd(mark(X))) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(from(X)) >= Marked_mark(X) ; Marked_mark(from(X)) >= Marked_active(from(mark(X))) ; Marked_active(2nd(cons(X,cons(Y,Z)))) >= Marked_mark(Y) ; Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) ; } + Disjunctions:{ { Marked_mark(2nd(X)) > Marked_mark(X) ; } { Marked_mark(2nd(X)) > Marked_active(2nd(mark(X))) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(from(X)) > Marked_mark(X) ; } { Marked_mark(from(X)) > Marked_active(from(mark(X))) ; } { Marked_active(2nd(cons(X,cons(Y,Z)))) > Marked_mark(Y) ; } { Marked_active(from(X)) > Marked_mark(cons(X,from(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(2nd(X)) >= active(2nd(mark(X))) 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: active(2nd(cons(X,cons(Y,Z)))) >= mark(Y) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: 2nd(mark(X)) >= 2nd(X) constraint: 2nd(active(X)) >= 2nd(X) 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: Marked_mark(2nd(X)) >= Marked_mark(X) constraint: Marked_mark(2nd(X)) >= Marked_active(2nd(mark(X))) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(from(X)) >= Marked_mark(X) constraint: Marked_mark(from(X)) >= Marked_active(from(mark(X))) constraint: Marked_active(2nd(cons(X,cons(Y,Z)))) >= Marked_mark(Y) constraint: Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(2nd(X)) >= active(2nd(mark(X))) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(from(X)) >= active(from(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; active(2nd(cons(X,cons(Y,Z)))) >= mark(Y) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; 2nd(mark(X)) >= 2nd(X) ; 2nd(active(X)) >= 2nd(X) ; 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) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(from(X)) >= Marked_mark(X) ; Marked_mark(from(X)) >= Marked_active(from(mark(X))) ; Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(from(X)) > Marked_mark(X) ; } { Marked_mark(from(X)) > Marked_active(from(mark(X))) ; } { Marked_active(from(X)) > Marked_mark(cons(X,from(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(2nd(X)) >= active(2nd(mark(X))) 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: active(2nd(cons(X,cons(Y,Z)))) >= mark(Y) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: 2nd(mark(X)) >= 2nd(X) constraint: 2nd(active(X)) >= 2nd(X) 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: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(from(X)) >= Marked_mark(X) constraint: Marked_mark(from(X)) >= Marked_active(from(mark(X))) constraint: Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(2nd(X)) >= active(2nd(mark(X))) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(from(X)) >= active(from(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; active(2nd(cons(X,cons(Y,Z)))) >= mark(Y) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; 2nd(mark(X)) >= 2nd(X) ; 2nd(active(X)) >= 2nd(X) ; 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) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(from(X)) >= Marked_active(from(mark(X))) ; Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(from(X)) > Marked_active(from(mark(X))) ; } { Marked_active(from(X)) > Marked_mark(cons(X,from(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 === 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 === === 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 Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(2nd(X)) >= active(2nd(mark(X))) 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: active(2nd(cons(X,cons(Y,Z)))) >= mark(Y) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: 2nd(mark(X)) >= 2nd(X) constraint: 2nd(active(X)) >= 2nd(X) 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: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(from(X)) >= Marked_active(from(mark(X))) constraint: Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Subterm criterion) ST: Marked_mark -> 1 APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Subterm criterion) ST: Marked_cons -> 1 APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: SOLVED { TRS termination of: [1] active(2nd(cons(X,cons(Y,Z)))) -> mark(Y) [2] active(from(X)) -> mark(cons(X,from(s(X)))) [3] mark(2nd(X)) -> active(2nd(mark(X))) [4] mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) [5] mark(from(X)) -> active(from(mark(X))) [6] mark(s(X)) -> active(s(mark(X))) [7] 2nd(mark(X)) -> 2nd(X) [8] 2nd(active(X)) -> 2nd(X) [9] cons(mark(X1),X2) -> cons(X1,X2) [10] cons(X1,mark(X2)) -> cons(X1,X2) [11] cons(active(X1),X2) -> cons(X1,X2) [12] cons(X1,active(X2)) -> cons(X1,X2) [13] from(mark(X)) -> from(X) [14] from(active(X)) -> from(X) [15] s(mark(X)) -> s(X) [16] s(active(X)) -> s(X) , CRITERION: MDP [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ from ] (X0) = 1; [ 2nd ] (X0) = 1; [ Marked_mark ] (X0) = 2; [ active ] (X0) = 0; [ s ] (X0) = 1; [ cons ] (X0,X1) = 0; [ Marked_active ] (X0) = 1*X0 + 1; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ from ] (X0) = 1; [ 2nd ] (X0) = 1; [ Marked_mark ] (X0) = 1; [ active ] (X0) = 0; [ s ] (X0) = 0; [ cons ] (X0,X1) = 0; [ Marked_active ] (X0) = 1*X0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using Matrix polynomial interpretation (strict sub matrices size: 1x1) = [ mark ] (X0) = [ [ 0 , 0 , 0 ] [ 1 , 1 , 1 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ from ] (X0) = [ [ 1 , 1 , 1 ] [ 0 , 0 , 0 ] [ 1 , 1 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ 2nd ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 1 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ Marked_mark ] (X0) = [ [ 1 , 0 , 1 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ active ] (X0) = [ [ 0 , 0 , 0 ] [ 1 , 1 , 1 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ s ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 1 , 1 ] ]*X0 + [ [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] ]; [ cons ] (X0,X1) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 1 , 0 ] ]*X1 + [ [ 1 , 1 , 1 ] [ 1 , 1 , 1 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ Marked_active ] (X0) = [ [ 0 , 0 , 1 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 2*X0; [ from ] (X0) = 2*X0; [ 2nd ] (X0) = 2*X0 + 3; [ Marked_mark ] (X0) = 2*X0 + 2; [ active ] (X0) = 1*X0; [ s ] (X0) = 0; [ cons ] (X0,X1) = 2*X1 + 1*X0; [ Marked_active ] (X0) = 1*X0 + 2; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 1*X0; [ from ] (X0) = 2*X0 + 2; [ 2nd ] (X0) = 2*X0; [ Marked_mark ] (X0) = 2*X0; [ active ] (X0) = 1*X0; [ s ] (X0) = 0; [ cons ] (X0,X1) = 1*X1 + 2*X0; [ Marked_active ] (X0) = 2*X0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using Matrix polynomial interpretation (strict sub matrices size: 1x1) = [ mark ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 0 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ from ] (X0) = [ [ 1 , 0 , 1 ] [ 0 , 0 , 0 ] [ 1 , 0 , 1 ] ]*X0 + [ [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ 2nd ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 0 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ Marked_mark ] (X0) = [ [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ active ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 0 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ s ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ cons ] (X0,X1) = [ [ 0 , 0 , 1 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X1 + [ [ 1 , 0 , 1 ] [ 0 , 0 , 0 ] [ 1 , 0 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ Marked_active ] (X0) = [ [ 0 , 0 , 1 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ST [ { DP termination of: , CRITERION: SG [ ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} { DP termination of: , CRITERION: ST [ { DP termination of: , CRITERION: SG [ ]} ]} { DP termination of: , CRITERION: ST [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ST [ { DP termination of: , CRITERION: SG [ ]} ]} ]} ]} { DP termination of: , CRITERION: ST [ { DP termination of: , CRITERION: SG [ ]} ]} { DP termination of: , CRITERION: ST [ { DP termination of: , CRITERION: SG [ ]} ]} ]} ]} Cime worked for 4.371831 seconds (real time) Cime Exit Status: 0