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

View Problem - Process Solution

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

% Computer : n012.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:10 EDT 2022

% Result   : Theorem 2.07s 1.14s
% Output   : Proof 2.40s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN968+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13  % Command  : ePrincess-casc -timeout=%d %s
% 0.12/0.34  % Computer : n012.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 : Tue Jul 12 03:14:57 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.50/0.59          ____       _                          
% 0.50/0.59    ___  / __ \_____(_)___  ________  __________
% 0.50/0.59   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.50/0.59  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.50/0.59  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.50/0.59  
% 0.50/0.59  A Theorem Prover for First-Order Logic
% 0.50/0.59  (ePrincess v.1.0)
% 0.50/0.59  
% 0.50/0.59  (c) Philipp Rümmer, 2009-2015
% 0.50/0.59  (c) Peter Backeman, 2014-2015
% 0.50/0.59  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.50/0.59  Free software under GNU Lesser General Public License (LGPL).
% 0.50/0.59  Bug reports to peter@backeman.se
% 0.50/0.59  
% 0.50/0.59  For more information, visit http://user.uu.se/~petba168/breu/
% 0.50/0.59  
% 0.50/0.59  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.76/0.64  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.19/0.86  Prover 0: Preprocessing ...
% 1.19/0.90  Prover 0: Warning: ignoring some quantifiers
% 1.19/0.91  Prover 0: Constructing countermodel ...
% 1.35/0.98  Prover 0: gave up
% 1.35/0.98  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 1.49/0.99  Prover 1: Preprocessing ...
% 1.49/1.03  Prover 1: Constructing countermodel ...
% 1.49/1.03  Prover 1: gave up
% 1.49/1.03  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.49/1.04  Prover 2: Preprocessing ...
% 1.74/1.05  Prover 2: Warning: ignoring some quantifiers
% 1.74/1.06  Prover 2: Constructing countermodel ...
% 1.74/1.07  Prover 2: gave up
% 1.74/1.08  Prover 3: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.83/1.08  Prover 3: Preprocessing ...
% 1.83/1.09  Prover 3: Warning: ignoring some quantifiers
% 1.83/1.09  Prover 3: Constructing countermodel ...
% 1.83/1.10  Prover 3: gave up
% 1.83/1.10  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete
% 1.83/1.10  Prover 4: Preprocessing ...
% 1.83/1.12  Prover 4: Warning: ignoring some quantifiers
% 1.83/1.12  Prover 4: Constructing countermodel ...
% 2.07/1.14  Prover 4: proved (39ms)
% 2.07/1.14  
% 2.07/1.14  No countermodel exists, formula is valid
% 2.07/1.14  % SZS status Theorem for theBenchmark
% 2.07/1.14  
% 2.07/1.14  Generating proof ... Warning: ignoring some quantifiers
% 2.17/1.23  found it (size 8)
% 2.17/1.23  
% 2.17/1.23  % SZS output start Proof for theBenchmark
% 2.17/1.23  Assumed formulas after preprocessing and simplification: 
% 2.31/1.23  | (0)  ! [v0] :  ! [v1] :  ! [v2] : (v1 = v0 |  ~ (p(v2) = v1) |  ~ (p(v2) = v0)) &  ! [v0] :  ! [v1] : ( ~ (p(v0) = v1) |  ? [v2] :  ? [v3] : (v1 = 0 &  ~ (v3 = 0) & p(v2) = v3)) &  ? [v0] :  ? [v1] :  ? [v2] : ( ~ (v2 = 0) & p(v1) = v2 & p(v0) = 0)
% 2.40/1.27  | Applying alpha-rule on (0) yields:
% 2.40/1.27  | (1)  ! [v0] :  ! [v1] :  ! [v2] : (v1 = v0 |  ~ (p(v2) = v1) |  ~ (p(v2) = v0))
% 2.40/1.27  | (2)  ! [v0] :  ! [v1] : ( ~ (p(v0) = v1) |  ? [v2] :  ? [v3] : (v1 = 0 &  ~ (v3 = 0) & p(v2) = v3))
% 2.40/1.27  | (3)  ? [v0] :  ? [v1] :  ? [v2] : ( ~ (v2 = 0) & p(v1) = v2 & p(v0) = 0)
% 2.40/1.27  |
% 2.40/1.27  | Instantiating (3) with all_1_0_0, all_1_1_1, all_1_2_2 yields:
% 2.40/1.27  | (4)  ~ (all_1_0_0 = 0) & p(all_1_1_1) = all_1_0_0 & p(all_1_2_2) = 0
% 2.40/1.27  |
% 2.40/1.27  | Applying alpha-rule on (4) yields:
% 2.40/1.27  | (5)  ~ (all_1_0_0 = 0)
% 2.40/1.27  | (6) p(all_1_1_1) = all_1_0_0
% 2.40/1.27  | (7) p(all_1_2_2) = 0
% 2.40/1.27  |
% 2.40/1.28  | Instantiating formula (2) with all_1_0_0, all_1_1_1 and discharging atoms p(all_1_1_1) = all_1_0_0, yields:
% 2.40/1.28  | (8)  ? [v0] :  ? [v1] : (all_1_0_0 = 0 &  ~ (v1 = 0) & p(v0) = v1)
% 2.40/1.28  |
% 2.40/1.28  | Instantiating (8) with all_10_0_5, all_10_1_6 yields:
% 2.40/1.28  | (9) all_1_0_0 = 0 &  ~ (all_10_0_5 = 0) & p(all_10_1_6) = all_10_0_5
% 2.40/1.28  |
% 2.40/1.28  | Applying alpha-rule on (9) yields:
% 2.40/1.28  | (10) all_1_0_0 = 0
% 2.40/1.28  | (11)  ~ (all_10_0_5 = 0)
% 2.40/1.28  | (12) p(all_10_1_6) = all_10_0_5
% 2.40/1.28  |
% 2.40/1.28  | Equations (10) can reduce 5 to:
% 2.40/1.28  | (13) $false
% 2.40/1.28  |
% 2.40/1.28  |-The branch is then unsatisfiable
% 2.40/1.28  % SZS output end Proof for theBenchmark
% 2.40/1.28  
% 2.40/1.28  680ms
%------------------------------------------------------------------------------