TSTP Solution File: ARI663_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : ARI663_1 : TPTP v8.1.2. Released v6.3.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n031.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Aug 30 17:48:44 EDT 2023
% Result : Theorem 3.17s 1.22s
% Output : Proof 4.24s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : ARI663_1 : TPTP v8.1.2. Released v6.3.0.
% 0.07/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.35 % Computer : n031.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 29 18:37:56 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.65/0.63 ________ _____
% 0.65/0.63 ___ __ \_________(_)________________________________
% 0.65/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.65/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.65/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.65/0.63
% 0.65/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.65/0.63 (2023-06-19)
% 0.65/0.63
% 0.65/0.63 (c) Philipp Rümmer, 2009-2023
% 0.65/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.65/0.63 Amanda Stjerna.
% 0.65/0.63 Free software under BSD-3-Clause.
% 0.65/0.63
% 0.65/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.65/0.63
% 0.65/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.65/0.64 Running up to 7 provers in parallel.
% 0.65/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.65/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.65/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.65/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.65/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.65/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.65/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.09/1.01 Prover 4: Preprocessing ...
% 2.09/1.01 Prover 0: Preprocessing ...
% 2.09/1.01 Prover 2: Preprocessing ...
% 2.09/1.01 Prover 1: Preprocessing ...
% 2.09/1.01 Prover 5: Preprocessing ...
% 2.09/1.01 Prover 6: Preprocessing ...
% 2.09/1.02 Prover 3: Preprocessing ...
% 2.60/1.07 Prover 3: Constructing countermodel ...
% 2.60/1.07 Prover 4: Constructing countermodel ...
% 2.60/1.07 Prover 6: Constructing countermodel ...
% 2.60/1.07 Prover 5: Constructing countermodel ...
% 2.60/1.07 Prover 0: Constructing countermodel ...
% 2.60/1.07 Prover 2: Constructing countermodel ...
% 2.60/1.07 Prover 1: Constructing countermodel ...
% 3.17/1.22 Prover 5: proved (568ms)
% 3.17/1.22 Prover 6: proved (568ms)
% 3.17/1.22 Prover 3: proved (570ms)
% 3.17/1.22 Prover 2: proved (574ms)
% 3.17/1.22 Prover 0: proved (571ms)
% 3.17/1.22
% 3.17/1.22 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.17/1.22
% 3.17/1.22
% 3.17/1.22 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.17/1.22
% 3.17/1.23
% 3.17/1.23 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.17/1.23
% 3.17/1.23
% 3.17/1.23 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.17/1.23
% 3.17/1.23
% 3.17/1.23 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.17/1.23
% 3.17/1.24 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.17/1.24 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.17/1.24 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.17/1.24 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.17/1.24 Prover 8: Preprocessing ...
% 3.17/1.24 Prover 11: Preprocessing ...
% 3.17/1.24 Prover 7: Preprocessing ...
% 3.17/1.24 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.17/1.24 Prover 10: Preprocessing ...
% 3.17/1.25 Prover 7: Constructing countermodel ...
% 3.17/1.25 Prover 8: Constructing countermodel ...
% 3.17/1.25 Prover 10: Constructing countermodel ...
% 3.78/1.25 Prover 11: Constructing countermodel ...
% 3.78/1.25 Prover 13: Preprocessing ...
% 3.78/1.26 Prover 13: Constructing countermodel ...
% 3.78/1.28 Prover 4: Found proof (size 55)
% 3.78/1.28 Prover 4: proved (635ms)
% 3.78/1.28 Prover 11: stopped
% 3.78/1.28 Prover 10: stopped
% 3.78/1.29 Prover 7: stopped
% 3.78/1.29 Prover 13: stopped
% 4.06/1.29 Prover 8: stopped
% 4.06/1.29 Prover 1: Found proof (size 55)
% 4.06/1.29 Prover 1: proved (640ms)
% 4.06/1.29
% 4.06/1.29 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.06/1.29
% 4.06/1.30 % SZS output start Proof for theBenchmark
% 4.06/1.30 Assumptions after simplification:
% 4.06/1.30 ---------------------------------
% 4.06/1.30
% 4.06/1.30 (conj)
% 4.06/1.31 $product(a, b) = 15
% 4.06/1.31
% 4.06/1.31 (conj_001)
% 4.06/1.31 a = 0 | ~ ($lesseq(a, 15)) | ~ ($lesseq(-15, a))
% 4.06/1.31
% 4.06/1.31 Those formulas are unsatisfiable:
% 4.06/1.31 ---------------------------------
% 4.06/1.31
% 4.06/1.31 Begin of proof
% 4.06/1.31 |
% 4.06/1.31 | THEORY_AXIOM GroebnerMultiplication:
% 4.06/1.31 | (1) ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(v1, -16)) | ~ ($product(v0,
% 4.06/1.31 | v1) = 15))
% 4.06/1.31 |
% 4.06/1.32 | GROUND_INST: instantiating (1) with a, b, simplifying with (conj) gives:
% 4.06/1.32 | (2) $lesseq(-15, b)
% 4.06/1.32 |
% 4.06/1.32 | THEORY_AXIOM GroebnerMultiplication:
% 4.06/1.32 | (3) ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(16, v1)) | ~ ($product(v0,
% 4.06/1.32 | v1) = 15))
% 4.06/1.32 |
% 4.06/1.32 | GROUND_INST: instantiating (3) with a, b, simplifying with (conj) gives:
% 4.06/1.32 | (4) $lesseq(b, 15)
% 4.06/1.32 |
% 4.06/1.32 | THEORY_AXIOM GroebnerMultiplication:
% 4.06/1.32 | (5) ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(v0, -16)) | ~ ($product(v0,
% 4.06/1.32 | v1) = 15))
% 4.06/1.32 |
% 4.06/1.32 | GROUND_INST: instantiating (5) with a, b, simplifying with (conj) gives:
% 4.06/1.32 | (6) $lesseq(-15, a)
% 4.06/1.32 |
% 4.06/1.32 | THEORY_AXIOM GroebnerMultiplication:
% 4.06/1.32 | (7) ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(16, v0)) | ~ ($product(v0,
% 4.06/1.32 | v1) = 15))
% 4.06/1.32 |
% 4.06/1.32 | GROUND_INST: instantiating (7) with a, b, simplifying with (conj) gives:
% 4.06/1.32 | (8) $lesseq(a, 15)
% 4.06/1.32 |
% 4.06/1.32 | THEORY_AXIOM GroebnerMultiplication:
% 4.06/1.32 | (9) ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(v1, 15)) | ~ ($lesseq(17,
% 4.06/1.32 | $sum(v1, v0))) | ~ ($lesseq(v0, 15)) | ~ ($product(v0, v1) =
% 4.06/1.32 | 15))
% 4.06/1.32 |
% 4.06/1.32 | GROUND_INST: instantiating (9) with a, b, simplifying with (conj) gives:
% 4.06/1.33 | (10) ~ ($lesseq(b, 15)) | ~ ($lesseq(17, $sum(b, a))) | ~ ($lesseq(a,
% 4.06/1.33 | 15))
% 4.06/1.33 |
% 4.06/1.33 | BETA: splitting (10) gives:
% 4.06/1.33 |
% 4.06/1.33 | Case 1:
% 4.06/1.33 | |
% 4.06/1.33 | | (11) $lesseq(16, b)
% 4.06/1.33 | |
% 4.06/1.33 | | COMBINE_INEQS: (4), (11) imply:
% 4.06/1.33 | | (12) $false
% 4.06/1.33 | |
% 4.06/1.33 | | CLOSE: (12) is inconsistent.
% 4.06/1.33 | |
% 4.06/1.33 | Case 2:
% 4.06/1.33 | |
% 4.06/1.33 | | (13) ~ ($lesseq(17, $sum(b, a))) | ~ ($lesseq(a, 15))
% 4.06/1.33 | |
% 4.06/1.33 | | BETA: splitting (13) gives:
% 4.06/1.33 | |
% 4.06/1.33 | | Case 1:
% 4.06/1.33 | | |
% 4.06/1.33 | | | (14) $lesseq(16, a)
% 4.06/1.33 | | |
% 4.06/1.33 | | | COMBINE_INEQS: (8), (14) imply:
% 4.06/1.33 | | | (15) $false
% 4.06/1.33 | | |
% 4.06/1.33 | | | CLOSE: (15) is inconsistent.
% 4.06/1.33 | | |
% 4.06/1.33 | | Case 2:
% 4.06/1.33 | | |
% 4.06/1.33 | | | (16) $lesseq(-16, $difference($product(-1, b), a))
% 4.06/1.33 | | |
% 4.06/1.33 | | | THEORY_AXIOM GroebnerMultiplication:
% 4.22/1.33 | | | (17) ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(v1, 15)) | ~
% 4.22/1.33 | | | ($lesseq(15, $difference(v1, v0))) | ~ ($lesseq(-15, v0)) | ~
% 4.22/1.33 | | | ($product(v0, v1) = 15))
% 4.22/1.33 | | |
% 4.22/1.33 | | | GROUND_INST: instantiating (17) with a, b, simplifying with (conj) gives:
% 4.22/1.33 | | | (18) ~ ($lesseq(b, 15)) | ~ ($lesseq(15, $difference(b, a))) | ~
% 4.22/1.33 | | | ($lesseq(-15, a))
% 4.22/1.33 | | |
% 4.22/1.33 | | | BETA: splitting (18) gives:
% 4.22/1.33 | | |
% 4.22/1.33 | | | Case 1:
% 4.22/1.33 | | | |
% 4.22/1.33 | | | | (19) $lesseq(16, b)
% 4.22/1.33 | | | |
% 4.22/1.33 | | | | COMBINE_INEQS: (4), (19) imply:
% 4.22/1.33 | | | | (20) $false
% 4.22/1.33 | | | |
% 4.22/1.33 | | | | CLOSE: (20) is inconsistent.
% 4.22/1.33 | | | |
% 4.22/1.33 | | | Case 2:
% 4.22/1.33 | | | |
% 4.22/1.33 | | | | (21) ~ ($lesseq(15, $difference(b, a))) | ~ ($lesseq(-15, a))
% 4.22/1.33 | | | |
% 4.22/1.33 | | | | BETA: splitting (21) gives:
% 4.22/1.33 | | | |
% 4.22/1.33 | | | | Case 1:
% 4.22/1.33 | | | | |
% 4.22/1.33 | | | | | (22) $lesseq(a, -16)
% 4.22/1.34 | | | | |
% 4.22/1.34 | | | | | COMBINE_INEQS: (6), (22) imply:
% 4.22/1.34 | | | | | (23) $false
% 4.22/1.34 | | | | |
% 4.22/1.34 | | | | | CLOSE: (23) is inconsistent.
% 4.22/1.34 | | | | |
% 4.22/1.34 | | | | Case 2:
% 4.22/1.34 | | | | |
% 4.22/1.34 | | | | | (24) $lesseq(-14, $difference(a, b))
% 4.22/1.34 | | | | |
% 4.22/1.34 | | | | | THEORY_AXIOM GroebnerMultiplication:
% 4.22/1.34 | | | | | (25) ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(15, $difference(v0,
% 4.22/1.34 | | | | | v1))) | ~ ($lesseq(-15, v1)) | ~ ($lesseq(v0, 15)) |
% 4.22/1.34 | | | | | ~ ($product(v0, v1) = 15))
% 4.22/1.34 | | | | |
% 4.22/1.34 | | | | | GROUND_INST: instantiating (25) with a, b, simplifying with (conj)
% 4.22/1.34 | | | | | gives:
% 4.22/1.34 | | | | | (26) ~ ($lesseq(15, $difference(a, b))) | ~ ($lesseq(-15, b)) |
% 4.22/1.34 | | | | | ~ ($lesseq(a, 15))
% 4.22/1.34 | | | | |
% 4.22/1.34 | | | | | BETA: splitting (26) gives:
% 4.22/1.34 | | | | |
% 4.22/1.34 | | | | | Case 1:
% 4.22/1.34 | | | | | |
% 4.22/1.34 | | | | | | (27) $lesseq(b, -16)
% 4.22/1.34 | | | | | |
% 4.22/1.34 | | | | | | COMBINE_INEQS: (2), (27) imply:
% 4.22/1.34 | | | | | | (28) $false
% 4.22/1.34 | | | | | |
% 4.22/1.34 | | | | | | CLOSE: (28) is inconsistent.
% 4.22/1.34 | | | | | |
% 4.22/1.34 | | | | | Case 2:
% 4.22/1.34 | | | | | |
% 4.22/1.34 | | | | | | (29) ~ ($lesseq(15, $difference(a, b))) | ~ ($lesseq(a, 15))
% 4.22/1.34 | | | | | |
% 4.22/1.34 | | | | | | BETA: splitting (29) gives:
% 4.22/1.34 | | | | | |
% 4.22/1.34 | | | | | | Case 1:
% 4.22/1.34 | | | | | | |
% 4.22/1.34 | | | | | | | (30) $lesseq(16, a)
% 4.22/1.34 | | | | | | |
% 4.22/1.34 | | | | | | | COMBINE_INEQS: (8), (30) imply:
% 4.22/1.34 | | | | | | | (31) $false
% 4.22/1.34 | | | | | | |
% 4.22/1.34 | | | | | | | CLOSE: (31) is inconsistent.
% 4.22/1.34 | | | | | | |
% 4.22/1.34 | | | | | | Case 2:
% 4.22/1.34 | | | | | | |
% 4.22/1.34 | | | | | | | (32) $lesseq(-14, $difference(b, a))
% 4.22/1.34 | | | | | | |
% 4.22/1.34 | | | | | | | THEORY_AXIOM GroebnerMultiplication:
% 4.22/1.34 | | | | | | | (33) ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(17,
% 4.22/1.34 | | | | | | | $difference($product(-1, v1), v0))) | ~
% 4.22/1.34 | | | | | | | ($lesseq(-15, v1)) | ~ ($lesseq(-15, v0)) | ~
% 4.22/1.34 | | | | | | | ($product(v0, v1) = 15))
% 4.22/1.34 | | | | | | |
% 4.22/1.34 | | | | | | | GROUND_INST: instantiating (33) with a, b, simplifying with (conj)
% 4.22/1.34 | | | | | | | gives:
% 4.24/1.34 | | | | | | | (34) ~ ($lesseq(17, $difference($product(-1, b), a))) | ~
% 4.24/1.34 | | | | | | | ($lesseq(-15, b)) | ~ ($lesseq(-15, a))
% 4.24/1.34 | | | | | | |
% 4.24/1.34 | | | | | | | BETA: splitting (34) gives:
% 4.24/1.34 | | | | | | |
% 4.24/1.34 | | | | | | | Case 1:
% 4.24/1.34 | | | | | | | |
% 4.24/1.34 | | | | | | | | (35) $lesseq(b, -16)
% 4.24/1.34 | | | | | | | |
% 4.24/1.34 | | | | | | | | COMBINE_INEQS: (2), (35) imply:
% 4.24/1.34 | | | | | | | | (36) $false
% 4.24/1.34 | | | | | | | |
% 4.24/1.34 | | | | | | | | CLOSE: (36) is inconsistent.
% 4.24/1.34 | | | | | | | |
% 4.24/1.34 | | | | | | | Case 2:
% 4.24/1.34 | | | | | | | |
% 4.24/1.34 | | | | | | | | (37) ~ ($lesseq(17, $difference($product(-1, b), a))) | ~
% 4.24/1.34 | | | | | | | | ($lesseq(-15, a))
% 4.24/1.34 | | | | | | | |
% 4.24/1.34 | | | | | | | | BETA: splitting (37) gives:
% 4.24/1.34 | | | | | | | |
% 4.24/1.34 | | | | | | | | Case 1:
% 4.24/1.34 | | | | | | | | |
% 4.24/1.34 | | | | | | | | | (38) $lesseq(a, -16)
% 4.24/1.34 | | | | | | | | |
% 4.24/1.34 | | | | | | | | | COMBINE_INEQS: (6), (38) imply:
% 4.24/1.34 | | | | | | | | | (39) $false
% 4.24/1.34 | | | | | | | | |
% 4.24/1.34 | | | | | | | | | CLOSE: (39) is inconsistent.
% 4.24/1.34 | | | | | | | | |
% 4.24/1.34 | | | | | | | | Case 2:
% 4.24/1.34 | | | | | | | | |
% 4.24/1.35 | | | | | | | | | (40) $lesseq(-16, $sum(b, a))
% 4.24/1.35 | | | | | | | | |
% 4.24/1.35 | | | | | | | | | COMBINE_INEQS: (16), (32) imply:
% 4.24/1.35 | | | | | | | | | (41) $lesseq(a, 15)
% 4.24/1.35 | | | | | | | | |
% 4.24/1.35 | | | | | | | | | COMBINE_INEQS: (24), (40) imply:
% 4.24/1.35 | | | | | | | | | (42) $lesseq(-15, a)
% 4.24/1.35 | | | | | | | | |
% 4.24/1.35 | | | | | | | | | BETA: splitting (conj_001) gives:
% 4.24/1.35 | | | | | | | | |
% 4.24/1.35 | | | | | | | | | Case 1:
% 4.24/1.35 | | | | | | | | | |
% 4.24/1.35 | | | | | | | | | | (43) $lesseq(16, a)
% 4.24/1.35 | | | | | | | | | |
% 4.24/1.35 | | | | | | | | | | COMBINE_INEQS: (8), (43) imply:
% 4.24/1.35 | | | | | | | | | | (44) $false
% 4.24/1.35 | | | | | | | | | |
% 4.24/1.35 | | | | | | | | | | CLOSE: (44) is inconsistent.
% 4.24/1.35 | | | | | | | | | |
% 4.24/1.35 | | | | | | | | | Case 2:
% 4.24/1.35 | | | | | | | | | |
% 4.24/1.35 | | | | | | | | | | (45) a = 0 | ~ ($lesseq(-15, a))
% 4.24/1.35 | | | | | | | | | |
% 4.24/1.35 | | | | | | | | | | BETA: splitting (45) gives:
% 4.24/1.35 | | | | | | | | | |
% 4.24/1.35 | | | | | | | | | | Case 1:
% 4.24/1.35 | | | | | | | | | | |
% 4.24/1.35 | | | | | | | | | | | (46) $lesseq(a, -16)
% 4.24/1.35 | | | | | | | | | | |
% 4.24/1.35 | | | | | | | | | | | COMBINE_INEQS: (6), (46) imply:
% 4.24/1.35 | | | | | | | | | | | (47) $false
% 4.24/1.35 | | | | | | | | | | |
% 4.24/1.35 | | | | | | | | | | | CLOSE: (47) is inconsistent.
% 4.24/1.35 | | | | | | | | | | |
% 4.24/1.35 | | | | | | | | | | Case 2:
% 4.24/1.35 | | | | | | | | | | |
% 4.24/1.35 | | | | | | | | | | | (48) a = 0
% 4.24/1.35 | | | | | | | | | | |
% 4.24/1.35 | | | | | | | | | | | REDUCE: (48), (conj) imply:
% 4.24/1.35 | | | | | | | | | | | (49) $product(0, b) = 15
% 4.24/1.35 | | | | | | | | | | |
% 4.24/1.35 | | | | | | | | | | | THEORY_AXIOM GroebnerMultiplication:
% 4.24/1.35 | | | | | | | | | | | (50) ! [v0: int] : ~ ($product(0, v0) = 15)
% 4.24/1.35 | | | | | | | | | | |
% 4.24/1.35 | | | | | | | | | | | GROUND_INST: instantiating (50) with b gives:
% 4.24/1.35 | | | | | | | | | | | (51) ~ ($product(0, b) = 15)
% 4.24/1.35 | | | | | | | | | | |
% 4.24/1.35 | | | | | | | | | | | PRED_UNIFY: (49), (51) imply:
% 4.24/1.35 | | | | | | | | | | | (52) $false
% 4.24/1.35 | | | | | | | | | | |
% 4.24/1.35 | | | | | | | | | | | CLOSE: (52) is inconsistent.
% 4.24/1.35 | | | | | | | | | | |
% 4.24/1.35 | | | | | | | | | | End of split
% 4.24/1.35 | | | | | | | | | |
% 4.24/1.35 | | | | | | | | | End of split
% 4.24/1.35 | | | | | | | | |
% 4.24/1.35 | | | | | | | | End of split
% 4.24/1.35 | | | | | | | |
% 4.24/1.35 | | | | | | | End of split
% 4.24/1.35 | | | | | | |
% 4.24/1.35 | | | | | | End of split
% 4.24/1.35 | | | | | |
% 4.24/1.35 | | | | | End of split
% 4.24/1.35 | | | | |
% 4.24/1.35 | | | | End of split
% 4.24/1.35 | | | |
% 4.24/1.35 | | | End of split
% 4.24/1.35 | | |
% 4.24/1.35 | | End of split
% 4.24/1.35 | |
% 4.24/1.35 | End of split
% 4.24/1.35 |
% 4.24/1.35 End of proof
% 4.24/1.35 % SZS output end Proof for theBenchmark
% 4.24/1.35
% 4.24/1.35 722ms
%------------------------------------------------------------------------------