Loading division.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading division2.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading inconsistent_basis.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading ineqs_simplify0.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading ineqs_simplify1.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading ineqs_simplify2.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading ineqs_simplify3.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading ineqs_simplify4.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading ineqs_simplify5.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading inequations0.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading inequations1.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading inequations2.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading inequations3.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading nonLinInEqExample0.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading nonLinInEqExample1.pri ...
Preprocessing ...
Constructing countermodel ...

INVALID

Countermodel:
b = -1 & a = -5

Loading nonLinInEqExample2.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading nonLinInEqExample3.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading nonLinInEqExample4.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading quadraticInEq11.pri ...
Preprocessing ...
Constructing countermodel ...

INVALID

Countermodel:
b = 0 & a = 0

Loading quadraticInEq12.pri ...
Preprocessing ...
Constructing countermodel ...

INVALID

Countermodel:
b = -4 & a = 9

Loading quadraticInEq2.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading quadraticInEq3.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading quadraticInEq4.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading quadraticInEq5.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading quadraticInEq6.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading quadraticInEq7.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading quadraticInEq.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading simplify0.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading simplify10.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading simplify11.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading simplify12.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading simplify13.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading simplify15.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading simplify16.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading simplify17.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading simplify18.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading simplify19.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading simplify1.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading simplify20.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading simplify21.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading simplify22.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading simplify23.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading simplify24.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading simplify25.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading simplify27.pri ...
Preprocessing ...
Constructing countermodel ...

INVALID

Countermodel:
x2 = 0 & x3 = 0 & x4 = 0 & x5 = 0 & x6 = 0

Loading simplify2.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading simplify3.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading simplify4.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading simplify5.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading simplify6.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading simplify7.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading simplify8.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading simplify9.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading subsumptionExample.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading simpleTermination.pri ...
Preprocessing ...
Constructing satisfying assignment for the existential constants ...

VALID

Under the assignment:
X = 0

Loading aproveSMT809443464904014753.smt2 ...
Preprocessing ...
Constructing countermodel ...

sat
(model
  (define-fun a__5 () Int 1)
  (define-fun a__8 () Int 0)
  (define-fun a__4 () Int 1)
  (define-fun a__9 () Int 0)
  (define-fun a__6 () Int 0)
  (define-fun a__7 () Int 1)
  (define-fun a__2 () Int 1)
  (define-fun b__10 () Int 1)
)

Loading bv-square.pri ...
Preprocessing ...
Constructing countermodel ...

INVALID

Countermodel:
x = 46341.\as[signed bv[32]]

Loading bv-quadratic-eq.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading mult-diff.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading mult-model.pri ...
Preprocessing ...
Constructing countermodel ...

INVALID

Countermodel:
b = 799 & a = 83

Loading shift.pri ...
Preprocessing ...
Constructing countermodel ...

INVALID

Countermodel:
y = 101 & x = 808

Loading diffsquare.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading mult-icp.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading subsumptionBug.pri ...
Preprocessing ...
Constructing countermodel ...

INVALID

Countermodel:
eval0 = 2

Loading polyReduceBug.pri ...
Preprocessing ...
Constructing countermodel ...

INVALID

Countermodel:
P1 = 1 & P0 = 0

Loading polyReduceBug2.smt2 ...
Warning: reset is only supported in incremental mode (option +incremental), ignoring it
Warning: exit is only supported in incremental mode (option +incremental), ignoring it
Preprocessing ...
Constructing countermodel ...

sat
(model
  (define-fun FALSE_local6 () Int 0)
  (define-fun FALSE_local5 () Int 0)
  (define-fun FALSE_local4 () Int 0)
  (define-fun FALSE_local3 () Int 0)
  (define-fun FALSE_local2 () Int 0)
  (define-fun FALSE_local1 () Int 0)
  (define-fun FALSE_local0 () Int 0)
  (define-fun p1 () Bool true)
)

Loading splittingBug2.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading squares-div-2.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading splittingBug.pri ...
Preprocessing ...
Constructing countermodel ...

INVALID

Countermodel:
x9 = 3 & x8 = 9 & x7 = 5 & x6 = 2 & x5 = 8 & x4 = 6 & x3 = 4 & x2 = 7 & x1 = 1

Loading nonLinInEqExample2.pri ...
Preprocessing ...
Constructing countermodel ...
Found proof (size 200)

VALID

Assumptions after simplification:
---------------------------------

  (input)
  \exists int v0, v1, v2, v3; (a * a = v0 & ((3 >= v0 & (1 < a | a < -1)) | (v0
        >= 4 & 1 >= a & a >= -1) | (v0 * a = v1 & ((10 >= v1 & a >= 3) | (3 >=
            v1 & a >= 2) | (v1 >= 11 & 2 >= a) | (v1 >= 4 & 1 >= a) | (v2 * a =
            v3 & v1 * a = v2 & ((39 >= v3 & a >= 3) | (v3 >= 40 & 2 >= a)))))))

Those formulas are unsatisfiable:
---------------------------------

