%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS189+1 : TPTP v8.1.2. Bugfixed v5.4.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n002.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:35 EDT 2023 % Result : Theorem 12.70s 2.56s % Output : Proof 16.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : KRS189+1 : TPTP v8.1.2. Bugfixed v5.4.0. % 0.07/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.35 % Computer : n002.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:29:34 EDT 2023 % 0.13/0.36 % CPUTime : % 0.20/0.63 ________ _____ % 0.20/0.63 ___ __ \_________(_)________________________________ % 0.20/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.63 % 0.20/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.63 (2023-06-19) % 0.20/0.63 % 0.20/0.63 (c) Philipp Rümmer, 2009-2023 % 0.20/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.63 Amanda Stjerna. % 0.20/0.63 Free software under BSD-3-Clause. % 0.20/0.63 % 0.20/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.63 % 0.20/0.63 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.64 Running up to 7 provers in parallel. % 0.20/0.67 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.67 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.67 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.67 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.67 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.67 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.67 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.58/1.21 Prover 4: Preprocessing ... % 3.58/1.21 Prover 1: Preprocessing ... % 3.58/1.23 Prover 0: Preprocessing ... % 3.58/1.23 Prover 2: Preprocessing ... % 3.58/1.23 Prover 6: Preprocessing ... % 3.58/1.23 Prover 3: Preprocessing ... % 3.58/1.24 Prover 5: Preprocessing ... % 8.04/1.96 Prover 2: Proving ... % 8.04/1.96 Prover 5: Proving ... % 10.32/2.19 Prover 6: Proving ... % 10.68/2.25 Prover 3: Constructing countermodel ... % 10.68/2.31 Prover 4: Constructing countermodel ... % 10.68/2.31 Prover 1: Constructing countermodel ... % 11.42/2.38 Prover 0: Proving ... % 12.70/2.55 Prover 3: proved (1886ms) % 12.70/2.55 % 12.70/2.56 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 12.70/2.56 % 12.70/2.56 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 12.70/2.57 Prover 5: stopped % 12.70/2.57 Prover 6: stopped % 12.70/2.57 Prover 0: stopped % 12.70/2.57 Prover 2: stopped % 12.70/2.58 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 12.70/2.59 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 12.70/2.59 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 12.70/2.60 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 13.27/2.66 Prover 11: Preprocessing ... % 13.27/2.68 Prover 8: Preprocessing ... % 13.27/2.68 Prover 7: Preprocessing ... % 13.27/2.69 Prover 10: Preprocessing ... % 13.27/2.70 Prover 13: Preprocessing ... % 14.31/2.74 Prover 1: Found proof (size 26) % 14.31/2.74 Prover 1: proved (2076ms) % 14.31/2.74 Prover 10: stopped % 14.31/2.75 Prover 4: stopped % 14.31/2.75 Prover 7: stopped % 14.31/2.77 Prover 13: stopped % 14.31/2.77 Prover 11: stopped % 15.60/2.97 Prover 8: Warning: ignoring some quantifiers % 15.60/2.99 Prover 8: Constructing countermodel ... % 15.71/3.01 Prover 8: stopped % 15.71/3.01 % 15.71/3.01 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 15.71/3.01 % 15.71/3.02 % SZS output start Proof for theBenchmark % 15.83/3.02 Assumptions after simplification: % 15.83/3.02 --------------------------------- % 15.83/3.02 % 15.83/3.02 (eth) % 15.83/3.07 $i(eth) & ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (status(v0, % 15.83/3.07 v1, eth) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: any] : ? % 15.83/3.07 [v5: any] : (model(v3, v1) = v5 & model(v3, v0) = v4 & $i(v3) & ( ~ (v5 = 0) % 15.83/3.07 | ~ (v4 = 0)) & (v5 = 0 | v4 = 0)) | ! [v3: $i] : ! [v4: int] : (v4 = % 15.83/3.07 0 | ~ (model(v3, v0) = v4) | ~ $i(v3)) | ! [v3: $i] : ( ~ (model(v3, % 15.83/3.07 v0) = 0) | ~ $i(v3))) & ! [v0: $i] : ! [v1: $i] : ( ~ (status(v0, % 15.83/3.07 v1, eth) = 0) | ~ $i(v1) | ~ $i(v0) | ( ! [v2: $i] : ! [v3: int] : % 15.83/3.07 (v3 = 0 | ~ (model(v2, v0) = v3) | ~ $i(v2) | ? [v4: int] : ( ~ (v4 = % 15.83/3.07 0) & model(v2, v1) = v4)) & ! [v2: $i] : ( ~ (model(v2, v0) = 0) | % 15.83/3.07 ~ $i(v2) | model(v2, v1) = 0) & ? [v2: $i] : ? [v3: int] : ( ~ (v3 = % 15.83/3.07 0) & model(v2, v0) = v3 & $i(v2)) & ? [v2: $i] : (model(v2, v0) = 0 & % 15.83/3.07 $i(v2)))) % 15.83/3.08 % 15.83/3.08 (isa) % 15.83/3.08 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (isa(v0, v1) = v2) | % 15.83/3.08 ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: $i] : ? [v5: int] : ( ~ (v5 = % 15.83/3.08 0) & status(v3, v4, v1) = v5 & status(v3, v4, v0) = 0 & $i(v4) & % 15.83/3.08 $i(v3))) & ! [v0: $i] : ! [v1: $i] : ( ~ (isa(v0, v1) = 0) | ~ $i(v1) | % 15.83/3.08 ~ $i(v0) | ! [v2: $i] : ! [v3: $i] : ( ~ (status(v2, v3, v0) = 0) | ~ % 15.83/3.08 $i(v3) | ~ $i(v2) | status(v2, v3, v1) = 0)) % 15.83/3.08 % 15.83/3.08 (isa_eth_thm) % 15.83/3.08 $i(eth) & $i(thm) & ? [v0: int] : ( ~ (v0 = 0) & isa(eth, thm) = v0) % 15.83/3.08 % 15.83/3.08 (thm) % 15.83/3.08 $i(thm) & ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (status(v0, % 15.83/3.08 v1, thm) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: int] : ( % 15.83/3.09 ~ (v4 = 0) & model(v3, v1) = v4 & model(v3, v0) = 0 & $i(v3))) & ! [v0: % 15.83/3.09 $i] : ! [v1: $i] : ( ~ (status(v0, v1, thm) = 0) | ~ $i(v1) | ~ $i(v0) | % 15.83/3.09 ! [v2: $i] : ( ~ (model(v2, v0) = 0) | ~ $i(v2) | model(v2, v1) = 0)) % 15.83/3.09 % 15.83/3.09 (function-axioms) % 15.83/3.09 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 15.83/3.09 [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (status(v4, v3, v2) = v1) | ~ % 15.83/3.09 (status(v4, v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 15.83/3.09 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (xora(v3, v2) % 15.83/3.09 = v1) | ~ (xora(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 15.83/3.09 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (nevera(v3, % 15.83/3.09 v2) = v1) | ~ (nevera(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! % 15.83/3.09 [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (nota(v3, % 15.83/3.09 v2) = v1) | ~ (nota(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! % 15.83/3.09 [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (isa(v3, % 15.83/3.09 v2) = v1) | ~ (isa(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! % 15.83/3.09 [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 15.83/3.09 (mighta(v3, v2) = v1) | ~ (mighta(v3, v2) = v0)) & ! [v0: % 15.83/3.09 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 15.83/3.09 : (v1 = v0 | ~ (model(v3, v2) = v1) | ~ (model(v3, v2) = v0)) & ! [v0: $i] % 15.83/3.09 : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (not(v2) = v1) | ~ (not(v2) = % 15.83/3.09 v0)) % 15.83/3.09 % 15.83/3.09 Further assumptions not needed in the proof: % 15.83/3.09 -------------------------------------------- % 15.83/3.09 cax, completeness, contradiction, csa, eqv, esa, mighta, mixed_pair, nevera, % 15.83/3.09 noc, non_thm_spt, not, nota, sap, sat, sat_non_taut_pair, satisfiable, sca, tac, % 15.83/3.09 tau, tautology, tca, unp, uns, wca, wec, wtc, wth, xora % 15.83/3.09 % 15.83/3.09 Those formulas are unsatisfiable: % 15.83/3.09 --------------------------------- % 15.83/3.09 % 15.83/3.09 Begin of proof % 15.83/3.10 | % 15.83/3.10 | ALPHA: (thm) implies: % 15.83/3.10 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (status(v0, v1, % 15.83/3.10 | thm) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: int] : % 16.20/3.10 | ( ~ (v4 = 0) & model(v3, v1) = v4 & model(v3, v0) = 0 & $i(v3))) % 16.20/3.10 | % 16.20/3.10 | ALPHA: (eth) implies: % 16.20/3.10 | (2) ! [v0: $i] : ! [v1: $i] : ( ~ (status(v0, v1, eth) = 0) | ~ $i(v1) | % 16.20/3.10 | ~ $i(v0) | ( ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ (model(v2, v0) % 16.20/3.10 | = v3) | ~ $i(v2) | ? [v4: int] : ( ~ (v4 = 0) & model(v2, v1) % 16.20/3.10 | = v4)) & ! [v2: $i] : ( ~ (model(v2, v0) = 0) | ~ $i(v2) | % 16.20/3.10 | model(v2, v1) = 0) & ? [v2: $i] : ? [v3: int] : ( ~ (v3 = 0) & % 16.20/3.10 | model(v2, v0) = v3 & $i(v2)) & ? [v2: $i] : (model(v2, v0) = 0 & % 16.20/3.10 | $i(v2)))) % 16.20/3.10 | % 16.20/3.10 | ALPHA: (isa) implies: % 16.20/3.11 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (isa(v0, v1) = % 16.20/3.11 | v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: $i] : ? [v5: % 16.20/3.11 | int] : ( ~ (v5 = 0) & status(v3, v4, v1) = v5 & status(v3, v4, v0) % 16.20/3.11 | = 0 & $i(v4) & $i(v3))) % 16.20/3.11 | % 16.20/3.11 | ALPHA: (isa_eth_thm) implies: % 16.20/3.11 | (4) $i(thm) % 16.20/3.11 | (5) $i(eth) % 16.20/3.11 | (6) ? [v0: int] : ( ~ (v0 = 0) & isa(eth, thm) = v0) % 16.20/3.11 | % 16.20/3.11 | ALPHA: (function-axioms) implies: % 16.20/3.11 | (7) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 16.20/3.11 | ! [v3: $i] : (v1 = v0 | ~ (model(v3, v2) = v1) | ~ (model(v3, v2) = % 16.20/3.11 | v0)) % 16.20/3.11 | % 16.20/3.11 | DELTA: instantiating (6) with fresh symbol all_30_0 gives: % 16.20/3.11 | (8) ~ (all_30_0 = 0) & isa(eth, thm) = all_30_0 % 16.20/3.11 | % 16.20/3.11 | ALPHA: (8) implies: % 16.20/3.11 | (9) ~ (all_30_0 = 0) % 16.20/3.11 | (10) isa(eth, thm) = all_30_0 % 16.20/3.11 | % 16.20/3.11 | GROUND_INST: instantiating (3) with eth, thm, all_30_0, simplifying with (4), % 16.20/3.11 | (5), (10) gives: % 16.20/3.11 | (11) all_30_0 = 0 | ? [v0: $i] : ? [v1: $i] : ? [v2: int] : ( ~ (v2 = 0) % 16.20/3.11 | & status(v0, v1, eth) = 0 & status(v0, v1, thm) = v2 & $i(v1) & % 16.20/3.11 | $i(v0)) % 16.20/3.11 | % 16.20/3.11 | BETA: splitting (11) gives: % 16.20/3.12 | % 16.20/3.12 | Case 1: % 16.20/3.12 | | % 16.20/3.12 | | (12) all_30_0 = 0 % 16.20/3.12 | | % 16.20/3.12 | | REDUCE: (9), (12) imply: % 16.20/3.12 | | (13) $false % 16.20/3.12 | | % 16.20/3.12 | | CLOSE: (13) is inconsistent. % 16.20/3.12 | | % 16.20/3.12 | Case 2: % 16.20/3.12 | | % 16.20/3.12 | | (14) ? [v0: $i] : ? [v1: $i] : ? [v2: int] : ( ~ (v2 = 0) & status(v0, % 16.20/3.12 | | v1, eth) = 0 & status(v0, v1, thm) = v2 & $i(v1) & $i(v0)) % 16.20/3.12 | | % 16.20/3.12 | | DELTA: instantiating (14) with fresh symbols all_73_0, all_73_1, all_73_2 % 16.20/3.12 | | gives: % 16.20/3.12 | | (15) ~ (all_73_0 = 0) & status(all_73_2, all_73_1, eth) = 0 & % 16.20/3.12 | | status(all_73_2, all_73_1, thm) = all_73_0 & $i(all_73_1) & % 16.20/3.12 | | $i(all_73_2) % 16.20/3.12 | | % 16.20/3.12 | | ALPHA: (15) implies: % 16.20/3.12 | | (16) ~ (all_73_0 = 0) % 16.20/3.12 | | (17) $i(all_73_2) % 16.20/3.12 | | (18) $i(all_73_1) % 16.20/3.12 | | (19) status(all_73_2, all_73_1, thm) = all_73_0 % 16.20/3.12 | | (20) status(all_73_2, all_73_1, eth) = 0 % 16.20/3.12 | | % 16.20/3.12 | | GROUND_INST: instantiating (1) with all_73_2, all_73_1, all_73_0, % 16.20/3.12 | | simplifying with (17), (18), (19) gives: % 16.20/3.12 | | (21) all_73_0 = 0 | ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & model(v0, % 16.20/3.12 | | all_73_1) = v1 & model(v0, all_73_2) = 0 & $i(v0)) % 16.20/3.12 | | % 16.20/3.12 | | GROUND_INST: instantiating (2) with all_73_2, all_73_1, simplifying with % 16.20/3.12 | | (17), (18), (20) gives: % 16.20/3.13 | | (22) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (model(v0, all_73_2) = v1) % 16.20/3.13 | | | ~ $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & model(v0, all_73_1) = % 16.20/3.13 | | v2)) & ! [v0: $i] : ( ~ (model(v0, all_73_2) = 0) | ~ $i(v0) | % 16.20/3.13 | | model(v0, all_73_1) = 0) & ? [v0: $i] : ? [v1: int] : ( ~ (v1 = % 16.20/3.13 | | 0) & model(v0, all_73_2) = v1 & $i(v0)) & ? [v0: $i] : % 16.20/3.13 | | (model(v0, all_73_2) = 0 & $i(v0)) % 16.20/3.13 | | % 16.20/3.13 | | ALPHA: (22) implies: % 16.20/3.13 | | (23) ! [v0: $i] : ( ~ (model(v0, all_73_2) = 0) | ~ $i(v0) | model(v0, % 16.20/3.13 | | all_73_1) = 0) % 16.20/3.13 | | % 16.20/3.13 | | BETA: splitting (21) gives: % 16.20/3.13 | | % 16.20/3.13 | | Case 1: % 16.20/3.13 | | | % 16.20/3.13 | | | (24) all_73_0 = 0 % 16.20/3.13 | | | % 16.20/3.13 | | | REDUCE: (16), (24) imply: % 16.20/3.13 | | | (25) $false % 16.20/3.13 | | | % 16.20/3.13 | | | CLOSE: (25) is inconsistent. % 16.20/3.13 | | | % 16.20/3.13 | | Case 2: % 16.20/3.13 | | | % 16.20/3.13 | | | (26) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & model(v0, all_73_1) = % 16.20/3.13 | | | v1 & model(v0, all_73_2) = 0 & $i(v0)) % 16.20/3.13 | | | % 16.20/3.13 | | | DELTA: instantiating (26) with fresh symbols all_89_0, all_89_1 gives: % 16.20/3.13 | | | (27) ~ (all_89_0 = 0) & model(all_89_1, all_73_1) = all_89_0 & % 16.20/3.13 | | | model(all_89_1, all_73_2) = 0 & $i(all_89_1) % 16.20/3.13 | | | % 16.20/3.13 | | | ALPHA: (27) implies: % 16.20/3.13 | | | (28) ~ (all_89_0 = 0) % 16.20/3.13 | | | (29) $i(all_89_1) % 16.20/3.13 | | | (30) model(all_89_1, all_73_2) = 0 % 16.20/3.13 | | | (31) model(all_89_1, all_73_1) = all_89_0 % 16.20/3.13 | | | % 16.20/3.13 | | | GROUND_INST: instantiating (23) with all_89_1, simplifying with (29), (30) % 16.20/3.13 | | | gives: % 16.20/3.13 | | | (32) model(all_89_1, all_73_1) = 0 % 16.20/3.13 | | | % 16.20/3.13 | | | GROUND_INST: instantiating (7) with all_89_0, 0, all_73_1, all_89_1, % 16.20/3.13 | | | simplifying with (31), (32) gives: % 16.20/3.13 | | | (33) all_89_0 = 0 % 16.20/3.14 | | | % 16.20/3.14 | | | REDUCE: (28), (33) imply: % 16.20/3.14 | | | (34) $false % 16.20/3.14 | | | % 16.20/3.14 | | | CLOSE: (34) is inconsistent. % 16.20/3.14 | | | % 16.20/3.14 | | End of split % 16.20/3.14 | | % 16.20/3.14 | End of split % 16.20/3.14 | % 16.20/3.14 End of proof % 16.20/3.14 % SZS output end Proof for theBenchmark % 16.20/3.14 % 16.20/3.14 2505ms %------------------------------------------------------------------------------