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

View Problem - Process Solution

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

% Computer : n014.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:57 EDT 2022

% Result   : Theorem 3.15s 1.59s
% Output   : Proof 3.75s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SYN380+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.13  % Command  : ePrincess-casc -timeout=%d %s
% 0.13/0.34  % Computer : n014.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue Jul 12 04:31:49 EDT 2022
% 0.19/0.34  % CPUTime  : 
% 0.59/0.59          ____       _                          
% 0.59/0.59    ___  / __ \_____(_)___  ________  __________
% 0.59/0.59   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.59/0.59  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.59/0.59  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.59/0.59  
% 0.59/0.59  A Theorem Prover for First-Order Logic
% 0.59/0.59  (ePrincess v.1.0)
% 0.59/0.59  
% 0.59/0.59  (c) Philipp Rümmer, 2009-2015
% 0.59/0.59  (c) Peter Backeman, 2014-2015
% 0.59/0.59  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.59/0.59  Free software under GNU Lesser General Public License (LGPL).
% 0.59/0.59  Bug reports to peter@backeman.se
% 0.59/0.59  
% 0.59/0.59  For more information, visit http://user.uu.se/~petba168/breu/
% 0.59/0.59  
% 0.59/0.59  Loading /export/starexec/sandbox/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.24/0.89  Prover 0: Preprocessing ...
% 1.33/0.94  Prover 0: Warning: ignoring some quantifiers
% 1.36/0.95  Prover 0: Constructing countermodel ...
% 1.49/1.05  Prover 0: gave up
% 1.49/1.05  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 1.49/1.07  Prover 1: Preprocessing ...
% 1.77/1.11  Prover 1: Constructing countermodel ...
% 1.77/1.12  Prover 1: gave up
% 1.77/1.12  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.77/1.13  Prover 2: Preprocessing ...
% 1.77/1.16  Prover 2: Warning: ignoring some quantifiers
% 1.77/1.16  Prover 2: Constructing countermodel ...
% 2.09/1.18  Prover 2: gave up
% 2.09/1.19  Prover 3: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.09/1.19  Prover 3: Preprocessing ...
% 2.09/1.20  Prover 3: Warning: ignoring some quantifiers
% 2.09/1.20  Prover 3: Constructing countermodel ...
% 2.22/1.21  Prover 3: gave up
% 2.22/1.22  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete
% 2.22/1.22  Prover 4: Preprocessing ...
% 2.33/1.25  Prover 4: Warning: ignoring some quantifiers
% 2.33/1.26  Prover 4: Constructing countermodel ...
% 2.33/1.29  Prover 4: gave up
% 2.33/1.29  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.33/1.30  Prover 5: Preprocessing ...
% 2.33/1.32  Prover 5: Constructing countermodel ...
% 2.33/1.32  Prover 5: gave up
% 2.33/1.32  Prover 6: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 2.33/1.32  Prover 6: Preprocessing ...
% 2.60/1.34  Prover 6: Warning: ignoring some quantifiers
% 2.60/1.34  Prover 6: Constructing countermodel ...
% 2.60/1.35  Prover 6: gave up
% 2.60/1.35  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all
% 2.60/1.36  Prover 7: Preprocessing ...
% 2.60/1.36  Prover 7: Proving ...
% 3.15/1.59  Prover 7: proved (239ms)
% 3.15/1.59  
% 3.15/1.59  % SZS status Theorem for theBenchmark
% 3.15/1.59  
% 3.15/1.59  Generating proof ... found it (size 25)
% 3.75/1.84  
% 3.75/1.84  % SZS output start Proof for theBenchmark
% 3.75/1.84  Assumed formulas after preprocessing and simplification: 
% 3.75/1.84  | (0)  ! [v0] :  ! [v1] : (big_r(v0, v1) | (big_q(v1, v0) &  ? [v2] :  ~ big_q(v2, v2))) &  ! [v0] :  ~ big_r(v0, v0)
% 3.75/1.84  | Applying alpha-rule on (0) yields:
% 3.75/1.84  | (1)  ! [v0] :  ! [v1] : (big_r(v0, v1) | (big_q(v1, v0) &  ? [v2] :  ~ big_q(v2, v2)))
% 3.75/1.84  | (2)  ! [v0] :  ~ big_r(v0, v0)
% 3.75/1.84  |
% 3.75/1.84  | Introducing new symbol ex_2_1_1 defined by:
% 3.75/1.84  | (3) ex_2_1_1 = arbitrary_constant
% 3.75/1.84  |
% 3.75/1.84  | Introducing new symbol ex_2_0_0 defined by:
% 3.75/1.84  | (4) ex_2_0_0 = arbitrary_constant
% 3.75/1.84  |
% 3.75/1.84  | Instantiating formula (1) with ex_2_0_0, ex_2_1_1 yields:
% 3.75/1.84  | (5) big_r(ex_2_1_1, ex_2_0_0) | (big_q(ex_2_0_0, ex_2_1_1) &  ? [v0] :  ~ big_q(v0, v0))
% 3.75/1.84  |
% 3.75/1.84  +-Applying beta-rule and splitting (5), into two cases.
% 3.75/1.84  |-Branch one:
% 3.75/1.84  | (6) big_r(ex_2_1_1, ex_2_0_0)
% 3.75/1.84  |
% 3.75/1.84  	| Instantiating formula (2) with ex_2_1_1 yields:
% 3.75/1.84  	| (7)  ~ big_r(ex_2_1_1, ex_2_1_1)
% 3.75/1.84  	|
% 3.75/1.84  	| From (3)(4) and (6) follows:
% 3.75/1.84  	| (8) big_r(arbitrary_constant, arbitrary_constant)
% 3.75/1.84  	|
% 3.75/1.84  	| From (3)(3) and (7) follows:
% 3.75/1.84  	| (9)  ~ big_r(arbitrary_constant, arbitrary_constant)
% 3.75/1.84  	|
% 3.75/1.84  	| Using (8) and (9) yields:
% 3.75/1.84  	| (10) $false
% 3.75/1.84  	|
% 3.75/1.84  	|-The branch is then unsatisfiable
% 3.75/1.84  |-Branch two:
% 3.75/1.84  | (11) big_q(ex_2_0_0, ex_2_1_1) &  ? [v0] :  ~ big_q(v0, v0)
% 3.75/1.84  |
% 3.75/1.84  	| Applying alpha-rule on (11) yields:
% 3.75/1.84  	| (12) big_q(ex_2_0_0, ex_2_1_1)
% 3.75/1.85  	| (13)  ? [v0] :  ~ big_q(v0, v0)
% 3.75/1.85  	|
% 3.75/1.85  	| Instantiating (13) with all_5_0_2 yields:
% 3.75/1.85  	| (14)  ~ big_q(all_5_0_2, all_5_0_2)
% 3.75/1.85  	|
% 3.75/1.85  	| Introducing new symbol ex_13_1_4 defined by:
% 3.75/1.85  	| (15) ex_13_1_4 = all_5_0_2
% 3.75/1.85  	|
% 3.75/1.85  	| Introducing new symbol ex_13_0_3 defined by:
% 3.75/1.85  	| (16) ex_13_0_3 = all_5_0_2
% 3.75/1.85  	|
% 3.75/1.85  	| Instantiating formula (1) with ex_13_0_3, ex_13_1_4 yields:
% 3.75/1.85  	| (17) big_r(ex_13_1_4, ex_13_0_3) | (big_q(ex_13_0_3, ex_13_1_4) &  ? [v0] :  ~ big_q(v0, v0))
% 3.75/1.85  	|
% 3.75/1.85  	+-Applying beta-rule and splitting (17), into two cases.
% 3.75/1.85  	|-Branch one:
% 3.75/1.85  	| (18) big_r(ex_13_1_4, ex_13_0_3)
% 3.75/1.85  	|
% 3.75/1.85  		| Instantiating formula (2) with ex_13_1_4 yields:
% 3.75/1.85  		| (19)  ~ big_r(ex_13_1_4, ex_13_1_4)
% 3.75/1.85  		|
% 3.75/1.85  		| From (15)(16) and (18) follows:
% 3.75/1.85  		| (20) big_r(all_5_0_2, all_5_0_2)
% 3.75/1.85  		|
% 3.75/1.85  		| From (15)(15) and (19) follows:
% 3.75/1.85  		| (21)  ~ big_r(all_5_0_2, all_5_0_2)
% 3.75/1.85  		|
% 3.75/1.85  		| Using (20) and (21) yields:
% 3.75/1.85  		| (10) $false
% 3.75/1.85  		|
% 3.75/1.85  		|-The branch is then unsatisfiable
% 3.75/1.85  	|-Branch two:
% 3.75/1.85  	| (23) big_q(ex_13_0_3, ex_13_1_4) &  ? [v0] :  ~ big_q(v0, v0)
% 3.75/1.85  	|
% 3.75/1.85  		| Applying alpha-rule on (23) yields:
% 3.75/1.85  		| (24) big_q(ex_13_0_3, ex_13_1_4)
% 3.75/1.85  		| (13)  ? [v0] :  ~ big_q(v0, v0)
% 3.75/1.85  		|
% 3.75/1.85  		| From (16)(15) and (24) follows:
% 3.75/1.85  		| (26) big_q(all_5_0_2, all_5_0_2)
% 3.75/1.85  		|
% 3.75/1.85  		| Using (26) and (14) yields:
% 3.75/1.85  		| (10) $false
% 3.75/1.85  		|
% 3.75/1.85  		|-The branch is then unsatisfiable
% 3.75/1.85  % SZS output end Proof for theBenchmark
% 3.75/1.85  
% 3.75/1.85  1248ms
%------------------------------------------------------------------------------