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

View Problem - Process Solution

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

% Computer : n017.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 : Thu Jul 21 05:06:05 EDT 2022

% Result   : Theorem 3.22s 1.58s
% Output   : Proof 3.47s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN957+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12  % Command  : ePrincess-casc -timeout=%d %s
% 0.12/0.33  % Computer : n017.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 : Mon Jul 11 19:44:19 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.51/0.59          ____       _                          
% 0.51/0.59    ___  / __ \_____(_)___  ________  __________
% 0.51/0.59   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.51/0.59  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.51/0.59  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.51/0.59  
% 0.51/0.59  A Theorem Prover for First-Order Logic
% 0.51/0.59  (ePrincess v.1.0)
% 0.51/0.59  
% 0.51/0.59  (c) Philipp Rümmer, 2009-2015
% 0.51/0.59  (c) Peter Backeman, 2014-2015
% 0.51/0.59  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.51/0.59  Free software under GNU Lesser General Public License (LGPL).
% 0.51/0.59  Bug reports to peter@backeman.se
% 0.51/0.59  
% 0.51/0.59  For more information, visit http://user.uu.se/~petba168/breu/
% 0.51/0.59  
% 0.51/0.59  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.71/0.64  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.19/0.89  Prover 0: Preprocessing ...
% 1.19/0.92  Prover 0: Warning: ignoring some quantifiers
% 1.35/0.94  Prover 0: Constructing countermodel ...
% 1.60/1.04  Prover 0: gave up
% 1.60/1.04  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 1.60/1.05  Prover 1: Preprocessing ...
% 1.76/1.12  Prover 1: Constructing countermodel ...
% 1.76/1.13  Prover 1: gave up
% 1.76/1.13  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.98/1.14  Prover 2: Preprocessing ...
% 2.10/1.17  Prover 2: Warning: ignoring some quantifiers
% 2.10/1.18  Prover 2: Constructing countermodel ...
% 2.10/1.20  Prover 2: gave up
% 2.10/1.20  Prover 3: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.10/1.20  Prover 3: Preprocessing ...
% 2.10/1.21  Prover 3: Warning: ignoring some quantifiers
% 2.10/1.21  Prover 3: Constructing countermodel ...
% 2.32/1.23  Prover 3: gave up
% 2.32/1.23  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete
% 2.32/1.23  Prover 4: Preprocessing ...
% 2.41/1.27  Prover 4: Warning: ignoring some quantifiers
% 2.41/1.28  Prover 4: Constructing countermodel ...
% 2.68/1.38  Prover 4: gave up
% 2.68/1.38  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.68/1.38  Prover 5: Preprocessing ...
% 2.68/1.40  Prover 5: Constructing countermodel ...
% 2.68/1.41  Prover 5: gave up
% 2.68/1.41  Prover 6: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 2.68/1.41  Prover 6: Preprocessing ...
% 2.68/1.43  Prover 6: Warning: ignoring some quantifiers
% 2.68/1.43  Prover 6: Constructing countermodel ...
% 2.91/1.44  Prover 6: gave up
% 2.91/1.44  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all
% 2.91/1.44  Prover 7: Preprocessing ...
% 2.91/1.45  Prover 7: Proving ...
% 3.22/1.58  Prover 7: proved (140ms)
% 3.22/1.58  
% 3.22/1.58  % SZS status Theorem for theBenchmark
% 3.22/1.58  
% 3.22/1.58  Generating proof ... found it (size 13)
% 3.47/1.73  
% 3.47/1.73  % SZS output start Proof for theBenchmark
% 3.47/1.73  Assumed formulas after preprocessing and simplification: 
% 3.47/1.73  | (0)  ? [v0] : ( ! [v1] : ( ~ a(v1, v1) |  ~ a(v1, v0)) &  ! [v1] : (a(v1, v1) | a(v1, v0)))
% 3.47/1.73  | Instantiating (0) with all_0_0_0 yields:
% 3.47/1.73  | (1)  ! [v0] : ( ~ a(v0, v0) |  ~ a(v0, all_0_0_0)) &  ! [v0] : (a(v0, v0) | a(v0, all_0_0_0))
% 3.47/1.73  |
% 3.47/1.73  | Applying alpha-rule on (1) yields:
% 3.47/1.73  | (2)  ! [v0] : ( ~ a(v0, v0) |  ~ a(v0, all_0_0_0))
% 3.47/1.73  | (3)  ! [v0] : (a(v0, v0) | a(v0, all_0_0_0))
% 3.47/1.73  |
% 3.47/1.73  | Introducing new symbol ex_4_0_1 defined by:
% 3.47/1.73  | (4) ex_4_0_1 = all_0_0_0
% 3.47/1.73  |
% 3.47/1.73  | Instantiating formula (3) with ex_4_0_1 yields:
% 3.47/1.73  | (5) a(ex_4_0_1, ex_4_0_1) | a(ex_4_0_1, all_0_0_0)
% 3.47/1.73  |
% 3.47/1.73  +-Applying beta-rule and splitting (5), into two cases.
% 3.47/1.73  |-Branch one:
% 3.47/1.73  | (6) a(ex_4_0_1, ex_4_0_1)
% 3.47/1.73  |
% 3.47/1.73  	| Instantiating formula (2) with all_0_0_0 yields:
% 3.47/1.73  	| (7)  ~ a(all_0_0_0, all_0_0_0)
% 3.47/1.73  	|
% 3.47/1.73  	| From (4)(4) and (6) follows:
% 3.47/1.73  	| (8) a(all_0_0_0, all_0_0_0)
% 3.47/1.73  	|
% 3.47/1.73  	| Using (8) and (7) yields:
% 3.47/1.73  	| (9) $false
% 3.47/1.73  	|
% 3.47/1.73  	|-The branch is then unsatisfiable
% 3.47/1.73  |-Branch two:
% 3.47/1.73  | (10) a(ex_4_0_1, all_0_0_0)
% 3.47/1.74  |
% 3.47/1.74  	| Instantiating formula (2) with all_0_0_0 yields:
% 3.47/1.74  	| (7)  ~ a(all_0_0_0, all_0_0_0)
% 3.47/1.74  	|
% 3.47/1.74  	| From (4) and (10) follows:
% 3.47/1.74  	| (8) a(all_0_0_0, all_0_0_0)
% 3.47/1.74  	|
% 3.47/1.74  	| Using (8) and (7) yields:
% 3.47/1.74  	| (9) $false
% 3.47/1.74  	|
% 3.47/1.74  	|-The branch is then unsatisfiable
% 3.47/1.74  % SZS output end Proof for theBenchmark
% 3.47/1.74  
% 3.47/1.74  1136ms
%------------------------------------------------------------------------------