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

View Problem - Process Solution

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

% Computer : n015.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 04:59:37 EDT 2022

% Result   : Theorem 3.91s 1.77s
% Output   : Proof 4.73s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYN066+1 : TPTP v8.1.0. Bugfixed v3.0.0.
% 0.11/0.12  % Command  : ePrincess-casc -timeout=%d %s
% 0.13/0.33  % Computer : n015.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Tue Jul 12 09:19:10 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.56/0.60          ____       _                          
% 0.56/0.60    ___  / __ \_____(_)___  ________  __________
% 0.56/0.60   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.56/0.60  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.56/0.60  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.56/0.60  
% 0.56/0.60  A Theorem Prover for First-Order Logic
% 0.56/0.60  (ePrincess v.1.0)
% 0.56/0.60  
% 0.56/0.60  (c) Philipp Rümmer, 2009-2015
% 0.56/0.60  (c) Peter Backeman, 2014-2015
% 0.56/0.60  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.56/0.60  Free software under GNU Lesser General Public License (LGPL).
% 0.56/0.60  Bug reports to peter@backeman.se
% 0.56/0.60  
% 0.56/0.60  For more information, visit http://user.uu.se/~petba168/breu/
% 0.56/0.60  
% 0.56/0.60  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.69/0.65  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.29/0.90  Prover 0: Preprocessing ...
% 1.38/0.97  Prover 0: Warning: ignoring some quantifiers
% 1.38/0.98  Prover 0: Constructing countermodel ...
% 1.85/1.09  Prover 0: gave up
% 1.85/1.10  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 1.85/1.11  Prover 1: Preprocessing ...
% 1.85/1.17  Prover 1: Warning: ignoring some quantifiers
% 1.85/1.17  Prover 1: Constructing countermodel ...
% 2.17/1.18  Prover 1: gave up
% 2.17/1.18  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.17/1.19  Prover 2: Preprocessing ...
% 2.29/1.22  Prover 2: Warning: ignoring some quantifiers
% 2.37/1.23  Prover 2: Constructing countermodel ...
% 2.37/1.25  Prover 2: gave up
% 2.37/1.25  Prover 3: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.37/1.26  Prover 3: Preprocessing ...
% 2.37/1.27  Prover 3: Warning: ignoring some quantifiers
% 2.37/1.27  Prover 3: Constructing countermodel ...
% 2.37/1.29  Prover 3: gave up
% 2.37/1.29  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete
% 2.37/1.30  Prover 4: Preprocessing ...
% 2.66/1.33  Prover 4: Warning: ignoring some quantifiers
% 2.66/1.34  Prover 4: Constructing countermodel ...
% 2.90/1.43  Prover 4: gave up
% 2.90/1.43  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.90/1.43  Prover 5: Preprocessing ...
% 2.90/1.45  Prover 5: Warning: ignoring some quantifiers
% 2.90/1.45  Prover 5: Constructing countermodel ...
% 2.90/1.46  Prover 5: gave up
% 2.90/1.46  Prover 6: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 2.90/1.46  Prover 6: Preprocessing ...
% 3.22/1.48  Prover 6: Warning: ignoring some quantifiers
% 3.22/1.48  Prover 6: Constructing countermodel ...
% 3.22/1.50  Prover 6: gave up
% 3.22/1.50  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all
% 3.22/1.50  Prover 7: Preprocessing ...
% 3.30/1.51  Prover 7: Proving ...
% 3.91/1.76  Prover 7: proved (268ms)
% 3.91/1.77  
% 3.91/1.77  % SZS status Theorem for theBenchmark
% 3.91/1.77  
% 3.91/1.77  Generating proof ... found it (size 34)
% 4.73/2.04  
% 4.73/2.04  % SZS output start Proof for theBenchmark
% 4.73/2.04  Assumed formulas after preprocessing and simplification: 
% 4.73/2.04  | (0)  ! [v0] :  ! [v1] : (big_p(v0, v1) |  ? [v2] : big_q(v2, v1)) &  ? [v0] :  ! [v1] :  ~ big_r(v0, v1) &  ! [v0] :  ? [v1] :  ! [v2] :  ? [v3] : (big_p(v3, v0) & ( ~ big_p(v3, v1) |  ? [v4] : big_q(v4, v1)) & ( ~ big_p(v2, v0) | big_p(v3, v1))) & ( ! [v0] :  ! [v1] :  ~ big_q(v0, v1) |  ! [v0] : big_r(v0, v0))
% 4.73/2.04  | Applying alpha-rule on (0) yields:
% 4.73/2.04  | (1)  ! [v0] :  ! [v1] : (big_p(v0, v1) |  ? [v2] : big_q(v2, v1))
% 4.73/2.05  | (2)  ? [v0] :  ! [v1] :  ~ big_r(v0, v1)
% 4.73/2.05  | (3)  ! [v0] :  ? [v1] :  ! [v2] :  ? [v3] : (big_p(v3, v0) & ( ~ big_p(v3, v1) |  ? [v4] : big_q(v4, v1)) & ( ~ big_p(v2, v0) | big_p(v3, v1)))
% 4.73/2.05  | (4)  ! [v0] :  ! [v1] :  ~ big_q(v0, v1) |  ! [v0] : big_r(v0, v0)
% 4.73/2.05  |
% 4.73/2.05  | Instantiating (2) with all_0_0_0 yields:
% 4.73/2.05  | (5)  ! [v0] :  ~ big_r(all_0_0_0, v0)
% 4.73/2.05  |
% 4.73/2.05  +-Applying beta-rule and splitting (4), into two cases.
% 4.73/2.05  |-Branch one:
% 4.73/2.05  | (6)  ! [v0] :  ! [v1] :  ~ big_q(v0, v1)
% 4.73/2.05  |
% 4.73/2.05  	| Introducing new symbol ex_8_1_2 defined by:
% 4.73/2.05  	| (7) ex_8_1_2 = arbitrary_constant
% 4.73/2.05  	|
% 4.73/2.05  	| Introducing new symbol ex_8_0_1 defined by:
% 4.73/2.05  	| (8) ex_8_0_1 = arbitrary_constant
% 4.73/2.05  	|
% 4.73/2.05  	| Instantiating formula (1) with ex_8_0_1, ex_8_1_2 yields:
% 4.73/2.05  	| (9) big_p(ex_8_1_2, ex_8_0_1) |  ? [v0] : big_q(v0, ex_8_0_1)
% 4.73/2.05  	|
% 4.73/2.05  	+-Applying beta-rule and splitting (9), into two cases.
% 4.73/2.05  	|-Branch one:
% 4.73/2.05  	| (10) big_p(ex_8_1_2, ex_8_0_1)
% 4.73/2.05  	|
% 4.73/2.05  		| Introducing new symbol ex_17_0_4 defined by:
% 4.73/2.05  		| (11) ex_17_0_4 = arbitrary_constant
% 4.73/2.05  		|
% 4.73/2.05  		| Instantiating formula (3) with ex_17_0_4 yields:
% 4.73/2.05  		| (12)  ? [v0] :  ! [v1] :  ? [v2] : (big_p(v2, ex_17_0_4) & ( ~ big_p(v2, v0) |  ? [v3] : big_q(v3, v0)) & ( ~ big_p(v1, ex_17_0_4) | big_p(v2, v0)))
% 4.73/2.05  		|
% 4.73/2.05  		| Instantiating (12) with all_18_0_5 yields:
% 4.73/2.05  		| (13)  ! [v0] :  ? [v1] : (big_p(v1, ex_17_0_4) & ( ~ big_p(v1, all_18_0_5) |  ? [v2] : big_q(v2, all_18_0_5)) & ( ~ big_p(v0, ex_17_0_4) | big_p(v1, all_18_0_5)))
% 4.73/2.05  		|
% 4.73/2.05  		| Introducing new symbol ex_32_0_11 defined by:
% 4.73/2.05  		| (14) ex_32_0_11 = arbitrary_constant
% 4.73/2.05  		|
% 4.73/2.05  		| Instantiating formula (13) with ex_32_0_11 yields:
% 4.73/2.05  		| (15)  ? [v0] : (big_p(v0, ex_17_0_4) & ( ~ big_p(v0, all_18_0_5) |  ? [v1] : big_q(v1, all_18_0_5)) & ( ~ big_p(ex_32_0_11, ex_17_0_4) | big_p(v0, all_18_0_5)))
% 4.73/2.05  		|
% 4.73/2.05  		| Instantiating (15) with all_33_0_12 yields:
% 4.73/2.05  		| (16) big_p(all_33_0_12, ex_17_0_4) & ( ~ big_p(all_33_0_12, all_18_0_5) |  ? [v0] : big_q(v0, all_18_0_5)) & ( ~ big_p(ex_32_0_11, ex_17_0_4) | big_p(all_33_0_12, all_18_0_5))
% 4.73/2.05  		|
% 4.73/2.05  		| Applying alpha-rule on (16) yields:
% 4.73/2.05  		| (17) big_p(all_33_0_12, ex_17_0_4)
% 4.73/2.05  		| (18)  ~ big_p(all_33_0_12, all_18_0_5) |  ? [v0] : big_q(v0, all_18_0_5)
% 4.73/2.05  		| (19)  ~ big_p(ex_32_0_11, ex_17_0_4) | big_p(all_33_0_12, all_18_0_5)
% 4.73/2.05  		|
% 4.73/2.05  		+-Applying beta-rule and splitting (19), into two cases.
% 4.73/2.05  		|-Branch one:
% 4.73/2.05  		| (20)  ~ big_p(ex_32_0_11, ex_17_0_4)
% 4.73/2.05  		|
% 4.73/2.05  			| From (7)(8) and (10) follows:
% 4.73/2.05  			| (21) big_p(arbitrary_constant, arbitrary_constant)
% 4.73/2.05  			|
% 4.73/2.05  			| From (14)(11) and (20) follows:
% 4.73/2.05  			| (22)  ~ big_p(arbitrary_constant, arbitrary_constant)
% 4.73/2.05  			|
% 4.73/2.05  			| Using (21) and (22) yields:
% 4.73/2.05  			| (23) $false
% 4.73/2.05  			|
% 4.73/2.05  			|-The branch is then unsatisfiable
% 4.73/2.05  		|-Branch two:
% 4.73/2.05  		| (24) big_p(all_33_0_12, all_18_0_5)
% 4.73/2.05  		|
% 4.73/2.05  			+-Applying beta-rule and splitting (18), into two cases.
% 4.73/2.05  			|-Branch one:
% 4.73/2.05  			| (25)  ~ big_p(all_33_0_12, all_18_0_5)
% 4.73/2.05  			|
% 4.73/2.05  				| Using (24) and (25) yields:
% 4.73/2.05  				| (23) $false
% 4.73/2.05  				|
% 4.73/2.05  				|-The branch is then unsatisfiable
% 4.73/2.05  			|-Branch two:
% 4.73/2.05  			| (27)  ? [v0] : big_q(v0, all_18_0_5)
% 4.73/2.05  			|
% 4.73/2.05  				| Instantiating (27) with all_45_0_13 yields:
% 4.73/2.05  				| (28) big_q(all_45_0_13, all_18_0_5)
% 4.73/2.05  				|
% 4.73/2.05  				| Instantiating formula (6) with all_18_0_5, all_45_0_13 and discharging atoms big_q(all_45_0_13, all_18_0_5), yields:
% 4.73/2.05  				| (23) $false
% 4.73/2.05  				|
% 4.73/2.05  				|-The branch is then unsatisfiable
% 4.73/2.05  	|-Branch two:
% 4.73/2.05  	| (30)  ? [v0] : big_q(v0, ex_8_0_1)
% 4.73/2.05  	|
% 4.73/2.05  		| Instantiating (30) with all_10_0_3 yields:
% 4.73/2.05  		| (31) big_q(all_10_0_3, ex_8_0_1)
% 4.73/2.05  		|
% 4.73/2.05  		| Instantiating formula (6) with ex_8_0_1, all_10_0_3 and discharging atoms big_q(all_10_0_3, ex_8_0_1), yields:
% 4.73/2.05  		| (23) $false
% 4.73/2.05  		|
% 4.73/2.05  		|-The branch is then unsatisfiable
% 4.73/2.06  |-Branch two:
% 4.73/2.06  | (33)  ! [v0] : big_r(v0, v0)
% 4.73/2.06  |
% 4.73/2.06  	| Introducing new symbol ex_18_0_19 defined by:
% 4.73/2.06  	| (34) ex_18_0_19 = all_0_0_0
% 4.73/2.06  	|
% 4.73/2.06  	| Instantiating formula (33) with ex_18_0_19 yields:
% 4.73/2.06  	| (35) big_r(ex_18_0_19, ex_18_0_19)
% 4.73/2.06  	|
% 4.73/2.06  	| Instantiating formula (5) with all_0_0_0 yields:
% 4.73/2.06  	| (36)  ~ big_r(all_0_0_0, all_0_0_0)
% 4.73/2.06  	|
% 4.73/2.06  	| From (34)(34) and (35) follows:
% 4.73/2.06  	| (37) big_r(all_0_0_0, all_0_0_0)
% 4.73/2.06  	|
% 4.73/2.06  	| Using (37) and (36) yields:
% 4.73/2.06  	| (23) $false
% 4.73/2.06  	|
% 4.73/2.06  	|-The branch is then unsatisfiable
% 4.73/2.06  % SZS output end Proof for theBenchmark
% 4.73/2.06  
% 4.73/2.06  1448ms
%------------------------------------------------------------------------------