↑ Up

ePrincess---1.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ePrincess---1.0
% Problem  : SYN369+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:52 EDT 2022

% Result   : Theorem 3.93s 1.75s
% Output   : Proof 4.91s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN369+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/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.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Tue Jul 12 08:34:38 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.56/0.58          ____       _                          
% 0.56/0.58    ___  / __ \_____(_)___  ________  __________
% 0.56/0.58   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.56/0.58  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.56/0.58  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.56/0.58  
% 0.56/0.58  A Theorem Prover for First-Order Logic
% 0.56/0.58  (ePrincess v.1.0)
% 0.56/0.58  
% 0.56/0.58  (c) Philipp Rümmer, 2009-2015
% 0.56/0.58  (c) Peter Backeman, 2014-2015
% 0.56/0.58  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.56/0.58  Free software under GNU Lesser General Public License (LGPL).
% 0.56/0.58  Bug reports to peter@backeman.se
% 0.56/0.58  
% 0.56/0.58  For more information, visit http://user.uu.se/~petba168/breu/
% 0.56/0.58  
% 0.56/0.58  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.75/0.63  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.24/0.86  Prover 0: Preprocessing ...
% 1.32/0.90  Prover 0: Warning: ignoring some quantifiers
% 1.32/0.91  Prover 0: Constructing countermodel ...
% 1.40/0.99  Prover 0: gave up
% 1.40/1.00  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 1.65/1.01  Prover 1: Preprocessing ...
% 1.65/1.04  Prover 1: Warning: ignoring some quantifiers
% 1.65/1.05  Prover 1: Constructing countermodel ...
% 1.91/1.09  Prover 1: gave up
% 1.91/1.09  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.91/1.10  Prover 2: Preprocessing ...
% 1.91/1.11  Prover 2: Warning: ignoring some quantifiers
% 1.91/1.12  Prover 2: Constructing countermodel ...
% 1.91/1.14  Prover 2: gave up
% 1.91/1.14  Prover 3: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.91/1.15  Prover 3: Preprocessing ...
% 1.91/1.15  Prover 3: Warning: ignoring some quantifiers
% 1.91/1.15  Prover 3: Constructing countermodel ...
% 1.91/1.16  Prover 3: gave up
% 1.91/1.16  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete
% 1.91/1.17  Prover 4: Preprocessing ...
% 2.22/1.19  Prover 4: Warning: ignoring some quantifiers
% 2.22/1.19  Prover 4: Constructing countermodel ...
% 2.40/1.23  Prover 4: gave up
% 2.40/1.23  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.40/1.24  Prover 5: Preprocessing ...
% 2.40/1.24  Prover 5: Warning: ignoring some quantifiers
% 2.40/1.24  Prover 5: Constructing countermodel ...
% 2.40/1.26  Prover 5: gave up
% 2.40/1.26  Prover 6: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 2.40/1.27  Prover 6: Preprocessing ...
% 2.40/1.27  Prover 6: Warning: ignoring some quantifiers
% 2.40/1.28  Prover 6: Constructing countermodel ...
% 2.40/1.29  Prover 6: gave up
% 2.40/1.29  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all
% 2.40/1.30  Prover 7: Preprocessing ...
% 2.40/1.30  Prover 7: Proving ...
% 3.93/1.75  Prover 7: proved (457ms)
% 3.93/1.75  
% 3.93/1.75  % SZS status Theorem for theBenchmark
% 3.93/1.75  
% 3.93/1.75  Generating proof ... found it (size 20)
% 4.91/2.07  
% 4.91/2.07  % SZS output start Proof for theBenchmark
% 4.91/2.07  Assumed formulas after preprocessing and simplification: 
% 4.91/2.07  | (0)  ! [v0] :  ! [v1] :  ! [v2] : (big_p(v1, v2) | big_p(v0, v1)) &  ! [v0] :  ? [v1] :  ~ big_p(v0, v1)
% 4.91/2.07  | Applying alpha-rule on (0) yields:
% 4.91/2.07  | (1)  ! [v0] :  ! [v1] :  ! [v2] : (big_p(v1, v2) | big_p(v0, v1))
% 4.91/2.07  | (2)  ! [v0] :  ? [v1] :  ~ big_p(v0, v1)
% 4.91/2.07  |
% 4.91/2.07  | Introducing new symbol ex_0_0_0 defined by:
% 4.91/2.07  | (3) ex_0_0_0 = arbitrary_constant
% 4.91/2.07  |
% 4.91/2.07  | Instantiating formula (2) with ex_0_0_0 yields:
% 4.91/2.07  | (4)  ? [v0] :  ~ big_p(ex_0_0_0, v0)
% 4.91/2.07  |
% 4.91/2.07  | Instantiating (4) with all_1_0_1 yields:
% 4.91/2.07  | (5)  ~ big_p(ex_0_0_0, all_1_0_1)
% 4.91/2.07  |
% 4.91/2.07  | Introducing new symbol ex_18_0_7 defined by:
% 4.91/2.07  | (6) ex_18_0_7 = all_1_0_1
% 4.91/2.07  |
% 4.91/2.07  | Instantiating formula (2) with ex_18_0_7 yields:
% 4.91/2.07  | (7)  ? [v0] :  ~ big_p(ex_18_0_7, v0)
% 4.91/2.07  |
% 4.91/2.07  | Instantiating (7) with all_19_0_8 yields:
% 4.91/2.07  | (8)  ~ big_p(ex_18_0_7, all_19_0_8)
% 4.91/2.07  |
% 4.91/2.07  | Introducing new symbol ex_27_2_14 defined by:
% 4.91/2.07  | (9) ex_27_2_14 = arbitrary_constant
% 4.91/2.07  |
% 4.91/2.07  | Introducing new symbol ex_27_1_13 defined by:
% 4.91/2.07  | (10) ex_27_1_13 = all_1_0_1
% 4.91/2.07  |
% 4.91/2.07  | Introducing new symbol ex_27_0_12 defined by:
% 4.91/2.07  | (11) ex_27_0_12 = all_19_0_8
% 4.91/2.07  |
% 4.91/2.07  | Instantiating formula (1) with ex_27_0_12, ex_27_1_13, ex_27_2_14 yields:
% 4.91/2.07  | (12) big_p(ex_27_1_13, ex_27_0_12) | big_p(ex_27_2_14, ex_27_1_13)
% 4.91/2.07  |
% 4.91/2.07  +-Applying beta-rule and splitting (12), into two cases.
% 4.91/2.07  |-Branch one:
% 4.91/2.07  | (13) big_p(ex_27_1_13, ex_27_0_12)
% 4.91/2.07  |
% 4.91/2.08  	| From (10)(11) and (13) follows:
% 4.91/2.08  	| (14) big_p(all_1_0_1, all_19_0_8)
% 4.91/2.08  	|
% 4.91/2.08  	| From (6) and (8) follows:
% 4.91/2.08  	| (15)  ~ big_p(all_1_0_1, all_19_0_8)
% 4.91/2.08  	|
% 4.91/2.08  	| Using (14) and (15) yields:
% 4.91/2.08  	| (16) $false
% 4.91/2.08  	|
% 4.91/2.08  	|-The branch is then unsatisfiable
% 4.91/2.08  |-Branch two:
% 4.91/2.08  | (17) big_p(ex_27_2_14, ex_27_1_13)
% 4.91/2.08  |
% 4.91/2.08  	| From (9)(10) and (17) follows:
% 4.91/2.08  	| (18) big_p(arbitrary_constant, all_1_0_1)
% 4.91/2.08  	|
% 4.91/2.08  	| From (3) and (5) follows:
% 4.91/2.08  	| (19)  ~ big_p(arbitrary_constant, all_1_0_1)
% 4.91/2.08  	|
% 4.91/2.08  	| Using (18) and (19) yields:
% 4.91/2.08  	| (16) $false
% 4.91/2.08  	|
% 4.91/2.08  	|-The branch is then unsatisfiable
% 4.91/2.08  % SZS output end Proof for theBenchmark
% 4.91/2.08  
% 4.91/2.08  1486ms
%------------------------------------------------------------------------------