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

TRS termination of:
[1] f(true,x,y) -> f(and(gt(x,y),gt(y,s(s(0)))),plus(s(0),x),double(y))
[2] gt(0,v) -> false
[3] gt(s(u),0) -> true
[4] gt(s(u),s(v)) -> gt(u,v)
[5] and(x,true) -> x
[6] and(x,false) -> false
[7] plus(n,0) -> n
[8] plus(n,s(m)) -> s(plus(n,m))
[9] double(0) -> 0
[10] double(s(x)) -> s(s(double(x)))


Sub problem: 
guided: 

DP termination of:
<Marked_f(true,x,y) , Marked_f(and(gt(x,y),gt(y,s(s(0)))),plus(s(0),x),
                       double(y))>
<Marked_f(true,x,y) , Marked_and(gt(x,y),gt(y,s(s(0))))>
<Marked_f(true,x,y) , Marked_gt(x,y)>
<Marked_f(true,x,y) , Marked_gt(y,s(s(0)))>
<Marked_f(true,x,y) , Marked_plus(s(0),x)>
<Marked_f(true,x,y) , Marked_double(y)>
<Marked_gt(s(u),s(v)) , Marked_gt(u,v)>
<Marked_plus(n,s(m)) , Marked_plus(n,m)>
<Marked_double(s(x)) , Marked_double(x)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 4 components:

{  <Marked_f(true,x,y) , Marked_f(and(gt(x,y),gt(y,s(s(0)))),plus(s(0),x),
                          double(y))> 
      --> <Marked_f(true,x,y) , Marked_f(and(gt(x,y),gt(y,s(s(0)))),
                                 plus(s(0),x),double(y))>
}

{  <Marked_gt(s(u),s(v)) , Marked_gt(u,v)> 
      --> <Marked_gt(s(u),s(v)) , Marked_gt(u,v)>
}

{  <Marked_plus(n,s(m)) , Marked_plus(n,m)> 
      --> <Marked_plus(n,s(m)) , Marked_plus(n,m)>
}

{  <Marked_double(s(x)) , Marked_double(x)> 
      --> <Marked_double(s(x)) , Marked_double(x)>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  f(true,x,y) >= f(and(gt(x,y),gt(y,s(s(0)))),plus(s(0),x),double(y)) ;
  and(x,true) >= x ;
  and(x,false) >= false ;
  gt(s(u),s(v)) >= gt(u,v) ;
  gt(s(u),0) >= true ;
  gt(0,v) >= false ;
  plus(n,s(m)) >= s(plus(n,m)) ;
  plus(n,0) >= n ;
  double(s(x)) >= s(s(double(x))) ;
  double(0) >= 0 ;
  Marked_f(true,x,y) >= Marked_f(and(gt(x,y),gt(y,s(s(0)))),plus(s(0),x),
                         double(y)) ;
 }
 + Disjunctions:{ 
{
  Marked_f(true,x,y) > Marked_f(and(gt(x,y),gt(y,s(s(0)))),plus(s(0),x),
                        double(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 timeout reached
=== 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 (Simple graph)
Found the following constraints:
{
  f(true,x,y) >= f(and(gt(x,y),gt(y,s(s(0)))),plus(s(0),x),double(y)) ;
  and(x,true) >= x ;
  and(x,false) >= false ;
  gt(s(u),s(v)) >= gt(u,v) ;
  gt(s(u),0) >= true ;
  gt(0,v) >= false ;
  plus(n,s(m)) >= s(plus(n,m)) ;
  plus(n,0) >= n ;
  double(s(x)) >= s(s(double(x))) ;
  double(0) >= 0 ;
  Marked_f(true,x,y) > Marked_f(and(gt(x,y),gt(y,s(s(0)))),plus(s(0),x),
                        double(y)) ;
 }

APPLY CRITERIA (SOLVE_ORD)
Trying to solve the following constraints:
{
  f(true,x,y) >= f(and(gt(x,y),gt(y,s(s(0)))),plus(s(0),x),double(y)) ;
  and(x,true) >= x ;
  and(x,false) >= false ;
  gt(s(u),s(v)) >= gt(u,v) ;
  gt(s(u),0) >= true ;
  gt(0,v) >= false ;
  plus(n,s(m)) >= s(plus(n,m)) ;
  plus(n,0) >= n ;
  double(s(x)) >= s(s(double(x))) ;
  double(0) >= 0 ;
  Marked_f(true,x,y) > Marked_f(and(gt(x,y),gt(y,s(s(0)))),plus(s(0),x),
                        double(y)) ;
 }
 + 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 ===
No solution found for these parameters.(2573 bt (745) [1090])
=== 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 timeout reached
=== 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 174.822095 seconds (real time)
Cime Exit Status: 0