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

TRS termination of:
[1] table -> gen(s(0))
[2] gen(x) -> if1(le(x,10),x)
[3] if1(false,x) -> nil
[4] if1(true,x) -> if2(x,x)
[5] if2(x,y) -> if3(le(y,10),x,y)
[6] if3(true,x,y) -> cons(entry(x,y,times(x,y)),if2(x,s(y)))
[7] if3(false,x,y) -> gen(s(x))
[8] le(0,y) -> true
[9] le(s(x),0) -> false
[10] le(s(x),s(y)) -> le(x,y)
[11] plus(0,y) -> y
[12] plus(s(x),y) -> s(plus(x,y))
[13] times(0,y) -> 0
[14] times(s(x),y) -> plus(y,times(x,y))
[15] 10 -> s(s(s(s(s(s(s(s(s(s(0))))))))))


Sub problem: 
guided: 

DP termination of:
<Marked_table , Marked_gen(s(0))>
<Marked_gen(x) , Marked_if1(le(x,10),x)>
<Marked_gen(x) , Marked_le(x,10)>
<Marked_gen(x) , Marked_10>
<Marked_if1(true,x) , Marked_if2(x,x)>
<Marked_if2(x,y) , Marked_if3(le(y,10),x,y)>
<Marked_if2(x,y) , Marked_le(y,10)>
<Marked_if2(x,y) , Marked_10>
<Marked_if3(true,x,y) , Marked_times(x,y)>
<Marked_if3(true,x,y) , Marked_if2(x,s(y))>
<Marked_if3(false,x,y) , Marked_gen(s(x))>
<Marked_le(s(x),s(y)) , Marked_le(x,y)>
<Marked_plus(s(x),y) , Marked_plus(x,y)>
<Marked_times(s(x),y) , Marked_plus(y,times(x,y))>
<Marked_times(s(x),y) , Marked_times(x,y)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 4 components:

{  <Marked_if3(false,x,y) , Marked_gen(s(x))> 
      --> <Marked_gen(x) , Marked_if1(le(x,10),x)>
  <Marked_if3(true,x,y) , Marked_if2(x,s(y))> 
     --> <Marked_if2(x,y) , Marked_if3(le(y,10),x,y)>
  <Marked_if2(x,y) , Marked_if3(le(y,10),x,y)> 
     --> <Marked_if3(false,x,y) , Marked_gen(s(x))>
  <Marked_if2(x,y) , Marked_if3(le(y,10),x,y)> 
     --> <Marked_if3(true,x,y) , Marked_if2(x,s(y))>
  <Marked_if1(true,x) , Marked_if2(x,x)> 
     --> <Marked_if2(x,y) , Marked_if3(le(y,10),x,y)>
  <Marked_gen(x) , Marked_if1(le(x,10),x)> 
     --> <Marked_if1(true,x) , Marked_if2(x,x)>
}

{  <Marked_le(s(x),s(y)) , Marked_le(x,y)> 
      --> <Marked_le(s(x),s(y)) , Marked_le(x,y)>
}

{  <Marked_times(s(x),y) , Marked_times(x,y)> 
      --> <Marked_times(s(x),y) , Marked_times(x,y)>
}

