%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SEU171+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 : n024.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:01 EDT 2023 % Result : Theorem 7.90s 1.75s % Output : Proof 10.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU171+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.12/0.34 % Computer : n024.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Wed Aug 23 23:13:39 EDT 2023 % 0.12/0.34 % CPUTime : % 0.19/0.60 ________ _____ % 0.19/0.60 ___ __ \_________(_)________________________________ % 0.19/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.60 % 0.19/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.60 (2023-06-19) % 0.19/0.60 % 0.19/0.60 (c) Philipp Rümmer, 2009-2023 % 0.19/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.60 Amanda Stjerna. % 0.19/0.60 Free software under BSD-3-Clause. % 0.19/0.60 % 0.19/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.60 % 0.19/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.19/0.62 Running up to 7 provers in parallel. % 0.19/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.31/0.99 Prover 4: Preprocessing ... % 2.31/0.99 Prover 1: Preprocessing ... % 2.31/1.03 Prover 5: Preprocessing ... % 2.31/1.03 Prover 3: Preprocessing ... % 2.31/1.03 Prover 2: Preprocessing ... % 2.31/1.03 Prover 0: Preprocessing ... % 2.31/1.03 Prover 6: Preprocessing ... % 4.74/1.34 Prover 1: Warning: ignoring some quantifiers % 4.74/1.36 Prover 3: Warning: ignoring some quantifiers % 4.74/1.38 Prover 1: Constructing countermodel ... % 4.74/1.38 Prover 3: Constructing countermodel ... % 4.74/1.38 Prover 5: Proving ... % 4.74/1.38 Prover 4: Warning: ignoring some quantifiers % 4.74/1.38 Prover 6: Proving ... % 4.74/1.38 Prover 2: Proving ... % 4.74/1.40 Prover 4: Constructing countermodel ... % 5.64/1.46 Prover 0: Proving ... % 7.90/1.75 Prover 2: proved (1122ms) % 7.90/1.75 % 7.90/1.75 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.90/1.75 % 7.90/1.75 Prover 3: stopped % 7.90/1.75 Prover 0: stopped % 7.90/1.75 Prover 5: stopped % 7.90/1.77 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.90/1.77 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 7.90/1.77 Prover 6: stopped % 7.90/1.77 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 7.90/1.77 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 7.90/1.77 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 7.90/1.78 Prover 7: Preprocessing ... % 7.90/1.78 Prover 8: Preprocessing ... % 7.90/1.79 Prover 10: Preprocessing ... % 7.90/1.80 Prover 13: Preprocessing ... % 7.90/1.80 Prover 11: Preprocessing ... % 8.61/1.86 Prover 10: Warning: ignoring some quantifiers % 8.61/1.86 Prover 10: Constructing countermodel ... % 8.61/1.86 Prover 13: Warning: ignoring some quantifiers % 8.61/1.87 Prover 13: Constructing countermodel ... % 8.61/1.87 Prover 7: Warning: ignoring some quantifiers % 8.61/1.88 Prover 7: Constructing countermodel ... % 8.61/1.89 Prover 8: Warning: ignoring some quantifiers % 9.09/1.90 Prover 8: Constructing countermodel ... % 9.09/1.97 Prover 11: Warning: ignoring some quantifiers % 9.09/1.98 Prover 11: Constructing countermodel ... % 10.16/2.05 Prover 13: Found proof (size 37) % 10.16/2.05 Prover 10: Found proof (size 31) % 10.16/2.05 Prover 10: proved (294ms) % 10.16/2.06 Prover 1: stopped % 10.16/2.06 Prover 11: stopped % 10.16/2.06 Prover 8: stopped % 10.16/2.06 Prover 4: stopped % 10.16/2.06 Prover 13: proved (286ms) % 10.16/2.06 Prover 7: stopped % 10.16/2.06 % 10.16/2.06 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.16/2.06 % 10.16/2.06 % SZS output start Proof for theBenchmark % 10.16/2.06 Assumptions after simplification: % 10.16/2.06 --------------------------------- % 10.16/2.06 % 10.16/2.06 (d2_subset_1) % 10.16/2.07 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ element(v1, v0) | ~ % 10.16/2.07 empty(v0) | empty(v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) % 10.16/2.07 | ~ element(v1, v0) | empty(v0) | in(v1, v0)) & ! [v0: $i] : ! [v1: $i] : % 10.16/2.07 ( ~ $i(v1) | ~ $i(v0) | ~ empty(v1) | ~ empty(v0) | element(v1, v0)) & ! % 10.16/2.07 [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ in(v1, v0) | element(v1, % 10.16/2.07 v0) | empty(v0)) % 10.16/2.07 % 10.16/2.07 (d4_xboole_0) % 10.40/2.10 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ % 10.40/2.10 (set_difference(v0, v1) = v2) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ % 10.40/2.10 $i(v0) | ~ in(v3, v2) | ~ in(v3, v1)) & ! [v0: $i] : ! [v1: $i] : ! % 10.40/2.10 [v2: $i] : ! [v3: $i] : ( ~ (set_difference(v0, v1) = v2) | ~ $i(v3) | ~ % 10.40/2.10 $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ in(v3, v2) | in(v3, v0)) & ! [v0: $i] : % 10.40/2.10 ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (set_difference(v0, v1) = v2) | % 10.40/2.10 ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ in(v3, v0) | in(v3, v2) | % 10.40/2.10 in(v3, v1)) & ? [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v3 = % 10.40/2.10 v0 | ~ (set_difference(v1, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 10.40/2.10 ? [v4: $i] : ($i(v4) & ( ~ in(v4, v1) | ~ in(v4, v0) | in(v4, v2)) & % 10.40/2.10 (in(v4, v0) | (in(v4, v1) & ~ in(v4, v2))))) % 10.40/2.10 % 10.40/2.10 (d5_subset_1) % 10.40/2.10 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (subset_complement(v0, v1) = v2) % 10.40/2.10 | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: $i] : ((v4 = v2 & % 10.40/2.10 set_difference(v0, v1) = v2 & $i(v2)) | (powerset(v0) = v3 & $i(v3) & ~ % 10.40/2.10 element(v1, v3)))) % 10.40/2.10 % 10.40/2.10 (dt_k3_subset_1) % 10.40/2.10 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (subset_complement(v0, v1) = v2) % 10.40/2.10 | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : (powerset(v0) = v3 & $i(v3) & ( ~ % 10.40/2.10 element(v1, v3) | element(v2, v3)))) % 10.40/2.10 % 10.40/2.10 (t50_subset_1) % 10.40/2.10 $i(empty_set) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? % 10.40/2.10 [v4: $i] : ( ~ (v0 = empty_set) & subset_complement(v0, v2) = v3 & % 10.40/2.10 powerset(v0) = v1 & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & element(v4, % 10.40/2.10 v0) & element(v2, v1) & ~ in(v4, v3) & ~ in(v4, v2)) % 10.40/2.10 % 10.40/2.10 (t6_boole) % 10.40/2.10 $i(empty_set) & ! [v0: $i] : (v0 = empty_set | ~ $i(v0) | ~ empty(v0)) % 10.40/2.10 % 10.40/2.10 (function-axioms) % 10.40/2.10 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 10.40/2.10 (subset_complement(v3, v2) = v1) | ~ (subset_complement(v3, v2) = v0)) & ! % 10.40/2.10 [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 10.40/2.10 (set_difference(v3, v2) = v1) | ~ (set_difference(v3, v2) = v0)) & ! [v0: % 10.40/2.10 $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (powerset(v2) = v1) | ~ % 10.40/2.10 (powerset(v2) = v0)) % 10.40/2.10 % 10.40/2.10 Further assumptions not needed in the proof: % 10.40/2.10 -------------------------------------------- % 10.40/2.10 antisymmetry_r2_hidden, dt_k1_xboole_0, dt_k1_zfmisc_1, dt_k4_xboole_0, % 10.40/2.10 dt_m1_subset_1, existence_m1_subset_1, fc1_subset_1, fc1_xboole_0, % 10.40/2.10 involutiveness_k3_subset_1, rc1_subset_1, rc1_xboole_0, rc2_subset_1, % 10.40/2.10 rc2_xboole_0, t3_boole, t4_boole, t7_boole, t8_boole % 10.40/2.10 % 10.40/2.10 Those formulas are unsatisfiable: % 10.40/2.10 --------------------------------- % 10.40/2.10 % 10.40/2.10 Begin of proof % 10.40/2.11 | % 10.40/2.11 | ALPHA: (d2_subset_1) implies: % 10.40/2.11 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ element(v1, v0) % 10.40/2.11 | | empty(v0) | in(v1, v0)) % 10.40/2.11 | % 10.40/2.11 | ALPHA: (d4_xboole_0) implies: % 10.40/2.11 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ % 10.40/2.11 | (set_difference(v0, v1) = v2) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | % 10.40/2.11 | ~ $i(v0) | ~ in(v3, v0) | in(v3, v2) | in(v3, v1)) % 10.40/2.11 | % 10.40/2.11 | ALPHA: (t6_boole) implies: % 10.40/2.11 | (3) ! [v0: $i] : (v0 = empty_set | ~ $i(v0) | ~ empty(v0)) % 10.40/2.11 | % 10.40/2.11 | ALPHA: (t50_subset_1) implies: % 10.40/2.11 | (4) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ( % 10.40/2.11 | ~ (v0 = empty_set) & subset_complement(v0, v2) = v3 & powerset(v0) = % 10.40/2.11 | v1 & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & element(v4, v0) & % 10.40/2.11 | element(v2, v1) & ~ in(v4, v3) & ~ in(v4, v2)) % 10.40/2.11 | % 10.40/2.11 | ALPHA: (function-axioms) implies: % 10.40/2.11 | (5) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (powerset(v2) = % 10.40/2.11 | v1) | ~ (powerset(v2) = v0)) % 10.40/2.11 | % 10.40/2.11 | DELTA: instantiating (4) with fresh symbols all_25_0, all_25_1, all_25_2, % 10.40/2.11 | all_25_3, all_25_4 gives: % 10.40/2.11 | (6) ~ (all_25_4 = empty_set) & subset_complement(all_25_4, all_25_2) = % 10.40/2.11 | all_25_1 & powerset(all_25_4) = all_25_3 & $i(all_25_0) & $i(all_25_1) % 10.40/2.11 | & $i(all_25_2) & $i(all_25_3) & $i(all_25_4) & element(all_25_0, % 10.40/2.11 | all_25_4) & element(all_25_2, all_25_3) & ~ in(all_25_0, all_25_1) & % 10.40/2.11 | ~ in(all_25_0, all_25_2) % 10.40/2.11 | % 10.40/2.11 | ALPHA: (6) implies: % 10.40/2.11 | (7) ~ (all_25_4 = empty_set) % 10.40/2.11 | (8) ~ in(all_25_0, all_25_2) % 10.40/2.11 | (9) ~ in(all_25_0, all_25_1) % 10.40/2.11 | (10) element(all_25_2, all_25_3) % 10.40/2.11 | (11) element(all_25_0, all_25_4) % 10.40/2.11 | (12) $i(all_25_4) % 10.40/2.11 | (13) $i(all_25_2) % 10.40/2.11 | (14) $i(all_25_0) % 10.40/2.11 | (15) powerset(all_25_4) = all_25_3 % 10.40/2.11 | (16) subset_complement(all_25_4, all_25_2) = all_25_1 % 10.40/2.11 | % 10.40/2.12 | GROUND_INST: instantiating (1) with all_25_4, all_25_0, simplifying with (11), % 10.40/2.12 | (12), (14) gives: % 10.40/2.12 | (17) empty(all_25_4) | in(all_25_0, all_25_4) % 10.40/2.12 | % 10.40/2.12 | GROUND_INST: instantiating (d5_subset_1) with all_25_4, all_25_2, all_25_1, % 10.40/2.12 | simplifying with (12), (13), (16) gives: % 10.40/2.12 | (18) ? [v0: $i] : ? [v1: int] : ((v1 = all_25_1 & % 10.40/2.12 | set_difference(all_25_4, all_25_2) = all_25_1 & $i(all_25_1)) | % 10.40/2.12 | (powerset(all_25_4) = v0 & $i(v0) & ~ element(all_25_2, v0))) % 10.40/2.12 | % 10.40/2.12 | GROUND_INST: instantiating (dt_k3_subset_1) with all_25_4, all_25_2, all_25_1, % 10.40/2.12 | simplifying with (12), (13), (16) gives: % 10.40/2.12 | (19) ? [v0: $i] : (powerset(all_25_4) = v0 & $i(v0) & ( ~ % 10.40/2.12 | element(all_25_2, v0) | element(all_25_1, v0))) % 10.40/2.12 | % 10.40/2.12 | DELTA: instantiating (19) with fresh symbol all_35_0 gives: % 10.40/2.12 | (20) powerset(all_25_4) = all_35_0 & $i(all_35_0) & ( ~ element(all_25_2, % 10.40/2.12 | all_35_0) | element(all_25_1, all_35_0)) % 10.40/2.12 | % 10.40/2.12 | ALPHA: (20) implies: % 10.40/2.12 | (21) powerset(all_25_4) = all_35_0 % 10.40/2.12 | % 10.40/2.12 | DELTA: instantiating (18) with fresh symbols all_37_0, all_37_1 gives: % 10.40/2.12 | (22) (all_37_0 = all_25_1 & set_difference(all_25_4, all_25_2) = all_25_1 & % 10.40/2.12 | $i(all_25_1)) | (powerset(all_25_4) = all_37_1 & $i(all_37_1) & ~ % 10.40/2.12 | element(all_25_2, all_37_1)) % 10.40/2.12 | % 10.40/2.12 | GROUND_INST: instantiating (5) with all_25_3, all_35_0, all_25_4, simplifying % 10.40/2.12 | with (15), (21) gives: % 10.40/2.12 | (23) all_35_0 = all_25_3 % 10.40/2.12 | % 10.40/2.12 | BETA: splitting (22) gives: % 10.40/2.12 | % 10.40/2.12 | Case 1: % 10.40/2.12 | | % 10.40/2.12 | | (24) all_37_0 = all_25_1 & set_difference(all_25_4, all_25_2) = all_25_1 % 10.40/2.12 | | & $i(all_25_1) % 10.40/2.12 | | % 10.40/2.12 | | ALPHA: (24) implies: % 10.40/2.12 | | (25) $i(all_25_1) % 10.40/2.12 | | (26) set_difference(all_25_4, all_25_2) = all_25_1 % 10.40/2.12 | | % 10.40/2.12 | | BETA: splitting (17) gives: % 10.40/2.12 | | % 10.40/2.12 | | Case 1: % 10.40/2.12 | | | % 10.40/2.12 | | | (27) empty(all_25_4) % 10.40/2.12 | | | % 10.40/2.12 | | | GROUND_INST: instantiating (3) with all_25_4, simplifying with (12), (27) % 10.40/2.12 | | | gives: % 10.40/2.12 | | | (28) all_25_4 = empty_set % 10.40/2.12 | | | % 10.40/2.12 | | | REDUCE: (7), (28) imply: % 10.40/2.12 | | | (29) $false % 10.40/2.12 | | | % 10.40/2.12 | | | CLOSE: (29) is inconsistent. % 10.40/2.12 | | | % 10.40/2.12 | | Case 2: % 10.40/2.12 | | | % 10.40/2.12 | | | (30) in(all_25_0, all_25_4) % 10.40/2.12 | | | % 10.40/2.12 | | | GROUND_INST: instantiating (2) with all_25_4, all_25_2, all_25_1, % 10.40/2.12 | | | all_25_0, simplifying with (8), (9), (12), (13), (14), (25), % 10.40/2.12 | | | (26), (30) gives: % 10.40/2.12 | | | (31) $false % 10.40/2.12 | | | % 10.40/2.12 | | | CLOSE: (31) is inconsistent. % 10.40/2.12 | | | % 10.40/2.12 | | End of split % 10.40/2.12 | | % 10.40/2.12 | Case 2: % 10.40/2.12 | | % 10.40/2.12 | | (32) powerset(all_25_4) = all_37_1 & $i(all_37_1) & ~ element(all_25_2, % 10.40/2.12 | | all_37_1) % 10.40/2.12 | | % 10.40/2.12 | | ALPHA: (32) implies: % 10.40/2.12 | | (33) ~ element(all_25_2, all_37_1) % 10.40/2.12 | | (34) powerset(all_25_4) = all_37_1 % 10.40/2.12 | | % 10.40/2.13 | | GROUND_INST: instantiating (5) with all_25_3, all_37_1, all_25_4, % 10.40/2.13 | | simplifying with (15), (34) gives: % 10.40/2.13 | | (35) all_37_1 = all_25_3 % 10.40/2.13 | | % 10.40/2.13 | | REDUCE: (33), (35) imply: % 10.40/2.13 | | (36) ~ element(all_25_2, all_25_3) % 10.40/2.13 | | % 10.40/2.13 | | PRED_UNIFY: (10), (36) imply: % 10.40/2.13 | | (37) $false % 10.40/2.13 | | % 10.40/2.13 | | CLOSE: (37) is inconsistent. % 10.40/2.13 | | % 10.40/2.13 | End of split % 10.40/2.13 | % 10.40/2.13 End of proof % 10.40/2.13 % SZS output end Proof for theBenchmark % 10.40/2.13 % 10.40/2.13 1521ms %------------------------------------------------------------------------------