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

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


Sub problem: 
guided: 

DP termination of:
<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)>
<Marked_not(and(x,y)) , Marked_not(x)>
<Marked_not(and(x,y)) , Marked_not(y)>
<Marked_and(x,or(y,z)) , Marked_and(x,y)>
<Marked_and(x,or(y,z)) , Marked_and(x,z)>
<Marked_and(or(y,z),x) , Marked_and(x,y)>
<Marked_and(or(y,z),x) , Marked_and(x,z)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 2 components:

{  <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(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(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)>
  <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(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(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(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(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_and(or(y,z),x) , Marked_and(x,z)> 
      --> <Marked_and(or(y,z),x) , Marked_and(x,z)>
  <Marked_and(or(y,z),x) , Marked_and(x,z)> 
     --> <Marked_and(or(y,z),x) , Marked_and(x,y)>
  <Marked_and(or(y,z),x) , Marked_and(x,z)> 
     --> <Marked_and(x,or(y,z)) , Marked_and(x,z)>
  <Marked_and(or(y,z),x) , Marked_and(x,z)> 
     --> <Marked_and(x,or(y,z)) , Marked_and(x,y)>
  <Marked_and(or(y,z),x) , Marked_and(x,y)> 
     --> <Marked_and(or(y,z),x) , Marked_and(x,z)>
  <Marked_and(or(y,z),x) , Marked_and(x,y)> 
     --> <Marked_and(or(y,z),x) , Marked_and(x,y)>
  <Marked_and(or(y,z),x) , Marked_and(x,y)> 
     --> <Marked_and(x,or(y,z)) , Marked_and(x,z)>
  <Marked_and(or(y,z),x) , Marked_and(x,y)> 
     --> <Marked_and(x,or(y,z)) , Marked_and(x,y)>
  <Marked_and(x,or(y,z)) , Marked_and(x,z)> 
     --> <Marked_and(or(y,z),x) , Marked_and(x,z)>
  <Marked_and(x,or(y,z)) , Marked_and(x,z)> 
     --> <Marked_and(or(y,z),x) , Marked_and(x,y)>
  <Marked_and(x,or(y,z)) , Marked_and(x,z)> 
     --> <Marked_and(x,or(y,z)) , Marked_and(x,z)>
  <Marked_and(x,or(y,z)) , Marked_and(x,z)> 
     --> <Marked_and(x,or(y,z)) , Marked_and(x,y)>
  <Marked_and(x,or(y,z)) , Marked_and(x,y)> 
     --> <Marked_and(or(y,z),x) , Marked_and(x,z)>
  <Marked_and(x,or(y,z)) , Marked_and(x,y)> 
     --> <Marked_and(or(y,z),x) , Marked_and(x,y)>
  <Marked_and(x,or(y,z)) , Marked_and(x,y)> 
     --> <Marked_and(x,or(y,z)) , Marked_and(x,z)>
  <Marked_and(x,or(y,z)) , Marked_and(x,y)> 
     --> <Marked_and(x,or(y,z)) , Marked_and(x,y)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  not(not(x)) >= x ;
  not(and(x,y)) >= or(not(x),not(y)) ;
  not(or(x,y)) >= and(not(x),not(y)) ;
  and(or(y,z),x) >= or(and(x,y),and(x,z)) ;
  and(x,or(y,z)) >= or(and(x,y),and(x,z)) ;
  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) ;
 }
 + Disjunctions:{ 
{
  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) ;
 }
 } 
=== 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 : 25.000000 ===
Search parameters: AFS type: 2 ; time limit: 25.. 
=== STOPING TIMER virtual ===
=== TIMER virtual : 25.000000 ===
Search parameters: AFS type: 2 ; time limit: 25.. 
=== STOPING TIMER virtual ===
=== 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
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
No solution found for these parameters.
No solution found for these constraints.
APPLY CRITERIA (ID_CRIT)
NOT SOLVED
No proof found
Cime worked for 0.334693 seconds (real time)
Cime Exit Status: 0