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

TRS termination of:
[1] fib(N) -> sel(N,fib1(s(0),s(0)))
[2] fib1(X,Y) -> cons(X,n__fib1(Y,add(X,Y)))
[3] add(0,X) -> X
[4] add(s(X),Y) -> s(add(X,Y))
[5] sel(0,cons(X,XS)) -> X
[6] sel(s(N),cons(X,XS)) -> sel(N,activate(XS))
[7] fib1(X1,X2) -> n__fib1(X1,X2)
[8] activate(n__fib1(X1,X2)) -> fib1(X1,X2)
[9] activate(X) -> X


Sub problem: 
guided: 

DP termination of:
<Marked_fib(N) , Marked_sel(N,fib1(s(0),s(0)))>
<Marked_fib(N) , Marked_fib1(s(0),s(0))>
<Marked_fib1(X,Y) , Marked_add(X,Y)>
<Marked_add(s(X),Y) , Marked_add(X,Y)>
<Marked_sel(s(N),cons(X,XS)) , Marked_sel(N,activate(XS))>
<Marked_sel(s(N),cons(X,XS)) , Marked_activate(XS)>
<Marked_activate(n__fib1(X1,X2)) , Marked_fib1(X1,X2)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 2 components:

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

{  <Marked_add(s(X),Y) , Marked_add(X,Y)> 
      --> <Marked_add(s(X),Y) , Marked_add(X,Y)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  sel(s(N),cons(X,XS)) >= sel(N,activate(XS)) ;
  sel(0,cons(X,XS)) >= X ;
  fib1(X,Y) >= cons(X,n__fib1(Y,add(X,Y))) ;
  fib1(X1,X2) >= n__fib1(X1,X2) ;
  fib(N) >= sel(N,fib1(s(0),s(0))) ;
  add(s(X),Y) >= s(add(X,Y)) ;
  add(0,X) >= X ;
  activate(n__fib1(X1,X2)) >= fib1(X1,X2) ;
  activate(X) >= X ;
  Marked_sel(s(N),cons(X,XS)) >= Marked_sel(N,activate(XS)) ;
 }
 + Disjunctions:{ 
{
  Marked_sel(s(N),cons(X,XS)) > Marked_sel(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
=== 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 ===
=== STOPING TIMER virtual ===
constraint: sel(s(N),cons(X,XS)) >= sel(N,activate(XS))
constraint: sel(0,cons(X,XS)) >= X
constraint: fib1(X,Y) >= cons(X,n__fib1(Y,add(X,Y)))
constraint: fib1(X1,X2) >= n__fib1(X1,X2)
constraint: fib(N) >= sel(N,fib1(s(0),s(0)))
constraint: add(s(X),Y) >= s(add(X,Y))
constraint: add(0,X) >= X
constraint: activate(n__fib1(X1,X2)) >= fib1(X1,X2)
constraint: activate(X) >= X
constraint: Marked_sel(s(N),cons(X,XS)) >= Marked_sel(N,activate(XS))
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  sel(s(N),cons(X,XS)) >= sel(N,activate(XS)) ;
  sel(0,cons(X,XS)) >= X ;
  fib1(X,Y) >= cons(X,n__fib1(Y,add(X,Y))) ;
  fib1(X1,X2) >= n__fib1(X1,X2) ;
  fib(N) >= sel(N,fib1(s(0),s(0))) ;
  add(s(X),Y) >= s(add(X,Y)) ;
  add(0,X) >= X ;
  activate(n__fib1(X1,X2)) >= fib1(X1,X2) ;
  activate(X) >= X ;
  Marked_add(s(X),Y) >= Marked_add(X,Y) ;
 }
 + Disjunctions:{ 
{
  Marked_add(s(X),Y) > Marked_add(X,Y) ;
 }
 } 
=== 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 ===
=== STOPING TIMER virtual ===
constraint: sel(s(N),cons(X,XS)) >= sel(N,activate(XS))
constraint: sel(0,cons(X,XS)) >= X
constraint: fib1(X,Y) >= cons(X,n__fib1(Y,add(X,Y)))
constraint: fib1(X1,X2) >= n__fib1(X1,X2)
constraint: fib(N) >= sel(N,fib1(s(0),s(0)))
constraint: add(s(X),Y) >= s(add(X,Y))
constraint: add(0,X) >= X
constraint: activate(n__fib1(X1,X2)) >= fib1(X1,X2)
constraint: activate(X) >= X
constraint: Marked_add(s(X),Y) >= Marked_add(X,Y)
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] fib(N) -> sel(N,fib1(s(0),s(0)))
[2] fib1(X,Y) -> cons(X,n__fib1(Y,add(X,Y)))
[3] add(0,X) -> X
[4] add(s(X),Y) -> s(add(X,Y))
[5] sel(0,cons(X,XS)) -> X
[6] sel(s(N),cons(X,XS)) -> sel(N,activate(XS))
[7] fib1(X1,X2) -> n__fib1(X1,X2)
[8] activate(n__fib1(X1,X2)) -> fib1(X1,X2)
[9] activate(X) -> X
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_fib(N) , Marked_sel(N,fib1(s(0),s(0)))>
<Marked_fib(N) , Marked_fib1(s(0),s(0))>
<Marked_fib1(X,Y) , Marked_add(X,Y)>
<Marked_add(s(X),Y) , Marked_add(X,Y)>
<Marked_sel(s(N),cons(X,XS)) , Marked_sel(N,activate(XS))>
<Marked_sel(s(N),cons(X,XS)) , Marked_activate(XS)>
<Marked_activate(n__fib1(X1,X2)) , Marked_fib1(X1,X2)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_sel(s(N),cons(X,XS)) , Marked_sel(N,activate(XS))>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     RPO with AFS = AFS: 
     and precedence:
     prec (All symbols are Lex.): { sel  >  fib1 ; sel  >  s ; sel  <  fib ;
                                   sel  >  cons ; sel  >  n__fib1 ;
                                   sel  >  add ; sel  >  activate ;
                                   fib1  <  sel ; fib1  >  s ; fib1  <  fib ;
                                   fib1  >  cons ; fib1  >  n__fib1 ;
                                   fib1  >  add ; fib1  <  activate ;
                                   fib1  <  Marked_sel ; s  <  sel ;
                                   s  <  fib1 ; s  <  fib ; s  <  add ;
                                   s  <  activate ; s  <  Marked_sel ;
                                   0  <  fib ; fib  >  sel ; fib  >  fib1 ;
                                   fib  >  s ; fib  >  0 ; fib  >  cons ;
                                   fib  >  n__fib1 ; fib  >  add ;
                                   fib  >  activate ; cons  <  sel ;
                                   cons  <  fib1 ; cons  <  fib ;
                                   cons  <  activate ; cons  <  Marked_sel ;
                                   n__fib1  <  sel ; n__fib1  <  fib1 ;
                                   n__fib1  <  fib ; n__fib1  <  activate ;
                                   n__fib1  <  Marked_sel ; add  <  sel ;
                                   add  <  fib1 ; add  >  s ; add  <  fib ;
                                   add  <  activate ; add  <  Marked_sel ;
                                   activate  <  sel ; activate  >  fib1 ;
                                   activate  >  s ; activate  <  fib ;
                                   activate  >  cons ; activate  >  n__fib1 ;
                                   activate  >  add ; activate  <  Marked_sel ;
                                   Marked_sel  >  fib1 ; Marked_sel  >  s ;
                                   Marked_sel  >  cons ;
                                   Marked_sel  >  n__fib1 ;
                                   Marked_sel  >  add ;
                                   Marked_sel  >  activate ; }

 ]} 
{
 
DP termination of:
<Marked_add(s(X),Y) , Marked_add(X,Y)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     RPO with AFS = AFS: 
     and precedence:
     prec (All symbols are Lex.): { sel  >  fib1 ; sel  >  s ; sel  <  fib ;
                                   sel  >  cons ; sel  >  n__fib1 ;
                                   sel  >  add ; sel  >  activate ;
                                   fib1  <  sel ; fib1  >  s ; fib1  <  fib ;
                                   fib1  >  cons ; fib1  >  n__fib1 ;
                                   fib1  >  add ; fib1  <  activate ;
                                   s  <  sel ; s  <  fib1 ; s  <  fib ;
                                   s  <  add ; s  <  activate ; 0  <  fib ;
                                   fib  >  sel ; fib  >  fib1 ; fib  >  s ;
                                   fib  >  0 ; fib  >  cons ; fib  >  n__fib1 ;
                                   fib  >  add ; fib  >  activate ;
                                   cons  <  sel ; cons  <  fib1 ;
                                   cons  <  fib ; cons  <  activate ;
                                   n__fib1  <  sel ; n__fib1  <  fib1 ;
                                   n__fib1  <  fib ; n__fib1  <  activate ;
                                   add  <  sel ; add  <  fib1 ; add  >  s ;
                                   add  <  fib ; add  <  activate ;
                                   activate  <  sel ; activate  >  fib1 ;
                                   activate  >  s ; activate  <  fib ;
                                   activate  >  cons ; activate  >  n__fib1 ;
                                   activate  >  add ; }

 ]} 
 ]} 
 ]} 

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