TSTP Solution File: ARI671_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : ARI671_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 : n028.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:45 EDT 2023
% Result : Unsatisfiable 2.68s 1.14s
% Output : Proof 3.34s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ARI671_1 : TPTP v8.1.2. Released v6.3.0.
% 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 29 18:49:26 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.61 ________ _____
% 0.21/0.61 ___ __ \_________(_)________________________________
% 0.21/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.21/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.21/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.21/0.61
% 0.21/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.21/0.61 (2023-06-19)
% 0.21/0.61
% 0.21/0.61 (c) Philipp Rümmer, 2009-2023
% 0.21/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.21/0.61 Amanda Stjerna.
% 0.21/0.61 Free software under BSD-3-Clause.
% 0.21/0.61
% 0.21/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.21/0.61
% 0.21/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.21/0.62 Running up to 7 provers in parallel.
% 0.62/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.62/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.62/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.62/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.62/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.62/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.62/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.99/0.98 Prover 5: Preprocessing ...
% 1.99/0.98 Prover 3: Preprocessing ...
% 1.99/0.98 Prover 1: Preprocessing ...
% 1.99/0.98 Prover 6: Preprocessing ...
% 1.99/0.98 Prover 2: Preprocessing ...
% 1.99/0.98 Prover 0: Preprocessing ...
% 1.99/0.98 Prover 4: Preprocessing ...
% 2.32/1.03 Prover 5: Constructing countermodel ...
% 2.32/1.03 Prover 2: Constructing countermodel ...
% 2.32/1.03 Prover 1: Constructing countermodel ...
% 2.32/1.03 Prover 0: Constructing countermodel ...
% 2.32/1.03 Prover 4: Constructing countermodel ...
% 2.32/1.03 Prover 3: Constructing countermodel ...
% 2.32/1.03 Prover 6: Constructing countermodel ...
% 2.68/1.14 Prover 6: proved (505ms)
% 2.68/1.14 Prover 3: proved (508ms)
% 2.68/1.14 Prover 2: proved (509ms)
% 2.68/1.14 Prover 5: proved (506ms)
% 2.68/1.14 Prover 0: proved (506ms)
% 2.68/1.14
% 2.68/1.14 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.68/1.14
% 2.68/1.14
% 2.68/1.14 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.68/1.14
% 2.68/1.14
% 2.68/1.14 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.68/1.14
% 2.68/1.14
% 2.68/1.14 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.68/1.14
% 2.68/1.15
% 2.68/1.15 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.68/1.15
% 2.68/1.15 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 2.68/1.15 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 2.68/1.15 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 2.68/1.15 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.19/1.16 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.19/1.16 Prover 7: Preprocessing ...
% 3.19/1.16 Prover 8: Preprocessing ...
% 3.19/1.16 Prover 11: Preprocessing ...
% 3.19/1.16 Prover 1: Found proof (size 11)
% 3.19/1.16 Prover 4: Found proof (size 11)
% 3.19/1.16 Prover 1: proved (524ms)
% 3.19/1.16 Prover 10: Preprocessing ...
% 3.19/1.16 Prover 8: Constructing countermodel ...
% 3.19/1.16 Prover 8: stopped
% 3.19/1.16 Prover 10: Constructing countermodel ...
% 3.19/1.16 Prover 10: stopped
% 3.19/1.16 Prover 13: Preprocessing ...
% 3.19/1.16 Prover 4: proved (532ms)
% 3.19/1.16 Prover 7: Constructing countermodel ...
% 3.19/1.16 Prover 7: stopped
% 3.19/1.16 Prover 11: Constructing countermodel ...
% 3.19/1.16 Prover 11: stopped
% 3.19/1.17 Prover 13: Constructing countermodel ...
% 3.19/1.17 Prover 13: stopped
% 3.19/1.17
% 3.19/1.17 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.19/1.17
% 3.19/1.17 % SZS output start Proof for theBenchmark
% 3.19/1.17 Assumptions after simplification:
% 3.19/1.17 ---------------------------------
% 3.19/1.17
% 3.19/1.17 (conj)
% 3.19/1.18 $product(a, a) = 2
% 3.19/1.18
% 3.19/1.18 Those formulas are unsatisfiable:
% 3.19/1.18 ---------------------------------
% 3.19/1.18
% 3.19/1.18 Begin of proof
% 3.19/1.18 |
% 3.19/1.18 | THEORY_AXIOM GroebnerMultiplication:
% 3.34/1.19 | (1) ! [v0: int] : ( ~ ($lesseq(v0, -2)) | ~ ($product(v0, v0) = 2))
% 3.34/1.19 |
% 3.34/1.19 | GROUND_INST: instantiating (1) with a, simplifying with (conj) gives:
% 3.34/1.19 | (2) $lesseq(-1, a)
% 3.34/1.19 |
% 3.34/1.19 | THEORY_AXIOM GroebnerMultiplication:
% 3.34/1.19 | (3) ! [v0: int] : ( ~ ($lesseq(2, v0)) | ~ ($product(v0, v0) = 2))
% 3.34/1.19 |
% 3.34/1.19 | GROUND_INST: instantiating (3) with a, simplifying with (conj) gives:
% 3.34/1.19 | (4) $lesseq(a, 1)
% 3.34/1.19 |
% 3.34/1.19 | THEORY_AXIOM GroebnerMultiplication:
% 3.34/1.19 | (5) ! [v0: int] : ( ~ ($lesseq(v0, 1)) | ~ ($lesseq(-1, v0)) | ~
% 3.34/1.19 | ($product(v0, v0) = 2))
% 3.34/1.19 |
% 3.34/1.19 | GROUND_INST: instantiating (5) with a, simplifying with (conj) gives:
% 3.34/1.19 | (6) ~ ($lesseq(a, 1)) | ~ ($lesseq(-1, a))
% 3.34/1.19 |
% 3.34/1.19 | BETA: splitting (6) gives:
% 3.34/1.19 |
% 3.34/1.19 | Case 1:
% 3.34/1.19 | |
% 3.34/1.19 | | (7) $lesseq(2, a)
% 3.34/1.19 | |
% 3.34/1.19 | | COMBINE_INEQS: (4), (7) imply:
% 3.34/1.19 | | (8) $false
% 3.34/1.19 | |
% 3.34/1.19 | | CLOSE: (8) is inconsistent.
% 3.34/1.19 | |
% 3.34/1.19 | Case 2:
% 3.34/1.19 | |
% 3.34/1.19 | | (9) $lesseq(a, -2)
% 3.34/1.19 | |
% 3.34/1.19 | | COMBINE_INEQS: (2), (9) imply:
% 3.34/1.19 | | (10) $false
% 3.34/1.19 | |
% 3.34/1.19 | | CLOSE: (10) is inconsistent.
% 3.34/1.19 | |
% 3.34/1.19 | End of split
% 3.34/1.19 |
% 3.34/1.19 End of proof
% 3.34/1.19 % SZS output end Proof for theBenchmark
% 3.34/1.19
% 3.34/1.19 584ms
%------------------------------------------------------------------------------