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

TRS termination of:
[1] xor(x,F) -> x
[2] xor(x,neg(x)) -> F
[3] and(x,T) -> x
[4] and(x,F) -> F
[5] and(x,x) -> x
[6] and(xor(x,y),z) -> xor(and(x,z),and(y,z))
[7] xor(x,x) -> F
[8] impl(x,y) -> xor(and(x,y),xor(x,T))
[9] or(x,y) -> xor(and(x,y),xor(x,y))
[10] equiv(x,y) -> xor(x,xor(y,T))
[11] neg(x) -> xor(x,T)


Sub problem: 
guided: 

DP termination of:
<Marked_and(xor(x,y),z) , Marked_xor(and(x,z),and(y,z))>
<Marked_and(xor(x,y),z) , Marked_and(x,z)>
<Marked_and(xor(x,y),z) , Marked_and(y,z)>
<Marked_impl(x,y) , Marked_xor(and(x,y),xor(x,T))>
<Marked_impl(x,y) , Marked_and(x,y)>
<Marked_impl(x,y) , Marked_xor(x,T)>
<Marked_or(x,y) , Marked_xor(and(x,y),xor(x,y))>
<Marked_or(x,y) , Marked_and(x,y)>
<Marked_or(x,y) , Marked_xor(x,y)>
<Marked_equiv(x,y) , Marked_xor(x,xor(y,T))>
<Marked_equiv(x,y) , Marked_xor(y,T)>
<Marked_neg(x) , Marked_xor(x,T)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_and(xor(x,y),z) , Marked_and(y,z)> 
      --> <Marked_and(xor(x,y),z) , Marked_and(y,z)>
  <Marked_and(xor(x,y),z) , Marked_and(y,z)> 
     --> <Marked_and(xor(x,y),z) , Marked_and(x,z)>
  <Marked_and(xor(x,y),z) , Marked_and(x,z)> 
     --> <Marked_and(xor(x,y),z) , Marked_and(y,z)>
  <Marked_and(xor(x,y),z) , Marked_and(x,z)> 
     --> <Marked_and(xor(x,y),z) , Marked_and(x,z)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  xor(x,F) >= x ;
  xor(x,neg(x)) >= F ;
  xor(x,x) >= F ;
  neg(x) >= xor(x,T) ;
  and(xor(x,y),z) >= xor(and(x,z),and(y,z)) ;
  and(x,F) >= F ;
  and(x,T) >= x ;
  and(x,x) >= x ;
  impl(x,y) >= xor(and(x,y),xor(x,T)) ;
  or(x,y) >= xor(and(x,y),xor(x,y)) ;
  equiv(x,y) >= xor(x,xor(y,T)) ;
  Marked_and(xor(x,y),z) >= Marked_and(y,z) ;
  Marked_and(xor(x,y),z) >= Marked_and(x,z) ;
 }
 + Disjunctions:{ 
{
  Marked_and(xor(x,y),z) > Marked_and(y,z) ;
 }
{
  Marked_and(xor(x,y),z) > Marked_and(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: xor(x,F) >= x
constraint: xor(x,neg(x)) >= F
constraint: xor(x,x) >= F
constraint: neg(x) >= xor(x,T)
constraint: and(xor(x,y),z) >= xor(and(x,z),and(y,z))
constraint: and(x,F) >= F
constraint: and(x,T) >= x
constraint: and(x,x) >= x
constraint: impl(x,y) >= xor(and(x,y),xor(x,T))
constraint: or(x,y) >= xor(and(x,y),xor(x,y))
constraint: equiv(x,y) >= xor(x,xor(y,T))
constraint: Marked_and(xor(x,y),z) >= Marked_and(y,z)
constraint: Marked_and(xor(x,y),z) >= Marked_and(x,z)
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] xor(x,F) -> x
[2] xor(x,neg(x)) -> F
[3] and(x,T) -> x
[4] and(x,F) -> F
[5] and(x,x) -> x
[6] and(xor(x,y),z) -> xor(and(x,z),and(y,z))
[7] xor(x,x) -> F
[8] impl(x,y) -> xor(and(x,y),xor(x,T))
[9] or(x,y) -> xor(and(x,y),xor(x,y))
[10] equiv(x,y) -> xor(x,xor(y,T))
[11] neg(x) -> xor(x,T)
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_and(xor(x,y),z) , Marked_xor(and(x,z),and(y,z))>
<Marked_and(xor(x,y),z) , Marked_and(x,z)>
<Marked_and(xor(x,y),z) , Marked_and(y,z)>
<Marked_impl(x,y) , Marked_xor(and(x,y),xor(x,T))>
<Marked_impl(x,y) , Marked_and(x,y)>
<Marked_impl(x,y) , Marked_xor(x,T)>
<Marked_or(x,y) , Marked_xor(and(x,y),xor(x,y))>
<Marked_or(x,y) , Marked_and(x,y)>
<Marked_or(x,y) , Marked_xor(x,y)>
<Marked_equiv(x,y) , Marked_xor(x,xor(y,T))>
<Marked_equiv(x,y) , Marked_xor(y,T)>
<Marked_neg(x) , Marked_xor(x,T)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_and(xor(x,y),z) , Marked_and(x,z)>
<Marked_and(xor(x,y),z) , Marked_and(y,z)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ xor ] (X0,X1) = 1 + 1*X0 + 1*X1 + 0; 
 [ T ] () = 0; 
 [ Marked_and ] (X0,X1) = 3*X0 + 0; 
 [ neg ] (X0) = 3 + 1*X0 + 0; 
 [ or ] (X0,X1) = 3 + 3*X0 + 3*X1 + 0; 
 [ F ] () = 0; 
 [ impl ] (X0,X1) = 3 + 3*X0 + 1*X1 + 0; 
 [ and ] (X0,X1) = 1*X0 + 0; 
 [ equiv ] (X0,X1) = 3 + 1*X0 + 1*X1 + 0; 
 ]} 
 ]} 
 ]} 

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