%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SEU321+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 : n032.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:44:04 EDT 2023 % Result : Theorem 11.38s 2.18s % Output : Proof 14.92s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.10 % Problem : SEU321+1 : TPTP v8.1.2. Released v3.3.0. % 0.00/0.10 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.11/0.29 % Computer : n032.cluster.edu % 0.11/0.29 % Model : x86_64 x86_64 % 0.11/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.29 % Memory : 8042.1875MB % 0.11/0.29 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.30 % CPULimit : 300 % 0.11/0.30 % WCLimit : 300 % 0.11/0.30 % DateTime : Wed Aug 23 21:34:26 EDT 2023 % 0.11/0.30 % CPUTime : % 0.15/0.51 ________ _____ % 0.15/0.51 ___ __ \_________(_)________________________________ % 0.15/0.51 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.15/0.51 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.15/0.51 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.15/0.51 % 0.15/0.51 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.15/0.51 (2023-06-19) % 0.15/0.51 % 0.15/0.51 (c) Philipp Rümmer, 2009-2023 % 0.15/0.51 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.15/0.51 Amanda Stjerna. % 0.15/0.51 Free software under BSD-3-Clause. % 0.15/0.51 % 0.15/0.51 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.15/0.51 % 0.15/0.51 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.15/0.52 Running up to 7 provers in parallel. % 0.15/0.53 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.15/0.53 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.15/0.53 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.15/0.53 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.15/0.53 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.15/0.53 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.15/0.53 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.53/0.97 Prover 1: Preprocessing ... % 2.53/0.97 Prover 4: Preprocessing ... % 2.68/1.01 Prover 5: Preprocessing ... % 2.68/1.01 Prover 2: Preprocessing ... % 2.68/1.02 Prover 0: Preprocessing ... % 2.68/1.02 Prover 3: Preprocessing ... % 2.68/1.02 Prover 6: Preprocessing ... % 6.18/1.53 Prover 5: Proving ... % 6.18/1.53 Prover 1: Warning: ignoring some quantifiers % 6.18/1.53 Prover 2: Proving ... % 6.78/1.56 Prover 1: Constructing countermodel ... % 6.78/1.56 Prover 3: Warning: ignoring some quantifiers % 7.09/1.58 Prover 3: Constructing countermodel ... % 7.09/1.60 Prover 6: Proving ... % 8.37/1.83 Prover 4: Warning: ignoring some quantifiers % 9.25/1.87 Prover 4: Constructing countermodel ... % 9.72/1.94 Prover 0: Proving ... % 11.38/2.18 Prover 3: proved (1647ms) % 11.38/2.18 % 11.38/2.18 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.38/2.18 % 11.38/2.18 Prover 2: stopped % 11.38/2.19 Prover 0: stopped % 11.38/2.20 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 11.38/2.20 Prover 6: stopped % 11.38/2.20 Prover 5: stopped % 11.66/2.21 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 11.66/2.21 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 11.66/2.21 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 11.66/2.21 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 11.90/2.25 Prover 10: Preprocessing ... % 11.90/2.26 Prover 7: Preprocessing ... % 11.90/2.27 Prover 8: Preprocessing ... % 11.90/2.29 Prover 11: Preprocessing ... % 11.90/2.29 Prover 13: Preprocessing ... % 12.62/2.33 Prover 10: Warning: ignoring some quantifiers % 12.62/2.34 Prover 10: Constructing countermodel ... % 12.62/2.38 Prover 7: Warning: ignoring some quantifiers % 13.10/2.39 Prover 7: Constructing countermodel ... % 13.10/2.40 Prover 13: Warning: ignoring some quantifiers % 13.10/2.41 Prover 13: Constructing countermodel ... % 13.10/2.43 Prover 8: Warning: ignoring some quantifiers % 13.10/2.45 Prover 8: Constructing countermodel ... % 14.92/2.65 Prover 11: Warning: ignoring some quantifiers % 14.92/2.65 Prover 10: Found proof (size 44) % 14.92/2.65 Prover 10: proved (453ms) % 14.92/2.65 Prover 7: stopped % 14.92/2.65 Prover 8: stopped % 14.92/2.65 Prover 13: stopped % 14.92/2.65 Prover 1: stopped % 14.92/2.66 Prover 4: stopped % 14.92/2.67 Prover 11: Constructing countermodel ... % 14.92/2.68 Prover 11: stopped % 14.92/2.68 % 14.92/2.68 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 14.92/2.68 % 14.92/2.69 % SZS output start Proof for theBenchmark % 14.92/2.69 Assumptions after simplification: % 14.92/2.69 --------------------------------- % 14.92/2.69 % 14.92/2.69 (dt_k3_subset_1) % 14.92/2.72 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (subset_complement(v0, v1) = v2) % 14.92/2.72 | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : (powerset(v0) = v3 & $i(v3) & ( ~ % 14.92/2.72 element(v1, v3) | element(v2, v3)))) % 14.92/2.72 % 14.92/2.72 (fc1_struct_0) % 14.92/2.72 ! [v0: $i] : ! [v1: $i] : ( ~ (the_carrier(v0) = v1) | ~ $i(v0) | ~ % 14.92/2.72 empty(v1) | ~ one_sorted_str(v0) | empty_carrier(v0)) % 14.92/2.72 % 14.92/2.72 (fc6_membered) % 14.92/2.72 $i(empty_set) & v1_membered(empty_set) & v2_membered(empty_set) & % 14.92/2.72 v3_membered(empty_set) & v4_membered(empty_set) & v5_membered(empty_set) & % 14.92/2.72 empty(empty_set) % 14.92/2.72 % 14.92/2.72 (l40_tops_1) % 14.92/2.72 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 14.92/2.72 $i] : (subset_complement(v1, v3) = v4 & the_carrier(v0) = v1 & powerset(v1) % 14.92/2.72 = v2 & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & element(v5, v1) % 14.92/2.72 & element(v3, v2) & one_sorted_str(v0) & ~ empty_carrier(v0) & ((in(v5, v4) % 14.92/2.72 & in(v5, v3)) | ( ~ in(v5, v4) & ~ in(v5, v3)))) % 14.92/2.72 % 14.92/2.72 (rc5_struct_0) % 14.92/2.73 ! [v0: $i] : ! [v1: $i] : ( ~ (the_carrier(v0) = v1) | ~ $i(v0) | ~ % 14.92/2.73 one_sorted_str(v0) | empty_carrier(v0) | ? [v2: $i] : ? [v3: $i] : % 14.92/2.73 (powerset(v1) = v2 & $i(v3) & $i(v2) & element(v3, v2) & ~ empty(v3))) % 14.92/2.73 % 14.92/2.73 (t50_subset_1) % 14.92/2.73 $i(empty_set) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! % 14.92/2.73 [v4: $i] : (v0 = empty_set | ~ (subset_complement(v0, v2) = v3) | ~ % 14.92/2.73 (powerset(v0) = v1) | ~ $i(v4) | ~ $i(v2) | ~ $i(v0) | ~ element(v4, v0) % 14.92/2.73 | ~ element(v2, v1) | in(v4, v3) | in(v4, v2)) % 14.92/2.73 % 14.92/2.73 (t54_subset_1) % 14.92/2.73 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ % 14.92/2.73 (subset_complement(v0, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 14.92/2.73 in(v1, v3) | ~ in(v1, v2) | ? [v4: $i] : (powerset(v0) = v4 & $i(v4) & ~ % 14.92/2.73 element(v2, v4))) % 14.92/2.73 % 14.92/2.73 (function-axioms) % 14.92/2.73 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 14.92/2.73 (subset_complement(v3, v2) = v1) | ~ (subset_complement(v3, v2) = v0)) & ! % 14.92/2.73 [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (the_carrier(v2) = v1) | % 14.92/2.73 ~ (the_carrier(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = % 14.92/2.73 v0 | ~ (powerset(v2) = v1) | ~ (powerset(v2) = v0)) % 14.92/2.73 % 14.92/2.73 Further assumptions not needed in the proof: % 14.92/2.73 -------------------------------------------- % 14.92/2.73 antisymmetry_r2_hidden, cc10_membered, cc11_membered, cc12_membered, % 14.92/2.73 cc13_membered, cc14_membered, cc15_membered, cc16_membered, cc17_membered, % 14.92/2.73 cc18_membered, cc19_membered, cc1_membered, cc20_membered, cc2_membered, % 14.92/2.73 cc3_membered, cc4_membered, dt_k1_xboole_0, dt_k1_zfmisc_1, dt_l1_struct_0, % 14.92/2.73 dt_m1_subset_1, dt_u1_struct_0, existence_l1_struct_0, existence_m1_subset_1, % 14.92/2.73 involutiveness_k3_subset_1, rc1_membered, rc3_struct_0, reflexivity_r1_tarski, % 14.92/2.73 t1_subset, t2_subset, t3_subset, t4_subset, t5_subset, t6_boole, t7_boole, % 14.92/2.73 t8_boole % 14.92/2.73 % 14.92/2.73 Those formulas are unsatisfiable: % 14.92/2.73 --------------------------------- % 14.92/2.73 % 14.92/2.73 Begin of proof % 14.92/2.73 | % 14.92/2.73 | ALPHA: (fc6_membered) implies: % 14.92/2.74 | (1) empty(empty_set) % 14.92/2.74 | % 14.92/2.74 | ALPHA: (t50_subset_1) implies: % 14.92/2.74 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 14.92/2.74 | (v0 = empty_set | ~ (subset_complement(v0, v2) = v3) | ~ % 14.92/2.74 | (powerset(v0) = v1) | ~ $i(v4) | ~ $i(v2) | ~ $i(v0) | ~ % 14.92/2.74 | element(v4, v0) | ~ element(v2, v1) | in(v4, v3) | in(v4, v2)) % 14.92/2.74 | % 14.92/2.74 | ALPHA: (function-axioms) implies: % 14.92/2.74 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (powerset(v2) = % 14.92/2.74 | v1) | ~ (powerset(v2) = v0)) % 14.92/2.74 | % 14.92/2.74 | DELTA: instantiating (l40_tops_1) with fresh symbols all_42_0, all_42_1, % 14.92/2.74 | all_42_2, all_42_3, all_42_4, all_42_5 gives: % 14.92/2.74 | (4) subset_complement(all_42_4, all_42_2) = all_42_1 & % 14.92/2.74 | the_carrier(all_42_5) = all_42_4 & powerset(all_42_4) = all_42_3 & % 14.92/2.74 | $i(all_42_0) & $i(all_42_1) & $i(all_42_2) & $i(all_42_3) & % 14.92/2.74 | $i(all_42_4) & $i(all_42_5) & element(all_42_0, all_42_4) & % 14.92/2.74 | element(all_42_2, all_42_3) & one_sorted_str(all_42_5) & ~ % 14.92/2.74 | empty_carrier(all_42_5) & ((in(all_42_0, all_42_1) & in(all_42_0, % 14.92/2.74 | all_42_2)) | ( ~ in(all_42_0, all_42_1) & ~ in(all_42_0, % 14.92/2.74 | all_42_2))) % 14.92/2.74 | % 14.92/2.74 | ALPHA: (4) implies: % 14.92/2.74 | (5) ~ empty_carrier(all_42_5) % 14.92/2.74 | (6) one_sorted_str(all_42_5) % 14.92/2.74 | (7) element(all_42_2, all_42_3) % 14.92/2.74 | (8) element(all_42_0, all_42_4) % 14.92/2.74 | (9) $i(all_42_5) % 14.92/2.74 | (10) $i(all_42_4) % 14.92/2.74 | (11) $i(all_42_2) % 14.92/2.74 | (12) $i(all_42_0) % 14.92/2.74 | (13) powerset(all_42_4) = all_42_3 % 14.92/2.74 | (14) the_carrier(all_42_5) = all_42_4 % 14.92/2.74 | (15) subset_complement(all_42_4, all_42_2) = all_42_1 % 14.92/2.74 | (16) (in(all_42_0, all_42_1) & in(all_42_0, all_42_2)) | ( ~ in(all_42_0, % 14.92/2.74 | all_42_1) & ~ in(all_42_0, all_42_2)) % 14.92/2.74 | % 14.92/2.74 | GROUND_INST: instantiating (rc5_struct_0) with all_42_5, all_42_4, simplifying % 14.92/2.74 | with (5), (6), (9), (14) gives: % 14.92/2.74 | (17) ? [v0: $i] : ? [v1: $i] : (powerset(all_42_4) = v0 & $i(v1) & $i(v0) % 14.92/2.74 | & element(v1, v0) & ~ empty(v1)) % 14.92/2.74 | % 14.92/2.75 | GROUND_INST: instantiating (2) with all_42_4, all_42_3, all_42_2, all_42_1, % 14.92/2.75 | all_42_0, simplifying with (7), (8), (10), (11), (12), (13), (15) % 14.92/2.75 | gives: % 14.92/2.75 | (18) all_42_4 = empty_set | in(all_42_0, all_42_1) | in(all_42_0, all_42_2) % 14.92/2.75 | % 14.92/2.75 | GROUND_INST: instantiating (dt_k3_subset_1) with all_42_4, all_42_2, all_42_1, % 14.92/2.75 | simplifying with (10), (11), (15) gives: % 14.92/2.75 | (19) ? [v0: $i] : (powerset(all_42_4) = v0 & $i(v0) & ( ~ % 14.92/2.75 | element(all_42_2, v0) | element(all_42_1, v0))) % 14.92/2.75 | % 14.92/2.75 | DELTA: instantiating (19) with fresh symbol all_50_0 gives: % 14.92/2.75 | (20) powerset(all_42_4) = all_50_0 & $i(all_50_0) & ( ~ element(all_42_2, % 14.92/2.75 | all_50_0) | element(all_42_1, all_50_0)) % 14.92/2.75 | % 14.92/2.75 | ALPHA: (20) implies: % 14.92/2.75 | (21) powerset(all_42_4) = all_50_0 % 14.92/2.75 | % 14.92/2.75 | DELTA: instantiating (17) with fresh symbols all_52_0, all_52_1 gives: % 14.92/2.75 | (22) powerset(all_42_4) = all_52_1 & $i(all_52_0) & $i(all_52_1) & % 14.92/2.75 | element(all_52_0, all_52_1) & ~ empty(all_52_0) % 14.92/2.75 | % 14.92/2.75 | ALPHA: (22) implies: % 14.92/2.75 | (23) powerset(all_42_4) = all_52_1 % 14.92/2.75 | % 14.92/2.75 | GROUND_INST: instantiating (3) with all_42_3, all_52_1, all_42_4, simplifying % 14.92/2.75 | with (13), (23) gives: % 14.92/2.75 | (24) all_52_1 = all_42_3 % 14.92/2.75 | % 14.92/2.75 | GROUND_INST: instantiating (3) with all_50_0, all_52_1, all_42_4, simplifying % 14.92/2.75 | with (21), (23) gives: % 14.92/2.75 | (25) all_52_1 = all_50_0 % 14.92/2.75 | % 14.92/2.75 | COMBINE_EQS: (24), (25) imply: % 14.92/2.75 | (26) all_50_0 = all_42_3 % 14.92/2.75 | % 14.92/2.75 | BETA: splitting (18) gives: % 14.92/2.75 | % 14.92/2.75 | Case 1: % 14.92/2.75 | | % 14.92/2.75 | | (27) in(all_42_0, all_42_1) % 14.92/2.75 | | % 14.92/2.75 | | BETA: splitting (16) gives: % 14.92/2.75 | | % 14.92/2.75 | | Case 1: % 14.92/2.75 | | | % 14.92/2.75 | | | (28) in(all_42_0, all_42_1) & in(all_42_0, all_42_2) % 14.92/2.75 | | | % 14.92/2.75 | | | ALPHA: (28) implies: % 14.92/2.75 | | | (29) in(all_42_0, all_42_2) % 14.92/2.75 | | | % 14.92/2.75 | | | GROUND_INST: instantiating (t54_subset_1) with all_42_4, all_42_0, % 14.92/2.75 | | | all_42_2, all_42_1, simplifying with (10), (11), (12), (15), % 14.92/2.75 | | | (27), (29) gives: % 14.92/2.75 | | | (30) ? [v0: $i] : (powerset(all_42_4) = v0 & $i(v0) & ~ % 14.92/2.75 | | | element(all_42_2, v0)) % 14.92/2.75 | | | % 14.92/2.75 | | | DELTA: instantiating (30) with fresh symbol all_113_0 gives: % 14.92/2.75 | | | (31) powerset(all_42_4) = all_113_0 & $i(all_113_0) & ~ % 14.92/2.75 | | | element(all_42_2, all_113_0) % 14.92/2.75 | | | % 14.92/2.75 | | | ALPHA: (31) implies: % 14.92/2.75 | | | (32) ~ element(all_42_2, all_113_0) % 14.92/2.75 | | | (33) powerset(all_42_4) = all_113_0 % 14.92/2.75 | | | % 14.92/2.75 | | | GROUND_INST: instantiating (3) with all_42_3, all_113_0, all_42_4, % 14.92/2.75 | | | simplifying with (13), (33) gives: % 14.92/2.75 | | | (34) all_113_0 = all_42_3 % 14.92/2.75 | | | % 14.92/2.75 | | | REDUCE: (32), (34) imply: % 14.92/2.75 | | | (35) ~ element(all_42_2, all_42_3) % 14.92/2.75 | | | % 14.92/2.75 | | | PRED_UNIFY: (7), (35) imply: % 14.92/2.75 | | | (36) $false % 14.92/2.75 | | | % 14.92/2.75 | | | CLOSE: (36) is inconsistent. % 14.92/2.75 | | | % 14.92/2.75 | | Case 2: % 14.92/2.75 | | | % 14.92/2.75 | | | (37) ~ in(all_42_0, all_42_1) & ~ in(all_42_0, all_42_2) % 14.92/2.75 | | | % 14.92/2.75 | | | ALPHA: (37) implies: % 14.92/2.76 | | | (38) ~ in(all_42_0, all_42_1) % 14.92/2.76 | | | % 14.92/2.76 | | | PRED_UNIFY: (27), (38) imply: % 14.92/2.76 | | | (39) $false % 14.92/2.76 | | | % 14.92/2.76 | | | CLOSE: (39) is inconsistent. % 14.92/2.76 | | | % 14.92/2.76 | | End of split % 14.92/2.76 | | % 14.92/2.76 | Case 2: % 14.92/2.76 | | % 14.92/2.76 | | (40) ~ in(all_42_0, all_42_1) % 14.92/2.76 | | (41) all_42_4 = empty_set | in(all_42_0, all_42_2) % 14.92/2.76 | | % 14.92/2.76 | | BETA: splitting (16) gives: % 14.92/2.76 | | % 14.92/2.76 | | Case 1: % 14.92/2.76 | | | % 14.92/2.76 | | | (42) in(all_42_0, all_42_1) & in(all_42_0, all_42_2) % 14.92/2.76 | | | % 14.92/2.76 | | | ALPHA: (42) implies: % 14.92/2.76 | | | (43) in(all_42_0, all_42_1) % 14.92/2.76 | | | % 14.92/2.76 | | | PRED_UNIFY: (40), (43) imply: % 14.92/2.76 | | | (44) $false % 14.92/2.76 | | | % 14.92/2.76 | | | CLOSE: (44) is inconsistent. % 14.92/2.76 | | | % 14.92/2.76 | | Case 2: % 14.92/2.76 | | | % 14.92/2.76 | | | (45) ~ in(all_42_0, all_42_1) & ~ in(all_42_0, all_42_2) % 14.92/2.76 | | | % 14.92/2.76 | | | ALPHA: (45) implies: % 14.92/2.76 | | | (46) ~ in(all_42_0, all_42_2) % 14.92/2.76 | | | % 14.92/2.76 | | | BETA: splitting (41) gives: % 14.92/2.76 | | | % 14.92/2.76 | | | Case 1: % 14.92/2.76 | | | | % 14.92/2.76 | | | | (47) in(all_42_0, all_42_2) % 14.92/2.76 | | | | % 14.92/2.76 | | | | PRED_UNIFY: (46), (47) imply: % 14.92/2.76 | | | | (48) $false % 14.92/2.76 | | | | % 14.92/2.76 | | | | CLOSE: (48) is inconsistent. % 14.92/2.76 | | | | % 14.92/2.76 | | | Case 2: % 14.92/2.76 | | | | % 14.92/2.76 | | | | (49) all_42_4 = empty_set % 14.92/2.76 | | | | % 14.92/2.76 | | | | REDUCE: (14), (49) imply: % 14.92/2.76 | | | | (50) the_carrier(all_42_5) = empty_set % 14.92/2.76 | | | | % 14.92/2.76 | | | | GROUND_INST: instantiating (fc1_struct_0) with all_42_5, empty_set, % 14.92/2.76 | | | | simplifying with (1), (5), (6), (9), (50) gives: % 14.92/2.76 | | | | (51) $false % 14.92/2.76 | | | | % 14.92/2.76 | | | | CLOSE: (51) is inconsistent. % 14.92/2.76 | | | | % 14.92/2.76 | | | End of split % 14.92/2.76 | | | % 14.92/2.76 | | End of split % 14.92/2.76 | | % 14.92/2.76 | End of split % 14.92/2.76 | % 14.92/2.76 End of proof % 14.92/2.76 % SZS output end Proof for theBenchmark % 14.92/2.76 % 14.92/2.76 2253ms %------------------------------------------------------------------------------