%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT049+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:26 AM UTC 2026 % Result : Theorem 8.68s 2.02s % Output : Proof 12.22s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT049+1 : TPTP v9.3.0. Released v2.4.0. % 0.00/0.03 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.08/0.35 % Computer : n015.cluster.edu % 0.08/0.35 % Model : x86_64 x86_64 % 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.35 % Memory : 8046.5625MB % 0.08/0.35 % OS : Linux 6.8.0-71-generic % 0.08/0.35 % CPULimit : 300 % 0.08/0.35 % WCLimit : 300 % 0.08/0.35 % DateTime : Mon Sep 7 13:19:15 UTC 2026 % 0.08/0.35 % CPUTime : % 0.12/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.72/0.71 ________ _____ % 0.72/0.71 ___ __ \_________(_)________________________________ % 0.72/0.71 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.72/0.71 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.72/0.71 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.72/0.71 % 0.72/0.71 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.72/0.71 (2023-06-19) % 0.72/0.71 % 0.72/0.71 (c) Philipp Rümmer, 2009-2023 % 0.72/0.71 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.72/0.71 Amanda Stjerna. % 0.72/0.71 Free software under BSD-3-Clause. % 0.72/0.71 % 0.72/0.71 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.72/0.71 % 0.72/0.71 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.72/0.73 Running up to 7 provers in parallel. % 0.72/0.75 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.72/0.75 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.72/0.75 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.72/0.75 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.72/0.75 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.72/0.75 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.72/0.75 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.92/1.15 Prover 4: Preprocessing ... % 2.92/1.17 Prover 1: Preprocessing ... % 3.26/1.22 Prover 5: Preprocessing ... % 3.26/1.22 Prover 3: Preprocessing ... % 3.26/1.22 Prover 6: Preprocessing ... % 3.26/1.22 Prover 2: Preprocessing ... % 3.26/1.22 Prover 0: Preprocessing ... % 5.60/1.57 Prover 6: Constructing countermodel ... % 5.60/1.57 Prover 1: Constructing countermodel ... % 5.60/1.58 Prover 3: Constructing countermodel ... % 5.60/1.58 Prover 2: Proving ... % 5.60/1.58 Prover 5: Proving ... % 6.36/1.66 Prover 4: Constructing countermodel ... % 7.09/1.73 Prover 0: Proving ... % 7.09/1.74 Prover 3: gave up % 7.09/1.74 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.09/1.75 Prover 1: gave up % 7.09/1.75 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 7.09/1.76 Prover 6: gave up % 7.09/1.77 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 7.09/1.79 Prover 8: Preprocessing ... % 7.92/1.81 Prover 7: Preprocessing ... % 7.92/1.84 Prover 9: Preprocessing ... % 7.92/1.88 Prover 4: gave up % 7.92/1.89 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 8.68/1.95 Prover 10: Preprocessing ... % 8.68/1.97 Prover 7: Warning: ignoring some quantifiers % 8.68/1.97 Prover 8: Warning: ignoring some quantifiers % 8.68/1.98 Prover 8: Constructing countermodel ... % 8.68/1.98 Prover 7: Constructing countermodel ... % 8.68/2.01 Prover 2: proved (1270ms) % 8.68/2.02 % 8.68/2.02 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.68/2.02 % 8.68/2.02 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 8.68/2.02 Prover 5: stopped % 8.68/2.02 Prover 0: stopped % 8.68/2.03 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 8.68/2.03 Prover 10: Warning: ignoring some quantifiers % 8.68/2.04 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 8.68/2.04 Prover 10: Constructing countermodel ... % 9.83/2.06 Prover 13: Preprocessing ... % 9.83/2.07 Prover 8: gave up % 9.83/2.07 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085 % 9.83/2.07 Prover 11: Preprocessing ... % 9.83/2.08 Prover 16: Preprocessing ... % 9.83/2.12 Prover 16: Warning: ignoring some quantifiers % 9.83/2.13 Prover 16: Constructing countermodel ... % 9.83/2.13 Prover 19: Preprocessing ... % 9.83/2.14 Prover 13: Warning: ignoring some quantifiers % 9.83/2.14 Prover 9: Constructing countermodel ... % 10.64/2.15 Prover 13: Constructing countermodel ... % 10.64/2.16 Prover 9: stopped % 10.99/2.24 Prover 11: Constructing countermodel ... % 10.99/2.28 Prover 10: Found proof (size 26) % 10.99/2.28 Prover 10: proved (398ms) % 10.99/2.29 Prover 13: stopped % 10.99/2.29 Prover 16: stopped % 10.99/2.29 Prover 7: stopped % 10.99/2.29 Prover 19: Warning: ignoring some quantifiers % 10.99/2.29 Prover 11: stopped % 11.74/2.30 Prover 19: Constructing countermodel ... % 11.74/2.32 Prover 19: stopped % 11.74/2.32 % 11.74/2.32 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.74/2.32 % 11.74/2.33 % SZS output start Proof for theBenchmark % 11.74/2.33 Assumptions after simplification: % 11.74/2.33 --------------------------------- % 11.74/2.33 % 11.74/2.33 (assumption_11) % 11.74/2.38 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v4 = v3 % 11.74/2.38 | ~ (external_ties(v0, v2) = v3) | ~ (external_ties(v0, v1) = v4) | ~ % 11.74/2.38 $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ organization(v0)) % 11.74/2.38 % 11.74/2.38 (assumption_6) % 11.74/2.39 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~ % 11.74/2.39 (position(v0, v2) = v3) | ~ (position(v0, v1) = v4) | ~ $i(v2) | ~ $i(v1) % 11.74/2.39 | ~ $i(v0) | ~ organization(v0) | ? [v5: $i] : ? [v6: $i] : ((v4 = v3 | % 11.74/2.39 ( ~ (v6 = v5) & external_ties(v0, v2) = v5 & external_ties(v0, v1) = v6 % 11.74/2.39 & $i(v6) & $i(v5))) & (greater(v3, v4) | (external_ties(v0, v2) = v5 & % 11.74/2.39 external_ties(v0, v1) = v6 & $i(v6) & $i(v5) & ~ greater(v5, v6))))) % 11.74/2.39 % 11.74/2.39 (lemma_6) % 11.74/2.40 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 11.74/2.40 $i] : ? [v6: $i] : ( ~ (v6 = v5) & age(v0, v2) = v3 & age(v0, v1) = v4 & % 11.74/2.40 position(v0, v2) = v5 & position(v0, v1) = v6 & $i(v6) & $i(v5) & $i(v4) & % 11.74/2.40 $i(v3) & $i(v2) & $i(v1) & $i(v0) & organization(v0) & greater(v3, v4)) % 12.22/2.40 % 12.22/2.40 (function-axioms) % 12.22/2.40 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (age(v3, % 12.22/2.40 v2) = v1) | ~ (age(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 12.22/2.40 $i] : ! [v3: $i] : (v1 = v0 | ~ (position(v3, v2) = v1) | ~ (position(v3, % 12.22/2.40 v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 % 12.22/2.40 = v0 | ~ (external_ties(v3, v2) = v1) | ~ (external_ties(v3, v2) = v0)) % 12.22/2.40 % 12.22/2.40 Further assumptions not needed in the proof: % 12.22/2.40 -------------------------------------------- % 12.22/2.40 definition_greater_or_equal, definition_smaller, definition_smaller_or_equal, % 12.22/2.40 meaning_postulate_greater_comparable, meaning_postulate_greater_strict, % 12.22/2.40 meaning_postulate_greater_transitive % 12.22/2.40 % 12.22/2.40 Those formulas are unsatisfiable: % 12.22/2.40 --------------------------------- % 12.22/2.40 % 12.22/2.40 Begin of proof % 12.22/2.41 | % 12.22/2.41 | ALPHA: (function-axioms) implies: % 12.22/2.41 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 12.22/2.41 | (external_ties(v3, v2) = v1) | ~ (external_ties(v3, v2) = v0)) % 12.22/2.41 | % 12.22/2.41 | DELTA: instantiating (lemma_6) with fresh symbols all_13_0, all_13_1, % 12.22/2.41 | all_13_2, all_13_3, all_13_4, all_13_5, all_13_6 gives: % 12.22/2.41 | (2) ~ (all_13_0 = all_13_1) & age(all_13_6, all_13_4) = all_13_3 & % 12.22/2.41 | age(all_13_6, all_13_5) = all_13_2 & position(all_13_6, all_13_4) = % 12.22/2.41 | all_13_1 & position(all_13_6, all_13_5) = all_13_0 & $i(all_13_0) & % 12.22/2.42 | $i(all_13_1) & $i(all_13_2) & $i(all_13_3) & $i(all_13_4) & % 12.22/2.42 | $i(all_13_5) & $i(all_13_6) & organization(all_13_6) & % 12.22/2.42 | greater(all_13_3, all_13_2) % 12.22/2.42 | % 12.22/2.42 | ALPHA: (2) implies: % 12.22/2.42 | (3) ~ (all_13_0 = all_13_1) % 12.22/2.42 | (4) organization(all_13_6) % 12.22/2.42 | (5) $i(all_13_6) % 12.22/2.42 | (6) $i(all_13_5) % 12.22/2.42 | (7) $i(all_13_4) % 12.22/2.42 | (8) position(all_13_6, all_13_5) = all_13_0 % 12.22/2.42 | (9) position(all_13_6, all_13_4) = all_13_1 % 12.22/2.42 | % 12.22/2.42 | GROUND_INST: instantiating (assumption_6) with all_13_6, all_13_5, all_13_4, % 12.22/2.42 | all_13_1, all_13_0, simplifying with (4), (5), (6), (7), (8), (9) % 12.22/2.42 | gives: % 12.22/2.43 | (10) ? [v0: $i] : ? [v1: $i] : ((all_13_0 = all_13_1 | ( ~ (v1 = v0) & % 12.22/2.43 | external_ties(all_13_6, all_13_4) = v0 & external_ties(all_13_6, % 12.22/2.43 | all_13_5) = v1 & $i(v1) & $i(v0))) & (greater(all_13_1, % 12.22/2.43 | all_13_0) | (external_ties(all_13_6, all_13_4) = v0 & % 12.22/2.43 | external_ties(all_13_6, all_13_5) = v1 & $i(v1) & $i(v0) & ~ % 12.22/2.43 | greater(v0, v1)))) % 12.22/2.43 | % 12.22/2.43 | GROUND_INST: instantiating (assumption_6) with all_13_6, all_13_4, all_13_5, % 12.22/2.43 | all_13_0, all_13_1, simplifying with (4), (5), (6), (7), (8), (9) % 12.22/2.43 | gives: % 12.22/2.43 | (11) ? [v0: $i] : ? [v1: $i] : ((all_13_0 = all_13_1 | ( ~ (v1 = v0) & % 12.22/2.43 | external_ties(all_13_6, all_13_4) = v1 & external_ties(all_13_6, % 12.22/2.43 | all_13_5) = v0 & $i(v1) & $i(v0))) & (greater(all_13_0, % 12.22/2.43 | all_13_1) | (external_ties(all_13_6, all_13_4) = v1 & % 12.22/2.43 | external_ties(all_13_6, all_13_5) = v0 & $i(v1) & $i(v0) & ~ % 12.22/2.43 | greater(v0, v1)))) % 12.22/2.43 | % 12.22/2.43 | DELTA: instantiating (11) with fresh symbols all_23_0, all_23_1 gives: % 12.22/2.43 | (12) (all_13_0 = all_13_1 | ( ~ (all_23_0 = all_23_1) & % 12.22/2.43 | external_ties(all_13_6, all_13_4) = all_23_0 & % 12.22/2.43 | external_ties(all_13_6, all_13_5) = all_23_1 & $i(all_23_0) & % 12.22/2.43 | $i(all_23_1))) & (greater(all_13_0, all_13_1) | % 12.22/2.43 | (external_ties(all_13_6, all_13_4) = all_23_0 & % 12.22/2.43 | external_ties(all_13_6, all_13_5) = all_23_1 & $i(all_23_0) & % 12.22/2.43 | $i(all_23_1) & ~ greater(all_23_1, all_23_0))) % 12.22/2.43 | % 12.22/2.43 | ALPHA: (12) implies: % 12.22/2.44 | (13) all_13_0 = all_13_1 | ( ~ (all_23_0 = all_23_1) & % 12.22/2.44 | external_ties(all_13_6, all_13_4) = all_23_0 & % 12.22/2.44 | external_ties(all_13_6, all_13_5) = all_23_1 & $i(all_23_0) & % 12.22/2.44 | $i(all_23_1)) % 12.22/2.44 | % 12.22/2.44 | DELTA: instantiating (10) with fresh symbols all_24_0, all_24_1 gives: % 12.22/2.44 | (14) (all_13_0 = all_13_1 | ( ~ (all_24_0 = all_24_1) & % 12.22/2.44 | external_ties(all_13_6, all_13_4) = all_24_1 & % 12.22/2.44 | external_ties(all_13_6, all_13_5) = all_24_0 & $i(all_24_0) & % 12.22/2.44 | $i(all_24_1))) & (greater(all_13_1, all_13_0) | % 12.22/2.44 | (external_ties(all_13_6, all_13_4) = all_24_1 & % 12.22/2.44 | external_ties(all_13_6, all_13_5) = all_24_0 & $i(all_24_0) & % 12.22/2.44 | $i(all_24_1) & ~ greater(all_24_1, all_24_0))) % 12.22/2.44 | % 12.22/2.44 | ALPHA: (14) implies: % 12.22/2.44 | (15) all_13_0 = all_13_1 | ( ~ (all_24_0 = all_24_1) & % 12.22/2.44 | external_ties(all_13_6, all_13_4) = all_24_1 & % 12.22/2.44 | external_ties(all_13_6, all_13_5) = all_24_0 & $i(all_24_0) & % 12.22/2.44 | $i(all_24_1)) % 12.22/2.44 | % 12.22/2.44 | BETA: splitting (15) gives: % 12.22/2.44 | % 12.22/2.44 | Case 1: % 12.22/2.44 | | % 12.22/2.44 | | (16) all_13_0 = all_13_1 % 12.22/2.44 | | % 12.22/2.44 | | REDUCE: (3), (16) imply: % 12.22/2.44 | | (17) $false % 12.22/2.44 | | % 12.22/2.44 | | CLOSE: (17) is inconsistent. % 12.22/2.44 | | % 12.22/2.44 | Case 2: % 12.22/2.44 | | % 12.22/2.44 | | (18) ~ (all_24_0 = all_24_1) & external_ties(all_13_6, all_13_4) = % 12.22/2.44 | | all_24_1 & external_ties(all_13_6, all_13_5) = all_24_0 & % 12.22/2.44 | | $i(all_24_0) & $i(all_24_1) % 12.22/2.44 | | % 12.22/2.44 | | ALPHA: (18) implies: % 12.22/2.45 | | (19) ~ (all_24_0 = all_24_1) % 12.22/2.45 | | (20) external_ties(all_13_6, all_13_5) = all_24_0 % 12.22/2.45 | | (21) external_ties(all_13_6, all_13_4) = all_24_1 % 12.22/2.45 | | % 12.22/2.45 | | BETA: splitting (13) gives: % 12.22/2.45 | | % 12.22/2.45 | | Case 1: % 12.22/2.45 | | | % 12.22/2.45 | | | (22) all_13_0 = all_13_1 % 12.22/2.45 | | | % 12.22/2.45 | | | REDUCE: (3), (22) imply: % 12.22/2.45 | | | (23) $false % 12.22/2.45 | | | % 12.22/2.45 | | | CLOSE: (23) is inconsistent. % 12.22/2.45 | | | % 12.22/2.45 | | Case 2: % 12.22/2.45 | | | % 12.22/2.45 | | | (24) ~ (all_23_0 = all_23_1) & external_ties(all_13_6, all_13_4) = % 12.22/2.45 | | | all_23_0 & external_ties(all_13_6, all_13_5) = all_23_1 & % 12.22/2.45 | | | $i(all_23_0) & $i(all_23_1) % 12.22/2.45 | | | % 12.22/2.45 | | | ALPHA: (24) implies: % 12.22/2.45 | | | (25) external_ties(all_13_6, all_13_5) = all_23_1 % 12.22/2.45 | | | (26) external_ties(all_13_6, all_13_4) = all_23_0 % 12.22/2.45 | | | % 12.22/2.45 | | | GROUND_INST: instantiating (1) with all_23_1, all_24_0, all_13_5, % 12.22/2.45 | | | all_13_6, simplifying with (20), (25) gives: % 12.22/2.45 | | | (27) all_24_0 = all_23_1 % 12.22/2.45 | | | % 12.22/2.45 | | | GROUND_INST: instantiating (1) with all_23_0, all_24_1, all_13_4, % 12.22/2.45 | | | all_13_6, simplifying with (21), (26) gives: % 12.22/2.45 | | | (28) all_24_1 = all_23_0 % 12.22/2.45 | | | % 12.22/2.45 | | | REDUCE: (19), (27), (28) imply: % 12.22/2.45 | | | (29) ~ (all_23_0 = all_23_1) % 12.22/2.45 | | | % 12.22/2.45 | | | SIMP: (29) implies: % 12.22/2.45 | | | (30) ~ (all_23_0 = all_23_1) % 12.22/2.45 | | | % 12.22/2.45 | | | GROUND_INST: instantiating (assumption_11) with all_13_6, all_13_5, % 12.22/2.45 | | | all_13_4, all_23_0, all_23_1, simplifying with (4), (5), (6), % 12.22/2.45 | | | (7), (25), (26) gives: % 12.22/2.45 | | | (31) all_23_0 = all_23_1 % 12.22/2.45 | | | % 12.22/2.45 | | | REDUCE: (30), (31) imply: % 12.22/2.45 | | | (32) $false % 12.22/2.45 | | | % 12.22/2.45 | | | CLOSE: (32) is inconsistent. % 12.22/2.45 | | | % 12.22/2.45 | | End of split % 12.22/2.45 | | % 12.22/2.46 | End of split % 12.22/2.46 | % 12.22/2.46 End of proof % 12.22/2.46 % SZS output end Proof for theBenchmark % 12.22/2.46 % 12.22/2.46 1742ms %------------------------------------------------------------------------------