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

TRS termination of:
[1] isEmpty(empty) -> true
[2] isEmpty(node(l,x,r)) -> false
[3] left(empty) -> empty
[4] left(node(l,x,r)) -> l
[5] right(empty) -> empty
[6] right(node(l,x,r)) -> r
[7] elem(node(l,x,r)) -> x
[8] append(nil,x) -> cons(x,nil)
[9] append(cons(y,ys),x) -> cons(y,append(ys,x))
[10] listify(n,xs) ->
 if(isEmpty(n),isEmpty(left(n)),right(n),
  node(left(left(n)),elem(left(n)),node(right(left(n)),elem(n),right(n))),
  xs,append(xs,n))
[11] if(true,b,n,m,xs,ys) -> xs
[12] if(false,false,n,m,xs,ys) -> listify(m,xs)
[13] if(false,true,n,m,xs,ys) -> listify(n,ys)
[14] toList(n) -> listify(n,nil)


Sub problem: 
guided: 

DP termination of:
<Marked_append(cons(y,ys),x) , Marked_append(ys,x)>
<Marked_listify(n,xs) , Marked_if(isEmpty(n),isEmpty(left(n)),right(n),
                         node(left(left(n)),elem(left(n)),
                          node(right(left(n)),elem(n),right(n))),xs,
                         append(xs,n))>
<Marked_listify(n,xs) , Marked_isEmpty(n)>
<Marked_listify(n,xs) , Marked_isEmpty(left(n))>
<Marked_listify(n,xs) , Marked_left(n)>
<Marked_listify(n,xs) , Marked_right(n)>
<Marked_listify(n,xs) , Marked_left(left(n))>
<Marked_listify(n,xs) , Marked_left(n)>
<Marked_listify(n,xs) , Marked_elem(left(n))>
<Marked_listify(n,xs) , Marked_left(n)>
<Marked_listify(n,xs) , Marked_right(left(n))>
<Marked_listify(n,xs) , Marked_left(n)>
<Marked_listify(n,xs) , Marked_elem(n)>
<Marked_listify(n,xs) , Marked_right(n)>
<Marked_listify(n,xs) , Marked_append(xs,n)>
<Marked_if(false,false,n,m,xs,ys) , Marked_listify(m,xs)>
<Marked_if(false,true,n,m,xs,ys) , Marked_listify(n,ys)>
<Marked_toList(n) , Marked_listify(n,nil)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 2 components:

{  <Marked_if(false,true,n,m,xs,ys) , Marked_listify(n,ys)> 
      --> <Marked_listify(n,xs) , Marked_if(isEmpty(n),isEmpty(left(n)),
                                   right(n),
                                   node(left(left(n)),elem(left(n)),
                                    node(right(left(n)),elem(n),right(n))),
                                   xs,append(xs,n))>
  <Marked_if(false,false,n,m,xs,ys) , Marked_listify(m,xs)> 
     --> <Marked_listify(n,xs) , Marked_if(isEmpty(n),isEmpty(left(n)),
                                  right(n),
                                  node(left(left(n)),elem(left(n)),
                                   node(right(left(n)),elem(n),right(n))),
                                  xs,append(xs,n))>
  <Marked_listify(n,xs) , Marked_if(isEmpty(n),isEmpty(left(n)),right(n),
                           node(left(left(n)),elem(left(n)),
                            node(right(left(n)),elem(n),right(n))),xs,
                           append(xs,n))> 
     --> <Marked_if(false,true,n,m,xs,ys) , Marked_listify(n,ys)>
  <Marked_listify(n,xs) , Marked_if(isEmpty(n),isEmpty(left(n)),right(n),
                           node(left(left(n)),elem(left(n)),
                            node(right(left(n)),elem(n),right(n))),xs,
                           append(xs,n))> 
     --> <Marked_if(false,false,n,m,xs,ys) , Marked_listify(m,xs)>
}

{  <Marked_append(cons(y,ys),x) , Marked_append(ys,x)> 
      --> <Marked_append(cons(y,ys),x) , Marked_append(ys,x)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  isEmpty(empty) >= true ;
  isEmpty(node(l,x,r)) >= false ;
  left(empty) >= empty ;
  left(node(l,x,r)) >= l ;
  right(empty) >= empty ;
  right(node(l,x,r)) >= r ;
  elem(node(l,x,r)) >= x ;
  append(cons(y,ys),x) >= cons(y,append(ys,x)) ;
  append(nil,x) >= cons(x,nil) ;
  if(true,b,n,m,xs,ys) >= xs ;
  if(false,true,n,m,xs,ys) >= listify(n,ys) ;
  if(false,false,n,m,xs,ys) >= listify(m,xs) ;
  listify(n,xs) >= if(isEmpty(n),isEmpty(left(n)),right(n),
                    node(left(left(n)),elem(left(n)),
                     node(right(left(n)),elem(n),right(n))),xs,append(xs,n)) ;
  toList(n) >= listify(n,nil) ;
  Marked_listify(n,xs) >= Marked_if(isEmpty(n),isEmpty(left(n)),right(n),
                           node(left(left(n)),elem(left(n)),
                            node(right(left(n)),elem(n),right(n))),xs,
                           append(xs,n)) ;
  Marked_if(false,true,n,m,xs,ys) >= Marked_listify(n,ys) ;
  Marked_if(false,false,n,m,xs,ys) >= Marked_listify(m,xs) ;
 }
 + Disjunctions:{ 
{
  Marked_listify(n,xs) > Marked_if(isEmpty(n),isEmpty(left(n)),right(n),
                          node(left(left(n)),elem(left(n)),
                           node(right(left(n)),elem(n),right(n))),xs,
                          append(xs,n)) ;
 }
{
  Marked_if(false,true,n,m,xs,ys) > Marked_listify(n,ys) ;
 }
{
  Marked_if(false,false,n,m,xs,ys) > Marked_listify(m,xs) ;
 }
 } 
=== 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 : 25.000000 ===
Search parameters: AFS type: 2 ; time limit: 25.. 
=== STOPING TIMER virtual ===
=== TIMER virtual : 15.000000 ===
Entering poly_solver
Starting Sat solver initialization
=== STOPING TIMER virtual ===
Time out 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 timeout reached
=== 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 94.313477 seconds (real time)
Cime Exit Status: 0