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

TRS termination of:
[1] incr(nil) -> nil
[2] incr(cons(X,L)) -> cons(s(X),n__incr(activate(L)))
[3] adx(nil) -> nil
[4] adx(cons(X,L)) -> incr(cons(X,n__adx(activate(L))))
[5] nats -> adx(zeros)
[6] zeros -> cons(0,n__zeros)
[7] head(cons(X,L)) -> X
[8] tail(cons(X,L)) -> activate(L)
[9] incr(X) -> n__incr(X)
[10] adx(X) -> n__adx(X)
[11] zeros -> n__zeros
[12] activate(n__incr(X)) -> incr(X)
[13] activate(n__adx(X)) -> adx(X)
[14] activate(n__zeros) -> zeros
[15] activate(X) -> X


Sub problem: 
guided: 

DP termination of:
<Marked_incr(cons(X,L)) , Marked_activate(L)>
<Marked_adx(cons(X,L)) , Marked_incr(cons(X,n__adx(activate(L))))>
<Marked_adx(cons(X,L)) , Marked_activate(L)>
<Marked_nats , Marked_adx(zeros)>
<Marked_nats , Marked_zeros>
<Marked_tail(cons(X,L)) , Marked_activate(L)>
<Marked_activate(n__incr(X)) , Marked_incr(X)>
<Marked_activate(n__adx(X)) , Marked_adx(X)>
<Marked_activate(n__zeros) , Marked_zeros>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_activate(n__adx(X)) , Marked_adx(X)> 
      --> <Marked_adx(cons(X,L)) , Marked_activate(L)>
  <Marked_activate(n__adx(X)) , Marked_adx(X)> 
     --> <Marked_adx(cons(X,L)) , Marked_incr(cons(X,n__adx(activate(L))))>
  <Marked_activate(n__incr(X)) , Marked_incr(X)> 
     --> <Marked_incr(cons(X,L)) , Marked_activate(L)>
  <Marked_adx(cons(X,L)) , Marked_activate(L)> 
     --> <Marked_activate(n__adx(X)) , Marked_adx(X)>
  <Marked_adx(cons(X,L)) , Marked_activate(L)> 
     --> <Marked_activate(n__incr(X)) , Marked_incr(X)>
  <Marked_adx(cons(X,L)) , Marked_incr(cons(X,n__adx(activate(L))))> 
     --> <Marked_incr(cons(X,L)) , Marked_activate(L)>
  <Marked_incr(cons(X,L)) , Marked_activate(L)> 
     --> <Marked_activate(n__adx(X)) , Marked_adx(X)>
  <Marked_incr(cons(X,L)) , Marked_activate(L)> 
     --> <Marked_activate(n__incr(X)) , Marked_incr(X)>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  incr(nil) >= nil ;
  incr(cons(X,L)) >= cons(s(X),n__incr(activate(L))) ;
  incr(X) >= n__incr(X) ;
  activate(n__incr(X)) >= incr(X) ;
  activate(n__adx(X)) >= adx(X) ;
  activate(n__zeros) >= zeros ;
  activate(X) >= X ;
  adx(nil) >= nil ;
  adx(cons(X,L)) >= incr(cons(X,n__adx(activate(L)))) ;
  adx(X) >= n__adx(X) ;
  zeros >= cons(0,n__zeros) ;
  zeros >= n__zeros ;
  nats >= adx(zeros) ;
  head(cons(X,L)) >= X ;
  tail(cons(X,L)) >= activate(L) ;
  Marked_activate(n__incr(X)) >= Marked_incr(X) ;
  Marked_activate(n__adx(X)) >= Marked_adx(X) ;
  Marked_adx(cons(X,L)) >= Marked_activate(L) ;
  Marked_adx(cons(X,L)) >= Marked_incr(cons(X,n__adx(activate(L)))) ;
  Marked_incr(cons(X,L)) >= Marked_activate(L) ;
 }
 + Disjunctions:{ 
{
  Marked_activate(n__incr(X)) > Marked_incr(X) ;
 }
{
  Marked_activate(n__adx(X)) > Marked_adx(X) ;
 }
{
  Marked_adx(cons(X,L)) > Marked_activate(L) ;
 }
{
  Marked_adx(cons(X,L)) > Marked_incr(cons(X,n__adx(activate(L)))) ;
 }
{
  Marked_incr(cons(X,L)) > Marked_activate(L) ;
 }
 } 
