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

TRS termination of:
[1] +(x,+(y,z)) -> +(+(x,y),z)
[2]  *(x,+(y,z)) -> +( *(x,y), *(x,z))
[3] +(+(x, *(y,z)), *(y,u)) -> +(x, *(y,+(z,u)))


Sub problem: 
guided: 

DP termination of:
<Marked_+(x,+(y,z)) , Marked_+(+(x,y),z)>
<Marked_+(x,+(y,z)) , Marked_+(x,y)>
<Marked_*(x,+(y,z)) , Marked_+( *(x,y), *(x,z))>
<Marked_*(x,+(y,z)) , Marked_*(x,y)>
<Marked_*(x,+(y,z)) , Marked_*(x,z)>
<Marked_+(+(x, *(y,z)), *(y,u)) , Marked_+(x, *(y,+(z,u)))>
<Marked_+(+(x, *(y,z)), *(y,u)) , Marked_*(y,+(z,u))>
<Marked_+(+(x, *(y,z)), *(y,u)) , Marked_+(z,u)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_+(z,u)> 
      --> <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_+(z,u)>
  <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_+(z,u)> 
     --> <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_*(y,+(z,u))>
  <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_+(z,u)> 
     --> <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_+(x, *(y,+(z,u)))>
  <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_+(z,u)> 
     --> <Marked_+(x,+(y,z)) , Marked_+(x,y)>
  <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_+(z,u)> 
     --> <Marked_+(x,+(y,z)) , Marked_+(+(x,y),z)>
  <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_*(y,+(z,u))> 
     --> <Marked_*(x,+(y,z)) , Marked_*(x,z)>
  <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_*(y,+(z,u))> 
     --> <Marked_*(x,+(y,z)) , Marked_*(x,y)>
  <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_*(y,+(z,u))> 
     --> <Marked_*(x,+(y,z)) , Marked_+( *(x,y), *(x,z))>
  <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_+(x, *(y,+(z,u)))> 
     --> <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_+(z,u)>
  <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_+(x, *(y,+(z,u)))> 
     --> <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_*(y,+(z,u))>
  <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_+(x, *(y,+(z,u)))> 
     --> <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_+(x, *(y,+(z,u)))>
  <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_+(x, *(y,+(z,u)))> 
     --> <Marked_+(x,+(y,z)) , Marked_+(x,y)>
  <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_+(x, *(y,+(z,u)))> 
     --> <Marked_+(x,+(y,z)) , Marked_+(+(x,y),z)>
  <Marked_*(x,+(y,z)) , Marked_*(x,z)> --> <Marked_*(x,+(y,z)) , Marked_*(x,z)>
  <Marked_*(x,+(y,z)) , Marked_*(x,z)> --> <Marked_*(x,+(y,z)) , Marked_*(x,y)>
  <Marked_*(x,+(y,z)) , Marked_*(x,z)> 
     --> <Marked_*(x,+(y,z)) , Marked_+( *(x,y), *(x,z))>
  <Marked_*(x,+(y,z)) , Marked_*(x,y)> --> <Marked_*(x,+(y,z)) , Marked_*(x,z)>
  <Marked_*(x,+(y,z)) , Marked_*(x,y)> --> <Marked_*(x,+(y,z)) , Marked_*(x,y)>
  <Marked_*(x,+(y,z)) , Marked_*(x,y)> 
     --> <Marked_*(x,+(y,z)) , Marked_+( *(x,y), *(x,z))>
  <Marked_*(x,+(y,z)) , Marked_+( *(x,y), *(x,z))> 
     --> <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_+(z,u)>
  <Marked_*(x,+(y,z)) , Marked_+( *(x,y), *(x,z))> 
     --> <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_*(y,+(z,u))>
  <Marked_*(x,+(y,z)) , Marked_+( *(x,y), *(x,z))> 
     --> <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_+(x, *(y,+(z,u)))>
  <Marked_*(x,+(y,z)) , Marked_+( *(x,y), *(x,z))> 
     --> <Marked_+(x,+(y,z)) , Marked_+(x,y)>
  <Marked_*(x,+(y,z)) , Marked_+( *(x,y), *(x,z))> 
     --> <Marked_+(x,+(y,z)) , Marked_+(+(x,y),z)>
  <Marked_+(x,+(y,z)) , Marked_+(x,y)> 
     --> <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_+(z,u)>
  <Marked_+(x,+(y,z)) , Marked_+(x,y)> 
     --> <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_*(y,+(z,u))>
  <Marked_+(x,+(y,z)) , Marked_+(x,y)> 
     --> <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_+(x, *(y,+(z,u)))>
  <Marked_+(x,+(y,z)) , Marked_+(x,y)> --> <Marked_+(x,+(y,z)) , Marked_+(x,y)>
  <Marked_+(x,+(y,z)) , Marked_+(x,y)> 
     --> <Marked_+(x,+(y,z)) , Marked_+(+(x,y),z)>
  <Marked_+(x,+(y,z)) , Marked_+(+(x,y),z)> 
     --> <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_+(z,u)>
  <Marked_+(x,+(y,z)) , Marked_+(+(x,y),z)> 
     --> <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_*(y,+(z,u))>
  <Marked_+(x,+(y,z)) , Marked_+(+(x,y),z)> 
     --> <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_+(x, *(y,+(z,u)))>
  <Marked_+(x,+(y,z)) , Marked_+(+(x,y),z)> 
     --> <Marked_+(x,+(y,z)) , Marked_+(x,y)>
  <Marked_+(x,+(y,z)) , Marked_+(+(x,y),z)> 
     --> <Marked_+(x,+(y,z)) , Marked_+(+(x,y),z)>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  +(+(x, *(y,z)), *(y,u)) >= +(x, *(y,+(z,u))) ;
  +(x,+(y,z)) >= +(+(x,y),z) ;
   *(x,+(y,z)) >= +( *(x,y), *(x,z)) ;
  Marked_+(+(x, *(y,z)), *(y,u)) >= Marked_+(x, *(y,+(z,u))) ;
  Marked_+(+(x, *(y,z)), *(y,u)) >= Marked_+(z,u) ;
  Marked_+(+(x, *(y,z)), *(y,u)) >= Marked_*(y,+(z,u)) ;
  Marked_+(x,+(y,z)) >= Marked_+(+(x,y),z) ;
  Marked_+(x,+(y,z)) >= Marked_+(x,y) ;
  Marked_*(x,+(y,z)) >= Marked_+( *(x,y), *(x,z)) ;
  Marked_*(x,+(y,z)) >= Marked_*(x,y) ;
  Marked_*(x,+(y,z)) >= Marked_*(x,z) ;
 }
 + Disjunctions:{ 
{
  Marked_+(+(x, *(y,z)), *(y,u)) > Marked_+(x, *(y,+(z,u))) ;
 }
{
  Marked_+(+(x, *(y,z)), *(y,u)) > Marked_+(z,u) ;
 }
{
  Marked_+(+(x, *(y,z)), *(y,u)) > Marked_*(y,+(z,u)) ;
 }
{
  Marked_+(x,+(y,z)) > Marked_+(+(x,y),z) ;
 }
{
  Marked_+(x,+(y,z)) > Marked_+(x,y) ;
 }
{
  Marked_*(x,+(y,z)) > Marked_+( *(x,y), *(x,z)) ;
 }
{
  Marked_*(x,+(y,z)) > Marked_*(x,y) ;
 }
{
  Marked_*(x,+(y,z)) > Marked_*(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: +(+(x, *(y,z)), *(y,u)) >= +(x, *(y,+(z,u)))
constraint: +(x,+(y,z)) >= +(+(x,y),z)
constraint:  *(x,+(y,z)) >= +( *(x,y), *(x,z))
constraint: Marked_+(+(x, *(y,z)), *(y,u)) >= Marked_+(x, *(y,+(z,u)))
constraint: Marked_+(+(x, *(y,z)), *(y,u)) >= Marked_+(z,u)
constraint: Marked_+(+(x, *(y,z)), *(y,u)) >= Marked_*(y,+(z,u))
constraint: Marked_+(x,+(y,z)) >= Marked_+(+(x,y),z)
constraint: Marked_+(x,+(y,z)) >= Marked_+(x,y)
constraint: Marked_*(x,+(y,z)) >= Marked_+( *(x,y), *(x,z))
constraint: Marked_*(x,+(y,z)) >= Marked_*(x,y)
constraint: Marked_*(x,+(y,z)) >= Marked_*(x,z)
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_+(x, *(y,+(z,u)))> 
      --> <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_+(x, *(y,+(z,u)))>
  <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_+(x, *(y,+(z,u)))> 
     --> <Marked_+(x,+(y,z)) , Marked_+(+(x,y),z)>
  <Marked_+(x,+(y,z)) , Marked_+(+(x,y),z)> 
     --> <Marked_+(+(x, *(y,z)), *(y,u)) , Marked_+(x, *(y,+(z,u)))>
  <Marked_+(x,+(y,z)) , Marked_+(+(x,y),z)> 
     --> <Marked_+(x,+(y,z)) , Marked_+(+(x,y),z)>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  +(+(x, *(y,z)), *(y,u)) >= +(x, *(y,+(z,u))) ;
  +(x,+(y,z)) >= +(+(x,y),z) ;
   *(x,+(y,z)) >= +( *(x,y), *(x,z)) ;
  Marked_+(+(x, *(y,z)), *(y,u)) >= Marked_+(x, *(y,+(z,u))) ;
  Marked_+(x,+(y,z)) >= Marked_+(+(x,y),z) ;
 }
 + Disjunctions:{ 
{
  Marked_+(+(x, *(y,z)), *(y,u)) > Marked_+(x, *(y,+(z,u))) ;
 }
{
  Marked_+(x,+(y,z)) > Marked_+(+(x,y),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
=== 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 : 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 (Simple graph)
Found the following constraints:
{
  +(+(x, *(y,z)), *(y,u)) >= +(x, *(y,+(z,u))) ;
  +(x,+(y,z)) >= +(+(x,y),z) ;
   *(x,+(y,z)) >= +( *(x,y), *(x,z)) ;
  Marked_+(+(x, *(y,z)), *(y,u)) > Marked_+(x, *(y,+(z,u))) ;
  Marked_+(x,+(y,z)) > Marked_+(+(x,y),z) ;
 }

APPLY CRITERIA (SOLVE_ORD)
Trying to solve the following constraints:
{
  +(+(x, *(y,z)), *(y,u)) >= +(x, *(y,+(z,u))) ;
  +(x,+(y,z)) >= +(+(x,y),z) ;
   *(x,+(y,z)) >= +( *(x,y), *(x,z)) ;
  Marked_+(+(x, *(y,z)), *(y,u)) > Marked_+(x, *(y,+(z,u))) ;
  Marked_+(x,+(y,z)) > Marked_+(+(x,y),z) ;
 }
 + Disjunctions:{ 
 } 
=== 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 ===
No solution found for these parameters.(18 bt (16) [8])
=== 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 2.688144 seconds (real time)
Cime Exit Status: 0