TSTP Solution File: KRS093+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : KRS093+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 : n015.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:13 EDT 2023
% Result : Unsatisfiable 3.84s 1.29s
% Output : Proof 4.54s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS093+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.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 28 02:35:54 EDT 2023
% 0.13/0.35 % 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/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.62 Running up to 7 provers in parallel.
% 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.89/0.95 Prover 4: Preprocessing ...
% 1.89/0.96 Prover 1: Preprocessing ...
% 1.89/1.00 Prover 2: Preprocessing ...
% 1.89/1.00 Prover 6: Preprocessing ...
% 1.89/1.00 Prover 0: Preprocessing ...
% 1.89/1.00 Prover 5: Preprocessing ...
% 1.89/1.00 Prover 3: Preprocessing ...
% 2.97/1.17 Prover 5: Proving ...
% 2.97/1.17 Prover 2: Proving ...
% 3.56/1.18 Prover 1: Constructing countermodel ...
% 3.71/1.21 Prover 3: Constructing countermodel ...
% 3.71/1.21 Prover 6: Constructing countermodel ...
% 3.84/1.24 Prover 4: Constructing countermodel ...
% 3.84/1.27 Prover 3: gave up
% 3.84/1.27 Prover 1: gave up
% 3.84/1.27 Prover 6: gave up
% 3.84/1.28 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.84/1.28 Prover 5: proved (641ms)
% 3.84/1.28
% 3.84/1.29 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.84/1.29
% 3.84/1.29 Prover 2: proved (643ms)
% 3.84/1.29
% 3.84/1.29 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.84/1.29
% 3.84/1.29 Prover 7: Preprocessing ...
% 3.84/1.29 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.84/1.29 Prover 0: Proving ...
% 3.84/1.29 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889
% 3.84/1.29 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.84/1.29 Prover 0: stopped
% 3.84/1.30 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.84/1.30 Prover 8: Preprocessing ...
% 3.84/1.30 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.84/1.31 Prover 7: Warning: ignoring some quantifiers
% 3.84/1.31 Prover 13: Preprocessing ...
% 4.54/1.32 Prover 9: Preprocessing ...
% 4.54/1.32 Prover 7: Constructing countermodel ...
% 4.54/1.33 Prover 11: Preprocessing ...
% 4.54/1.35 Prover 10: Preprocessing ...
% 4.54/1.36 Prover 13: Warning: ignoring some quantifiers
% 4.54/1.36 Prover 13: Constructing countermodel ...
% 4.54/1.37 Prover 10: Warning: ignoring some quantifiers
% 4.54/1.37 Prover 10: Constructing countermodel ...
% 4.54/1.37 Prover 7: Found proof (size 8)
% 4.54/1.37 Prover 7: proved (106ms)
% 4.54/1.37 Prover 13: stopped
% 4.54/1.38 Prover 10: stopped
% 4.54/1.38 Prover 4: stopped
% 4.54/1.38 Prover 8: Warning: ignoring some quantifiers
% 4.54/1.39 Prover 8: Constructing countermodel ...
% 4.54/1.40 Prover 8: stopped
% 4.54/1.43 Prover 11: Constructing countermodel ...
% 4.54/1.43 Prover 9: Constructing countermodel ...
% 4.54/1.44 Prover 9: stopped
% 4.54/1.44 Prover 11: stopped
% 4.54/1.44
% 4.54/1.44 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.54/1.44
% 4.54/1.44 % SZS output start Proof for theBenchmark
% 4.54/1.45 Assumptions after simplification:
% 4.54/1.45 ---------------------------------
% 4.54/1.45
% 4.54/1.45 (axiom_2)
% 4.54/1.45 ! [v0: $i] : ( ~ $i(v0) | ~ ce3(v0) | ~ cf(v0) | cUnsatisfiable(v0)) & !
% 4.54/1.45 [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ce3(v0)) & ! [v0: $i] : ( ~
% 4.54/1.45 $i(v0) | ~ cUnsatisfiable(v0) | cf(v0))
% 4.54/1.45
% 4.54/1.45 (axiom_3)
% 4.54/1.45 ! [v0: $i] : ( ~ $i(v0) | ~ cd(v0) | ~ cc(v0))
% 4.54/1.45
% 4.54/1.45 (axiom_6)
% 4.54/1.45 ! [v0: $i] : ( ~ $i(v0) | ~ ce3(v0) | cc(v0))
% 4.54/1.45
% 4.54/1.45 (axiom_7)
% 4.54/1.45 ! [v0: $i] : ( ~ $i(v0) | ~ cf(v0) | cd(v0))
% 4.54/1.45
% 4.54/1.45 (axiom_8)
% 4.54/1.45 $i(i2003_11_14_17_20_07201) & cUnsatisfiable(i2003_11_14_17_20_07201)
% 4.54/1.45
% 4.54/1.45 Further assumptions not needed in the proof:
% 4.54/1.45 --------------------------------------------
% 4.54/1.45 axiom_0, axiom_1, axiom_4, axiom_5
% 4.54/1.45
% 4.54/1.45 Those formulas are unsatisfiable:
% 4.54/1.45 ---------------------------------
% 4.54/1.45
% 4.54/1.45 Begin of proof
% 4.54/1.46 |
% 4.54/1.46 | ALPHA: (axiom_8) implies:
% 4.54/1.46 | (1) cUnsatisfiable(i2003_11_14_17_20_07201)
% 4.54/1.46 | (2) $i(i2003_11_14_17_20_07201)
% 4.54/1.46 |
% 4.54/1.46 | ALPHA: (axiom_2) implies:
% 4.54/1.46 | (3) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | cf(v0))
% 4.54/1.46 | (4) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ce3(v0))
% 4.54/1.46 |
% 4.54/1.46 | GROUND_INST: instantiating (4) with i2003_11_14_17_20_07201, simplifying with
% 4.54/1.46 | (1), (2) gives:
% 4.54/1.46 | (5) ce3(i2003_11_14_17_20_07201)
% 4.54/1.46 |
% 4.54/1.46 | GROUND_INST: instantiating (3) with i2003_11_14_17_20_07201, simplifying with
% 4.54/1.46 | (1), (2) gives:
% 4.54/1.46 | (6) cf(i2003_11_14_17_20_07201)
% 4.54/1.46 |
% 4.54/1.46 | GROUND_INST: instantiating (axiom_7) with i2003_11_14_17_20_07201, simplifying
% 4.54/1.46 | with (2), (6) gives:
% 4.54/1.47 | (7) cd(i2003_11_14_17_20_07201)
% 4.54/1.47 |
% 4.54/1.47 | GROUND_INST: instantiating (axiom_6) with i2003_11_14_17_20_07201, simplifying
% 4.54/1.47 | with (2), (5) gives:
% 4.54/1.47 | (8) cc(i2003_11_14_17_20_07201)
% 4.54/1.47 |
% 4.54/1.47 | GROUND_INST: instantiating (axiom_3) with i2003_11_14_17_20_07201, simplifying
% 4.54/1.47 | with (2), (7), (8) gives:
% 4.54/1.47 | (9) $false
% 4.54/1.47 |
% 4.54/1.47 | CLOSE: (9) is inconsistent.
% 4.54/1.47 |
% 4.54/1.47 End of proof
% 4.54/1.47 % SZS output end Proof for theBenchmark
% 4.54/1.47
% 4.54/1.47 857ms
%------------------------------------------------------------------------------