- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] 0(#) -> # [2] +(x,#) -> x [3] +(#,x) -> x [4] +(0(x),0(y)) -> 0(+(x,y)) [5] +(0(x),1(y)) -> 1(+(x,y)) [6] +(1(x),0(y)) -> 1(+(x,y)) [7] +(1(x),1(y)) -> 0(+(+(x,y),1(#))) [8] +(+(x,y),z) -> +(x,+(y,z)) [9] *(#,x) -> # [10] *(0(x),y) -> 0( *(x,y)) [11] *(1(x),y) -> +(0( *(x,y)),y) [12] *( *(x,y),z) -> *(x, *(y,z)) [13] sum(nil) -> 0(#) [14] sum(cons(x,l)) -> +(x,sum(l)) [15] prod(nil) -> 1(#) [16] prod(cons(x,l)) -> *(x,prod(l)) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 4 components: { --> } { --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { 0(#) >= # ; +(#,x) >= x ; +(0(x),0(y)) >= 0(+(x,y)) ; +(0(x),1(y)) >= 1(+(x,y)) ; +(+(x,y),z) >= +(x,+(y,z)) ; +(1(x),0(y)) >= 1(+(x,y)) ; +(1(x),1(y)) >= 0(+(+(x,y),1(#))) ; +(x,#) >= x ; *(#,x) >= # ; *(0(x),y) >= 0( *(x,y)) ; *(1(x),y) >= +(0( *(x,y)),y) ; *( *(x,y),z) >= *(x, *(y,z)) ; sum(nil) >= 0(#) ; sum(cons(x,l)) >= +(x,sum(l)) ; prod(nil) >= 1(#) ; prod(cons(x,l)) >= *(x,prod(l)) ; Marked_sum(cons(x,l)) >= Marked_sum(l) ; } + Disjunctions:{ { Marked_sum(cons(x,l)) > Marked_sum(l) ; } } === 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: 0(#) >= # constraint: +(#,x) >= x constraint: +(0(x),0(y)) >= 0(+(x,y)) constraint: +(0(x),1(y)) >= 1(+(x,y)) constraint: +(+(x,y),z) >= +(x,+(y,z)) constraint: +(1(x),0(y)) >= 1(+(x,y)) constraint: +(1(x),1(y)) >= 0(+(+(x,y),1(#))) constraint: +(x,#) >= x constraint: *(#,x) >= # constraint: *(0(x),y) >= 0( *(x,y)) constraint: *(1(x),y) >= +(0( *(x,y)),y) constraint: *( *(x,y),z) >= *(x, *(y,z)) constraint: sum(nil) >= 0(#) constraint: sum(cons(x,l)) >= +(x,sum(l)) constraint: prod(nil) >= 1(#) constraint: prod(cons(x,l)) >= *(x,prod(l)) constraint: Marked_sum(cons(x,l)) >= Marked_sum(l) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { 0(#) >= # ; +(#,x) >= x ; +(0(x),0(y)) >= 0(+(x,y)) ; +(0(x),1(y)) >= 1(+(x,y)) ; +(+(x,y),z) >= +(x,+(y,z)) ; +(1(x),0(y)) >= 1(+(x,y)) ; +(1(x),1(y)) >= 0(+(+(x,y),1(#))) ; +(x,#) >= x ; *(#,x) >= # ; *(0(x),y) >= 0( *(x,y)) ; *(1(x),y) >= +(0( *(x,y)),y) ; *( *(x,y),z) >= *(x, *(y,z)) ; sum(nil) >= 0(#) ; sum(cons(x,l)) >= +(x,sum(l)) ; prod(nil) >= 1(#) ; prod(cons(x,l)) >= *(x,prod(l)) ; Marked_prod(cons(x,l)) >= Marked_prod(l) ; } + Disjunctions:{ { Marked_prod(cons(x,l)) > Marked_prod(l) ; } } === 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: 0(#) >= # constraint: +(#,x) >= x constraint: +(0(x),0(y)) >= 0(+(x,y)) constraint: +(0(x),1(y)) >= 1(+(x,y)) constraint: +(+(x,y),z) >= +(x,+(y,z)) constraint: +(1(x),0(y)) >= 1(+(x,y)) constraint: +(1(x),1(y)) >= 0(+(+(x,y),1(#))) constraint: +(x,#) >= x constraint: *(#,x) >= # constraint: *(0(x),y) >= 0( *(x,y)) constraint: *(1(x),y) >= +(0( *(x,y)),y) constraint: *( *(x,y),z) >= *(x, *(y,z)) constraint: sum(nil) >= 0(#) constraint: sum(cons(x,l)) >= +(x,sum(l)) constraint: prod(nil) >= 1(#) constraint: prod(cons(x,l)) >= *(x,prod(l)) constraint: Marked_prod(cons(x,l)) >= Marked_prod(l) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { 0(#) >= # ; +(#,x) >= x ; +(0(x),0(y)) >= 0(+(x,y)) ; +(0(x),1(y)) >= 1(+(x,y)) ; +(+(x,y),z) >= +(x,+(y,z)) ; +(1(x),0(y)) >= 1(+(x,y)) ; +(1(x),1(y)) >= 0(+(+(x,y),1(#))) ; +(x,#) >= x ; *(#,x) >= # ; *(0(x),y) >= 0( *(x,y)) ; *(1(x),y) >= +(0( *(x,y)),y) ; *( *(x,y),z) >= *(x, *(y,z)) ; sum(nil) >= 0(#) ; sum(cons(x,l)) >= +(x,sum(l)) ; prod(nil) >= 1(#) ; prod(cons(x,l)) >= *(x,prod(l)) ; Marked_*(0(x),y) >= Marked_*(x,y) ; Marked_*(1(x),y) >= Marked_*(x,y) ; Marked_*( *(x,y),z) >= Marked_*(y,z) ; Marked_*( *(x,y),z) >= Marked_*(x, *(y,z)) ; } + Disjunctions:{ { Marked_*(0(x),y) > Marked_*(x,y) ; } { Marked_*(1(x),y) > Marked_*(x,y) ; } { Marked_*( *(x,y),z) > Marked_*(y,z) ; } { Marked_*( *(x,y),z) > Marked_*(x, *(y,z)) ; } } === 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: 0(#) >= # constraint: +(#,x) >= x constraint: +(0(x),0(y)) >= 0(+(x,y)) constraint: +(0(x),1(y)) >= 1(+(x,y)) constraint: +(+(x,y),z) >= +(x,+(y,z)) constraint: +(1(x),0(y)) >= 1(+(x,y)) constraint: +(1(x),1(y)) >= 0(+(+(x,y),1(#))) constraint: +(x,#) >= x constraint: *(#,x) >= # constraint: *(0(x),y) >= 0( *(x,y)) constraint: *(1(x),y) >= +(0( *(x,y)),y) constraint: *( *(x,y),z) >= *(x, *(y,z)) constraint: sum(nil) >= 0(#) constraint: sum(cons(x,l)) >= +(x,sum(l)) constraint: prod(nil) >= 1(#) constraint: prod(cons(x,l)) >= *(x,prod(l)) constraint: Marked_*(0(x),y) >= Marked_*(x,y) constraint: Marked_*(1(x),y) >= Marked_*(x,y) constraint: Marked_*( *(x,y),z) >= Marked_*(y,z) constraint: Marked_*( *(x,y),z) >= Marked_*(x, *(y,z)) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { 0(#) >= # ; +(#,x) >= x ; +(0(x),0(y)) >= 0(+(x,y)) ; +(0(x),1(y)) >= 1(+(x,y)) ; +(+(x,y),z) >= +(x,+(y,z)) ; +(1(x),0(y)) >= 1(+(x,y)) ; +(1(x),1(y)) >= 0(+(+(x,y),1(#))) ; +(x,#) >= x ; *(#,x) >= # ; *(0(x),y) >= 0( *(x,y)) ; *(1(x),y) >= +(0( *(x,y)),y) ; *( *(x,y),z) >= *(x, *(y,z)) ; sum(nil) >= 0(#) ; sum(cons(x,l)) >= +(x,sum(l)) ; prod(nil) >= 1(#) ; prod(cons(x,l)) >= *(x,prod(l)) ; Marked_+(0(x),0(y)) >= Marked_+(x,y) ; Marked_+(0(x),1(y)) >= Marked_+(x,y) ; Marked_+(+(x,y),z) >= Marked_+(y,z) ; Marked_+(+(x,y),z) >= Marked_+(x,+(y,z)) ; Marked_+(1(x),0(y)) >= Marked_+(x,y) ; Marked_+(1(x),1(y)) >= Marked_+(+(x,y),1(#)) ; Marked_+(1(x),1(y)) >= Marked_+(x,y) ; } + Disjunctions:{ { Marked_+(0(x),0(y)) > Marked_+(x,y) ; } { Marked_+(0(x),1(y)) > Marked_+(x,y) ; } { Marked_+(+(x,y),z) > Marked_+(y,z) ; } { Marked_+(+(x,y),z) > Marked_+(x,+(y,z)) ; } { Marked_+(1(x),0(y)) > Marked_+(x,y) ; } { Marked_+(1(x),1(y)) > Marked_+(+(x,y),1(#)) ; } { Marked_+(1(x),1(y)) > Marked_+(x,y) ; } } === 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 : 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: 0(#) >= # constraint: +(#,x) >= x constraint: +(0(x),0(y)) >= 0(+(x,y)) constraint: +(0(x),1(y)) >= 1(+(x,y)) constraint: +(+(x,y),z) >= +(x,+(y,z)) constraint: +(1(x),0(y)) >= 1(+(x,y)) constraint: +(1(x),1(y)) >= 0(+(+(x,y),1(#))) constraint: +(x,#) >= x constraint: *(#,x) >= # constraint: *(0(x),y) >= 0( *(x,y)) constraint: *(1(x),y) >= +(0( *(x,y)),y) constraint: *( *(x,y),z) >= *(x, *(y,z)) constraint: sum(nil) >= 0(#) constraint: sum(cons(x,l)) >= +(x,sum(l)) constraint: prod(nil) >= 1(#) constraint: prod(cons(x,l)) >= *(x,prod(l)) constraint: Marked_+(0(x),0(y)) >= Marked_+(x,y) constraint: Marked_+(0(x),1(y)) >= Marked_+(x,y) constraint: Marked_+(+(x,y),z) >= Marked_+(y,z) constraint: Marked_+(+(x,y),z) >= Marked_+(x,+(y,z)) constraint: Marked_+(1(x),0(y)) >= Marked_+(x,y) constraint: Marked_+(1(x),1(y)) >= Marked_+(+(x,y),1(#)) constraint: Marked_+(1(x),1(y)) >= Marked_+(x,y) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { 0(#) >= # ; +(#,x) >= x ; +(0(x),0(y)) >= 0(+(x,y)) ; +(0(x),1(y)) >= 1(+(x,y)) ; +(+(x,y),z) >= +(x,+(y,z)) ; +(1(x),0(y)) >= 1(+(x,y)) ; +(1(x),1(y)) >= 0(+(+(x,y),1(#))) ; +(x,#) >= x ; *(#,x) >= # ; *(0(x),y) >= 0( *(x,y)) ; *(1(x),y) >= +(0( *(x,y)),y) ; *( *(x,y),z) >= *(x, *(y,z)) ; sum(nil) >= 0(#) ; sum(cons(x,l)) >= +(x,sum(l)) ; prod(nil) >= 1(#) ; prod(cons(x,l)) >= *(x,prod(l)) ; Marked_*(0(x),y) >= Marked_*(x,y) ; Marked_*( *(x,y),z) >= Marked_*(y,z) ; Marked_*( *(x,y),z) >= Marked_*(x, *(y,z)) ; } + Disjunctions:{ { Marked_*(0(x),y) > Marked_*(x,y) ; } { Marked_*( *(x,y),z) > Marked_*(y,z) ; } { Marked_*( *(x,y),z) > Marked_*(x, *(y,z)) ; } } === 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 Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: 0(#) >= # constraint: +(#,x) >= x constraint: +(0(x),0(y)) >= 0(+(x,y)) constraint: +(0(x),1(y)) >= 1(+(x,y)) constraint: +(+(x,y),z) >= +(x,+(y,z)) constraint: +(1(x),0(y)) >= 1(+(x,y)) constraint: +(1(x),1(y)) >= 0(+(+(x,y),1(#))) constraint: +(x,#) >= x constraint: *(#,x) >= # constraint: *(0(x),y) >= 0( *(x,y)) constraint: *(1(x),y) >= +(0( *(x,y)),y) constraint: *( *(x,y),z) >= *(x, *(y,z)) constraint: sum(nil) >= 0(#) constraint: sum(cons(x,l)) >= +(x,sum(l)) constraint: prod(nil) >= 1(#) constraint: prod(cons(x,l)) >= *(x,prod(l)) constraint: Marked_*(0(x),y) >= Marked_*(x,y) constraint: Marked_*( *(x,y),z) >= Marked_*(y,z) constraint: Marked_*( *(x,y),z) >= Marked_*(x, *(y,z)) APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { 0(#) >= # ; +(#,x) >= x ; +(0(x),0(y)) >= 0(+(x,y)) ; +(0(x),1(y)) >= 1(+(x,y)) ; +(+(x,y),z) >= +(x,+(y,z)) ; +(1(x),0(y)) >= 1(+(x,y)) ; +(1(x),1(y)) >= 0(+(+(x,y),1(#))) ; +(x,#) >= x ; *(#,x) >= # ; *(0(x),y) >= 0( *(x,y)) ; *(1(x),y) >= +(0( *(x,y)),y) ; *( *(x,y),z) >= *(x, *(y,z)) ; sum(nil) >= 0(#) ; sum(cons(x,l)) >= +(x,sum(l)) ; prod(nil) >= 1(#) ; prod(cons(x,l)) >= *(x,prod(l)) ; Marked_*(0(x),y) >= Marked_*(x,y) ; } + Disjunctions:{ { Marked_*(0(x),y) > Marked_*(x,y) ; } } === 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 : 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: 0(#) >= # constraint: +(#,x) >= x constraint: +(0(x),0(y)) >= 0(+(x,y)) constraint: +(0(x),1(y)) >= 1(+(x,y)) constraint: +(+(x,y),z) >= +(x,+(y,z)) constraint: +(1(x),0(y)) >= 1(+(x,y)) constraint: +(1(x),1(y)) >= 0(+(+(x,y),1(#))) constraint: +(x,#) >= x constraint: *(#,x) >= # constraint: *(0(x),y) >= 0( *(x,y)) constraint: *(1(x),y) >= +(0( *(x,y)),y) constraint: *( *(x,y),z) >= *(x, *(y,z)) constraint: sum(nil) >= 0(#) constraint: sum(cons(x,l)) >= +(x,sum(l)) constraint: prod(nil) >= 1(#) constraint: prod(cons(x,l)) >= *(x,prod(l)) constraint: Marked_*(0(x),y) >= Marked_*(x,y) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { 0(#) >= # ; +(#,x) >= x ; +(0(x),0(y)) >= 0(+(x,y)) ; +(0(x),1(y)) >= 1(+(x,y)) ; +(+(x,y),z) >= +(x,+(y,z)) ; +(1(x),0(y)) >= 1(+(x,y)) ; +(1(x),1(y)) >= 0(+(+(x,y),1(#))) ; +(x,#) >= x ; *(#,x) >= # ; *(0(x),y) >= 0( *(x,y)) ; *(1(x),y) >= +(0( *(x,y)),y) ; *( *(x,y),z) >= *(x, *(y,z)) ; sum(nil) >= 0(#) ; sum(cons(x,l)) >= +(x,sum(l)) ; prod(nil) >= 1(#) ; prod(cons(x,l)) >= *(x,prod(l)) ; Marked_+(0(x),0(y)) >= Marked_+(x,y) ; Marked_+(+(x,y),z) >= Marked_+(y,z) ; Marked_+(+(x,y),z) >= Marked_+(x,+(y,z)) ; Marked_+(1(x),1(y)) >= Marked_+(+(x,y),1(#)) ; } + Disjunctions:{ { Marked_+(0(x),0(y)) > Marked_+(x,y) ; } { Marked_+(+(x,y),z) > Marked_+(y,z) ; } { Marked_+(+(x,y),z) > Marked_+(x,+(y,z)) ; } { Marked_+(1(x),1(y)) > Marked_+(+(x,y),1(#)) ; } } === 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: 0(#) >= # constraint: +(#,x) >= x constraint: +(0(x),0(y)) >= 0(+(x,y)) constraint: +(0(x),1(y)) >= 1(+(x,y)) constraint: +(+(x,y),z) >= +(x,+(y,z)) constraint: +(1(x),0(y)) >= 1(+(x,y)) constraint: +(1(x),1(y)) >= 0(+(+(x,y),1(#))) constraint: +(x,#) >= x constraint: *(#,x) >= # constraint: *(0(x),y) >= 0( *(x,y)) constraint: *(1(x),y) >= +(0( *(x,y)),y) constraint: *( *(x,y),z) >= *(x, *(y,z)) constraint: sum(nil) >= 0(#) constraint: sum(cons(x,l)) >= +(x,sum(l)) constraint: prod(nil) >= 1(#) constraint: prod(cons(x,l)) >= *(x,prod(l)) constraint: Marked_+(0(x),0(y)) >= Marked_+(x,y) constraint: Marked_+(+(x,y),z) >= Marked_+(y,z) constraint: Marked_+(+(x,y),z) >= Marked_+(x,+(y,z)) constraint: Marked_+(1(x),1(y)) >= Marked_+(+(x,y),1(#)) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { 0(#) >= # ; +(#,x) >= x ; +(0(x),0(y)) >= 0(+(x,y)) ; +(0(x),1(y)) >= 1(+(x,y)) ; +(+(x,y),z) >= +(x,+(y,z)) ; +(1(x),0(y)) >= 1(+(x,y)) ; +(1(x),1(y)) >= 0(+(+(x,y),1(#))) ; +(x,#) >= x ; *(#,x) >= # ; *(0(x),y) >= 0( *(x,y)) ; *(1(x),y) >= +(0( *(x,y)),y) ; *( *(x,y),z) >= *(x, *(y,z)) ; sum(nil) >= 0(#) ; sum(cons(x,l)) >= +(x,sum(l)) ; prod(nil) >= 1(#) ; prod(cons(x,l)) >= *(x,prod(l)) ; Marked_+(0(x),0(y)) >= Marked_+(x,y) ; Marked_+(+(x,y),z) >= Marked_+(y,z) ; Marked_+(+(x,y),z) >= Marked_+(x,+(y,z)) ; } + Disjunctions:{ { Marked_+(0(x),0(y)) > Marked_+(x,y) ; } { Marked_+(+(x,y),z) > Marked_+(y,z) ; } { Marked_+(+(x,y),z) > Marked_+(x,+(y,z)) ; } } === 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 Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: 0(#) >= # constraint: +(#,x) >= x constraint: +(0(x),0(y)) >= 0(+(x,y)) constraint: +(0(x),1(y)) >= 1(+(x,y)) constraint: +(+(x,y),z) >= +(x,+(y,z)) constraint: +(1(x),0(y)) >= 1(+(x,y)) constraint: +(1(x),1(y)) >= 0(+(+(x,y),1(#))) constraint: +(x,#) >= x constraint: *(#,x) >= # constraint: *(0(x),y) >= 0( *(x,y)) constraint: *(1(x),y) >= +(0( *(x,y)),y) constraint: *( *(x,y),z) >= *(x, *(y,z)) constraint: sum(nil) >= 0(#) constraint: sum(cons(x,l)) >= +(x,sum(l)) constraint: prod(nil) >= 1(#) constraint: prod(cons(x,l)) >= *(x,prod(l)) constraint: Marked_+(0(x),0(y)) >= Marked_+(x,y) constraint: Marked_+(+(x,y),z) >= Marked_+(y,z) constraint: Marked_+(+(x,y),z) >= Marked_+(x,+(y,z)) APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { 0(#) >= # ; +(#,x) >= x ; +(0(x),0(y)) >= 0(+(x,y)) ; +(0(x),1(y)) >= 1(+(x,y)) ; +(+(x,y),z) >= +(x,+(y,z)) ; +(1(x),0(y)) >= 1(+(x,y)) ; +(1(x),1(y)) >= 0(+(+(x,y),1(#))) ; +(x,#) >= x ; *(#,x) >= # ; *(0(x),y) >= 0( *(x,y)) ; *(1(x),y) >= +(0( *(x,y)),y) ; *( *(x,y),z) >= *(x, *(y,z)) ; sum(nil) >= 0(#) ; sum(cons(x,l)) >= +(x,sum(l)) ; prod(nil) >= 1(#) ; prod(cons(x,l)) >= *(x,prod(l)) ; Marked_+(0(x),0(y)) >= Marked_+(x,y) ; } + Disjunctions:{ { Marked_+(0(x),0(y)) > Marked_+(x,y) ; } } === 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 : 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: 0(#) >= # constraint: +(#,x) >= x constraint: +(0(x),0(y)) >= 0(+(x,y)) constraint: +(0(x),1(y)) >= 1(+(x,y)) constraint: +(+(x,y),z) >= +(x,+(y,z)) constraint: +(1(x),0(y)) >= 1(+(x,y)) constraint: +(1(x),1(y)) >= 0(+(+(x,y),1(#))) constraint: +(x,#) >= x constraint: *(#,x) >= # constraint: *(0(x),y) >= 0( *(x,y)) constraint: *(1(x),y) >= +(0( *(x,y)),y) constraint: *( *(x,y),z) >= *(x, *(y,z)) constraint: sum(nil) >= 0(#) constraint: sum(cons(x,l)) >= +(x,sum(l)) constraint: prod(nil) >= 1(#) constraint: prod(cons(x,l)) >= *(x,prod(l)) constraint: Marked_+(0(x),0(y)) >= Marked_+(x,y) APPLY CRITERIA (Graph splitting) Found 0 components: SOLVED { TRS termination of: [1] 0(#) -> # [2] +(x,#) -> x [3] +(#,x) -> x [4] +(0(x),0(y)) -> 0(+(x,y)) [5] +(0(x),1(y)) -> 1(+(x,y)) [6] +(1(x),0(y)) -> 1(+(x,y)) [7] +(1(x),1(y)) -> 0(+(+(x,y),1(#))) [8] +(+(x,y),z) -> +(x,+(y,z)) [9] *(#,x) -> # [10] *(0(x),y) -> 0( *(x,y)) [11] *(1(x),y) -> +(0( *(x,y)),y) [12] *( *(x,y),z) -> *(x, *(y,z)) [13] sum(nil) -> 0(#) [14] sum(cons(x,l)) -> +(x,sum(l)) [15] prod(nil) -> 1(#) [16] prod(cons(x,l)) -> *(x,prod(l)) , CRITERION: MDP [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ # ] () = 0; [ prod ] (X0) = 1 + 2*X0 + 0; [ * ] (X0,X1) = 2 + 2*X0 + 1*X1 + 0; [ + ] (X0,X1) = 2*X0 + 1*X1 + 0; [ nil ] () = 0; [ 0 ] (X0) = 2 + 0; [ sum ] (X0) = 2 + 2*X0 + 0; [ 1 ] (X0) = 1 + 0; [ Marked_sum ] (X0) = 3*X0 + 0; [ cons ] (X0,X1) = 2 + 2*X0 + 1*X1 + 0; ]} { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ # ] () = 0; [ prod ] (X0) = 2 + 1*X0 + 0; [ * ] (X0,X1) = 2 + 2*X0 + 1*X1 + 0; [ + ] (X0,X1) = 2*X0 + 1*X1 + 0; [ nil ] () = 2 + 0; [ 0 ] (X0) = 2 + 0; [ Marked_prod ] (X0) = 3*X0 + 0; [ sum ] (X0) = 2*X0 + 0; [ 1 ] (X0) = 1 + 0; [ cons ] (X0,X1) = 2 + 2*X0 + 2*X1 + 0; ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ # ] () = 0; [ prod ] (X0) = 2*X0; [ * ] (X0,X1) = 2*X1*X0 + 1*X1 + 1*X0; [ + ] (X0,X1) = 1*X1 + 1*X0; [ Marked_* ] (X0,X1) = 2*X1*X0 + 1*X1 + 1*X0; [ nil ] () = 2; [ 0 ] (X0) = 1*X0; [ sum ] (X0) = 2*X0; [ 1 ] (X0) = 1*X0 + 2; [ cons ] (X0,X1) = 2*X1*X0 + 2*X1 + 1*X0 + 2; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ # ] () = 2; [ prod ] (X0) = 2*X0; [ * ] (X0,X1) = 1*X1*X0 + 1*X1 + 2*X0 + 2; [ + ] (X0,X1) = 1*X1 + 1*X0; [ Marked_* ] (X0,X1) = 1*X1*X0 + 1*X1 + 2*X0; [ nil ] () = 2; [ 0 ] (X0) = 1*X0; [ sum ] (X0) = 2*X0; [ 1 ] (X0) = 1*X0 + 2; [ cons ] (X0,X1) = 2*X1*X0 + 2*X1 + 2*X0 + 2; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ # ] () = 0; [ prod ] (X0) = 2*X0 + 0; [ * ] (X0,X1) = 1*X0 + 1*X1 + 1*X1*X0 + 0; [ + ] (X0,X1) = 1*X0 + 1*X1 + 0; [ Marked_* ] (X0,X1) = 2*X0 + 2*X1*X0 + 0; [ nil ] () = 2 + 0; [ 0 ] (X0) = 2 + 1*X0 + 0; [ sum ] (X0) = 2 + 1*X0 + 0; [ 1 ] (X0) = 2 + 1*X0 + 0; [ cons ] (X0,X1) = 2 + 2*X0 + 2*X1 + 2*X1*X0 + 0; ]} ]} ]} ]} ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ # ] () = 1; [ prod ] (X0) = 1*X0 + 1; [ * ] (X0,X1) = 1*X1*X0 + 1*X1 + 1*X0; [ Marked_+ ] (X0,X1) = 1*X1 + 1*X0; [ + ] (X0,X1) = 1*X1 + 1*X0; [ nil ] () = 2; [ 0 ] (X0) = 1*X0; [ sum ] (X0) = 2*X0 + 2; [ 1 ] (X0) = 1*X0 + 1; [ cons ] (X0,X1) = 1*X1*X0 + 2*X1 + 2*X0 + 1; removing < Marked_+(1(x),1(y)),Marked_+(x,y)> [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ # ] () = 0; [ prod ] (X0) = 2*X0; [ * ] (X0,X1) = 1*X1*X0; [ Marked_+ ] (X0,X1) = 1*X1 + 1*X0; [ + ] (X0,X1) = 1*X1 + 1*X0; [ nil ] () = 1; [ 0 ] (X0) = 2*X0; [ sum ] (X0) = 2*X0; [ 1 ] (X0) = 2*X0 + 1; [ cons ] (X0,X1) = 1*X1*X0 + 2*X1 + 1*X0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ # ] () = 0; [ prod ] (X0) = 1*X0; [ * ] (X0,X1) = 2*X1*X0 + 2*X0 + 1; [ Marked_+ ] (X0,X1) = 1*X1 + 2*X0; [ + ] (X0,X1) = 1*X1 + 1*X0 + 2; [ nil ] () = 2; [ 0 ] (X0) = 1*X0; [ sum ] (X0) = 2*X0; [ 1 ] (X0) = 1*X0 + 2; [ cons ] (X0,X1) = 2*X1*X0 + 1*X1 + 2*X0 + 1; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ # ] () = 0; [ prod ] (X0) = 1*X0 + 0; [ * ] (X0,X1) = 1*X0 + 1*X1*X0 + 0; [ Marked_+ ] (X0,X1) = 1*X1*X0 + 0; [ + ] (X0,X1) = 1*X0 + 1*X1 + 0; [ nil ] () = 2 + 0; [ 0 ] (X0) = 1 + 1*X0 + 0; [ sum ] (X0) = 1*X0 + 0; [ 1 ] (X0) = 2 + 1*X0 + 0; [ cons ] (X0,X1) = 1*X0 + 2*X1 + 1*X1*X0 + 0; ]} ]} ]} ]} ]} ]} ]} ]} ]} Cime worked for 3.886628 seconds (real time) Cime Exit Status: 0