- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] active(f(X)) -> mark(if(X,c,f(true))) [2] active(if(true,X,Y)) -> mark(X) [3] active(if(false,X,Y)) -> mark(Y) [4] mark(f(X)) -> active(f(mark(X))) [5] mark(if(X1,X2,X3)) -> active(if(mark(X1),mark(X2),X3)) [6] mark(c) -> active(c) [7] mark(true) -> active(true) [8] mark(false) -> active(false) [9] f(mark(X)) -> f(X) [10] f(active(X)) -> f(X) [11] if(mark(X1),X2,X3) -> if(X1,X2,X3) [12] if(X1,mark(X2),X3) -> if(X1,X2,X3) [13] if(X1,X2,mark(X3)) -> if(X1,X2,X3) [14] if(active(X1),X2,X3) -> if(X1,X2,X3) [15] if(X1,active(X2),X3) -> if(X1,X2,X3) [16] if(X1,X2,active(X3)) -> if(X1,X2,X3) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 3 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(if(X1,X2,X3)) >= active(if(mark(X1),mark(X2),X3)) ; mark(c) >= active(c) ; mark(f(X)) >= active(f(mark(X))) ; mark(true) >= active(true) ; mark(false) >= active(false) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; f(mark(X)) >= f(X) ; f(active(X)) >= f(X) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(f(X)) >= mark(if(X,c,f(true))) ; Marked_mark(if(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(if(X1,X2,X3)) >= Marked_mark(X2) ; Marked_mark(if(X1,X2,X3)) >= Marked_active(if(mark(X1),mark(X2),X3)) ; Marked_mark(f(X)) >= Marked_mark(X) ; Marked_mark(f(X)) >= Marked_active(f(mark(X))) ; Marked_active(if(true,X,Y)) >= Marked_mark(X) ; Marked_active(if(false,X,Y)) >= Marked_mark(Y) ; Marked_active(f(X)) >= Marked_mark(if(X,c,f(true))) ; } + Disjunctions:{ { Marked_mark(if(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(if(X1,X2,X3)) > Marked_mark(X2) ; } { Marked_mark(if(X1,X2,X3)) > Marked_active(if(mark(X1),mark(X2),X3)) ; } { Marked_mark(f(X)) > Marked_mark(X) ; } { Marked_mark(f(X)) > Marked_active(f(mark(X))) ; } { Marked_active(if(true,X,Y)) > Marked_mark(X) ; } { Marked_active(if(false,X,Y)) > Marked_mark(Y) ; } { Marked_active(f(X)) > Marked_mark(if(X,c,f(true))) ; } } === 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(if(X1,X2,X3)) >= active(if(mark(X1),mark(X2),X3)) constraint: mark(c) >= active(c) constraint: mark(f(X)) >= active(f(mark(X))) constraint: mark(true) >= active(true) constraint: mark(false) >= active(false) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: f(mark(X)) >= f(X) constraint: f(active(X)) >= f(X) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(f(X)) >= mark(if(X,c,f(true))) constraint: Marked_mark(if(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(if(X1,X2,X3)) >= Marked_mark(X2) constraint: Marked_mark(if(X1,X2,X3)) >= Marked_active(if(mark(X1),mark(X2),X3)) constraint: Marked_mark(f(X)) >= Marked_mark(X) constraint: Marked_mark(f(X)) >= Marked_active(f(mark(X))) constraint: Marked_active(if(true,X,Y)) >= Marked_mark(X) constraint: Marked_active(if(false,X,Y)) >= Marked_mark(Y) constraint: Marked_active(f(X)) >= Marked_mark(if(X,c,f(true))) APPLY CRITERIA (Subterm criterion) ST: Marked_f -> 1 APPLY CRITERIA (Subterm criterion) ST: Marked_if -> 3 APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(if(X1,X2,X3)) >= active(if(mark(X1),mark(X2),X3)) ; mark(c) >= active(c) ; mark(f(X)) >= active(f(mark(X))) ; mark(true) >= active(true) ; mark(false) >= active(false) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; f(mark(X)) >= f(X) ; f(active(X)) >= f(X) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(f(X)) >= mark(if(X,c,f(true))) ; Marked_mark(if(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(if(X1,X2,X3)) >= Marked_mark(X2) ; Marked_mark(if(X1,X2,X3)) >= Marked_active(if(mark(X1),mark(X2),X3)) ; Marked_mark(f(X)) >= Marked_mark(X) ; Marked_mark(f(X)) >= Marked_active(f(mark(X))) ; Marked_active(if(true,X,Y)) >= Marked_mark(X) ; Marked_active(f(X)) >= Marked_mark(if(X,c,f(true))) ; } + Disjunctions:{ { Marked_mark(if(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(if(X1,X2,X3)) > Marked_mark(X2) ; } { Marked_mark(if(X1,X2,X3)) > Marked_active(if(mark(X1),mark(X2),X3)) ; } { Marked_mark(f(X)) > Marked_mark(X) ; } { Marked_mark(f(X)) > Marked_active(f(mark(X))) ; } { Marked_active(if(true,X,Y)) > Marked_mark(X) ; } { Marked_active(f(X)) > Marked_mark(if(X,c,f(true))) ; } } === 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(if(X1,X2,X3)) >= active(if(mark(X1),mark(X2),X3)) constraint: mark(c) >= active(c) constraint: mark(f(X)) >= active(f(mark(X))) constraint: mark(true) >= active(true) constraint: mark(false) >= active(false) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: f(mark(X)) >= f(X) constraint: f(active(X)) >= f(X) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(f(X)) >= mark(if(X,c,f(true))) constraint: Marked_mark(if(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(if(X1,X2,X3)) >= Marked_mark(X2) constraint: Marked_mark(if(X1,X2,X3)) >= Marked_active(if(mark(X1),mark(X2),X3)) constraint: Marked_mark(f(X)) >= Marked_mark(X) constraint: Marked_mark(f(X)) >= Marked_active(f(mark(X))) constraint: Marked_active(if(true,X,Y)) >= Marked_mark(X) constraint: Marked_active(f(X)) >= Marked_mark(if(X,c,f(true))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(if(X1,X2,X3)) >= active(if(mark(X1),mark(X2),X3)) ; mark(c) >= active(c) ; mark(f(X)) >= active(f(mark(X))) ; mark(true) >= active(true) ; mark(false) >= active(false) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; f(mark(X)) >= f(X) ; f(active(X)) >= f(X) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(f(X)) >= mark(if(X,c,f(true))) ; Marked_mark(if(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(if(X1,X2,X3)) >= Marked_mark(X2) ; Marked_mark(if(X1,X2,X3)) >= Marked_active(if(mark(X1),mark(X2),X3)) ; Marked_mark(f(X)) >= Marked_active(f(mark(X))) ; Marked_active(if(true,X,Y)) >= Marked_mark(X) ; Marked_active(f(X)) >= Marked_mark(if(X,c,f(true))) ; } + Disjunctions:{ { Marked_mark(if(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(if(X1,X2,X3)) > Marked_mark(X2) ; } { Marked_mark(if(X1,X2,X3)) > Marked_active(if(mark(X1),mark(X2),X3)) ; } { Marked_mark(f(X)) > Marked_active(f(mark(X))) ; } { Marked_active(if(true,X,Y)) > Marked_mark(X) ; } { Marked_active(f(X)) > Marked_mark(if(X,c,f(true))) ; } } === 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 : 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 Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),mark(X2),X3)) constraint: mark(c) >= active(c) constraint: mark(f(X)) >= active(f(mark(X))) constraint: mark(true) >= active(true) constraint: mark(false) >= active(false) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: f(mark(X)) >= f(X) constraint: f(active(X)) >= f(X) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(f(X)) >= mark(if(X,c,f(true))) constraint: Marked_mark(if(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(if(X1,X2,X3)) >= Marked_mark(X2) constraint: Marked_mark(if(X1,X2,X3)) >= Marked_active(if(mark(X1),mark(X2),X3)) constraint: Marked_mark(f(X)) >= Marked_active(f(mark(X))) constraint: Marked_active(if(true,X,Y)) >= Marked_mark(X) constraint: Marked_active(f(X)) >= Marked_mark(if(X,c,f(true))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(if(X1,X2,X3)) >= active(if(mark(X1),mark(X2),X3)) ; mark(c) >= active(c) ; mark(f(X)) >= active(f(mark(X))) ; mark(true) >= active(true) ; mark(false) >= active(false) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; f(mark(X)) >= f(X) ; f(active(X)) >= f(X) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(f(X)) >= mark(if(X,c,f(true))) ; Marked_mark(if(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(if(X1,X2,X3)) >= Marked_mark(X2) ; Marked_mark(if(X1,X2,X3)) >= Marked_active(if(mark(X1),mark(X2),X3)) ; Marked_mark(f(X)) >= Marked_active(f(mark(X))) ; Marked_active(if(true,X,Y)) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_mark(if(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(if(X1,X2,X3)) > Marked_mark(X2) ; } { Marked_mark(if(X1,X2,X3)) > Marked_active(if(mark(X1),mark(X2),X3)) ; } { Marked_mark(f(X)) > Marked_active(f(mark(X))) ; } { Marked_active(if(true,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(if(X1,X2,X3)) >= active(if(mark(X1),mark(X2),X3)) constraint: mark(c) >= active(c) constraint: mark(f(X)) >= active(f(mark(X))) constraint: mark(true) >= active(true) constraint: mark(false) >= active(false) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: f(mark(X)) >= f(X) constraint: f(active(X)) >= f(X) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(f(X)) >= mark(if(X,c,f(true))) constraint: Marked_mark(if(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(if(X1,X2,X3)) >= Marked_mark(X2) constraint: Marked_mark(if(X1,X2,X3)) >= Marked_active(if(mark(X1),mark(X2),X3)) constraint: Marked_mark(f(X)) >= Marked_active(f(mark(X))) constraint: Marked_active(if(true,X,Y)) >= Marked_mark(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(if(X1,X2,X3)) >= active(if(mark(X1),mark(X2),X3)) ; mark(c) >= active(c) ; mark(f(X)) >= active(f(mark(X))) ; mark(true) >= active(true) ; mark(false) >= active(false) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; f(mark(X)) >= f(X) ; f(active(X)) >= f(X) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(f(X)) >= mark(if(X,c,f(true))) ; Marked_mark(if(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(if(X1,X2,X3)) >= Marked_mark(X2) ; Marked_mark(if(X1,X2,X3)) >= Marked_active(if(mark(X1),mark(X2),X3)) ; Marked_active(if(true,X,Y)) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_mark(if(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(if(X1,X2,X3)) > Marked_mark(X2) ; } { Marked_mark(if(X1,X2,X3)) > Marked_active(if(mark(X1),mark(X2),X3)) ; } { Marked_active(if(true,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 === 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 : 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 Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),mark(X2),X3)) constraint: mark(c) >= active(c) constraint: mark(f(X)) >= active(f(mark(X))) constraint: mark(true) >= active(true) constraint: mark(false) >= active(false) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: f(mark(X)) >= f(X) constraint: f(active(X)) >= f(X) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(f(X)) >= mark(if(X,c,f(true))) constraint: Marked_mark(if(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(if(X1,X2,X3)) >= Marked_mark(X2) constraint: Marked_mark(if(X1,X2,X3)) >= Marked_active(if(mark(X1),mark(X2),X3)) constraint: Marked_active(if(true,X,Y)) >= Marked_mark(X) 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_if -> 2 APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Subterm criterion) ST: Marked_if -> 1 APPLY CRITERIA (Graph splitting) Found 0 components: SOLVED { TRS termination of: [1] active(f(X)) -> mark(if(X,c,f(true))) [2] active(if(true,X,Y)) -> mark(X) [3] active(if(false,X,Y)) -> mark(Y) [4] mark(f(X)) -> active(f(mark(X))) [5] mark(if(X1,X2,X3)) -> active(if(mark(X1),mark(X2),X3)) [6] mark(c) -> active(c) [7] mark(true) -> active(true) [8] mark(false) -> active(false) [9] f(mark(X)) -> f(X) [10] f(active(X)) -> f(X) [11] if(mark(X1),X2,X3) -> if(X1,X2,X3) [12] if(X1,mark(X2),X3) -> if(X1,X2,X3) [13] if(X1,X2,mark(X3)) -> if(X1,X2,X3) [14] if(active(X1),X2,X3) -> if(X1,X2,X3) [15] if(X1,active(X2),X3) -> if(X1,X2,X3) [16] if(X1,X2,active(X3)) -> if(X1,X2,X3) , CRITERION: MDP [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 1*X0; [ true ] () = 0; [ c ] () = 0; [ Marked_active ] (X0) = 2*X0; [ false ] () = 2; [ if ] (X0,X1,X2) = 2*X2 + 2*X1 + 2*X0; [ Marked_mark ] (X0) = 2*X0; [ active ] (X0) = 1*X0; [ f ] (X0) = 2*X0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 1*X0; [ true ] () = 0; [ c ] () = 0; [ Marked_active ] (X0) = 2*X0; [ false ] () = 0; [ if ] (X0,X1,X2) = 1*X2 + 1*X1 + 1*X0; [ Marked_mark ] (X0) = 2*X0; [ active ] (X0) = 1*X0; [ f ] (X0) = 1*X0 + 2; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 1*X0; [ true ] () = 0; [ c ] () = 0; [ Marked_active ] (X0) = 2*X0; [ false ] () = 2; [ if ] (X0,X1,X2) = 1*X2*X0 + 2*X1 + 1*X0; [ Marked_mark ] (X0) = 2*X0; [ active ] (X0) = 1*X0; [ f ] (X0) = 2*X0 + 1; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ true ] () = 0; [ c ] () = 0; [ Marked_active ] (X0) = 1*X0; [ false ] () = 0; [ if ] (X0,X1,X2) = 2; [ Marked_mark ] (X0) = 2; [ active ] (X0) = 0; [ f ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 1*X0; [ true ] () = 0; [ c ] () = 0; [ Marked_active ] (X0) = 1*X0; [ false ] () = 1; [ if ] (X0,X1,X2) = 1*X2*X0 + 2*X1 + 1*X0 + 1; [ Marked_mark ] (X0) = 1*X0; [ active ] (X0) = 1*X0; [ f ] (X0) = 2*X0 + 1; 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 [ ]} ]} ]} ]} ]} ]} ]} ]} Cime worked for 1.088557 seconds (real time) Cime Exit Status: 0