unknown

Initial ITS

Start location: [1]
Program variables: a b c max
   0: [1] -> [2] : max'=1000, T, cost: 1
   1: [2] -> [3] : a'=1, T, cost: 1
   2: [3] -> [4] : b'=1, T, cost: 1
   3: [4] -> [5] : c'=1, T, cost: 1
   4: [5] -> [6] : (-max+c <= 0 /\ (-c^3+a^3-b^3 < 0 \/ -c^3+a^3-b^3 > 0)), cost: 1
  17: [5] -> [16] : (-max+c > 0 \/ (-c^3+a^3-b^3 <= 0 /\ -c^3+a^3-b^3 >= 0)), cost: 1
   5: [6] -> [7] : a'=1+a, T, cost: 1
   6: [7] -> [9] : a-max > 0, cost: 1
  10: [7] -> [8] : a-max <= 0, cost: 1
  11: [8] -> [13] : b-max > 0, cost: 1
  15: [8] -> [12] : b-max <= 0, cost: 1
   7: [9] -> [10] : a'=1, T, cost: 1
   8: [10] -> [11] : b'=1+b, T, cost: 1
   9: [11] -> [8] : T, cost: 1
  16: [12] -> [5] : T, cost: 1
  12: [13] -> [14] : b'=1, T, cost: 1
  13: [14] -> [15] : c'=1+c, T, cost: 1
  14: [15] -> [12] : T, cost: 1

Chained Linear Paths

Start location: [1]
Program variables: a b c max
  20: [1] -> [5] : a'=1, b'=1, c'=1, max'=1000, T, cost: 1
  17: [5] -> [16] : (-max+c > 0 \/ (-c^3+a^3-b^3 <= 0 /\ -c^3+a^3-b^3 >= 0)), cost: 1
  21: [5] -> [7] : a'=1+a, (-max+c <= 0 /\ (-c^3+a^3-b^3 < 0 \/ -c^3+a^3-b^3 > 0)), cost: 1
  10: [7] -> [8] : a-max <= 0, cost: 1
  24: [7] -> [8] : a'=1, b'=1+b, a-max > 0, cost: 1
  15: [8] -> [12] : b-max <= 0, cost: 1
  27: [8] -> [12] : b'=1, c'=1+c, b-max > 0, cost: 1
  16: [12] -> [5] : T, cost: 1

	Eliminating location [2] by chaining:

	Applied chaining

	First rule:
	[1] -> [2] : max'=1000, T, cost: 1
	Second rule:
	[2] -> [3] : a'=1, T, cost: 1
	New rule:
	[1] -> [3] : a'=1, max'=1000, T, cost: 1
	
	Applied deletion

	Removed the following rules: 0 1
	
	Eliminating location [3] by chaining:

	Applied chaining

	First rule:
	[1] -> [3] : a'=1, max'=1000, T, cost: 1
	Second rule:
	[3] -> [4] : b'=1, T, cost: 1
	New rule:
	[1] -> [4] : a'=1, b'=1, max'=1000, T, cost: 1
	
	Applied deletion

	Removed the following rules: 2 18
	
	Eliminating location [4] by chaining:

	Applied chaining

	First rule:
	[1] -> [4] : a'=1, b'=1, max'=1000, T, cost: 1
	Second rule:
	[4] -> [5] : c'=1, T, cost: 1
	New rule:
	[1] -> [5] : a'=1, b'=1, c'=1, max'=1000, T, cost: 1
	
	Applied deletion

	Removed the following rules: 3 19
	
	Eliminating location [6] by chaining:

	Applied chaining

	First rule:
	[5] -> [6] : (-max+c <= 0 /\ (-c^3+a^3-b^3 < 0 \/ -c^3+a^3-b^3 > 0)), cost: 1
	Second rule:
	[6] -> [7] : a'=1+a, T, cost: 1
	New rule:
	[5] -> [7] : a'=1+a, (-max+c <= 0 /\ (-c^3+a^3-b^3 < 0 \/ -c^3+a^3-b^3 > 0)), cost: 1
	
	Applied deletion

	Removed the following rules: 4 5
	
	Eliminating location [9] by chaining:

	Applied chaining

	First rule:
	[7] -> [9] : a-max > 0, cost: 1
	Second rule:
	[9] -> [10] : a'=1, T, cost: 1
	New rule:
	[7] -> [10] : a'=1, a-max > 0, cost: 1
	
	Applied deletion

	Removed the following rules: 6 7
	
	Eliminating location [10] by chaining:

	Applied chaining

	First rule:
	[7] -> [10] : a'=1, a-max > 0, cost: 1
	Second rule:
	[10] -> [11] : b'=1+b, T, cost: 1
	New rule:
	[7] -> [11] : a'=1, b'=1+b, a-max > 0, cost: 1
	
	Applied deletion

	Removed the following rules: 8 22
	
	Eliminating location [11] by chaining:

	Applied chaining

	First rule:
	[7] -> [11] : a'=1, b'=1+b, a-max > 0, cost: 1
	Second rule:
	[11] -> [8] : T, cost: 1
	New rule:
	[7] -> [8] : a'=1, b'=1+b, a-max > 0, cost: 1
	
	Applied deletion

	Removed the following rules: 9 23
	
	Eliminating location [13] by chaining:

	Applied chaining

	First rule:
	[8] -> [13] : b-max > 0, cost: 1
	Second rule:
	[13] -> [14] : b'=1, T, cost: 1
	New rule:
	[8] -> [14] : b'=1, b-max > 0, cost: 1
	
	Applied deletion

	Removed the following rules: 11 12
	
	Eliminating location [14] by chaining:

	Applied chaining

	First rule:
	[8] -> [14] : b'=1, b-max > 0, cost: 1
	Second rule:
	[14] -> [15] : c'=1+c, T, cost: 1
	New rule:
	[8] -> [15] : b'=1, c'=1+c, b-max > 0, cost: 1
	
	Applied deletion

	Removed the following rules: 13 25
	
	Eliminating location [15] by chaining:

	Applied chaining

	First rule:
	[8] -> [15] : b'=1, c'=1+c, b-max > 0, cost: 1
	Second rule:
	[15] -> [12] : T, cost: 1
	New rule:
	[8] -> [12] : b'=1, c'=1+c, b-max > 0, cost: 1
	
	Applied deletion

	Removed the following rules: 14 26

