%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SEU307+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 : n021.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:59 EDT 2023 % Result : Theorem 12.71s 2.58s % Output : Proof 18.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU307+1 : TPTP v8.1.2. Released v3.3.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n021.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 : Wed Aug 23 16:07:54 EDT 2023 % 0.13/0.34 % 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.61 Amanda Stjerna. % 0.20/0.61 Free software under BSD-3-Clause. % 0.20/0.61 % 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.61 % 0.20/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.62 Running up to 7 provers in parallel. % 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 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 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 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 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 % 3.50/1.20 Prover 1: Preprocessing ... % 3.50/1.20 Prover 4: Preprocessing ... % 3.73/1.23 Prover 5: Preprocessing ... % 3.73/1.23 Prover 3: Preprocessing ... % 3.73/1.23 Prover 6: Preprocessing ... % 3.73/1.23 Prover 0: Preprocessing ... % 3.73/1.23 Prover 2: Preprocessing ... % 7.63/1.89 Prover 5: Proving ... % 8.72/1.99 Prover 1: Warning: ignoring some quantifiers % 8.72/2.02 Prover 3: Warning: ignoring some quantifiers % 8.72/2.05 Prover 1: Constructing countermodel ... % 8.72/2.05 Prover 3: Constructing countermodel ... % 8.72/2.06 Prover 6: Proving ... % 9.41/2.14 Prover 2: Proving ... % 10.98/2.35 Prover 4: Warning: ignoring some quantifiers % 12.15/2.47 Prover 4: Constructing countermodel ... % 12.71/2.57 Prover 5: proved (1938ms) % 12.71/2.58 % 12.71/2.58 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 12.71/2.58 % 12.71/2.58 Prover 3: stopped % 12.71/2.58 Prover 6: stopped % 12.71/2.58 Prover 2: stopped % 12.71/2.58 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 12.71/2.58 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 12.71/2.58 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 12.71/2.59 Prover 0: Proving ... % 12.71/2.59 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 12.71/2.59 Prover 0: stopped % 12.71/2.60 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 13.76/2.67 Prover 11: Preprocessing ... % 13.76/2.67 Prover 8: Preprocessing ... % 13.76/2.67 Prover 10: Preprocessing ... % 13.76/2.69 Prover 7: Preprocessing ... % 13.76/2.73 Prover 13: Preprocessing ... % 13.76/2.87 Prover 10: Warning: ignoring some quantifiers % 13.76/2.90 Prover 7: Warning: ignoring some quantifiers % 13.76/2.90 Prover 8: Warning: ignoring some quantifiers % 14.78/2.92 Prover 8: Constructing countermodel ... % 14.78/2.92 Prover 10: Constructing countermodel ... % 15.78/2.95 Prover 7: Constructing countermodel ... % 15.78/2.95 Prover 13: Warning: ignoring some quantifiers % 16.05/3.00 Prover 13: Constructing countermodel ... % 17.43/3.17 Prover 11: Warning: ignoring some quantifiers % 17.43/3.19 Prover 11: Constructing countermodel ... % 17.43/3.21 Prover 10: Found proof (size 45) % 17.43/3.21 Prover 10: proved (630ms) % 17.43/3.21 Prover 11: stopped % 17.43/3.21 Prover 8: stopped % 17.43/3.21 Prover 7: stopped % 17.43/3.21 Prover 1: stopped % 17.43/3.21 Prover 13: stopped % 17.43/3.21 Prover 4: stopped % 17.43/3.21 % 17.43/3.21 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 17.43/3.21 % 17.43/3.23 % SZS output start Proof for theBenchmark % 17.43/3.23 Assumptions after simplification: % 17.43/3.23 --------------------------------- % 17.43/3.23 % 17.43/3.23 (d3_pre_topc) % 18.00/3.26 ! [v0: $i] : ! [v1: $i] : ( ~ (cast_as_carrier_subset(v0) = v1) | ~ $i(v0) % 18.00/3.26 | ~ one_sorted_str(v0) | (the_carrier(v0) = v1 & $i(v1))) % 18.00/3.26 % 18.00/3.26 (dt_k2_pre_topc) % 18.00/3.26 ! [v0: $i] : ! [v1: $i] : ( ~ (cast_as_carrier_subset(v0) = v1) | ~ $i(v0) % 18.00/3.26 | ~ one_sorted_str(v0) | ? [v2: $i] : ? [v3: $i] : (the_carrier(v0) = v2 % 18.00/3.26 & powerset(v2) = v3 & $i(v3) & $i(v2) & element(v1, v3))) % 18.00/3.26 % 18.00/3.26 (dt_k5_subset_1) % 18.00/3.26 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ % 18.00/3.26 (subset_intersection2(v0, v1, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) % 18.00/3.26 | ? [v4: $i] : (powerset(v0) = v4 & $i(v4) & ( ~ element(v2, v4) | ~ % 18.00/3.26 element(v1, v4) | element(v3, v4)))) % 18.00/3.26 % 18.00/3.26 (redefinition_k5_subset_1) % 18.00/3.26 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ % 18.00/3.26 (subset_intersection2(v0, v1, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) % 18.00/3.26 | ? [v4: $i] : ? [v5: $i] : ((v5 = v3 & set_intersection2(v1, v2) = v3 & % 18.00/3.26 $i(v3)) | (powerset(v0) = v4 & $i(v4) & ( ~ element(v2, v4) | ~ % 18.00/3.26 element(v1, v4))))) % 18.00/3.26 % 18.00/3.26 (t15_pre_topc) % 18.00/3.27 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 18.00/3.27 $i] : ( ~ (v5 = v4) & cast_as_carrier_subset(v0) = v3 & the_carrier(v0) = v1 % 18.00/3.27 & subset_intersection2(v1, v4, v3) = v5 & powerset(v1) = v2 & $i(v5) & % 18.00/3.27 $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & one_sorted_str(v0) & % 18.00/3.27 element(v4, v2)) % 18.00/3.27 % 18.00/3.27 (t28_xboole_1) % 18.00/3.27 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v0 | ~ (set_intersection2(v0, % 18.00/3.27 v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ subset(v0, v1)) % 18.00/3.27 % 18.00/3.27 (t3_subset) % 18.00/3.27 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (powerset(v1) = v2) | ~ $i(v1) % 18.00/3.27 | ~ $i(v0) | ~ subset(v0, v1) | element(v0, v2)) & ! [v0: $i] : ! [v1: % 18.00/3.27 $i] : ! [v2: $i] : ( ~ (powerset(v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ % 18.00/3.27 element(v0, v2) | subset(v0, v1)) % 18.00/3.27 % 18.00/3.27 (function-axioms) % 18.00/3.27 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 % 18.00/3.27 | ~ (subset_intersection2(v4, v3, v2) = v1) | ~ (subset_intersection2(v4, % 18.00/3.27 v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : % 18.00/3.27 (v1 = v0 | ~ (set_intersection2(v3, v2) = v1) | ~ (set_intersection2(v3, v2) % 18.00/3.27 = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 18.00/3.27 (cast_as_carrier_subset(v2) = v1) | ~ (cast_as_carrier_subset(v2) = v0)) & % 18.00/3.27 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (the_carrier(v2) = v1) % 18.00/3.27 | ~ (the_carrier(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 % 18.00/3.27 = v0 | ~ (powerset(v2) = v1) | ~ (powerset(v2) = v0)) % 18.00/3.27 % 18.00/3.27 Further assumptions not needed in the proof: % 18.00/3.27 -------------------------------------------- % 18.00/3.27 antisymmetry_r2_hidden, cc10_membered, cc11_membered, cc12_membered, % 18.00/3.27 cc13_membered, cc14_membered, cc15_membered, cc16_membered, cc17_membered, % 18.00/3.27 cc18_membered, cc19_membered, cc1_membered, cc20_membered, cc2_membered, % 18.00/3.27 cc3_membered, cc4_membered, commutativity_k3_xboole_0, % 18.00/3.27 commutativity_k5_subset_1, dt_k1_xboole_0, dt_k1_zfmisc_1, dt_k3_xboole_0, % 18.00/3.27 dt_l1_struct_0, dt_m1_subset_1, dt_u1_struct_0, existence_l1_struct_0, % 18.00/3.27 existence_m1_subset_1, fc1_subset_1, fc27_membered, fc28_membered, % 18.00/3.27 fc29_membered, fc30_membered, fc31_membered, fc32_membered, fc33_membered, % 18.00/3.27 fc34_membered, fc35_membered, fc36_membered, fc6_membered, % 18.00/3.27 idempotence_k3_xboole_0, idempotence_k5_subset_1, rc1_membered, rc1_subset_1, % 18.00/3.27 rc2_subset_1, reflexivity_r1_tarski, t1_subset, t2_boole, t2_subset, t4_subset, % 18.00/3.27 t5_subset, t6_boole, t7_boole, t8_boole % 18.00/3.27 % 18.00/3.27 Those formulas are unsatisfiable: % 18.00/3.27 --------------------------------- % 18.00/3.27 % 18.00/3.27 Begin of proof % 18.00/3.27 | % 18.00/3.27 | ALPHA: (t3_subset) implies: % 18.00/3.27 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (powerset(v1) = v2) | ~ % 18.00/3.27 | $i(v1) | ~ $i(v0) | ~ element(v0, v2) | subset(v0, v1)) % 18.00/3.27 | % 18.00/3.27 | ALPHA: (function-axioms) implies: % 18.00/3.28 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (powerset(v2) = % 18.00/3.28 | v1) | ~ (powerset(v2) = v0)) % 18.00/3.28 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 18.00/3.28 | (the_carrier(v2) = v1) | ~ (the_carrier(v2) = v0)) % 18.00/3.28 | % 18.00/3.28 | DELTA: instantiating (t15_pre_topc) with fresh symbols all_58_0, all_58_1, % 18.00/3.28 | all_58_2, all_58_3, all_58_4, all_58_5 gives: % 18.00/3.28 | (4) ~ (all_58_0 = all_58_1) & cast_as_carrier_subset(all_58_5) = all_58_2 % 18.00/3.28 | & the_carrier(all_58_5) = all_58_4 & subset_intersection2(all_58_4, % 18.00/3.28 | all_58_1, all_58_2) = all_58_0 & powerset(all_58_4) = all_58_3 & % 18.00/3.28 | $i(all_58_0) & $i(all_58_1) & $i(all_58_2) & $i(all_58_3) & % 18.00/3.28 | $i(all_58_4) & $i(all_58_5) & one_sorted_str(all_58_5) & % 18.00/3.28 | element(all_58_1, all_58_3) % 18.00/3.28 | % 18.00/3.28 | ALPHA: (4) implies: % 18.00/3.28 | (5) ~ (all_58_0 = all_58_1) % 18.00/3.28 | (6) element(all_58_1, all_58_3) % 18.00/3.28 | (7) one_sorted_str(all_58_5) % 18.00/3.28 | (8) $i(all_58_5) % 18.00/3.28 | (9) $i(all_58_4) % 18.00/3.28 | (10) $i(all_58_2) % 18.00/3.28 | (11) $i(all_58_1) % 18.00/3.28 | (12) powerset(all_58_4) = all_58_3 % 18.00/3.28 | (13) subset_intersection2(all_58_4, all_58_1, all_58_2) = all_58_0 % 18.00/3.28 | (14) the_carrier(all_58_5) = all_58_4 % 18.00/3.28 | (15) cast_as_carrier_subset(all_58_5) = all_58_2 % 18.00/3.28 | % 18.00/3.28 | GROUND_INST: instantiating (1) with all_58_1, all_58_4, all_58_3, simplifying % 18.00/3.28 | with (6), (9), (11), (12) gives: % 18.00/3.28 | (16) subset(all_58_1, all_58_4) % 18.00/3.28 | % 18.00/3.28 | GROUND_INST: instantiating (redefinition_k5_subset_1) with all_58_4, all_58_1, % 18.00/3.28 | all_58_2, all_58_0, simplifying with (9), (10), (11), (13) gives: % 18.00/3.28 | (17) ? [v0: $i] : ? [v1: int] : ((v1 = all_58_0 & % 18.00/3.28 | set_intersection2(all_58_1, all_58_2) = all_58_0 & $i(all_58_0)) | % 18.00/3.28 | (powerset(all_58_4) = v0 & $i(v0) & ( ~ element(all_58_1, v0) | ~ % 18.00/3.28 | element(all_58_2, v0)))) % 18.00/3.28 | % 18.18/3.28 | GROUND_INST: instantiating (dt_k5_subset_1) with all_58_4, all_58_1, all_58_2, % 18.18/3.28 | all_58_0, simplifying with (9), (10), (11), (13) gives: % 18.18/3.28 | (18) ? [v0: $i] : (powerset(all_58_4) = v0 & $i(v0) & ( ~ % 18.18/3.28 | element(all_58_1, v0) | ~ element(all_58_2, v0) | % 18.18/3.28 | element(all_58_0, v0))) % 18.18/3.28 | % 18.18/3.28 | GROUND_INST: instantiating (dt_k2_pre_topc) with all_58_5, all_58_2, % 18.18/3.28 | simplifying with (7), (8), (15) gives: % 18.18/3.28 | (19) ? [v0: $i] : ? [v1: $i] : (the_carrier(all_58_5) = v0 & powerset(v0) % 18.18/3.28 | = v1 & $i(v1) & $i(v0) & element(all_58_2, v1)) % 18.18/3.28 | % 18.18/3.28 | GROUND_INST: instantiating (d3_pre_topc) with all_58_5, all_58_2, simplifying % 18.18/3.28 | with (7), (8), (15) gives: % 18.18/3.28 | (20) the_carrier(all_58_5) = all_58_2 & $i(all_58_2) % 18.18/3.28 | % 18.18/3.28 | ALPHA: (20) implies: % 18.18/3.28 | (21) the_carrier(all_58_5) = all_58_2 % 18.18/3.28 | % 18.18/3.28 | DELTA: instantiating (19) with fresh symbols all_68_0, all_68_1 gives: % 18.18/3.28 | (22) the_carrier(all_58_5) = all_68_1 & powerset(all_68_1) = all_68_0 & % 18.18/3.28 | $i(all_68_0) & $i(all_68_1) & element(all_58_2, all_68_0) % 18.18/3.28 | % 18.18/3.28 | ALPHA: (22) implies: % 18.18/3.29 | (23) element(all_58_2, all_68_0) % 18.18/3.29 | (24) powerset(all_68_1) = all_68_0 % 18.18/3.29 | (25) the_carrier(all_58_5) = all_68_1 % 18.18/3.29 | % 18.18/3.29 | DELTA: instantiating (18) with fresh symbol all_70_0 gives: % 18.18/3.29 | (26) powerset(all_58_4) = all_70_0 & $i(all_70_0) & ( ~ element(all_58_1, % 18.18/3.29 | all_70_0) | ~ element(all_58_2, all_70_0) | element(all_58_0, % 18.18/3.29 | all_70_0)) % 18.18/3.29 | % 18.18/3.29 | ALPHA: (26) implies: % 18.18/3.29 | (27) powerset(all_58_4) = all_70_0 % 18.18/3.29 | % 18.18/3.29 | DELTA: instantiating (17) with fresh symbols all_72_0, all_72_1 gives: % 18.18/3.29 | (28) (all_72_0 = all_58_0 & set_intersection2(all_58_1, all_58_2) = % 18.18/3.29 | all_58_0 & $i(all_58_0)) | (powerset(all_58_4) = all_72_1 & % 18.18/3.29 | $i(all_72_1) & ( ~ element(all_58_1, all_72_1) | ~ % 18.18/3.29 | element(all_58_2, all_72_1))) % 18.18/3.29 | % 18.18/3.29 | GROUND_INST: instantiating (2) with all_58_3, all_70_0, all_58_4, simplifying % 18.18/3.29 | with (12), (27) gives: % 18.18/3.29 | (29) all_70_0 = all_58_3 % 18.18/3.29 | % 18.18/3.29 | GROUND_INST: instantiating (3) with all_58_4, all_68_1, all_58_5, simplifying % 18.18/3.29 | with (14), (25) gives: % 18.18/3.29 | (30) all_68_1 = all_58_4 % 18.18/3.29 | % 18.18/3.29 | GROUND_INST: instantiating (3) with all_58_2, all_68_1, all_58_5, simplifying % 18.18/3.29 | with (21), (25) gives: % 18.18/3.29 | (31) all_68_1 = all_58_2 % 18.18/3.29 | % 18.18/3.29 | COMBINE_EQS: (30), (31) imply: % 18.18/3.29 | (32) all_58_2 = all_58_4 % 18.18/3.29 | % 18.18/3.29 | SIMP: (32) implies: % 18.18/3.29 | (33) all_58_2 = all_58_4 % 18.18/3.29 | % 18.18/3.29 | REDUCE: (24), (30) imply: % 18.18/3.29 | (34) powerset(all_58_4) = all_68_0 % 18.18/3.29 | % 18.18/3.29 | REDUCE: (23), (33) imply: % 18.18/3.29 | (35) element(all_58_4, all_68_0) % 18.18/3.29 | % 18.18/3.29 | GROUND_INST: instantiating (2) with all_58_3, all_68_0, all_58_4, simplifying % 18.18/3.29 | with (12), (34) gives: % 18.18/3.29 | (36) all_68_0 = all_58_3 % 18.18/3.29 | % 18.18/3.29 | REDUCE: (35), (36) imply: % 18.18/3.29 | (37) element(all_58_4, all_58_3) % 18.18/3.29 | % 18.18/3.29 | BETA: splitting (28) gives: % 18.18/3.29 | % 18.18/3.29 | Case 1: % 18.18/3.29 | | % 18.18/3.29 | | (38) all_72_0 = all_58_0 & set_intersection2(all_58_1, all_58_2) = % 18.18/3.29 | | all_58_0 & $i(all_58_0) % 18.18/3.29 | | % 18.18/3.29 | | ALPHA: (38) implies: % 18.18/3.29 | | (39) set_intersection2(all_58_1, all_58_2) = all_58_0 % 18.18/3.29 | | % 18.18/3.29 | | REDUCE: (33), (39) imply: % 18.18/3.29 | | (40) set_intersection2(all_58_1, all_58_4) = all_58_0 % 18.18/3.29 | | % 18.18/3.29 | | GROUND_INST: instantiating (t28_xboole_1) with all_58_1, all_58_4, all_58_0, % 18.18/3.29 | | simplifying with (9), (11), (16), (40) gives: % 18.18/3.29 | | (41) all_58_0 = all_58_1 % 18.18/3.29 | | % 18.18/3.29 | | REDUCE: (5), (41) imply: % 18.18/3.29 | | (42) $false % 18.18/3.29 | | % 18.18/3.29 | | CLOSE: (42) is inconsistent. % 18.18/3.29 | | % 18.18/3.29 | Case 2: % 18.18/3.29 | | % 18.18/3.29 | | (43) powerset(all_58_4) = all_72_1 & $i(all_72_1) & ( ~ element(all_58_1, % 18.18/3.29 | | all_72_1) | ~ element(all_58_2, all_72_1)) % 18.18/3.29 | | % 18.18/3.29 | | ALPHA: (43) implies: % 18.18/3.29 | | (44) powerset(all_58_4) = all_72_1 % 18.18/3.29 | | (45) ~ element(all_58_1, all_72_1) | ~ element(all_58_2, all_72_1) % 18.18/3.29 | | % 18.18/3.29 | | GROUND_INST: instantiating (2) with all_58_3, all_72_1, all_58_4, % 18.18/3.29 | | simplifying with (12), (44) gives: % 18.18/3.29 | | (46) all_72_1 = all_58_3 % 18.18/3.29 | | % 18.18/3.29 | | BETA: splitting (45) gives: % 18.18/3.29 | | % 18.18/3.29 | | Case 1: % 18.18/3.29 | | | % 18.18/3.29 | | | (47) ~ element(all_58_1, all_72_1) % 18.18/3.29 | | | % 18.18/3.29 | | | REDUCE: (46), (47) imply: % 18.18/3.29 | | | (48) ~ element(all_58_1, all_58_3) % 18.18/3.29 | | | % 18.18/3.29 | | | PRED_UNIFY: (6), (48) imply: % 18.18/3.29 | | | (49) $false % 18.18/3.29 | | | % 18.18/3.29 | | | CLOSE: (49) is inconsistent. % 18.18/3.29 | | | % 18.18/3.29 | | Case 2: % 18.18/3.29 | | | % 18.18/3.30 | | | (50) ~ element(all_58_2, all_72_1) % 18.18/3.30 | | | % 18.18/3.30 | | | REDUCE: (33), (46), (50) imply: % 18.18/3.30 | | | (51) ~ element(all_58_4, all_58_3) % 18.18/3.30 | | | % 18.18/3.30 | | | PRED_UNIFY: (37), (51) imply: % 18.18/3.30 | | | (52) $false % 18.18/3.30 | | | % 18.18/3.30 | | | CLOSE: (52) is inconsistent. % 18.18/3.30 | | | % 18.18/3.30 | | End of split % 18.18/3.30 | | % 18.18/3.30 | End of split % 18.18/3.30 | % 18.18/3.30 End of proof % 18.18/3.30 % SZS output end Proof for theBenchmark % 18.18/3.30 % 18.18/3.30 2689ms %------------------------------------------------------------------------------