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

TRS termination of:
[1] pairNs -> cons(0,n__incr(oddNs))
[2] oddNs -> incr(pairNs)
[3] incr(cons(X,XS)) -> cons(s(X),n__incr(activate(XS)))
[4] take(0,XS) -> nil
[5] take(s(N),cons(X,XS)) -> cons(X,n__take(N,activate(XS)))
[6] zip(nil,XS) -> nil
[7] zip(X,nil) -> nil
[8] zip(cons(X,XS),cons(Y,YS)) ->
 cons(pair(X,Y),n__zip(activate(XS),activate(YS)))
[9] tail(cons(X,XS)) -> activate(XS)
[10] repItems(nil) -> nil
[11] repItems(cons(X,XS)) -> cons(X,n__cons(X,n__repItems(activate(XS))))
[12] incr(X) -> n__incr(X)
[13] take(X1,X2) -> n__take(X1,X2)
[14] zip(X1,X2) -> n__zip(X1,X2)
[15] cons(X1,X2) -> n__cons(X1,X2)
[16] repItems(X) -> n__repItems(X)
[17] activate(n__incr(X)) -> incr(X)
[18] activate(n__take(X1,X2)) -> take(X1,X2)
[19] activate(n__zip(X1,X2)) -> zip(X1,X2)
[20] activate(n__cons(X1,X2)) -> cons(X1,X2)
[21] activate(n__repItems(X)) -> repItems(X)
[22] activate(X) -> X


Sub problem: 
guided: 

DP termination of:
<Marked_pairNs , Marked_cons(0,n__incr(oddNs))>
<Marked_pairNs , Marked_oddNs>
<Marked_oddNs , Marked_incr(pairNs)>
<Marked_oddNs , Marked_pairNs>
<Marked_incr(cons(X,XS)) , Marked_cons(s(X),n__incr(activate(XS)))>
<Marked_incr(cons(X,XS)) , Marked_activate(XS)>
<Marked_take(s(N),cons(X,XS)) , Marked_cons(X,n__take(N,activate(XS)))>
<Marked_take(s(N),cons(X,XS)) , Marked_activate(XS)>
<Marked_zip(cons(X,XS),cons(Y,YS)) , Marked_cons(pair(X,Y),
                                      n__zip(activate(XS),activate(YS)))>
<Marked_zip(cons(X,XS),cons(Y,YS)) , Marked_activate(XS)>
<Marked_zip(cons(X,XS),cons(Y,YS)) , Marked_activate(YS)>
<Marked_tail(cons(X,XS)) , Marked_activate(XS)>
<Marked_repItems(cons(X,XS)) , Marked_cons(X,
                                n__cons(X,n__repItems(activate(XS))))>
<Marked_repItems(cons(X,XS)) , Marked_activate(XS)>
<Marked_activate(n__incr(X)) , Marked_incr(X)>
<Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
<Marked_activate(n__zip(X1,X2)) , Marked_zip(X1,X2)>
<Marked_activate(n__cons(X1,X2)) , Marked_cons(X1,X2)>
<Marked_activate(n__repItems(X)) , Marked_repItems(X)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 2 components:

{  <Marked_oddNs , Marked_pairNs> --> <Marked_pairNs , Marked_oddNs>
  <Marked_pairNs , Marked_oddNs> --> <Marked_oddNs , Marked_pairNs>
}

