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

TRS termination of:
[1] from(X) -> cons(X,n__from(n__s(X)))
[2] after(0,XS) -> XS
[3] after(s(N),cons(X,XS)) -> after(N,activate(XS))
[4] from(X) -> n__from(X)
[5] s(X) -> n__s(X)
[6] activate(n__from(X)) -> from(activate(X))
[7] activate(n__s(X)) -> s(activate(X))
[8] activate(X) -> X


Sub problem: 
guided: 

DP termination of:
<Marked_after(s(N),cons(X,XS)) , Marked_after(N,activate(XS))>
<Marked_after(s(N),cons(X,XS)) , Marked_activate(XS)>
<Marked_activate(n__from(X)) , Marked_from(activate(X))>
<Marked_activate(n__from(X)) , Marked_activate(X)>
<Marked_activate(n__s(X)) , Marked_s(activate(X))>
<Marked_activate(n__s(X)) , Marked_activate(X)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 2 components:

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

{  <Marked_activate(n__s(X)) , Marked_activate(X)> 
      --> <Marked_activate(n__s(X)) , Marked_activate(X)>
  <Marked_activate(n__s(X)) , Marked_activate(X)> 
     --> <Marked_activate(n__from(X)) , Marked_activate(X)>
  <Marked_activate(n__from(X)) , Marked_activate(X)> 
     --> <Marked_activate(n__s(X)) , Marked_activate(X)>
  <Marked_activate(n__from(X)) , Marked_activate(X)> 
     --> <Marked_activate(n__from(X)) , Marked_activate(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  from(X) >= cons(X,n__from(n__s(X))) ;
  from(X) >= n__from(X) ;
  after(0,XS) >= XS ;
  after(s(N),cons(X,XS)) >= after(N,activate(XS)) ;
  activate(n__from(X)) >= from(activate(X)) ;
  activate(n__s(X)) >= s(activate(X)) ;
  activate(X) >= X ;
  s(X) >= n__s(X) ;
  Marked_after(s(N),cons(X,XS)) >= Marked_after(N,activate(XS)) ;
 }
 + Disjunctions:{ 
{
  Marked_after(s(N),cons(X,XS)) > Marked_after(N,activate(XS)) ;
 }
 } 
=== 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: from(X) >= cons(X,n__from(n__s(X)))
constraint: from(X) >= n__from(X)
constraint: after(0,XS) >= XS
constraint: after(s(N),cons(X,XS)) >= after(N,activate(XS))
constraint: activate(n__from(X)) >= from(activate(X))
constraint: activate(n__s(X)) >= s(activate(X))
constraint: activate(X) >= X
constraint: s(X) >= n__s(X)
constraint: Marked_after(s(N),cons(X,XS)) >= Marked_after(N,activate(XS))
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  from(X) >= cons(X,n__from(n__s(X))) ;
  from(X) >= n__from(X) ;
  after(0,XS) >= XS ;
  after(s(N),cons(X,XS)) >= after(N,activate(XS)) ;
  activate(n__from(X)) >= from(activate(X)) ;
  activate(n__s(X)) >= s(activate(X)) ;
  activate(X) >= X ;
  s(X) >= n__s(X) ;
  Marked_activate(n__from(X)) >= Marked_activate(X) ;
  Marked_activate(n__s(X)) >= Marked_activate(X) ;
 }
 + Disjunctions:{ 
{
  Marked_activate(n__from(X)) > Marked_activate(X) ;
 }
{
  Marked_activate(n__s(X)) > Marked_activate(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
Sat solver result read
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
constraint: from(X) >= cons(X,n__from(n__s(X)))
constraint: from(X) >= n__from(X)
constraint: after(0,XS) >= XS
constraint: after(s(N),cons(X,XS)) >= after(N,activate(XS))
constraint: activate(n__from(X)) >= from(activate(X))
constraint: activate(n__s(X)) >= s(activate(X))
constraint: activate(X) >= X
constraint: s(X) >= n__s(X)
constraint: Marked_activate(n__from(X)) >= Marked_activate(X)
constraint: Marked_activate(n__s(X)) >= Marked_activate(X)
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_activate(n__s(X)) , Marked_activate(X)> 
      --> <Marked_activate(n__s(X)) , Marked_activate(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  from(X) >= cons(X,n__from(n__s(X))) ;
  from(X) >= n__from(X) ;
  after(0,XS) >= XS ;
  after(s(N),cons(X,XS)) >= after(N,activate(XS)) ;
  activate(n__from(X)) >= from(activate(X)) ;
  activate(n__s(X)) >= s(activate(X)) ;
  activate(X) >= X ;
  s(X) >= n__s(X) ;
  Marked_activate(n__s(X)) >= Marked_activate(X) ;
 }
 + Disjunctions:{ 
{
  Marked_activate(n__s(X)) > Marked_activate(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
Sat solver result read
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
constraint: from(X) >= cons(X,n__from(n__s(X)))
constraint: from(X) >= n__from(X)
constraint: after(0,XS) >= XS
constraint: after(s(N),cons(X,XS)) >= after(N,activate(XS))
constraint: activate(n__from(X)) >= from(activate(X))
constraint: activate(n__s(X)) >= s(activate(X))
constraint: activate(X) >= X
constraint: s(X) >= n__s(X)
constraint: Marked_activate(n__s(X)) >= Marked_activate(X)
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] from(X) -> cons(X,n__from(n__s(X)))
[2] after(0,XS) -> XS
[3] after(s(N),cons(X,XS)) -> after(N,activate(XS))
[4] from(X) -> n__from(X)
[5] s(X) -> n__s(X)
[6] activate(n__from(X)) -> from(activate(X))
[7] activate(n__s(X)) -> s(activate(X))
[8] activate(X) -> X
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_after(s(N),cons(X,XS)) , Marked_after(N,activate(XS))>
<Marked_after(s(N),cons(X,XS)) , Marked_activate(XS)>
<Marked_activate(n__from(X)) , Marked_from(activate(X))>
<Marked_activate(n__from(X)) , Marked_activate(X)>
<Marked_activate(n__s(X)) , Marked_s(activate(X))>
<Marked_activate(n__s(X)) , Marked_activate(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_after(s(N),cons(X,XS)) , Marked_after(N,activate(XS))>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ cons ] (X0,X1) = 1*X1 + 0; 
 [ after ] (X0,X1) = 2 + 2*X1 + 0; 
 [ n__s ] (X0) = 2 + 1*X0 + 0; 
 [ activate ] (X0) = 1*X0 + 0; 
 [ n__from ] (X0) = 0; 
 [ 0 ] () = 3 + 0; 
 [ from ] (X0) = 0; 
 [ Marked_after ] (X0,X1) = 1*X0 + 0; 
 [ s ] (X0) = 2 + 1*X0 + 0; 
 ]} 
{
 
DP termination of:
<Marked_activate(n__from(X)) , Marked_activate(X)>
<Marked_activate(n__s(X)) , Marked_activate(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ cons ] (X0,X1) = 1*X1; 
 [ Marked_activate ] (X0) = 3*X0; 
 [ after ] (X0,X1) = 1*X1 + 3; 
 [ n__s ] (X0) = 1*X0; 
 [ activate ] (X0) = 1*X0; 
 [ n__from ] (X0) = 1*X0 + 1; 
 [ 0 ] () = 3; 
 [ from ] (X0) = 1*X0 + 1; 
 [ s ] (X0) = 1*X0; 
 removing <Marked_activate(n__from(X)),Marked_activate(X)>
 [ {
      
     DP termination of:
     <Marked_activate(n__s(X)) , Marked_activate(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_activate(n__s(X)) , Marked_activate(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ cons ] (X0,X1) = 3*X1 + 0; 
 [ Marked_activate ] (X0) = 3*X0 + 0; 
 [ after ] (X0,X1) = 3 + 1*X1 + 0; 
 [ n__s ] (X0) = 1 + 3*X0 + 0; 
 [ activate ] (X0) = 2*X0 + 0; 
 [ n__from ] (X0) = 0; 
 [ 0 ] () = 3 + 0; 
 [ from ] (X0) = 0; 
 [ s ] (X0) = 2 + 3*X0 + 0; 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 

Cime worked for 0.093880 seconds (real time)
Cime Exit Status: 0