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

TRS termination of:
[1] int(0,0) -> .(0,nil)
[2] int(0,s(y)) -> .(0,int(s(0),s(y)))
[3] int(s(x),0) -> nil
[4] int(s(x),s(y)) -> int_list(int(x,y))
[5] int_list(nil) -> nil
[6] int_list(.(x,y)) -> .(s(x),int_list(y))


Sub problem: 
guided: 

DP termination of:
<Marked_int(0,s(y)) , Marked_int(s(0),s(y))>
<Marked_int(s(x),s(y)) , Marked_int_list(int(x,y))>
<Marked_int(s(x),s(y)) , Marked_int(x,y)>
<Marked_int_list(.(x,y)) , Marked_int_list(y)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 2 components:

{  <Marked_int(s(x),s(y)) , Marked_int(x,y)> 
      --> <Marked_int(s(x),s(y)) , Marked_int(x,y)>
  <Marked_int(s(x),s(y)) , Marked_int(x,y)> 
     --> <Marked_int(0,s(y)) , Marked_int(s(0),s(y))>
  <Marked_int(0,s(y)) , Marked_int(s(0),s(y))> 
     --> <Marked_int(s(x),s(y)) , Marked_int(x,y)>
}

{  <Marked_int_list(.(x,y)) , Marked_int_list(y)> 
      --> <Marked_int_list(.(x,y)) , Marked_int_list(y)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  int(0,0) >= .(0,nil) ;
  int(0,s(y)) >= .(0,int(s(0),s(y))) ;
  int(s(x),0) >= nil ;
  int(s(x),s(y)) >= int_list(int(x,y)) ;
  int_list(.(x,y)) >= .(s(x),int_list(y)) ;
  int_list(nil) >= nil ;
  Marked_int(0,s(y)) >= Marked_int(s(0),s(y)) ;
  Marked_int(s(x),s(y)) >= Marked_int(x,y) ;
 }
 + Disjunctions:{ 
{
  Marked_int(0,s(y)) > Marked_int(s(0),s(y)) ;
 }
{
  Marked_int(s(x),s(y)) > Marked_int(x,y) ;
 }
 } 
=== 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: int(0,0) >= .(0,nil)
constraint: int(0,s(y)) >= .(0,int(s(0),s(y)))
constraint: int(s(x),0) >= nil
constraint: int(s(x),s(y)) >= int_list(int(x,y))
constraint: int_list(.(x,y)) >= .(s(x),int_list(y))
constraint: int_list(nil) >= nil
constraint: Marked_int(0,s(y)) >= Marked_int(s(0),s(y))
constraint: Marked_int(s(x),s(y)) >= Marked_int(x,y)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  int(0,0) >= .(0,nil) ;
  int(0,s(y)) >= .(0,int(s(0),s(y))) ;
  int(s(x),0) >= nil ;
  int(s(x),s(y)) >= int_list(int(x,y)) ;
  int_list(.(x,y)) >= .(s(x),int_list(y)) ;
  int_list(nil) >= nil ;
  Marked_int_list(.(x,y)) >= Marked_int_list(y) ;
 }
 + Disjunctions:{ 
{
  Marked_int_list(.(x,y)) > Marked_int_list(y) ;
 }
 } 
=== 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 : 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 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 50.581877 seconds (real time)
Cime Exit Status: 0