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

TRS termination of:
[1] and(x,or(y,z)) -> or(and(x,y),and(x,z))
[2] and(x,and(y,y)) -> and(x,y)
[3] or(or(x,y),and(y,z)) -> or(x,y)
[4] or(x,and(x,y)) -> x
[5] or(true,y) -> true
[6] or(x,false) -> x
[7] or(x,x) -> x
[8] or(x,or(y,y)) -> or(x,y)
[9] and(x,true) -> x
[10] and(false,y) -> false
[11] and(x,x) -> x


Sub problem: 
guided: 

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

{  <Marked_and(x,and(y,y)) , Marked_and(x,y)> 
      --> <Marked_and(x,and(y,y)) , Marked_and(x,y)>
  <Marked_and(x,and(y,y)) , Marked_and(x,y)> 
     --> <Marked_and(x,or(y,z)) , Marked_and(x,z)>
  <Marked_and(x,and(y,y)) , 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,and(y,y)) , 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(x,and(y,y)) , 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)>
}

{  <Marked_or(x,or(y,y)) , Marked_or(x,y)> 
      --> <Marked_or(x,or(y,y)) , Marked_or(x,y)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  or(or(x,y),and(y,z)) >= or(x,y) ;
  or(true,y) >= true ;
  or(x,or(y,y)) >= or(x,y) ;
  or(x,and(x,y)) >= x ;
  or(x,false) >= x ;
  or(x,x) >= x ;
  and(false,y) >= false ;
  and(x,or(y,z)) >= or(and(x,y),and(x,z)) ;
  and(x,and(y,y)) >= and(x,y) ;
  and(x,true) >= x ;
  and(x,x) >= x ;
  Marked_and(x,or(y,z)) >= Marked_and(x,y) ;
  Marked_and(x,or(y,z)) >= Marked_and(x,z) ;
  Marked_and(x,and(y,y)) >= Marked_and(x,y) ;
 }
 + Disjunctions:{ 
{
  Marked_and(x,or(y,z)) > Marked_and(x,y) ;
 }
{
  Marked_and(x,or(y,z)) > Marked_and(x,z) ;
 }
{
  Marked_and(x,and(y,y)) > Marked_and(x,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 ===
=== STOPING TIMER virtual ===
constraint: or(or(x,y),and(y,z)) >= or(x,y)
constraint: or(true,y) >= true
constraint: or(x,or(y,y)) >= or(x,y)
constraint: or(x,and(x,y)) >= x
constraint: or(x,false) >= x
constraint: or(x,x) >= x
constraint: and(false,y) >= false
constraint: and(x,or(y,z)) >= or(and(x,y),and(x,z))
constraint: and(x,and(y,y)) >= and(x,y)
constraint: and(x,true) >= x
constraint: and(x,x) >= x
constraint: Marked_and(x,or(y,z)) >= Marked_and(x,y)
constraint: Marked_and(x,or(y,z)) >= Marked_and(x,z)
constraint: Marked_and(x,and(y,y)) >= Marked_and(x,y)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  or(or(x,y),and(y,z)) >= or(x,y) ;
  or(true,y) >= true ;
  or(x,or(y,y)) >= or(x,y) ;
  or(x,and(x,y)) >= x ;
  or(x,false) >= x ;
  or(x,x) >= x ;
  and(false,y) >= false ;
  and(x,or(y,z)) >= or(and(x,y),and(x,z)) ;
  and(x,and(y,y)) >= and(x,y) ;
  and(x,true) >= x ;
  and(x,x) >= x ;
  Marked_or(x,or(y,y)) >= Marked_or(x,y) ;
 }
 + Disjunctions:{ 
{
  Marked_or(x,or(y,y)) > Marked_or(x,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(or(x,y),and(y,z)) >= or(x,y)
constraint: or(true,y) >= true
constraint: or(x,or(y,y)) >= or(x,y)
constraint: or(x,and(x,y)) >= x
constraint: or(x,false) >= x
constraint: or(x,x) >= x
constraint: and(false,y) >= false
constraint: and(x,or(y,z)) >= or(and(x,y),and(x,z))
constraint: and(x,and(y,y)) >= and(x,y)
constraint: and(x,true) >= x
constraint: and(x,x) >= x
constraint: Marked_or(x,or(y,y)) >= Marked_or(x,y)
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] and(x,or(y,z)) -> or(and(x,y),and(x,z))
[2] and(x,and(y,y)) -> and(x,y)
[3] or(or(x,y),and(y,z)) -> or(x,y)
[4] or(x,and(x,y)) -> x
[5] or(true,y) -> true
[6] or(x,false) -> x
[7] or(x,x) -> x
[8] or(x,or(y,y)) -> or(x,y)
[9] and(x,true) -> x
[10] and(false,y) -> false
[11] and(x,x) -> x
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_and(x,or(y,z)) , Marked_or(and(x,y),and(x,z))>
<Marked_and(x,or(y,z)) , Marked_and(x,y)>
<Marked_and(x,or(y,z)) , Marked_and(x,z)>
<Marked_and(x,and(y,y)) , Marked_and(x,y)>
<Marked_or(x,or(y,y)) , Marked_or(x,y)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_and(x,or(y,z)) , Marked_and(x,y)>
<Marked_and(x,or(y,z)) , Marked_and(x,z)>
<Marked_and(x,and(y,y)) , Marked_and(x,y)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     RPO with AFS = AFS: 
     and precedence:
     prec (All symbols are Lex.): { or  <  and ; and  >  or ; }

 ]} 
{
 
DP termination of:
<Marked_or(x,or(y,y)) , Marked_or(x,y)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ or ] (X0,X1) = 2 + 1*X0 + 0; 
 [ true ] () = 0; 
 [ and ] (X0,X1) = 1*X0 + 2*X1 + 0; 
 [ Marked_or ] (X0,X1) = 1*X1 + 0; 
 [ false ] () = 0; 
 ]} 
 ]} 
 ]} 

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