%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SEU223+1 : TPTP v8.1.2. Released v3.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n008.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:43:25 EDT 2023 % Result : Theorem 12.08s 2.41s % Output : Proof 12.15s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : SEU223+1 : TPTP v8.1.2. Released v3.3.0. % 0.00/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.35 % Computer : n008.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 : Wed Aug 23 15:52:32 EDT 2023 % 0.13/0.35 % CPUTime : % 0.20/0.60 ________ _____ % 0.20/0.60 ___ __ \_________(_)________________________________ % 0.20/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.60 % 0.20/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.60 (2023-06-19) % 0.20/0.60 % 0.20/0.60 (c) Philipp Rümmer, 2009-2023 % 0.20/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.60 Amanda Stjerna. % 0.20/0.60 Free software under BSD-3-Clause. % 0.20/0.60 % 0.20/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.60 % 0.20/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.61 Running up to 7 provers in parallel. % 0.20/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.57/1.05 Prover 1: Preprocessing ... % 2.57/1.06 Prover 4: Preprocessing ... % 2.57/1.10 Prover 0: Preprocessing ... % 2.57/1.10 Prover 3: Preprocessing ... % 2.57/1.10 Prover 2: Preprocessing ... % 2.57/1.10 Prover 6: Preprocessing ... % 2.57/1.10 Prover 5: Preprocessing ... % 4.66/1.53 Prover 1: Warning: ignoring some quantifiers % 5.75/1.59 Prover 1: Constructing countermodel ... % 5.75/1.59 Prover 3: Warning: ignoring some quantifiers % 5.75/1.61 Prover 6: Proving ... % 5.75/1.62 Prover 5: Proving ... % 5.75/1.62 Prover 3: Constructing countermodel ... % 6.76/1.69 Prover 2: Proving ... % 8.37/1.89 Prover 4: Warning: ignoring some quantifiers % 8.75/1.93 Prover 4: Constructing countermodel ... % 8.93/1.96 Prover 3: gave up % 8.93/1.96 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 8.93/2.00 Prover 7: Preprocessing ... % 9.49/2.04 Prover 0: Proving ... % 9.82/2.13 Prover 7: Warning: ignoring some quantifiers % 10.31/2.15 Prover 7: Constructing countermodel ... % 10.31/2.18 Prover 1: gave up % 10.31/2.20 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 10.31/2.24 Prover 8: Preprocessing ... % 11.91/2.40 Prover 7: Found proof (size 18) % 11.91/2.40 Prover 7: proved (434ms) % 11.91/2.40 Prover 4: stopped % 11.91/2.40 Prover 0: stopped % 11.91/2.40 Prover 2: stopped % 11.91/2.40 Prover 6: stopped % 11.91/2.40 Prover 8: Warning: ignoring some quantifiers % 11.91/2.40 Prover 5: stopped % 11.91/2.41 Prover 8: Constructing countermodel ... % 12.08/2.41 Prover 8: stopped % 12.08/2.41 % 12.08/2.41 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 12.08/2.41 % 12.08/2.41 % SZS output start Proof for theBenchmark % 12.08/2.42 Assumptions after simplification: % 12.08/2.42 --------------------------------- % 12.08/2.42 % 12.08/2.42 (dt_k7_relat_1) % 12.15/2.44 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (relation_dom_restriction(v0, % 12.15/2.44 v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ relation(v0) | relation(v2)) % 12.15/2.44 % 12.15/2.44 (fc4_funct_1) % 12.15/2.44 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (relation_dom_restriction(v0, % 12.15/2.44 v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ function(v0) | ~ relation(v0) | % 12.15/2.44 function(v2)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ % 12.15/2.44 (relation_dom_restriction(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ % 12.15/2.44 function(v0) | ~ relation(v0) | relation(v2)) % 12.15/2.44 % 12.15/2.44 (t68_funct_1) % 12.15/2.46 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~ % 12.15/2.46 (relation_dom(v1) = v2) | ~ (relation_dom_restriction(v3, v0) = v4) | ~ % 12.15/2.46 $i(v3) | ~ $i(v1) | ~ $i(v0) | ~ function(v3) | ~ function(v1) | ~ % 12.15/2.46 relation(v3) | ~ relation(v1) | ? [v5: $i] : ? [v6: $i] : ? [v7: $i] : % 12.15/2.46 ? [v8: $i] : ? [v9: $i] : ($i(v7) & ( ~ (v4 = v1) | (v6 = v2 & % 12.15/2.46 relation_dom(v3) = v5 & set_intersection2(v5, v0) = v2 & $i(v5) & % 12.15/2.46 $i(v2) & ! [v10: $i] : ! [v11: $i] : ( ~ (apply(v3, v10) = v11) | ~ % 12.15/2.46 $i(v10) | ~ in(v10, v2) | (apply(v1, v10) = v11 & $i(v11))) & ! % 12.15/2.46 [v10: $i] : ! [v11: $i] : ( ~ (apply(v1, v10) = v11) | ~ $i(v10) | % 12.15/2.46 ~ in(v10, v2) | (apply(v3, v10) = v11 & $i(v11))))) & (v4 = v1 | ( ~ % 12.15/2.46 (v9 = v8) & apply(v3, v7) = v9 & apply(v1, v7) = v8 & $i(v9) & $i(v8) % 12.15/2.46 & in(v7, v2)) | ( ~ (v6 = v2) & relation_dom(v3) = v5 & % 12.15/2.46 set_intersection2(v5, v0) = v6 & $i(v6) & $i(v5))))) & ? [v0: $i] : % 12.15/2.46 ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~ (relation_dom(v3) = % 12.15/2.46 v4) | ~ (relation_dom(v1) = v2) | ~ $i(v3) | ~ $i(v1) | ~ $i(v0) | ~ % 12.15/2.46 function(v3) | ~ function(v1) | ~ relation(v3) | ~ relation(v1) | ? [v5: % 12.15/2.46 $i] : ? [v6: $i] : ? [v7: $i] : ? [v8: $i] : ? [v9: $i] : ($i(v7) & % 12.15/2.46 ((v6 = v2 & set_intersection2(v4, v0) = v2 & $i(v2) & ! [v10: $i] : ! % 12.15/2.46 [v11: $i] : ( ~ (apply(v3, v10) = v11) | ~ $i(v10) | ~ in(v10, v2) | % 12.15/2.46 (apply(v1, v10) = v11 & $i(v11))) & ! [v10: $i] : ! [v11: $i] : ( % 12.15/2.46 ~ (apply(v1, v10) = v11) | ~ $i(v10) | ~ in(v10, v2) | (apply(v3, % 12.15/2.46 v10) = v11 & $i(v11)))) | ( ~ (v5 = v1) & % 12.15/2.46 relation_dom_restriction(v3, v0) = v5 & $i(v5))) & ((v5 = v1 & % 12.15/2.46 relation_dom_restriction(v3, v0) = v1) | ( ~ (v9 = v8) & apply(v3, v7) % 12.15/2.46 = v9 & apply(v1, v7) = v8 & $i(v9) & $i(v8) & in(v7, v2)) | ( ~ (v6 = % 12.15/2.46 v2) & set_intersection2(v4, v0) = v6 & $i(v6))))) % 12.15/2.46 % 12.15/2.46 (t70_funct_1) % 12.15/2.46 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 12.15/2.46 $i] : ? [v6: $i] : ( ~ (v6 = v5) & apply(v3, v1) = v5 & apply(v2, v1) = v6 % 12.15/2.46 & relation_dom(v3) = v4 & relation_dom_restriction(v2, v0) = v3 & $i(v6) & % 12.15/2.46 $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & in(v1, v4) & % 12.15/2.46 function(v2) & relation(v2)) % 12.15/2.46 % 12.15/2.46 (function-axioms) % 12.15/2.46 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 12.15/2.46 (apply(v3, v2) = v1) | ~ (apply(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] % 12.15/2.46 : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (set_intersection2(v3, v2) = v1) | % 12.15/2.46 ~ (set_intersection2(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 12.15/2.46 $i] : ! [v3: $i] : (v1 = v0 | ~ (relation_dom_restriction(v3, v2) = v1) | % 12.15/2.46 ~ (relation_dom_restriction(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 12.15/2.46 [v2: $i] : (v1 = v0 | ~ (relation_dom(v2) = v1) | ~ (relation_dom(v2) = v0)) % 12.15/2.46 % 12.15/2.46 Further assumptions not needed in the proof: % 12.15/2.46 -------------------------------------------- % 12.15/2.46 antisymmetry_r2_hidden, cc1_funct_1, cc1_relat_1, cc2_funct_1, % 12.15/2.46 commutativity_k3_xboole_0, dt_k1_funct_1, dt_k1_relat_1, dt_k1_xboole_0, % 12.15/2.46 dt_k3_xboole_0, dt_m1_subset_1, existence_m1_subset_1, fc12_relat_1, % 12.15/2.46 fc13_relat_1, fc1_relat_1, fc1_xboole_0, fc4_relat_1, fc5_relat_1, fc7_relat_1, % 12.15/2.46 idempotence_k3_xboole_0, rc1_funct_1, rc1_relat_1, rc1_xboole_0, rc2_funct_1, % 12.15/2.46 rc2_relat_1, rc2_xboole_0, rc3_funct_1, rc3_relat_1, t1_subset, t2_boole, % 12.15/2.46 t2_subset, t6_boole, t7_boole, t8_boole % 12.15/2.46 % 12.15/2.46 Those formulas are unsatisfiable: % 12.15/2.46 --------------------------------- % 12.15/2.46 % 12.15/2.46 Begin of proof % 12.15/2.46 | % 12.15/2.46 | ALPHA: (fc4_funct_1) implies: % 12.15/2.47 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ % 12.15/2.47 | (relation_dom_restriction(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ % 12.15/2.47 | function(v0) | ~ relation(v0) | function(v2)) % 12.15/2.47 | % 12.15/2.47 | ALPHA: (t68_funct_1) implies: % 12.15/2.47 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( % 12.15/2.47 | ~ (relation_dom(v1) = v2) | ~ (relation_dom_restriction(v3, v0) = % 12.15/2.47 | v4) | ~ $i(v3) | ~ $i(v1) | ~ $i(v0) | ~ function(v3) | ~ % 12.15/2.47 | function(v1) | ~ relation(v3) | ~ relation(v1) | ? [v5: $i] : ? % 12.15/2.47 | [v6: $i] : ? [v7: $i] : ? [v8: $i] : ? [v9: $i] : ($i(v7) & ( ~ % 12.15/2.47 | (v4 = v1) | (v6 = v2 & relation_dom(v3) = v5 & % 12.15/2.47 | set_intersection2(v5, v0) = v2 & $i(v5) & $i(v2) & ! [v10: $i] % 12.15/2.47 | : ! [v11: $i] : ( ~ (apply(v3, v10) = v11) | ~ $i(v10) | ~ % 12.15/2.47 | in(v10, v2) | (apply(v1, v10) = v11 & $i(v11))) & ! [v10: % 12.15/2.47 | $i] : ! [v11: $i] : ( ~ (apply(v1, v10) = v11) | ~ $i(v10) % 12.15/2.47 | | ~ in(v10, v2) | (apply(v3, v10) = v11 & $i(v11))))) & (v4 % 12.15/2.47 | = v1 | ( ~ (v9 = v8) & apply(v3, v7) = v9 & apply(v1, v7) = v8 & % 12.15/2.47 | $i(v9) & $i(v8) & in(v7, v2)) | ( ~ (v6 = v2) & % 12.15/2.47 | relation_dom(v3) = v5 & set_intersection2(v5, v0) = v6 & $i(v6) % 12.15/2.47 | & $i(v5))))) % 12.15/2.47 | % 12.15/2.47 | ALPHA: (function-axioms) implies: % 12.15/2.47 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 12.15/2.47 | (apply(v3, v2) = v1) | ~ (apply(v3, v2) = v0)) % 12.15/2.47 | % 12.15/2.47 | DELTA: instantiating (t70_funct_1) with fresh symbols all_40_0, all_40_1, % 12.15/2.47 | all_40_2, all_40_3, all_40_4, all_40_5, all_40_6 gives: % 12.15/2.47 | (4) ~ (all_40_0 = all_40_1) & apply(all_40_3, all_40_5) = all_40_1 & % 12.15/2.47 | apply(all_40_4, all_40_5) = all_40_0 & relation_dom(all_40_3) = % 12.15/2.47 | all_40_2 & relation_dom_restriction(all_40_4, all_40_6) = all_40_3 & % 12.15/2.47 | $i(all_40_0) & $i(all_40_1) & $i(all_40_2) & $i(all_40_3) & % 12.15/2.47 | $i(all_40_4) & $i(all_40_5) & $i(all_40_6) & in(all_40_5, all_40_2) & % 12.15/2.47 | function(all_40_4) & relation(all_40_4) % 12.15/2.47 | % 12.15/2.47 | ALPHA: (4) implies: % 12.15/2.47 | (5) ~ (all_40_0 = all_40_1) % 12.15/2.47 | (6) relation(all_40_4) % 12.15/2.47 | (7) function(all_40_4) % 12.15/2.48 | (8) in(all_40_5, all_40_2) % 12.15/2.48 | (9) $i(all_40_6) % 12.15/2.48 | (10) $i(all_40_5) % 12.15/2.48 | (11) $i(all_40_4) % 12.15/2.48 | (12) $i(all_40_3) % 12.15/2.48 | (13) relation_dom_restriction(all_40_4, all_40_6) = all_40_3 % 12.15/2.48 | (14) relation_dom(all_40_3) = all_40_2 % 12.15/2.48 | (15) apply(all_40_4, all_40_5) = all_40_0 % 12.15/2.48 | (16) apply(all_40_3, all_40_5) = all_40_1 % 12.15/2.48 | % 12.15/2.48 | GROUND_INST: instantiating (3) with all_40_0, all_40_1, all_40_5, all_40_4, % 12.15/2.48 | simplifying with (15) gives: % 12.15/2.48 | (17) all_40_0 = all_40_1 | ~ (apply(all_40_4, all_40_5) = all_40_1) % 12.15/2.48 | % 12.15/2.48 | GROUND_INST: instantiating (1) with all_40_4, all_40_6, all_40_3, simplifying % 12.15/2.48 | with (6), (7), (9), (11), (13) gives: % 12.15/2.48 | (18) function(all_40_3) % 12.15/2.48 | % 12.15/2.48 | GROUND_INST: instantiating (dt_k7_relat_1) with all_40_4, all_40_6, all_40_3, % 12.15/2.48 | simplifying with (6), (9), (11), (13) gives: % 12.15/2.48 | (19) relation(all_40_3) % 12.15/2.48 | % 12.15/2.48 | GROUND_INST: instantiating (2) with all_40_6, all_40_3, all_40_2, all_40_4, % 12.15/2.48 | all_40_3, simplifying with (6), (7), (9), (11), (12), (13), (14), % 12.15/2.48 | (18), (19) gives: % 12.15/2.48 | (20) ? [v0: $i] : ? [v1: $i] : (relation_dom(all_40_4) = v0 & % 12.15/2.48 | set_intersection2(v0, all_40_6) = all_40_2 & $i(v1) & $i(v0) & % 12.15/2.48 | $i(all_40_2) & ! [v2: $i] : ! [v3: $i] : ( ~ (apply(all_40_3, v2) % 12.15/2.48 | = v3) | ~ $i(v2) | ~ in(v2, all_40_2) | (apply(all_40_4, v2) = % 12.15/2.48 | v3 & $i(v3))) & ! [v2: $i] : ! [v3: $i] : ( ~ (apply(all_40_4, % 12.15/2.48 | v2) = v3) | ~ $i(v2) | ~ in(v2, all_40_2) | (apply(all_40_3, % 12.15/2.48 | v2) = v3 & $i(v3)))) % 12.15/2.48 | % 12.15/2.48 | DELTA: instantiating (20) with fresh symbols all_63_0, all_63_1 gives: % 12.15/2.48 | (21) relation_dom(all_40_4) = all_63_1 & set_intersection2(all_63_1, % 12.15/2.48 | all_40_6) = all_40_2 & $i(all_63_0) & $i(all_63_1) & $i(all_40_2) & % 12.15/2.48 | ! [v0: $i] : ! [v1: $i] : ( ~ (apply(all_40_3, v0) = v1) | ~ $i(v0) % 12.15/2.48 | | ~ in(v0, all_40_2) | (apply(all_40_4, v0) = v1 & $i(v1))) & ! % 12.15/2.48 | [v0: $i] : ! [v1: $i] : ( ~ (apply(all_40_4, v0) = v1) | ~ $i(v0) | % 12.15/2.48 | ~ in(v0, all_40_2) | (apply(all_40_3, v0) = v1 & $i(v1))) % 12.15/2.48 | % 12.15/2.48 | ALPHA: (21) implies: % 12.15/2.48 | (22) ! [v0: $i] : ! [v1: $i] : ( ~ (apply(all_40_3, v0) = v1) | ~ $i(v0) % 12.15/2.48 | | ~ in(v0, all_40_2) | (apply(all_40_4, v0) = v1 & $i(v1))) % 12.15/2.48 | % 12.15/2.48 | GROUND_INST: instantiating (22) with all_40_5, all_40_1, simplifying with (8), % 12.15/2.48 | (10), (16) gives: % 12.15/2.48 | (23) apply(all_40_4, all_40_5) = all_40_1 & $i(all_40_1) % 12.15/2.48 | % 12.15/2.48 | ALPHA: (23) implies: % 12.15/2.48 | (24) apply(all_40_4, all_40_5) = all_40_1 % 12.15/2.48 | % 12.15/2.49 | BETA: splitting (17) gives: % 12.15/2.49 | % 12.15/2.49 | Case 1: % 12.15/2.49 | | % 12.15/2.49 | | (25) ~ (apply(all_40_4, all_40_5) = all_40_1) % 12.15/2.49 | | % 12.15/2.49 | | PRED_UNIFY: (24), (25) imply: % 12.15/2.49 | | (26) $false % 12.15/2.49 | | % 12.15/2.49 | | CLOSE: (26) is inconsistent. % 12.15/2.49 | | % 12.15/2.49 | Case 2: % 12.15/2.49 | | % 12.15/2.49 | | (27) all_40_0 = all_40_1 % 12.15/2.49 | | % 12.15/2.49 | | REDUCE: (5), (27) imply: % 12.15/2.49 | | (28) $false % 12.15/2.49 | | % 12.15/2.49 | | CLOSE: (28) is inconsistent. % 12.15/2.49 | | % 12.15/2.49 | End of split % 12.15/2.49 | % 12.15/2.49 End of proof % 12.15/2.49 % SZS output end Proof for theBenchmark % 12.15/2.49 % 12.15/2.49 1886ms %------------------------------------------------------------------------------