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

TRS termination of:
[1] is_empty(nil) -> true
[2] is_empty(cons(x,l)) -> false
[3] hd(cons(x,l)) -> x
[4] tl(cons(x,l)) -> l
[5] append(l1,l2) -> ifappend(l1,l2,l1)
[6] ifappend(l1,l2,nil) -> l2
[7] ifappend(l1,l2,cons(x,l)) -> cons(x,append(l,l2))


Sub problem: 
guided: 

DP termination of:
<Marked_append(l1,l2) , Marked_ifappend(l1,l2,l1)>
<Marked_ifappend(l1,l2,cons(x,l)) , Marked_append(l,l2)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_ifappend(l1,l2,cons(x,l)) , Marked_append(l,l2)> 
      --> <Marked_append(l1,l2) , Marked_ifappend(l1,l2,l1)>
  <Marked_append(l1,l2) , Marked_ifappend(l1,l2,l1)> 
     --> <Marked_ifappend(l1,l2,cons(x,l)) , Marked_append(l,l2)>
}
APPLY CRITERIA (Subterm criterion)

ST: Marked_ifappend -> 3
Marked_append -> 1

APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] is_empty(nil) -> true
[2] is_empty(cons(x,l)) -> false
[3] hd(cons(x,l)) -> x
[4] tl(cons(x,l)) -> l
[5] append(l1,l2) -> ifappend(l1,l2,l1)
[6] ifappend(l1,l2,nil) -> l2
[7] ifappend(l1,l2,cons(x,l)) -> cons(x,append(l,l2))
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_append(l1,l2) , Marked_ifappend(l1,l2,l1)>
<Marked_ifappend(l1,l2,cons(x,l)) , Marked_append(l,l2)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_append(l1,l2) , Marked_ifappend(l1,l2,l1)>
<Marked_ifappend(l1,l2,cons(x,l)) , Marked_append(l,l2)>
 ,
 CRITERION: ST
 [ {
      
     DP termination of:
     <Marked_append(l1,l2) , Marked_ifappend(l1,l2,l1)>
 ,
 CRITERION: SG
 [  ]} 
 ]} 
 ]} 
 ]} 

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