TSTP Solution File: SET574+3 by ePrincess---1.0

View Problem - Process Solution

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

% Computer : n003.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:20:21 EDT 2022

% Result   : Theorem 1.52s 1.02s
% Output   : Proof 2.12s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SET574+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.12  % Command  : ePrincess-casc -timeout=%d %s
% 0.11/0.32  % Computer : n003.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Sat Jul  9 23:20:14 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.54/0.57          ____       _                          
% 0.54/0.57    ___  / __ \_____(_)___  ________  __________
% 0.54/0.57   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.54/0.57  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.54/0.57  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.54/0.57  
% 0.54/0.57  A Theorem Prover for First-Order Logic
% 0.54/0.57  (ePrincess v.1.0)
% 0.54/0.57  
% 0.54/0.57  (c) Philipp Rümmer, 2009-2015
% 0.54/0.57  (c) Peter Backeman, 2014-2015
% 0.54/0.57  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.54/0.57  Free software under GNU Lesser General Public License (LGPL).
% 0.54/0.57  Bug reports to peter@backeman.se
% 0.54/0.57  
% 0.54/0.57  For more information, visit http://user.uu.se/~petba168/breu/
% 0.54/0.57  
% 0.54/0.57  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.54/0.62  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.30/0.87  Prover 0: Preprocessing ...
% 1.45/0.94  Prover 0: Constructing countermodel ...
% 1.52/1.02  Prover 0: proved (396ms)
% 1.52/1.02  
% 1.52/1.02  No countermodel exists, formula is valid
% 1.52/1.02  % SZS status Theorem for theBenchmark
% 1.52/1.02  
% 1.52/1.02  Generating proof ... found it (size 4)
% 1.94/1.14  
% 1.94/1.14  % SZS output start Proof for theBenchmark
% 1.94/1.14  Assumed formulas after preprocessing and simplification: 
% 1.94/1.14  | (0)  ? [v0] :  ? [v1] :  ? [v2] : (member(v0, v2) & member(v0, v1) &  ~ intersect(v1, v2) &  ! [v3] :  ! [v4] :  ! [v5] : ( ~ member(v5, v4) |  ~ member(v5, v3) | intersect(v3, v4)) &  ! [v3] :  ! [v4] : ( ~ intersect(v3, v4) | intersect(v4, v3)) &  ! [v3] :  ! [v4] : ( ~ intersect(v3, v4) |  ? [v5] : (member(v5, v4) & member(v5, v3))))
% 2.12/1.14  | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2 yields:
% 2.12/1.14  | (1) member(all_0_2_2, all_0_0_0) & member(all_0_2_2, all_0_1_1) &  ~ intersect(all_0_1_1, all_0_0_0) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ member(v2, v1) |  ~ member(v2, v0) | intersect(v0, v1)) &  ! [v0] :  ! [v1] : ( ~ intersect(v0, v1) | intersect(v1, v0)) &  ! [v0] :  ! [v1] : ( ~ intersect(v0, v1) |  ? [v2] : (member(v2, v1) & member(v2, v0)))
% 2.12/1.15  |
% 2.12/1.15  | Applying alpha-rule on (1) yields:
% 2.12/1.15  | (2)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ member(v2, v1) |  ~ member(v2, v0) | intersect(v0, v1))
% 2.12/1.15  | (3) member(all_0_2_2, all_0_1_1)
% 2.12/1.15  | (4)  ! [v0] :  ! [v1] : ( ~ intersect(v0, v1) | intersect(v1, v0))
% 2.12/1.15  | (5)  ~ intersect(all_0_1_1, all_0_0_0)
% 2.12/1.15  | (6)  ! [v0] :  ! [v1] : ( ~ intersect(v0, v1) |  ? [v2] : (member(v2, v1) & member(v2, v0)))
% 2.12/1.15  | (7) member(all_0_2_2, all_0_0_0)
% 2.12/1.15  |
% 2.12/1.15  | Instantiating formula (2) with all_0_2_2, all_0_0_0, all_0_1_1 and discharging atoms member(all_0_2_2, all_0_0_0), member(all_0_2_2, all_0_1_1),  ~ intersect(all_0_1_1, all_0_0_0), yields:
% 2.12/1.15  | (8) $false
% 2.12/1.15  |
% 2.12/1.15  |-The branch is then unsatisfiable
% 2.12/1.15  % SZS output end Proof for theBenchmark
% 2.12/1.15  
% 2.12/1.15  574ms
%------------------------------------------------------------------------------