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

TRS termination of:
[1] f(f(a,x),a) -> f(f(x,f(a,f(a,a))),a)


Sub problem: 
guided: 

DP termination of:
<Marked_f(f(a,x),a) , Marked_f(f(x,f(a,f(a,a))),a)>
<Marked_f(f(a,x),a) , Marked_f(x,f(a,f(a,a)))>
<Marked_f(f(a,x),a) , Marked_f(a,f(a,a))>
<Marked_f(f(a,x),a) , Marked_f(a,a)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_f(f(a,x),a) , Marked_f(x,f(a,f(a,a)))> 
      --> <Marked_f(f(a,x),a) , Marked_f(x,f(a,f(a,a)))>
  <Marked_f(f(a,x),a) , Marked_f(x,f(a,f(a,a)))> 
     --> <Marked_f(f(a,x),a) , Marked_f(f(x,f(a,f(a,a))),a)>
  <Marked_f(f(a,x),a) , Marked_f(f(x,f(a,f(a,a))),a)> 
     --> <Marked_f(f(a,x),a) , Marked_f(x,f(a,f(a,a)))>
  <Marked_f(f(a,x),a) , Marked_f(f(x,f(a,f(a,a))),a)> 
     --> <Marked_f(f(a,x),a) , Marked_f(f(x,f(a,f(a,a))),a)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  f(f(a,x),a) >= f(f(x,f(a,f(a,a))),a) ;
  Marked_f(f(a,x),a) >= Marked_f(f(x,f(a,f(a,a))),a) ;
  Marked_f(f(a,x),a) >= Marked_f(x,f(a,f(a,a))) ;
 }
 + Disjunctions:{ 
{
  Marked_f(f(a,x),a) > Marked_f(f(x,f(a,f(a,a))),a) ;
 }
{
  Marked_f(f(a,x),a) > Marked_f(x,f(a,f(a,a))) ;
 }
 } 
=== 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: f(f(a,x),a) >= f(f(x,f(a,f(a,a))),a)
constraint: Marked_f(f(a,x),a) >= Marked_f(f(x,f(a,f(a,a))),a)
constraint: Marked_f(f(a,x),a) >= Marked_f(x,f(a,f(a,a)))
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_f(f(a,x),a) , Marked_f(f(x,f(a,f(a,a))),a)> 
      --> <Marked_f(f(a,x),a) , Marked_f(f(x,f(a,f(a,a))),a)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  f(f(a,x),a) >= f(f(x,f(a,f(a,a))),a) ;
  Marked_f(f(a,x),a) >= Marked_f(f(x,f(a,f(a,a))),a) ;
 }
 + Disjunctions:{ 
{
  Marked_f(f(a,x),a) > Marked_f(f(x,f(a,f(a,a))),a) ;
 }
 } 
=== 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
Sat solver result read
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
constraint: f(f(a,x),a) >= f(f(x,f(a,f(a,a))),a)
constraint: Marked_f(f(a,x),a) >= Marked_f(f(x,f(a,f(a,a))),a)
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] f(f(a,x),a) -> f(f(x,f(a,f(a,a))),a)
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_f(f(a,x),a) , Marked_f(f(x,f(a,f(a,a))),a)>
<Marked_f(f(a,x),a) , Marked_f(x,f(a,f(a,a)))>
<Marked_f(f(a,x),a) , Marked_f(a,f(a,a))>
<Marked_f(f(a,x),a) , Marked_f(a,a)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_f(f(a,x),a) , Marked_f(f(x,f(a,f(a,a))),a)>
<Marked_f(f(a,x),a) , Marked_f(x,f(a,f(a,a)))>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ f ] (X0,X1) = 0; 
 [ Marked_f ] (X0,X1) = 1*X1; 
 [ a ] () = 2; 
 removing <Marked_f(f(a,x),a),Marked_f(x,f(a,f(a,a)))>
 [ {
      
     DP termination of:
     <Marked_f(f(a,x),a) , Marked_f(f(x,f(a,f(a,a))),a)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_f(f(a,x),a) , Marked_f(f(x,f(a,f(a,a))),a)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     Matrix polynomial interpretation (strict sub matrices size: 1x1) = 
      [ f ] (X0,X1) = [ [ 0 , 1 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X1 + 
     [ [ 0 , 1 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ Marked_f ] (X0,X1) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X1 + 
[ [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ a ] () = [ [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 

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