Step with 20

	Trace

	20[T]
	
	Blocked

	[{}, {}]

Step with 21

	Trace

	20[T], 21[(-c^3+a^3-b^3 < 0 /\ -max+c <= 0)]
	
	Blocked

	[{}, {17[T]}, {}]

Step with 10

	Trace

	20[T], 21[(-c^3+a^3-b^3 < 0 /\ -max+c <= 0)], 10[(a-max <= 0)]
	
	Blocked

	[{}, {17[T]}, {}, {}]

Step with 15

	Trace

	20[T], 21[(-c^3+a^3-b^3 < 0 /\ -max+c <= 0)], 10[(a-max <= 0)], 15[(b-max <= 0)]
	
	Blocked

	[{}, {17[T]}, {}, {}, {}]

Step with 16

	Trace

	20[T], 21[(-c^3+a^3-b^3 < 0 /\ -max+c <= 0)], 10[(a-max <= 0)], 15[(b-max <= 0)], 16[T]
	
	Blocked

	[{}, {17[T]}, {}, {}, {}, {}]

Accelerate

Start location: [1]
Program variables: a b c max
  20: [1] -> [5] : a'=1, b'=1, c'=1, max'=1000, T, cost: 1
  17: [5] -> [16] : (-max+c > 0 \/ (-c^3+a^3-b^3 <= 0 /\ -c^3+a^3-b^3 >= 0)), cost: 1
  21: [5] -> [7] : a'=1+a, (-max+c <= 0 /\ (-c^3+a^3-b^3 < 0 \/ -c^3+a^3-b^3 > 0)), cost: 1
  28: [5] -> [5] : a'=a+n, (-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0), cost: 1
  10: [7] -> [8] : a-max <= 0, cost: 1
  24: [7] -> [8] : a'=1, b'=1+b, a-max > 0, cost: 1
  15: [8] -> [12] : b-max <= 0, cost: 1
  27: [8] -> [12] : b'=1, c'=1+c, b-max > 0, cost: 1
  16: [12] -> [5] : T, cost: 1

	Loop Acceleration

	Original rule:
	[5] -> [5] : a'=1+a, (1+a-max <= 0 /\ -c^3+a^3-b^3 < 0 /\ b-max <= 0 /\ -max+c <= 0), cost: 1
	New rule:
	[5] -> [5] : a'=a+n, (-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0), cost: 1

		-b+max >= 0 [0]: monotonic increase yields -b+max >= 0
		
		max-c >= 0 [0]: monotonic increase yields max-c >= 0
		
		c^3-a^3+b^3 > 0 [0]: montonic decrease yields -(-1+a+n)^3+c^3+b^3 > 0
		
		c^3-a^3+b^3 > 0 [1]: eventual increase yields (c^3-a^3+b^3 > 0 /\ (1+a)^3-a^3 <= 0)
		
		-1-a+max >= 0 [0]: montonic decrease yields -a+max-n >= 0
		
		-1-a+max >= 0 [1]: eventual increase yields (1 <= 0 /\ -1-a+max >= 0)
		
		Replacement map: {-b+max >= 0 -> -b+max >= 0, max-c >= 0 -> max-c >= 0, c^3-a^3+b^3 > 0 -> -(-1+a+n)^3+c^3+b^3 > 0, -1-a+max >= 0 -> -a+max-n >= 0}

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)]
	
	Blocked

	[{}, {17[T]}, {28[T]}]

