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

View Problem - Process Solution

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

% Computer : n021.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:47:06 EDT 2022

% Result   : Theorem 1.78s 1.14s
% Output   : Proof 2.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SEU158+3 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.13  % Command  : ePrincess-casc -timeout=%d %s
% 0.12/0.34  % Computer : n021.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jun 19 04:44:32 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.61/0.66          ____       _                          
% 0.61/0.66    ___  / __ \_____(_)___  ________  __________
% 0.61/0.66   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.61/0.66  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.61/0.66  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.61/0.66  
% 0.61/0.66  A Theorem Prover for First-Order Logic
% 0.61/0.66  (ePrincess v.1.0)
% 0.61/0.66  
% 0.61/0.66  (c) Philipp Rümmer, 2009-2015
% 0.61/0.66  (c) Peter Backeman, 2014-2015
% 0.61/0.66  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.61/0.66  Free software under GNU Lesser General Public License (LGPL).
% 0.61/0.66  Bug reports to peter@backeman.se
% 0.61/0.66  
% 0.61/0.66  For more information, visit http://user.uu.se/~petba168/breu/
% 0.61/0.66  
% 0.61/0.66  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.77/0.71  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.33/0.95  Prover 0: Preprocessing ...
% 1.46/1.04  Prover 0: Warning: ignoring some quantifiers
% 1.46/1.05  Prover 0: Constructing countermodel ...
% 1.78/1.14  Prover 0: proved (429ms)
% 1.78/1.14  
% 1.78/1.14  No countermodel exists, formula is valid
% 1.78/1.14  % SZS status Theorem for theBenchmark
% 1.78/1.14  
% 1.78/1.14  Generating proof ... Warning: ignoring some quantifiers
% 2.11/1.27  found it (size 9)
% 2.11/1.27  
% 2.11/1.27  % SZS output start Proof for theBenchmark
% 2.11/1.27  Assumed formulas after preprocessing and simplification: 
% 2.11/1.27  | (0)  ? [v0] :  ? [v1] :  ? [v2] :  ? [v3] :  ? [v4] : (singleton(v0) = v2 & empty(v4) &  ~ empty(v3) &  ! [v5] :  ! [v6] :  ! [v7] : (v6 = v5 |  ~ (singleton(v7) = v6) |  ~ (singleton(v7) = v5)) &  ! [v5] :  ! [v6] :  ! [v7] : ( ~ (singleton(v5) = v7) |  ~ in(v5, v6) | subset(v7, v6)) &  ! [v5] :  ! [v6] :  ! [v7] : ( ~ (singleton(v5) = v7) |  ~ subset(v7, v6) | in(v5, v6)) &  ! [v5] :  ! [v6] : ( ~ in(v6, v5) |  ~ in(v5, v6)) &  ? [v5] : subset(v5, v5) & ((in(v0, v1) &  ~ subset(v2, v1)) | (subset(v2, v1) &  ~ in(v0, v1))))
% 2.20/1.31  | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3, all_0_4_4 yields:
% 2.20/1.31  | (1) singleton(all_0_4_4) = all_0_2_2 & empty(all_0_0_0) &  ~ empty(all_0_1_1) &  ! [v0] :  ! [v1] :  ! [v2] : (v1 = v0 |  ~ (singleton(v2) = v1) |  ~ (singleton(v2) = v0)) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ (singleton(v0) = v2) |  ~ in(v0, v1) | subset(v2, v1)) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ (singleton(v0) = v2) |  ~ subset(v2, v1) | in(v0, v1)) &  ! [v0] :  ! [v1] : ( ~ in(v1, v0) |  ~ in(v0, v1)) &  ? [v0] : subset(v0, v0) & ((in(all_0_4_4, all_0_3_3) &  ~ subset(all_0_2_2, all_0_3_3)) | (subset(all_0_2_2, all_0_3_3) &  ~ in(all_0_4_4, all_0_3_3)))
% 2.20/1.32  |
% 2.20/1.32  | Applying alpha-rule on (1) yields:
% 2.20/1.32  | (2) empty(all_0_0_0)
% 2.20/1.32  | (3) singleton(all_0_4_4) = all_0_2_2
% 2.20/1.32  | (4)  ! [v0] :  ! [v1] :  ! [v2] : (v1 = v0 |  ~ (singleton(v2) = v1) |  ~ (singleton(v2) = v0))
% 2.20/1.32  | (5)  ! [v0] :  ! [v1] : ( ~ in(v1, v0) |  ~ in(v0, v1))
% 2.20/1.32  | (6)  ~ empty(all_0_1_1)
% 2.20/1.32  | (7)  ? [v0] : subset(v0, v0)
% 2.20/1.32  | (8)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ (singleton(v0) = v2) |  ~ subset(v2, v1) | in(v0, v1))
% 2.20/1.32  | (9)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ (singleton(v0) = v2) |  ~ in(v0, v1) | subset(v2, v1))
% 2.20/1.32  | (10) (in(all_0_4_4, all_0_3_3) &  ~ subset(all_0_2_2, all_0_3_3)) | (subset(all_0_2_2, all_0_3_3) &  ~ in(all_0_4_4, all_0_3_3))
% 2.20/1.32  |
% 2.20/1.32  +-Applying beta-rule and splitting (10), into two cases.
% 2.20/1.32  |-Branch one:
% 2.20/1.32  | (11) in(all_0_4_4, all_0_3_3) &  ~ subset(all_0_2_2, all_0_3_3)
% 2.20/1.32  |
% 2.20/1.32  	| Applying alpha-rule on (11) yields:
% 2.20/1.32  	| (12) in(all_0_4_4, all_0_3_3)
% 2.20/1.32  	| (13)  ~ subset(all_0_2_2, all_0_3_3)
% 2.20/1.32  	|
% 2.20/1.32  	| Instantiating formula (9) with all_0_2_2, all_0_3_3, all_0_4_4 and discharging atoms singleton(all_0_4_4) = all_0_2_2, in(all_0_4_4, all_0_3_3),  ~ subset(all_0_2_2, all_0_3_3), yields:
% 2.20/1.32  	| (14) $false
% 2.20/1.32  	|
% 2.20/1.33  	|-The branch is then unsatisfiable
% 2.20/1.33  |-Branch two:
% 2.20/1.33  | (15) subset(all_0_2_2, all_0_3_3) &  ~ in(all_0_4_4, all_0_3_3)
% 2.20/1.33  |
% 2.20/1.33  	| Applying alpha-rule on (15) yields:
% 2.20/1.33  	| (16) subset(all_0_2_2, all_0_3_3)
% 2.20/1.33  	| (17)  ~ in(all_0_4_4, all_0_3_3)
% 2.20/1.33  	|
% 2.20/1.33  	| Instantiating formula (8) with all_0_2_2, all_0_3_3, all_0_4_4 and discharging atoms singleton(all_0_4_4) = all_0_2_2, subset(all_0_2_2, all_0_3_3),  ~ in(all_0_4_4, all_0_3_3), yields:
% 2.20/1.33  	| (14) $false
% 2.20/1.33  	|
% 2.20/1.33  	|-The branch is then unsatisfiable
% 2.20/1.33  % SZS output end Proof for theBenchmark
% 2.20/1.33  
% 2.20/1.33  656ms
%------------------------------------------------------------------------------