%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SET950+1 : TPTP v8.1.2. Released v3.2.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n026.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 15:27:10 EDT 2023 % Result : Theorem 6.22s 1.78s % Output : Proof 7.31s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET950+1 : TPTP v8.1.2. Released v3.2.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.35 % Computer : n026.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 : Sat Aug 26 10:43:18 EDT 2023 % 0.13/0.35 % CPUTime : % 0.20/0.61 ________ _____ % 0.20/0.61 ___ __ \_________(_)________________________________ % 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.61 % 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.61 (2023-06-19) % 0.20/0.61 % 0.20/0.61 (c) Philipp Rümmer, 2009-2023 % 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.62 Amanda Stjerna. % 0.20/0.62 Free software under BSD-3-Clause. % 0.20/0.62 % 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.62 % 0.20/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.63 Running up to 7 provers in parallel. % 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.11/1.04 Prover 1: Preprocessing ... % 2.11/1.04 Prover 4: Preprocessing ... % 2.45/1.08 Prover 0: Preprocessing ... % 2.45/1.08 Prover 3: Preprocessing ... % 2.45/1.08 Prover 6: Preprocessing ... % 2.45/1.08 Prover 2: Preprocessing ... % 2.45/1.08 Prover 5: Preprocessing ... % 3.96/1.51 Prover 3: Warning: ignoring some quantifiers % 3.96/1.51 Prover 1: Warning: ignoring some quantifiers % 3.96/1.54 Prover 6: Proving ... % 3.96/1.54 Prover 0: Proving ... % 3.96/1.55 Prover 1: Constructing countermodel ... % 3.96/1.55 Prover 3: Constructing countermodel ... % 3.96/1.55 Prover 4: Warning: ignoring some quantifiers % 3.96/1.55 Prover 5: Proving ... % 3.96/1.56 Prover 4: Constructing countermodel ... % 4.56/1.58 Prover 2: Proving ... % 6.22/1.78 Prover 3: proved (1128ms) % 6.22/1.78 % 6.22/1.78 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.22/1.78 % 6.22/1.78 Prover 0: proved (1139ms) % 6.22/1.78 % 6.22/1.78 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.22/1.78 % 6.22/1.78 Prover 5: stopped % 6.22/1.78 Prover 2: stopped % 6.22/1.80 Prover 6: stopped % 6.22/1.80 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.22/1.80 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.22/1.80 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.22/1.80 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.22/1.81 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.22/1.81 Prover 7: Preprocessing ... % 6.22/1.82 Prover 8: Preprocessing ... % 6.22/1.82 Prover 10: Preprocessing ... % 6.22/1.82 Prover 4: Found proof (size 19) % 6.22/1.82 Prover 4: proved (1180ms) % 6.22/1.83 Prover 1: Found proof (size 22) % 6.22/1.83 Prover 1: proved (1180ms) % 6.22/1.83 Prover 13: Preprocessing ... % 6.22/1.83 Prover 7: stopped % 6.22/1.83 Prover 11: Preprocessing ... % 6.83/1.86 Prover 10: stopped % 6.83/1.86 Prover 13: stopped % 6.83/1.86 Prover 11: stopped % 7.04/1.90 Prover 8: Warning: ignoring some quantifiers % 7.04/1.91 Prover 8: Constructing countermodel ... % 7.04/1.91 Prover 8: stopped % 7.04/1.91 % 7.04/1.91 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.04/1.91 % 7.04/1.92 % SZS output start Proof for theBenchmark % 7.04/1.92 Assumptions after simplification: % 7.04/1.92 --------------------------------- % 7.04/1.92 % 7.04/1.92 (d2_zfmisc_1) % 7.31/1.96 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: int] : ! [v5: % 7.31/1.96 $i] : ! [v6: $i] : (v4 = 0 | ~ (cartesian_product2(v0, v1) = v2) | ~ % 7.31/1.96 (ordered_pair(v5, v6) = v3) | ~ (in(v3, v2) = v4) | ~ $i(v6) | ~ $i(v5) | % 7.31/1.96 ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v7: any] : ? [v8: any] % 7.31/1.96 : (in(v6, v1) = v8 & in(v5, v0) = v7 & ( ~ (v8 = 0) | ~ (v7 = 0)))) & ! % 7.31/1.96 [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ % 7.31/1.96 (cartesian_product2(v0, v1) = v2) | ~ (in(v3, v2) = 0) | ~ $i(v3) | ~ % 7.31/1.96 $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: $i] : ? [v5: $i] : % 7.31/1.96 (ordered_pair(v4, v5) = v3 & in(v5, v1) = 0 & in(v4, v0) = 0 & $i(v5) & % 7.31/1.96 $i(v4))) & ? [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v3 = % 7.31/1.96 v0 | ~ (cartesian_product2(v1, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ % 7.31/1.96 $i(v0) | ? [v4: $i] : ? [v5: any] : ? [v6: $i] : ? [v7: $i] : ? [v8: % 7.31/1.96 int] : ? [v9: int] : ? [v10: $i] : (in(v4, v0) = v5 & $i(v7) & $i(v6) & % 7.31/1.96 $i(v4) & ( ~ (v5 = 0) | ! [v11: $i] : ! [v12: $i] : ( ~ % 7.31/1.96 (ordered_pair(v11, v12) = v4) | ~ $i(v12) | ~ $i(v11) | ? [v13: % 7.31/1.96 any] : ? [v14: any] : (in(v12, v2) = v14 & in(v11, v1) = v13 & ( ~ % 7.31/1.96 (v14 = 0) | ~ (v13 = 0))))) & (v5 = 0 | (v10 = v4 & v9 = 0 & v8 = % 7.31/1.96 0 & ordered_pair(v6, v7) = v4 & in(v7, v2) = 0 & in(v6, v1) = 0)))) % 7.31/1.96 % 7.31/1.96 (d3_tarski) % 7.31/1.97 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 7.31/1.97 (subset(v0, v1) = 0) | ~ (in(v2, v1) = v3) | ~ $i(v2) | ~ $i(v1) | ~ % 7.31/1.97 $i(v0) | ? [v4: int] : ( ~ (v4 = 0) & in(v2, v0) = v4)) & ! [v0: $i] : ! % 7.31/1.97 [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (subset(v0, v1) = v2) | ~ $i(v1) | ~ % 7.31/1.97 $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~ (v4 = 0) & in(v3, v1) = v4 & % 7.31/1.97 in(v3, v0) = 0 & $i(v3))) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ % 7.31/1.97 (subset(v0, v1) = 0) | ~ (in(v2, v0) = 0) | ~ $i(v2) | ~ $i(v1) | ~ % 7.31/1.97 $i(v0) | in(v2, v1) = 0) % 7.31/1.97 % 7.31/1.97 (t103_zfmisc_1) % 7.31/1.97 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : % 7.31/1.97 (subset(v0, v4) = 0 & cartesian_product2(v1, v2) = v4 & in(v3, v0) = 0 & % 7.31/1.97 $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & ! [v5: $i] : ! [v6: $i] : ( ~ % 7.31/1.97 (ordered_pair(v5, v6) = v3) | ~ $i(v6) | ~ $i(v5) | ? [v7: any] : ? % 7.31/1.97 [v8: any] : (in(v6, v2) = v8 & in(v5, v1) = v7 & ( ~ (v8 = 0) | ~ (v7 = % 7.31/1.97 0))))) % 7.31/1.97 % 7.31/1.97 (function-axioms) % 7.31/1.97 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 7.31/1.97 [v3: $i] : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2) = v0)) & % 7.31/1.97 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 7.31/1.97 (cartesian_product2(v3, v2) = v1) | ~ (cartesian_product2(v3, v2) = v0)) & % 7.31/1.97 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 7.31/1.97 (ordered_pair(v3, v2) = v1) | ~ (ordered_pair(v3, v2) = v0)) & ! [v0: $i] % 7.31/1.97 : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (unordered_pair(v3, % 7.31/1.97 v2) = v1) | ~ (unordered_pair(v3, v2) = v0)) & ! [v0: % 7.31/1.97 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 7.31/1.97 : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) & ! [v0: % 7.31/1.97 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 7.31/1.97 ~ (empty(v2) = v1) | ~ (empty(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 7.31/1.97 [v2: $i] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) % 7.31/1.97 % 7.31/1.97 Further assumptions not needed in the proof: % 7.31/1.97 -------------------------------------------- % 7.31/1.97 antisymmetry_r2_hidden, commutativity_k2_tarski, d5_tarski, fc1_zfmisc_1, % 7.31/1.97 rc1_xboole_0, rc2_xboole_0, reflexivity_r1_tarski % 7.31/1.97 % 7.31/1.97 Those formulas are unsatisfiable: % 7.31/1.97 --------------------------------- % 7.31/1.97 % 7.31/1.97 Begin of proof % 7.31/1.97 | % 7.31/1.97 | ALPHA: (d2_zfmisc_1) implies: % 7.31/1.98 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ % 7.31/1.98 | (cartesian_product2(v0, v1) = v2) | ~ (in(v3, v2) = 0) | ~ $i(v3) | % 7.31/1.98 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: $i] : ? [v5: $i] : % 7.31/1.98 | (ordered_pair(v4, v5) = v3 & in(v5, v1) = 0 & in(v4, v0) = 0 & $i(v5) % 7.31/1.98 | & $i(v4))) % 7.31/1.98 | % 7.31/1.98 | ALPHA: (d3_tarski) implies: % 7.31/1.98 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (subset(v0, v1) = 0) | ~ % 7.31/1.98 | (in(v2, v0) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | in(v2, v1) = % 7.31/1.98 | 0) % 7.31/1.98 | % 7.31/1.98 | ALPHA: (function-axioms) implies: % 7.31/1.98 | (3) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 7.31/1.98 | ! [v3: $i] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) % 7.31/1.98 | % 7.31/1.98 | DELTA: instantiating (t103_zfmisc_1) with fresh symbols all_14_0, all_14_1, % 7.31/1.98 | all_14_2, all_14_3, all_14_4 gives: % 7.31/1.98 | (4) subset(all_14_4, all_14_0) = 0 & cartesian_product2(all_14_3, all_14_2) % 7.31/1.98 | = all_14_0 & in(all_14_1, all_14_4) = 0 & $i(all_14_0) & $i(all_14_1) & % 7.31/1.98 | $i(all_14_2) & $i(all_14_3) & $i(all_14_4) & ! [v0: $i] : ! [v1: $i] % 7.31/1.98 | : ( ~ (ordered_pair(v0, v1) = all_14_1) | ~ $i(v1) | ~ $i(v0) | ? % 7.31/1.98 | [v2: any] : ? [v3: any] : (in(v1, all_14_2) = v3 & in(v0, all_14_3) % 7.31/1.98 | = v2 & ( ~ (v3 = 0) | ~ (v2 = 0)))) % 7.31/1.98 | % 7.31/1.98 | ALPHA: (4) implies: % 7.31/1.98 | (5) $i(all_14_4) % 7.31/1.98 | (6) $i(all_14_3) % 7.31/1.98 | (7) $i(all_14_2) % 7.31/1.98 | (8) $i(all_14_1) % 7.31/1.99 | (9) $i(all_14_0) % 7.31/1.99 | (10) in(all_14_1, all_14_4) = 0 % 7.31/1.99 | (11) cartesian_product2(all_14_3, all_14_2) = all_14_0 % 7.31/1.99 | (12) subset(all_14_4, all_14_0) = 0 % 7.31/1.99 | (13) ! [v0: $i] : ! [v1: $i] : ( ~ (ordered_pair(v0, v1) = all_14_1) | ~ % 7.31/1.99 | $i(v1) | ~ $i(v0) | ? [v2: any] : ? [v3: any] : (in(v1, all_14_2) % 7.31/1.99 | = v3 & in(v0, all_14_3) = v2 & ( ~ (v3 = 0) | ~ (v2 = 0)))) % 7.31/1.99 | % 7.31/1.99 | GROUND_INST: instantiating (2) with all_14_4, all_14_0, all_14_1, simplifying % 7.31/1.99 | with (5), (8), (9), (10), (12) gives: % 7.31/1.99 | (14) in(all_14_1, all_14_0) = 0 % 7.31/1.99 | % 7.31/1.99 | GROUND_INST: instantiating (1) with all_14_3, all_14_2, all_14_0, all_14_1, % 7.31/1.99 | simplifying with (6), (7), (8), (9), (11), (14) gives: % 7.31/1.99 | (15) ? [v0: $i] : ? [v1: $i] : (ordered_pair(v0, v1) = all_14_1 & in(v1, % 7.31/1.99 | all_14_2) = 0 & in(v0, all_14_3) = 0 & $i(v1) & $i(v0)) % 7.31/1.99 | % 7.31/1.99 | DELTA: instantiating (15) with fresh symbols all_34_0, all_34_1 gives: % 7.31/1.99 | (16) ordered_pair(all_34_1, all_34_0) = all_14_1 & in(all_34_0, all_14_2) = % 7.31/1.99 | 0 & in(all_34_1, all_14_3) = 0 & $i(all_34_0) & $i(all_34_1) % 7.31/1.99 | % 7.31/1.99 | ALPHA: (16) implies: % 7.31/1.99 | (17) $i(all_34_1) % 7.31/1.99 | (18) $i(all_34_0) % 7.31/1.99 | (19) in(all_34_1, all_14_3) = 0 % 7.31/1.99 | (20) in(all_34_0, all_14_2) = 0 % 7.31/1.99 | (21) ordered_pair(all_34_1, all_34_0) = all_14_1 % 7.31/1.99 | % 7.31/1.99 | GROUND_INST: instantiating (13) with all_34_1, all_34_0, simplifying with % 7.31/1.99 | (17), (18), (21) gives: % 7.31/1.99 | (22) ? [v0: any] : ? [v1: any] : (in(all_34_0, all_14_2) = v1 & % 7.31/1.99 | in(all_34_1, all_14_3) = v0 & ( ~ (v1 = 0) | ~ (v0 = 0))) % 7.31/1.99 | % 7.31/1.99 | DELTA: instantiating (22) with fresh symbols all_47_0, all_47_1 gives: % 7.31/1.99 | (23) in(all_34_0, all_14_2) = all_47_0 & in(all_34_1, all_14_3) = all_47_1 % 7.31/1.99 | & ( ~ (all_47_0 = 0) | ~ (all_47_1 = 0)) % 7.31/1.99 | % 7.31/1.99 | ALPHA: (23) implies: % 7.31/1.99 | (24) in(all_34_1, all_14_3) = all_47_1 % 7.31/2.00 | (25) in(all_34_0, all_14_2) = all_47_0 % 7.31/2.00 | (26) ~ (all_47_0 = 0) | ~ (all_47_1 = 0) % 7.31/2.00 | % 7.31/2.00 | GROUND_INST: instantiating (3) with 0, all_47_1, all_14_3, all_34_1, % 7.31/2.00 | simplifying with (19), (24) gives: % 7.31/2.00 | (27) all_47_1 = 0 % 7.31/2.00 | % 7.31/2.00 | GROUND_INST: instantiating (3) with 0, all_47_0, all_14_2, all_34_0, % 7.31/2.00 | simplifying with (20), (25) gives: % 7.31/2.00 | (28) all_47_0 = 0 % 7.31/2.00 | % 7.31/2.00 | BETA: splitting (26) gives: % 7.31/2.00 | % 7.31/2.00 | Case 1: % 7.31/2.00 | | % 7.31/2.00 | | (29) ~ (all_47_0 = 0) % 7.31/2.00 | | % 7.31/2.00 | | REDUCE: (28), (29) imply: % 7.31/2.00 | | (30) $false % 7.31/2.00 | | % 7.31/2.00 | | CLOSE: (30) is inconsistent. % 7.31/2.00 | | % 7.31/2.00 | Case 2: % 7.31/2.00 | | % 7.31/2.00 | | (31) ~ (all_47_1 = 0) % 7.31/2.00 | | % 7.31/2.00 | | REDUCE: (27), (31) imply: % 7.31/2.00 | | (32) $false % 7.31/2.00 | | % 7.31/2.00 | | CLOSE: (32) is inconsistent. % 7.31/2.00 | | % 7.31/2.00 | End of split % 7.31/2.00 | % 7.31/2.00 End of proof % 7.31/2.00 % SZS output end Proof for theBenchmark % 7.31/2.00 % 7.31/2.00 1383ms %------------------------------------------------------------------------------