{  <Marked_activate(n__repItems(X)) , Marked_repItems(X)> 
      --> <Marked_repItems(cons(X,XS)) , Marked_activate(XS)>
  <Marked_activate(n__zip(X1,X2)) , Marked_zip(X1,X2)> 
     --> <Marked_zip(cons(X,XS),cons(Y,YS)) , Marked_activate(YS)>
  <Marked_activate(n__zip(X1,X2)) , Marked_zip(X1,X2)> 
     --> <Marked_zip(cons(X,XS),cons(Y,YS)) , Marked_activate(XS)>
  <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)> 
     --> <Marked_take(s(N),cons(X,XS)) , Marked_activate(XS)>
  <Marked_activate(n__incr(X)) , Marked_incr(X)> 
     --> <Marked_incr(cons(X,XS)) , Marked_activate(XS)>
  <Marked_repItems(cons(X,XS)) , Marked_activate(XS)> 
     --> <Marked_activate(n__repItems(X)) , Marked_repItems(X)>
  <Marked_repItems(cons(X,XS)) , Marked_activate(XS)> 
     --> <Marked_activate(n__zip(X1,X2)) , Marked_zip(X1,X2)>
  <Marked_repItems(cons(X,XS)) , Marked_activate(XS)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_repItems(cons(X,XS)) , Marked_activate(XS)> 
     --> <Marked_activate(n__incr(X)) , Marked_incr(X)>
  <Marked_zip(cons(X,XS),cons(Y,YS)) , Marked_activate(YS)> 
     --> <Marked_activate(n__repItems(X)) , Marked_repItems(X)>
  <Marked_zip(cons(X,XS),cons(Y,YS)) , Marked_activate(YS)> 
     --> <Marked_activate(n__zip(X1,X2)) , Marked_zip(X1,X2)>
  <Marked_zip(cons(X,XS),cons(Y,YS)) , Marked_activate(YS)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_zip(cons(X,XS),cons(Y,YS)) , Marked_activate(YS)> 
     --> <Marked_activate(n__incr(X)) , Marked_incr(X)>
  <Marked_zip(cons(X,XS),cons(Y,YS)) , Marked_activate(XS)> 
     --> <Marked_activate(n__repItems(X)) , Marked_repItems(X)>
  <Marked_zip(cons(X,XS),cons(Y,YS)) , Marked_activate(XS)> 
     --> <Marked_activate(n__zip(X1,X2)) , Marked_zip(X1,X2)>
  <Marked_zip(cons(X,XS),cons(Y,YS)) , Marked_activate(XS)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_zip(cons(X,XS),cons(Y,YS)) , Marked_activate(XS)> 
     --> <Marked_activate(n__incr(X)) , Marked_incr(X)>
  <Marked_take(s(N),cons(X,XS)) , Marked_activate(XS)> 
     --> <Marked_activate(n__repItems(X)) , Marked_repItems(X)>
  <Marked_take(s(N),cons(X,XS)) , Marked_activate(XS)> 
     --> <Marked_activate(n__zip(X1,X2)) , Marked_zip(X1,X2)>
  <Marked_take(s(N),cons(X,XS)) , Marked_activate(XS)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_take(s(N),cons(X,XS)) , Marked_activate(XS)> 
     --> <Marked_activate(n__incr(X)) , Marked_incr(X)>
  <Marked_incr(cons(X,XS)) , Marked_activate(XS)> 
     --> <Marked_activate(n__repItems(X)) , Marked_repItems(X)>
  <Marked_incr(cons(X,XS)) , Marked_activate(XS)> 
     --> <Marked_activate(n__zip(X1,X2)) , Marked_zip(X1,X2)>
  <Marked_incr(cons(X,XS)) , Marked_activate(XS)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_incr(cons(X,XS)) , Marked_activate(XS)> 
     --> <Marked_activate(n__incr(X)) , Marked_incr(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(X1,X2) >= n__cons(X1,X2) ;
  oddNs >= incr(pairNs) ;
  pairNs >= cons(0,n__incr(oddNs)) ;
  incr(cons(X,XS)) >= cons(s(X),n__incr(activate(XS))) ;
  incr(X) >= n__incr(X) ;
  activate(n__incr(X)) >= incr(X) ;
  activate(n__take(X1,X2)) >= take(X1,X2) ;
  activate(n__zip(X1,X2)) >= zip(X1,X2) ;
  activate(n__cons(X1,X2)) >= cons(X1,X2) ;
  activate(n__repItems(X)) >= repItems(X) ;
  activate(X) >= X ;
  take(0,XS) >= nil ;
  take(s(N),cons(X,XS)) >= cons(X,n__take(N,activate(XS))) ;
  take(X1,X2) >= n__take(X1,X2) ;
  zip(cons(X,XS),cons(Y,YS)) >= cons(pair(X,Y),
                                 n__zip(activate(XS),activate(YS))) ;
  zip(nil,XS) >= nil ;
  zip(X,nil) >= nil ;
  zip(X1,X2) >= n__zip(X1,X2) ;
  tail(cons(X,XS)) >= activate(XS) ;
  repItems(cons(X,XS)) >= cons(X,n__cons(X,n__repItems(activate(XS)))) ;
  repItems(nil) >= nil ;
  repItems(X) >= n__repItems(X) ;
  Marked_oddNs >= Marked_pairNs ;
  Marked_pairNs >= Marked_oddNs ;
 }
 + Disjunctions:{ 
{
  Marked_oddNs > Marked_pairNs ;
 }
{
  Marked_pairNs > Marked_oddNs ;
 }
 } 
=== 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 10.284538 seconds (real time)
Cime Exit Status: 0