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

View Problem - Process Solution

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

% Computer : n008.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 2.75s 1.39s
% Output   : Proof 3.17s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN379+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12  % Command  : ePrincess-casc -timeout=%d %s
% 0.12/0.33  % Computer : n008.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.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Tue Jul 12 03:56:23 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.52/0.57          ____       _                          
% 0.52/0.57    ___  / __ \_____(_)___  ________  __________
% 0.52/0.57   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.52/0.57  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.52/0.57  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.52/0.57  
% 0.52/0.57  A Theorem Prover for First-Order Logic
% 0.52/0.58  (ePrincess v.1.0)
% 0.52/0.58  
% 0.52/0.58  (c) Philipp Rümmer, 2009-2015
% 0.52/0.58  (c) Peter Backeman, 2014-2015
% 0.52/0.58  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.52/0.58  Free software under GNU Lesser General Public License (LGPL).
% 0.52/0.58  Bug reports to peter@backeman.se
% 0.52/0.58  
% 0.52/0.58  For more information, visit http://user.uu.se/~petba168/breu/
% 0.52/0.58  
% 0.52/0.58  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.52/0.63  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.20/0.87  Prover 0: Preprocessing ...
% 1.20/0.91  Prover 0: Warning: ignoring some quantifiers
% 1.20/0.92  Prover 0: Constructing countermodel ...
% 1.45/1.01  Prover 0: gave up
% 1.45/1.01  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 1.45/1.03  Prover 1: Preprocessing ...
% 1.71/1.07  Prover 1: Constructing countermodel ...
% 1.71/1.07  Prover 1: gave up
% 1.71/1.07  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.86/1.08  Prover 2: Preprocessing ...
% 1.86/1.10  Prover 2: Warning: ignoring some quantifiers
% 1.86/1.11  Prover 2: Constructing countermodel ...
% 2.11/1.15  Prover 2: gave up
% 2.11/1.15  Prover 3: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.11/1.16  Prover 3: Preprocessing ...
% 2.11/1.16  Prover 3: Warning: ignoring some quantifiers
% 2.11/1.16  Prover 3: Constructing countermodel ...
% 2.26/1.18  Prover 3: gave up
% 2.26/1.18  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete
% 2.26/1.18  Prover 4: Preprocessing ...
% 2.26/1.20  Prover 4: Warning: ignoring some quantifiers
% 2.26/1.21  Prover 4: Constructing countermodel ...
% 2.26/1.23  Prover 4: gave up
% 2.26/1.23  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.45/1.24  Prover 5: Preprocessing ...
% 2.45/1.25  Prover 5: Constructing countermodel ...
% 2.45/1.25  Prover 5: gave up
% 2.45/1.25  Prover 6: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 2.45/1.26  Prover 6: Preprocessing ...
% 2.53/1.27  Prover 6: Warning: ignoring some quantifiers
% 2.53/1.27  Prover 6: Constructing countermodel ...
% 2.53/1.29  Prover 6: gave up
% 2.53/1.29  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all
% 2.53/1.30  Prover 7: Preprocessing ...
% 2.53/1.30  Prover 7: Proving ...
% 2.75/1.39  Prover 7: proved (95ms)
% 2.75/1.39  
% 2.75/1.39  % SZS status Theorem for theBenchmark
% 2.75/1.39  
% 2.75/1.39  Generating proof ... found it (size 10)
% 2.99/1.53  
% 2.99/1.53  % SZS output start Proof for theBenchmark
% 2.99/1.53  Assumed formulas after preprocessing and simplification: 
% 2.99/1.53  | (0)  ! [v0] :  ! [v1] :  ! [v2] : big_q(v1, v0, v2) &  ! [v0] :  ! [v1] :  ~ big_q(v0, v0, v1) &  ! [v0] : big_p(v0)
% 2.99/1.53  | Applying alpha-rule on (0) yields:
% 2.99/1.53  | (1)  ! [v0] :  ! [v1] :  ! [v2] : big_q(v1, v0, v2)
% 3.17/1.54  | (2)  ! [v0] :  ! [v1] :  ~ big_q(v0, v0, v1)
% 3.17/1.54  | (3)  ! [v0] : big_p(v0)
% 3.17/1.54  |
% 3.17/1.54  | Introducing new symbol ex_10_2_3 defined by:
% 3.17/1.54  | (4) ex_10_2_3 = arbitrary_constant
% 3.17/1.54  |
% 3.17/1.54  | Introducing new symbol ex_10_1_2 defined by:
% 3.17/1.54  | (5) ex_10_1_2 = arbitrary_constant
% 3.17/1.54  |
% 3.17/1.54  | Introducing new symbol ex_10_0_1 defined by:
% 3.17/1.54  | (6) ex_10_0_1 = arbitrary_constant
% 3.17/1.54  |
% 3.17/1.54  | Instantiating formula (1) with ex_10_0_1, ex_10_1_2, ex_10_2_3 yields:
% 3.17/1.54  | (7) big_q(ex_10_1_2, ex_10_2_3, ex_10_0_1)
% 3.17/1.54  |
% 3.17/1.54  | Instantiating formula (2) with ex_10_0_1, ex_10_2_3 yields:
% 3.17/1.54  | (8)  ~ big_q(ex_10_2_3, ex_10_2_3, ex_10_0_1)
% 3.17/1.54  |
% 3.17/1.54  | From (5)(4)(6) and (7) follows:
% 3.17/1.54  | (9) big_q(arbitrary_constant, arbitrary_constant, arbitrary_constant)
% 3.17/1.54  |
% 3.17/1.54  | From (4)(4)(6) and (8) follows:
% 3.17/1.54  | (10)  ~ big_q(arbitrary_constant, arbitrary_constant, arbitrary_constant)
% 3.17/1.54  |
% 3.17/1.54  | Using (9) and (10) yields:
% 3.17/1.54  | (11) $false
% 3.17/1.54  |
% 3.17/1.54  |-The branch is then unsatisfiable
% 3.17/1.54  % SZS output end Proof for theBenchmark
% 3.17/1.54  
% 3.17/1.54  955ms
%------------------------------------------------------------------------------