TSTP Solution File: SYN986+1.000 by ePrincess---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ePrincess---1.0
% Problem  : SYN986+1.000 : TPTP v8.1.0. Released v4.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:06:17 EDT 2022

% Result   : Theorem 3.96s 1.68s
% Output   : Proof 4.50s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN986+1.000 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : ePrincess-casc -timeout=%d %s
% 0.13/0.33  % Computer : n008.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 : Tue Jul 12 07:58:08 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.50/0.59          ____       _                          
% 0.50/0.59    ___  / __ \_____(_)___  ________  __________
% 0.50/0.59   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.50/0.59  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.50/0.59  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.50/0.59  
% 0.50/0.59  A Theorem Prover for First-Order Logic
% 0.50/0.59  (ePrincess v.1.0)
% 0.50/0.59  
% 0.50/0.59  (c) Philipp Rümmer, 2009-2015
% 0.50/0.59  (c) Peter Backeman, 2014-2015
% 0.50/0.59  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.50/0.59  Free software under GNU Lesser General Public License (LGPL).
% 0.50/0.59  Bug reports to peter@backeman.se
% 0.50/0.59  
% 0.50/0.59  For more information, visit http://user.uu.se/~petba168/breu/
% 0.50/0.59  
% 0.50/0.59  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.68/0.64  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.30/0.89  Prover 0: Preprocessing ...
% 1.45/0.96  Prover 0: Constructing countermodel ...
% 1.53/1.01  Prover 0: gave up
% 1.53/1.01  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 1.53/1.02  Prover 1: Preprocessing ...
% 1.74/1.07  Prover 1: Constructing countermodel ...
% 1.74/1.08  Prover 1: gave up
% 1.74/1.08  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.90/1.09  Prover 2: Preprocessing ...
% 1.90/1.14  Prover 2: Warning: ignoring some quantifiers
% 1.90/1.14  Prover 2: Constructing countermodel ...
% 2.26/1.18  Prover 2: gave up
% 2.26/1.18  Prover 3: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 2.26/1.19  Prover 3: Preprocessing ...
% 2.26/1.20  Prover 3: Constructing countermodel ...
% 2.26/1.20  Prover 3: gave up
% 2.26/1.21  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete
% 2.26/1.21  Prover 4: Preprocessing ...
% 2.56/1.25  Prover 4: Warning: ignoring some quantifiers
% 2.56/1.25  Prover 4: Constructing countermodel ...
% 3.30/1.47  Prover 4: gave up
% 3.30/1.47  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 3.37/1.47  Prover 5: Preprocessing ...
% 3.37/1.49  Prover 5: Constructing countermodel ...
% 3.37/1.49  Prover 5: gave up
% 3.37/1.49  Prover 6: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 3.37/1.50  Prover 6: Preprocessing ...
% 3.37/1.52  Prover 6: Warning: ignoring some quantifiers
% 3.37/1.52  Prover 6: Constructing countermodel ...
% 3.54/1.53  Prover 6: gave up
% 3.54/1.53  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all
% 3.54/1.54  Prover 7: Preprocessing ...
% 3.54/1.54  Prover 7: Constructing countermodel ...
% 3.54/1.54  Prover 7: gave up
% 3.54/1.54  Prover 8: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all
% 3.65/1.55  Prover 8: Preprocessing ...
% 3.65/1.56  Prover 8: Constructing countermodel ...
% 3.65/1.56  Prover 8: gave up
% 3.65/1.56  Prover 9: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=completeFrugal
% 3.65/1.57  Prover 9: Preprocessing ...
% 3.65/1.58  Prover 9: Proving ...
% 3.96/1.68  Prover 9: proved (120ms)
% 3.96/1.68  
% 3.96/1.68  % SZS status Theorem for theBenchmark
% 3.96/1.68  
% 3.96/1.68  Generating proof ... found it (size 10)
% 4.42/1.79  
% 4.42/1.79  % SZS output start Proof for theBenchmark
% 4.42/1.79  Assumed formulas after preprocessing and simplification: 
% 4.42/1.80  | (0)  ? [v0] : ( ! [v1] :  ! [v2] :  ! [v3] :  ! [v4] :  ! [v5] : ( ~ (succ(v2) = v5) |  ~ r(v3, v2, v4) |  ~ r(v1, v2, v3) | r(v1, v5, v4)) &  ! [v1] :  ! [v2] :  ! [v3] : (v2 = v1 |  ~ (succ(v3) = v2) |  ~ (succ(v3) = v1)) &  ! [v1] :  ~ r(v0, v0, v1) &  ! [v1] :  ? [v2] : (succ(v1) = v2 & r(v1, v0, v2)))
% 4.50/1.82  | Instantiating (0) with all_0_0_0 yields:
% 4.50/1.82  | (1)  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] :  ! [v4] : ( ~ (succ(v1) = v4) |  ~ r(v2, v1, v3) |  ~ r(v0, v1, v2) | r(v0, v4, v3)) &  ! [v0] :  ! [v1] :  ! [v2] : (v1 = v0 |  ~ (succ(v2) = v1) |  ~ (succ(v2) = v0)) &  ! [v0] :  ~ r(all_0_0_0, all_0_0_0, v0) &  ! [v0] :  ? [v1] : (succ(v0) = v1 & r(v0, all_0_0_0, v1))
% 4.50/1.82  |
% 4.50/1.82  | Applying alpha-rule on (1) yields:
% 4.50/1.82  | (2)  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] :  ! [v4] : ( ~ (succ(v1) = v4) |  ~ r(v2, v1, v3) |  ~ r(v0, v1, v2) | r(v0, v4, v3))
% 4.50/1.82  | (3)  ! [v0] :  ! [v1] :  ! [v2] : (v1 = v0 |  ~ (succ(v2) = v1) |  ~ (succ(v2) = v0))
% 4.50/1.82  | (4)  ! [v0] :  ~ r(all_0_0_0, all_0_0_0, v0)
% 4.50/1.83  | (5)  ! [v0] :  ? [v1] : (succ(v0) = v1 & r(v0, all_0_0_0, v1))
% 4.50/1.83  |
% 4.50/1.83  | Introducing new symbol ex_4_0_1 defined by:
% 4.50/1.83  | (6) ex_4_0_1 = all_0_0_0
% 4.50/1.83  |
% 4.50/1.83  | Instantiating formula (5) with ex_4_0_1 yields:
% 4.50/1.83  | (7)  ? [v0] : (succ(ex_4_0_1) = v0 & r(ex_4_0_1, all_0_0_0, v0))
% 4.50/1.83  |
% 4.50/1.83  | Instantiating (7) with all_5_0_2 yields:
% 4.50/1.83  | (8) succ(ex_4_0_1) = all_5_0_2 & r(ex_4_0_1, all_0_0_0, all_5_0_2)
% 4.50/1.83  |
% 4.50/1.83  | Applying alpha-rule on (8) yields:
% 4.50/1.83  | (9) succ(ex_4_0_1) = all_5_0_2
% 4.50/1.83  | (10) r(ex_4_0_1, all_0_0_0, all_5_0_2)
% 4.50/1.83  |
% 4.50/1.83  | Instantiating formula (4) with all_5_0_2 yields:
% 4.50/1.83  | (11)  ~ r(all_0_0_0, all_0_0_0, all_5_0_2)
% 4.50/1.83  |
% 4.50/1.83  | From (6) and (10) follows:
% 4.50/1.83  | (12) r(all_0_0_0, all_0_0_0, all_5_0_2)
% 4.50/1.83  |
% 4.50/1.83  | Using (12) and (11) yields:
% 4.50/1.83  | (13) $false
% 4.50/1.83  |
% 4.50/1.83  |-The branch is then unsatisfiable
% 4.50/1.83  % SZS output end Proof for theBenchmark
% 4.50/1.83  
% 4.50/1.83  1231ms
%------------------------------------------------------------------------------