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

TRS termination of:
[1] div(X,e) -> i(X)
[2] i(div(X,Y)) -> div(Y,X)
[3] div(div(X,Y),Z) -> div(Y,div(i(X),Z))


Sub problem: 
guided: 

DP termination of:
<Marked_div(X,e) , Marked_i(X)>
<Marked_i(div(X,Y)) , Marked_div(Y,X)>
<Marked_div(div(X,Y),Z) , Marked_div(Y,div(i(X),Z))>
<Marked_div(div(X,Y),Z) , Marked_div(i(X),Z)>
<Marked_div(div(X,Y),Z) , Marked_i(X)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_div(div(X,Y),Z) , Marked_i(X)> 
      --> <Marked_i(div(X,Y)) , Marked_div(Y,X)>
  <Marked_div(div(X,Y),Z) , Marked_div(i(X),Z)> 
     --> <Marked_div(div(X,Y),Z) , Marked_i(X)>
  <Marked_div(div(X,Y),Z) , Marked_div(i(X),Z)> 
     --> <Marked_div(div(X,Y),Z) , Marked_div(i(X),Z)>
  <Marked_div(div(X,Y),Z) , Marked_div(i(X),Z)> 
     --> <Marked_div(div(X,Y),Z) , Marked_div(Y,div(i(X),Z))>
  <Marked_div(div(X,Y),Z) , Marked_div(i(X),Z)> 
     --> <Marked_div(X,e) , Marked_i(X)>
  <Marked_div(div(X,Y),Z) , Marked_div(Y,div(i(X),Z))> 
     --> <Marked_div(div(X,Y),Z) , Marked_i(X)>
  <Marked_div(div(X,Y),Z) , Marked_div(Y,div(i(X),Z))> 
     --> <Marked_div(div(X,Y),Z) , Marked_div(i(X),Z)>
  <Marked_div(div(X,Y),Z) , Marked_div(Y,div(i(X),Z))> 
     --> <Marked_div(div(X,Y),Z) , Marked_div(Y,div(i(X),Z))>
  <Marked_div(div(X,Y),Z) , Marked_div(Y,div(i(X),Z))> 
     --> <Marked_div(X,e) , Marked_i(X)>
  <Marked_i(div(X,Y)) , Marked_div(Y,X)> 
     --> <Marked_div(div(X,Y),Z) , Marked_i(X)>
  <Marked_i(div(X,Y)) , Marked_div(Y,X)> 
     --> <Marked_div(div(X,Y),Z) , Marked_div(i(X),Z)>
  <Marked_i(div(X,Y)) , Marked_div(Y,X)> 
     --> <Marked_div(div(X,Y),Z) , Marked_div(Y,div(i(X),Z))>
  <Marked_i(div(X,Y)) , Marked_div(Y,X)> --> <Marked_div(X,e) , Marked_i(X)>
  <Marked_div(X,e) , Marked_i(X)> --> <Marked_i(div(X,Y)) , Marked_div(Y,X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  i(div(X,Y)) >= div(Y,X) ;
  div(div(X,Y),Z) >= div(Y,div(i(X),Z)) ;
  div(X,e) >= i(X) ;
  Marked_div(div(X,Y),Z) >= Marked_div(i(X),Z) ;
  Marked_div(div(X,Y),Z) >= Marked_div(Y,div(i(X),Z)) ;
  Marked_div(div(X,Y),Z) >= Marked_i(X) ;
  Marked_div(X,e) >= Marked_i(X) ;
  Marked_i(div(X,Y)) >= Marked_div(Y,X) ;
 }
 + Disjunctions:{ 
{
  Marked_div(div(X,Y),Z) > Marked_div(i(X),Z) ;
 }
{
  Marked_div(div(X,Y),Z) > Marked_div(Y,div(i(X),Z)) ;
 }
{
  Marked_div(div(X,Y),Z) > Marked_i(X) ;
 }
{
  Marked_div(X,e) > Marked_i(X) ;
 }
{
  Marked_i(div(X,Y)) > Marked_div(Y,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: i(div(X,Y)) >= div(Y,X)
constraint: div(div(X,Y),Z) >= div(Y,div(i(X),Z))
constraint: div(X,e) >= i(X)
constraint: Marked_div(div(X,Y),Z) >= Marked_div(i(X),Z)
constraint: Marked_div(div(X,Y),Z) >= Marked_div(Y,div(i(X),Z))
constraint: Marked_div(div(X,Y),Z) >= Marked_i(X)
constraint: Marked_div(X,e) >= Marked_i(X)
constraint: Marked_i(div(X,Y)) >= Marked_div(Y,X)
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_div(div(X,Y),Z) , Marked_div(Y,div(i(X),Z))> 
      --> <Marked_div(div(X,Y),Z) , Marked_div(Y,div(i(X),Z))>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  i(div(X,Y)) >= div(Y,X) ;
  div(div(X,Y),Z) >= div(Y,div(i(X),Z)) ;
  div(X,e) >= i(X) ;
  Marked_div(div(X,Y),Z) >= Marked_div(Y,div(i(X),Z)) ;
 }
 + Disjunctions:{ 
{
  Marked_div(div(X,Y),Z) > Marked_div(Y,div(i(X),Z)) ;
 }
 } 
=== 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: i(div(X,Y)) >= div(Y,X)
constraint: div(div(X,Y),Z) >= div(Y,div(i(X),Z))
constraint: div(X,e) >= i(X)
constraint: Marked_div(div(X,Y),Z) >= Marked_div(Y,div(i(X),Z))
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] div(X,e) -> i(X)
[2] i(div(X,Y)) -> div(Y,X)
[3] div(div(X,Y),Z) -> div(Y,div(i(X),Z))
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_div(X,e) , Marked_i(X)>
<Marked_i(div(X,Y)) , Marked_div(Y,X)>
<Marked_div(div(X,Y),Z) , Marked_div(Y,div(i(X),Z))>
<Marked_div(div(X,Y),Z) , Marked_div(i(X),Z)>
<Marked_div(div(X,Y),Z) , Marked_i(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_div(X,e) , Marked_i(X)>
<Marked_i(div(X,Y)) , Marked_div(Y,X)>
<Marked_div(div(X,Y),Z) , Marked_div(Y,div(i(X),Z))>
<Marked_div(div(X,Y),Z) , Marked_div(i(X),Z)>
<Marked_div(div(X,Y),Z) , Marked_i(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ i ] (X0) = 2*X0 + 1; 
 [ Marked_i ] (X0) = 2*X0; 
 [ e ] () = 0; 
 [ div ] (X0,X1) = 1*X1 + 2*X0 + 2; 
 [ Marked_div ] (X0,X1) = 1*X1 + 2*X0 + 2; 
 removing <Marked_div(X,e),Marked_i(X)><Marked_i(div(X,Y)),Marked_div(Y,X)><
Marked_div(div(X,Y),Z),Marked_div(i(X),Z)><Marked_div(div(X,Y),Z),Marked_i(X)>
 [ {
      
     DP termination of:
     <Marked_div(div(X,Y),Z) , Marked_div(Y,div(i(X),Z))>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_div(div(X,Y),Z) , Marked_div(Y,div(i(X),Z))>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ i ] (X0) = 1*X0 + 0; 
 [ e ] () = 3 + 0; 
 [ div ] (X0,X1) = 1 + 1*X0 + 1*X1 + 0; 
 [ Marked_div ] (X0,X1) = 2*X0 + 1*X1 + 0; 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 

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