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

View Problem - Process Solution

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

% Computer : n019.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:02 EDT 2022

% Result   : Theorem 2.44s 1.24s
% Output   : Proof 2.77s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYN947+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12  % Command  : ePrincess-casc -timeout=%d %s
% 0.12/0.33  % Computer : n019.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 17:31:53 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.58/0.59          ____       _                          
% 0.58/0.59    ___  / __ \_____(_)___  ________  __________
% 0.58/0.59   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.58/0.59  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.58/0.59  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.58/0.59  
% 0.58/0.59  A Theorem Prover for First-Order Logic
% 0.58/0.59  (ePrincess v.1.0)
% 0.58/0.59  
% 0.58/0.59  (c) Philipp Rümmer, 2009-2015
% 0.58/0.59  (c) Peter Backeman, 2014-2015
% 0.58/0.59  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.58/0.59  Free software under GNU Lesser General Public License (LGPL).
% 0.58/0.59  Bug reports to peter@backeman.se
% 0.58/0.59  
% 0.58/0.59  For more information, visit http://user.uu.se/~petba168/breu/
% 0.58/0.59  
% 0.58/0.59  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.75/0.64  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.25/0.88  Prover 0: Preprocessing ...
% 1.31/0.92  Prover 0: Warning: ignoring some quantifiers
% 1.40/0.94  Prover 0: Constructing countermodel ...
% 1.52/1.02  Prover 0: gave up
% 1.52/1.02  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 1.52/1.03  Prover 1: Preprocessing ...
% 1.86/1.08  Prover 1: Constructing countermodel ...
% 1.86/1.09  Prover 1: gave up
% 1.86/1.09  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.86/1.10  Prover 2: Preprocessing ...
% 1.86/1.12  Prover 2: Warning: ignoring some quantifiers
% 1.86/1.12  Prover 2: Constructing countermodel ...
% 1.86/1.15  Prover 2: gave up
% 1.86/1.15  Prover 3: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.86/1.16  Prover 3: Preprocessing ...
% 1.86/1.16  Prover 3: Warning: ignoring some quantifiers
% 1.86/1.16  Prover 3: Constructing countermodel ...
% 1.86/1.17  Prover 3: gave up
% 1.86/1.17  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete
% 2.28/1.18  Prover 4: Preprocessing ...
% 2.28/1.21  Prover 4: Warning: ignoring some quantifiers
% 2.28/1.21  Prover 4: Constructing countermodel ...
% 2.44/1.23  Prover 4: proved (59ms)
% 2.44/1.24  
% 2.44/1.24  No countermodel exists, formula is valid
% 2.44/1.24  % SZS status Theorem for theBenchmark
% 2.44/1.24  
% 2.44/1.24  Generating proof ... Warning: ignoring some quantifiers
% 2.62/1.35  found it (size 8)
% 2.62/1.35  
% 2.62/1.35  % SZS output start Proof for theBenchmark
% 2.62/1.36  Assumed formulas after preprocessing and simplification: 
% 2.62/1.36  | (0)  ! [v0] :  ! [v1] :  ! [v2] : (v1 = v0 |  ~ (r(v2) = v1) |  ~ (r(v2) = v0)) &  ! [v0] :  ! [v1] :  ! [v2] : (v1 = v0 |  ~ (p(v2) = v1) |  ~ (p(v2) = v0)) &  ! [v0] :  ! [v1] :  ! [v2] : (v1 = v0 |  ~ (q(v2) = v1) |  ~ (q(v2) = v0)) &  ! [v0] :  ! [v1] : ( ~ (r(v0) = v1) |  ? [v2] :  ? [v3] : ( ~ (v3 = 0) &  ~ (v1 = 0) & p(v2) = v3)) &  ! [v0] :  ! [v1] : ( ~ (p(v0) = v1) |  ? [v2] : (v1 = 0 & q(v2) = 0)) &  ? [v0] :  ? [v1] :  ? [v2] :  ? [v3] : ( ~ (v3 = 0) &  ~ (v1 = 0) & r(v0) = v1 & p(v2) = v3) &  ? [v0] :  ? [v1] : (p(v0) = 0 & q(v1) = 0)
% 2.77/1.39  | Applying alpha-rule on (0) yields:
% 2.77/1.39  | (1)  ! [v0] :  ! [v1] : ( ~ (p(v0) = v1) |  ? [v2] : (v1 = 0 & q(v2) = 0))
% 2.77/1.39  | (2)  ? [v0] :  ? [v1] :  ? [v2] :  ? [v3] : ( ~ (v3 = 0) &  ~ (v1 = 0) & r(v0) = v1 & p(v2) = v3)
% 2.77/1.39  | (3)  ! [v0] :  ! [v1] :  ! [v2] : (v1 = v0 |  ~ (p(v2) = v1) |  ~ (p(v2) = v0))
% 2.77/1.39  | (4)  ! [v0] :  ! [v1] :  ! [v2] : (v1 = v0 |  ~ (q(v2) = v1) |  ~ (q(v2) = v0))
% 2.77/1.39  | (5)  ! [v0] :  ! [v1] :  ! [v2] : (v1 = v0 |  ~ (r(v2) = v1) |  ~ (r(v2) = v0))
% 2.77/1.40  | (6)  ? [v0] :  ? [v1] : (p(v0) = 0 & q(v1) = 0)
% 2.77/1.40  | (7)  ! [v0] :  ! [v1] : ( ~ (r(v0) = v1) |  ? [v2] :  ? [v3] : ( ~ (v3 = 0) &  ~ (v1 = 0) & p(v2) = v3))
% 2.77/1.40  |
% 2.77/1.40  | Instantiating (2) with all_3_0_2, all_3_1_3, all_3_2_4, all_3_3_5 yields:
% 2.77/1.40  | (8)  ~ (all_3_0_2 = 0) &  ~ (all_3_2_4 = 0) & r(all_3_3_5) = all_3_2_4 & p(all_3_1_3) = all_3_0_2
% 2.77/1.40  |
% 2.77/1.40  | Applying alpha-rule on (8) yields:
% 2.77/1.40  | (9)  ~ (all_3_0_2 = 0)
% 2.77/1.40  | (10)  ~ (all_3_2_4 = 0)
% 2.77/1.40  | (11) r(all_3_3_5) = all_3_2_4
% 2.77/1.40  | (12) p(all_3_1_3) = all_3_0_2
% 2.77/1.40  |
% 2.77/1.40  | Instantiating formula (1) with all_3_0_2, all_3_1_3 and discharging atoms p(all_3_1_3) = all_3_0_2, yields:
% 2.77/1.40  | (13)  ? [v0] : (all_3_0_2 = 0 & q(v0) = 0)
% 2.77/1.40  |
% 2.77/1.40  | Instantiating (13) with all_12_0_7 yields:
% 2.77/1.40  | (14) all_3_0_2 = 0 & q(all_12_0_7) = 0
% 2.77/1.40  |
% 2.77/1.40  | Applying alpha-rule on (14) yields:
% 2.77/1.40  | (15) all_3_0_2 = 0
% 2.77/1.40  | (16) q(all_12_0_7) = 0
% 2.77/1.40  |
% 2.77/1.40  | Equations (15) can reduce 9 to:
% 2.77/1.40  | (17) $false
% 2.77/1.40  |
% 2.77/1.40  |-The branch is then unsatisfiable
% 2.77/1.40  % SZS output end Proof for theBenchmark
% 2.77/1.40  
% 2.77/1.40  803ms
%------------------------------------------------------------------------------