Begin of proof
| 
| DELTA: instantiating (input) with fresh symbols all_0_0, all_0_1, all_0_2,
|        all_0_3 gives:
|   (1)  a * a = all_0_3 & ((3 >= all_0_3 & (1 < a | a < -1)) | (all_0_3 >= 4 &
|            1 >= a & a >= -1) | (all_0_3 * a = all_0_2 & ((10 >= all_0_2 & a >=
|                3) | (3 >= all_0_2 & a >= 2) | (all_0_2 >= 11 & 2 >= a) |
|              (all_0_2 >= 4 & 1 >= a) | (all_0_1 * a = all_0_0 & all_0_2 * a =
|                all_0_1 & ((39 >= all_0_0 & a >= 3) | (all_0_0 >= 40 & 2 >=
|                    a))))))
| 
| ALPHA: (1) implies:
|   (2)  a * a = all_0_3
|   (3)  (3 >= all_0_3 & (1 < a | a < -1)) | (all_0_3 >= 4 & 1 >= a & a >= -1) |
|        (all_0_3 * a = all_0_2 & ((10 >= all_0_2 & a >= 3) | (3 >= all_0_2 & a
|              >= 2) | (all_0_2 >= 11 & 2 >= a) | (all_0_2 >= 4 & 1 >= a) |
|            (all_0_1 * a = all_0_0 & all_0_2 * a = all_0_1 & ((39 >= all_0_0 &
|                  a >= 3) | (all_0_0 >= 40 & 2 >= a)))))
| 
| THEORY_AXIOM GroebnerMultiplication: 
|   (4)  \forall int v0, v1; (-1 < v1 | v0 * v0 != v1)
| 
| GROUND_INST: instantiating (4) with a, all_0_3, simplifying with (2) gives:
|   (5)  all_0_3 >= 0
| 
| BETA: splitting (3) gives:
| 
| Case 1:
| | 
| |   (6)  3 >= all_0_3 & (1 < a | a < -1)
| | 
| | ALPHA: (6) implies:
| |   (7)  3 >= all_0_3
| |   (8)  1 < a | a < -1
| | 
| | THEORY_AXIOM GroebnerMultiplication: 
| |   (9)  \forall int v0, v1; (3 < v1 | v1 < 2 | v0 * v0 != v1)
| | 
| | GROUND_INST: instantiating (9) with a, all_0_3, simplifying with (2) gives:
| |   (10)  3 < all_0_3 | all_0_3 < 2
| | 
| | BETA: splitting (10) gives:
| | 
| | Case 1:
| | | 
| | |   (11)  all_0_3 >= 4
| | | 
| | | COMBINE_INEQS: (7), (11) imply:
| | |   (12)  false
| | | 
| | | CLOSE: (12) is inconsistent.
| | | 
| | Case 2:
| | | 
| | |   (13)  1 >= all_0_3
| | | 
| | | THEORY_AXIOM GroebnerMultiplication: 
| | |   (14)  \forall int v0, v1; (3 < v1 | -2 < v0 | v0 * v0 != v1)
| | | 
| | | GROUND_INST: instantiating (14) with a, all_0_3, simplifying with (2)
| | |              gives:
| | |   (15)  3 < all_0_3 | -2 < a
| | | 
| | | BETA: splitting (15) gives:
| | | 
| | | Case 1:
| | | | 
| | | |   (16)  all_0_3 >= 4
| | | | 
| | | | COMBINE_INEQS: (7), (16) imply:
| | | |   (17)  false
| | | | 
| | | | CLOSE: (17) is inconsistent.
| | | | 
| | | Case 2:
| | | | 
| | | |   (18)  a >= -1
| | | | 
| | | | THEORY_AXIOM GroebnerMultiplication: 
| | | |   (19)  \forall int v0, v1; (3 < v1 | v0 < 2 | v0 * v0 != v1)
| | | | 
| | | | GROUND_INST: instantiating (19) with a, all_0_3, simplifying with (2)
| | | |              gives:
| | | |   (20)  3 < all_0_3 | a < 2
| | | | 
| | | | BETA: splitting (20) gives:
| | | | 
| | | | Case 1:
| | | | | 
| | | | |   (21)  all_0_3 >= 4
| | | | | 
| | | | | COMBINE_INEQS: (7), (21) imply:
| | | | |   (22)  false
| | | | | 
| | | | | CLOSE: (22) is inconsistent.
| | | | | 
| | | | Case 2:
| | | | | 
| | | | |   (23)  1 >= a
| | | | | 
| | | | | THEORY_AXIOM GroebnerMultiplication: 
| | | | |   (24)  \forall int v0, v1; (2*v0 - v1 < 2 | 1 < v0 | v0 * v0 != v1)
| | | | | 
| | | | | GROUND_INST: instantiating (24) with a, all_0_3, simplifying with (2)
| | | | |              gives:
| | | | |   (25)  2*a - all_0_3 < 2 | 1 < a
| | | | | 
| | | | | BETA: splitting (25) gives:
| | | | | 
| | | | | Case 1:
| | | | | | 
| | | | | |   (26)  a >= 2
| | | | | | 
| | | | | | COMBINE_INEQS: (23), (26) imply:
| | | | | |   (27)  false
| | | | | | 
| | | | | | CLOSE: (27) is inconsistent.
| | | | | | 
| | | | | Case 2:
| | | | | | 
| | | | | |   (28)  all_0_3 - 2*a >= -1
| | | | | | 
| | | | | | THEORY_AXIOM GroebnerMultiplication: 
| | | | | |   (29)  \forall int v0, v1; (-1*v1 + -2*v0 < 2 | v0 < -1 | v0 * v0
| | | | | |           != v1)
| | | | | | 
| | | | | | GROUND_INST: instantiating (29) with a, all_0_3, simplifying with
| | | | | |              (2) gives:
| | | | | |   (30)  -1*all_0_3 + -2*a < 2 | a < -1
| | | | | | 
| | | | | | BETA: splitting (30) gives:
| | | | | | 
| | | | | | Case 1:
| | | | | | | 
| | | | | | |   (31)  -2 >= a
| | | | | | | 
| | | | | | | COMBINE_INEQS: (18), (31) imply:
| | | | | | |   (32)  false
| | | | | | | 
| | | | | | | CLOSE: (32) is inconsistent.
| | | | | | | 
| | | | | | Case 2:
| | | | | | | 
| | | | | | |   (33)  all_0_3 + 2*a >= -1
| | | | | | | 
| | | | | | | COMBINE_INEQS: (13), (28) imply:
| | | | | | |   (34)  1 >= a
| | | | | | | 
| | | | | | | COMBINE_INEQS: (13), (33) imply:
| | | | | | |   (35)  a >= -1
| | | | | | | 
| | | | | | | BETA: splitting (8) gives:
| | | | | | | 
| | | | | | | Case 1:
| | | | | | | | 
| | | | | | | |   (36)  a >= 2
| | | | | | | | 
| | | | | | | | COMBINE_INEQS: (23), (36) imply:
| | | | | | | |   (37)  false
| | | | | | | | 
| | | | | | | | CLOSE: (37) is inconsistent.
| | | | | | | | 
| | | | | | | Case 2:
| | | | | | | | 
| | | | | | | |   (38)  -2 >= a
| | | | | | | | 
| | | | | | | | COMBINE_INEQS: (18), (38) imply:
| | | | | | | |   (39)  false
| | | | | | | | 
| | | | | | | | CLOSE: (39) is inconsistent.
| | | | | | | | 
| | | | | | | End of split
| | | | | | | 
| | | | | | End of split
| | | | | | 
| | | | | End of split
| | | | | 
| | | | End of split
| | | | 
| | | End of split
| | | 
| | End of split
| | 
| Case 2:
| | 
| |   (40)  (all_0_3 >= 4 & 1 >= a & a >= -1) | (all_0_3 * a = all_0_2 & ((10 >=
| |               all_0_2 & a >= 3) | (3 >= all_0_2 & a >= 2) | (all_0_2 >= 11 &
| |               2 >= a) | (all_0_2 >= 4 & 1 >= a) | (all_0_1 * a = all_0_0 &
| |               all_0_2 * a = all_0_1 & ((39 >= all_0_0 & a >= 3) | (all_0_0
| |                   >= 40 & 2 >= a)))))
| | 
| | BETA: splitting (40) gives:
| | 
| | Case 1:
| | | 
| | |   (41)  all_0_3 >= 4 & 1 >= a & a >= -1
| | | 
| | | ALPHA: (41) implies:
| | |   (42)  a >= -1
| | |   (43)  1 >= a
| | |   (44)  all_0_3 >= 4
| | | 
| | | THEORY_AXIOM GroebnerMultiplication: 
| | |   (45)  \forall int v0, v1; (v1 < 2 | 1 < v0 | v0 < -1 | v0 * v0 != v1)
| | | 
| | | GROUND_INST: instantiating (45) with a, all_0_3, simplifying with (2)
| | |              gives:
| | |   (46)  all_0_3 < 2 | 1 < a | a < -1
| | | 
| | | BETA: splitting (46) gives:
| | | 
| | | Case 1:
| | | | 
| | | |   (47)  a >= 2
| | | | 
| | | | COMBINE_INEQS: (43), (47) imply:
| | | |   (48)  false
| | | | 
| | | | CLOSE: (48) is inconsistent.
| | | | 
| | | Case 2:
| | | | 
| | | |   (49)  all_0_3 < 2 | a < -1
| | | | 
| | | | BETA: splitting (49) gives:
| | | | 
| | | | Case 1:
| | | | | 
| | | | |   (50)  -2 >= a
| | | | | 
| | | | | COMBINE_INEQS: (42), (50) imply:
| | | | |   (51)  false
| | | | | 
| | | | | CLOSE: (51) is inconsistent.
| | | | | 
| | | | Case 2:
| | | | | 
| | | | |   (52)  1 >= all_0_3
| | | | | 
| | | | | COMBINE_INEQS: (44), (52) imply:
| | | | |   (53)  false
| | | | | 
| | | | | CLOSE: (53) is inconsistent.
| | | | | 
| | | | End of split
| | | | 
| | | End of split
| | | 
| | Case 2:
| | | 
| | |   (54)  all_0_3 * a = all_0_2 & ((10 >= all_0_2 & a >= 3) | (3 >= all_0_2
| | |             & a >= 2) | (all_0_2 >= 11 & 2 >= a) | (all_0_2 >= 4 & 1 >= a)
| | |           | (all_0_1 * a = all_0_0 & all_0_2 * a = all_0_1 & ((39 >=
| | |                 all_0_0 & a >= 3) | (all_0_0 >= 40 & 2 >= a))))
| | | 
| | | ALPHA: (54) implies:
| | |   (55)  all_0_3 * a = all_0_2
| | |   (56)  (10 >= all_0_2 & a >= 3) | (3 >= all_0_2 & a >= 2) | (all_0_2 >=
| | |           11 & 2 >= a) | (all_0_2 >= 4 & 1 >= a) | (all_0_1 * a = all_0_0
| | |           & all_0_2 * a = all_0_1 & ((39 >= all_0_0 & a >= 3) | (all_0_0
| | |               >= 40 & 2 >= a)))
| | | 
| | | BETA: splitting (56) gives:
| | | 
| | | Case 1:
| | | | 
| | | |   (57)  (10 >= all_0_2 & a >= 3) | (3 >= all_0_2 & a >= 2)
| | | | 
| | | | BETA: splitting (57) gives:
| | | | 
| | | | Case 1:
| | | | | 
| | | | |   (58)  10 >= all_0_2 & a >= 3
| | | | | 
| | | | | ALPHA: (58) implies:
| | | | |   (59)  a >= 3
| | | | |   (60)  10 >= all_0_2
| | | | | 
| | | | | THEORY_AXIOM GroebnerMultiplication: 
| | | | |   (61)  \forall int v0, v1; (8 < v1 | v0 < 3 | v0 * v0 != v1)
| | | | | 
| | | | | GROUND_INST: instantiating (61) with a, all_0_3, simplifying with (2)
| | | | |              gives:
| | | | |   (62)  8 < all_0_3 | a < 3
| | | | | 
| | | | | BETA: splitting (62) gives:
| | | | | 
| | | | | Case 1:
| | | | | | 
| | | | | |   (63)  2 >= a
| | | | | | 
| | | | | | COMBINE_INEQS: (59), (63) imply:
| | | | | |   (64)  false
| | | | | | 
| | | | | | CLOSE: (64) is inconsistent.
| | | | | | 
| | | | | Case 2:
| | | | | | 
| | | | | |   (65)  all_0_3 >= 9
| | | | | | 
| | | | | | THEORY_AXIOM GroebnerMultiplication: 
| | | | | |   (66)  \forall int v0, v1, v2; (3*v1 - v2 < 1 | v1 < 0 | v0 < 3 |
| | | | | |           v1 * v0 != v2)
| | | | | | 
| | | | | | GROUND_INST: instantiating (66) with a, all_0_3, all_0_2,
| | | | | |              simplifying with (55) gives:
| | | | | |   (67)  3*all_0_3 - all_0_2 < 1 | all_0_3 < 0 | a < 3
| | | | | | 
| | | | | | BETA: splitting (67) gives:
| | | | | | 
| | | | | | Case 1:
| | | | | | | 
| | | | | | |   (68)  -1 >= all_0_3
| | | | | | | 
| | | | | | | COMBINE_INEQS: (5), (68) imply:
| | | | | | |   (69)  false
| | | | | | | 
| | | | | | | CLOSE: (69) is inconsistent.
| | | | | | | 
| | | | | | Case 2:
| | | | | | | 
| | | | | | |   (70)  3*all_0_3 - all_0_2 < 1 | a < 3
| | | | | | | 
| | | | | | | BETA: splitting (70) gives:
| | | | | | | 
| | | | | | | Case 1:
| | | | | | | | 
| | | | | | | |   (71)  2 >= a
| | | | | | | | 
| | | | | | | | COMBINE_INEQS: (59), (71) imply:
| | | | | | | |   (72)  false
| | | | | | | | 
| | | | | | | | CLOSE: (72) is inconsistent.
| | | | | | | | 
| | | | | | | Case 2:
| | | | | | | | 
| | | | | | | |   (73)  all_0_2 >= 3*all_0_3
| | | | | | | | 
| | | | | | | | COMBINE_INEQS: (60), (73) imply:
| | | | | | | |   (74)  3 >= all_0_3
| | | | | | | | 
| | | | | | | | SIMP: (74) implies:
| | | | | | | |   (75)  3 >= all_0_3
| | | | | | | | 
| | | | | | | | COMBINE_INEQS: (65), (75) imply:
| | | | | | | |   (76)  false
| | | | | | | | 
| | | | | | | | CLOSE: (76) is inconsistent.
| | | | | | | | 
| | | | | | | End of split
| | | | | | | 
| | | | | | End of split
| | | | | | 
| | | | | End of split
| | | | | 
| | | | Case 2:
| | | | | 
| | | | |   (77)  3 >= all_0_2 & a >= 2
| | | | | 
| | | | | ALPHA: (77) implies:
| | | | |   (78)  a >= 2
| | | | |   (79)  3 >= all_0_2
| | | | | 
| | | | | THEORY_AXIOM GroebnerMultiplication: 
| | | | |   (80)  \forall int v0, v1; (3 < v1 | v0 < 2 | v0 * v0 != v1)
| | | | | 
| | | | | GROUND_INST: instantiating (80) with a, all_0_3, simplifying with (2)
| | | | |              gives:
| | | | |   (81)  3 < all_0_3 | a < 2
| | | | | 
| | | | | BETA: splitting (81) gives:
| | | | | 
| | | | | Case 1:
| | | | | | 
| | | | | |   (82)  1 >= a
| | | | | | 
| | | | | | COMBINE_INEQS: (78), (82) imply:
| | | | | |   (83)  false
| | | | | | 
| | | | | | CLOSE: (83) is inconsistent.
| | | | | | 
| | | | | Case 2:
| | | | | | 
| | | | | |   (84)  all_0_3 >= 4
| | | | | | 
| | | | | | THEORY_AXIOM GroebnerMultiplication: 
| | | | | |   (85)  \forall int v0, v1, v2; (2*v1 - v2 < 1 | v1 < 0 | v0 < 2 |
| | | | | |           v1 * v0 != v2)
| | | | | | 
| | | | | | GROUND_INST: instantiating (85) with a, all_0_3, all_0_2,
| | | | | |              simplifying with (55) gives:
| | | | | |   (86)  2*all_0_3 - all_0_2 < 1 | all_0_3 < 0 | a < 2
| | | | | | 
| | | | | | BETA: splitting (86) gives:
| | | | | | 
| | | | | | Case 1:
| | | | | | | 
| | | | | | |   (87)  -1 >= all_0_3
| | | | | | | 
| | | | | | | COMBINE_INEQS: (5), (87) imply:
| | | | | | |   (88)  false
| | | | | | | 
| | | | | | | CLOSE: (88) is inconsistent.
| | | | | | | 
| | | | | | Case 2:
| | | | | | | 
| | | | | | |   (89)  2*all_0_3 - all_0_2 < 1 | a < 2
| | | | | | | 
| | | | | | | BETA: splitting (89) gives:
| | | | | | | 
| | | | | | | Case 1:
| | | | | | | | 
| | | | | | | |   (90)  1 >= a
| | | | | | | | 
| | | | | | | | COMBINE_INEQS: (78), (90) imply:
| | | | | | | |   (91)  false
| | | | | | | | 
| | | | | | | | CLOSE: (91) is inconsistent.
| | | | | | | | 
| | | | | | | Case 2:
| | | | | | | | 
| | | | | | | |   (92)  all_0_2 >= 2*all_0_3
| | | | | | | | 
| | | | | | | | COMBINE_INEQS: (79), (92) imply:
| | | | | | | |   (93)  1 >= all_0_3
| | | | | | | | 
| | | | | | | | SIMP: (93) implies:
| | | | | | | |   (94)  1 >= all_0_3
| | | | | | | | 
| | | | | | | | COMBINE_INEQS: (84), (94) imply:
| | | | | | | |   (95)  false
| | | | | | | | 
| | | | | | | | CLOSE: (95) is inconsistent.
| | | | | | | | 
| | | | | | | End of split
| | | | | | | 
| | | | | | End of split
| | | | | | 
| | | | | End of split
| | | | | 
| | | | End of split
| | | | 
| | | Case 2:
| | | | 
| | | |   (96)  (all_0_2 >= 11 & 2 >= a) | (all_0_2 >= 4 & 1 >= a) | (all_0_1 *
| | | |           a = all_0_0 & all_0_2 * a = all_0_1 & ((39 >= all_0_0 & a >=
| | | |               3) | (all_0_0 >= 40 & 2 >= a)))
| | | | 
| | | | BETA: splitting (96) gives:
| | | | 
| | | | Case 1:
| | | | | 
| | | | |   (97)  all_0_2 >= 11 & 2 >= a
| | | | | 
| | | | | ALPHA: (97) implies:
| | | | |   (98)  2 >= a
| | | | |   (99)  all_0_2 >= 11
| | | | | 
| | | | | THEORY_AXIOM GroebnerMultiplication: 
| | | | |   (100)  \forall int v0, v1, v2; (v2 < 9 | 2 < v0 | v1 * v0 != v2 | v0
| | | | |            * v0 != v1)
| | | | | 
| | | | | GROUND_INST: instantiating (100) with a, all_0_3, all_0_2, simplifying
| | | | |              with (2), (55) gives:
| | | | |   (101)  all_0_2 < 9 | 2 < a
| | | | | 
| | | | | BETA: splitting (101) gives:
| | | | | 
| | | | | Case 1:
| | | | | | 
| | | | | |   (102)  a >= 3
| | | | | | 
| | | | | | COMBINE_INEQS: (98), (102) imply:
| | | | | |   (103)  false
| | | | | | 
| | | | | | CLOSE: (103) is inconsistent.
| | | | | | 
| | | | | Case 2:
| | | | | | 
| | | | | |   (104)  8 >= all_0_2
| | | | | | 
| | | | | | COMBINE_INEQS: (99), (104) imply:
| | | | | |   (105)  false
| | | | | | 
| | | | | | CLOSE: (105) is inconsistent.
| | | | | | 
| | | | | End of split
| | | | | 
| | | | Case 2:
| | | | | 
| | | | |   (106)  (all_0_2 >= 4 & 1 >= a) | (all_0_1 * a = all_0_0 & all_0_2 *
| | | | |            a = all_0_1 & ((39 >= all_0_0 & a >= 3) | (all_0_0 >= 40 &
| | | | |                2 >= a)))
| | | | | 
| | | | | BETA: splitting (106) gives:
| | | | | 
| | | | | Case 1:
| | | | | | 
| | | | | |   (107)  all_0_2 >= 4 & 1 >= a
| | | | | | 
| | | | | | ALPHA: (107) implies:
| | | | | |   (108)  1 >= a
| | | | | |   (109)  all_0_2 >= 4
| | | | | | 
| | | | | | THEORY_AXIOM GroebnerMultiplication: 
| | | | | |   (110)  \forall int v0, v1, v2; (v2 < 2 | 1 < v0 | v1 * v0 != v2 |
| | | | | |            v0 * v0 != v1)
| | | | | | 
| | | | | | GROUND_INST: instantiating (110) with a, all_0_3, all_0_2,
| | | | | |              simplifying with (2), (55) gives:
| | | | | |   (111)  all_0_2 < 2 | 1 < a
| | | | | | 
| | | | | | BETA: splitting (111) gives:
| | | | | | 
| | | | | | Case 1:
| | | | | | | 
| | | | | | |   (112)  a >= 2
| | | | | | | 
| | | | | | | COMBINE_INEQS: (108), (112) imply:
| | | | | | |   (113)  false
| | | | | | | 
| | | | | | | CLOSE: (113) is inconsistent.
| | | | | | | 
| | | | | | Case 2:
| | | | | | | 
| | | | | | |   (114)  1 >= all_0_2
| | | | | | | 
| | | | | | | COMBINE_INEQS: (109), (114) imply:
| | | | | | |   (115)  false
| | | | | | | 
| | | | | | | CLOSE: (115) is inconsistent.
| | | | | | | 
| | | | | | End of split
| | | | | | 
| | | | | Case 2:
| | | | | | 
| | | | | |   (116)  all_0_1 * a = all_0_0 & all_0_2 * a = all_0_1 & ((39 >=
| | | | | |              all_0_0 & a >= 3) | (all_0_0 >= 40 & 2 >= a))
| | | | | | 
| | | | | | ALPHA: (116) implies:
| | | | | |   (117)  all_0_2 * a = all_0_1
| | | | | |   (118)  all_0_1 * a = all_0_0
| | | | | |   (119)  (39 >= all_0_0 & a >= 3) | (all_0_0 >= 40 & 2 >= a)
| | | | | | 
| | | | | | BETA: splitting (119) gives:
| | | | | | 
| | | | | | Case 1:
| | | | | | | 
| | | | | | |   (120)  39 >= all_0_0 & a >= 3
| | | | | | | 
| | | | | | | ALPHA: (120) implies:
| | | | | | |   (121)  a >= 3
| | | | | | |   (122)  39 >= all_0_0
| | | | | | | 
| | | | | | | THEORY_AXIOM GroebnerMultiplication: 
| | | | | | |   (123)  \forall int v0, v1, v2, v3; (39 < v3 | v1 < 6 | v0 < 3 |
| | | | | | |            v2 * v0 != v3 | v1 * v0 != v2)
| | | | | | | 
| | | | | | | GROUND_INST: instantiating (123) with a, all_0_2, all_0_1,
| | | | | | |              all_0_0, simplifying with (117), (118) gives:
| | | | | | |   (124)  39 < all_0_0 | all_0_2 < 6 | a < 3
| | | | | | | 
| | | | | | | BETA: splitting (124) gives:
| | | | | | | 
| | | | | | | Case 1:
| | | | | | | | 
| | | | | | | |   (125)  all_0_0 >= 40
| | | | | | | | 
| | | | | | | | COMBINE_INEQS: (122), (125) imply:
| | | | | | | |   (126)  false
| | | | | | | | 
| | | | | | | | CLOSE: (126) is inconsistent.
| | | | | | | | 
| | | | | | | Case 2:
| | | | | | | | 
| | | | | | | |   (127)  all_0_2 < 6 | a < 3
| | | | | | | | 
| | | | | | | | BETA: splitting (127) gives:
| | | | | | | | 
| | | | | | | | Case 1:
| | | | | | | | | 
| | | | | | | | |   (128)  2 >= a
| | | | | | | | | 
| | | | | | | | | COMBINE_INEQS: (121), (128) imply:
| | | | | | | | |   (129)  false
| | | | | | | | | 
| | | | | | | | | CLOSE: (129) is inconsistent.
| | | | | | | | | 
| | | | | | | | Case 2:
| | | | | | | | | 
| | | | | | | | |   (130)  5 >= all_0_2
| | | | | | | | | 
| | | | | | | | | THEORY_AXIOM GroebnerMultiplication: 
| | | | | | | | |   (131)  \forall int v0, v1; (8 < v1 | v0 < 3 | v0 * v0 != v1)
| | | | | | | | | 
| | | | | | | | | GROUND_INST: instantiating (131) with a, all_0_3, simplifying
| | | | | | | | |              with (2) gives:
| | | | | | | | |   (132)  8 < all_0_3 | a < 3
| | | | | | | | | 
| | | | | | | | | BETA: splitting (132) gives:
| | | | | | | | | 
| | | | | | | | | Case 1:
| | | | | | | | | | 
| | | | | | | | | |   (133)  2 >= a
| | | | | | | | | | 
| | | | | | | | | | COMBINE_INEQS: (121), (133) imply:
| | | | | | | | | |   (134)  false
| | | | | | | | | | 
| | | | | | | | | | CLOSE: (134) is inconsistent.
| | | | | | | | | | 
| | | | | | | | | Case 2:
| | | | | | | | | | 
| | | | | | | | | |   (135)  all_0_3 >= 9
| | | | | | | | | | 
| | | | | | | | | | THEORY_AXIOM GroebnerMultiplication: 
| | | | | | | | | |   (136)  \forall int v0, v1, v2; (3*v1 - v2 < 1 | v1 < 0 |
| | | | | | | | | |            v0 < 3 | v1 * v0 != v2)
| | | | | | | | | | 
| | | | | | | | | | GROUND_INST: instantiating (136) with a, all_0_3, all_0_2,
| | | | | | | | | |              simplifying with (55) gives:
| | | | | | | | | |   (137)  3*all_0_3 - all_0_2 < 1 | all_0_3 < 0 | a < 3
| | | | | | | | | | 
| | | | | | | | | | BETA: splitting (137) gives:
| | | | | | | | | | 
| | | | | | | | | | Case 1:
| | | | | | | | | | | 
| | | | | | | | | | |   (138)  -1 >= all_0_3
| | | | | | | | | | | 
| | | | | | | | | | | COMBINE_INEQS: (5), (138) imply:
| | | | | | | | | | |   (139)  false
| | | | | | | | | | | 
| | | | | | | | | | | CLOSE: (139) is inconsistent.
| | | | | | | | | | | 
| | | | | | | | | | Case 2:
| | | | | | | | | | | 
| | | | | | | | | | |   (140)  3*all_0_3 - all_0_2 < 1 | a < 3
| | | | | | | | | | | 
| | | | | | | | | | | BETA: splitting (140) gives:
| | | | | | | | | | | 
| | | | | | | | | | | Case 1:
| | | | | | | | | | | | 
| | | | | | | | | | | |   (141)  2 >= a
| | | | | | | | | | | | 
| | | | | | | | | | | | COMBINE_INEQS: (121), (141) imply:
| | | | | | | | | | | |   (142)  false
| | | | | | | | | | | | 
| | | | | | | | | | | | CLOSE: (142) is inconsistent.
| | | | | | | | | | | | 
| | | | | | | | | | | Case 2:
| | | | | | | | | | | | 
| | | | | | | | | | | |   (143)  all_0_2 >= 3*all_0_3
| | | | | | | | | | | | 
| | | | | | | | | | | | COMBINE_INEQS: (130), (143) imply:
| | | | | | | | | | | |   (144)  1 >= all_0_3
| | | | | | | | | | | | 
| | | | | | | | | | | | SIMP: (144) implies:
| | | | | | | | | | | |   (145)  1 >= all_0_3
| | | | | | | | | | | | 
| | | | | | | | | | | | COMBINE_INEQS: (135), (145) imply:
| | | | | | | | | | | |   (146)  false
| | | | | | | | | | | | 
| | | | | | | | | | | | CLOSE: (146) is inconsistent.
| | | | | | | | | | | | 
| | | | | | | | | | | End of split
| | | | | | | | | | | 
| | | | | | | | | | End of split
| | | | | | | | | | 
| | | | | | | | | End of split
| | | | | | | | | 
| | | | | | | | End of split
| | | | | | | | 
| | | | | | | End of split
| | | | | | | 
| | | | | | Case 2:
| | | | | | | 
| | | | | | |   (147)  all_0_0 >= 40 & 2 >= a
| | | | | | | 
| | | | | | | ALPHA: (147) implies:
| | | | | | |   (148)  2 >= a
| | | | | | |   (149)  all_0_0 >= 40
| | | | | | | 
| | | | | | | THEORY_AXIOM GroebnerMultiplication: 
| | | | | | |   (150)  \forall int v0, v1, v2; (v2 < 9 | 2 < v0 | v1 * v0 != v2
| | | | | | |            | v0 * v0 != v1)
| | | | | | | 
| | | | | | | GROUND_INST: instantiating (150) with a, all_0_3, all_0_2,
| | | | | | |              simplifying with (2), (55) gives:
| | | | | | |   (151)  all_0_2 < 9 | 2 < a
| | | | | | | 
| | | | | | | BETA: splitting (151) gives:
| | | | | | | 
| | | | | | | Case 1:
| | | | | | | | 
| | | | | | | |   (152)  a >= 3
| | | | | | | | 
| | | | | | | | COMBINE_INEQS: (148), (152) imply:
| | | | | | | |   (153)  false
| | | | | | | | 
| | | | | | | | CLOSE: (153) is inconsistent.
| | | | | | | | 
| | | | | | | Case 2:
| | | | | | | | 
| | | | | | | |   (154)  8 >= all_0_2
| | | | | | | | 
| | | | | | | | THEORY_AXIOM GroebnerMultiplication: 
| | | | | | | |   (155)  \forall int v0, v1, v2; (v2 - 2*v1 < 1 | v1 < 0 | 2 <
| | | | | | | |            v0 | v1 * v0 != v2)
| | | | | | | | 
| | | | | | | | GROUND_INST: instantiating (155) with a, all_0_3, all_0_2,
| | | | | | | |              simplifying with (55) gives:
| | | | | | | |   (156)  all_0_2 - 2*all_0_3 < 1 | all_0_3 < 0 | 2 < a
| | | | | | | | 
| | | | | | | | BETA: splitting (156) gives:
| | | | | | | | 
| | | | | | | | Case 1:
| | | | | | | | | 
| | | | | | | | |   (157)  -1 >= all_0_3
| | | | | | | | | 
| | | | | | | | | COMBINE_INEQS: (5), (157) imply:
| | | | | | | | |   (158)  false
| | | | | | | | | 
| | | | | | | | | CLOSE: (158) is inconsistent.
| | | | | | | | | 
| | | | | | | | Case 2:
| | | | | | | | | 
| | | | | | | | |   (159)  all_0_2 - 2*all_0_3 < 1 | 2 < a
| | | | | | | | | 
| | | | | | | | | BETA: splitting (159) gives:
| | | | | | | | | 
| | | | | | | | | Case 1:
| | | | | | | | | | 
| | | | | | | | | |   (160)  a >= 3
| | | | | | | | | | 
| | | | | | | | | | COMBINE_INEQS: (148), (160) imply:
| | | | | | | | | |   (161)  false
| | | | | | | | | | 
| | | | | | | | | | CLOSE: (161) is inconsistent.
| | | | | | | | | | 
| | | | | | | | | Case 2:
| | | | | | | | | | 
| | | | | | | | | |   (162)  2*all_0_3 >= all_0_2
| | | | | | | | | | 
| | | | | | | | | | THEORY_AXIOM GroebnerMultiplication: 
| | | | | | | | | |   (163)  \forall int v0, v1, v2, v3; (4*v2 - v3 - 4*v1 < 1 |
| | | | | | | | | |            2*v1 < v2 | 2 < v0 | v2 * v0 != v3 | v1 * v0 !=
| | | | | | | | | |            v2)
| | | | | | | | | | 
| | | | | | | | | | GROUND_INST: instantiating (163) with a, all_0_3, all_0_2,
| | | | | | | | | |              all_0_1, simplifying with (55), (117) gives:
| | | | | | | | | |   (164)  4*all_0_2 - all_0_1 - 4*all_0_3 < 1 | 2*all_0_3 <
| | | | | | | | | |          all_0_2 | 2 < a
| | | | | | | | | | 
| | | | | | | | | | BETA: splitting (164) gives:
| | | | | | | | | | 
| | | | | | | | | | Case 1:
| | | | | | | | | | | 
| | | | | | | | | | |   (165)  all_0_2 - 2*all_0_3 >= 1
| | | | | | | | | | | 
| | | | | | | | | | | COMBINE_INEQS: (162), (165) imply:
| | | | | | | | | | |   (166)  false
| | | | | | | | | | | 
| | | | | | | | | | | CLOSE: (166) is inconsistent.
| | | | | | | | | | | 
| | | | | | | | | | Case 2:
| | | | | | | | | | | 
| | | | | | | | | | |   (167)  4*all_0_2 - all_0_1 - 4*all_0_3 < 1 | 2 < a
| | | | | | | | | | | 
| | | | | | | | | | | BETA: splitting (167) gives:
| | | | | | | | | | | 
| | | | | | | | | | | Case 1:
| | | | | | | | | | | | 
| | | | | | | | | | | |   (168)  a >= 3
| | | | | | | | | | | | 
| | | | | | | | | | | | COMBINE_INEQS: (148), (168) imply:
| | | | | | | | | | | |   (169)  false
| | | | | | | | | | | | 
| | | | | | | | | | | | CLOSE: (169) is inconsistent.
| | | | | | | | | | | | 
| | | | | | | | | | | Case 2:
| | | | | | | | | | | | 
| | | | | | | | | | | |   (170)  all_0_1 - 4*all_0_2 >= -4*all_0_3
| | | | | | | | | | | | 
| | | | | | | | | | | | THEORY_AXIOM GroebnerMultiplication: 
| | | | | | | | | | | |   (171)  \forall int v0, v1, v2, v3, v4; (v4 - 6*v3 + 12*v2
| | | | | | | | | | | |            - 8*v1 < 1 | v3 - 4*v2 < -4*v1 | 2 < v0 | v3 *
| | | | | | | | | | | |            v0 != v4 | v2 * v0 != v3 | v1 * v0 != v2)
| | | | | | | | | | | | 
| | | | | | | | | | | | GROUND_INST: instantiating (171) with a, all_0_3, all_0_2,
| | | | | | | | | | | |              all_0_1, all_0_0, simplifying with (55), (117),
| | | | | | | | | | | |              (118) gives:
| | | | | | | | | | | |   (172)  all_0_0 - 6*all_0_1 + 12*all_0_2 - 8*all_0_3 < 1 |
| | | | | | | | | | | |          all_0_1 - 4*all_0_2 < -4*all_0_3 | 2 < a
| | | | | | | | | | | | 
| | | | | | | | | | | | BETA: splitting (172) gives:
| | | | | | | | | | | | 
| | | | | | | | | | | | Case 1:
| | | | | | | | | | | | | 
| | | | | | | | | | | | |   (173)  4*all_0_2 - all_0_1 - 4*all_0_3 >= 1
| | | | | | | | | | | | | 
| | | | | | | | | | | | | COMBINE_INEQS: (170), (173) imply:
| | | | | | | | | | | | |   (174)  false
| | | | | | | | | | | | | 
| | | | | | | | | | | | | CLOSE: (174) is inconsistent.
| | | | | | | | | | | | | 
| | | | | | | | | | | | Case 2:
| | | | | | | | | | | | | 
| | | | | | | | | | | | |   (175)  all_0_0 - 6*all_0_1 + 12*all_0_2 - 8*all_0_3 < 1 |
| | | | | | | | | | | | |          2 < a
| | | | | | | | | | | | | 
| | | | | | | | | | | | | BETA: splitting (175) gives:
| | | | | | | | | | | | | 
| | | | | | | | | | | | | Case 1:
| | | | | | | | | | | | | | 
| | | | | | | | | | | | | |   (176)  a >= 3
| | | | | | | | | | | | | | 
| | | | | | | | | | | | | | COMBINE_INEQS: (148), (176) imply:
| | | | | | | | | | | | | |   (177)  false
| | | | | | | | | | | | | | 
| | | | | | | | | | | | | | CLOSE: (177) is inconsistent.
| | | | | | | | | | | | | | 
| | | | | | | | | | | | | Case 2:
| | | | | | | | | | | | | | 
| | | | | | | | | | | | | |   (178)  6*all_0_1 - all_0_0 - 12*all_0_2 >= -8*all_0_3
| | | | | | | | | | | | | | 
| | | | | | | | | | | | | | CUT: with 0 >= all_0_1:
| | | | | | | | | | | | | | 
| | | | | | | | | | | | | | Case 1:
| | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | |   (179)  0 >= all_0_1
| | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | THEORY_AXIOM GroebnerMultiplication: 
| | | | | | | | | | | | | | |   (180)  \forall int v0, v1, v2, v3, v4; (v4 < 40 | 0 < v3
| | | | | | | | | | | | | | |            | v1 < 0 | v3 * v0 != v4 | v2 * v0 != v3 | v1 *
| | | | | | | | | | | | | | |            v0 != v2)
| | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | GROUND_INST: instantiating (180) with a, all_0_3, all_0_2,
| | | | | | | | | | | | | | |              all_0_1, all_0_0, simplifying with (55), (117),
| | | | | | | | | | | | | | |              (118) gives:
| | | | | | | | | | | | | | |   (181)  all_0_0 < 40 | 0 < all_0_1 | all_0_3 < 0
| | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | BETA: splitting (181) gives:
| | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | Case 1:
| | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | |   (182)  all_0_0 < 40 | 0 < all_0_1
| | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | BETA: splitting (182) gives:
| | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | Case 1:
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | |   (183)  39 >= all_0_0
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | COMBINE_INEQS: (149), (183) imply:
| | | | | | | | | | | | | | | | |   (184)  false
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | CLOSE: (184) is inconsistent.
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | Case 2:
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | |   (185)  all_0_1 >= 1
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | COMBINE_INEQS: (179), (185) imply:
| | | | | | | | | | | | | | | | |   (186)  false
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | CLOSE: (186) is inconsistent.
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | End of split
| | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | Case 2:
| | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | |   (187)  all_0_0 < 1 | all_0_3 < 0
| | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | BETA: splitting (187) gives:
| | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | Case 1:
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | |   (188)  -1 >= all_0_3
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | COMBINE_INEQS: (5), (188) imply:
| | | | | | | | | | | | | | | | |   (189)  false
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | CLOSE: (189) is inconsistent.
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | Case 2:
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | |   (190)  0 >= all_0_0
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | COMBINE_INEQS: (149), (190) imply:
| | | | | | | | | | | | | | | | |   (191)  false
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | CLOSE: (191) is inconsistent.
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | End of split
| | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | End of split
| | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | Case 2:
| | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | |   (192)  all_0_1 >= 1
| | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | THEORY_AXIOM GroebnerMultiplication: 
| | | | | | | | | | | | | | |   (193)  \forall int v0, v1, v2, v3, v4; (6*v3 - v4 - 12*v2
| | | | | | | | | | | | | | |            < -8*v1 | v4 < 40 | v3 < 1 | 8 < v2 | 2 < v0 |
| | | | | | | | | | | | | | |            v3 * v0 != v4 | v2 * v0 != v3 | v0 * v0 != v1)
| | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | GROUND_INST: instantiating (193) with a, all_0_3, all_0_2,
| | | | | | | | | | | | | | |              all_0_1, all_0_0, simplifying with (2), (117),
| | | | | | | | | | | | | | |              (118) gives:
| | | | | | | | | | | | | | |   (194)  6*all_0_1 - all_0_0 - 12*all_0_2 < -8*all_0_3 |
| | | | | | | | | | | | | | |          all_0_0 < 40 | all_0_1 < 1 | 8 < all_0_2 | 2 < a
| | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | BETA: splitting (194) gives:
| | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | Case 1:
| | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | |   (195)  6*all_0_1 - all_0_0 - 12*all_0_2 < -8*all_0_3 |
| | | | | | | | | | | | | | | |          all_0_0 < 40 | all_0_1 < 1
| | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | BETA: splitting (195) gives:
| | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | Case 1:
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | |   (196)  all_0_0 - 6*all_0_1 + 12*all_0_2 - 8*all_0_3 >= 1
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | COMBINE_INEQS: (178), (196) imply:
| | | | | | | | | | | | | | | | |   (197)  false
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | CLOSE: (197) is inconsistent.
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | Case 2:
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | |   (198)  all_0_0 < 40 | all_0_1 < 1
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | BETA: splitting (198) gives:
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | Case 1:
| | | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | |   (199)  39 >= all_0_0
| | | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | | COMBINE_INEQS: (149), (199) imply:
| | | | | | | | | | | | | | | | | |   (200)  false
| | | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | | CLOSE: (200) is inconsistent.
| | | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | Case 2:
| | | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | |   (201)  0 >= all_0_1
| | | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | | COMBINE_INEQS: (192), (201) imply:
| | | | | | | | | | | | | | | | | |   (202)  false
| | | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | | CLOSE: (202) is inconsistent.
| | | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | End of split
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | End of split
| | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | Case 2:
| | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | |   (203)  all_0_0 < 33 | 8 < all_0_2 | 2 < a
| | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | BETA: splitting (203) gives:
| | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | Case 1:
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | |   (204)  all_0_2 >= 9
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | COMBINE_INEQS: (154), (204) imply:
| | | | | | | | | | | | | | | | |   (205)  false
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | CLOSE: (205) is inconsistent.
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | Case 2:
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | |   (206)  all_0_0 < 33 | 2 < a
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | BETA: splitting (206) gives:
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | Case 1:
| | | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | |   (207)  a >= 3
| | | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | | COMBINE_INEQS: (148), (207) imply:
| | | | | | | | | | | | | | | | | |   (208)  false
| | | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | | CLOSE: (208) is inconsistent.
| | | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | Case 2:
| | | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | |   (209)  32 >= all_0_0
| | | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | | COMBINE_INEQS: (149), (209) imply:
| | | | | | | | | | | | | | | | | |   (210)  false
| | | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | | CLOSE: (210) is inconsistent.
| | | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | | End of split
| | | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | | End of split
| | | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | | End of split
| | | | | | | | | | | | | | | 
| | | | | | | | | | | | | | End of split
| | | | | | | | | | | | | | 
| | | | | | | | | | | | | End of split
| | | | | | | | | | | | | 
| | | | | | | | | | | | End of split
| | | | | | | | | | | | 
| | | | | | | | | | | End of split
| | | | | | | | | | | 
| | | | | | | | | | End of split
| | | | | | | | | | 
| | | | | | | | | End of split
| | | | | | | | | 
| | | | | | | | End of split
| | | | | | | | 
| | | | | | | End of split
| | | | | | | 
| | | | | | End of split
| | | | | | 
| | | | | End of split
| | | | | 
| | | | End of split
| | | | 
| | | End of split
| | | 
| | End of split
| | 
| End of split
| 
End of proof

