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

TRS termination of:
[1] primes -> sieve(from(s(s(0))))
[2] from(X) -> cons(X,n__from(s(X)))
[3] head(cons(X,Y)) -> X
[4] tail(cons(X,Y)) -> activate(Y)
[5] if(true,X,Y) -> activate(X)
[6] if(false,X,Y) -> activate(Y)
[7] filter(s(s(X)),cons(Y,Z)) ->
 if(divides(s(s(X)),Y),n__filter(s(s(X)),activate(Z)),
  n__cons(Y,n__filter(X,sieve(Y))))
[8] sieve(cons(X,Y)) -> cons(X,n__filter(X,sieve(activate(Y))))
[9] from(X) -> n__from(X)
[10] filter(X1,X2) -> n__filter(X1,X2)
[11] cons(X1,X2) -> n__cons(X1,X2)
[12] activate(n__from(X)) -> from(X)
[13] activate(n__filter(X1,X2)) -> filter(X1,X2)
[14] activate(n__cons(X1,X2)) -> cons(X1,X2)
[15] activate(X) -> X


Sub problem: 
guided: 

DP termination of:
<Marked_primes , Marked_sieve(from(s(s(0))))>
<Marked_primes , Marked_from(s(s(0)))>
<Marked_from(X) , Marked_cons(X,n__from(s(X)))>
<Marked_tail(cons(X,Y)) , Marked_activate(Y)>
<Marked_if(true,X,Y) , Marked_activate(X)>
<Marked_if(false,X,Y) , Marked_activate(Y)>
<Marked_filter(s(s(X)),cons(Y,Z)) , Marked_if(divides(s(s(X)),Y),
                                     n__filter(s(s(X)),activate(Z)),
                                     n__cons(Y,n__filter(X,sieve(Y))))>
