↑ Up

ePrincess---1.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ePrincess---1.0
% Problem  : SYN363+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : ePrincess-casc -timeout=%d %s

% Computer : n020.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:49 EDT 2022

% Result   : Theorem 3.34s 1.60s
% Output   : Proof 3.89s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN363+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13  % Command  : ePrincess-casc -timeout=%d %s
% 0.13/0.34  % Computer : n020.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 13:16:42 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.60/0.60          ____       _                          
% 0.60/0.60    ___  / __ \_____(_)___  ________  __________
% 0.60/0.60   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.60/0.60  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.60/0.60  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.60/0.60  
% 0.60/0.60  A Theorem Prover for First-Order Logic
% 0.60/0.60  (ePrincess v.1.0)
% 0.60/0.60  
% 0.60/0.60  (c) Philipp Rümmer, 2009-2015
% 0.60/0.60  (c) Peter Backeman, 2014-2015
% 0.60/0.60  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.60/0.60  Free software under GNU Lesser General Public License (LGPL).
% 0.60/0.60  Bug reports to peter@backeman.se
% 0.60/0.60  
% 0.60/0.60  For more information, visit http://user.uu.se/~petba168/breu/
% 0.60/0.60  
% 0.60/0.60  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.72/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.33/0.92  Prover 0: Warning: ignoring some quantifiers
% 1.39/0.94  Prover 0: Constructing countermodel ...
% 1.62/1.06  Prover 0: gave up
% 1.62/1.06  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 1.62/1.08  Prover 1: Preprocessing ...
% 1.88/1.11  Prover 1: Warning: ignoring some quantifiers
% 1.88/1.11  Prover 1: Constructing countermodel ...
% 1.88/1.15  Prover 1: gave up
% 1.88/1.15  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.88/1.16  Prover 2: Preprocessing ...
% 1.88/1.18  Prover 2: Warning: ignoring some quantifiers
% 2.21/1.18  Prover 2: Constructing countermodel ...
% 2.23/1.21  Prover 2: gave up
% 2.23/1.21  Prover 3: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.23/1.22  Prover 3: Preprocessing ...
% 2.36/1.22  Prover 3: Warning: ignoring some quantifiers
% 2.36/1.22  Prover 3: Constructing countermodel ...
% 2.42/1.25  Prover 3: gave up
% 2.42/1.25  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete
% 2.42/1.25  Prover 4: Preprocessing ...
% 2.42/1.28  Prover 4: Warning: ignoring some quantifiers
% 2.42/1.28  Prover 4: Constructing countermodel ...
% 2.73/1.33  Prover 4: gave up
% 2.73/1.33  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.73/1.33  Prover 5: Preprocessing ...
% 2.73/1.35  Prover 5: Warning: ignoring some quantifiers
% 2.73/1.35  Prover 5: Constructing countermodel ...
% 2.73/1.37  Prover 5: gave up
% 2.73/1.37  Prover 6: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 2.93/1.38  Prover 6: Preprocessing ...
% 2.93/1.38  Prover 6: Warning: ignoring some quantifiers
% 2.93/1.39  Prover 6: Constructing countermodel ...
% 2.93/1.40  Prover 6: gave up
% 2.93/1.40  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all
% 2.93/1.41  Prover 7: Preprocessing ...
% 2.93/1.41  Prover 7: Proving ...
% 3.34/1.60  Prover 7: proved (198ms)
% 3.34/1.60  
% 3.34/1.60  % SZS status Theorem for theBenchmark
% 3.34/1.60  
% 3.34/1.60  Generating proof ... found it (size 19)
% 3.89/1.78  
% 3.89/1.78  % SZS output start Proof for theBenchmark
% 3.89/1.78  Assumed formulas after preprocessing and simplification: 
% 3.89/1.78  | (0)  ? [v0] :  ? [v1] : ( ! [v2] : big_r(v2, v1) &  ! [v2] : (big_r(v0, v2) |  ! [v3] :  ~ big_r(v2, v3)) &  ! [v2] :  ? [v3] :  ~ big_r(v2, v3))
% 3.89/1.78  | Instantiating (0) with all_0_0_0, all_0_1_1 yields:
% 3.89/1.78  | (1)  ! [v0] : big_r(v0, all_0_0_0) &  ! [v0] : (big_r(all_0_1_1, v0) |  ! [v1] :  ~ big_r(v0, v1)) &  ! [v0] :  ? [v1] :  ~ big_r(v0, v1)
% 3.89/1.78  |
% 3.89/1.78  | Applying alpha-rule on (1) yields:
% 3.89/1.78  | (2)  ! [v0] : big_r(v0, all_0_0_0)
% 3.89/1.78  | (3)  ! [v0] : (big_r(all_0_1_1, v0) |  ! [v1] :  ~ big_r(v0, v1))
% 3.89/1.78  | (4)  ! [v0] :  ? [v1] :  ~ big_r(v0, v1)
% 3.89/1.79  |
% 3.89/1.79  | Introducing new symbol ex_2_0_2 defined by:
% 3.89/1.79  | (5) ex_2_0_2 = all_0_1_1
% 3.89/1.79  |
% 3.89/1.79  | Instantiating formula (4) with ex_2_0_2 yields:
% 3.89/1.79  | (6)  ? [v0] :  ~ big_r(ex_2_0_2, v0)
% 3.89/1.79  |
% 3.89/1.79  | Instantiating (6) with all_3_0_3 yields:
% 3.89/1.79  | (7)  ~ big_r(ex_2_0_2, all_3_0_3)
% 3.89/1.79  |
% 3.89/1.79  | Introducing new symbol ex_11_0_4 defined by:
% 3.89/1.79  | (8) ex_11_0_4 = all_3_0_3
% 3.89/1.79  |
% 3.89/1.79  | Instantiating formula (3) with ex_11_0_4 yields:
% 3.89/1.79  | (9) big_r(all_0_1_1, ex_11_0_4) |  ! [v0] :  ~ big_r(ex_11_0_4, v0)
% 3.89/1.79  |
% 3.89/1.79  +-Applying beta-rule and splitting (9), into two cases.
% 3.89/1.79  |-Branch one:
% 3.89/1.79  | (10) big_r(all_0_1_1, ex_11_0_4)
% 3.89/1.79  |
% 3.89/1.79  	| From (8) and (10) follows:
% 3.89/1.79  	| (11) big_r(all_0_1_1, all_3_0_3)
% 3.89/1.79  	|
% 3.89/1.79  	| From (5) and (7) follows:
% 3.89/1.79  	| (12)  ~ big_r(all_0_1_1, all_3_0_3)
% 3.89/1.79  	|
% 3.89/1.79  	| Using (11) and (12) yields:
% 3.89/1.79  	| (13) $false
% 3.89/1.79  	|
% 3.89/1.79  	|-The branch is then unsatisfiable
% 3.89/1.79  |-Branch two:
% 3.89/1.79  | (14)  ! [v0] :  ~ big_r(ex_11_0_4, v0)
% 3.89/1.79  |
% 3.89/1.79  	| Introducing new symbol ex_16_0_5 defined by:
% 3.89/1.79  	| (15) ex_16_0_5 = all_3_0_3
% 3.89/1.79  	|
% 3.89/1.79  	| Instantiating formula (2) with ex_16_0_5 yields:
% 3.89/1.79  	| (16) big_r(ex_16_0_5, all_0_0_0)
% 3.89/1.79  	|
% 3.89/1.79  	| Instantiating formula (14) with all_0_0_0 yields:
% 3.89/1.79  	| (17)  ~ big_r(ex_11_0_4, all_0_0_0)
% 3.89/1.79  	|
% 3.89/1.79  	| From (15) and (16) follows:
% 3.89/1.79  	| (18) big_r(all_3_0_3, all_0_0_0)
% 3.89/1.79  	|
% 3.89/1.79  	| From (8) and (17) follows:
% 3.89/1.79  	| (19)  ~ big_r(all_3_0_3, all_0_0_0)
% 3.89/1.79  	|
% 3.89/1.79  	| Using (18) and (19) yields:
% 3.89/1.79  	| (13) $false
% 3.89/1.79  	|
% 3.89/1.79  	|-The branch is then unsatisfiable
% 3.89/1.79  % SZS output end Proof for theBenchmark
% 3.89/1.79  
% 3.89/1.79  1186ms
%------------------------------------------------------------------------------