TSTP Solution File: LCL678+1.001 by ePrincess---1.0

View Problem - Process Solution

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

% Computer : n009.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 : Sun Jul 17 09:38:21 EDT 2022

% Result   : Theorem 6.32s 2.26s
% Output   : Proof 6.98s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL678+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : ePrincess-casc -timeout=%d %s
% 0.12/0.33  % Computer : n009.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 : Sun Jul  3 06:57:07 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.58/0.58          ____       _                          
% 0.58/0.58    ___  / __ \_____(_)___  ________  __________
% 0.58/0.58   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.58/0.58  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.58/0.58  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.58/0.58  
% 0.58/0.58  A Theorem Prover for First-Order Logic
% 0.58/0.58  (ePrincess v.1.0)
% 0.58/0.58  
% 0.58/0.58  (c) Philipp Rümmer, 2009-2015
% 0.58/0.58  (c) Peter Backeman, 2014-2015
% 0.58/0.58  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.58/0.58  Free software under GNU Lesser General Public License (LGPL).
% 0.58/0.58  Bug reports to peter@backeman.se
% 0.58/0.58  
% 0.58/0.58  For more information, visit http://user.uu.se/~petba168/breu/
% 0.58/0.58  
% 0.58/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.34/0.89  Prover 0: Preprocessing ...
% 1.45/0.94  Prover 0: Warning: ignoring some quantifiers
% 1.50/0.96  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.86/1.09  Prover 1: Preprocessing ...
% 2.18/1.18  Prover 1: Constructing countermodel ...
% 2.26/1.19  Prover 1: gave up
% 2.26/1.19  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.26/1.20  Prover 2: Preprocessing ...
% 2.41/1.25  Prover 2: Warning: ignoring some quantifiers
% 2.41/1.25  Prover 2: Constructing countermodel ...
% 2.41/1.27  Prover 2: gave up
% 2.41/1.27  Prover 3: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.41/1.28  Prover 3: Preprocessing ...
% 2.41/1.29  Prover 3: Warning: ignoring some quantifiers
% 2.41/1.29  Prover 3: Constructing countermodel ...
% 2.59/1.31  Prover 3: gave up
% 2.59/1.31  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete
% 2.59/1.32  Prover 4: Preprocessing ...
% 2.79/1.37  Prover 4: Warning: ignoring some quantifiers
% 2.79/1.37  Prover 4: Constructing countermodel ...
% 5.63/2.07  Prover 4: gave up
% 5.63/2.07  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 5.63/2.08  Prover 5: Preprocessing ...
% 5.71/2.10  Prover 5: Constructing countermodel ...
% 5.71/2.10  Prover 5: gave up
% 5.71/2.10  Prover 6: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 5.71/2.11  Prover 6: Preprocessing ...
% 5.84/2.12  Prover 6: Warning: ignoring some quantifiers
% 5.84/2.13  Prover 6: Constructing countermodel ...
% 5.84/2.13  Prover 6: gave up
% 5.84/2.13  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all
% 5.84/2.14  Prover 7: Preprocessing ...
% 5.96/2.14  Prover 7: Proving ...
% 6.32/2.26  Prover 7: proved (131ms)
% 6.32/2.26  
% 6.32/2.26  % SZS status Theorem for theBenchmark
% 6.32/2.26  
% 6.32/2.26  Generating proof ... found it (size 15)
% 6.98/2.41  
% 6.98/2.41  % SZS output start Proof for theBenchmark
% 6.98/2.41  Assumed formulas after preprocessing and simplification: 
% 6.98/2.41  | (0)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ r1(v1, v2) |  ~ r1(v0, v1) | r1(v0, v2)) &  ? [v0] :  ! [v1] : ( ~ r1(v0, v1) |  ? [v2] : (r1(v1, v2) &  ! [v3] : ( ~ r1(v2, v3) | p1(v3)) &  ? [v3] : (r1(v2, v3) &  ~ p1(v3)))) &  ! [v0] : r1(v0, v0)
% 6.98/2.41  | Applying alpha-rule on (0) yields:
% 6.98/2.41  | (1)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ r1(v1, v2) |  ~ r1(v0, v1) | r1(v0, v2))
% 6.98/2.41  | (2)  ? [v0] :  ! [v1] : ( ~ r1(v0, v1) |  ? [v2] : (r1(v1, v2) &  ! [v3] : ( ~ r1(v2, v3) | p1(v3)) &  ? [v3] : (r1(v2, v3) &  ~ p1(v3))))
% 6.98/2.41  | (3)  ! [v0] : r1(v0, v0)
% 6.98/2.41  |
% 6.98/2.41  | Instantiating (2) with all_1_0_0 yields:
% 6.98/2.41  | (4)  ! [v0] : ( ~ r1(all_1_0_0, v0) |  ? [v1] : (r1(v0, v1) &  ! [v2] : ( ~ r1(v1, v2) | p1(v2)) &  ? [v2] : (r1(v1, v2) &  ~ p1(v2))))
% 6.98/2.41  |
% 6.98/2.41  | Introducing new symbol ex_5_0_1 defined by:
% 6.98/2.41  | (5) ex_5_0_1 = all_1_0_0
% 6.98/2.41  |
% 6.98/2.41  | Instantiating formula (3) with ex_5_0_1 yields:
% 6.98/2.41  | (6) r1(ex_5_0_1, ex_5_0_1)
% 6.98/2.41  |
% 6.98/2.41  | Instantiating formula (4) with all_1_0_0 yields:
% 6.98/2.41  | (7)  ~ r1(all_1_0_0, all_1_0_0) |  ? [v0] : (r1(all_1_0_0, v0) &  ! [v1] : ( ~ r1(v0, v1) | p1(v1)) &  ? [v1] : (r1(v0, v1) &  ~ p1(v1)))
% 6.98/2.42  |
% 6.98/2.42  +-Applying beta-rule and splitting (7), into two cases.
% 6.98/2.42  |-Branch one:
% 6.98/2.42  | (8)  ~ r1(all_1_0_0, all_1_0_0)
% 6.98/2.42  |
% 6.98/2.42  	| From (5)(5) and (6) follows:
% 6.98/2.42  	| (9) r1(all_1_0_0, all_1_0_0)
% 6.98/2.42  	|
% 6.98/2.42  	| Using (9) and (8) yields:
% 6.98/2.42  	| (10) $false
% 6.98/2.42  	|
% 6.98/2.42  	|-The branch is then unsatisfiable
% 6.98/2.42  |-Branch two:
% 6.98/2.42  | (11)  ? [v0] : (r1(all_1_0_0, v0) &  ! [v1] : ( ~ r1(v0, v1) | p1(v1)) &  ? [v1] : (r1(v0, v1) &  ~ p1(v1)))
% 6.98/2.42  |
% 6.98/2.42  	| Instantiating (11) with all_13_0_2 yields:
% 6.98/2.42  	| (12) r1(all_1_0_0, all_13_0_2) &  ! [v0] : ( ~ r1(all_13_0_2, v0) | p1(v0)) &  ? [v0] : (r1(all_13_0_2, v0) &  ~ p1(v0))
% 6.98/2.42  	|
% 6.98/2.42  	| Applying alpha-rule on (12) yields:
% 6.98/2.42  	| (13) r1(all_1_0_0, all_13_0_2)
% 6.98/2.42  	| (14)  ! [v0] : ( ~ r1(all_13_0_2, v0) | p1(v0))
% 6.98/2.42  	| (15)  ? [v0] : (r1(all_13_0_2, v0) &  ~ p1(v0))
% 6.98/2.42  	|
% 6.98/2.42  	| Instantiating (15) with all_16_0_3 yields:
% 6.98/2.42  	| (16) r1(all_13_0_2, all_16_0_3) &  ~ p1(all_16_0_3)
% 6.98/2.42  	|
% 6.98/2.42  	| Applying alpha-rule on (16) yields:
% 6.98/2.42  	| (17) r1(all_13_0_2, all_16_0_3)
% 6.98/2.42  	| (18)  ~ p1(all_16_0_3)
% 6.98/2.42  	|
% 6.98/2.42  	| Instantiating formula (14) with all_16_0_3 and discharging atoms r1(all_13_0_2, all_16_0_3),  ~ p1(all_16_0_3), yields:
% 6.98/2.42  	| (10) $false
% 6.98/2.42  	|
% 6.98/2.42  	|-The branch is then unsatisfiable
% 6.98/2.42  % SZS output end Proof for theBenchmark
% 6.98/2.42  
% 6.98/2.42  1833ms
%------------------------------------------------------------------------------