<Marked_filter(s(s(X)),cons(Y,Z)) , Marked_activate(Z)>
<Marked_filter(s(s(X)),cons(Y,Z)) , Marked_sieve(Y)>
<Marked_sieve(cons(X,Y)) , Marked_cons(X,n__filter(X,sieve(activate(Y))))>
<Marked_sieve(cons(X,Y)) , Marked_sieve(activate(Y))>
<Marked_sieve(cons(X,Y)) , Marked_activate(Y)>
<Marked_activate(n__from(X)) , Marked_from(X)>
<Marked_activate(n__filter(X1,X2)) , Marked_filter(X1,X2)>
<Marked_activate(n__cons(X1,X2)) , Marked_cons(X1,X2)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_activate(n__filter(X1,X2)) , Marked_filter(X1,X2)> 
      --> <Marked_filter(s(s(X)),cons(Y,Z)) , Marked_sieve(Y)>
  <Marked_activate(n__filter(X1,X2)) , Marked_filter(X1,X2)> 
     --> <Marked_filter(s(s(X)),cons(Y,Z)) , Marked_activate(Z)>
  <Marked_sieve(cons(X,Y)) , Marked_activate(Y)> 
     --> <Marked_activate(n__filter(X1,X2)) , Marked_filter(X1,X2)>
  <Marked_sieve(cons(X,Y)) , Marked_sieve(activate(Y))> 
     --> <Marked_sieve(cons(X,Y)) , Marked_activate(Y)>
  <Marked_sieve(cons(X,Y)) , Marked_sieve(activate(Y))> 
     --> <Marked_sieve(cons(X,Y)) , Marked_sieve(activate(Y))>
  <Marked_filter(s(s(X)),cons(Y,Z)) , Marked_sieve(Y)> 
     --> <Marked_sieve(cons(X,Y)) , Marked_activate(Y)>
  <Marked_filter(s(s(X)),cons(Y,Z)) , Marked_sieve(Y)> 
     --> <Marked_sieve(cons(X,Y)) , Marked_sieve(activate(Y))>
  <Marked_filter(s(s(X)),cons(Y,Z)) , Marked_activate(Z)> 
     --> <Marked_activate(n__filter(X1,X2)) , Marked_filter(X1,X2)>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  sieve(cons(X,Y)) >= cons(X,n__filter(X,sieve(activate(Y)))) ;
  from(X) >= cons(X,n__from(s(X))) ;
  from(X) >= n__from(X) ;
  primes >= sieve(from(s(s(0)))) ;
  cons(X1,X2) >= n__cons(X1,X2) ;
  head(cons(X,Y)) >= X ;
  activate(n__from(X)) >= from(X) ;
  activate(n__filter(X1,X2)) >= filter(X1,X2) ;
  activate(n__cons(X1,X2)) >= cons(X1,X2) ;
  activate(X) >= X ;
  tail(cons(X,Y)) >= activate(Y) ;
  if(true,X,Y) >= activate(X) ;
  if(false,X,Y) >= activate(Y) ;
  filter(s(s(X)),cons(Y,Z)) >= if(divides(s(s(X)),Y),
                                n__filter(s(s(X)),activate(Z)),
                                n__cons(Y,n__filter(X,sieve(Y)))) ;
  filter(X1,X2) >= n__filter(X1,X2) ;
  Marked_activate(n__filter(X1,X2)) >= Marked_filter(X1,X2) ;
  Marked_filter(s(s(X)),cons(Y,Z)) >= Marked_activate(Z) ;
  Marked_filter(s(s(X)),cons(Y,Z)) >= Marked_sieve(Y) ;
  Marked_sieve(cons(X,Y)) >= Marked_activate(Y) ;
  Marked_sieve(cons(X,Y)) >= Marked_sieve(activate(Y)) ;
 }
 + Disjunctions:{ 
{
  Marked_activate(n__filter(X1,X2)) > Marked_filter(X1,X2) ;
 }
{
  Marked_filter(s(s(X)),cons(Y,Z)) > Marked_activate(Z) ;
 }
{
  Marked_filter(s(s(X)),cons(Y,Z)) > Marked_sieve(Y) ;
 }
{
  Marked_sieve(cons(X,Y)) > Marked_activate(Y) ;
 }
{
  Marked_sieve(cons(X,Y)) > Marked_sieve(activate(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 : 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 : 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:
{
  sieve(cons(X,Y)) >= cons(X,n__filter(X,sieve(activate(Y)))) ;
  from(X) >= cons(X,n__from(s(X))) ;
  from(X) >= n__from(X) ;
  primes >= sieve(from(s(s(0)))) ;
  cons(X1,X2) >= n__cons(X1,X2) ;
  head(cons(X,Y)) >= X ;
  activate(n__from(X)) >= from(X) ;
  activate(n__filter(X1,X2)) >= filter(X1,X2) ;
  activate(n__cons(X1,X2)) >= cons(X1,X2) ;
  activate(X) >= X ;
  tail(cons(X,Y)) >= activate(Y) ;
  if(true,X,Y) >= activate(X) ;
  if(false,X,Y) >= activate(Y) ;
  filter(s(s(X)),cons(Y,Z)) >= if(divides(s(s(X)),Y),
                                n__filter(s(s(X)),activate(Z)),
                                n__cons(Y,n__filter(X,sieve(Y)))) ;
  filter(X1,X2) >= n__filter(X1,X2) ;
  Marked_activate(n__filter(X1,X2)) >= Marked_filter(X1,X2) ;
  Marked_filter(s(s(X)),cons(Y,Z)) > Marked_activate(Z) ;
  Marked_filter(s(s(X)),cons(Y,Z)) >= Marked_sieve(Y) ;
  Marked_sieve(cons(X,Y)) > Marked_activate(Y) ;
  Marked_sieve(cons(X,Y)) > Marked_sieve(activate(Y)) ;
 }

APPLY CRITERIA (SOLVE_ORD)
Trying to solve the following constraints:
{
  sieve(cons(X,Y)) >= cons(X,n__filter(X,sieve(activate(Y)))) ;
  from(X) >= cons(X,n__from(s(X))) ;
  from(X) >= n__from(X) ;
  primes >= sieve(from(s(s(0)))) ;
  cons(X1,X2) >= n__cons(X1,X2) ;
  head(cons(X,Y)) >= X ;
  activate(n__from(X)) >= from(X) ;
  activate(n__filter(X1,X2)) >= filter(X1,X2) ;
  activate(n__cons(X1,X2)) >= cons(X1,X2) ;
  activate(X) >= X ;
  tail(cons(X,Y)) >= activate(Y) ;
  if(true,X,Y) >= activate(X) ;
  if(false,X,Y) >= activate(Y) ;
  filter(s(s(X)),cons(Y,Z)) >= if(divides(s(s(X)),Y),
                                n__filter(s(s(X)),activate(Z)),
                                n__cons(Y,n__filter(X,sieve(Y)))) ;
  filter(X1,X2) >= n__filter(X1,X2) ;
  Marked_activate(n__filter(X1,X2)) >= Marked_filter(X1,X2) ;
  Marked_filter(s(s(X)),cons(Y,Z)) > Marked_activate(Z) ;
  Marked_filter(s(s(X)),cons(Y,Z)) >= Marked_sieve(Y) ;
  Marked_sieve(cons(X,Y)) > Marked_activate(Y) ;
  Marked_sieve(cons(X,Y)) > Marked_sieve(activate(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.(133525 bt (179193) [5967])
=== 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 180.406501 seconds (real time)
Cime Exit Status: 0