- : 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)) -> cons(x,l)
[5] append(l1,l2) -> ifappend(l1,l2,is_empty(l1))
[6] ifappend(l1,l2,true) -> l2
[7] ifappend(l1,l2,false) -> cons(hd(l1),append(tl(l1),l2))


Sub problem: 
guided: 

DP termination of:
<Marked_append(l1,l2) , Marked_ifappend(l1,l2,is_empty(l1))>
<Marked_append(l1,l2) , Marked_is_empty(l1)>
<Marked_ifappend(l1,l2,false) , Marked_hd(l1)>
<Marked_ifappend(l1,l2,false) , Marked_append(tl(l1),l2)>
<Marked_ifappend(l1,l2,false) , Marked_tl(l1)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_ifappend(l1,l2,false) , Marked_append(tl(l1),l2)> 
      --> <Marked_append(l1,l2) , Marked_ifappend(l1,l2,is_empty(l1))>
  <Marked_append(l1,l2) , Marked_ifappend(l1,l2,is_empty(l1))> 
     --> <Marked_ifappend(l1,l2,false) , Marked_append(tl(l1),l2)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  is_empty(nil) >= true ;
  is_empty(cons(x,l)) >= false ;
  hd(cons(x,l)) >= x ;
  tl(cons(x,l)) >= cons(x,l) ;
  ifappend(l1,l2,true) >= l2 ;
  ifappend(l1,l2,false) >= cons(hd(l1),append(tl(l1),l2)) ;
  append(l1,l2) >= ifappend(l1,l2,is_empty(l1)) ;
  Marked_ifappend(l1,l2,false) >= Marked_append(tl(l1),l2) ;
  Marked_append(l1,l2) >= Marked_ifappend(l1,l2,is_empty(l1)) ;
 }
 + Disjunctions:{ 
{
  Marked_ifappend(l1,l2,false) > Marked_append(tl(l1),l2) ;
 }
{
  Marked_append(l1,l2) > Marked_ifappend(l1,l2,is_empty(l1)) ;
 }
 } 
=== 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 : 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
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
No solution found for these parameters.
=== TIMER virtual : 50.000000 ===
trying sub matrices of size: 1
Matrix interpretation constraints generated.
Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. 
Termination constraints generated.
Starting Sat solver initialization
Calling Sat solver...
=== STOPING TIMER virtual ===
=== TIMER real : 50.000000 ===
=== STOPING TIMER real ===
Sat solver returned
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
No solution found for these parameters.
No solution found for these constraints.
APPLY CRITERIA (ID_CRIT)
NOT SOLVED
No proof found
Cime worked for 0.407641 seconds (real time)
Cime Exit Status: 0