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

TRS termination of:
[1] sort(l) -> st(0,l)
[2] st(n,l) -> cond1(member(n,l),n,l)
[3] cond1(true,n,l) -> cons(n,st(s(n),l))
[4] cond1(false,n,l) -> cond2(gt(n,max(l)),n,l)
[5] cond2(true,n,l) -> nil
[6] cond2(false,n,l) -> st(s(n),l)
[7] member(n,nil) -> false
[8] member(n,cons(m,l)) -> or(equal(n,m),member(n,l))
[9] or(x,true) -> true
[10] or(x,false) -> x
[11] equal(0,0) -> true
[12] equal(s(x),0) -> false
[13] equal(0,s(y)) -> false
[14] equal(s(x),s(y)) -> equal(x,y)
[15] gt(0,v) -> false
[16] gt(s(u),0) -> true
[17] gt(s(u),s(v)) -> gt(u,v)
[18] max(nil) -> 0
[19] max(cons(u,l)) -> if(gt(u,max(l)),u,max(l))
[20] if(true,u,v) -> u
[21] if(false,u,v) -> v


Sub problem: 
guided: 

DP termination of:
<Marked_sort(l) , Marked_st(0,l)>
<Marked_st(n,l) , Marked_cond1(member(n,l),n,l)>
<Marked_st(n,l) , Marked_member(n,l)>
<Marked_cond1(true,n,l) , Marked_st(s(n),l)>
<Marked_cond1(false,n,l) , Marked_cond2(gt(n,max(l)),n,l)>
<Marked_cond1(false,n,l) , Marked_gt(n,max(l))>
<Marked_cond1(false,n,l) , Marked_max(l)>
<Marked_cond2(false,n,l) , Marked_st(s(n),l)>
<Marked_member(n,cons(m,l)) , Marked_or(equal(n,m),member(n,l))>
<Marked_member(n,cons(m,l)) , Marked_equal(n,m)>
<Marked_member(n,cons(m,l)) , Marked_member(n,l)>
<Marked_equal(s(x),s(y)) , Marked_equal(x,y)>
<Marked_gt(s(u),s(v)) , Marked_gt(u,v)>
<Marked_max(cons(u,l)) , Marked_if(gt(u,max(l)),u,max(l))>
<Marked_max(cons(u,l)) , Marked_gt(u,max(l))>
<Marked_max(cons(u,l)) , Marked_max(l)>
<Marked_max(cons(u,l)) , Marked_max(l)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 5 components:

{  <Marked_cond2(false,n,l) , Marked_st(s(n),l)> 
      --> <Marked_st(n,l) , Marked_cond1(member(n,l),n,l)>
  <Marked_cond1(false,n,l) , Marked_cond2(gt(n,max(l)),n,l)> 
     --> <Marked_cond2(false,n,l) , Marked_st(s(n),l)>
  <Marked_cond1(true,n,l) , Marked_st(s(n),l)> 
     --> <Marked_st(n,l) , Marked_cond1(member(n,l),n,l)>
  <Marked_st(n,l) , Marked_cond1(member(n,l),n,l)> 
     --> <Marked_cond1(false,n,l) , Marked_cond2(gt(n,max(l)),n,l)>
  <Marked_st(n,l) , Marked_cond1(member(n,l),n,l)> 
     --> <Marked_cond1(true,n,l) , Marked_st(s(n),l)>
}

{  <Marked_member(n,cons(m,l)) , Marked_member(n,l)> 
      --> <Marked_member(n,cons(m,l)) , Marked_member(n,l)>
}

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

{  <Marked_max(cons(u,l)) , Marked_max(l)> 
      --> <Marked_max(cons(u,l)) , Marked_max(l)>
  <Marked_max(cons(u,l)) , Marked_max(l)> 
     --> <Marked_max(cons(u,l)) , Marked_max(l)>
  <Marked_max(cons(u,l)) , Marked_max(l)> 
     --> <Marked_max(cons(u,l)) , Marked_max(l)>
  <Marked_max(cons(u,l)) , Marked_max(l)> 
     --> <Marked_max(cons(u,l)) , Marked_max(l)>
}

