- : unit = ()
h : heuristic = <heuristic>
- : unit = ()
APPLY CRITERIA (Marked dependency pairs)

TRS termination of:
[1] +(-(x,y),z) -> -(+(x,z),y)
[2] -(+(x,y),y) -> x


Sub problem: 
guided: 

DP termination of:
<Marked_+(-(x,y),z) , Marked_-(+(x,z),y)>
<Marked_+(-(x,y),z) , Marked_+(x,z)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_+(-(x,y),z) , Marked_+(x,z)> 
      --> <Marked_+(-(x,y),z) , Marked_+(x,z)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  -(+(x,y),y) >= x ;
  +(-(x,y),z) >= -(+(x,z),y) ;
  Marked_+(-(x,y),z) >= Marked_+(x,z) ;
 }
 + Disjunctions:{ 
{
  Marked_+(-(x,y),z) > Marked_+(x,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
Sat solver result read
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
constraint: -(+(x,y),y) >= x
constraint: +(-(x,y),z) >= -(+(x,z),y)
constraint: Marked_+(-(x,y),z) >= Marked_+(x,z)
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] +(-(x,y),z) -> -(+(x,z),y)
[2] -(+(x,y),y) -> x
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_+(-(x,y),z) , Marked_-(+(x,z),y)>
<Marked_+(-(x,y),z) , Marked_+(x,z)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_+(-(x,y),z) , Marked_+(x,z)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ - ] (X0,X1) = 2 + 1*X0 + 3*X1 + 0; 
 [ + ] (X0,X1) = 2*X0 + 3*X1 + 0; 
 [ Marked_+ ] (X0,X1) = 3*X0 + 0; 
 ]} 
 ]} 
 ]} 

Cime worked for 0.012272 seconds (real time)
Cime Exit Status: 0