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

TRS termination of:
[1] merge(x,nil) -> x
[2] merge(nil,y) -> y
[3] merge(++(x,y),++(u,v)) -> ++(x,merge(y,++(u,v)))
[4] merge(++(x,y),++(u,v)) -> ++(u,merge(++(x,y),v))


Sub problem: 
guided: 

DP termination of:
<Marked_merge(++(x,y),++(u,v)) , Marked_merge(y,++(u,v))>
<Marked_merge(++(x,y),++(u,v)) , Marked_merge(++(x,y),v)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_merge(++(x,y),++(u,v)) , Marked_merge(y,++(u,v))> 
      --> <Marked_merge(++(x,y),++(u,v)) , Marked_merge(y,++(u,v))>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  merge(nil,y) >= y ;
  merge(++(x,y),++(u,v)) >= ++(u,merge(++(x,y),v)) ;
  merge(++(x,y),++(u,v)) >= ++(x,merge(y,++(u,v))) ;
  merge(x,nil) >= x ;
  Marked_merge(++(x,y),++(u,v)) >= Marked_merge(y,++(u,v)) ;
 }
 + Disjunctions:{ 
{
  Marked_merge(++(x,y),++(u,v)) > Marked_merge(y,++(u,v)) ;
 }
 } 
=== 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: merge(nil,y) >= y
constraint: merge(++(x,y),++(u,v)) >= ++(u,merge(++(x,y),v))
constraint: merge(++(x,y),++(u,v)) >= ++(x,merge(y,++(u,v)))
constraint: merge(x,nil) >= x
constraint: Marked_merge(++(x,y),++(u,v)) >= Marked_merge(y,++(u,v))
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] merge(x,nil) -> x
[2] merge(nil,y) -> y
[3] merge(++(x,y),++(u,v)) -> ++(x,merge(y,++(u,v)))
[4] merge(++(x,y),++(u,v)) -> ++(u,merge(++(x,y),v))
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_merge(++(x,y),++(u,v)) , Marked_merge(y,++(u,v))>
<Marked_merge(++(x,y),++(u,v)) , Marked_merge(++(x,y),v)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_merge(++(x,y),++(u,v)) , Marked_merge(y,++(u,v))>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ merge ] (X0,X1) = 3 + 2*X0 + 3*X1 + 0; 
 [ v ] () = 0; 
 [ ++ ] (X0,X1) = 1 + 1*X1 + 0; 
 [ nil ] () = 3 + 0; 
 [ Marked_merge ] (X0,X1) = 3*X0 + 0; 
 [ u ] () = 0; 
 ]} 
 ]} 
 ]} 

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