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

TRS termination of:
[1] minus(x,0) -> x
[2] minus(s(x),s(y)) -> minus(x,y)
[3] quot(0,s(y)) -> 0
[4] quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
[5] le(0,y) -> true
[6] le(s(x),0) -> false
[7] le(s(x),s(y)) -> le(x,y)
[8] app(nil,y) -> y
[9] app(add(n,x),y) -> add(n,app(x,y))
[10] low(n,nil) -> nil
[11] low(n,add(m,x)) -> if_low(le(m,n),n,add(m,x))
[12] if_low(true,n,add(m,x)) -> add(m,low(n,x))
[13] if_low(false,n,add(m,x)) -> low(n,x)
[14] high(n,nil) -> nil
[15] high(n,add(m,x)) -> if_high(le(m,n),n,add(m,x))
[16] if_high(true,n,add(m,x)) -> high(n,x)
[17] if_high(false,n,add(m,x)) -> add(m,high(n,x))
[18] quicksort(nil) -> nil
[19] quicksort(add(n,x)) ->
 app(quicksort(low(n,x)),add(n,quicksort(high(n,x))))


Sub problem: 
guided: 

DP termination of:
<Marked_minus(s(x),s(y)) , Marked_minus(x,y)>
<Marked_quot(s(x),s(y)) , Marked_quot(minus(x,y),s(y))>
<Marked_quot(s(x),s(y)) , Marked_minus(x,y)>
<Marked_le(s(x),s(y)) , Marked_le(x,y)>
<Marked_app(add(n,x),y) , Marked_app(x,y)>
<Marked_low(n,add(m,x)) , Marked_if_low(le(m,n),n,add(m,x))>
<Marked_low(n,add(m,x)) , Marked_le(m,n)>
<Marked_if_low(true,n,add(m,x)) , Marked_low(n,x)>
<Marked_if_low(false,n,add(m,x)) , Marked_low(n,x)>
<Marked_high(n,add(m,x)) , Marked_if_high(le(m,n),n,add(m,x))>
<Marked_high(n,add(m,x)) , Marked_le(m,n)>
<Marked_if_high(true,n,add(m,x)) , Marked_high(n,x)>
<Marked_if_high(false,n,add(m,x)) , Marked_high(n,x)>
<Marked_quicksort(add(n,x)) , Marked_app(quicksort(low(n,x)),
                               add(n,quicksort(high(n,x))))>
<Marked_quicksort(add(n,x)) , Marked_quicksort(low(n,x))>
<Marked_quicksort(add(n,x)) , Marked_low(n,x)>
<Marked_quicksort(add(n,x)) , Marked_quicksort(high(n,x))>
<Marked_quicksort(add(n,x)) , Marked_high(n,x)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 7 components:

{  <Marked_quot(s(x),s(y)) , Marked_quot(minus(x,y),s(y))> 
      --> <Marked_quot(s(x),s(y)) , Marked_quot(minus(x,y),s(y))>
}

{  <Marked_minus(s(x),s(y)) , Marked_minus(x,y)> 
      --> <Marked_minus(s(x),s(y)) , Marked_minus(x,y)>
}

{  <Marked_quicksort(add(n,x)) , Marked_quicksort(high(n,x))> 
      --> <Marked_quicksort(add(n,x)) , Marked_quicksort(high(n,x))>
  <Marked_quicksort(add(n,x)) , Marked_quicksort(high(n,x))> 
     --> <Marked_quicksort(add(n,x)) , Marked_quicksort(low(n,x))>
  <Marked_quicksort(add(n,x)) , Marked_quicksort(low(n,x))> 
     --> <Marked_quicksort(add(n,x)) , Marked_quicksort(high(n,x))>
  <Marked_quicksort(add(n,x)) , Marked_quicksort(low(n,x))> 
     --> <Marked_quicksort(add(n,x)) , Marked_quicksort(low(n,x))>
}

{  <Marked_app(add(n,x),y) , Marked_app(x,y)> 
      --> <Marked_app(add(n,x),y) , Marked_app(x,y)>
}

{  <Marked_if_low(false,n,add(m,x)) , Marked_low(n,x)> 
      --> <Marked_low(n,add(m,x)) , Marked_if_low(le(m,n),n,add(m,x))>
  <Marked_if_low(true,n,add(m,x)) , Marked_low(n,x)> 
     --> <Marked_low(n,add(m,x)) , Marked_if_low(le(m,n),n,add(m,x))>
  <Marked_low(n,add(m,x)) , Marked_if_low(le(m,n),n,add(m,x))> 
     --> <Marked_if_low(false,n,add(m,x)) , Marked_low(n,x)>
  <Marked_low(n,add(m,x)) , Marked_if_low(le(m,n),n,add(m,x))> 
     --> <Marked_if_low(true,n,add(m,x)) , Marked_low(n,x)>
}

