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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ePrincess---1.0
% Problem  : SET925+1 : 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 00:23:12 EDT 2022

% Result   : Theorem 1.73s 1.16s
% Output   : Proof 2.55s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SET925+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13  % Command  : ePrincess-casc -timeout=%d %s
% 0.14/0.35  % Computer : n021.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Mon Jul 11 04:13:38 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.57/0.62          ____       _                          
% 0.57/0.62    ___  / __ \_____(_)___  ________  __________
% 0.57/0.62   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.57/0.62  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.57/0.62  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.57/0.62  
% 0.57/0.62  A Theorem Prover for First-Order Logic
% 0.57/0.62  (ePrincess v.1.0)
% 0.57/0.62  
% 0.57/0.62  (c) Philipp Rümmer, 2009-2015
% 0.57/0.62  (c) Peter Backeman, 2014-2015
% 0.57/0.62  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.57/0.62  Free software under GNU Lesser General Public License (LGPL).
% 0.57/0.62  Bug reports to peter@backeman.se
% 0.57/0.62  
% 0.57/0.62  For more information, visit http://user.uu.se/~petba168/breu/
% 0.57/0.62  
% 0.57/0.62  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.71/0.67  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.44/0.94  Prover 0: Preprocessing ...
% 1.59/1.06  Prover 0: Constructing countermodel ...
% 1.73/1.16  Prover 0: proved (492ms)
% 1.73/1.16  
% 1.73/1.16  No countermodel exists, formula is valid
% 1.73/1.16  % SZS status Theorem for theBenchmark
% 1.73/1.16  
% 1.73/1.16  Generating proof ... found it (size 11)
% 2.43/1.33  
% 2.43/1.33  % SZS output start Proof for theBenchmark
% 2.43/1.33  Assumed formulas after preprocessing and simplification: 
% 2.43/1.33  | (0)  ? [v0] :  ? [v1] :  ? [v2] :  ? [v3] :  ? [v4] :  ? [v5] : (singleton(v0) = v2 & set_difference(v2, v1) = v3 & empty(v5) & empty(empty_set) &  ~ empty(v4) &  ! [v6] :  ! [v7] :  ! [v8] :  ! [v9] : (v9 = empty_set |  ~ (singleton(v6) = v8) |  ~ (set_difference(v8, v7) = v9) |  ~ in(v6, v7)) &  ! [v6] :  ! [v7] :  ! [v8] :  ! [v9] : (v7 = v6 |  ~ (set_difference(v9, v8) = v7) |  ~ (set_difference(v9, v8) = v6)) &  ! [v6] :  ! [v7] :  ! [v8] : (v7 = v6 |  ~ (singleton(v8) = v7) |  ~ (singleton(v8) = v6)) &  ! [v6] :  ! [v7] :  ! [v8] : ( ~ (singleton(v6) = v8) |  ~ (set_difference(v8, v7) = empty_set) | in(v6, v7)) &  ! [v6] :  ! [v7] : ( ~ in(v7, v6) |  ~ in(v6, v7)) & ((v3 = empty_set &  ~ in(v0, v1)) | ( ~ (v3 = empty_set) & in(v0, v1))))
% 2.43/1.37  | 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 yields:
% 2.43/1.37  | (1) singleton(all_0_5_5) = all_0_3_3 & set_difference(all_0_3_3, all_0_4_4) = all_0_2_2 & empty(all_0_0_0) & empty(empty_set) &  ~ empty(all_0_1_1) &  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] : (v3 = empty_set |  ~ (singleton(v0) = v2) |  ~ (set_difference(v2, v1) = v3) |  ~ in(v0, v1)) &  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] : (v1 = v0 |  ~ (set_difference(v3, v2) = v1) |  ~ (set_difference(v3, v2) = v0)) &  ! [v0] :  ! [v1] :  ! [v2] : (v1 = v0 |  ~ (singleton(v2) = v1) |  ~ (singleton(v2) = v0)) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ (singleton(v0) = v2) |  ~ (set_difference(v2, v1) = empty_set) | in(v0, v1)) &  ! [v0] :  ! [v1] : ( ~ in(v1, v0) |  ~ in(v0, v1)) & ((all_0_2_2 = empty_set &  ~ in(all_0_5_5, all_0_4_4)) | ( ~ (all_0_2_2 = empty_set) & in(all_0_5_5, all_0_4_4)))
% 2.43/1.37  |
% 2.43/1.37  | Applying alpha-rule on (1) yields:
% 2.43/1.38  | (2)  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] : (v3 = empty_set |  ~ (singleton(v0) = v2) |  ~ (set_difference(v2, v1) = v3) |  ~ in(v0, v1))
% 2.43/1.38  | (3)  ~ empty(all_0_1_1)
% 2.43/1.38  | (4) (all_0_2_2 = empty_set &  ~ in(all_0_5_5, all_0_4_4)) | ( ~ (all_0_2_2 = empty_set) & in(all_0_5_5, all_0_4_4))
% 2.43/1.38  | (5) set_difference(all_0_3_3, all_0_4_4) = all_0_2_2
% 2.43/1.38  | (6) empty(empty_set)
% 2.43/1.38  | (7)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ (singleton(v0) = v2) |  ~ (set_difference(v2, v1) = empty_set) | in(v0, v1))
% 2.43/1.38  | (8) singleton(all_0_5_5) = all_0_3_3
% 2.43/1.38  | (9)  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] : (v1 = v0 |  ~ (set_difference(v3, v2) = v1) |  ~ (set_difference(v3, v2) = v0))
% 2.43/1.38  | (10)  ! [v0] :  ! [v1] :  ! [v2] : (v1 = v0 |  ~ (singleton(v2) = v1) |  ~ (singleton(v2) = v0))
% 2.43/1.38  | (11) empty(all_0_0_0)
% 2.43/1.38  | (12)  ! [v0] :  ! [v1] : ( ~ in(v1, v0) |  ~ in(v0, v1))
% 2.43/1.38  |
% 2.43/1.38  +-Applying beta-rule and splitting (4), into two cases.
% 2.43/1.38  |-Branch one:
% 2.43/1.38  | (13) all_0_2_2 = empty_set &  ~ in(all_0_5_5, all_0_4_4)
% 2.43/1.38  |
% 2.43/1.38  	| Applying alpha-rule on (13) yields:
% 2.43/1.38  	| (14) all_0_2_2 = empty_set
% 2.43/1.38  	| (15)  ~ in(all_0_5_5, all_0_4_4)
% 2.43/1.38  	|
% 2.55/1.38  	| From (14) and (5) follows:
% 2.55/1.38  	| (16) set_difference(all_0_3_3, all_0_4_4) = empty_set
% 2.55/1.38  	|
% 2.55/1.38  	| Instantiating formula (7) with all_0_3_3, all_0_4_4, all_0_5_5 and discharging atoms singleton(all_0_5_5) = all_0_3_3, set_difference(all_0_3_3, all_0_4_4) = empty_set,  ~ in(all_0_5_5, all_0_4_4), yields:
% 2.55/1.38  	| (17) $false
% 2.55/1.38  	|
% 2.55/1.38  	|-The branch is then unsatisfiable
% 2.55/1.38  |-Branch two:
% 2.55/1.38  | (18)  ~ (all_0_2_2 = empty_set) & in(all_0_5_5, all_0_4_4)
% 2.55/1.39  |
% 2.55/1.39  	| Applying alpha-rule on (18) yields:
% 2.55/1.39  	| (19)  ~ (all_0_2_2 = empty_set)
% 2.55/1.39  	| (20) in(all_0_5_5, all_0_4_4)
% 2.55/1.39  	|
% 2.55/1.39  	| Instantiating formula (2) with all_0_2_2, all_0_3_3, all_0_4_4, all_0_5_5 and discharging atoms singleton(all_0_5_5) = all_0_3_3, set_difference(all_0_3_3, all_0_4_4) = all_0_2_2, in(all_0_5_5, all_0_4_4), yields:
% 2.55/1.39  	| (14) all_0_2_2 = empty_set
% 2.55/1.39  	|
% 2.55/1.39  	| Equations (14) can reduce 19 to:
% 2.55/1.39  	| (22) $false
% 2.55/1.39  	|
% 2.55/1.39  	|-The branch is then unsatisfiable
% 2.55/1.39  % SZS output end Proof for theBenchmark
% 2.55/1.39  
% 2.55/1.39  759ms
%------------------------------------------------------------------------------