=== 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
Sat solver result read
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
constraint: incr(nil) >= nil
constraint: incr(cons(X,L)) >= cons(s(X),n__incr(activate(L)))
constraint: incr(X) >= n__incr(X)
constraint: activate(n__incr(X)) >= incr(X)
constraint: activate(n__adx(X)) >= adx(X)
constraint: activate(n__zeros) >= zeros
constraint: activate(X) >= X
constraint: adx(nil) >= nil
constraint: adx(cons(X,L)) >= incr(cons(X,n__adx(activate(L))))
constraint: adx(X) >= n__adx(X)
constraint: zeros >= cons(0,n__zeros)
constraint: zeros >= n__zeros
constraint: nats >= adx(zeros)
constraint: head(cons(X,L)) >= X
constraint: tail(cons(X,L)) >= activate(L)
constraint: Marked_activate(n__incr(X)) >= Marked_incr(X)
constraint: Marked_activate(n__adx(X)) >= Marked_adx(X)
constraint: Marked_adx(cons(X,L)) >= Marked_activate(L)
constraint: Marked_adx(cons(X,L)) >= Marked_incr(cons(X,n__adx(activate(L))))
constraint: Marked_incr(cons(X,L)) >= Marked_activate(L)
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_activate(n__adx(X)) , Marked_adx(X)> 
      --> <Marked_adx(cons(X,L)) , Marked_incr(cons(X,n__adx(activate(L))))>
  <Marked_activate(n__incr(X)) , Marked_incr(X)> 
     --> <Marked_incr(cons(X,L)) , Marked_activate(L)>
  <Marked_adx(cons(X,L)) , Marked_incr(cons(X,n__adx(activate(L))))> 
     --> <Marked_incr(cons(X,L)) , Marked_activate(L)>
  <Marked_incr(cons(X,L)) , Marked_activate(L)> 
     --> <Marked_activate(n__adx(X)) , Marked_adx(X)>
  <Marked_incr(cons(X,L)) , Marked_activate(L)> 
     --> <Marked_activate(n__incr(X)) , Marked_incr(X)>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  incr(nil) >= nil ;
  incr(cons(X,L)) >= cons(s(X),n__incr(activate(L))) ;
  incr(X) >= n__incr(X) ;
  activate(n__incr(X)) >= incr(X) ;
  activate(n__adx(X)) >= adx(X) ;
  activate(n__zeros) >= zeros ;
  activate(X) >= X ;
  adx(nil) >= nil ;
  adx(cons(X,L)) >= incr(cons(X,n__adx(activate(L)))) ;
  adx(X) >= n__adx(X) ;
  zeros >= cons(0,n__zeros) ;
  zeros >= n__zeros ;
  nats >= adx(zeros) ;
  head(cons(X,L)) >= X ;
  tail(cons(X,L)) >= activate(L) ;
  Marked_activate(n__incr(X)) >= Marked_incr(X) ;
  Marked_activate(n__adx(X)) >= Marked_adx(X) ;
  Marked_adx(cons(X,L)) >= Marked_incr(cons(X,n__adx(activate(L)))) ;
  Marked_incr(cons(X,L)) >= Marked_activate(L) ;
 }
 + Disjunctions:{ 
{
  Marked_activate(n__incr(X)) > Marked_incr(X) ;
 }
{
  Marked_activate(n__adx(X)) > Marked_adx(X) ;
 }
{
  Marked_adx(cons(X,L)) > Marked_incr(cons(X,n__adx(activate(L)))) ;
 }
{
  Marked_incr(cons(X,L)) > Marked_activate(L) ;
 }
 } 
=== 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 : 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 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:
{
  incr(nil) >= nil ;
  incr(cons(X,L)) >= cons(s(X),n__incr(activate(L))) ;
  incr(X) >= n__incr(X) ;
  activate(n__incr(X)) >= incr(X) ;
  activate(n__adx(X)) >= adx(X) ;
  activate(n__zeros) >= zeros ;
  activate(X) >= X ;
  adx(nil) >= nil ;
  adx(cons(X,L)) >= incr(cons(X,n__adx(activate(L)))) ;
  adx(X) >= n__adx(X) ;
  zeros >= cons(0,n__zeros) ;
  zeros >= n__zeros ;
  nats >= adx(zeros) ;
  head(cons(X,L)) >= X ;
  tail(cons(X,L)) >= activate(L) ;
  Marked_activate(n__incr(X)) > Marked_incr(X) ;
  Marked_activate(n__adx(X)) >= Marked_adx(X) ;
  Marked_adx(cons(X,L)) >= Marked_incr(cons(X,n__adx(activate(L)))) ;
  Marked_incr(cons(X,L)) > Marked_activate(L) ;
 }

APPLY CRITERIA (SOLVE_ORD)
Trying to solve the following constraints:
{
  incr(nil) >= nil ;
  incr(cons(X,L)) >= cons(s(X),n__incr(activate(L))) ;
  incr(X) >= n__incr(X) ;
  activate(n__incr(X)) >= incr(X) ;
  activate(n__adx(X)) >= adx(X) ;
  activate(n__zeros) >= zeros ;
  activate(X) >= X ;
  adx(nil) >= nil ;
  adx(cons(X,L)) >= incr(cons(X,n__adx(activate(L)))) ;
  adx(X) >= n__adx(X) ;
  zeros >= cons(0,n__zeros) ;
  zeros >= n__zeros ;
  nats >= adx(zeros) ;
  head(cons(X,L)) >= X ;
  tail(cons(X,L)) >= activate(L) ;
  Marked_activate(n__incr(X)) > Marked_incr(X) ;
  Marked_activate(n__adx(X)) >= Marked_adx(X) ;
  Marked_adx(cons(X,L)) >= Marked_incr(cons(X,n__adx(activate(L)))) ;
  Marked_incr(cons(X,L)) > Marked_activate(L) ;
 }
 + 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.(8317 bt (11391) [312])
=== 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 76.580582 seconds (real time)
Cime Exit Status: 0