TSTP Solution File: KRS064+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : KRS064+1 : TPTP v8.1.2. Released v3.1.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 : Thu Aug 31 05:51:07 EDT 2023
% Result : Unsatisfiable 3.10s 1.16s
% Output : Proof 3.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS064+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.17/0.34 % Computer : n028.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Mon Aug 28 02:18:09 EDT 2023
% 0.17/0.34 % CPUTime :
% 0.20/0.61 ________ _____
% 0.20/0.61 ___ __ \_________(_)________________________________
% 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.61
% 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.61 (2023-06-19)
% 0.20/0.61
% 0.20/0.61 (c) Philipp Rümmer, 2009-2023
% 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.61 Amanda Stjerna.
% 0.20/0.61 Free software under BSD-3-Clause.
% 0.20/0.61
% 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.61
% 0.20/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.62 Running up to 7 provers in parallel.
% 0.20/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.20/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 1.79/0.97 Prover 1: Preprocessing ...
% 1.79/0.97 Prover 4: Preprocessing ...
% 2.01/1.02 Prover 0: Preprocessing ...
% 2.01/1.02 Prover 6: Preprocessing ...
% 2.01/1.02 Prover 3: Preprocessing ...
% 2.01/1.02 Prover 5: Preprocessing ...
% 2.01/1.02 Prover 2: Preprocessing ...
% 2.25/1.09 Prover 5: Proving ...
% 2.25/1.09 Prover 2: Proving ...
% 2.25/1.09 Prover 1: Constructing countermodel ...
% 2.25/1.10 Prover 4: Constructing countermodel ...
% 2.69/1.10 Prover 3: Constructing countermodel ...
% 2.69/1.11 Prover 6: Constructing countermodel ...
% 2.69/1.12 Prover 0: Proving ...
% 2.69/1.16 Prover 5: proved (524ms)
% 3.10/1.16
% 3.10/1.16 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.10/1.16
% 3.10/1.16 Prover 0: proved (531ms)
% 3.10/1.16
% 3.10/1.16 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.10/1.16
% 3.10/1.16 Prover 3: proved (527ms)
% 3.10/1.16
% 3.10/1.16 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.10/1.16
% 3.10/1.16 Prover 2: proved (530ms)
% 3.10/1.16
% 3.10/1.16 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.10/1.16
% 3.10/1.16 Prover 6: proved (527ms)
% 3.10/1.16
% 3.10/1.16 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.10/1.16
% 3.10/1.17 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.10/1.17 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.10/1.17 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.10/1.17 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.10/1.17 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.10/1.17 Prover 1: Found proof (size 4)
% 3.10/1.17 Prover 1: proved (543ms)
% 3.10/1.17 Prover 4: Found proof (size 4)
% 3.10/1.17 Prover 4: proved (540ms)
% 3.10/1.17 Prover 10: Preprocessing ...
% 3.10/1.18 Prover 11: Preprocessing ...
% 3.10/1.18 Prover 8: Preprocessing ...
% 3.10/1.18 Prover 7: Preprocessing ...
% 3.10/1.19 Prover 10: Warning: ignoring some quantifiers
% 3.10/1.19 Prover 13: Preprocessing ...
% 3.10/1.19 Prover 10: Constructing countermodel ...
% 3.10/1.19 Prover 7: Warning: ignoring some quantifiers
% 3.10/1.19 Prover 7: Constructing countermodel ...
% 3.10/1.19 Prover 7: stopped
% 3.10/1.20 Prover 10: stopped
% 3.10/1.20 Prover 13: Warning: ignoring some quantifiers
% 3.10/1.20 Prover 13: Constructing countermodel ...
% 3.10/1.20 Prover 13: stopped
% 3.10/1.21 Prover 8: Warning: ignoring some quantifiers
% 3.10/1.22 Prover 11: Constructing countermodel ...
% 3.10/1.22 Prover 8: Constructing countermodel ...
% 3.10/1.22 Prover 11: stopped
% 3.10/1.22 Prover 8: stopped
% 3.10/1.22
% 3.10/1.22 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.10/1.22
% 3.10/1.23 % SZS output start Proof for theBenchmark
% 3.10/1.23 Assumptions after simplification:
% 3.10/1.23 ---------------------------------
% 3.10/1.23
% 3.10/1.23 (axiom_0)
% 3.66/1.27 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cowlThing(v0) = v1) | ~ $i(v0)) &
% 3.66/1.27 ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) | ~ $i(v0))
% 3.66/1.27
% 3.66/1.27 (axiom_2)
% 3.66/1.27 cowlNothing(i2003_11_14_17_18_08754) = 0 & $i(i2003_11_14_17_18_08754)
% 3.66/1.27
% 3.66/1.27 Further assumptions not needed in the proof:
% 3.66/1.27 --------------------------------------------
% 3.66/1.27 axiom_1
% 3.66/1.27
% 3.66/1.27 Those formulas are unsatisfiable:
% 3.66/1.27 ---------------------------------
% 3.66/1.27
% 3.66/1.27 Begin of proof
% 3.66/1.27 |
% 3.66/1.27 | ALPHA: (axiom_0) implies:
% 3.66/1.27 | (1) ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) | ~ $i(v0))
% 3.66/1.27 |
% 3.66/1.27 | ALPHA: (axiom_2) implies:
% 3.66/1.28 | (2) $i(i2003_11_14_17_18_08754)
% 3.66/1.28 | (3) cowlNothing(i2003_11_14_17_18_08754) = 0
% 3.66/1.28 |
% 3.66/1.28 | GROUND_INST: instantiating (1) with i2003_11_14_17_18_08754, simplifying with
% 3.66/1.28 | (2), (3) gives:
% 3.66/1.28 | (4) $false
% 3.66/1.28 |
% 3.66/1.28 | CLOSE: (4) is inconsistent.
% 3.66/1.28 |
% 3.66/1.28 End of proof
% 3.66/1.28 % SZS output end Proof for theBenchmark
% 3.66/1.28
% 3.66/1.28 673ms
%------------------------------------------------------------------------------