TSTP Solution File: SEU123+2 by ePrincess---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ePrincess---1.0
% Problem : SEU123+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : ePrincess-casc -timeout=%d %s
% Computer : n015.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:44 EDT 2022
% Result : Theorem 3.73s 1.58s
% Output : Proof 4.97s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU123+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : ePrincess-casc -timeout=%d %s
% 0.13/0.34 % Computer : n015.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 : Sun Jun 19 17:07:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.59 ____ _
% 0.19/0.59 ___ / __ \_____(_)___ ________ __________
% 0.19/0.59 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.19/0.59 / __/ ____/ / / / / / / /__/ __(__ |__ )
% 0.19/0.59 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/
% 0.19/0.59
% 0.19/0.59 A Theorem Prover for First-Order Logic
% 0.19/0.59 (ePrincess v.1.0)
% 0.19/0.59
% 0.19/0.59 (c) Philipp Rümmer, 2009-2015
% 0.19/0.59 (c) Peter Backeman, 2014-2015
% 0.19/0.59 (contributions by Angelo Brillout, Peter Baumgartner)
% 0.19/0.59 Free software under GNU Lesser General Public License (LGPL).
% 0.19/0.59 Bug reports to peter@backeman.se
% 0.19/0.59
% 0.19/0.59 For more information, visit http://user.uu.se/~petba168/breu/
% 0.19/0.59
% 0.19/0.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.72/0.64 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.49/0.92 Prover 0: Preprocessing ...
% 1.90/1.10 Prover 0: Warning: ignoring some quantifiers
% 1.90/1.12 Prover 0: Constructing countermodel ...
% 3.05/1.43 Prover 0: gave up
% 3.05/1.43 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 3.28/1.45 Prover 1: Preprocessing ...
% 3.57/1.55 Prover 1: Warning: ignoring some quantifiers
% 3.73/1.55 Prover 1: Constructing countermodel ...
% 3.73/1.57 Prover 1: proved (147ms)
% 3.73/1.58
% 3.73/1.58 No countermodel exists, formula is valid
% 3.73/1.58 % SZS status Theorem for theBenchmark
% 3.73/1.58
% 3.73/1.58 Generating proof ... Warning: ignoring some quantifiers
% 4.69/1.78 found it (size 11)
% 4.69/1.78
% 4.69/1.78 % SZS output start Proof for theBenchmark
% 4.69/1.78 Assumed formulas after preprocessing and simplification:
% 4.69/1.78 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ( ~ (v2 = 0) & ~ (v0 = empty_set) & empty(v3) = 0 & empty(v1) = v2 & empty(empty_set) = 0 & subset(v0, empty_set) = 0 & ! [v4] : ! [v5] : ! [v6] : ! [v7] : ! [v8] : ( ~ (set_intersection2(v4, v5) = v6) | ~ (in(v7, v4) = v8) | ? [v9] : ? [v10] : (in(v7, v6) = v9 & in(v7, v5) = v10 & ( ~ (v9 = 0) | (v10 = 0 & v8 = 0)))) & ! [v4] : ! [v5] : ! [v6] : ! [v7] : (v7 = 0 | ~ (subset(v4, v6) = v7) | ~ (subset(v4, v5) = 0) | ? [v8] : ( ~ (v8 = 0) & subset(v5, v6) = v8)) & ! [v4] : ! [v5] : ! [v6] : ! [v7] : (v5 = v4 | ~ (disjoint(v7, v6) = v5) | ~ (disjoint(v7, v6) = v4)) & ! [v4] : ! [v5] : ! [v6] : ! [v7] : (v5 = v4 | ~ (subset(v7, v6) = v5) | ~ (subset(v7, v6) = v4)) & ! [v4] : ! [v5] : ! [v6] : ! [v7] : (v5 = v4 | ~ (set_intersection2(v7, v6) = v5) | ~ (set_intersection2(v7, v6) = v4)) & ! [v4] : ! [v5] : ! [v6] : ! [v7] : (v5 = v4 | ~ (in(v7, v6) = v5) | ~ (in(v7, v6) = v4)) & ! [v4] : ! [v5] : ! [v6] : ! [v7] : ( ~ (set_intersection2(v4, v5) = v6) | ~ (in(v7, v4) = 0) | ? [v8] : ? [v9] : (in(v7, v6) = v9 & in(v7, v5) = v8 & ( ~ (v8 = 0) | v9 = 0))) & ? [v4] : ! [v5] : ! [v6] : ! [v7] : (v7 = v4 | ~ (set_intersection2(v5, v6) = v7) | ? [v8] : ? [v9] : ? [v10] : ? [v11] : (in(v8, v6) = v11 & in(v8, v5) = v10 & in(v8, v4) = v9 & ( ~ (v11 = 0) | ~ (v10 = 0) | ~ (v9 = 0)) & (v9 = 0 | (v11 = 0 & v10 = 0)))) & ! [v4] : ! [v5] : ! [v6] : (v6 = 0 | ~ (disjoint(v4, v5) = v6) | ? [v7] : ? [v8] : (set_intersection2(v4, v5) = v7 & in(v8, v7) = 0)) & ! [v4] : ! [v5] : ! [v6] : (v6 = 0 | ~ (disjoint(v4, v5) = v6) | ? [v7] : ( ~ (v7 = empty_set) & set_intersection2(v4, v5) = v7)) & ! [v4] : ! [v5] : ! [v6] : (v6 = 0 | ~ (disjoint(v4, v5) = v6) | ? [v7] : (in(v7, v5) = 0 & in(v7, v4) = 0)) & ! [v4] : ! [v5] : ! [v6] : (v6 = 0 | ~ (subset(v4, v5) = v6) | ? [v7] : ? [v8] : ( ~ (v8 = 0) & in(v7, v5) = v8 & in(v7, v4) = 0)) & ! [v4] : ! [v5] : ! [v6] : (v5 = v4 | ~ (empty(v6) = v5) | ~ (empty(v6) = v4)) & ! [v4] : ! [v5] : ! [v6] : ( ~ (disjoint(v4, v5) = 0) | ~ (in(v6, v4) = 0) | ? [v7] : ( ~ (v7 = 0) & in(v6, v5) = v7)) & ! [v4] : ! [v5] : ! [v6] : ( ~ (subset(v4, v5) = 0) | ~ (in(v6, v4) = 0) | in(v6, v5) = 0) & ! [v4] : ! [v5] : ! [v6] : ( ~ (set_intersection2(v4, v5) = v6) | set_intersection2(v5, v4) = v6) & ! [v4] : ! [v5] : (v5 = v4 | ~ (empty(v5) = 0) | ~ (empty(v4) = 0)) & ! [v4] : ! [v5] : (v5 = v4 | ~ (subset(v4, v5) = 0) | ? [v6] : ( ~ (v6 = 0) & subset(v5, v4) = v6)) & ! [v4] : ! [v5] : (v5 = v4 | ~ (set_intersection2(v4, v4) = v5)) & ! [v4] : ! [v5] : (v5 = 0 | ~ (subset(v4, v4) = v5)) & ! [v4] : ! [v5] : (v5 = 0 | ~ (subset(empty_set, v4) = v5)) & ! [v4] : ! [v5] : ( ~ (disjoint(v4, v5) = 0) | disjoint(v5, v4) = 0) & ! [v4] : ! [v5] : ( ~ (disjoint(v4, v5) = 0) | set_intersection2(v4, v5) = empty_set) & ! [v4] : ! [v5] : ( ~ (disjoint(v4, v5) = 0) | ? [v6] : (set_intersection2(v4, v5) = v6 & ! [v7] : ~ (in(v7, v6) = 0))) & ! [v4] : ! [v5] : ( ~ (in(v4, v5) = 0) | ? [v6] : ( ~ (v6 = 0) & empty(v5) = v6)) & ! [v4] : ! [v5] : ( ~ (in(v4, v5) = 0) | ? [v6] : ( ~ (v6 = 0) & in(v5, v4) = v6)) & ! [v4] : (v4 = empty_set | ~ (empty(v4) = 0)) & ! [v4] : ~ (in(v4, empty_set) = 0) & ? [v4] : (v4 = empty_set | ? [v5] : in(v5, v4) = 0))
% 4.75/1.81 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3 yields:
% 4.75/1.81 | (1) ~ (all_0_1_1 = 0) & ~ (all_0_3_3 = empty_set) & empty(all_0_0_0) = 0 & empty(all_0_2_2) = all_0_1_1 & empty(empty_set) = 0 & subset(all_0_3_3, empty_set) = 0 & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ (set_intersection2(v0, v1) = v2) | ~ (in(v3, v0) = v4) | ? [v5] : ? [v6] : (in(v3, v2) = v5 & in(v3, v1) = v6 & ( ~ (v5 = 0) | (v6 = 0 & v4 = 0)))) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = 0 | ~ (subset(v0, v2) = v3) | ~ (subset(v0, v1) = 0) | ? [v4] : ( ~ (v4 = 0) & subset(v1, v2) = v4)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (disjoint(v3, v2) = v1) | ~ (disjoint(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (set_intersection2(v3, v2) = v1) | ~ (set_intersection2(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (set_intersection2(v0, v1) = v2) | ~ (in(v3, v0) = 0) | ? [v4] : ? [v5] : (in(v3, v2) = v5 & in(v3, v1) = v4 & ( ~ (v4 = 0) | v5 = 0))) & ? [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v0 | ~ (set_intersection2(v1, v2) = v3) | ? [v4] : ? [v5] : ? [v6] : ? [v7] : (in(v4, v2) = v7 & in(v4, v1) = v6 & in(v4, v0) = v5 & ( ~ (v7 = 0) | ~ (v6 = 0) | ~ (v5 = 0)) & (v5 = 0 | (v7 = 0 & v6 = 0)))) & ! [v0] : ! [v1] : ! [v2] : (v2 = 0 | ~ (disjoint(v0, v1) = v2) | ? [v3] : ? [v4] : (set_intersection2(v0, v1) = v3 & in(v4, v3) = 0)) & ! [v0] : ! [v1] : ! [v2] : (v2 = 0 | ~ (disjoint(v0, v1) = v2) | ? [v3] : ( ~ (v3 = empty_set) & set_intersection2(v0, v1) = v3)) & ! [v0] : ! [v1] : ! [v2] : (v2 = 0 | ~ (disjoint(v0, v1) = v2) | ? [v3] : (in(v3, v1) = 0 & in(v3, v0) = 0)) & ! [v0] : ! [v1] : ! [v2] : (v2 = 0 | ~ (subset(v0, v1) = v2) | ? [v3] : ? [v4] : ( ~ (v4 = 0) & in(v3, v1) = v4 & in(v3, v0) = 0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (empty(v2) = v1) | ~ (empty(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (disjoint(v0, v1) = 0) | ~ (in(v2, v0) = 0) | ? [v3] : ( ~ (v3 = 0) & in(v2, v1) = v3)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (subset(v0, v1) = 0) | ~ (in(v2, v0) = 0) | in(v2, v1) = 0) & ! [v0] : ! [v1] : ! [v2] : ( ~ (set_intersection2(v0, v1) = v2) | set_intersection2(v1, v0) = v2) & ! [v0] : ! [v1] : (v1 = v0 | ~ (empty(v1) = 0) | ~ (empty(v0) = 0)) & ! [v0] : ! [v1] : (v1 = v0 | ~ (subset(v0, v1) = 0) | ? [v2] : ( ~ (v2 = 0) & subset(v1, v0) = v2)) & ! [v0] : ! [v1] : (v1 = v0 | ~ (set_intersection2(v0, v0) = v1)) & ! [v0] : ! [v1] : (v1 = 0 | ~ (subset(v0, v0) = v1)) & ! [v0] : ! [v1] : (v1 = 0 | ~ (subset(empty_set, v0) = v1)) & ! [v0] : ! [v1] : ( ~ (disjoint(v0, v1) = 0) | disjoint(v1, v0) = 0) & ! [v0] : ! [v1] : ( ~ (disjoint(v0, v1) = 0) | set_intersection2(v0, v1) = empty_set) & ! [v0] : ! [v1] : ( ~ (disjoint(v0, v1) = 0) | ? [v2] : (set_intersection2(v0, v1) = v2 & ! [v3] : ~ (in(v3, v2) = 0))) & ! [v0] : ! [v1] : ( ~ (in(v0, v1) = 0) | ? [v2] : ( ~ (v2 = 0) & empty(v1) = v2)) & ! [v0] : ! [v1] : ( ~ (in(v0, v1) = 0) | ? [v2] : ( ~ (v2 = 0) & in(v1, v0) = v2)) & ! [v0] : (v0 = empty_set | ~ (empty(v0) = 0)) & ! [v0] : ~ (in(v0, empty_set) = 0) & ? [v0] : (v0 = empty_set | ? [v1] : in(v1, v0) = 0)
% 4.75/1.82 |
% 4.75/1.82 | Applying alpha-rule on (1) yields:
% 4.75/1.82 | (2) ! [v0] : ! [v1] : ( ~ (in(v0, v1) = 0) | ? [v2] : ( ~ (v2 = 0) & in(v1, v0) = v2))
% 4.75/1.82 | (3) ! [v0] : ! [v1] : (v1 = v0 | ~ (empty(v1) = 0) | ~ (empty(v0) = 0))
% 4.75/1.82 | (4) ! [v0] : ~ (in(v0, empty_set) = 0)
% 4.75/1.82 | (5) ! [v0] : ! [v1] : (v1 = v0 | ~ (set_intersection2(v0, v0) = v1))
% 4.75/1.82 | (6) ? [v0] : (v0 = empty_set | ? [v1] : in(v1, v0) = 0)
% 4.75/1.82 | (7) ! [v0] : ! [v1] : ( ~ (disjoint(v0, v1) = 0) | disjoint(v1, v0) = 0)
% 4.75/1.82 | (8) ~ (all_0_3_3 = empty_set)
% 4.75/1.82 | (9) empty(all_0_2_2) = all_0_1_1
% 4.75/1.82 | (10) ~ (all_0_1_1 = 0)
% 4.75/1.82 | (11) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (set_intersection2(v0, v1) = v2) | ~ (in(v3, v0) = 0) | ? [v4] : ? [v5] : (in(v3, v2) = v5 & in(v3, v1) = v4 & ( ~ (v4 = 0) | v5 = 0)))
% 4.75/1.83 | (12) ! [v0] : ! [v1] : ( ~ (disjoint(v0, v1) = 0) | set_intersection2(v0, v1) = empty_set)
% 4.75/1.83 | (13) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0))
% 4.75/1.83 | (14) empty(empty_set) = 0
% 4.75/1.83 | (15) ! [v0] : (v0 = empty_set | ~ (empty(v0) = 0))
% 4.75/1.83 | (16) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = 0 | ~ (subset(v0, v2) = v3) | ~ (subset(v0, v1) = 0) | ? [v4] : ( ~ (v4 = 0) & subset(v1, v2) = v4))
% 4.75/1.83 | (17) subset(all_0_3_3, empty_set) = 0
% 4.75/1.83 | (18) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (disjoint(v3, v2) = v1) | ~ (disjoint(v3, v2) = v0))
% 4.75/1.83 | (19) ! [v0] : ! [v1] : ! [v2] : (v2 = 0 | ~ (disjoint(v0, v1) = v2) | ? [v3] : ? [v4] : (set_intersection2(v0, v1) = v3 & in(v4, v3) = 0))
% 4.75/1.83 | (20) ? [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v0 | ~ (set_intersection2(v1, v2) = v3) | ? [v4] : ? [v5] : ? [v6] : ? [v7] : (in(v4, v2) = v7 & in(v4, v1) = v6 & in(v4, v0) = v5 & ( ~ (v7 = 0) | ~ (v6 = 0) | ~ (v5 = 0)) & (v5 = 0 | (v7 = 0 & v6 = 0))))
% 4.75/1.83 | (21) ! [v0] : ! [v1] : ( ~ (disjoint(v0, v1) = 0) | ? [v2] : (set_intersection2(v0, v1) = v2 & ! [v3] : ~ (in(v3, v2) = 0)))
% 4.75/1.83 | (22) ! [v0] : ! [v1] : ! [v2] : (v2 = 0 | ~ (disjoint(v0, v1) = v2) | ? [v3] : ( ~ (v3 = empty_set) & set_intersection2(v0, v1) = v3))
% 4.75/1.83 | (23) ! [v0] : ! [v1] : ! [v2] : ( ~ (disjoint(v0, v1) = 0) | ~ (in(v2, v0) = 0) | ? [v3] : ( ~ (v3 = 0) & in(v2, v1) = v3))
% 4.75/1.83 | (24) ! [v0] : ! [v1] : (v1 = v0 | ~ (subset(v0, v1) = 0) | ? [v2] : ( ~ (v2 = 0) & subset(v1, v0) = v2))
% 4.75/1.83 | (25) empty(all_0_0_0) = 0
% 4.75/1.83 | (26) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2) = v0))
% 4.97/1.83 | (27) ! [v0] : ! [v1] : ( ~ (in(v0, v1) = 0) | ? [v2] : ( ~ (v2 = 0) & empty(v1) = v2))
% 4.97/1.83 | (28) ! [v0] : ! [v1] : ! [v2] : ( ~ (subset(v0, v1) = 0) | ~ (in(v2, v0) = 0) | in(v2, v1) = 0)
% 4.97/1.83 | (29) ! [v0] : ! [v1] : ! [v2] : (v2 = 0 | ~ (disjoint(v0, v1) = v2) | ? [v3] : (in(v3, v1) = 0 & in(v3, v0) = 0))
% 4.97/1.83 | (30) ! [v0] : ! [v1] : ! [v2] : (v2 = 0 | ~ (subset(v0, v1) = v2) | ? [v3] : ? [v4] : ( ~ (v4 = 0) & in(v3, v1) = v4 & in(v3, v0) = 0))
% 4.97/1.83 | (31) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ (set_intersection2(v0, v1) = v2) | ~ (in(v3, v0) = v4) | ? [v5] : ? [v6] : (in(v3, v2) = v5 & in(v3, v1) = v6 & ( ~ (v5 = 0) | (v6 = 0 & v4 = 0))))
% 4.97/1.83 | (32) ! [v0] : ! [v1] : ! [v2] : ( ~ (set_intersection2(v0, v1) = v2) | set_intersection2(v1, v0) = v2)
% 4.97/1.83 | (33) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (set_intersection2(v3, v2) = v1) | ~ (set_intersection2(v3, v2) = v0))
% 4.97/1.83 | (34) ! [v0] : ! [v1] : (v1 = 0 | ~ (subset(v0, v0) = v1))
% 4.97/1.83 | (35) ! [v0] : ! [v1] : (v1 = 0 | ~ (subset(empty_set, v0) = v1))
% 4.97/1.83 | (36) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (empty(v2) = v1) | ~ (empty(v2) = v0))
% 4.97/1.83 |
% 4.97/1.83 | Instantiating formula (24) with empty_set, all_0_3_3 and discharging atoms subset(all_0_3_3, empty_set) = 0, yields:
% 4.97/1.84 | (37) all_0_3_3 = empty_set | ? [v0] : ( ~ (v0 = 0) & subset(empty_set, all_0_3_3) = v0)
% 4.97/1.84 |
% 4.97/1.84 +-Applying beta-rule and splitting (37), into two cases.
% 4.97/1.84 |-Branch one:
% 4.97/1.84 | (38) all_0_3_3 = empty_set
% 4.97/1.84 |
% 4.97/1.84 | Equations (38) can reduce 8 to:
% 4.97/1.84 | (39) $false
% 4.97/1.84 |
% 4.97/1.84 |-The branch is then unsatisfiable
% 4.97/1.84 |-Branch two:
% 4.97/1.84 | (8) ~ (all_0_3_3 = empty_set)
% 4.97/1.84 | (41) ? [v0] : ( ~ (v0 = 0) & subset(empty_set, all_0_3_3) = v0)
% 4.97/1.84 |
% 4.97/1.84 | Instantiating (41) with all_21_0_6 yields:
% 4.97/1.84 | (42) ~ (all_21_0_6 = 0) & subset(empty_set, all_0_3_3) = all_21_0_6
% 4.97/1.84 |
% 4.97/1.84 | Applying alpha-rule on (42) yields:
% 4.97/1.84 | (43) ~ (all_21_0_6 = 0)
% 4.97/1.84 | (44) subset(empty_set, all_0_3_3) = all_21_0_6
% 4.97/1.84 |
% 4.97/1.84 | Instantiating formula (35) with all_21_0_6, all_0_3_3 and discharging atoms subset(empty_set, all_0_3_3) = all_21_0_6, yields:
% 4.97/1.84 | (45) all_21_0_6 = 0
% 4.97/1.84 |
% 4.97/1.84 | Equations (45) can reduce 43 to:
% 4.97/1.84 | (39) $false
% 4.97/1.84 |
% 4.97/1.84 |-The branch is then unsatisfiable
% 4.97/1.84 % SZS output end Proof for theBenchmark
% 4.97/1.84
% 4.97/1.84 1240ms
%------------------------------------------------------------------------------