{  <Marked_if_high(false,n,add(m,x)) , Marked_high(n,x)> 
      --> <Marked_high(n,add(m,x)) , Marked_if_high(le(m,n),n,add(m,x))>
  <Marked_if_high(true,n,add(m,x)) , Marked_high(n,x)> 
     --> <Marked_high(n,add(m,x)) , Marked_if_high(le(m,n),n,add(m,x))>
  <Marked_high(n,add(m,x)) , Marked_if_high(le(m,n),n,add(m,x))> 
     --> <Marked_if_high(false,n,add(m,x)) , Marked_high(n,x)>
  <Marked_high(n,add(m,x)) , Marked_if_high(le(m,n),n,add(m,x))> 
     --> <Marked_if_high(true,n,add(m,x)) , Marked_high(n,x)>
}

{  <Marked_le(s(x),s(y)) , Marked_le(x,y)> 
      --> <Marked_le(s(x),s(y)) , Marked_le(x,y)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  minus(s(x),s(y)) >= minus(x,y) ;
  minus(x,0) >= x ;
  quot(0,s(y)) >= 0 ;
  quot(s(x),s(y)) >= s(quot(minus(x,y),s(y))) ;
  le(0,y) >= true ;
  le(s(x),0) >= false ;
  le(s(x),s(y)) >= le(x,y) ;
  app(nil,y) >= y ;
  app(add(n,x),y) >= add(n,app(x,y)) ;
  low(n,nil) >= nil ;
  low(n,add(m,x)) >= if_low(le(m,n),n,add(m,x)) ;
  if_low(true,n,add(m,x)) >= add(m,low(n,x)) ;
  if_low(false,n,add(m,x)) >= low(n,x) ;
  high(n,nil) >= nil ;
  high(n,add(m,x)) >= if_high(le(m,n),n,add(m,x)) ;
  if_high(true,n,add(m,x)) >= high(n,x) ;
  if_high(false,n,add(m,x)) >= add(m,high(n,x)) ;
  quicksort(nil) >= nil ;
  quicksort(add(n,x)) >= app(quicksort(low(n,x)),add(n,quicksort(high(n,x)))) ;
  Marked_quot(s(x),s(y)) >= Marked_quot(minus(x,y),s(y)) ;
 }
 + Disjunctions:{ 
{
  Marked_quot(s(x),s(y)) > Marked_quot(minus(x,y),s(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: minus(s(x),s(y)) >= minus(x,y)
constraint: minus(x,0) >= x
constraint: quot(0,s(y)) >= 0
constraint: quot(s(x),s(y)) >= s(quot(minus(x,y),s(y)))
constraint: le(0,y) >= true
constraint: le(s(x),0) >= false
constraint: le(s(x),s(y)) >= le(x,y)
constraint: app(nil,y) >= y
constraint: app(add(n,x),y) >= add(n,app(x,y))
constraint: low(n,nil) >= nil
constraint: low(n,add(m,x)) >= if_low(le(m,n),n,add(m,x))
constraint: if_low(true,n,add(m,x)) >= add(m,low(n,x))
constraint: if_low(false,n,add(m,x)) >= low(n,x)
constraint: high(n,nil) >= nil
constraint: high(n,add(m,x)) >= if_high(le(m,n),n,add(m,x))
constraint: if_high(true,n,add(m,x)) >= high(n,x)
constraint: if_high(false,n,add(m,x)) >= add(m,high(n,x))
constraint: quicksort(nil) >= nil
constraint: quicksort(add(n,x)) >= app(quicksort(low(n,x)),
                                    add(n,quicksort(high(n,x))))
constraint: Marked_quot(s(x),s(y)) >= Marked_quot(minus(x,y),s(y))
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  minus(s(x),s(y)) >= minus(x,y) ;
  minus(x,0) >= x ;
  quot(0,s(y)) >= 0 ;
  quot(s(x),s(y)) >= s(quot(minus(x,y),s(y))) ;
  le(0,y) >= true ;
  le(s(x),0) >= false ;
  le(s(x),s(y)) >= le(x,y) ;
  app(nil,y) >= y ;
  app(add(n,x),y) >= add(n,app(x,y)) ;
  low(n,nil) >= nil ;
  low(n,add(m,x)) >= if_low(le(m,n),n,add(m,x)) ;
  if_low(true,n,add(m,x)) >= add(m,low(n,x)) ;
  if_low(false,n,add(m,x)) >= low(n,x) ;
  high(n,nil) >= nil ;
  high(n,add(m,x)) >= if_high(le(m,n),n,add(m,x)) ;
  if_high(true,n,add(m,x)) >= high(n,x) ;
  if_high(false,n,add(m,x)) >= add(m,high(n,x)) ;
  quicksort(nil) >= nil ;
  quicksort(add(n,x)) >= app(quicksort(low(n,x)),add(n,quicksort(high(n,x)))) ;
  Marked_minus(s(x),s(y)) >= Marked_minus(x,y) ;
 }
 + Disjunctions:{ 
{
  Marked_minus(s(x),s(y)) > Marked_minus(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: minus(s(x),s(y)) >= minus(x,y)
constraint: minus(x,0) >= x
constraint: quot(0,s(y)) >= 0
constraint: quot(s(x),s(y)) >= s(quot(minus(x,y),s(y)))
constraint: le(0,y) >= true
constraint: le(s(x),0) >= false
constraint: le(s(x),s(y)) >= le(x,y)
constraint: app(nil,y) >= y
constraint: app(add(n,x),y) >= add(n,app(x,y))
constraint: low(n,nil) >= nil
constraint: low(n,add(m,x)) >= if_low(le(m,n),n,add(m,x))
constraint: if_low(true,n,add(m,x)) >= add(m,low(n,x))
constraint: if_low(false,n,add(m,x)) >= low(n,x)
constraint: high(n,nil) >= nil
constraint: high(n,add(m,x)) >= if_high(le(m,n),n,add(m,x))
constraint: if_high(true,n,add(m,x)) >= high(n,x)
constraint: if_high(false,n,add(m,x)) >= add(m,high(n,x))
constraint: quicksort(nil) >= nil
constraint: quicksort(add(n,x)) >= app(quicksort(low(n,x)),
                                    add(n,quicksort(high(n,x))))
constraint: Marked_minus(s(x),s(y)) >= Marked_minus(x,y)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  minus(s(x),s(y)) >= minus(x,y) ;
  minus(x,0) >= x ;
  quot(0,s(y)) >= 0 ;
  quot(s(x),s(y)) >= s(quot(minus(x,y),s(y))) ;
  le(0,y) >= true ;
  le(s(x),0) >= false ;
  le(s(x),s(y)) >= le(x,y) ;
  app(nil,y) >= y ;
  app(add(n,x),y) >= add(n,app(x,y)) ;
  low(n,nil) >= nil ;
  low(n,add(m,x)) >= if_low(le(m,n),n,add(m,x)) ;
  if_low(true,n,add(m,x)) >= add(m,low(n,x)) ;
  if_low(false,n,add(m,x)) >= low(n,x) ;
  high(n,nil) >= nil ;
  high(n,add(m,x)) >= if_high(le(m,n),n,add(m,x)) ;
  if_high(true,n,add(m,x)) >= high(n,x) ;
  if_high(false,n,add(m,x)) >= add(m,high(n,x)) ;
  quicksort(nil) >= nil ;
  quicksort(add(n,x)) >= app(quicksort(low(n,x)),add(n,quicksort(high(n,x)))) ;
  Marked_quicksort(add(n,x)) >= Marked_quicksort(low(n,x)) ;
  Marked_quicksort(add(n,x)) >= Marked_quicksort(high(n,x)) ;
 }
 + Disjunctions:{ 
{
  Marked_quicksort(add(n,x)) > Marked_quicksort(low(n,x)) ;
 }
{
  Marked_quicksort(add(n,x)) > Marked_quicksort(high(n,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: minus(s(x),s(y)) >= minus(x,y)
constraint: minus(x,0) >= x
constraint: quot(0,s(y)) >= 0
constraint: quot(s(x),s(y)) >= s(quot(minus(x,y),s(y)))
constraint: le(0,y) >= true
constraint: le(s(x),0) >= false
constraint: le(s(x),s(y)) >= le(x,y)
constraint: app(nil,y) >= y
constraint: app(add(n,x),y) >= add(n,app(x,y))
constraint: low(n,nil) >= nil
constraint: low(n,add(m,x)) >= if_low(le(m,n),n,add(m,x))
constraint: if_low(true,n,add(m,x)) >= add(m,low(n,x))
constraint: if_low(false,n,add(m,x)) >= low(n,x)
constraint: high(n,nil) >= nil
constraint: high(n,add(m,x)) >= if_high(le(m,n),n,add(m,x))
constraint: if_high(true,n,add(m,x)) >= high(n,x)
constraint: if_high(false,n,add(m,x)) >= add(m,high(n,x))
constraint: quicksort(nil) >= nil
constraint: quicksort(add(n,x)) >= app(quicksort(low(n,x)),
                                    add(n,quicksort(high(n,x))))
constraint: Marked_quicksort(add(n,x)) >= Marked_quicksort(low(n,x))
constraint: Marked_quicksort(add(n,x)) >= Marked_quicksort(high(n,x))
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  minus(s(x),s(y)) >= minus(x,y) ;
  minus(x,0) >= x ;
  quot(0,s(y)) >= 0 ;
  quot(s(x),s(y)) >= s(quot(minus(x,y),s(y))) ;
  le(0,y) >= true ;
  le(s(x),0) >= false ;
  le(s(x),s(y)) >= le(x,y) ;
  app(nil,y) >= y ;
  app(add(n,x),y) >= add(n,app(x,y)) ;
  low(n,nil) >= nil ;
  low(n,add(m,x)) >= if_low(le(m,n),n,add(m,x)) ;
  if_low(true,n,add(m,x)) >= add(m,low(n,x)) ;
  if_low(false,n,add(m,x)) >= low(n,x) ;
  high(n,nil) >= nil ;
  high(n,add(m,x)) >= if_high(le(m,n),n,add(m,x)) ;
  if_high(true,n,add(m,x)) >= high(n,x) ;
  if_high(false,n,add(m,x)) >= add(m,high(n,x)) ;
  quicksort(nil) >= nil ;
  quicksort(add(n,x)) >= app(quicksort(low(n,x)),add(n,quicksort(high(n,x)))) ;
  Marked_app(add(n,x),y) >= Marked_app(x,y) ;
 }
 + Disjunctions:{ 
{
  Marked_app(add(n,x),y) > Marked_app(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: minus(s(x),s(y)) >= minus(x,y)
constraint: minus(x,0) >= x
constraint: quot(0,s(y)) >= 0
constraint: quot(s(x),s(y)) >= s(quot(minus(x,y),s(y)))
constraint: le(0,y) >= true
constraint: le(s(x),0) >= false
constraint: le(s(x),s(y)) >= le(x,y)
constraint: app(nil,y) >= y
constraint: app(add(n,x),y) >= add(n,app(x,y))
constraint: low(n,nil) >= nil
constraint: low(n,add(m,x)) >= if_low(le(m,n),n,add(m,x))
constraint: if_low(true,n,add(m,x)) >= add(m,low(n,x))
constraint: if_low(false,n,add(m,x)) >= low(n,x)
constraint: high(n,nil) >= nil
constraint: high(n,add(m,x)) >= if_high(le(m,n),n,add(m,x))
constraint: if_high(true,n,add(m,x)) >= high(n,x)
constraint: if_high(false,n,add(m,x)) >= add(m,high(n,x))
constraint: quicksort(nil) >= nil
constraint: quicksort(add(n,x)) >= app(quicksort(low(n,x)),
                                    add(n,quicksort(high(n,x))))
constraint: Marked_app(add(n,x),y) >= Marked_app(x,y)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  minus(s(x),s(y)) >= minus(x,y) ;
  minus(x,0) >= x ;
  quot(0,s(y)) >= 0 ;
  quot(s(x),s(y)) >= s(quot(minus(x,y),s(y))) ;
  le(0,y) >= true ;
  le(s(x),0) >= false ;
  le(s(x),s(y)) >= le(x,y) ;
  app(nil,y) >= y ;
  app(add(n,x),y) >= add(n,app(x,y)) ;
  low(n,nil) >= nil ;
  low(n,add(m,x)) >= if_low(le(m,n),n,add(m,x)) ;
  if_low(true,n,add(m,x)) >= add(m,low(n,x)) ;
  if_low(false,n,add(m,x)) >= low(n,x) ;
  high(n,nil) >= nil ;
  high(n,add(m,x)) >= if_high(le(m,n),n,add(m,x)) ;
  if_high(true,n,add(m,x)) >= high(n,x) ;
  if_high(false,n,add(m,x)) >= add(m,high(n,x)) ;
  quicksort(nil) >= nil ;
  quicksort(add(n,x)) >= app(quicksort(low(n,x)),add(n,quicksort(high(n,x)))) ;
  Marked_low(n,add(m,x)) >= Marked_if_low(le(m,n),n,add(m,x)) ;
  Marked_if_low(true,n,add(m,x)) >= Marked_low(n,x) ;
  Marked_if_low(false,n,add(m,x)) >= Marked_low(n,x) ;
 }
 + Disjunctions:{ 
{
  Marked_low(n,add(m,x)) > Marked_if_low(le(m,n),n,add(m,x)) ;
 }
{
  Marked_if_low(true,n,add(m,x)) > Marked_low(n,x) ;
 }
{
  Marked_if_low(false,n,add(m,x)) > Marked_low(n,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 ===
Time out for these parameters.
=== 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 66.288808 seconds (real time)
Cime Exit Status: 0