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

View Problem - Process Solution

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

% Computer : n018.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:01:48 EDT 2022

% Result   : Theorem 3.48s 1.62s
% Output   : Proof 3.62s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN362+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.12  % Command  : ePrincess-casc -timeout=%d %s
% 0.12/0.33  % Computer : n018.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 22:36:14 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.54/0.59          ____       _                          
% 0.54/0.59    ___  / __ \_____(_)___  ________  __________
% 0.54/0.59   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.54/0.59  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.54/0.59  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.54/0.59  
% 0.54/0.59  A Theorem Prover for First-Order Logic
% 0.54/0.59  (ePrincess v.1.0)
% 0.54/0.59  
% 0.54/0.59  (c) Philipp Rümmer, 2009-2015
% 0.54/0.59  (c) Peter Backeman, 2014-2015
% 0.54/0.59  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.54/0.59  Free software under GNU Lesser General Public License (LGPL).
% 0.54/0.59  Bug reports to peter@backeman.se
% 0.54/0.59  
% 0.54/0.59  For more information, visit http://user.uu.se/~petba168/breu/
% 0.54/0.59  
% 0.54/0.59  Loading /export/starexec/sandbox2/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.21/0.88  Prover 0: Preprocessing ...
% 1.28/0.93  Prover 0: Warning: ignoring some quantifiers
% 1.39/0.94  Prover 0: Constructing countermodel ...
% 1.51/1.04  Prover 0: gave up
% 1.51/1.04  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 1.51/1.06  Prover 1: Preprocessing ...
% 1.79/1.10  Prover 1: Warning: ignoring some quantifiers
% 1.79/1.10  Prover 1: Constructing countermodel ...
% 1.79/1.13  Prover 1: gave up
% 1.79/1.13  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.79/1.14  Prover 2: Preprocessing ...
% 1.79/1.16  Prover 2: Warning: ignoring some quantifiers
% 1.79/1.17  Prover 2: Constructing countermodel ...
% 2.29/1.22  Prover 2: gave up
% 2.29/1.22  Prover 3: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.29/1.23  Prover 3: Preprocessing ...
% 2.37/1.24  Prover 3: Warning: ignoring some quantifiers
% 2.37/1.24  Prover 3: Constructing countermodel ...
% 2.37/1.25  Prover 3: gave up
% 2.37/1.25  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete
% 2.37/1.25  Prover 4: Preprocessing ...
% 2.37/1.28  Prover 4: Warning: ignoring some quantifiers
% 2.37/1.28  Prover 4: Constructing countermodel ...
% 2.67/1.34  Prover 4: gave up
% 2.67/1.34  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.67/1.34  Prover 5: Preprocessing ...
% 2.67/1.35  Prover 5: Warning: ignoring some quantifiers
% 2.67/1.36  Prover 5: Constructing countermodel ...
% 2.67/1.37  Prover 5: gave up
% 2.67/1.37  Prover 6: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 2.67/1.38  Prover 6: Preprocessing ...
% 2.90/1.39  Prover 6: Warning: ignoring some quantifiers
% 2.90/1.39  Prover 6: Constructing countermodel ...
% 2.90/1.42  Prover 6: gave up
% 2.90/1.42  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all
% 2.90/1.43  Prover 7: Preprocessing ...
% 2.90/1.43  Prover 7: Proving ...
% 3.48/1.62  Prover 7: proved (199ms)
% 3.48/1.62  
% 3.48/1.62  % SZS status Theorem for theBenchmark
% 3.48/1.62  
% 3.48/1.62  Generating proof ... found it (size 15)
% 3.62/1.77  
% 3.62/1.77  % SZS output start Proof for theBenchmark
% 3.62/1.77  Assumed formulas after preprocessing and simplification: 
% 3.62/1.77  | (0)  ? [v0] :  ! [v1] : ( ~ big_p(v1) |  ~ big_r(v0, v1)) &  ! [v0] : big_p(v0) &  ! [v0] :  ? [v1] : big_r(v0, v1)
% 3.62/1.78  | Applying alpha-rule on (0) yields:
% 3.62/1.78  | (1)  ? [v0] :  ! [v1] : ( ~ big_p(v1) |  ~ big_r(v0, v1))
% 3.62/1.78  | (2)  ! [v0] : big_p(v0)
% 3.62/1.78  | (3)  ! [v0] :  ? [v1] : big_r(v0, v1)
% 3.62/1.78  |
% 3.62/1.78  | Instantiating (1) with all_0_0_0 yields:
% 3.62/1.78  | (4)  ! [v0] : ( ~ big_p(v0) |  ~ big_r(all_0_0_0, v0))
% 3.62/1.78  |
% 3.62/1.78  | Introducing new symbol ex_4_0_1 defined by:
% 3.62/1.78  | (5) ex_4_0_1 = all_0_0_0
% 3.62/1.78  |
% 3.62/1.78  | Instantiating formula (3) with ex_4_0_1 yields:
% 3.62/1.78  | (6)  ? [v0] : big_r(ex_4_0_1, v0)
% 3.62/1.78  |
% 3.62/1.78  | Instantiating (6) with all_5_0_2 yields:
% 3.62/1.78  | (7) big_r(ex_4_0_1, all_5_0_2)
% 3.62/1.78  |
% 3.62/1.78  | Introducing new symbol ex_13_0_3 defined by:
% 3.62/1.78  | (8) ex_13_0_3 = all_5_0_2
% 3.62/1.78  |
% 3.62/1.78  | Instantiating formula (2) with ex_13_0_3 yields:
% 3.62/1.78  | (9) big_p(ex_13_0_3)
% 3.62/1.78  |
% 3.62/1.78  | Instantiating formula (4) with all_5_0_2 yields:
% 3.62/1.78  | (10)  ~ big_p(all_5_0_2) |  ~ big_r(all_0_0_0, all_5_0_2)
% 3.62/1.78  |
% 3.62/1.78  +-Applying beta-rule and splitting (10), into two cases.
% 3.62/1.78  |-Branch one:
% 3.62/1.78  | (11)  ~ big_p(all_5_0_2)
% 3.62/1.78  |
% 3.62/1.78  	| From (8) and (9) follows:
% 3.62/1.78  	| (12) big_p(all_5_0_2)
% 3.62/1.78  	|
% 3.62/1.78  	| Using (12) and (11) yields:
% 3.62/1.78  	| (13) $false
% 3.62/1.78  	|
% 3.62/1.78  	|-The branch is then unsatisfiable
% 3.62/1.78  |-Branch two:
% 3.62/1.78  | (14)  ~ big_r(all_0_0_0, all_5_0_2)
% 3.62/1.78  |
% 3.62/1.78  	| From (5) and (7) follows:
% 3.62/1.78  	| (15) big_r(all_0_0_0, all_5_0_2)
% 3.62/1.78  	|
% 3.62/1.78  	| Using (15) and (14) yields:
% 3.62/1.78  	| (13) $false
% 3.62/1.78  	|
% 3.62/1.78  	|-The branch is then unsatisfiable
% 3.62/1.78  % SZS output end Proof for theBenchmark
% 3.62/1.78  
% 3.62/1.78  1185ms
%------------------------------------------------------------------------------