%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SET920+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 : n023.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:02 EDT 2023 % Result : Theorem 5.63s 1.48s % Output : Proof 7.00s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SET920+1 : TPTP v8.1.2. Released v3.2.0. % 0.06/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n023.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Sat Aug 26 12:58:41 EDT 2023 % 0.13/0.34 % CPUTime : % 0.60/0.60 ________ _____ % 0.60/0.60 ___ __ \_________(_)________________________________ % 0.60/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.60/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.60/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.60/0.60 % 0.60/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.60/0.60 (2023-06-19) % 0.60/0.60 % 0.60/0.60 (c) Philipp Rümmer, 2009-2023 % 0.60/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.60/0.60 Amanda Stjerna. % 0.60/0.60 Free software under BSD-3-Clause. % 0.60/0.60 % 0.60/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.60/0.60 % 0.60/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.66/0.61 Running up to 7 provers in parallel. % 0.66/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.66/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.66/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.66/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.66/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.66/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.66/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.97/0.96 Prover 4: Preprocessing ... % 1.97/0.96 Prover 1: Preprocessing ... % 1.97/1.01 Prover 6: Preprocessing ... % 1.97/1.01 Prover 3: Preprocessing ... % 1.97/1.01 Prover 2: Preprocessing ... % 1.97/1.01 Prover 5: Preprocessing ... % 1.97/1.01 Prover 0: Preprocessing ... % 3.99/1.25 Prover 1: Warning: ignoring some quantifiers % 3.99/1.25 Prover 3: Warning: ignoring some quantifiers % 3.99/1.27 Prover 6: Proving ... % 3.99/1.27 Prover 3: Constructing countermodel ... % 3.99/1.27 Prover 5: Proving ... % 3.99/1.27 Prover 1: Constructing countermodel ... % 3.99/1.28 Prover 4: Warning: ignoring some quantifiers % 3.99/1.30 Prover 4: Constructing countermodel ... % 4.47/1.31 Prover 2: Proving ... % 4.47/1.31 Prover 0: Proving ... % 5.63/1.47 Prover 0: proved (850ms) % 5.63/1.48 % 5.63/1.48 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.63/1.48 % 5.63/1.48 Prover 5: stopped % 5.63/1.48 Prover 2: stopped % 5.63/1.49 Prover 6: stopped % 5.63/1.49 Prover 3: stopped % 5.63/1.49 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.63/1.49 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.63/1.49 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.63/1.49 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.63/1.49 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 5.85/1.51 Prover 11: Preprocessing ... % 5.85/1.51 Prover 10: Preprocessing ... % 5.85/1.51 Prover 8: Preprocessing ... % 5.85/1.52 Prover 7: Preprocessing ... % 5.85/1.52 Prover 13: Preprocessing ... % 6.18/1.55 Prover 4: Found proof (size 20) % 6.18/1.55 Prover 1: Found proof (size 24) % 6.18/1.55 Prover 4: proved (927ms) % 6.18/1.55 Prover 1: proved (928ms) % 6.18/1.58 Prover 8: Warning: ignoring some quantifiers % 6.18/1.58 Prover 10: Warning: ignoring some quantifiers % 6.18/1.58 Prover 13: Warning: ignoring some quantifiers % 6.18/1.59 Prover 10: Constructing countermodel ... % 6.18/1.59 Prover 7: Warning: ignoring some quantifiers % 6.18/1.59 Prover 10: stopped % 6.18/1.59 Prover 8: Constructing countermodel ... % 6.18/1.59 Prover 13: Constructing countermodel ... % 6.18/1.59 Prover 7: Constructing countermodel ... % 6.18/1.59 Prover 8: stopped % 6.18/1.60 Prover 7: stopped % 6.18/1.60 Prover 11: Warning: ignoring some quantifiers % 6.18/1.60 Prover 13: stopped % 6.65/1.61 Prover 11: Constructing countermodel ... % 6.65/1.62 Prover 11: stopped % 6.65/1.62 % 6.65/1.62 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.65/1.62 % 6.65/1.62 % SZS output start Proof for theBenchmark % 6.65/1.63 Assumptions after simplification: % 6.65/1.63 --------------------------------- % 6.65/1.63 % 6.65/1.63 (commutativity_k2_tarski) % 6.65/1.66 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (unordered_pair(v1, v0) = v2) | % 6.65/1.66 ~ $i(v1) | ~ $i(v0) | (unordered_pair(v0, v1) = v2 & $i(v2))) & ! [v0: $i] % 6.65/1.66 : ! [v1: $i] : ! [v2: $i] : ( ~ (unordered_pair(v0, v1) = v2) | ~ $i(v1) | % 6.65/1.66 ~ $i(v0) | (unordered_pair(v1, v0) = v2 & $i(v2))) % 6.65/1.66 % 6.65/1.66 (d2_tarski) % 6.65/1.66 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v3 = v1 | v3 = v0 | % 6.65/1.67 ~ (unordered_pair(v0, v1) = v2) | ~ (in(v3, v2) = 0) | ~ $i(v3) | ~ % 6.65/1.67 $i(v2) | ~ $i(v1) | ~ $i(v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 6.65/1.67 ! [v3: int] : (v3 = 0 | ~ (unordered_pair(v0, v1) = v2) | ~ (in(v1, v2) = % 6.65/1.67 v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0)) & ! [v0: $i] : ! [v1: $i] : ! % 6.65/1.67 [v2: $i] : ! [v3: int] : (v3 = 0 | ~ (unordered_pair(v0, v1) = v2) | ~ % 6.65/1.67 (in(v0, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0)) & ? [v0: $i] : ! % 6.65/1.67 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v3 = v0 | ~ (unordered_pair(v1, v2) = % 6.65/1.67 v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: $i] : ? [v5: any] : % 6.65/1.67 (in(v4, v0) = v5 & $i(v4) & ( ~ (v5 = 0) | ( ~ (v4 = v2) & ~ (v4 = v1))) & % 6.65/1.67 (v5 = 0 | v4 = v2 | v4 = v1))) % 6.65/1.67 % 6.65/1.67 (d3_xboole_0) % 7.00/1.68 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: int] : (v4 = 0 % 7.00/1.68 | ~ (set_intersection2(v0, v1) = v2) | ~ (in(v3, v2) = v4) | ~ $i(v3) | % 7.00/1.68 ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v5: any] : ? [v6: any] : (in(v3, v1) % 7.00/1.68 = v6 & in(v3, v0) = v5 & ( ~ (v6 = 0) | ~ (v5 = 0)))) & ! [v0: $i] : ! % 7.00/1.68 [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: any] : ( ~ % 7.00/1.69 (set_intersection2(v0, v1) = v2) | ~ (in(v3, v1) = v4) | ~ $i(v3) | ~ % 7.00/1.69 $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v5: any] : ? [v6: any] : (in(v3, v2) = % 7.00/1.69 v5 & in(v3, v0) = v6 & ( ~ (v5 = 0) | (v6 = 0 & v4 = 0)))) & ! [v0: $i] : % 7.00/1.69 ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: any] : ( ~ % 7.00/1.69 (set_intersection2(v0, v1) = v2) | ~ (in(v3, v0) = v4) | ~ $i(v3) | ~ % 7.00/1.69 $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v5: any] : ? [v6: any] : (in(v3, v2) = % 7.00/1.69 v5 & in(v3, v1) = v6 & ( ~ (v5 = 0) | (v6 = 0 & v4 = 0)))) & ! [v0: $i] : % 7.00/1.69 ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (set_intersection2(v0, v1) = v2) % 7.00/1.69 | ~ (in(v3, v2) = 0) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 7.00/1.69 (in(v3, v1) = 0 & in(v3, v0) = 0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] % 7.00/1.69 : ! [v3: $i] : ( ~ (set_intersection2(v0, v1) = v2) | ~ (in(v3, v1) = 0) | % 7.00/1.69 ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: any] : ? [v5: any] : % 7.00/1.69 (in(v3, v2) = v5 & in(v3, v0) = v4 & ( ~ (v4 = 0) | v5 = 0))) & ! [v0: $i] % 7.00/1.69 : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (set_intersection2(v0, v1) = % 7.00/1.69 v2) | ~ (in(v3, v0) = 0) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) % 7.00/1.69 | ? [v4: any] : ? [v5: any] : (in(v3, v2) = v5 & in(v3, v1) = v4 & ( ~ (v4 % 7.00/1.69 = 0) | v5 = 0))) & ? [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: % 7.00/1.69 $i] : (v3 = v0 | ~ (set_intersection2(v1, v2) = v3) | ~ $i(v2) | ~ $i(v1) % 7.00/1.69 | ~ $i(v0) | ? [v4: $i] : ? [v5: any] : ? [v6: any] : ? [v7: any] : % 7.00/1.69 (in(v4, v2) = v7 & in(v4, v1) = v6 & in(v4, v0) = v5 & $i(v4) & ( ~ (v7 = 0) % 7.00/1.69 | ~ (v6 = 0) | ~ (v5 = 0)) & (v5 = 0 | (v7 = 0 & v6 = 0)))) % 7.00/1.69 % 7.00/1.69 (t63_zfmisc_1) % 7.00/1.69 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: int] : ( ~ (v4 % 7.00/1.69 = 0) & set_intersection2(v3, v2) = v3 & unordered_pair(v0, v1) = v3 & % 7.00/1.69 in(v0, v2) = v4 & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 7.00/1.69 % 7.00/1.69 (function-axioms) % 7.00/1.69 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 7.00/1.69 (set_intersection2(v3, v2) = v1) | ~ (set_intersection2(v3, v2) = v0)) & ! % 7.00/1.69 [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 7.00/1.69 (unordered_pair(v3, v2) = v1) | ~ (unordered_pair(v3, v2) = v0)) & ! [v0: % 7.00/1.69 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 7.00/1.69 : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) & ! [v0: % 7.00/1.69 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 7.00/1.69 ~ (empty(v2) = v1) | ~ (empty(v2) = v0)) % 7.00/1.69 % 7.00/1.69 Further assumptions not needed in the proof: % 7.00/1.69 -------------------------------------------- % 7.00/1.69 antisymmetry_r2_hidden, commutativity_k3_xboole_0, idempotence_k3_xboole_0, % 7.00/1.69 rc1_xboole_0, rc2_xboole_0 % 7.00/1.69 % 7.00/1.69 Those formulas are unsatisfiable: % 7.00/1.69 --------------------------------- % 7.00/1.69 % 7.00/1.69 Begin of proof % 7.00/1.69 | % 7.00/1.69 | ALPHA: (commutativity_k2_tarski) implies: % 7.00/1.70 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (unordered_pair(v1, v0) = % 7.00/1.70 | v2) | ~ $i(v1) | ~ $i(v0) | (unordered_pair(v0, v1) = v2 & % 7.00/1.70 | $i(v2))) % 7.00/1.70 | % 7.00/1.70 | ALPHA: (d2_tarski) implies: % 7.00/1.70 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 7.00/1.70 | (unordered_pair(v0, v1) = v2) | ~ (in(v1, v2) = v3) | ~ $i(v2) | ~ % 7.00/1.70 | $i(v1) | ~ $i(v0)) % 7.00/1.70 | % 7.00/1.70 | ALPHA: (d3_xboole_0) implies: % 7.00/1.70 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: any] : % 7.00/1.70 | ( ~ (set_intersection2(v0, v1) = v2) | ~ (in(v3, v1) = v4) | ~ $i(v3) % 7.00/1.70 | | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v5: any] : ? [v6: any] : % 7.00/1.70 | (in(v3, v2) = v5 & in(v3, v0) = v6 & ( ~ (v5 = 0) | (v6 = 0 & v4 = % 7.00/1.70 | 0)))) % 7.00/1.70 | % 7.00/1.70 | ALPHA: (function-axioms) implies: % 7.00/1.70 | (4) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 7.00/1.70 | ! [v3: $i] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) % 7.00/1.70 | % 7.00/1.70 | DELTA: instantiating (t63_zfmisc_1) with fresh symbols all_13_0, all_13_1, % 7.00/1.70 | all_13_2, all_13_3, all_13_4 gives: % 7.00/1.70 | (5) ~ (all_13_0 = 0) & set_intersection2(all_13_1, all_13_2) = all_13_1 & % 7.00/1.70 | unordered_pair(all_13_4, all_13_3) = all_13_1 & in(all_13_4, all_13_2) % 7.00/1.70 | = all_13_0 & $i(all_13_1) & $i(all_13_2) & $i(all_13_3) & $i(all_13_4) % 7.00/1.70 | % 7.00/1.70 | ALPHA: (5) implies: % 7.00/1.70 | (6) ~ (all_13_0 = 0) % 7.00/1.70 | (7) $i(all_13_4) % 7.00/1.70 | (8) $i(all_13_3) % 7.00/1.70 | (9) $i(all_13_2) % 7.00/1.70 | (10) in(all_13_4, all_13_2) = all_13_0 % 7.00/1.70 | (11) unordered_pair(all_13_4, all_13_3) = all_13_1 % 7.00/1.70 | (12) set_intersection2(all_13_1, all_13_2) = all_13_1 % 7.00/1.70 | % 7.00/1.71 | GROUND_INST: instantiating (1) with all_13_3, all_13_4, all_13_1, simplifying % 7.00/1.71 | with (7), (8), (11) gives: % 7.00/1.71 | (13) unordered_pair(all_13_3, all_13_4) = all_13_1 & $i(all_13_1) % 7.00/1.71 | % 7.00/1.71 | ALPHA: (13) implies: % 7.00/1.71 | (14) $i(all_13_1) % 7.00/1.71 | (15) unordered_pair(all_13_3, all_13_4) = all_13_1 % 7.00/1.71 | % 7.00/1.71 | GROUND_INST: instantiating (3) with all_13_1, all_13_2, all_13_1, all_13_4, % 7.00/1.71 | all_13_0, simplifying with (7), (9), (10), (12), (14) gives: % 7.00/1.71 | (16) ? [v0: any] : ? [v1: any] : (in(all_13_4, all_13_1) = v1 & % 7.00/1.71 | in(all_13_4, all_13_1) = v0 & ( ~ (v0 = 0) | (v1 = 0 & all_13_0 = % 7.00/1.71 | 0))) % 7.00/1.71 | % 7.00/1.71 | DELTA: instantiating (16) with fresh symbols all_25_0, all_25_1 gives: % 7.00/1.71 | (17) in(all_13_4, all_13_1) = all_25_0 & in(all_13_4, all_13_1) = all_25_1 % 7.00/1.71 | & ( ~ (all_25_1 = 0) | (all_25_0 = 0 & all_13_0 = 0)) % 7.00/1.71 | % 7.00/1.71 | ALPHA: (17) implies: % 7.00/1.71 | (18) in(all_13_4, all_13_1) = all_25_1 % 7.00/1.71 | (19) in(all_13_4, all_13_1) = all_25_0 % 7.00/1.71 | (20) ~ (all_25_1 = 0) | (all_25_0 = 0 & all_13_0 = 0) % 7.00/1.71 | % 7.00/1.71 | BETA: splitting (20) gives: % 7.00/1.71 | % 7.00/1.71 | Case 1: % 7.00/1.71 | | % 7.00/1.71 | | (21) ~ (all_25_1 = 0) % 7.00/1.71 | | % 7.00/1.71 | | GROUND_INST: instantiating (4) with all_25_1, all_25_0, all_13_1, all_13_4, % 7.00/1.71 | | simplifying with (18), (19) gives: % 7.00/1.71 | | (22) all_25_0 = all_25_1 % 7.00/1.71 | | % 7.00/1.71 | | GROUND_INST: instantiating (2) with all_13_3, all_13_4, all_13_1, all_25_1, % 7.00/1.71 | | simplifying with (7), (8), (14), (15), (18) gives: % 7.00/1.71 | | (23) all_25_1 = 0 % 7.00/1.71 | | % 7.00/1.71 | | REDUCE: (21), (23) imply: % 7.00/1.71 | | (24) $false % 7.00/1.71 | | % 7.00/1.71 | | CLOSE: (24) is inconsistent. % 7.00/1.71 | | % 7.00/1.71 | Case 2: % 7.00/1.71 | | % 7.00/1.71 | | (25) all_25_0 = 0 & all_13_0 = 0 % 7.00/1.71 | | % 7.00/1.71 | | ALPHA: (25) implies: % 7.00/1.71 | | (26) all_13_0 = 0 % 7.00/1.71 | | % 7.00/1.71 | | REDUCE: (6), (26) imply: % 7.00/1.71 | | (27) $false % 7.00/1.71 | | % 7.00/1.71 | | CLOSE: (27) is inconsistent. % 7.00/1.71 | | % 7.00/1.71 | End of split % 7.00/1.71 | % 7.00/1.71 End of proof % 7.00/1.72 % SZS output end Proof for theBenchmark % 7.00/1.72 % 7.00/1.72 1114ms %------------------------------------------------------------------------------