- : unit = ()
- : 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 (Subterm criterion)

ST: Marked_merge -> 1

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: ST
 [ {
      
     DP termination of:
      ,
      CRITERION: SG
      [  ]} 
      ]} 
 ]} 
 ]} 

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