%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT045+1 : TPTP v9.3.0. Released v2.4.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 : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Tue Sep 8 06:17:25 AM UTC 2026 % Result : Theorem 7.86s 1.94s % Output : Proof 10.37s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT045+1 : TPTP v9.3.0. Released v2.4.0. % 0.00/0.04 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.09/0.35 % Computer : n015.cluster.edu % 0.09/0.35 % Model : x86_64 x86_64 % 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.35 % Memory : 8046.5625MB % 0.09/0.35 % OS : Linux 6.8.0-71-generic % 0.09/0.35 % CPULimit : 300 % 0.09/0.35 % WCLimit : 300 % 0.09/0.35 % DateTime : Mon Sep 7 13:12:00 UTC 2026 % 0.11/0.36 % CPUTime : % 0.11/0.37 OpenJDK 64-Bit Server VM warning: Options -Xverify:none and -noverify were deprecated in JDK 13 and will likely be removed in a future release. % 0.70/0.70 ________ _____ % 0.70/0.70 ___ __ \_________(_)________________________________ % 0.70/0.70 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.70/0.70 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.70/0.70 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.70/0.70 % 0.70/0.70 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.70/0.70 (2023-06-19) % 0.70/0.70 % 0.70/0.70 (c) Philipp Rümmer, 2009-2023 % 0.70/0.70 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.70/0.70 Amanda Stjerna. % 0.70/0.70 Free software under BSD-3-Clause. % 0.70/0.70 % 0.70/0.70 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.70/0.70 % 0.70/0.71 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.70/0.73 Running up to 7 provers in parallel. % 0.70/0.74 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.70/0.74 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.70/0.74 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.70/0.74 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.70/0.74 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.70/0.74 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.70/0.74 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.40/1.29 Prover 4: Preprocessing ... % 3.15/1.30 Prover 1: Preprocessing ... % 3.15/1.36 Prover 0: Preprocessing ... % 3.15/1.36 Prover 2: Preprocessing ... % 3.15/1.36 Prover 5: Preprocessing ... % 3.15/1.36 Prover 6: Preprocessing ... % 3.15/1.36 Prover 3: Preprocessing ... % 6.29/1.74 Prover 6: Constructing countermodel ... % 6.29/1.74 Prover 1: Constructing countermodel ... % 6.29/1.74 Prover 2: Proving ... % 6.29/1.75 Prover 3: Constructing countermodel ... % 6.29/1.78 Prover 5: Proving ... % 7.06/1.82 Prover 4: Constructing countermodel ... % 7.06/1.87 Prover 0: Proving ... % 7.86/1.93 Prover 3: proved (1194ms) % 7.86/1.94 % 7.86/1.94 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.86/1.94 % 7.86/1.94 Prover 6: stopped % 7.86/1.94 Prover 2: stopped % 7.86/1.95 Prover 0: stopped % 7.86/1.95 Prover 5: stopped % 7.86/1.95 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.86/1.96 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 7.86/1.96 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 7.86/1.96 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 7.86/1.96 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 7.86/2.02 Prover 8: Preprocessing ... % 7.86/2.04 Prover 7: Preprocessing ... % 8.98/2.05 Prover 1: Found proof (size 30) % 8.98/2.06 Prover 1: proved (1319ms) % 8.98/2.06 Prover 4: stopped % 8.98/2.06 Prover 10: Preprocessing ... % 8.98/2.06 Prover 13: Preprocessing ... % 8.98/2.07 Prover 11: Preprocessing ... % 8.98/2.08 Prover 7: stopped % 8.98/2.09 Prover 10: stopped % 8.98/2.10 Prover 11: stopped % 8.98/2.10 Prover 13: stopped % 9.64/2.15 Prover 8: Warning: ignoring some quantifiers % 9.64/2.17 Prover 8: Constructing countermodel ... % 9.64/2.18 Prover 8: stopped % 9.64/2.18 % 9.64/2.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 9.64/2.18 % 9.64/2.19 % SZS output start Proof for theBenchmark % 9.87/2.20 Assumptions after simplification: % 9.87/2.20 --------------------------------- % 9.87/2.20 % 9.87/2.20 (assumption_6) % 9.87/2.26 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 9.87/2.26 any] : ( ~ (position(v0, v2) = v3) | ~ (position(v0, v1) = v4) | ~ % 9.87/2.26 (greater(v3, v4) = v5) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v6: any] : % 9.87/2.26 ? [v7: $i] : ? [v8: $i] : ? [v9: any] : (organization(v0) = v6 & % 9.87/2.26 external_ties(v0, v2) = v7 & external_ties(v0, v1) = v8 & greater(v7, v8) % 9.87/2.26 = v9 & $i(v8) & $i(v7) & ( ~ (v6 = 0) | (( ~ (v9 = 0) | v5 = 0) & ( ~ (v8 % 9.87/2.26 = v7) | v4 = v3))))) % 9.87/2.26 % 9.87/2.26 (assumption_8) % 9.87/2.27 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~ % 9.87/2.27 (age(v0, v2) = v3) | ~ (age(v0, v1) = v4) | ~ (greater(v3, v4) = 0) | ~ % 9.87/2.27 $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v5: any] : ? [v6: $i] : ? [v7: $i] : % 9.87/2.27 ? [v8: any] : (organization(v0) = v5 & external_ties(v0, v2) = v6 & % 9.87/2.27 external_ties(v0, v1) = v7 & greater(v6, v7) = v8 & $i(v7) & $i(v6) & ( ~ % 9.87/2.27 (v5 = 0) | v8 = 0))) % 9.87/2.27 % 9.87/2.27 (lemma_4) % 9.87/2.28 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 9.87/2.28 $i] : ? [v6: $i] : ? [v7: int] : ( ~ (v7 = 0) & age(v0, v2) = v3 & age(v0, % 9.87/2.28 v1) = v4 & position(v0, v2) = v5 & position(v0, v1) = v6 & % 9.87/2.28 organization(v0) = 0 & greater(v5, v6) = v7 & greater(v3, v4) = 0 & $i(v6) & % 9.87/2.28 $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 9.87/2.28 % 9.87/2.28 (function-axioms) % 9.87/2.29 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (age(v3, % 9.87/2.29 v2) = v1) | ~ (age(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 9.87/2.29 $i] : ! [v3: $i] : (v1 = v0 | ~ (position(v3, v2) = v1) | ~ (position(v3, % 9.87/2.29 v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 % 9.87/2.29 = v0 | ~ (external_ties(v3, v2) = v1) | ~ (external_ties(v3, v2) = v0)) & % 9.87/2.29 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 9.87/2.29 $i] : (v1 = v0 | ~ (greater_or_equal(v3, v2) = v1) | ~ % 9.87/2.29 (greater_or_equal(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 9.87/2.29 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (greater(v3, % 9.87/2.29 v2) = v1) | ~ (greater(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! % 9.87/2.29 [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 9.87/2.29 (smaller_or_equal(v3, v2) = v1) | ~ (smaller_or_equal(v3, v2) = v0)) & ! % 9.87/2.29 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 9.87/2.29 $i] : (v1 = v0 | ~ (smaller(v3, v2) = v1) | ~ (smaller(v3, v2) = v0)) & ! % 9.87/2.29 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 % 9.87/2.29 | ~ (organization(v2) = v1) | ~ (organization(v2) = v0)) % 9.87/2.29 % 9.87/2.29 Further assumptions not needed in the proof: % 9.87/2.29 -------------------------------------------- % 9.87/2.29 definition_greater_or_equal, definition_smaller, definition_smaller_or_equal, % 9.87/2.29 meaning_postulate_greater_comparable, meaning_postulate_greater_strict, % 9.87/2.29 meaning_postulate_greater_transitive % 9.87/2.29 % 9.87/2.29 Those formulas are unsatisfiable: % 9.87/2.29 --------------------------------- % 9.87/2.29 % 9.87/2.29 Begin of proof % 9.87/2.30 | % 10.37/2.30 | ALPHA: (function-axioms) implies: % 10.37/2.30 | (1) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 10.37/2.30 | (v1 = v0 | ~ (organization(v2) = v1) | ~ (organization(v2) = v0)) % 10.37/2.30 | (2) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 10.37/2.30 | ! [v3: $i] : (v1 = v0 | ~ (greater(v3, v2) = v1) | ~ (greater(v3, % 10.37/2.30 | v2) = v0)) % 10.37/2.31 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 10.37/2.31 | (external_ties(v3, v2) = v1) | ~ (external_ties(v3, v2) = v0)) % 10.37/2.31 | % 10.37/2.31 | DELTA: instantiating (lemma_4) with fresh symbols all_11_0, all_11_1, % 10.37/2.31 | all_11_2, all_11_3, all_11_4, all_11_5, all_11_6, all_11_7 gives: % 10.37/2.31 | (4) ~ (all_11_0 = 0) & age(all_11_7, all_11_5) = all_11_4 & age(all_11_7, % 10.37/2.31 | all_11_6) = all_11_3 & position(all_11_7, all_11_5) = all_11_2 & % 10.37/2.31 | position(all_11_7, all_11_6) = all_11_1 & organization(all_11_7) = 0 & % 10.37/2.31 | greater(all_11_2, all_11_1) = all_11_0 & greater(all_11_4, all_11_3) = % 10.37/2.31 | 0 & $i(all_11_1) & $i(all_11_2) & $i(all_11_3) & $i(all_11_4) & % 10.37/2.31 | $i(all_11_5) & $i(all_11_6) & $i(all_11_7) % 10.37/2.31 | % 10.37/2.31 | ALPHA: (4) implies: % 10.37/2.31 | (5) ~ (all_11_0 = 0) % 10.37/2.31 | (6) $i(all_11_7) % 10.37/2.31 | (7) $i(all_11_6) % 10.37/2.31 | (8) $i(all_11_5) % 10.37/2.32 | (9) greater(all_11_4, all_11_3) = 0 % 10.37/2.32 | (10) greater(all_11_2, all_11_1) = all_11_0 % 10.37/2.32 | (11) organization(all_11_7) = 0 % 10.37/2.32 | (12) position(all_11_7, all_11_6) = all_11_1 % 10.37/2.32 | (13) position(all_11_7, all_11_5) = all_11_2 % 10.37/2.32 | (14) age(all_11_7, all_11_6) = all_11_3 % 10.37/2.32 | (15) age(all_11_7, all_11_5) = all_11_4 % 10.37/2.32 | % 10.37/2.32 | GROUND_INST: instantiating (assumption_6) with all_11_7, all_11_6, all_11_5, % 10.37/2.32 | all_11_2, all_11_1, all_11_0, simplifying with (6), (7), (8), % 10.37/2.32 | (10), (12), (13) gives: % 10.37/2.32 | (16) ? [v0: any] : ? [v1: $i] : ? [v2: $i] : ? [v3: any] : % 10.37/2.32 | (organization(all_11_7) = v0 & external_ties(all_11_7, all_11_5) = v1 % 10.37/2.32 | & external_ties(all_11_7, all_11_6) = v2 & greater(v1, v2) = v3 & % 10.37/2.32 | $i(v2) & $i(v1) & ( ~ (v0 = 0) | (( ~ (v3 = 0) | all_11_0 = 0) & ( ~ % 10.37/2.32 | (v2 = v1) | all_11_1 = all_11_2)))) % 10.37/2.32 | % 10.37/2.32 | GROUND_INST: instantiating (assumption_8) with all_11_7, all_11_6, all_11_5, % 10.37/2.32 | all_11_4, all_11_3, simplifying with (6), (7), (8), (9), (14), % 10.37/2.33 | (15) gives: % 10.37/2.33 | (17) ? [v0: any] : ? [v1: $i] : ? [v2: $i] : ? [v3: any] : % 10.37/2.33 | (organization(all_11_7) = v0 & external_ties(all_11_7, all_11_5) = v1 % 10.37/2.33 | & external_ties(all_11_7, all_11_6) = v2 & greater(v1, v2) = v3 & % 10.37/2.33 | $i(v2) & $i(v1) & ( ~ (v0 = 0) | v3 = 0)) % 10.37/2.33 | % 10.37/2.33 | DELTA: instantiating (17) with fresh symbols all_20_0, all_20_1, all_20_2, % 10.37/2.33 | all_20_3 gives: % 10.37/2.33 | (18) organization(all_11_7) = all_20_3 & external_ties(all_11_7, all_11_5) % 10.37/2.33 | = all_20_2 & external_ties(all_11_7, all_11_6) = all_20_1 & % 10.37/2.33 | greater(all_20_2, all_20_1) = all_20_0 & $i(all_20_1) & $i(all_20_2) & % 10.37/2.33 | ( ~ (all_20_3 = 0) | all_20_0 = 0) % 10.37/2.33 | % 10.37/2.33 | ALPHA: (18) implies: % 10.37/2.33 | (19) greater(all_20_2, all_20_1) = all_20_0 % 10.37/2.33 | (20) external_ties(all_11_7, all_11_6) = all_20_1 % 10.37/2.33 | (21) external_ties(all_11_7, all_11_5) = all_20_2 % 10.37/2.33 | (22) organization(all_11_7) = all_20_3 % 10.37/2.33 | (23) ~ (all_20_3 = 0) | all_20_0 = 0 % 10.37/2.33 | % 10.37/2.33 | DELTA: instantiating (16) with fresh symbols all_22_0, all_22_1, all_22_2, % 10.37/2.33 | all_22_3 gives: % 10.37/2.33 | (24) organization(all_11_7) = all_22_3 & external_ties(all_11_7, all_11_5) % 10.37/2.33 | = all_22_2 & external_ties(all_11_7, all_11_6) = all_22_1 & % 10.37/2.33 | greater(all_22_2, all_22_1) = all_22_0 & $i(all_22_1) & $i(all_22_2) & % 10.37/2.33 | ( ~ (all_22_3 = 0) | (( ~ (all_22_0 = 0) | all_11_0 = 0) & ( ~ % 10.37/2.33 | (all_22_1 = all_22_2) | all_11_1 = all_11_2))) % 10.37/2.33 | % 10.37/2.33 | ALPHA: (24) implies: % 10.37/2.33 | (25) greater(all_22_2, all_22_1) = all_22_0 % 10.37/2.34 | (26) external_ties(all_11_7, all_11_6) = all_22_1 % 10.37/2.34 | (27) external_ties(all_11_7, all_11_5) = all_22_2 % 10.37/2.34 | (28) organization(all_11_7) = all_22_3 % 10.37/2.34 | (29) ~ (all_22_3 = 0) | (( ~ (all_22_0 = 0) | all_11_0 = 0) & ( ~ % 10.37/2.34 | (all_22_1 = all_22_2) | all_11_1 = all_11_2)) % 10.37/2.34 | % 10.37/2.34 | GROUND_INST: instantiating (3) with all_20_1, all_22_1, all_11_6, all_11_7, % 10.37/2.34 | simplifying with (20), (26) gives: % 10.37/2.34 | (30) all_22_1 = all_20_1 % 10.37/2.34 | % 10.37/2.34 | GROUND_INST: instantiating (3) with all_20_2, all_22_2, all_11_5, all_11_7, % 10.37/2.34 | simplifying with (21), (27) gives: % 10.37/2.34 | (31) all_22_2 = all_20_2 % 10.37/2.34 | % 10.37/2.34 | GROUND_INST: instantiating (1) with 0, all_22_3, all_11_7, simplifying with % 10.37/2.34 | (11), (28) gives: % 10.37/2.34 | (32) all_22_3 = 0 % 10.37/2.34 | % 10.37/2.34 | GROUND_INST: instantiating (1) with all_20_3, all_22_3, all_11_7, simplifying % 10.37/2.34 | with (22), (28) gives: % 10.37/2.34 | (33) all_22_3 = all_20_3 % 10.37/2.34 | % 10.37/2.34 | COMBINE_EQS: (32), (33) imply: % 10.37/2.34 | (34) all_20_3 = 0 % 10.37/2.34 | % 10.37/2.34 | SIMP: (34) implies: % 10.37/2.34 | (35) all_20_3 = 0 % 10.37/2.34 | % 10.37/2.34 | REDUCE: (25), (30), (31) imply: % 10.37/2.34 | (36) greater(all_20_2, all_20_1) = all_22_0 % 10.37/2.34 | % 10.37/2.34 | BETA: splitting (23) gives: % 10.37/2.34 | % 10.37/2.34 | Case 1: % 10.37/2.34 | | % 10.37/2.34 | | (37) ~ (all_20_3 = 0) % 10.37/2.34 | | % 10.37/2.34 | | REDUCE: (35), (37) imply: % 10.37/2.34 | | (38) $false % 10.37/2.35 | | % 10.37/2.35 | | CLOSE: (38) is inconsistent. % 10.37/2.35 | | % 10.37/2.35 | Case 2: % 10.37/2.35 | | % 10.37/2.35 | | (39) all_20_0 = 0 % 10.37/2.35 | | % 10.37/2.35 | | REDUCE: (19), (39) imply: % 10.37/2.35 | | (40) greater(all_20_2, all_20_1) = 0 % 10.37/2.35 | | % 10.37/2.35 | | BETA: splitting (29) gives: % 10.37/2.35 | | % 10.37/2.35 | | Case 1: % 10.37/2.35 | | | % 10.37/2.35 | | | (41) ~ (all_22_3 = 0) % 10.37/2.35 | | | % 10.37/2.35 | | | REDUCE: (32), (41) imply: % 10.37/2.35 | | | (42) $false % 10.37/2.35 | | | % 10.37/2.35 | | | CLOSE: (42) is inconsistent. % 10.37/2.35 | | | % 10.37/2.35 | | Case 2: % 10.37/2.35 | | | % 10.37/2.35 | | | (43) ( ~ (all_22_0 = 0) | all_11_0 = 0) & ( ~ (all_22_1 = all_22_2) | % 10.37/2.35 | | | all_11_1 = all_11_2) % 10.37/2.35 | | | % 10.37/2.35 | | | ALPHA: (43) implies: % 10.37/2.35 | | | (44) ~ (all_22_0 = 0) | all_11_0 = 0 % 10.37/2.35 | | | % 10.37/2.35 | | | BETA: splitting (44) gives: % 10.37/2.35 | | | % 10.37/2.35 | | | Case 1: % 10.37/2.35 | | | | % 10.37/2.35 | | | | (45) ~ (all_22_0 = 0) % 10.37/2.35 | | | | % 10.37/2.35 | | | | GROUND_INST: instantiating (2) with 0, all_22_0, all_20_1, all_20_2, % 10.37/2.35 | | | | simplifying with (36), (40) gives: % 10.37/2.35 | | | | (46) all_22_0 = 0 % 10.37/2.35 | | | | % 10.37/2.35 | | | | REDUCE: (45), (46) imply: % 10.37/2.35 | | | | (47) $false % 10.37/2.35 | | | | % 10.37/2.35 | | | | CLOSE: (47) is inconsistent. % 10.37/2.35 | | | | % 10.37/2.35 | | | Case 2: % 10.37/2.35 | | | | % 10.37/2.35 | | | | (48) all_11_0 = 0 % 10.37/2.35 | | | | % 10.37/2.35 | | | | REDUCE: (5), (48) imply: % 10.37/2.35 | | | | (49) $false % 10.37/2.35 | | | | % 10.37/2.35 | | | | CLOSE: (49) is inconsistent. % 10.37/2.35 | | | | % 10.37/2.35 | | | End of split % 10.37/2.35 | | | % 10.37/2.35 | | End of split % 10.37/2.35 | | % 10.37/2.35 | End of split % 10.37/2.35 | % 10.37/2.35 End of proof % 10.37/2.35 % SZS output end Proof for theBenchmark % 10.37/2.35 % 10.37/2.35 1647ms %------------------------------------------------------------------------------