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

View Problem - Process Solution

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

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

% Result   : Theorem 1.68s 1.12s
% Output   : Proof 2.28s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14  % Problem  : SET573+3 : TPTP v8.1.0. Released v2.2.0.
% 0.13/0.15  % Command  : ePrincess-casc -timeout=%d %s
% 0.15/0.36  % Computer : n028.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Sun Jul 10 06:04:42 EDT 2022
% 0.15/0.36  % CPUTime  : 
% 0.50/0.63          ____       _                          
% 0.50/0.63    ___  / __ \_____(_)___  ________  __________
% 0.50/0.63   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.50/0.63  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.50/0.63  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.50/0.63  
% 0.50/0.63  A Theorem Prover for First-Order Logic
% 0.50/0.63  (ePrincess v.1.0)
% 0.50/0.63  
% 0.50/0.63  (c) Philipp Rümmer, 2009-2015
% 0.50/0.63  (c) Peter Backeman, 2014-2015
% 0.50/0.63  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.50/0.63  Free software under GNU Lesser General Public License (LGPL).
% 0.50/0.63  Bug reports to peter@backeman.se
% 0.50/0.63  
% 0.50/0.63  For more information, visit http://user.uu.se/~petba168/breu/
% 0.50/0.63  
% 0.50/0.63  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.73/0.69  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.40/0.95  Prover 0: Preprocessing ...
% 1.46/1.02  Prover 0: Warning: ignoring some quantifiers
% 1.59/1.04  Prover 0: Constructing countermodel ...
% 1.68/1.12  Prover 0: proved (437ms)
% 1.68/1.12  
% 1.68/1.12  No countermodel exists, formula is valid
% 1.68/1.12  % SZS status Theorem for theBenchmark
% 1.68/1.12  
% 1.68/1.12  Generating proof ... Warning: ignoring some quantifiers
% 2.28/1.25  found it (size 5)
% 2.28/1.25  
% 2.28/1.25  % SZS output start Proof for theBenchmark
% 2.28/1.25  Assumed formulas after preprocessing and simplification: 
% 2.28/1.25  | (0)  ? [v0] :  ? [v1] :  ? [v2] : (disjoint(v1, v2) & member(v0, v2) & member(v0, v1) &  ! [v3] :  ! [v4] :  ! [v5] : ( ~ member(v5, v4) |  ~ member(v5, v3) | intersect(v3, v4)) &  ! [v3] :  ! [v4] : ( ~ disjoint(v3, v4) |  ~ intersect(v3, v4)) &  ! [v3] :  ! [v4] : ( ~ intersect(v3, v4) | intersect(v4, v3)) &  ! [v3] :  ! [v4] : ( ~ intersect(v3, v4) |  ? [v5] : (member(v5, v4) & member(v5, v3))) &  ? [v3] :  ? [v4] : (disjoint(v3, v4) | intersect(v3, v4)))
% 2.28/1.25  | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2 yields:
% 2.28/1.25  | (1) disjoint(all_0_1_1, all_0_0_0) & member(all_0_2_2, all_0_0_0) & member(all_0_2_2, all_0_1_1) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ member(v2, v1) |  ~ member(v2, v0) | intersect(v0, v1)) &  ! [v0] :  ! [v1] : ( ~ disjoint(v0, v1) |  ~ intersect(v0, v1)) &  ! [v0] :  ! [v1] : ( ~ intersect(v0, v1) | intersect(v1, v0)) &  ! [v0] :  ! [v1] : ( ~ intersect(v0, v1) |  ? [v2] : (member(v2, v1) & member(v2, v0))) &  ? [v0] :  ? [v1] : (disjoint(v0, v1) | intersect(v0, v1))
% 2.28/1.26  |
% 2.28/1.26  | Applying alpha-rule on (1) yields:
% 2.28/1.26  | (2)  ! [v0] :  ! [v1] : ( ~ intersect(v0, v1) | intersect(v1, v0))
% 2.28/1.26  | (3)  ! [v0] :  ! [v1] : ( ~ disjoint(v0, v1) |  ~ intersect(v0, v1))
% 2.28/1.26  | (4)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ member(v2, v1) |  ~ member(v2, v0) | intersect(v0, v1))
% 2.28/1.26  | (5)  ! [v0] :  ! [v1] : ( ~ intersect(v0, v1) |  ? [v2] : (member(v2, v1) & member(v2, v0)))
% 2.28/1.26  | (6)  ? [v0] :  ? [v1] : (disjoint(v0, v1) | intersect(v0, v1))
% 2.28/1.26  | (7) disjoint(all_0_1_1, all_0_0_0)
% 2.28/1.26  | (8) member(all_0_2_2, all_0_0_0)
% 2.28/1.26  | (9) member(all_0_2_2, all_0_1_1)
% 2.28/1.26  |
% 2.28/1.26  | Instantiating formula (4) 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), yields:
% 2.28/1.26  | (10) intersect(all_0_1_1, all_0_0_0)
% 2.28/1.26  |
% 2.28/1.26  | Instantiating formula (3) with all_0_0_0, all_0_1_1 and discharging atoms disjoint(all_0_1_1, all_0_0_0), intersect(all_0_1_1, all_0_0_0), yields:
% 2.28/1.26  | (11) $false
% 2.28/1.26  |
% 2.28/1.27  |-The branch is then unsatisfiable
% 2.28/1.27  % SZS output end Proof for theBenchmark
% 2.28/1.27  
% 2.28/1.27  621ms
%------------------------------------------------------------------------------