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

View Problem - Process Solution

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

% Computer : n015.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:16:40 EDT 2022

% Result   : Theorem 3.29s 1.56s
% Output   : Proof 3.76s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET046+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.12  % Command  : ePrincess-casc -timeout=%d %s
% 0.12/0.33  % Computer : n015.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 : Sat Jul  9 18:34:22 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.56/0.58          ____       _                          
% 0.56/0.58    ___  / __ \_____(_)___  ________  __________
% 0.56/0.58   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.56/0.58  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.56/0.58  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.56/0.58  
% 0.56/0.58  A Theorem Prover for First-Order Logic
% 0.56/0.58  (ePrincess v.1.0)
% 0.56/0.58  
% 0.56/0.58  (c) Philipp Rümmer, 2009-2015
% 0.56/0.58  (c) Peter Backeman, 2014-2015
% 0.56/0.58  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.56/0.58  Free software under GNU Lesser General Public License (LGPL).
% 0.56/0.58  Bug reports to peter@backeman.se
% 0.56/0.58  
% 0.56/0.58  For more information, visit http://user.uu.se/~petba168/breu/
% 0.56/0.59  
% 0.56/0.59  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.74/0.64  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.22/0.88  Prover 0: Preprocessing ...
% 1.38/0.93  Prover 0: Warning: ignoring some quantifiers
% 1.40/0.95  Prover 0: Constructing countermodel ...
% 1.52/1.05  Prover 0: gave up
% 1.52/1.05  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 1.52/1.06  Prover 1: Preprocessing ...
% 1.81/1.11  Prover 1: Constructing countermodel ...
% 1.81/1.11  Prover 1: gave up
% 1.81/1.11  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.81/1.12  Prover 2: Preprocessing ...
% 1.81/1.15  Prover 2: Warning: ignoring some quantifiers
% 1.81/1.15  Prover 2: Constructing countermodel ...
% 1.81/1.17  Prover 2: gave up
% 1.81/1.17  Prover 3: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.14/1.18  Prover 3: Preprocessing ...
% 2.14/1.18  Prover 3: Warning: ignoring some quantifiers
% 2.14/1.18  Prover 3: Constructing countermodel ...
% 2.14/1.20  Prover 3: gave up
% 2.14/1.20  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete
% 2.28/1.21  Prover 4: Preprocessing ...
% 2.38/1.24  Prover 4: Warning: ignoring some quantifiers
% 2.38/1.24  Prover 4: Constructing countermodel ...
% 2.68/1.33  Prover 4: gave up
% 2.68/1.33  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.68/1.33  Prover 5: Preprocessing ...
% 2.68/1.35  Prover 5: Constructing countermodel ...
% 2.68/1.35  Prover 5: gave up
% 2.68/1.35  Prover 6: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 2.68/1.36  Prover 6: Preprocessing ...
% 2.68/1.37  Prover 6: Warning: ignoring some quantifiers
% 2.68/1.37  Prover 6: Constructing countermodel ...
% 2.68/1.38  Prover 6: gave up
% 2.68/1.38  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all
% 2.68/1.39  Prover 7: Preprocessing ...
% 2.91/1.39  Prover 7: Proving ...
% 3.29/1.56  Prover 7: proved (176ms)
% 3.29/1.56  
% 3.29/1.56  % SZS status Theorem for theBenchmark
% 3.29/1.56  
% 3.29/1.56  Generating proof ... found it (size 20)
% 3.76/1.87  
% 3.76/1.87  % SZS output start Proof for theBenchmark
% 3.76/1.87  Assumed formulas after preprocessing and simplification: 
% 3.76/1.87  | (0)  ? [v0] : ( ! [v1] : ( ~ element(v1, v0) |  ! [v2] : ( ~ element(v2, v1) |  ~ element(v1, v2))) &  ! [v1] : (element(v1, v0) |  ? [v2] : (element(v2, v1) & element(v1, v2))))
% 3.76/1.87  | Instantiating (0) with all_0_0_0 yields:
% 3.76/1.87  | (1)  ! [v0] : ( ~ element(v0, all_0_0_0) |  ! [v1] : ( ~ element(v1, v0) |  ~ element(v0, v1))) &  ! [v0] : (element(v0, all_0_0_0) |  ? [v1] : (element(v1, v0) & element(v0, v1)))
% 3.76/1.88  |
% 3.76/1.88  | Applying alpha-rule on (1) yields:
% 3.76/1.88  | (2)  ! [v0] : ( ~ element(v0, all_0_0_0) |  ! [v1] : ( ~ element(v1, v0) |  ~ element(v0, v1)))
% 3.76/1.88  | (3)  ! [v0] : (element(v0, all_0_0_0) |  ? [v1] : (element(v1, v0) & element(v0, v1)))
% 3.76/1.88  |
% 3.76/1.88  | Introducing new symbol ex_4_0_1 defined by:
% 3.76/1.88  | (4) ex_4_0_1 = all_0_0_0
% 3.76/1.88  |
% 3.76/1.88  | Instantiating formula (3) with ex_4_0_1 yields:
% 3.76/1.88  | (5) element(ex_4_0_1, all_0_0_0) |  ? [v0] : (element(v0, ex_4_0_1) & element(ex_4_0_1, v0))
% 3.76/1.88  |
% 3.76/1.88  +-Applying beta-rule and splitting (5), into two cases.
% 3.76/1.88  |-Branch one:
% 3.76/1.88  | (6) element(ex_4_0_1, all_0_0_0)
% 3.76/1.88  |
% 3.76/1.88  	| Instantiating formula (2) with ex_4_0_1 and discharging atoms element(ex_4_0_1, all_0_0_0), yields:
% 3.76/1.88  	| (7)  ! [v0] : ( ~ element(v0, ex_4_0_1) |  ~ element(ex_4_0_1, v0))
% 3.76/1.88  	|
% 3.76/1.88  	| Instantiating formula (7) with all_0_0_0 and discharging atoms element(ex_4_0_1, all_0_0_0), yields:
% 3.76/1.88  	| (8)  ~ element(all_0_0_0, ex_4_0_1)
% 3.76/1.88  	|
% 3.76/1.88  	| From (4) and (6) follows:
% 3.76/1.88  	| (9) element(all_0_0_0, all_0_0_0)
% 3.76/1.88  	|
% 3.76/1.88  	| From (4) and (8) follows:
% 3.76/1.88  	| (10)  ~ element(all_0_0_0, all_0_0_0)
% 3.76/1.88  	|
% 3.76/1.88  	| Using (9) and (10) yields:
% 3.76/1.88  	| (11) $false
% 3.76/1.88  	|
% 3.76/1.88  	|-The branch is then unsatisfiable
% 3.76/1.88  |-Branch two:
% 3.76/1.88  | (12)  ? [v0] : (element(v0, ex_4_0_1) & element(ex_4_0_1, v0))
% 3.76/1.88  |
% 3.76/1.88  	| Instantiating (12) with all_6_0_2 yields:
% 3.76/1.88  	| (13) element(all_6_0_2, ex_4_0_1) & element(ex_4_0_1, all_6_0_2)
% 3.76/1.88  	|
% 3.76/1.88  	| Applying alpha-rule on (13) yields:
% 3.76/1.88  	| (14) element(all_6_0_2, ex_4_0_1)
% 3.76/1.88  	| (15) element(ex_4_0_1, all_6_0_2)
% 3.76/1.88  	|
% 3.76/1.88  	| Instantiating formula (2) with all_6_0_2 yields:
% 3.76/1.88  	| (16)  ~ element(all_6_0_2, all_0_0_0) |  ! [v0] : ( ~ element(v0, all_6_0_2) |  ~ element(all_6_0_2, v0))
% 3.76/1.88  	|
% 3.76/1.88  	+-Applying beta-rule and splitting (16), into two cases.
% 3.76/1.88  	|-Branch one:
% 3.76/1.88  	| (17)  ~ element(all_6_0_2, all_0_0_0)
% 3.76/1.88  	|
% 3.76/1.88  		| From (4) and (14) follows:
% 3.76/1.88  		| (18) element(all_6_0_2, all_0_0_0)
% 3.76/1.88  		|
% 3.76/1.88  		| Using (18) and (17) yields:
% 3.76/1.88  		| (11) $false
% 3.76/1.88  		|
% 3.76/1.88  		|-The branch is then unsatisfiable
% 3.76/1.88  	|-Branch two:
% 3.76/1.88  	| (20)  ! [v0] : ( ~ element(v0, all_6_0_2) |  ~ element(all_6_0_2, v0))
% 3.76/1.88  	|
% 3.76/1.88  		| Instantiating formula (20) with ex_4_0_1 and discharging atoms element(all_6_0_2, ex_4_0_1), element(ex_4_0_1, all_6_0_2), yields:
% 3.76/1.88  		| (11) $false
% 3.76/1.88  		|
% 3.76/1.88  		|-The branch is then unsatisfiable
% 3.76/1.88  % SZS output end Proof for theBenchmark
% 3.76/1.88  
% 3.76/1.88  1289ms
%------------------------------------------------------------------------------