TSTP Solution File: SET914+1 by ePrincess---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ePrincess---1.0
% Problem  : SET914+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : ePrincess-casc -timeout=%d %s

% Computer : n023.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 00:23:07 EDT 2022

% Result   : Theorem 3.27s 1.48s
% Output   : Proof 4.59s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SET914+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12  % Command  : ePrincess-casc -timeout=%d %s
% 0.12/0.33  % Computer : n023.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sun Jul 10 15:44:25 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.47/0.59          ____       _                          
% 0.47/0.59    ___  / __ \_____(_)___  ________  __________
% 0.47/0.59   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.47/0.59  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.47/0.59  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.47/0.59  
% 0.47/0.59  A Theorem Prover for First-Order Logic
% 0.47/0.59  (ePrincess v.1.0)
% 0.47/0.59  
% 0.47/0.59  (c) Philipp Rümmer, 2009-2015
% 0.47/0.59  (c) Peter Backeman, 2014-2015
% 0.47/0.59  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.47/0.59  Free software under GNU Lesser General Public License (LGPL).
% 0.47/0.59  Bug reports to peter@backeman.se
% 0.47/0.59  
% 0.47/0.59  For more information, visit http://user.uu.se/~petba168/breu/
% 0.47/0.59  
% 0.47/0.59  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.71/0.63  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.33/0.89  Prover 0: Preprocessing ...
% 1.92/1.09  Prover 0: Warning: ignoring some quantifiers
% 1.92/1.11  Prover 0: Constructing countermodel ...
% 2.58/1.28  Prover 0: gave up
% 2.58/1.28  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 2.58/1.30  Prover 1: Preprocessing ...
% 2.95/1.39  Prover 1: Warning: ignoring some quantifiers
% 2.95/1.39  Prover 1: Constructing countermodel ...
% 3.27/1.48  Prover 1: proved (197ms)
% 3.27/1.48  
% 3.27/1.48  No countermodel exists, formula is valid
% 3.27/1.48  % SZS status Theorem for theBenchmark
% 3.27/1.48  
% 3.27/1.48  Generating proof ... Warning: ignoring some quantifiers
% 4.32/1.71  found it (size 21)
% 4.32/1.71  
% 4.32/1.71  % SZS output start Proof for theBenchmark
% 4.32/1.71  Assumed formulas after preprocessing and simplification: 
% 4.32/1.71  | (0)  ? [v0] :  ? [v1] :  ? [v2] :  ? [v3] :  ? [v4] :  ? [v5] :  ? [v6] : ( ~ (v5 = 0) & empty(v6) = 0 & empty(v4) = v5 & empty(empty_set) = 0 & disjoint(v3, v2) = 0 & unordered_pair(v0, v1) = v3 & in(v0, v2) = 0 &  ! [v7] :  ! [v8] :  ! [v9] :  ! [v10] :  ! [v11] : ( ~ (set_intersection2(v7, v8) = v9) |  ~ (in(v10, v7) = v11) |  ? [v12] :  ? [v13] : (in(v10, v9) = v12 & in(v10, v8) = v13 & ( ~ (v12 = 0) | (v13 = 0 & v11 = 0)))) &  ! [v7] :  ! [v8] :  ! [v9] :  ! [v10] : (v10 = v8 | v10 = v7 |  ~ (unordered_pair(v7, v8) = v9) |  ~ (in(v10, v9) = 0)) &  ! [v7] :  ! [v8] :  ! [v9] :  ! [v10] : (v10 = 0 |  ~ (unordered_pair(v7, v8) = v9) |  ~ (in(v8, v9) = v10)) &  ! [v7] :  ! [v8] :  ! [v9] :  ! [v10] : (v10 = 0 |  ~ (unordered_pair(v7, v8) = v9) |  ~ (in(v7, v9) = v10)) &  ! [v7] :  ! [v8] :  ! [v9] :  ! [v10] : (v8 = v7 |  ~ (disjoint(v10, v9) = v8) |  ~ (disjoint(v10, v9) = v7)) &  ! [v7] :  ! [v8] :  ! [v9] :  ! [v10] : (v8 = v7 |  ~ (set_intersection2(v10, v9) = v8) |  ~ (set_intersection2(v10, v9) = v7)) &  ! [v7] :  ! [v8] :  ! [v9] :  ! [v10] : (v8 = v7 |  ~ (unordered_pair(v10, v9) = v8) |  ~ (unordered_pair(v10, v9) = v7)) &  ! [v7] :  ! [v8] :  ! [v9] :  ! [v10] : (v8 = v7 |  ~ (in(v10, v9) = v8) |  ~ (in(v10, v9) = v7)) &  ! [v7] :  ! [v8] :  ! [v9] :  ! [v10] : ( ~ (set_intersection2(v7, v8) = v9) |  ~ (in(v10, v7) = 0) |  ? [v11] :  ? [v12] : (in(v10, v9) = v12 & in(v10, v8) = v11 & ( ~ (v11 = 0) | v12 = 0))) &  ? [v7] :  ! [v8] :  ! [v9] :  ! [v10] : (v10 = v7 |  ~ (set_intersection2(v8, v9) = v10) |  ? [v11] :  ? [v12] :  ? [v13] :  ? [v14] : (in(v11, v9) = v14 & in(v11, v8) = v13 & in(v11, v7) = v12 & ( ~ (v14 = 0) |  ~ (v13 = 0) |  ~ (v12 = 0)) & (v12 = 0 | (v14 = 0 & v13 = 0)))) &  ? [v7] :  ! [v8] :  ! [v9] :  ! [v10] : (v10 = v7 |  ~ (unordered_pair(v8, v9) = v10) |  ? [v11] :  ? [v12] : (in(v11, v7) = v12 & ( ~ (v12 = 0) | ( ~ (v11 = v9) &  ~ (v11 = v8))) & (v12 = 0 | v11 = v9 | v11 = v8))) &  ! [v7] :  ! [v8] :  ! [v9] : (v9 = 0 |  ~ (disjoint(v7, v8) = v9) |  ? [v10] : ( ~ (v10 = empty_set) & set_intersection2(v7, v8) = v10)) &  ! [v7] :  ! [v8] :  ! [v9] : (v8 = v7 |  ~ (empty(v9) = v8) |  ~ (empty(v9) = v7)) &  ! [v7] :  ! [v8] :  ! [v9] : ( ~ (set_intersection2(v7, v8) = v9) | set_intersection2(v8, v7) = v9) &  ! [v7] :  ! [v8] :  ! [v9] : ( ~ (unordered_pair(v7, v8) = v9) | unordered_pair(v8, v7) = v9) &  ! [v7] :  ! [v8] : (v8 = v7 |  ~ (set_intersection2(v7, v7) = v8)) &  ! [v7] :  ! [v8] : ( ~ (disjoint(v7, v8) = 0) | disjoint(v8, v7) = 0) &  ! [v7] :  ! [v8] : ( ~ (disjoint(v7, v8) = 0) | set_intersection2(v7, v8) = empty_set) &  ! [v7] :  ! [v8] : ( ~ (in(v7, v8) = 0) |  ? [v9] : ( ~ (v9 = 0) & in(v8, v7) = v9)) &  ! [v7] :  ~ (in(v7, empty_set) = 0) &  ? [v7] : (v7 = empty_set |  ? [v8] : in(v8, v7) = 0))
% 4.54/1.74  | 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 yields:
% 4.54/1.74  | (1)  ~ (all_0_1_1 = 0) & empty(all_0_0_0) = 0 & empty(all_0_2_2) = all_0_1_1 & empty(empty_set) = 0 & disjoint(all_0_3_3, all_0_4_4) = 0 & unordered_pair(all_0_6_6, all_0_5_5) = all_0_3_3 & in(all_0_6_6, all_0_4_4) = 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 = v1 | v3 = v0 |  ~ (unordered_pair(v0, v1) = v2) |  ~ (in(v3, v2) = 0)) &  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] : (v3 = 0 |  ~ (unordered_pair(v0, v1) = v2) |  ~ (in(v1, v2) = v3)) &  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] : (v3 = 0 |  ~ (unordered_pair(v0, v1) = v2) |  ~ (in(v0, v2) = v3)) &  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] : (v1 = v0 |  ~ (disjoint(v3, v2) = v1) |  ~ (disjoint(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 |  ~ (unordered_pair(v3, v2) = v1) |  ~ (unordered_pair(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] :  ! [v3] : (v3 = v0 |  ~ (unordered_pair(v1, v2) = v3) |  ? [v4] :  ? [v5] : (in(v4, v0) = v5 & ( ~ (v5 = 0) | ( ~ (v4 = v2) &  ~ (v4 = v1))) & (v5 = 0 | v4 = v2 | v4 = v1))) &  ! [v0] :  ! [v1] :  ! [v2] : (v2 = 0 |  ~ (disjoint(v0, v1) = v2) |  ? [v3] : ( ~ (v3 = empty_set) & set_intersection2(v0, v1) = v3)) &  ! [v0] :  ! [v1] :  ! [v2] : (v1 = v0 |  ~ (empty(v2) = v1) |  ~ (empty(v2) = v0)) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ (set_intersection2(v0, v1) = v2) | set_intersection2(v1, v0) = v2) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | unordered_pair(v1, v0) = v2) &  ! [v0] :  ! [v1] : (v1 = v0 |  ~ (set_intersection2(v0, 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] : ( ~ (in(v0, v1) = 0) |  ? [v2] : ( ~ (v2 = 0) & in(v1, v0) = v2)) &  ! [v0] :  ~ (in(v0, empty_set) = 0) &  ? [v0] : (v0 = empty_set |  ? [v1] : in(v1, v0) = 0)
% 4.54/1.75  |
% 4.54/1.75  | Applying alpha-rule on (1) yields:
% 4.54/1.75  | (2) empty(all_0_0_0) = 0
% 4.54/1.75  | (3)  ? [v0] : (v0 = empty_set |  ? [v1] : in(v1, v0) = 0)
% 4.54/1.75  | (4)  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] : (v1 = v0 |  ~ (set_intersection2(v3, v2) = v1) |  ~ (set_intersection2(v3, v2) = v0))
% 4.54/1.75  | (5)  ! [v0] :  ! [v1] : ( ~ (disjoint(v0, v1) = 0) | disjoint(v1, v0) = 0)
% 4.54/1.75  | (6) disjoint(all_0_3_3, all_0_4_4) = 0
% 4.54/1.75  | (7)  ! [v0] :  ~ (in(v0, empty_set) = 0)
% 4.54/1.75  | (8)  ! [v0] :  ! [v1] :  ! [v2] : (v1 = v0 |  ~ (empty(v2) = v1) |  ~ (empty(v2) = v0))
% 4.59/1.75  | (9)  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] : (v1 = v0 |  ~ (unordered_pair(v3, v2) = v1) |  ~ (unordered_pair(v3, v2) = v0))
% 4.59/1.75  | (10) empty(empty_set) = 0
% 4.59/1.75  | (11)  ? [v0] :  ! [v1] :  ! [v2] :  ! [v3] : (v3 = v0 |  ~ (unordered_pair(v1, v2) = v3) |  ? [v4] :  ? [v5] : (in(v4, v0) = v5 & ( ~ (v5 = 0) | ( ~ (v4 = v2) &  ~ (v4 = v1))) & (v5 = 0 | v4 = v2 | v4 = v1)))
% 4.59/1.75  | (12)  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] : (v3 = 0 |  ~ (unordered_pair(v0, v1) = v2) |  ~ (in(v0, v2) = v3))
% 4.59/1.75  | (13) unordered_pair(all_0_6_6, all_0_5_5) = all_0_3_3
% 4.59/1.75  | (14)  ! [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.59/1.75  | (15)  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] : (v3 = v1 | v3 = v0 |  ~ (unordered_pair(v0, v1) = v2) |  ~ (in(v3, v2) = 0))
% 4.59/1.75  | (16)  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] : (v1 = v0 |  ~ (in(v3, v2) = v1) |  ~ (in(v3, v2) = v0))
% 4.59/1.76  | (17)  ? [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.59/1.76  | (18)  ~ (all_0_1_1 = 0)
% 4.59/1.76  | (19) in(all_0_6_6, all_0_4_4) = 0
% 4.59/1.76  | (20) empty(all_0_2_2) = all_0_1_1
% 4.59/1.76  | (21)  ! [v0] :  ! [v1] : (v1 = v0 |  ~ (set_intersection2(v0, v0) = v1))
% 4.59/1.76  | (22)  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] : (v3 = 0 |  ~ (unordered_pair(v0, v1) = v2) |  ~ (in(v1, v2) = v3))
% 4.59/1.76  | (23)  ! [v0] :  ! [v1] : ( ~ (disjoint(v0, v1) = 0) | set_intersection2(v0, v1) = empty_set)
% 4.59/1.76  | (24)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | unordered_pair(v1, v0) = v2)
% 4.59/1.76  | (25)  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] : (v1 = v0 |  ~ (disjoint(v3, v2) = v1) |  ~ (disjoint(v3, v2) = v0))
% 4.59/1.76  | (26)  ! [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.59/1.76  | (27)  ! [v0] :  ! [v1] :  ! [v2] : (v2 = 0 |  ~ (disjoint(v0, v1) = v2) |  ? [v3] : ( ~ (v3 = empty_set) & set_intersection2(v0, v1) = v3))
% 4.59/1.76  | (28)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ (set_intersection2(v0, v1) = v2) | set_intersection2(v1, v0) = v2)
% 4.59/1.76  | (29)  ! [v0] :  ! [v1] : ( ~ (in(v0, v1) = 0) |  ? [v2] : ( ~ (v2 = 0) & in(v1, v0) = v2))
% 4.59/1.76  |
% 4.59/1.76  | Instantiating formula (7) with all_0_6_6 yields:
% 4.59/1.76  | (30)  ~ (in(all_0_6_6, empty_set) = 0)
% 4.59/1.76  |
% 4.59/1.76  | Instantiating formula (23) with all_0_4_4, all_0_3_3 and discharging atoms disjoint(all_0_3_3, all_0_4_4) = 0, yields:
% 4.59/1.76  | (31) set_intersection2(all_0_3_3, all_0_4_4) = empty_set
% 4.59/1.76  |
% 4.59/1.76  | Instantiating formula (28) with empty_set, all_0_4_4, all_0_3_3 and discharging atoms set_intersection2(all_0_3_3, all_0_4_4) = empty_set, yields:
% 4.59/1.76  | (32) set_intersection2(all_0_4_4, all_0_3_3) = empty_set
% 4.59/1.76  |
% 4.59/1.76  | Instantiating formula (14) with all_0_6_6, empty_set, all_0_3_3, all_0_4_4 and discharging atoms set_intersection2(all_0_4_4, all_0_3_3) = empty_set, in(all_0_6_6, all_0_4_4) = 0, yields:
% 4.59/1.76  | (33)  ? [v0] :  ? [v1] : (in(all_0_6_6, all_0_3_3) = v0 & in(all_0_6_6, empty_set) = v1 & ( ~ (v0 = 0) | v1 = 0))
% 4.59/1.76  |
% 4.59/1.76  | Instantiating formula (26) with 0, all_0_6_6, empty_set, all_0_3_3, all_0_4_4 and discharging atoms set_intersection2(all_0_4_4, all_0_3_3) = empty_set, in(all_0_6_6, all_0_4_4) = 0, yields:
% 4.59/1.76  | (34)  ? [v0] :  ? [v1] : (in(all_0_6_6, all_0_3_3) = v1 & in(all_0_6_6, empty_set) = v0 & ( ~ (v0 = 0) | v1 = 0))
% 4.59/1.76  |
% 4.59/1.76  | Instantiating (34) with all_43_0_11, all_43_1_12 yields:
% 4.59/1.76  | (35) in(all_0_6_6, all_0_3_3) = all_43_0_11 & in(all_0_6_6, empty_set) = all_43_1_12 & ( ~ (all_43_1_12 = 0) | all_43_0_11 = 0)
% 4.59/1.76  |
% 4.59/1.76  | Applying alpha-rule on (35) yields:
% 4.59/1.76  | (36) in(all_0_6_6, all_0_3_3) = all_43_0_11
% 4.59/1.76  | (37) in(all_0_6_6, empty_set) = all_43_1_12
% 4.59/1.76  | (38)  ~ (all_43_1_12 = 0) | all_43_0_11 = 0
% 4.59/1.76  |
% 4.59/1.76  | Instantiating (33) with all_45_0_13, all_45_1_14 yields:
% 4.59/1.77  | (39) in(all_0_6_6, all_0_3_3) = all_45_1_14 & in(all_0_6_6, empty_set) = all_45_0_13 & ( ~ (all_45_1_14 = 0) | all_45_0_13 = 0)
% 4.59/1.77  |
% 4.59/1.77  | Applying alpha-rule on (39) yields:
% 4.59/1.77  | (40) in(all_0_6_6, all_0_3_3) = all_45_1_14
% 4.59/1.77  | (41) in(all_0_6_6, empty_set) = all_45_0_13
% 4.59/1.77  | (42)  ~ (all_45_1_14 = 0) | all_45_0_13 = 0
% 4.59/1.77  |
% 4.59/1.77  | Instantiating formula (12) with all_45_1_14, all_0_3_3, all_0_5_5, all_0_6_6 and discharging atoms unordered_pair(all_0_6_6, all_0_5_5) = all_0_3_3, in(all_0_6_6, all_0_3_3) = all_45_1_14, yields:
% 4.59/1.77  | (43) all_45_1_14 = 0
% 4.59/1.77  |
% 4.59/1.77  | Using (41) and (30) yields:
% 4.59/1.77  | (44)  ~ (all_45_0_13 = 0)
% 4.59/1.77  |
% 4.59/1.77  | Instantiating formula (16) with all_0_6_6, empty_set, all_43_1_12, all_45_0_13 and discharging atoms in(all_0_6_6, empty_set) = all_45_0_13, in(all_0_6_6, empty_set) = all_43_1_12, yields:
% 4.59/1.77  | (45) all_45_0_13 = all_43_1_12
% 4.59/1.77  |
% 4.59/1.77  | Equations (45) can reduce 44 to:
% 4.59/1.77  | (46)  ~ (all_43_1_12 = 0)
% 4.59/1.77  |
% 4.59/1.77  +-Applying beta-rule and splitting (42), into two cases.
% 4.59/1.77  |-Branch one:
% 4.59/1.77  | (47)  ~ (all_45_1_14 = 0)
% 4.59/1.77  |
% 4.59/1.77  	| Equations (43) can reduce 47 to:
% 4.59/1.77  	| (48) $false
% 4.59/1.77  	|
% 4.59/1.77  	|-The branch is then unsatisfiable
% 4.59/1.77  |-Branch two:
% 4.59/1.77  | (43) all_45_1_14 = 0
% 4.59/1.77  | (50) all_45_0_13 = 0
% 4.59/1.77  |
% 4.59/1.77  	| Combining equations (50,45) yields a new equation:
% 4.59/1.77  	| (51) all_43_1_12 = 0
% 4.59/1.77  	|
% 4.59/1.77  	| Equations (51) can reduce 46 to:
% 4.59/1.77  	| (48) $false
% 4.59/1.77  	|
% 4.59/1.77  	|-The branch is then unsatisfiable
% 4.59/1.77  % SZS output end Proof for theBenchmark
% 4.59/1.77  
% 4.59/1.77  1174ms
%------------------------------------------------------------------------------