Step with 21

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {}]

Step with 10

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 10[(a-max <= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {}, {}]

Step with 15

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 10[(a-max <= 0)], 15[(b-max <= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {}, {}, {}]

Step with 16

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 10[(a-max <= 0)], 15[(b-max <= 0)], 16[T]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {}, {}, {}, {}]

Accelerate

Start location: [1]
Program variables: a b c max
  20: [1] -> [5] : a'=1, b'=1, c'=1, max'=1000, T, cost: 1
  17: [5] -> [16] : (-max+c > 0 \/ (-c^3+a^3-b^3 <= 0 /\ -c^3+a^3-b^3 >= 0)), cost: 1
  21: [5] -> [7] : a'=1+a, (-max+c <= 0 /\ (-c^3+a^3-b^3 < 0 \/ -c^3+a^3-b^3 > 0)), cost: 1
  28: [5] -> [5] : a'=a+n, (-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0), cost: 1
  29: [5] -> [5] : a'=a+n2, (-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0), cost: 1
  10: [7] -> [8] : a-max <= 0, cost: 1
  24: [7] -> [8] : a'=1, b'=1+b, a-max > 0, cost: 1
  15: [8] -> [12] : b-max <= 0, cost: 1
  27: [8] -> [12] : b'=1, c'=1+c, b-max > 0, cost: 1
  16: [12] -> [5] : T, cost: 1

	Loop Acceleration

	Original rule:
	[5] -> [5] : a'=1+a, (1+a-max <= 0 /\ -c^3+a^3-b^3 > 0 /\ b-max <= 0 /\ -max+c <= 0), cost: 1
	New rule:
	[5] -> [5] : a'=a+n2, (-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0), cost: 1

		-c^3+a^3-b^3 > 0 [0]: monotonic increase yields -c^3+a^3-b^3 > 0
		
		-b+max >= 0 [0]: monotonic increase yields -b+max >= 0
		
		max-c >= 0 [0]: monotonic increase yields max-c >= 0
		
		-1-a+max >= 0 [0]: montonic decrease yields -a-n2+max >= 0
		
		-1-a+max >= 0 [1]: eventual increase yields (1 <= 0 /\ -1-a+max >= 0)
		
		Replacement map: {-c^3+a^3-b^3 > 0 -> -c^3+a^3-b^3 > 0, -b+max >= 0 -> -b+max >= 0, max-c >= 0 -> max-c >= 0, -1-a+max >= 0 -> -a-n2+max >= 0}

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 29[(-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {29[T]}]

Acceleration Failed

marked recursive suffix as redundant

Step with 21

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 29[(-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {17[T], 29[T]}, {}]

Step with 10

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 29[(-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 10[(a-max <= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {17[T], 29[T]}, {}, {}]

Step with 15

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 29[(-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 10[(a-max <= 0)], 15[(b-max <= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {17[T], 29[T]}, {}, {}, {}]

Step with 16

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 29[(-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 10[(a-max <= 0)], 15[(b-max <= 0)], 16[T]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {17[T], 29[T]}, {}, {}, {}, {}]

Covered

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 29[(-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 10[(a-max <= 0)], 15[(b-max <= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {17[T], 29[T]}, {}, {}, {16[T]}]

Backtrack

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 29[(-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 10[(a-max <= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {17[T], 29[T]}, {}, {15[T]}]

Backtrack

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 29[(-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {17[T], 29[T]}, {10[T]}]

Step with 24

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 29[(-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 24[(a-max > 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {17[T], 29[T]}, {10[T]}, {}]

Step with 15

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 29[(-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 24[(a-max > 0)], 15[(b-max <= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {17[T], 29[T]}, {10[T]}, {}, {}]

Step with 16

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 29[(-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 24[(a-max > 0)], 15[(b-max <= 0)], 16[T]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {17[T], 29[T]}, {10[T]}, {}, {}, {}]

Accelerate and Drop

Start location: [1]
Program variables: a b c max
  20: [1] -> [5] : a'=1, b'=1, c'=1, max'=1000, T, cost: 1
  17: [5] -> [16] : (-max+c > 0 \/ (-c^3+a^3-b^3 <= 0 /\ -c^3+a^3-b^3 >= 0)), cost: 1
  21: [5] -> [7] : a'=1+a, (-max+c <= 0 /\ (-c^3+a^3-b^3 < 0 \/ -c^3+a^3-b^3 > 0)), cost: 1
  28: [5] -> [5] : a'=a+n, (-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0), cost: 1
  29: [5] -> [5] : a'=a+n2, (-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0), cost: 1
  30: [5] -> [5] : a'=1, b'=n4+b, (-1+n4 >= 0 /\ 1+a-max > 0 /\ max-c >= 0 /\ 2-max > 0 /\ 1-c^3-(-1+n4+b)^3 > 0 /\ -n4-b+max >= 0), cost: 1
  10: [7] -> [8] : a-max <= 0, cost: 1
  24: [7] -> [8] : a'=1, b'=1+b, a-max > 0, cost: 1
  15: [8] -> [12] : b-max <= 0, cost: 1
  27: [8] -> [12] : b'=1, c'=1+c, b-max > 0, cost: 1
  16: [12] -> [5] : T, cost: 1

	Loop Acceleration

	Original rule:
	[5] -> [5] : a'=1, b'=1+b, (1+a-max > 0 /\ -c^3+a^3-b^3 > 0 /\ 1+b-max <= 0 /\ -max+c <= 0), cost: 1
	New rule:
	[5] -> [5] : a'=1, b'=n4+b, (-1+n4 >= 0 /\ 1+a-max > 0 /\ max-c >= 0 /\ 2-max > 0 /\ 1-c^3-(-1+n4+b)^3 > 0 /\ -n4-b+max >= 0), cost: 1

		1+a-max > 0 [0]: eventual decrease yields (1+a-max > 0 /\ 2-max > 0)
		
		1+a-max > 0 [1]: eventual increase yields (1+a-max > 0 /\ -1+a <= 0)
		
		-c^3+a^3-b^3 > 0 [0]: montonic decrease yields 1-c^3-(-1+n4+b)^3 > 0, dependencies: 1+a-max > 0 max-c >= 0 -1-b+max >= 0
		
		-c^3+a^3-b^3 > 0 [1]: eventual decrease yields (-c^3+a^3-b^3 > 0 /\ 1-c^3-(-1+n4+b)^3 > 0)
		
		max-c >= 0 [0]: monotonic increase yields max-c >= 0
		
		-1-b+max >= 0 [0]: montonic decrease yields -n4-b+max >= 0
		
		-1-b+max >= 0 [1]: eventual increase yields (1 <= 0 /\ -1-b+max >= 0)
		
		Replacement map: {1+a-max > 0 -> (1+a-max > 0 /\ 2-max > 0), -c^3+a^3-b^3 > 0 -> 1-c^3-(-1+n4+b)^3 > 0, max-c >= 0 -> max-c >= 0, -1-b+max >= 0 -> -n4-b+max >= 0}

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 29[(-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {17[T], 29[T]}]

Step with 21

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 29[(-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {17[T], 29[T]}, {}]

Step with 24

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 29[(-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 24[(a-max > 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {17[T], 29[T]}, {}, {}]

Step with 15

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 29[(-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 24[(a-max > 0)], 15[(b-max <= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {17[T], 29[T]}, {}, {}, {}]

Step with 16

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 29[(-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 24[(a-max > 0)], 15[(b-max <= 0)], 16[T]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {17[T], 29[T]}, {}, {}, {}, {}]

Covered

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 29[(-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 24[(a-max > 0)], 15[(b-max <= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {17[T], 29[T]}, {}, {}, {16[T]}]

Backtrack

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 29[(-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 24[(a-max > 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {17[T], 29[T]}, {}, {15[T]}]

Backtrack

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 29[(-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {17[T], 29[T]}, {24[T]}]

Step with 10

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 29[(-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 10[(a-max <= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {17[T], 29[T]}, {24[T]}, {}]

Step with 15

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 29[(-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 10[(a-max <= 0)], 15[(b-max <= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {17[T], 29[T]}, {24[T]}, {}, {}]

Step with 16

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 29[(-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 10[(a-max <= 0)], 15[(b-max <= 0)], 16[T]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {17[T], 29[T]}, {24[T]}, {}, {}, {}]

Covered

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 29[(-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 10[(a-max <= 0)], 15[(b-max <= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {17[T], 29[T]}, {24[T]}, {}, {16[T]}]

Backtrack

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 29[(-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 10[(a-max <= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {17[T], 29[T]}, {24[T]}, {15[T]}]

Backtrack

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 29[(-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {17[T], 29[T]}, {10[T], 24[T]}]

Backtrack

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 29[(-c^3+a^3-b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n2 >= 0 /\ -a-n2+max >= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T]}, {17[T], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 29[T]}]

Backtrack

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T], 29[T]}]

Step with 21

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T], 29[T]}, {}]

Step with 10

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 10[(a-max <= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T], 29[T]}, {}, {}]

Step with 15

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 10[(a-max <= 0)], 15[(b-max <= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T], 29[T]}, {}, {}, {}]

Step with 16

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 10[(a-max <= 0)], 15[(b-max <= 0)], 16[T]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T], 29[T]}, {}, {}, {}, {}]

Covered

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 10[(a-max <= 0)], 15[(b-max <= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T], 29[T]}, {}, {}, {16[T]}]

Backtrack

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 10[(a-max <= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T], 29[T]}, {}, {15[T]}]

Backtrack

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 28[T], 29[T]}, {10[T]}]

Backtrack

	Trace

	20[T], 28[(-(-1+a+n)^3+c^3+b^3 > 0 /\ -b+max >= 0 /\ max-c >= 0 /\ -1+n >= 0 /\ -a+max-n >= 0)]
	
	Blocked

	[{}, {17[T]}, {17[T], 21[(-c^3+a^3-b^3 > 0 /\ -max+c <= 0)], 28[T], 29[T]}]

Backtrack

	Trace

	20[T]
	
	Blocked

	[{}, {17[T], 28[T]}]

Step with 21

	Trace

	20[T], 21[(-c^3+a^3-b^3 < 0 /\ -max+c <= 0)]
	
	Blocked

	[{}, {17[T], 28[T]}, {}]

Step with 10

	Trace

	20[T], 21[(-c^3+a^3-b^3 < 0 /\ -max+c <= 0)], 10[(a-max <= 0)]
	
	Blocked

	[{}, {17[T], 28[T]}, {}, {}]

Step with 15

	Trace

	20[T], 21[(-c^3+a^3-b^3 < 0 /\ -max+c <= 0)], 10[(a-max <= 0)], 15[(b-max <= 0)]
	
	Blocked

	[{}, {17[T], 28[T]}, {}, {}, {}]

Step with 16

	Trace

	20[T], 21[(-c^3+a^3-b^3 < 0 /\ -max+c <= 0)], 10[(a-max <= 0)], 15[(b-max <= 0)], 16[T]
	
	Blocked

	[{}, {17[T], 28[T]}, {}, {}, {}, {}]

Covered

	Trace

	20[T], 21[(-c^3+a^3-b^3 < 0 /\ -max+c <= 0)], 10[(a-max <= 0)], 15[(b-max <= 0)]
	
	Blocked

	[{}, {17[T], 28[T]}, {}, {}, {16[T]}]

Backtrack

	Trace

	20[T], 21[(-c^3+a^3-b^3 < 0 /\ -max+c <= 0)], 10[(a-max <= 0)]
	
	Blocked

	[{}, {17[T], 28[T]}, {}, {15[T]}]

Backtrack

	Trace

	20[T], 21[(-c^3+a^3-b^3 < 0 /\ -max+c <= 0)]
	
	Blocked

	[{}, {17[T], 28[T]}, {10[T]}]

Backtrack

	Trace

	20[T]
	
	Blocked

	[{}, {17[T], 21[(-c^3+a^3-b^3 < 0 /\ -max+c <= 0)], 28[T]}]

Backtrack

	Trace

	Blocked

	[{20[T]}]

Accept

unknown

Build SHA: a05f16bf13df659c382799650051f91bf6828c7b