%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SEU112+1 : TPTP v8.1.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n018.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 : 600s % DateTime : Tue Jul 19 08:46:39 EDT 2022 % Result : Theorem 2.89s 1.34s % Output : Proof 4.15s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SEU112+1 : TPTP v8.1.0. Released v3.2.0. % 0.07/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n018.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 : 600 % 0.13/0.34 % DateTime : Mon Jun 20 11:30:35 EDT 2022 % 0.13/0.34 % CPUTime : % 0.59/0.60 ____ _ % 0.59/0.60 ___ / __ \_____(_)___ ________ __________ % 0.59/0.60 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.59/0.60 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.59/0.60 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.59/0.60 % 0.59/0.60 A Theorem Prover for First-Order Logic % 0.59/0.60 (ePrincess v.1.0) % 0.59/0.60 % 0.59/0.60 (c) Philipp Rümmer, 2009-2015 % 0.59/0.60 (c) Peter Backeman, 2014-2015 % 0.59/0.60 (contributions by Angelo Brillout, Peter Baumgartner) % 0.59/0.60 Free software under GNU Lesser General Public License (LGPL). % 0.59/0.60 Bug reports to peter@backeman.se % 0.59/0.60 % 0.59/0.60 For more information, visit http://user.uu.se/~petba168/breu/ % 0.59/0.60 % 0.59/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.73/0.65 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.70/0.95 Prover 0: Preprocessing ... % 2.14/1.16 Prover 0: Warning: ignoring some quantifiers % 2.39/1.19 Prover 0: Constructing countermodel ... % 2.89/1.34 Prover 0: proved (697ms) % 2.89/1.34 % 2.89/1.34 No countermodel exists, formula is valid % 2.89/1.34 % SZS status Theorem for theBenchmark % 2.89/1.34 % 2.89/1.34 Generating proof ... Warning: ignoring some quantifiers % 3.88/1.57 found it (size 9) % 3.88/1.57 % 3.88/1.57 % SZS output start Proof for theBenchmark % 3.88/1.57 Assumed formulas after preprocessing and simplification: % 3.88/1.57 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : ? [v5] : ? [v6] : ? [v7] : ? [v8] : ? [v9] : ? [v10] : (set_union2(v2, v3) = v4 & set_union2(v0, v1) = v5 & finite_subsets(v5) = v6 & finite_subsets(v1) = v3 & finite_subsets(v0) = v2 & cap_closed(v9) & diff_closed(v9) & cup_closed(v9) & preboolean(v9) & finite(v10) & empty(v8) & empty(empty_set) & ~ subset(v4, v6) & ~ empty(v10) & ~ empty(v9) & ~ empty(v7) & ! [v11] : ! [v12] : ! [v13] : ! [v14] : (v12 = v11 | ~ (set_union2(v14, v13) = v12) | ~ (set_union2(v14, v13) = v11)) & ! [v11] : ! [v12] : ! [v13] : ! [v14] : ( ~ (set_union2(v11, v13) = v14) | ~ subset(v13, v12) | ~ subset(v11, v12) | subset(v14, v12)) & ! [v11] : ! [v12] : ! [v13] : ! [v14] : ( ~ (finite_subsets(v12) = v14) | ~ (finite_subsets(v11) = v13) | ~ subset(v11, v12) | subset(v13, v14)) & ! [v11] : ! [v12] : ! [v13] : ! [v14] : ( ~ (powerset(v13) = v14) | ~ element(v12, v14) | ~ empty(v13) | ~ in(v11, v12)) & ! [v11] : ! [v12] : ! [v13] : ! [v14] : ( ~ (powerset(v13) = v14) | ~ element(v12, v14) | ~ in(v11, v12) | element(v11, v13)) & ! [v11] : ! [v12] : ! [v13] : (v12 = v11 | ~ (finite_subsets(v13) = v12) | ~ (finite_subsets(v13) = v11)) & ! [v11] : ! [v12] : ! [v13] : (v12 = v11 | ~ (powerset(v13) = v12) | ~ (powerset(v13) = v11)) & ! [v11] : ! [v12] : ! [v13] : ( ~ (set_union2(v12, v11) = v13) | ~ empty(v13) | empty(v11)) & ! [v11] : ! [v12] : ! [v13] : ( ~ (set_union2(v12, v11) = v13) | set_union2(v11, v12) = v13) & ! [v11] : ! [v12] : ! [v13] : ( ~ (set_union2(v11, v12) = v13) | ~ finite(v12) | ~ finite(v11) | finite(v13)) & ! [v11] : ! [v12] : ! [v13] : ( ~ (set_union2(v11, v12) = v13) | ~ empty(v13) | empty(v11)) & ! [v11] : ! [v12] : ! [v13] : ( ~ (set_union2(v11, v12) = v13) | set_union2(v12, v11) = v13) & ! [v11] : ! [v12] : ! [v13] : ( ~ (set_union2(v11, v12) = v13) | subset(v11, v13)) & ! [v11] : ! [v12] : ! [v13] : ( ~ (finite_subsets(v11) = v13) | ~ element(v12, v13) | finite(v12)) & ! [v11] : ! [v12] : ! [v13] : ( ~ (powerset(v12) = v13) | ~ subset(v11, v12) | element(v11, v13)) & ! [v11] : ! [v12] : ! [v13] : ( ~ (powerset(v12) = v13) | ~ element(v11, v13) | subset(v11, v12)) & ! [v11] : ! [v12] : ! [v13] : ( ~ (powerset(v11) = v12) | ~ element(v13, v12) | ~ finite(v11) | finite(v13)) & ! [v11] : ! [v12] : (v12 = v11 | ~ (set_union2(v11, v11) = v12)) & ! [v11] : ! [v12] : (v12 = v11 | ~ (set_union2(v11, empty_set) = v12)) & ! [v11] : ! [v12] : (v12 = v11 | ~ empty(v12) | ~ empty(v11)) & ! [v11] : ! [v12] : ( ~ (finite_subsets(v11) = v12) | ~ empty(v12)) & ! [v11] : ! [v12] : ( ~ (finite_subsets(v11) = v12) | diff_closed(v12)) & ! [v11] : ! [v12] : ( ~ (finite_subsets(v11) = v12) | cup_closed(v12)) & ! [v11] : ! [v12] : ( ~ (finite_subsets(v11) = v12) | preboolean(v12)) & ! [v11] : ! [v12] : ( ~ (powerset(v11) = v12) | ~ empty(v12)) & ! [v11] : ! [v12] : ( ~ (powerset(v11) = v12) | diff_closed(v12)) & ! [v11] : ! [v12] : ( ~ (powerset(v11) = v12) | cup_closed(v12)) & ! [v11] : ! [v12] : ( ~ (powerset(v11) = v12) | preboolean(v12)) & ! [v11] : ! [v12] : ( ~ (powerset(v11) = v12) | empty(v11) | ? [v13] : (element(v13, v12) & finite(v13) & ~ empty(v13))) & ! [v11] : ! [v12] : ( ~ (powerset(v11) = v12) | empty(v11) | ? [v13] : (element(v13, v12) & ~ empty(v13))) & ! [v11] : ! [v12] : ( ~ (powerset(v11) = v12) | ? [v13] : (natural(v13) & ordinal(v13) & epsilon_connected(v13) & epsilon_transitive(v13) & one_to_one(v13) & function(v13) & relation(v13) & element(v13, v12) & finite(v13) & empty(v13))) & ! [v11] : ! [v12] : ( ~ (powerset(v11) = v12) | ? [v13] : (element(v13, v12) & empty(v13))) & ! [v11] : ! [v12] : ( ~ element(v11, v12) | empty(v12) | in(v11, v12)) & ! [v11] : ! [v12] : ( ~ empty(v12) | ~ in(v11, v12)) & ! [v11] : ! [v12] : ( ~ in(v12, v11) | ~ in(v11, v12)) & ! [v11] : ! [v12] : ( ~ in(v11, v12) | element(v11, v12)) & ! [v11] : (v11 = empty_set | ~ empty(v11)) & ! [v11] : ( ~ diff_closed(v11) | ~ cup_closed(v11) | preboolean(v11)) & ! [v11] : ( ~ preboolean(v11) | diff_closed(v11)) & ! [v11] : ( ~ preboolean(v11) | cup_closed(v11)) & ! [v11] : ( ~ empty(v11) | finite(v11)) & ? [v11] : ? [v12] : element(v12, v11) & ? [v11] : subset(v11, v11)) % 4.15/1.62 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3, all_0_4_4, all_0_5_5, all_0_6_6, all_0_7_7, all_0_8_8, all_0_9_9, all_0_10_10 yields: % 4.15/1.62 | (1) set_union2(all_0_8_8, all_0_7_7) = all_0_6_6 & set_union2(all_0_10_10, all_0_9_9) = all_0_5_5 & finite_subsets(all_0_5_5) = all_0_4_4 & finite_subsets(all_0_9_9) = all_0_7_7 & finite_subsets(all_0_10_10) = all_0_8_8 & cap_closed(all_0_1_1) & diff_closed(all_0_1_1) & cup_closed(all_0_1_1) & preboolean(all_0_1_1) & finite(all_0_0_0) & empty(all_0_2_2) & empty(empty_set) & ~ subset(all_0_6_6, all_0_4_4) & ~ empty(all_0_0_0) & ~ empty(all_0_1_1) & ~ empty(all_0_3_3) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (set_union2(v3, v2) = v1) | ~ (set_union2(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (set_union2(v0, v2) = v3) | ~ subset(v2, v1) | ~ subset(v0, v1) | subset(v3, v1)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (finite_subsets(v1) = v3) | ~ (finite_subsets(v0) = v2) | ~ subset(v0, v1) | subset(v2, v3)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (powerset(v2) = v3) | ~ element(v1, v3) | ~ empty(v2) | ~ in(v0, v1)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (powerset(v2) = v3) | ~ element(v1, v3) | ~ in(v0, v1) | element(v0, v2)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (finite_subsets(v2) = v1) | ~ (finite_subsets(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (powerset(v2) = v1) | ~ (powerset(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (set_union2(v1, v0) = v2) | ~ empty(v2) | empty(v0)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (set_union2(v1, v0) = v2) | set_union2(v0, v1) = v2) & ! [v0] : ! [v1] : ! [v2] : ( ~ (set_union2(v0, v1) = v2) | ~ finite(v1) | ~ finite(v0) | finite(v2)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (set_union2(v0, v1) = v2) | ~ empty(v2) | empty(v0)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (set_union2(v0, v1) = v2) | set_union2(v1, v0) = v2) & ! [v0] : ! [v1] : ! [v2] : ( ~ (set_union2(v0, v1) = v2) | subset(v0, v2)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (finite_subsets(v0) = v2) | ~ element(v1, v2) | finite(v1)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (powerset(v1) = v2) | ~ subset(v0, v1) | element(v0, v2)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (powerset(v1) = v2) | ~ element(v0, v2) | subset(v0, v1)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (powerset(v0) = v1) | ~ element(v2, v1) | ~ finite(v0) | finite(v2)) & ! [v0] : ! [v1] : (v1 = v0 | ~ (set_union2(v0, v0) = v1)) & ! [v0] : ! [v1] : (v1 = v0 | ~ (set_union2(v0, empty_set) = v1)) & ! [v0] : ! [v1] : (v1 = v0 | ~ empty(v1) | ~ empty(v0)) & ! [v0] : ! [v1] : ( ~ (finite_subsets(v0) = v1) | ~ empty(v1)) & ! [v0] : ! [v1] : ( ~ (finite_subsets(v0) = v1) | diff_closed(v1)) & ! [v0] : ! [v1] : ( ~ (finite_subsets(v0) = v1) | cup_closed(v1)) & ! [v0] : ! [v1] : ( ~ (finite_subsets(v0) = v1) | preboolean(v1)) & ! [v0] : ! [v1] : ( ~ (powerset(v0) = v1) | ~ empty(v1)) & ! [v0] : ! [v1] : ( ~ (powerset(v0) = v1) | diff_closed(v1)) & ! [v0] : ! [v1] : ( ~ (powerset(v0) = v1) | cup_closed(v1)) & ! [v0] : ! [v1] : ( ~ (powerset(v0) = v1) | preboolean(v1)) & ! [v0] : ! [v1] : ( ~ (powerset(v0) = v1) | empty(v0) | ? [v2] : (element(v2, v1) & finite(v2) & ~ empty(v2))) & ! [v0] : ! [v1] : ( ~ (powerset(v0) = v1) | empty(v0) | ? [v2] : (element(v2, v1) & ~ empty(v2))) & ! [v0] : ! [v1] : ( ~ (powerset(v0) = v1) | ? [v2] : (natural(v2) & ordinal(v2) & epsilon_connected(v2) & epsilon_transitive(v2) & one_to_one(v2) & function(v2) & relation(v2) & element(v2, v1) & finite(v2) & empty(v2))) & ! [v0] : ! [v1] : ( ~ (powerset(v0) = v1) | ? [v2] : (element(v2, v1) & empty(v2))) & ! [v0] : ! [v1] : ( ~ element(v0, v1) | empty(v1) | in(v0, v1)) & ! [v0] : ! [v1] : ( ~ empty(v1) | ~ in(v0, v1)) & ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1)) & ! [v0] : ! [v1] : ( ~ in(v0, v1) | element(v0, v1)) & ! [v0] : (v0 = empty_set | ~ empty(v0)) & ! [v0] : ( ~ diff_closed(v0) | ~ cup_closed(v0) | preboolean(v0)) & ! [v0] : ( ~ preboolean(v0) | diff_closed(v0)) & ! [v0] : ( ~ preboolean(v0) | cup_closed(v0)) & ! [v0] : ( ~ empty(v0) | finite(v0)) & ? [v0] : ? [v1] : element(v1, v0) & ? [v0] : subset(v0, v0) % 4.15/1.63 | % 4.15/1.63 | Applying alpha-rule on (1) yields: % 4.15/1.63 | (2) ~ empty(all_0_3_3) % 4.15/1.63 | (3) ! [v0] : ! [v1] : ! [v2] : ( ~ (powerset(v0) = v1) | ~ element(v2, v1) | ~ finite(v0) | finite(v2)) % 4.15/1.63 | (4) ! [v0] : ( ~ diff_closed(v0) | ~ cup_closed(v0) | preboolean(v0)) % 4.15/1.63 | (5) ! [v0] : ! [v1] : ( ~ (finite_subsets(v0) = v1) | diff_closed(v1)) % 4.15/1.63 | (6) ! [v0] : ! [v1] : ! [v2] : ( ~ (set_union2(v0, v1) = v2) | ~ empty(v2) | empty(v0)) % 4.15/1.63 | (7) cap_closed(all_0_1_1) % 4.15/1.63 | (8) ! [v0] : ! [v1] : ( ~ (powerset(v0) = v1) | ? [v2] : (natural(v2) & ordinal(v2) & epsilon_connected(v2) & epsilon_transitive(v2) & one_to_one(v2) & function(v2) & relation(v2) & element(v2, v1) & finite(v2) & empty(v2))) % 4.15/1.63 | (9) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (set_union2(v0, v2) = v3) | ~ subset(v2, v1) | ~ subset(v0, v1) | subset(v3, v1)) % 4.15/1.63 | (10) ! [v0] : ( ~ preboolean(v0) | cup_closed(v0)) % 4.15/1.63 | (11) ! [v0] : ! [v1] : (v1 = v0 | ~ empty(v1) | ~ empty(v0)) % 4.15/1.63 | (12) ! [v0] : ! [v1] : ! [v2] : ( ~ (powerset(v1) = v2) | ~ element(v0, v2) | subset(v0, v1)) % 4.15/1.63 | (13) ! [v0] : ! [v1] : ! [v2] : ( ~ (powerset(v1) = v2) | ~ subset(v0, v1) | element(v0, v2)) % 4.15/1.63 | (14) finite_subsets(all_0_10_10) = all_0_8_8 % 4.15/1.63 | (15) ~ empty(all_0_1_1) % 4.15/1.63 | (16) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (powerset(v2) = v1) | ~ (powerset(v2) = v0)) % 4.15/1.63 | (17) ~ subset(all_0_6_6, all_0_4_4) % 4.15/1.63 | (18) ! [v0] : ! [v1] : ! [v2] : ( ~ (set_union2(v0, v1) = v2) | ~ finite(v1) | ~ finite(v0) | finite(v2)) % 4.15/1.63 | (19) set_union2(all_0_8_8, all_0_7_7) = all_0_6_6 % 4.15/1.63 | (20) ! [v0] : ! [v1] : (v1 = v0 | ~ (set_union2(v0, empty_set) = v1)) % 4.15/1.63 | (21) ! [v0] : ! [v1] : ( ~ (powerset(v0) = v1) | ~ empty(v1)) % 4.15/1.63 | (22) finite_subsets(all_0_5_5) = all_0_4_4 % 4.15/1.63 | (23) cup_closed(all_0_1_1) % 4.15/1.63 | (24) ! [v0] : ! [v1] : ( ~ (powerset(v0) = v1) | preboolean(v1)) % 4.15/1.63 | (25) ! [v0] : ! [v1] : ( ~ (finite_subsets(v0) = v1) | ~ empty(v1)) % 4.15/1.63 | (26) ! [v0] : ! [v1] : ( ~ (finite_subsets(v0) = v1) | cup_closed(v1)) % 4.15/1.63 | (27) ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1)) % 4.15/1.63 | (28) ~ empty(all_0_0_0) % 4.15/1.64 | (29) ! [v0] : ( ~ preboolean(v0) | diff_closed(v0)) % 4.15/1.64 | (30) ! [v0] : ! [v1] : ( ~ empty(v1) | ~ in(v0, v1)) % 4.15/1.64 | (31) set_union2(all_0_10_10, all_0_9_9) = all_0_5_5 % 4.15/1.64 | (32) ! [v0] : ! [v1] : ( ~ (powerset(v0) = v1) | empty(v0) | ? [v2] : (element(v2, v1) & ~ empty(v2))) % 4.15/1.64 | (33) finite(all_0_0_0) % 4.15/1.64 | (34) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (finite_subsets(v1) = v3) | ~ (finite_subsets(v0) = v2) | ~ subset(v0, v1) | subset(v2, v3)) % 4.15/1.64 | (35) finite_subsets(all_0_9_9) = all_0_7_7 % 4.15/1.64 | (36) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (finite_subsets(v2) = v1) | ~ (finite_subsets(v2) = v0)) % 4.15/1.64 | (37) ! [v0] : ! [v1] : ( ~ (powerset(v0) = v1) | ? [v2] : (element(v2, v1) & empty(v2))) % 4.15/1.64 | (38) ! [v0] : ! [v1] : ( ~ (powerset(v0) = v1) | cup_closed(v1)) % 4.15/1.64 | (39) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (powerset(v2) = v3) | ~ element(v1, v3) | ~ in(v0, v1) | element(v0, v2)) % 4.15/1.64 | (40) ! [v0] : ! [v1] : ! [v2] : ( ~ (finite_subsets(v0) = v2) | ~ element(v1, v2) | finite(v1)) % 4.15/1.64 | (41) ? [v0] : ? [v1] : element(v1, v0) % 4.15/1.64 | (42) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (set_union2(v3, v2) = v1) | ~ (set_union2(v3, v2) = v0)) % 4.15/1.64 | (43) ? [v0] : subset(v0, v0) % 4.15/1.64 | (44) ! [v0] : ! [v1] : ! [v2] : ( ~ (set_union2(v1, v0) = v2) | ~ empty(v2) | empty(v0)) % 4.15/1.64 | (45) ! [v0] : ! [v1] : ! [v2] : ( ~ (set_union2(v0, v1) = v2) | subset(v0, v2)) % 4.15/1.64 | (46) ! [v0] : ! [v1] : ! [v2] : ( ~ (set_union2(v0, v1) = v2) | set_union2(v1, v0) = v2) % 4.15/1.64 | (47) ! [v0] : ! [v1] : ! [v2] : ( ~ (set_union2(v1, v0) = v2) | set_union2(v0, v1) = v2) % 4.15/1.64 | (48) ! [v0] : (v0 = empty_set | ~ empty(v0)) % 4.15/1.64 | (49) preboolean(all_0_1_1) % 4.15/1.64 | (50) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (powerset(v2) = v3) | ~ element(v1, v3) | ~ empty(v2) | ~ in(v0, v1)) % 4.15/1.64 | (51) ! [v0] : ! [v1] : ( ~ element(v0, v1) | empty(v1) | in(v0, v1)) % 4.15/1.64 | (52) ! [v0] : ! [v1] : ( ~ (powerset(v0) = v1) | empty(v0) | ? [v2] : (element(v2, v1) & finite(v2) & ~ empty(v2))) % 4.15/1.64 | (53) ! [v0] : ! [v1] : ( ~ (finite_subsets(v0) = v1) | preboolean(v1)) % 4.15/1.64 | (54) ! [v0] : ! [v1] : ( ~ in(v0, v1) | element(v0, v1)) % 4.15/1.64 | (55) ! [v0] : ! [v1] : ( ~ (powerset(v0) = v1) | diff_closed(v1)) % 4.15/1.64 | (56) empty(all_0_2_2) % 4.15/1.64 | (57) ! [v0] : ! [v1] : (v1 = v0 | ~ (set_union2(v0, v0) = v1)) % 4.15/1.64 | (58) ! [v0] : ( ~ empty(v0) | finite(v0)) % 4.15/1.64 | (59) diff_closed(all_0_1_1) % 4.15/1.64 | (60) empty(empty_set) % 4.15/1.64 | % 4.15/1.64 | Instantiating formula (47) with all_0_5_5, all_0_10_10, all_0_9_9 and discharging atoms set_union2(all_0_10_10, all_0_9_9) = all_0_5_5, yields: % 4.15/1.64 | (61) set_union2(all_0_9_9, all_0_10_10) = all_0_5_5 % 4.15/1.64 | % 4.15/1.64 | Instantiating formula (45) with all_0_5_5, all_0_9_9, all_0_10_10 and discharging atoms set_union2(all_0_10_10, all_0_9_9) = all_0_5_5, yields: % 4.15/1.64 | (62) subset(all_0_10_10, all_0_5_5) % 4.15/1.64 | % 4.15/1.64 | Instantiating formula (45) with all_0_5_5, all_0_10_10, all_0_9_9 and discharging atoms set_union2(all_0_9_9, all_0_10_10) = all_0_5_5, yields: % 4.15/1.64 | (63) subset(all_0_9_9, all_0_5_5) % 4.15/1.64 | % 4.15/1.64 | Instantiating formula (34) with all_0_4_4, all_0_8_8, all_0_5_5, all_0_10_10 and discharging atoms finite_subsets(all_0_5_5) = all_0_4_4, finite_subsets(all_0_10_10) = all_0_8_8, subset(all_0_10_10, all_0_5_5), yields: % 4.15/1.65 | (64) subset(all_0_8_8, all_0_4_4) % 4.15/1.65 | % 4.15/1.65 | Instantiating formula (34) with all_0_4_4, all_0_7_7, all_0_5_5, all_0_9_9 and discharging atoms finite_subsets(all_0_5_5) = all_0_4_4, finite_subsets(all_0_9_9) = all_0_7_7, subset(all_0_9_9, all_0_5_5), yields: % 4.15/1.65 | (65) subset(all_0_7_7, all_0_4_4) % 4.15/1.65 | % 4.15/1.65 | Instantiating formula (9) with all_0_6_6, all_0_7_7, all_0_4_4, all_0_8_8 and discharging atoms set_union2(all_0_8_8, all_0_7_7) = all_0_6_6, subset(all_0_7_7, all_0_4_4), subset(all_0_8_8, all_0_4_4), ~ subset(all_0_6_6, all_0_4_4), yields: % 4.15/1.65 | (66) $false % 4.15/1.65 | % 4.15/1.65 |-The branch is then unsatisfiable % 4.15/1.65 % SZS output end Proof for theBenchmark % 4.15/1.65 % 4.15/1.65 1039ms %------------------------------------------------------------------------------