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

TRS termination of:
[1] from(X) -> cons(X,from(s(X)))
[2] sel(0,cons(X,XS)) -> X
[3] sel(s(N),cons(X,XS)) -> sel(N,XS)
[4] minus(X,0) -> 0
[5] minus(s(X),s(Y)) -> minus(X,Y)
[6] quot(0,s(Y)) -> 0
[7] quot(s(X),s(Y)) -> s(quot(minus(X,Y),s(Y)))
[8] zWquot(XS,nil) -> nil
[9] zWquot(nil,XS) -> nil
[10] zWquot(cons(X,XS),cons(Y,YS)) -> cons(quot(X,Y),zWquot(XS,YS))


Sub problem: 
guided: 

DP termination of:
<Marked_from(X) , Marked_from(s(X))>
<Marked_sel(s(N),cons(X,XS)) , Marked_sel(N,XS)>
<Marked_minus(s(X),s(Y)) , Marked_minus(X,Y)>
<Marked_quot(s(X),s(Y)) , Marked_quot(minus(X,Y),s(Y))>
<Marked_quot(s(X),s(Y)) , Marked_minus(X,Y)>
<Marked_zWquot(cons(X,XS),cons(Y,YS)) , Marked_quot(X,Y)>
<Marked_zWquot(cons(X,XS),cons(Y,YS)) , Marked_zWquot(XS,YS)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 5 components:

{  <Marked_from(X) , Marked_from(s(X))> 
      --> <Marked_from(X) , Marked_from(s(X))>
}

{  <Marked_sel(s(N),cons(X,XS)) , Marked_sel(N,XS)> 
      --> <Marked_sel(s(N),cons(X,XS)) , Marked_sel(N,XS)>
}

{  <Marked_zWquot(cons(X,XS),cons(Y,YS)) , Marked_zWquot(XS,YS)> 
      --> <Marked_zWquot(cons(X,XS),cons(Y,YS)) , Marked_zWquot(XS,YS)>
}

{  <Marked_quot(s(X),s(Y)) , Marked_quot(minus(X,Y),s(Y))> 
      --> <Marked_quot(s(X),s(Y)) , Marked_quot(minus(X,Y),s(Y))>
}

{  <Marked_minus(s(X),s(Y)) , Marked_minus(X,Y)> 
      --> <Marked_minus(s(X),s(Y)) , Marked_minus(X,Y)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  from(X) >= cons(X,from(s(X))) ;
  sel(s(N),cons(X,XS)) >= sel(N,XS) ;
  sel(0,cons(X,XS)) >= X ;
  minus(s(X),s(Y)) >= minus(X,Y) ;
  minus(X,0) >= 0 ;
  quot(s(X),s(Y)) >= s(quot(minus(X,Y),s(Y))) ;
  quot(0,s(Y)) >= 0 ;
  zWquot(cons(X,XS),cons(Y,YS)) >= cons(quot(X,Y),zWquot(XS,YS)) ;
  zWquot(nil,XS) >= nil ;
  zWquot(XS,nil) >= nil ;
  Marked_from(X) >= Marked_from(s(X)) ;
 }
 + Disjunctions:{ 
{
  Marked_from(X) > Marked_from(s(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 ===
=== 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 0.422651 seconds (real time)
Cime Exit Status: 0