{  <Marked_plus(s(x),y) , Marked_plus(x,y)> 
      --> <Marked_plus(s(x),y) , Marked_plus(x,y)>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  gen(x) >= if1(le(x,10),x) ;
  table >= gen(s(0)) ;
  if1(false,x) >= nil ;
  if1(true,x) >= if2(x,x) ;
  le(s(x),s(y)) >= le(x,y) ;
  le(s(x),0) >= false ;
  le(0,y) >= true ;
  10 >= s(s(s(s(s(s(s(s(s(s(0)))))))))) ;
  if2(x,y) >= if3(le(y,10),x,y) ;
  if3(false,x,y) >= gen(s(x)) ;
  if3(true,x,y) >= cons(entry(x,y,times(x,y)),if2(x,s(y))) ;
  times(s(x),y) >= plus(y,times(x,y)) ;
  times(0,y) >= 0 ;
  plus(s(x),y) >= s(plus(x,y)) ;
  plus(0,y) >= y ;
  Marked_if3(false,x,y) >= Marked_gen(s(x)) ;
  Marked_if3(true,x,y) >= Marked_if2(x,s(y)) ;
  Marked_gen(x) >= Marked_if1(le(x,10),x) ;
  Marked_if2(x,y) >= Marked_if3(le(y,10),x,y) ;
  Marked_if1(true,x) >= Marked_if2(x,x) ;
 }
 + Disjunctions:{ 
{
  Marked_if3(false,x,y) > Marked_gen(s(x)) ;
 }
{
  Marked_if3(true,x,y) > Marked_if2(x,s(y)) ;
 }
{
  Marked_gen(x) > Marked_if1(le(x,10),x) ;
 }
{
  Marked_if2(x,y) > Marked_if3(le(y,10),x,y) ;
 }
{
  Marked_if1(true,x) > Marked_if2(x,x) ;
 }
 } 
=== 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 ===
Time out for these parameters.
=== 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
=== STOPING TIMER virtual ===
No solution found for these parameters.
No solution found for these constraints.
APPLY CRITERIA (Simple graph)
Found the following constraints:
{
  gen(x) >= if1(le(x,10),x) ;
  table >= gen(s(0)) ;
  if1(false,x) >= nil ;
  if1(true,x) >= if2(x,x) ;
  le(s(x),s(y)) >= le(x,y) ;
  le(s(x),0) >= false ;
  le(0,y) >= true ;
  10 >= s(s(s(s(s(s(s(s(s(s(0)))))))))) ;
  if2(x,y) >= if3(le(y,10),x,y) ;
  if3(false,x,y) >= gen(s(x)) ;
  if3(true,x,y) >= cons(entry(x,y,times(x,y)),if2(x,s(y))) ;
  times(s(x),y) >= plus(y,times(x,y)) ;
  times(0,y) >= 0 ;
  plus(s(x),y) >= s(plus(x,y)) ;
  plus(0,y) >= y ;
  Marked_if3(false,x,y) >= Marked_gen(s(x)) ;
  Marked_if3(true,x,y) > Marked_if2(x,s(y)) ;
  Marked_gen(x) >= Marked_if1(le(x,10),x) ;
  Marked_if2(x,y) > Marked_if3(le(y,10),x,y) ;
  Marked_if1(true,x) >= Marked_if2(x,x) ;
 }

APPLY CRITERIA (SOLVE_ORD)
Trying to solve the following constraints:
{
  gen(x) >= if1(le(x,10),x) ;
  table >= gen(s(0)) ;
  if1(false,x) >= nil ;
  if1(true,x) >= if2(x,x) ;
  le(s(x),s(y)) >= le(x,y) ;
  le(s(x),0) >= false ;
  le(0,y) >= true ;
  10 >= s(s(s(s(s(s(s(s(s(s(0)))))))))) ;
  if2(x,y) >= if3(le(y,10),x,y) ;
  if3(false,x,y) >= gen(s(x)) ;
  if3(true,x,y) >= cons(entry(x,y,times(x,y)),if2(x,s(y))) ;
  times(s(x),y) >= plus(y,times(x,y)) ;
  times(0,y) >= 0 ;
  plus(s(x),y) >= s(plus(x,y)) ;
  plus(0,y) >= y ;
  Marked_if3(false,x,y) >= Marked_gen(s(x)) ;
  Marked_if3(true,x,y) > Marked_if2(x,s(y)) ;
  Marked_gen(x) >= Marked_if1(le(x,10),x) ;
  Marked_if2(x,y) > Marked_if3(le(y,10),x,y) ;
  Marked_if1(true,x) >= Marked_if2(x,x) ;
 }
 + Disjunctions:{ 
 } 
=== 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 ===
Time out for these parameters.
=== 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
=== 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 162.906586 seconds (real time)
Cime Exit Status: 0