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

TRS termination of:
[1] filter(cons(X,Y),0,M) -> cons(0,filter(Y,M,M))
[2] filter(cons(X,Y),s(N),M) -> cons(X,filter(Y,N,M))
[3] sieve(cons(0,Y)) -> cons(0,sieve(Y))
[4] sieve(cons(s(N),Y)) -> cons(s(N),sieve(filter(Y,N,N)))
[5] nats(N) -> cons(N,nats(s(N)))
[6] zprimes -> sieve(nats(s(s(0))))


Sub problem: 
guided: 

DP termination of:
<Marked_filter(cons(X,Y),0,M) , Marked_filter(Y,M,M)>
<Marked_filter(cons(X,Y),s(N),M) , Marked_filter(Y,N,M)>
<Marked_sieve(cons(0,Y)) , Marked_sieve(Y)>
<Marked_sieve(cons(s(N),Y)) , Marked_sieve(filter(Y,N,N))>
<Marked_sieve(cons(s(N),Y)) , Marked_filter(Y,N,N)>
<Marked_nats(N) , Marked_nats(s(N))>
<Marked_zprimes , Marked_sieve(nats(s(s(0))))>
<Marked_zprimes , Marked_nats(s(s(0)))>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 3 components:

{  <Marked_sieve(cons(s(N),Y)) , Marked_sieve(filter(Y,N,N))> 
      --> <Marked_sieve(cons(s(N),Y)) , Marked_sieve(filter(Y,N,N))>
  <Marked_sieve(cons(s(N),Y)) , Marked_sieve(filter(Y,N,N))> 
     --> <Marked_sieve(cons(0,Y)) , Marked_sieve(Y)>
  <Marked_sieve(cons(0,Y)) , Marked_sieve(Y)> 
     --> <Marked_sieve(cons(s(N),Y)) , Marked_sieve(filter(Y,N,N))>
  <Marked_sieve(cons(0,Y)) , Marked_sieve(Y)> 
     --> <Marked_sieve(cons(0,Y)) , Marked_sieve(Y)>
}

{  <Marked_filter(cons(X,Y),s(N),M) , Marked_filter(Y,N,M)> 
      --> <Marked_filter(cons(X,Y),s(N),M) , Marked_filter(Y,N,M)>
  <Marked_filter(cons(X,Y),s(N),M) , Marked_filter(Y,N,M)> 
     --> <Marked_filter(cons(X,Y),0,M) , Marked_filter(Y,M,M)>
  <Marked_filter(cons(X,Y),0,M) , Marked_filter(Y,M,M)> 
     --> <Marked_filter(cons(X,Y),s(N),M) , Marked_filter(Y,N,M)>
  <Marked_filter(cons(X,Y),0,M) , Marked_filter(Y,M,M)> 
     --> <Marked_filter(cons(X,Y),0,M) , Marked_filter(Y,M,M)>
}

{  <Marked_nats(N) , Marked_nats(s(N))> 
      --> <Marked_nats(N) , Marked_nats(s(N))>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  filter(cons(X,Y),0,M) >= cons(0,filter(Y,M,M)) ;
  filter(cons(X,Y),s(N),M) >= cons(X,filter(Y,N,M)) ;
  sieve(cons(0,Y)) >= cons(0,sieve(Y)) ;
  sieve(cons(s(N),Y)) >= cons(s(N),sieve(filter(Y,N,N))) ;
  nats(N) >= cons(N,nats(s(N))) ;
  zprimes >= sieve(nats(s(s(0)))) ;
  Marked_sieve(cons(0,Y)) >= Marked_sieve(Y) ;
  Marked_sieve(cons(s(N),Y)) >= Marked_sieve(filter(Y,N,N)) ;
 }
 + Disjunctions:{ 
{
  Marked_sieve(cons(0,Y)) > Marked_sieve(Y) ;
 }
{
  Marked_sieve(cons(s(N),Y)) > Marked_sieve(filter(Y,N,N)) ;
 }
 } 
=== 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 : 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 2.535278 seconds (real time)
Cime Exit Status: 0