Loading quadraticInEq5.pri ...
Preprocessing ...
Constructing countermodel ...
Found proof (size 14)

VALID

Assumptions after simplification:
---------------------------------

  (input)
  \exists int v0; (-1*v0 + -7*a >= -3 & a >= 0 & y >= 2 & x >= 2 & 3*x * y = v0)

Those formulas are unsatisfiable:
---------------------------------

Begin of proof
| 
| DELTA: instantiating (input) with fresh symbol all_0_0 gives:
|   (1)  -1*all_0_0 + -7*a >= -3 & a >= 0 & y >= 2 & x >= 2 & 3*x * y = all_0_0
| 
| ALPHA: (1) implies:
|   (2)  x >= 2
|   (3)  y >= 2
|   (4)  a >= 0
|   (5)  -1*all_0_0 + -7*a >= -3
|   (6)  3*x * y = all_0_0
| 
| THEORY_AXIOM GroebnerMultiplication: 
|   (7)  \forall int v0, v1, v2; (11 < v2 | v1 < 2 | v0 < 2 | 3*v0 * v1 != v2)
| 
| GROUND_INST: instantiating (7) with x, y, all_0_0, simplifying with (6) gives:
|   (8)  11 < all_0_0 | y < 2 | x < 2
| 
| BETA: splitting (8) gives:
| 
| Case 1:
| | 
| |   (9)  1 >= y
| | 
| | COMBINE_INEQS: (3), (9) imply:
| |   (10)  false
| | 
| | CLOSE: (10) is inconsistent.
| | 
| Case 2:
| | 
| |   (11)  11 < all_0_0 | x < 2
| | 
| | BETA: splitting (11) gives:
| | 
| | Case 1:
| | | 
| | |   (12)  1 >= x
| | | 
| | | COMBINE_INEQS: (2), (12) imply:
| | |   (13)  false
| | | 
| | | CLOSE: (13) is inconsistent.
| | | 
| | Case 2:
| | | 
| | |   (14)  all_0_0 >= 12
| | | 
| | | COMBINE_INEQS: (5), (14) imply:
| | |   (15)  -2 >= a
| | | 
| | | SIMP: (15) implies:
| | |   (16)  -2 >= a
| | | 
| | | COMBINE_INEQS: (4), (16) imply:
| | |   (17)  false
| | | 
| | | CLOSE: (17) is inconsistent.
| | | 
| | End of split
| | 
| End of split
| 
End of proof

