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

TRS termination of:
[1] or(x,x) -> x
[2] and(x,x) -> x
[3] not(not(x)) -> x
[4] not(and(x,y)) -> or(not(x),not(y))
[5] not(or(x,y)) -> and(not(x),not(y))


Sub problem: 
guided: 

DP termination of:
<Marked_not(and(x,y)) , Marked_or(not(x),not(y))>
<Marked_not(and(x,y)) , Marked_not(x)>
<Marked_not(and(x,y)) , Marked_not(y)>
<Marked_not(or(x,y)) , Marked_and(not(x),not(y))>
<Marked_not(or(x,y)) , Marked_not(x)>
<Marked_not(or(x,y)) , Marked_not(y)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_not(or(x,y)) , Marked_not(y)> 
      --> <Marked_not(or(x,y)) , Marked_not(y)>
  <Marked_not(or(x,y)) , Marked_not(y)> 
     --> <Marked_not(or(x,y)) , Marked_not(x)>
  <Marked_not(or(x,y)) , Marked_not(y)> 
     --> <Marked_not(and(x,y)) , Marked_not(y)>
  <Marked_not(or(x,y)) , Marked_not(y)> 
     --> <Marked_not(and(x,y)) , Marked_not(x)>
  <Marked_not(or(x,y)) , Marked_not(x)> 
     --> <Marked_not(or(x,y)) , Marked_not(y)>
  <Marked_not(or(x,y)) , Marked_not(x)> 
     --> <Marked_not(or(x,y)) , Marked_not(x)>
  <Marked_not(or(x,y)) , Marked_not(x)> 
     --> <Marked_not(and(x,y)) , Marked_not(y)>
  <Marked_not(or(x,y)) , Marked_not(x)> 
     --> <Marked_not(and(x,y)) , Marked_not(x)>
  <Marked_not(and(x,y)) , Marked_not(y)> 
     --> <Marked_not(or(x,y)) , Marked_not(y)>
  <Marked_not(and(x,y)) , Marked_not(y)> 
     --> <Marked_not(or(x,y)) , Marked_not(x)>
  <Marked_not(and(x,y)) , Marked_not(y)> 
     --> <Marked_not(and(x,y)) , Marked_not(y)>
  <Marked_not(and(x,y)) , Marked_not(y)> 
     --> <Marked_not(and(x,y)) , Marked_not(x)>
  <Marked_not(and(x,y)) , Marked_not(x)> 
     --> <Marked_not(or(x,y)) , Marked_not(y)>
  <Marked_not(and(x,y)) , Marked_not(x)> 
     --> <Marked_not(or(x,y)) , Marked_not(x)>
  <Marked_not(and(x,y)) , Marked_not(x)> 
     --> <Marked_not(and(x,y)) , Marked_not(y)>
  <Marked_not(and(x,y)) , Marked_not(x)> 
     --> <Marked_not(and(x,y)) , Marked_not(x)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  or(x,x) >= x ;
  and(x,x) >= x ;
  not(or(x,y)) >= and(not(x),not(y)) ;
  not(and(x,y)) >= or(not(x),not(y)) ;
  not(not(x)) >= x ;
  Marked_not(or(x,y)) >= Marked_not(x) ;
  Marked_not(or(x,y)) >= Marked_not(y) ;
  Marked_not(and(x,y)) >= Marked_not(x) ;
  Marked_not(and(x,y)) >= Marked_not(y) ;
 }
 + Disjunctions:{ 
{
  Marked_not(or(x,y)) > Marked_not(x) ;
 }
{
  Marked_not(or(x,y)) > Marked_not(y) ;
 }
{
  Marked_not(and(x,y)) > Marked_not(x) ;
 }
{
  Marked_not(and(x,y)) > Marked_not(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
Sat solver result read
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
constraint: or(x,x) >= x
constraint: and(x,x) >= x
constraint: not(or(x,y)) >= and(not(x),not(y))
constraint: not(and(x,y)) >= or(not(x),not(y))
constraint: not(not(x)) >= x
constraint: Marked_not(or(x,y)) >= Marked_not(x)
constraint: Marked_not(or(x,y)) >= Marked_not(y)
constraint: Marked_not(and(x,y)) >= Marked_not(x)
constraint: Marked_not(and(x,y)) >= Marked_not(y)
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] or(x,x) -> x
[2] and(x,x) -> x
[3] not(not(x)) -> x
[4] not(and(x,y)) -> or(not(x),not(y))
[5] not(or(x,y)) -> and(not(x),not(y))
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_not(and(x,y)) , Marked_or(not(x),not(y))>
<Marked_not(and(x,y)) , Marked_not(x)>
<Marked_not(and(x,y)) , Marked_not(y)>
<Marked_not(or(x,y)) , Marked_and(not(x),not(y))>
<Marked_not(or(x,y)) , Marked_not(x)>
<Marked_not(or(x,y)) , Marked_not(y)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_not(and(x,y)) , Marked_not(x)>
<Marked_not(and(x,y)) , Marked_not(y)>
<Marked_not(or(x,y)) , Marked_not(x)>
<Marked_not(or(x,y)) , Marked_not(y)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ or ] (X0,X1) = 1 + 1*X0 + 2*X1 + 0; 
 [ not ] (X0) = 3*X0 + 0; 
 [ and ] (X0,X1) = 2 + 1*X0 + 2*X1 + 0; 
 [ Marked_not ] (X0) = 3*X0 + 0; 
 ]} 
 ]} 
 ]} 

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