%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS235+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 : n006.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:42 EDT 2023 % Result : Theorem 10.32s 2.17s % Output : Proof 12.70s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : KRS235+1 : TPTP v8.1.2. Bugfixed v5.4.0. % 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.34 % Computer : n006.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.35 % CPULimit : 300 % 0.12/0.35 % WCLimit : 300 % 0.12/0.35 % DateTime : Mon Aug 28 01:54:52 EDT 2023 % 0.12/0.35 % CPUTime : % 0.21/0.58 ________ _____ % 0.21/0.58 ___ __ \_________(_)________________________________ % 0.21/0.58 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.58 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.58 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.58 % 0.21/0.58 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.58 (2023-06-19) % 0.21/0.58 % 0.21/0.58 (c) Philipp Rümmer, 2009-2023 % 0.21/0.58 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.58 Amanda Stjerna. % 0.21/0.58 Free software under BSD-3-Clause. % 0.21/0.58 % 0.21/0.58 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.58 % 0.21/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.59 Running up to 7 provers in parallel. % 0.21/0.61 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.61 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.61 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.61 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.61 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.61 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.61 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.59/1.17 Prover 4: Preprocessing ... % 3.76/1.19 Prover 2: Preprocessing ... % 3.76/1.19 Prover 3: Preprocessing ... % 3.76/1.19 Prover 5: Preprocessing ... % 3.76/1.19 Prover 0: Preprocessing ... % 3.76/1.19 Prover 6: Preprocessing ... % 3.76/1.20 Prover 1: Preprocessing ... % 8.00/1.80 Prover 5: Proving ... % 8.00/1.80 Prover 2: Proving ... % 8.78/1.93 Prover 6: Proving ... % 8.78/1.95 Prover 3: Constructing countermodel ... % 8.78/2.00 Prover 1: Constructing countermodel ... % 9.67/2.04 Prover 4: Constructing countermodel ... % 9.67/2.08 Prover 0: Proving ... % 10.32/2.17 Prover 3: proved (1560ms) % 10.32/2.17 % 10.32/2.17 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 10.32/2.17 % 10.32/2.17 Prover 6: stopped % 10.32/2.17 Prover 0: stopped % 10.32/2.17 Prover 5: stopped % 10.32/2.17 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 10.32/2.17 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 10.32/2.17 Prover 2: stopped % 10.89/2.18 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 10.89/2.18 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 10.89/2.18 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 10.89/2.23 Prover 13: Preprocessing ... % 10.89/2.23 Prover 7: Preprocessing ... % 10.89/2.24 Prover 10: Preprocessing ... % 10.89/2.25 Prover 11: Preprocessing ... % 10.89/2.27 Prover 8: Preprocessing ... % 11.62/2.28 Prover 1: Found proof (size 28) % 11.62/2.28 Prover 1: proved (1680ms) % 11.62/2.28 Prover 4: stopped % 11.62/2.28 Prover 7: stopped % 11.62/2.28 Prover 10: stopped % 11.62/2.29 Prover 13: stopped % 11.91/2.33 Prover 11: stopped % 12.33/2.43 Prover 8: Warning: ignoring some quantifiers % 12.33/2.45 Prover 8: Constructing countermodel ... % 12.33/2.46 Prover 8: stopped % 12.33/2.46 % 12.33/2.46 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 12.33/2.46 % 12.33/2.46 % SZS output start Proof for theBenchmark % 12.33/2.46 Assumptions after simplification: % 12.33/2.46 --------------------------------- % 12.33/2.46 % 12.33/2.46 (completeness) % 12.70/2.49 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ (not(v1) % 12.70/2.49 = v2) | ~ (model(v0, v2) = v3) | ~ $i(v1) | ~ $i(v0) | model(v0, v1) = % 12.70/2.49 0) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (not(v1) = v2) | ~ % 12.70/2.49 (model(v0, v2) = 0) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & % 12.70/2.49 model(v0, v1) = v3)) % 12.70/2.49 % 12.70/2.49 (nevera) % 12.70/2.49 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (nevera(v0, v1) = v2) % 12.70/2.49 | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: $i] : (status(v3, v4, v1) = % 12.70/2.49 0 & status(v3, v4, v0) = 0 & $i(v4) & $i(v3))) & ! [v0: $i] : ! [v1: $i] % 12.70/2.49 : ( ~ (nevera(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | ! [v2: $i] : ! [v3: $i] % 12.70/2.49 : ( ~ (status(v2, v3, v0) = 0) | ~ $i(v3) | ~ $i(v2) | ? [v4: int] : ( ~ % 12.70/2.49 (v4 = 0) & status(v2, v3, v1) = v4))) % 12.70/2.49 % 12.70/2.49 (nevera_noc_thm) % 12.70/2.49 $i(noc) & $i(thm) & ? [v0: int] : ( ~ (v0 = 0) & nevera(noc, thm) = v0) % 12.70/2.49 % 12.70/2.49 (noc) % 12.70/2.49 $i(noc) & ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (status(v0, % 12.70/2.49 v1, noc) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : (not(v1) = v3 & % 12.70/2.49 $i(v3) & ! [v4: $i] : ( ~ (model(v4, v3) = 0) | ~ $i(v4) | ? [v5: int] % 12.70/2.49 : ( ~ (v5 = 0) & model(v4, v0) = v5))) | ! [v3: $i] : ( ~ (model(v3, % 12.70/2.49 v0) = 0) | ~ $i(v3) | ? [v4: int] : ( ~ (v4 = 0) & model(v3, v1) = % 12.70/2.49 v4))) & ! [v0: $i] : ! [v1: $i] : ( ~ (status(v0, v1, noc) = 0) | ~ % 12.70/2.49 $i(v1) | ~ $i(v0) | ( ? [v2: $i] : (not(v1) = v2 & $i(v2) & ? [v3: $i] : % 12.70/2.49 (model(v3, v2) = 0 & model(v3, v0) = 0 & $i(v3))) & ? [v2: $i] : % 12.70/2.49 (model(v2, v1) = 0 & model(v2, v0) = 0 & $i(v2)))) % 12.70/2.49 % 12.70/2.49 (not) % 12.70/2.50 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ (not(v1) % 12.70/2.50 = v2) | ~ (model(v0, v2) = v3) | ~ $i(v1) | ~ $i(v0) | model(v0, v1) = % 12.70/2.50 0) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (not(v1) = v2) | ~ % 12.70/2.50 (model(v0, v2) = 0) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & % 12.70/2.50 model(v0, v1) = v3)) % 12.70/2.50 % 12.70/2.50 (thm) % 12.70/2.50 $i(thm) & ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (status(v0, % 12.70/2.50 v1, thm) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: int] : ( % 12.70/2.50 ~ (v4 = 0) & model(v3, v1) = v4 & model(v3, v0) = 0 & $i(v3))) & ! [v0: % 12.70/2.50 $i] : ! [v1: $i] : ( ~ (status(v0, v1, thm) = 0) | ~ $i(v1) | ~ $i(v0) | % 12.70/2.50 ! [v2: $i] : ( ~ (model(v2, v0) = 0) | ~ $i(v2) | model(v2, v1) = 0)) % 12.70/2.50 % 12.70/2.50 (function-axioms) % 12.70/2.50 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 12.70/2.50 [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (status(v4, v3, v2) = v1) | ~ % 12.70/2.50 (status(v4, v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 12.70/2.50 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (xora(v3, v2) % 12.70/2.50 = v1) | ~ (xora(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 12.70/2.50 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (nevera(v3, % 12.70/2.50 v2) = v1) | ~ (nevera(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! % 12.70/2.50 [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (nota(v3, % 12.70/2.50 v2) = v1) | ~ (nota(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! % 12.70/2.50 [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (isa(v3, % 12.70/2.50 v2) = v1) | ~ (isa(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! % 12.70/2.50 [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 12.70/2.50 (mighta(v3, v2) = v1) | ~ (mighta(v3, v2) = v0)) & ! [v0: % 12.70/2.50 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 12.70/2.50 : (v1 = v0 | ~ (model(v3, v2) = v1) | ~ (model(v3, v2) = v0)) & ! [v0: $i] % 12.70/2.50 : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (not(v2) = v1) | ~ (not(v2) = % 12.70/2.50 v0)) % 12.70/2.50 % 12.70/2.50 Further assumptions not needed in the proof: % 12.70/2.50 -------------------------------------------- % 12.70/2.50 cax, contradiction, csa, eqv, esa, eth, isa, mighta, mixed_pair, non_thm_spt, % 12.70/2.50 nota, sap, sat, sat_non_taut_pair, satisfiable, sca, tac, tau, tautology, tca, % 12.70/2.50 unp, uns, wca, wec, wtc, wth, xora % 12.70/2.50 % 12.70/2.50 Those formulas are unsatisfiable: % 12.70/2.50 --------------------------------- % 12.70/2.50 % 12.70/2.50 Begin of proof % 12.70/2.50 | % 12.70/2.50 | ALPHA: (thm) implies: % 12.70/2.50 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (status(v0, v1, thm) = 0) | ~ $i(v1) | % 12.70/2.50 | ~ $i(v0) | ! [v2: $i] : ( ~ (model(v2, v0) = 0) | ~ $i(v2) | % 12.70/2.50 | model(v2, v1) = 0)) % 12.70/2.50 | % 12.70/2.50 | ALPHA: (noc) implies: % 12.70/2.50 | (2) ! [v0: $i] : ! [v1: $i] : ( ~ (status(v0, v1, noc) = 0) | ~ $i(v1) | % 12.70/2.50 | ~ $i(v0) | ( ? [v2: $i] : (not(v1) = v2 & $i(v2) & ? [v3: $i] : % 12.70/2.50 | (model(v3, v2) = 0 & model(v3, v0) = 0 & $i(v3))) & ? [v2: $i] : % 12.70/2.50 | (model(v2, v1) = 0 & model(v2, v0) = 0 & $i(v2)))) % 12.70/2.51 | % 12.70/2.51 | ALPHA: (nevera) implies: % 12.70/2.51 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (nevera(v0, v1) % 12.70/2.51 | = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: $i] : % 12.70/2.51 | (status(v3, v4, v1) = 0 & status(v3, v4, v0) = 0 & $i(v4) & $i(v3))) % 12.70/2.51 | % 12.70/2.51 | ALPHA: (not) implies: % 12.70/2.51 | (4) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (not(v1) = v2) | ~ % 12.70/2.51 | (model(v0, v2) = 0) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 % 12.70/2.51 | = 0) & model(v0, v1) = v3)) % 12.70/2.51 | % 12.70/2.51 | ALPHA: (nevera_noc_thm) implies: % 12.70/2.51 | (5) $i(thm) % 12.70/2.51 | (6) $i(noc) % 12.70/2.51 | (7) ? [v0: int] : ( ~ (v0 = 0) & nevera(noc, thm) = v0) % 12.70/2.51 | % 12.70/2.51 | ALPHA: (function-axioms) implies: % 12.70/2.51 | (8) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 12.70/2.51 | ! [v3: $i] : (v1 = v0 | ~ (model(v3, v2) = v1) | ~ (model(v3, v2) = % 12.70/2.51 | v0)) % 12.70/2.51 | % 12.70/2.51 | DELTA: instantiating (7) with fresh symbol all_30_0 gives: % 12.70/2.51 | (9) ~ (all_30_0 = 0) & nevera(noc, thm) = all_30_0 % 12.70/2.51 | % 12.70/2.51 | ALPHA: (9) implies: % 12.70/2.51 | (10) ~ (all_30_0 = 0) % 12.70/2.51 | (11) nevera(noc, thm) = all_30_0 % 12.70/2.51 | % 12.70/2.51 | GROUND_INST: instantiating (3) with noc, thm, all_30_0, simplifying with (5), % 12.70/2.51 | (6), (11) gives: % 12.70/2.51 | (12) all_30_0 = 0 | ? [v0: $i] : ? [v1: $i] : (status(v0, v1, noc) = 0 & % 12.70/2.51 | status(v0, v1, thm) = 0 & $i(v1) & $i(v0)) % 12.70/2.51 | % 12.70/2.51 | BETA: splitting (12) gives: % 12.70/2.51 | % 12.70/2.51 | Case 1: % 12.70/2.51 | | % 12.70/2.51 | | (13) all_30_0 = 0 % 12.70/2.51 | | % 12.70/2.51 | | REDUCE: (10), (13) imply: % 12.70/2.51 | | (14) $false % 12.70/2.51 | | % 12.70/2.51 | | CLOSE: (14) is inconsistent. % 12.70/2.51 | | % 12.70/2.51 | Case 2: % 12.70/2.51 | | % 12.70/2.51 | | (15) ? [v0: $i] : ? [v1: $i] : (status(v0, v1, noc) = 0 & status(v0, % 12.70/2.51 | | v1, thm) = 0 & $i(v1) & $i(v0)) % 12.70/2.51 | | % 12.70/2.51 | | DELTA: instantiating (15) with fresh symbols all_73_0, all_73_1 gives: % 12.70/2.51 | | (16) status(all_73_1, all_73_0, noc) = 0 & status(all_73_1, all_73_0, % 12.70/2.51 | | thm) = 0 & $i(all_73_0) & $i(all_73_1) % 12.70/2.51 | | % 12.70/2.51 | | ALPHA: (16) implies: % 12.70/2.51 | | (17) $i(all_73_1) % 12.70/2.51 | | (18) $i(all_73_0) % 12.70/2.51 | | (19) status(all_73_1, all_73_0, thm) = 0 % 12.70/2.51 | | (20) status(all_73_1, all_73_0, noc) = 0 % 12.70/2.51 | | % 12.70/2.51 | | GROUND_INST: instantiating (1) with all_73_1, all_73_0, simplifying with % 12.70/2.51 | | (17), (18), (19) gives: % 12.70/2.52 | | (21) ! [v0: $i] : ( ~ (model(v0, all_73_1) = 0) | ~ $i(v0) | model(v0, % 12.70/2.52 | | all_73_0) = 0) % 12.70/2.52 | | % 12.70/2.52 | | GROUND_INST: instantiating (2) with all_73_1, all_73_0, simplifying with % 12.70/2.52 | | (17), (18), (20) gives: % 12.70/2.52 | | (22) ? [v0: $i] : (not(all_73_0) = v0 & $i(v0) & ? [v1: $i] : % 12.70/2.52 | | (model(v1, v0) = 0 & model(v1, all_73_1) = 0 & $i(v1))) & ? [v0: % 12.70/2.52 | | $i] : (model(v0, all_73_0) = 0 & model(v0, all_73_1) = 0 & $i(v0)) % 12.70/2.52 | | % 12.70/2.52 | | ALPHA: (22) implies: % 12.70/2.52 | | (23) ? [v0: $i] : (not(all_73_0) = v0 & $i(v0) & ? [v1: $i] : % 12.70/2.52 | | (model(v1, v0) = 0 & model(v1, all_73_1) = 0 & $i(v1))) % 12.70/2.52 | | % 12.70/2.52 | | DELTA: instantiating (23) with fresh symbol all_83_0 gives: % 12.70/2.52 | | (24) not(all_73_0) = all_83_0 & $i(all_83_0) & ? [v0: $i] : (model(v0, % 12.70/2.52 | | all_83_0) = 0 & model(v0, all_73_1) = 0 & $i(v0)) % 12.70/2.52 | | % 12.70/2.52 | | ALPHA: (24) implies: % 12.70/2.52 | | (25) not(all_73_0) = all_83_0 % 12.70/2.52 | | (26) ? [v0: $i] : (model(v0, all_83_0) = 0 & model(v0, all_73_1) = 0 & % 12.70/2.52 | | $i(v0)) % 12.70/2.52 | | % 12.70/2.52 | | DELTA: instantiating (26) with fresh symbol all_85_0 gives: % 12.70/2.52 | | (27) model(all_85_0, all_83_0) = 0 & model(all_85_0, all_73_1) = 0 & % 12.70/2.52 | | $i(all_85_0) % 12.70/2.52 | | % 12.70/2.52 | | ALPHA: (27) implies: % 12.70/2.52 | | (28) $i(all_85_0) % 12.70/2.52 | | (29) model(all_85_0, all_73_1) = 0 % 12.70/2.52 | | (30) model(all_85_0, all_83_0) = 0 % 12.70/2.52 | | % 12.70/2.52 | | GROUND_INST: instantiating (21) with all_85_0, simplifying with (28), (29) % 12.70/2.52 | | gives: % 12.70/2.52 | | (31) model(all_85_0, all_73_0) = 0 % 12.70/2.52 | | % 12.70/2.52 | | GROUND_INST: instantiating (4) with all_85_0, all_73_0, all_83_0, % 12.70/2.52 | | simplifying with (18), (25), (28), (30) gives: % 12.70/2.52 | | (32) ? [v0: int] : ( ~ (v0 = 0) & model(all_85_0, all_73_0) = v0) % 12.70/2.52 | | % 12.70/2.52 | | DELTA: instantiating (32) with fresh symbol all_93_0 gives: % 12.70/2.52 | | (33) ~ (all_93_0 = 0) & model(all_85_0, all_73_0) = all_93_0 % 12.70/2.52 | | % 12.70/2.52 | | ALPHA: (33) implies: % 12.70/2.52 | | (34) ~ (all_93_0 = 0) % 12.70/2.52 | | (35) model(all_85_0, all_73_0) = all_93_0 % 12.70/2.52 | | % 12.70/2.52 | | GROUND_INST: instantiating (8) with 0, all_93_0, all_73_0, all_85_0, % 12.70/2.52 | | simplifying with (31), (35) gives: % 12.70/2.52 | | (36) all_93_0 = 0 % 12.70/2.52 | | % 12.70/2.52 | | REDUCE: (34), (36) imply: % 12.70/2.52 | | (37) $false % 12.70/2.52 | | % 12.70/2.52 | | CLOSE: (37) is inconsistent. % 12.70/2.52 | | % 12.70/2.52 | End of split % 12.70/2.52 | % 12.70/2.52 End of proof % 12.70/2.52 % SZS output end Proof for theBenchmark % 12.70/2.52 % 12.70/2.52 1938ms %------------------------------------------------------------------------------