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

TRS termination of:
[1] +(0,y) -> y
[2] +(s(x),y) -> s(+(x,y))
[3] +(p(x),y) -> p(+(x,y))
[4] minus(0) -> 0
[5] minus(s(x)) -> p(minus(x))
[6] minus(p(x)) -> s(minus(x))
[7]  *(0,y) -> 0
[8]  *(s(x),y) -> +( *(x,y),y)
[9]  *(p(x),y) -> +( *(x,y),minus(y))


Sub problem: 
guided: 

DP termination of:
<Marked_+(s(x),y) , Marked_+(x,y)>
<Marked_+(p(x),y) , Marked_+(x,y)>
<Marked_minus(s(x)) , Marked_minus(x)>
<Marked_minus(p(x)) , Marked_minus(x)>
<Marked_*(s(x),y) , Marked_+( *(x,y),y)>
<Marked_*(s(x),y) , Marked_*(x,y)>
<Marked_*(p(x),y) , Marked_+( *(x,y),minus(y))>
<Marked_*(p(x),y) , Marked_*(x,y)>
<Marked_*(p(x),y) , Marked_minus(y)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 3 components:

{  <Marked_*(p(x),y) , Marked_*(x,y)> --> <Marked_*(p(x),y) , Marked_*(x,y)>
  <Marked_*(p(x),y) , Marked_*(x,y)> --> <Marked_*(s(x),y) , Marked_*(x,y)>
  <Marked_*(s(x),y) , Marked_*(x,y)> --> <Marked_*(p(x),y) , Marked_*(x,y)>
  <Marked_*(s(x),y) , Marked_*(x,y)> --> <Marked_*(s(x),y) , Marked_*(x,y)>
}

{  <Marked_+(p(x),y) , Marked_+(x,y)> --> <Marked_+(p(x),y) , Marked_+(x,y)>
  <Marked_+(p(x),y) , Marked_+(x,y)> --> <Marked_+(s(x),y) , Marked_+(x,y)>
  <Marked_+(s(x),y) , Marked_+(x,y)> --> <Marked_+(p(x),y) , Marked_+(x,y)>
  <Marked_+(s(x),y) , Marked_+(x,y)> --> <Marked_+(s(x),y) , Marked_+(x,y)>
}

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

 ]} 
{
 
DP termination of:
<Marked_+(s(x),y) , Marked_+(x,y)>
<Marked_+(p(x),y) , Marked_+(x,y)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     RPO with AFS = AFS: 
     and precedence:
     prec (All symbols are Lex.): { +  >  s ; +  >  p ; +  <   * ; s  <  + ;
                                   s  <  minus ; s  <   * ; p  <  + ;
                                   p  <  minus ; p  <   * ; minus  >  s ;
                                   minus  >  p ; minus  <   * ;  *  >  + ;
                                    *  >  s ;  *  >  p ;  *  >  minus ; }

 ]} 
{
 
DP termination of:
<Marked_minus(s(x)) , Marked_minus(x)>
<Marked_minus(p(x)) , Marked_minus(x)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     RPO with AFS = AFS: 
     and precedence:
     prec (All symbols are Lex.): { +  >  s ; +  >  p ; +  <   * ; s  <  + ;
                                   s  <  minus ; s  <   * ; p  <  + ;
                                   p  <  minus ; p  <   * ; minus  >  s ;
                                   minus  >  p ; minus  <   * ;  *  >  + ;
                                    *  >  s ;  *  >  p ;  *  >  minus ; }

 ]} 
 ]} 
 ]} 

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