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

View Problem - Process Solution

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

% Computer : n022.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.48s 1.57s
% Output   : Proof 3.84s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : SYN370+1 : TPTP v8.1.0. Released v2.0.0.
% 0.08/0.12  % Command  : ePrincess-casc -timeout=%d %s
% 0.13/0.33  % Computer : n022.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Mon Jul 11 18:20:10 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.52/0.56          ____       _                          
% 0.52/0.56    ___  / __ \_____(_)___  ________  __________
% 0.52/0.56   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.52/0.56  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.52/0.56  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.52/0.56  
% 0.52/0.56  A Theorem Prover for First-Order Logic
% 0.52/0.57  (ePrincess v.1.0)
% 0.52/0.57  
% 0.52/0.57  (c) Philipp Rümmer, 2009-2015
% 0.52/0.57  (c) Peter Backeman, 2014-2015
% 0.52/0.57  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.52/0.57  Free software under GNU Lesser General Public License (LGPL).
% 0.52/0.57  Bug reports to peter@backeman.se
% 0.52/0.57  
% 0.52/0.57  For more information, visit http://user.uu.se/~petba168/breu/
% 0.52/0.57  
% 0.52/0.57  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.52/0.61  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.20/0.82  Prover 0: Preprocessing ...
% 1.28/0.88  Prover 0: Warning: ignoring some quantifiers
% 1.28/0.89  Prover 0: Constructing countermodel ...
% 1.65/1.01  Prover 0: gave up
% 1.65/1.01  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 1.65/1.03  Prover 1: Preprocessing ...
% 1.92/1.06  Prover 1: Warning: ignoring some quantifiers
% 1.92/1.06  Prover 1: Constructing countermodel ...
% 2.00/1.11  Prover 1: gave up
% 2.00/1.11  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.00/1.12  Prover 2: Preprocessing ...
% 2.17/1.15  Prover 2: Warning: ignoring some quantifiers
% 2.17/1.15  Prover 2: Constructing countermodel ...
% 2.29/1.21  Prover 2: gave up
% 2.29/1.21  Prover 3: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.29/1.21  Prover 3: Preprocessing ...
% 2.29/1.22  Prover 3: Warning: ignoring some quantifiers
% 2.29/1.22  Prover 3: Constructing countermodel ...
% 2.53/1.25  Prover 3: gave up
% 2.53/1.25  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete
% 2.53/1.25  Prover 4: Preprocessing ...
% 2.69/1.28  Prover 4: Warning: ignoring some quantifiers
% 2.69/1.28  Prover 4: Constructing countermodel ...
% 2.94/1.34  Prover 4: gave up
% 2.94/1.34  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.94/1.34  Prover 5: Preprocessing ...
% 2.94/1.35  Prover 5: Warning: ignoring some quantifiers
% 2.94/1.36  Prover 5: Constructing countermodel ...
% 3.02/1.38  Prover 5: gave up
% 3.02/1.38  Prover 6: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 3.02/1.39  Prover 6: Preprocessing ...
% 3.02/1.40  Prover 6: Warning: ignoring some quantifiers
% 3.02/1.40  Prover 6: Constructing countermodel ...
% 3.22/1.43  Prover 6: gave up
% 3.22/1.43  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all
% 3.22/1.43  Prover 7: Preprocessing ...
% 3.22/1.44  Prover 7: Proving ...
% 3.48/1.57  Prover 7: proved (141ms)
% 3.48/1.57  
% 3.48/1.57  % SZS status Theorem for theBenchmark
% 3.48/1.57  
% 3.48/1.57  Generating proof ... found it (size 13)
% 3.84/1.70  
% 3.84/1.70  % SZS output start Proof for theBenchmark
% 3.84/1.70  Assumed formulas after preprocessing and simplification: 
% 3.84/1.70  | (0)  ? [v0] : ( ! [v1] :  ! [v2] :  ! [v3] : (v2 = v1 |  ~ (h(v3) = v2) |  ~ (h(v3) = v1)) &  ! [v1] :  ! [v2] :  ! [v3] : (v2 = v1 |  ~ (f(v3) = v2) |  ~ (f(v3) = v1)) &  ! [v1] :  ? [v2] :  ? [v3] :  ? [v4] : (h(v2) = v3 & f(v2) = v4 &  ! [v5] :  ~ big_p(v1, v2, v5) & (big_p(v1, v2, v4) | big_p(v0, v2, v3))))
% 3.84/1.73  | Instantiating (0) with all_0_0_0 yields:
% 3.84/1.73  | (1)  ! [v0] :  ! [v1] :  ! [v2] : (v1 = v0 |  ~ (h(v2) = v1) |  ~ (h(v2) = v0)) &  ! [v0] :  ! [v1] :  ! [v2] : (v1 = v0 |  ~ (f(v2) = v1) |  ~ (f(v2) = v0)) &  ! [v0] :  ? [v1] :  ? [v2] :  ? [v3] : (h(v1) = v2 & f(v1) = v3 &  ! [v4] :  ~ big_p(v0, v1, v4) & (big_p(v0, v1, v3) | big_p(all_0_0_0, v1, v2)))
% 3.84/1.73  |
% 3.84/1.73  | Applying alpha-rule on (1) yields:
% 3.84/1.73  | (2)  ! [v0] :  ! [v1] :  ! [v2] : (v1 = v0 |  ~ (h(v2) = v1) |  ~ (h(v2) = v0))
% 3.84/1.73  | (3)  ! [v0] :  ! [v1] :  ! [v2] : (v1 = v0 |  ~ (f(v2) = v1) |  ~ (f(v2) = v0))
% 3.84/1.73  | (4)  ! [v0] :  ? [v1] :  ? [v2] :  ? [v3] : (h(v1) = v2 & f(v1) = v3 &  ! [v4] :  ~ big_p(v0, v1, v4) & (big_p(v0, v1, v3) | big_p(all_0_0_0, v1, v2)))
% 3.84/1.73  |
% 3.84/1.73  | Introducing new symbol ex_4_0_1 defined by:
% 3.84/1.73  | (5) ex_4_0_1 = all_0_0_0
% 3.84/1.73  |
% 3.84/1.73  | Instantiating formula (4) with ex_4_0_1 yields:
% 3.84/1.73  | (6)  ? [v0] :  ? [v1] :  ? [v2] : (h(v0) = v1 & f(v0) = v2 &  ! [v3] :  ~ big_p(ex_4_0_1, v0, v3) & (big_p(ex_4_0_1, v0, v2) | big_p(all_0_0_0, v0, v1)))
% 3.84/1.73  |
% 3.84/1.73  | Instantiating (6) with all_5_0_2, all_5_1_3, all_5_2_4 yields:
% 3.84/1.73  | (7) h(all_5_2_4) = all_5_1_3 & f(all_5_2_4) = all_5_0_2 &  ! [v0] :  ~ big_p(ex_4_0_1, all_5_2_4, v0) & (big_p(ex_4_0_1, all_5_2_4, all_5_0_2) | big_p(all_0_0_0, all_5_2_4, all_5_1_3))
% 3.84/1.73  |
% 3.84/1.73  | Applying alpha-rule on (7) yields:
% 3.84/1.73  | (8) h(all_5_2_4) = all_5_1_3
% 3.84/1.73  | (9) f(all_5_2_4) = all_5_0_2
% 3.84/1.73  | (10)  ! [v0] :  ~ big_p(ex_4_0_1, all_5_2_4, v0)
% 3.84/1.73  | (11) big_p(ex_4_0_1, all_5_2_4, all_5_0_2) | big_p(all_0_0_0, all_5_2_4, all_5_1_3)
% 3.84/1.73  |
% 3.84/1.73  +-Applying beta-rule and splitting (11), into two cases.
% 3.84/1.73  |-Branch one:
% 3.84/1.73  | (12) big_p(ex_4_0_1, all_5_2_4, all_5_0_2)
% 3.84/1.73  |
% 3.84/1.73  	| Instantiating formula (10) with all_5_0_2 and discharging atoms big_p(ex_4_0_1, all_5_2_4, all_5_0_2), yields:
% 3.84/1.73  	| (13) $false
% 3.84/1.73  	|
% 3.84/1.73  	|-The branch is then unsatisfiable
% 3.84/1.73  |-Branch two:
% 3.84/1.73  | (14) big_p(all_0_0_0, all_5_2_4, all_5_1_3)
% 3.84/1.74  |
% 3.84/1.74  	| Instantiating formula (10) with all_5_1_3 yields:
% 3.84/1.74  	| (15)  ~ big_p(ex_4_0_1, all_5_2_4, all_5_1_3)
% 3.84/1.74  	|
% 3.84/1.74  	| From (5) and (15) follows:
% 3.84/1.74  	| (16)  ~ big_p(all_0_0_0, all_5_2_4, all_5_1_3)
% 3.84/1.74  	|
% 3.84/1.74  	| Using (14) and (16) yields:
% 3.84/1.74  	| (13) $false
% 3.84/1.74  	|
% 3.84/1.74  	|-The branch is then unsatisfiable
% 3.84/1.74  % SZS output end Proof for theBenchmark
% 3.84/1.74  
% 3.84/1.74  1162ms
%------------------------------------------------------------------------------