%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SEU129+2 : TPTP v8.1.2. Released v3.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n017.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 17:42:39 EDT 2023 % Result : Theorem 9.14s 2.02s % Output : Proof 12.23s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU129+2 : TPTP v8.1.2. Released v3.3.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.34 % Computer : n017.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 300 % 0.14/0.34 % DateTime : Wed Aug 23 17:59:23 EDT 2023 % 0.14/0.34 % CPUTime : % 0.21/0.60 ________ _____ % 0.21/0.60 ___ __ \_________(_)________________________________ % 0.21/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.60 % 0.21/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.60 (2023-06-19) % 0.21/0.60 % 0.21/0.60 (c) Philipp Rümmer, 2009-2023 % 0.21/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.60 Amanda Stjerna. % 0.21/0.60 Free software under BSD-3-Clause. % 0.21/0.60 % 0.21/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.60 % 0.21/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.61 Running up to 7 provers in parallel. % 0.21/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.34/1.06 Prover 1: Preprocessing ... % 2.34/1.06 Prover 4: Preprocessing ... % 2.93/1.10 Prover 0: Preprocessing ... % 2.93/1.10 Prover 5: Preprocessing ... % 2.93/1.10 Prover 6: Preprocessing ... % 2.93/1.10 Prover 3: Preprocessing ... % 2.93/1.10 Prover 2: Preprocessing ... % 6.33/1.57 Prover 5: Proving ... % 6.50/1.61 Prover 1: Warning: ignoring some quantifiers % 6.50/1.62 Prover 4: Warning: ignoring some quantifiers % 6.77/1.62 Prover 2: Proving ... % 6.77/1.63 Prover 6: Proving ... % 6.86/1.65 Prover 3: Warning: ignoring some quantifiers % 6.86/1.65 Prover 1: Constructing countermodel ... % 6.86/1.67 Prover 4: Constructing countermodel ... % 6.86/1.67 Prover 3: Constructing countermodel ... % 7.42/1.74 Prover 0: Proving ... % 9.14/2.02 Prover 0: proved (1394ms) % 9.14/2.02 % 9.14/2.02 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 9.14/2.02 % 9.14/2.02 Prover 5: proved (1386ms) % 9.14/2.02 % 9.14/2.02 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 9.14/2.02 % 9.14/2.02 Prover 3: stopped % 9.14/2.02 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 9.14/2.02 Prover 6: stopped % 9.14/2.02 Prover 2: stopped % 9.14/2.02 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 9.14/2.02 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 9.14/2.02 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 9.14/2.03 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 9.14/2.10 Prover 10: Preprocessing ... % 9.14/2.11 Prover 7: Preprocessing ... % 9.14/2.11 Prover 11: Preprocessing ... % 9.14/2.12 Prover 8: Preprocessing ... % 9.14/2.12 Prover 13: Preprocessing ... % 10.96/2.23 Prover 7: Warning: ignoring some quantifiers % 10.96/2.24 Prover 7: Constructing countermodel ... % 10.96/2.24 Prover 13: Warning: ignoring some quantifiers % 10.96/2.24 Prover 10: Warning: ignoring some quantifiers % 10.96/2.26 Prover 10: Constructing countermodel ... % 10.96/2.26 Prover 13: Constructing countermodel ... % 10.96/2.26 Prover 4: Found proof (size 27) % 10.96/2.26 Prover 4: proved (1629ms) % 10.96/2.26 Prover 7: stopped % 10.96/2.26 Prover 8: Warning: ignoring some quantifiers % 10.96/2.27 Prover 10: stopped % 10.96/2.27 Prover 13: stopped % 10.96/2.27 Prover 1: stopped % 10.96/2.27 Prover 8: Constructing countermodel ... % 10.96/2.28 Prover 8: stopped % 11.74/2.32 Prover 11: Warning: ignoring some quantifiers % 11.74/2.33 Prover 11: Constructing countermodel ... % 11.74/2.34 Prover 11: stopped % 11.74/2.34 % 11.74/2.34 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 11.74/2.34 % 11.74/2.35 % SZS output start Proof for theBenchmark % 11.74/2.35 Assumptions after simplification: % 11.74/2.35 --------------------------------- % 11.74/2.35 % 11.74/2.35 (commutativity_k3_xboole_0) % 11.74/2.37 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (set_intersection2(v1, v0) = v2) % 11.74/2.37 | ~ $i(v1) | ~ $i(v0) | (set_intersection2(v0, v1) = v2 & $i(v2))) & ! % 11.74/2.37 [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (set_intersection2(v0, v1) = v2) | % 11.74/2.37 ~ $i(v1) | ~ $i(v0) | (set_intersection2(v1, v0) = v2 & $i(v2))) % 11.74/2.37 % 11.74/2.37 (t17_xboole_1) % 11.74/2.38 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (set_intersection2(v0, v1) = v2) % 11.74/2.38 | ~ $i(v1) | ~ $i(v0) | subset(v2, v0) = 0) % 11.74/2.38 % 11.74/2.38 (t19_xboole_1) % 11.74/2.38 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: int] : (v4 = 0 % 11.74/2.38 | ~ (subset(v0, v3) = v4) | ~ (set_intersection2(v1, v2) = v3) | ~ $i(v2) % 11.74/2.38 | ~ $i(v1) | ~ $i(v0) | ? [v5: any] : ? [v6: any] : (subset(v0, v2) = v6 % 11.74/2.38 & subset(v0, v1) = v5 & ( ~ (v6 = 0) | ~ (v5 = 0)))) % 11.74/2.38 % 11.74/2.38 (t1_xboole_1) % 11.74/2.38 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 11.74/2.38 (subset(v1, v2) = 0) | ~ (subset(v0, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ % 11.74/2.38 $i(v0) | ? [v4: int] : ( ~ (v4 = 0) & subset(v0, v1) = v4)) & ! [v0: $i] : % 11.74/2.38 ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ (subset(v0, v2) = v3) % 11.74/2.38 | ~ (subset(v0, v1) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: int] % 11.74/2.38 : ( ~ (v4 = 0) & subset(v1, v2) = v4)) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 11.74/2.38 $i] : ( ~ (subset(v1, v2) = 0) | ~ (subset(v0, v1) = 0) | ~ $i(v2) | ~ % 11.74/2.38 $i(v1) | ~ $i(v0) | subset(v0, v2) = 0) % 11.74/2.38 % 11.74/2.38 (t26_xboole_1) % 11.74/2.39 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 11.74/2.39 int] : ( ~ (v5 = 0) & subset(v3, v4) = v5 & subset(v0, v1) = 0 & % 11.74/2.39 set_intersection2(v1, v2) = v4 & set_intersection2(v0, v2) = v3 & $i(v4) & % 11.74/2.39 $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 11.74/2.39 % 11.74/2.39 (function-axioms) % 11.74/2.39 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 11.74/2.39 [v3: $i] : (v1 = v0 | ~ (disjoint(v3, v2) = v1) | ~ (disjoint(v3, v2) = v0)) % 11.74/2.39 & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 11.74/2.39 [v3: $i] : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2) = v0)) & % 11.74/2.39 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 11.74/2.39 (set_intersection2(v3, v2) = v1) | ~ (set_intersection2(v3, v2) = v0)) & ! % 11.74/2.39 [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 11.74/2.39 (set_union2(v3, v2) = v1) | ~ (set_union2(v3, v2) = v0)) & ! [v0: % 11.74/2.39 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 11.74/2.39 : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) & ! [v0: % 11.74/2.39 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 11.74/2.39 ~ (empty(v2) = v1) | ~ (empty(v2) = v0)) % 11.74/2.39 % 11.74/2.39 Further assumptions not needed in the proof: % 11.74/2.39 -------------------------------------------- % 11.74/2.39 antisymmetry_r2_hidden, commutativity_k2_xboole_0, d10_xboole_0, d1_xboole_0, % 11.74/2.39 d2_xboole_0, d3_tarski, d3_xboole_0, d7_xboole_0, dt_k1_xboole_0, % 11.74/2.39 dt_k2_xboole_0, dt_k3_xboole_0, fc1_xboole_0, fc2_xboole_0, fc3_xboole_0, % 11.74/2.39 idempotence_k2_xboole_0, idempotence_k3_xboole_0, rc1_xboole_0, rc2_xboole_0, % 11.74/2.39 reflexivity_r1_tarski, symmetry_r1_xboole_0, t12_xboole_1, t1_boole, t2_boole, % 11.74/2.39 t2_xboole_1, t3_xboole_0, t3_xboole_1, t4_xboole_0, t6_boole, t7_boole, % 11.74/2.39 t7_xboole_1, t8_boole, t8_xboole_1 % 11.74/2.39 % 11.74/2.39 Those formulas are unsatisfiable: % 11.74/2.39 --------------------------------- % 11.74/2.39 % 11.74/2.39 Begin of proof % 11.74/2.39 | % 11.74/2.39 | ALPHA: (commutativity_k3_xboole_0) implies: % 11.74/2.40 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (set_intersection2(v1, % 11.74/2.40 | v0) = v2) | ~ $i(v1) | ~ $i(v0) | (set_intersection2(v0, v1) = % 11.74/2.40 | v2 & $i(v2))) % 11.74/2.40 | % 11.74/2.40 | ALPHA: (t1_xboole_1) implies: % 11.74/2.40 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (subset(v1, v2) = 0) | ~ % 11.74/2.40 | (subset(v0, v1) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | subset(v0, % 11.74/2.40 | v2) = 0) % 11.74/2.40 | % 11.74/2.40 | ALPHA: (function-axioms) implies: % 11.74/2.40 | (3) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 11.74/2.40 | ! [v3: $i] : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2) % 11.74/2.40 | = v0)) % 11.74/2.40 | % 11.74/2.40 | DELTA: instantiating (t26_xboole_1) with fresh symbols all_39_0, all_39_1, % 11.74/2.40 | all_39_2, all_39_3, all_39_4, all_39_5 gives: % 11.74/2.40 | (4) ~ (all_39_0 = 0) & subset(all_39_2, all_39_1) = all_39_0 & % 11.74/2.40 | subset(all_39_5, all_39_4) = 0 & set_intersection2(all_39_4, all_39_3) % 11.74/2.40 | = all_39_1 & set_intersection2(all_39_5, all_39_3) = all_39_2 & % 11.74/2.40 | $i(all_39_1) & $i(all_39_2) & $i(all_39_3) & $i(all_39_4) & % 11.74/2.40 | $i(all_39_5) % 11.74/2.40 | % 11.74/2.40 | ALPHA: (4) implies: % 11.74/2.40 | (5) ~ (all_39_0 = 0) % 11.74/2.40 | (6) $i(all_39_5) % 11.74/2.40 | (7) $i(all_39_4) % 11.74/2.40 | (8) $i(all_39_3) % 11.74/2.40 | (9) set_intersection2(all_39_5, all_39_3) = all_39_2 % 11.74/2.40 | (10) set_intersection2(all_39_4, all_39_3) = all_39_1 % 11.74/2.40 | (11) subset(all_39_5, all_39_4) = 0 % 11.74/2.40 | (12) subset(all_39_2, all_39_1) = all_39_0 % 11.74/2.40 | % 11.74/2.40 | GROUND_INST: instantiating (1) with all_39_3, all_39_5, all_39_2, simplifying % 11.74/2.40 | with (6), (8), (9) gives: % 11.74/2.40 | (13) set_intersection2(all_39_3, all_39_5) = all_39_2 & $i(all_39_2) % 11.74/2.40 | % 11.74/2.40 | ALPHA: (13) implies: % 11.74/2.40 | (14) $i(all_39_2) % 11.74/2.40 | (15) set_intersection2(all_39_3, all_39_5) = all_39_2 % 11.74/2.40 | % 11.74/2.40 | GROUND_INST: instantiating (t17_xboole_1) with all_39_5, all_39_3, all_39_2, % 11.74/2.40 | simplifying with (6), (8), (9) gives: % 11.74/2.40 | (16) subset(all_39_2, all_39_5) = 0 % 11.74/2.40 | % 11.74/2.41 | GROUND_INST: instantiating (t19_xboole_1) with all_39_2, all_39_4, all_39_3, % 11.74/2.41 | all_39_1, all_39_0, simplifying with (7), (8), (10), (12), (14) % 11.74/2.41 | gives: % 12.23/2.41 | (17) all_39_0 = 0 | ? [v0: any] : ? [v1: any] : (subset(all_39_2, % 12.23/2.41 | all_39_3) = v1 & subset(all_39_2, all_39_4) = v0 & ( ~ (v1 = 0) | % 12.23/2.41 | ~ (v0 = 0))) % 12.23/2.41 | % 12.23/2.41 | BETA: splitting (17) gives: % 12.23/2.41 | % 12.23/2.41 | Case 1: % 12.23/2.41 | | % 12.23/2.41 | | (18) all_39_0 = 0 % 12.23/2.41 | | % 12.23/2.41 | | REDUCE: (5), (18) imply: % 12.23/2.41 | | (19) $false % 12.23/2.41 | | % 12.23/2.41 | | CLOSE: (19) is inconsistent. % 12.23/2.41 | | % 12.23/2.41 | Case 2: % 12.23/2.41 | | % 12.23/2.41 | | (20) ? [v0: any] : ? [v1: any] : (subset(all_39_2, all_39_3) = v1 & % 12.23/2.41 | | subset(all_39_2, all_39_4) = v0 & ( ~ (v1 = 0) | ~ (v0 = 0))) % 12.23/2.41 | | % 12.23/2.41 | | DELTA: instantiating (20) with fresh symbols all_64_0, all_64_1 gives: % 12.23/2.41 | | (21) subset(all_39_2, all_39_3) = all_64_0 & subset(all_39_2, all_39_4) = % 12.23/2.41 | | all_64_1 & ( ~ (all_64_0 = 0) | ~ (all_64_1 = 0)) % 12.23/2.41 | | % 12.23/2.41 | | ALPHA: (21) implies: % 12.23/2.41 | | (22) subset(all_39_2, all_39_4) = all_64_1 % 12.23/2.41 | | (23) subset(all_39_2, all_39_3) = all_64_0 % 12.23/2.41 | | (24) ~ (all_64_0 = 0) | ~ (all_64_1 = 0) % 12.23/2.41 | | % 12.23/2.41 | | GROUND_INST: instantiating (t17_xboole_1) with all_39_3, all_39_5, all_39_2, % 12.23/2.41 | | simplifying with (6), (8), (15) gives: % 12.23/2.41 | | (25) subset(all_39_2, all_39_3) = 0 % 12.23/2.41 | | % 12.23/2.41 | | GROUND_INST: instantiating (2) with all_39_2, all_39_5, all_39_4, % 12.23/2.41 | | simplifying with (6), (7), (11), (14), (16) gives: % 12.23/2.41 | | (26) subset(all_39_2, all_39_4) = 0 % 12.23/2.41 | | % 12.23/2.41 | | BETA: splitting (24) gives: % 12.23/2.41 | | % 12.23/2.41 | | Case 1: % 12.23/2.41 | | | % 12.23/2.41 | | | (27) ~ (all_64_0 = 0) % 12.23/2.41 | | | % 12.23/2.41 | | | GROUND_INST: instantiating (3) with all_64_0, 0, all_39_3, all_39_2, % 12.23/2.41 | | | simplifying with (23), (25) gives: % 12.23/2.41 | | | (28) all_64_0 = 0 % 12.23/2.41 | | | % 12.23/2.41 | | | REDUCE: (27), (28) imply: % 12.23/2.41 | | | (29) $false % 12.23/2.41 | | | % 12.23/2.41 | | | CLOSE: (29) is inconsistent. % 12.23/2.41 | | | % 12.23/2.41 | | Case 2: % 12.23/2.41 | | | % 12.23/2.41 | | | (30) ~ (all_64_1 = 0) % 12.23/2.41 | | | % 12.23/2.41 | | | GROUND_INST: instantiating (3) with all_64_1, 0, all_39_4, all_39_2, % 12.23/2.41 | | | simplifying with (22), (26) gives: % 12.23/2.41 | | | (31) all_64_1 = 0 % 12.23/2.41 | | | % 12.23/2.41 | | | REDUCE: (30), (31) imply: % 12.23/2.41 | | | (32) $false % 12.23/2.41 | | | % 12.23/2.41 | | | CLOSE: (32) is inconsistent. % 12.23/2.41 | | | % 12.23/2.41 | | End of split % 12.23/2.41 | | % 12.23/2.41 | End of split % 12.23/2.41 | % 12.23/2.41 End of proof % 12.23/2.41 % SZS output end Proof for theBenchmark % 12.23/2.41 % 12.23/2.41 1812ms %------------------------------------------------------------------------------