{  <Marked_gt(s(u),s(v)) , Marked_gt(u,v)> 
      --> <Marked_gt(s(u),s(v)) , Marked_gt(u,v)>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  st(n,l) >= cond1(member(n,l),n,l) ;
  sort(l) >= st(0,l) ;
  cond1(true,n,l) >= cons(n,st(s(n),l)) ;
  cond1(false,n,l) >= cond2(gt(n,max(l)),n,l) ;
  member(n,cons(m,l)) >= or(equal(n,m),member(n,l)) ;
  member(n,nil) >= false ;
  cond2(true,n,l) >= nil ;
  cond2(false,n,l) >= st(s(n),l) ;
  gt(0,v) >= false ;
  gt(s(u),0) >= true ;
  gt(s(u),s(v)) >= gt(u,v) ;
  max(cons(u,l)) >= if(gt(u,max(l)),u,max(l)) ;
  max(nil) >= 0 ;
  or(x,true) >= true ;
  or(x,false) >= x ;
  equal(0,0) >= true ;
  equal(0,s(y)) >= false ;
  equal(s(x),0) >= false ;
  equal(s(x),s(y)) >= equal(x,y) ;
  if(true,u,v) >= u ;
  if(false,u,v) >= v ;
  Marked_cond2(false,n,l) >= Marked_st(s(n),l) ;
  Marked_st(n,l) >= Marked_cond1(member(n,l),n,l) ;
  Marked_cond1(true,n,l) >= Marked_st(s(n),l) ;
  Marked_cond1(false,n,l) >= Marked_cond2(gt(n,max(l)),n,l) ;
 }
 + Disjunctions:{ 
{
  Marked_cond2(false,n,l) > Marked_st(s(n),l) ;
 }
{
  Marked_st(n,l) > Marked_cond1(member(n,l),n,l) ;
 }
{
  Marked_cond1(true,n,l) > Marked_st(s(n),l) ;
 }
{
  Marked_cond1(false,n,l) > Marked_cond2(gt(n,max(l)),n,l) ;
 }
 } 
=== 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
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 (Simple graph)
Found the following constraints:
{
  st(n,l) >= cond1(member(n,l),n,l) ;
  sort(l) >= st(0,l) ;
  cond1(true,n,l) >= cons(n,st(s(n),l)) ;
  cond1(false,n,l) >= cond2(gt(n,max(l)),n,l) ;
  member(n,cons(m,l)) >= or(equal(n,m),member(n,l)) ;
  member(n,nil) >= false ;
  cond2(true,n,l) >= nil ;
  cond2(false,n,l) >= st(s(n),l) ;
  gt(0,v) >= false ;
  gt(s(u),0) >= true ;
  gt(s(u),s(v)) >= gt(u,v) ;
  max(cons(u,l)) >= if(gt(u,max(l)),u,max(l)) ;
  max(nil) >= 0 ;
  or(x,true) >= true ;
  or(x,false) >= x ;
  equal(0,0) >= true ;
  equal(0,s(y)) >= false ;
  equal(s(x),0) >= false ;
  equal(s(x),s(y)) >= equal(x,y) ;
  if(true,u,v) >= u ;
  if(false,u,v) >= v ;
  Marked_cond2(false,n,l) >= Marked_st(s(n),l) ;
  Marked_st(n,l) >= Marked_cond1(member(n,l),n,l) ;
  Marked_cond1(true,n,l) > Marked_st(s(n),l) ;
  Marked_cond1(false,n,l) > Marked_cond2(gt(n,max(l)),n,l) ;
 }

APPLY CRITERIA (SOLVE_ORD)
Trying to solve the following constraints:
{
  st(n,l) >= cond1(member(n,l),n,l) ;
  sort(l) >= st(0,l) ;
  cond1(true,n,l) >= cons(n,st(s(n),l)) ;
  cond1(false,n,l) >= cond2(gt(n,max(l)),n,l) ;
  member(n,cons(m,l)) >= or(equal(n,m),member(n,l)) ;
  member(n,nil) >= false ;
  cond2(true,n,l) >= nil ;
  cond2(false,n,l) >= st(s(n),l) ;
  gt(0,v) >= false ;
  gt(s(u),0) >= true ;
  gt(s(u),s(v)) >= gt(u,v) ;
  max(cons(u,l)) >= if(gt(u,max(l)),u,max(l)) ;
  max(nil) >= 0 ;
  or(x,true) >= true ;
  or(x,false) >= x ;
  equal(0,0) >= true ;
  equal(0,s(y)) >= false ;
  equal(s(x),0) >= false ;
  equal(s(x),s(y)) >= equal(x,y) ;
  if(true,u,v) >= u ;
  if(false,u,v) >= v ;
  Marked_cond2(false,n,l) >= Marked_st(s(n),l) ;
  Marked_st(n,l) >= Marked_cond1(member(n,l),n,l) ;
  Marked_cond1(true,n,l) > Marked_st(s(n),l) ;
  Marked_cond1(false,n,l) > Marked_cond2(gt(n,max(l)),n,l) ;
 }
 + 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
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 52.161537 seconds (real time)
Cime Exit Status: 0