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

View Problem - Process Solution

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

% Computer : n023.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:04:46 EDT 2022

% Result   : Theorem 3.53s 1.67s
% Output   : Proof 3.97s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SYN730+1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12  % Command  : ePrincess-casc -timeout=%d %s
% 0.11/0.32  % Computer : n023.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Mon Jul 11 17:47:54 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.51/0.62          ____       _                          
% 0.51/0.62    ___  / __ \_____(_)___  ________  __________
% 0.51/0.62   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.51/0.62  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.51/0.62  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.51/0.62  
% 0.51/0.62  A Theorem Prover for First-Order Logic
% 0.65/0.62  (ePrincess v.1.0)
% 0.65/0.62  
% 0.65/0.62  (c) Philipp Rümmer, 2009-2015
% 0.65/0.62  (c) Peter Backeman, 2014-2015
% 0.65/0.62  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.65/0.62  Free software under GNU Lesser General Public License (LGPL).
% 0.65/0.62  Bug reports to peter@backeman.se
% 0.65/0.62  
% 0.65/0.62  For more information, visit http://user.uu.se/~petba168/breu/
% 0.65/0.62  
% 0.65/0.62  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.73/0.68  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.20/0.91  Prover 0: Preprocessing ...
% 1.42/0.96  Prover 0: Warning: ignoring some quantifiers
% 1.42/0.98  Prover 0: Constructing countermodel ...
% 1.80/1.10  Prover 0: gave up
% 1.80/1.10  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 1.80/1.11  Prover 1: Preprocessing ...
% 1.80/1.15  Prover 1: Warning: ignoring some quantifiers
% 1.80/1.15  Prover 1: Constructing countermodel ...
% 2.10/1.20  Prover 1: gave up
% 2.10/1.20  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.10/1.20  Prover 2: Preprocessing ...
% 2.27/1.23  Prover 2: Warning: ignoring some quantifiers
% 2.27/1.23  Prover 2: Constructing countermodel ...
% 2.32/1.28  Prover 2: gave up
% 2.32/1.28  Prover 3: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.32/1.29  Prover 3: Preprocessing ...
% 2.32/1.29  Prover 3: Warning: ignoring some quantifiers
% 2.32/1.29  Prover 3: Constructing countermodel ...
% 2.32/1.32  Prover 3: gave up
% 2.32/1.32  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.59/1.35  Prover 4: Warning: ignoring some quantifiers
% 2.59/1.35  Prover 4: Constructing countermodel ...
% 2.76/1.42  Prover 4: gave up
% 2.76/1.42  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.76/1.42  Prover 5: Preprocessing ...
% 2.76/1.43  Prover 5: Warning: ignoring some quantifiers
% 2.76/1.44  Prover 5: Constructing countermodel ...
% 3.05/1.46  Prover 5: gave up
% 3.05/1.46  Prover 6: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 3.05/1.47  Prover 6: Preprocessing ...
% 3.14/1.48  Prover 6: Warning: ignoring some quantifiers
% 3.14/1.48  Prover 6: Constructing countermodel ...
% 3.14/1.51  Prover 6: gave up
% 3.14/1.51  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all
% 3.14/1.52  Prover 7: Preprocessing ...
% 3.29/1.53  Prover 7: Proving ...
% 3.53/1.67  Prover 7: proved (154ms)
% 3.53/1.67  
% 3.53/1.67  % SZS status Theorem for theBenchmark
% 3.53/1.67  
% 3.53/1.67  Generating proof ... found it (size 13)
% 3.87/1.79  
% 3.87/1.79  % SZS output start Proof for theBenchmark
% 3.87/1.79  Assumed formulas after preprocessing and simplification: 
% 3.87/1.79  | (0)  ? [v0] : ( ! [v1] :  ! [v2] :  ! [v3] : (v2 = v1 |  ~ (h(v3) = v2) |  ~ (h(v3) = v1)) &  ! [v1] :  ! [v2] :  ! [v3] : (v2 = v1 |  ~ (k(v3) = v2) |  ~ (k(v3) = v1)) &  ! [v1] :  ? [v2] :  ? [v3] :  ? [v4] : (h(v2) = v3 & k(v2) = v4 &  ! [v5] :  ~ p(v1, v2, v5) & (p(v1, v2, v4) | p(v0, v2, v3))))
% 3.97/1.81  | Instantiating (0) with all_0_0_0 yields:
% 3.97/1.81  | (1)  ! [v0] :  ! [v1] :  ! [v2] : (v1 = v0 |  ~ (h(v2) = v1) |  ~ (h(v2) = v0)) &  ! [v0] :  ! [v1] :  ! [v2] : (v1 = v0 |  ~ (k(v2) = v1) |  ~ (k(v2) = v0)) &  ! [v0] :  ? [v1] :  ? [v2] :  ? [v3] : (h(v1) = v2 & k(v1) = v3 &  ! [v4] :  ~ p(v0, v1, v4) & (p(v0, v1, v3) | p(all_0_0_0, v1, v2)))
% 3.97/1.82  |
% 3.97/1.82  | Applying alpha-rule on (1) yields:
% 3.97/1.82  | (2)  ! [v0] :  ! [v1] :  ! [v2] : (v1 = v0 |  ~ (h(v2) = v1) |  ~ (h(v2) = v0))
% 3.97/1.82  | (3)  ! [v0] :  ! [v1] :  ! [v2] : (v1 = v0 |  ~ (k(v2) = v1) |  ~ (k(v2) = v0))
% 3.97/1.82  | (4)  ! [v0] :  ? [v1] :  ? [v2] :  ? [v3] : (h(v1) = v2 & k(v1) = v3 &  ! [v4] :  ~ p(v0, v1, v4) & (p(v0, v1, v3) | p(all_0_0_0, v1, v2)))
% 3.97/1.82  |
% 3.97/1.82  | Introducing new symbol ex_4_0_1 defined by:
% 3.97/1.82  | (5) ex_4_0_1 = all_0_0_0
% 3.97/1.82  |
% 3.97/1.82  | Instantiating formula (4) with ex_4_0_1 yields:
% 3.97/1.82  | (6)  ? [v0] :  ? [v1] :  ? [v2] : (h(v0) = v1 & k(v0) = v2 &  ! [v3] :  ~ p(ex_4_0_1, v0, v3) & (p(ex_4_0_1, v0, v2) | p(all_0_0_0, v0, v1)))
% 3.97/1.82  |
% 3.97/1.82  | Instantiating (6) with all_5_0_2, all_5_1_3, all_5_2_4 yields:
% 3.97/1.82  | (7) h(all_5_2_4) = all_5_1_3 & k(all_5_2_4) = all_5_0_2 &  ! [v0] :  ~ p(ex_4_0_1, all_5_2_4, v0) & (p(ex_4_0_1, all_5_2_4, all_5_0_2) | p(all_0_0_0, all_5_2_4, all_5_1_3))
% 3.97/1.82  |
% 3.97/1.82  | Applying alpha-rule on (7) yields:
% 3.97/1.82  | (8) h(all_5_2_4) = all_5_1_3
% 3.97/1.82  | (9) k(all_5_2_4) = all_5_0_2
% 3.97/1.82  | (10)  ! [v0] :  ~ p(ex_4_0_1, all_5_2_4, v0)
% 3.97/1.82  | (11) p(ex_4_0_1, all_5_2_4, all_5_0_2) | p(all_0_0_0, all_5_2_4, all_5_1_3)
% 3.97/1.82  |
% 3.97/1.82  +-Applying beta-rule and splitting (11), into two cases.
% 3.97/1.82  |-Branch one:
% 3.97/1.82  | (12) p(ex_4_0_1, all_5_2_4, all_5_0_2)
% 3.97/1.82  |
% 3.97/1.82  	| Instantiating formula (10) with all_5_0_2 and discharging atoms p(ex_4_0_1, all_5_2_4, all_5_0_2), yields:
% 3.97/1.82  	| (13) $false
% 3.97/1.82  	|
% 3.97/1.82  	|-The branch is then unsatisfiable
% 3.97/1.82  |-Branch two:
% 3.97/1.82  | (14) p(all_0_0_0, all_5_2_4, all_5_1_3)
% 3.97/1.82  |
% 3.97/1.82  	| Instantiating formula (10) with all_5_1_3 yields:
% 3.97/1.82  	| (15)  ~ p(ex_4_0_1, all_5_2_4, all_5_1_3)
% 3.97/1.82  	|
% 3.97/1.82  	| From (5) and (15) follows:
% 3.97/1.83  	| (16)  ~ p(all_0_0_0, all_5_2_4, all_5_1_3)
% 3.97/1.83  	|
% 3.97/1.83  	| Using (14) and (16) yields:
% 3.97/1.83  	| (13) $false
% 3.97/1.83  	|
% 3.97/1.83  	|-The branch is then unsatisfiable
% 3.97/1.83  % SZS output end Proof for theBenchmark
% 3.97/1.83  
% 3.97/1.83  1188ms
%------------------------------------------------------------------------------