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

View Problem - Process Solution

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

% Computer : n027.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:47 EDT 2022

% Result   : Theorem 3.53s 1.66s
% Output   : Proof 4.12s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SYN360+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.13  % Command  : ePrincess-casc -timeout=%d %s
% 0.13/0.34  % Computer : n027.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 : Mon Jul 11 16:45:19 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.58/0.60          ____       _                          
% 0.58/0.60    ___  / __ \_____(_)___  ________  __________
% 0.58/0.60   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.58/0.60  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.58/0.60  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.58/0.60  
% 0.58/0.60  A Theorem Prover for First-Order Logic
% 0.58/0.60  (ePrincess v.1.0)
% 0.58/0.60  
% 0.58/0.60  (c) Philipp Rümmer, 2009-2015
% 0.58/0.60  (c) Peter Backeman, 2014-2015
% 0.58/0.60  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.58/0.60  Free software under GNU Lesser General Public License (LGPL).
% 0.58/0.60  Bug reports to peter@backeman.se
% 0.58/0.60  
% 0.58/0.60  For more information, visit http://user.uu.se/~petba168/breu/
% 0.58/0.60  
% 0.58/0.60  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.76/0.65  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.26/0.89  Prover 0: Preprocessing ...
% 1.35/0.94  Prover 0: Warning: ignoring some quantifiers
% 1.38/0.95  Prover 0: Constructing countermodel ...
% 1.50/1.05  Prover 0: gave up
% 1.50/1.05  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 1.50/1.07  Prover 1: Preprocessing ...
% 1.77/1.11  Prover 1: Warning: ignoring some quantifiers
% 1.77/1.11  Prover 1: Constructing countermodel ...
% 1.77/1.15  Prover 1: gave up
% 1.77/1.15  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.77/1.16  Prover 2: Preprocessing ...
% 2.04/1.18  Prover 2: Warning: ignoring some quantifiers
% 2.04/1.18  Prover 2: Constructing countermodel ...
% 2.17/1.21  Prover 2: gave up
% 2.17/1.21  Prover 3: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.17/1.22  Prover 3: Preprocessing ...
% 2.17/1.22  Prover 3: Warning: ignoring some quantifiers
% 2.17/1.22  Prover 3: Constructing countermodel ...
% 2.29/1.24  Prover 3: gave up
% 2.29/1.24  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete
% 2.29/1.25  Prover 4: Preprocessing ...
% 2.29/1.27  Prover 4: Warning: ignoring some quantifiers
% 2.29/1.27  Prover 4: Constructing countermodel ...
% 2.29/1.31  Prover 4: gave up
% 2.29/1.31  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.29/1.31  Prover 5: Preprocessing ...
% 2.29/1.33  Prover 5: Warning: ignoring some quantifiers
% 2.29/1.33  Prover 5: Constructing countermodel ...
% 2.62/1.35  Prover 5: gave up
% 2.62/1.35  Prover 6: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 2.62/1.35  Prover 6: Preprocessing ...
% 2.62/1.37  Prover 6: Warning: ignoring some quantifiers
% 2.62/1.37  Prover 6: Constructing countermodel ...
% 2.62/1.39  Prover 6: gave up
% 2.62/1.39  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all
% 2.62/1.39  Prover 7: Preprocessing ...
% 2.62/1.40  Prover 7: Proving ...
% 3.53/1.66  Prover 7: proved (269ms)
% 3.53/1.66  
% 3.53/1.66  % SZS status Theorem for theBenchmark
% 3.53/1.66  
% 3.53/1.66  Generating proof ... found it (size 18)
% 3.97/1.87  
% 3.97/1.87  % SZS output start Proof for theBenchmark
% 3.97/1.87  Assumed formulas after preprocessing and simplification: 
% 3.97/1.87  | (0)  ! [v0] : ( ! [v1] : big_q(v0, v1) |  ! [v1] :  ~ big_p(v0, v1)) &  ! [v0] :  ? [v1] : big_p(v0, v1) &  ? [v0] :  ? [v1] :  ~ big_q(v1, v0)
% 3.97/1.88  | Applying alpha-rule on (0) yields:
% 3.97/1.88  | (1)  ! [v0] : ( ! [v1] : big_q(v0, v1) |  ! [v1] :  ~ big_p(v0, v1))
% 3.97/1.88  | (2)  ! [v0] :  ? [v1] : big_p(v0, v1)
% 3.97/1.88  | (3)  ? [v0] :  ? [v1] :  ~ big_q(v1, v0)
% 3.97/1.88  |
% 3.97/1.88  | Instantiating (3) with all_0_0_0, all_0_1_1 yields:
% 3.97/1.88  | (4)  ~ big_q(all_0_0_0, all_0_1_1)
% 3.97/1.88  |
% 3.97/1.88  | Introducing new symbol ex_8_0_2 defined by:
% 3.97/1.88  | (5) ex_8_0_2 = all_0_0_0
% 3.97/1.88  |
% 3.97/1.88  | Instantiating formula (1) with ex_8_0_2 yields:
% 3.97/1.88  | (6)  ! [v0] : big_q(ex_8_0_2, v0) |  ! [v0] :  ~ big_p(ex_8_0_2, v0)
% 3.97/1.88  |
% 3.97/1.88  +-Applying beta-rule and splitting (6), into two cases.
% 3.97/1.88  |-Branch one:
% 3.97/1.88  | (7)  ! [v0] : big_q(ex_8_0_2, v0)
% 3.97/1.88  |
% 3.97/1.88  	| Introducing new symbol ex_23_0_6 defined by:
% 3.97/1.88  	| (8) ex_23_0_6 = all_0_1_1
% 3.97/1.88  	|
% 3.97/1.88  	| Instantiating formula (7) with ex_23_0_6 yields:
% 3.97/1.88  	| (9) big_q(ex_8_0_2, ex_23_0_6)
% 4.12/1.88  	|
% 4.12/1.88  	| From (5)(8) and (9) follows:
% 4.12/1.88  	| (10) big_q(all_0_0_0, all_0_1_1)
% 4.12/1.88  	|
% 4.12/1.88  	| Using (10) and (4) yields:
% 4.12/1.88  	| (11) $false
% 4.12/1.88  	|
% 4.12/1.88  	|-The branch is then unsatisfiable
% 4.12/1.88  |-Branch two:
% 4.12/1.88  | (12)  ! [v0] :  ~ big_p(ex_8_0_2, v0)
% 4.12/1.88  |
% 4.12/1.88  	| Introducing new symbol ex_13_0_7 defined by:
% 4.12/1.88  	| (13) ex_13_0_7 = all_0_0_0
% 4.12/1.88  	|
% 4.12/1.88  	| Instantiating formula (2) with ex_13_0_7 yields:
% 4.12/1.88  	| (14)  ? [v0] : big_p(ex_13_0_7, v0)
% 4.12/1.88  	|
% 4.12/1.88  	| Instantiating (14) with all_14_0_8 yields:
% 4.12/1.88  	| (15) big_p(ex_13_0_7, all_14_0_8)
% 4.12/1.88  	|
% 4.12/1.88  	| Instantiating formula (12) with all_14_0_8 yields:
% 4.12/1.88  	| (16)  ~ big_p(ex_8_0_2, all_14_0_8)
% 4.12/1.88  	|
% 4.12/1.88  	| From (13) and (15) follows:
% 4.12/1.88  	| (17) big_p(all_0_0_0, all_14_0_8)
% 4.12/1.88  	|
% 4.12/1.88  	| From (5) and (16) follows:
% 4.12/1.88  	| (18)  ~ big_p(all_0_0_0, all_14_0_8)
% 4.12/1.88  	|
% 4.12/1.88  	| Using (17) and (18) yields:
% 4.12/1.88  	| (11) $false
% 4.12/1.88  	|
% 4.12/1.88  	|-The branch is then unsatisfiable
% 4.12/1.88  % SZS output end Proof for theBenchmark
% 4.12/1.89  
% 4.12/1.89  1277ms
%------------------------------------------------------------------------------