TSTP Solution File: KRS100+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : KRS100+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 : n016.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:14 EDT 2023
% Result : Unsatisfiable 4.16s 1.35s
% Output : Proof 5.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS100+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.16/0.34 % Computer : n016.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Mon Aug 28 02:23:59 EDT 2023
% 0.16/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.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.63 Running up to 7 provers in parallel.
% 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 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 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
% 2.15/1.00 Prover 1: Preprocessing ...
% 2.15/1.00 Prover 4: Preprocessing ...
% 2.15/1.05 Prover 6: Preprocessing ...
% 2.15/1.05 Prover 0: Preprocessing ...
% 2.15/1.05 Prover 5: Preprocessing ...
% 2.15/1.05 Prover 3: Preprocessing ...
% 2.15/1.05 Prover 2: Preprocessing ...
% 3.13/1.19 Prover 2: Proving ...
% 3.13/1.19 Prover 5: Proving ...
% 3.74/1.26 Prover 6: Proving ...
% 3.74/1.27 Prover 1: Constructing countermodel ...
% 3.74/1.28 Prover 3: Constructing countermodel ...
% 4.16/1.32 Prover 4: Constructing countermodel ...
% 4.16/1.34 Prover 2: proved (710ms)
% 4.16/1.35
% 4.16/1.35 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.16/1.35
% 4.16/1.35 Prover 5: proved (705ms)
% 4.16/1.35
% 4.16/1.35 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.16/1.35
% 4.16/1.35 Prover 3: stopped
% 4.16/1.35 Prover 6: stopped
% 4.16/1.35 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.16/1.35 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.16/1.37 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 4.16/1.37 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 4.16/1.38 Prover 8: Preprocessing ...
% 4.16/1.38 Prover 7: Preprocessing ...
% 4.16/1.39 Prover 10: Preprocessing ...
% 4.16/1.39 Prover 11: Preprocessing ...
% 4.16/1.41 Prover 0: Proving ...
% 4.16/1.42 Prover 10: Warning: ignoring some quantifiers
% 4.16/1.42 Prover 7: Warning: ignoring some quantifiers
% 4.16/1.43 Prover 7: Constructing countermodel ...
% 4.16/1.43 Prover 0: stopped
% 4.16/1.44 Prover 10: Constructing countermodel ...
% 4.16/1.44 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 5.22/1.48 Prover 7: Found proof (size 8)
% 5.22/1.49 Prover 7: proved (133ms)
% 5.22/1.49 Prover 8: Warning: ignoring some quantifiers
% 5.22/1.49 Prover 1: stopped
% 5.22/1.49 Prover 13: Preprocessing ...
% 5.22/1.49 Prover 8: Constructing countermodel ...
% 5.22/1.49 Prover 10: stopped
% 5.22/1.51 Prover 4: stopped
% 5.22/1.51 Prover 8: stopped
% 5.22/1.51 Prover 13: Warning: ignoring some quantifiers
% 5.22/1.51 Prover 13: Constructing countermodel ...
% 5.22/1.51 Prover 13: stopped
% 5.22/1.54 Prover 11: Constructing countermodel ...
% 5.22/1.55 Prover 11: stopped
% 5.22/1.55
% 5.22/1.55 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.22/1.55
% 5.22/1.55 % SZS output start Proof for theBenchmark
% 5.22/1.55 Assumptions after simplification:
% 5.22/1.55 ---------------------------------
% 5.22/1.55
% 5.22/1.55 (axiom_2)
% 5.22/1.56 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ cd(v1) | ~ rr(v0, v1)
% 5.22/1.56 | ~ cUnsatisfiable(v0) | ce(v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) |
% 5.22/1.56 ~ $i(v0) | ~ rr(v0, v1) | ~ cUnsatisfiable(v0) | cd(v1)) & ! [v0: $i] :
% 5.22/1.56 ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rr(v0, v1) | ce(v1) |
% 5.22/1.56 cUnsatisfiable(v0) | ? [v2: $i] : ($i(v2) & ((cd(v2) & rr(v0, v2) & ~
% 5.22/1.56 ce(v2)) | (rr(v0, v2) & ~ cd(v2))))) & ! [v0: $i] : ( ~ $i(v0) | ~
% 5.22/1.56 cUnsatisfiable(v0) | ? [v1: $i] : ($i(v1) & rr(v0, v1) & ~ ce(v1)))
% 5.22/1.56
% 5.22/1.56 (axiom_4)
% 5.22/1.56 $i(i2003_11_14_17_20_32704) & cUnsatisfiable(i2003_11_14_17_20_32704)
% 5.22/1.56
% 5.22/1.56 Further assumptions not needed in the proof:
% 5.22/1.56 --------------------------------------------
% 5.22/1.56 axiom_0, axiom_1, axiom_3
% 5.22/1.56
% 5.22/1.56 Those formulas are unsatisfiable:
% 5.22/1.56 ---------------------------------
% 5.22/1.56
% 5.22/1.56 Begin of proof
% 5.22/1.56 |
% 5.22/1.56 | ALPHA: (axiom_4) implies:
% 5.22/1.57 | (1) cUnsatisfiable(i2003_11_14_17_20_32704)
% 5.22/1.57 | (2) $i(i2003_11_14_17_20_32704)
% 5.22/1.57 |
% 5.22/1.57 | ALPHA: (axiom_2) implies:
% 5.22/1.57 | (3) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] :
% 5.22/1.57 | ($i(v1) & rr(v0, v1) & ~ ce(v1)))
% 5.22/1.57 | (4) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rr(v0, v1) | ~
% 5.22/1.57 | cUnsatisfiable(v0) | cd(v1))
% 5.22/1.57 | (5) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ cd(v1) | ~
% 5.22/1.57 | rr(v0, v1) | ~ cUnsatisfiable(v0) | ce(v1))
% 5.22/1.57 |
% 5.22/1.57 | GROUND_INST: instantiating (3) with i2003_11_14_17_20_32704, simplifying with
% 5.22/1.57 | (1), (2) gives:
% 5.22/1.57 | (6) ? [v0: $i] : ($i(v0) & rr(i2003_11_14_17_20_32704, v0) & ~ ce(v0))
% 5.22/1.57 |
% 5.22/1.57 | DELTA: instantiating (6) with fresh symbol all_14_0 gives:
% 5.22/1.57 | (7) $i(all_14_0) & rr(i2003_11_14_17_20_32704, all_14_0) & ~ ce(all_14_0)
% 5.22/1.57 |
% 5.22/1.57 | ALPHA: (7) implies:
% 5.22/1.57 | (8) ~ ce(all_14_0)
% 5.22/1.57 | (9) rr(i2003_11_14_17_20_32704, all_14_0)
% 5.22/1.57 | (10) $i(all_14_0)
% 5.22/1.57 |
% 5.22/1.57 | GROUND_INST: instantiating (4) with i2003_11_14_17_20_32704, all_14_0,
% 5.22/1.57 | simplifying with (1), (2), (9), (10) gives:
% 5.22/1.57 | (11) cd(all_14_0)
% 5.22/1.57 |
% 5.22/1.58 | GROUND_INST: instantiating (5) with i2003_11_14_17_20_32704, all_14_0,
% 5.22/1.58 | simplifying with (1), (2), (8), (9), (10), (11) gives:
% 5.22/1.58 | (12) $false
% 5.22/1.58 |
% 5.22/1.58 | CLOSE: (12) is inconsistent.
% 5.22/1.58 |
% 5.22/1.58 End of proof
% 5.22/1.58 % SZS output end Proof for theBenchmark
% 5.22/1.58
% 5.22/1.58 961ms
%------------------------------------------------------------------------------