TSTP Solution File: NUN067+2 by ePrincess---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ePrincess---1.0
% Problem  : NUN067+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : ePrincess-casc -timeout=%d %s

% Computer : n026.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 : Mon Jul 18 16:25:08 EDT 2022

% Result   : Theorem 8.84s 2.74s
% Output   : Proof 10.60s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : NUN067+2 : TPTP v8.1.0. Released v7.3.0.
% 0.08/0.14  % Command  : ePrincess-casc -timeout=%d %s
% 0.14/0.35  % Computer : n026.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Thu Jun  2 04:48:57 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.61/0.60          ____       _                          
% 0.61/0.60    ___  / __ \_____(_)___  ________  __________
% 0.61/0.60   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.61/0.60  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.61/0.60  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.61/0.60  
% 0.61/0.60  A Theorem Prover for First-Order Logic
% 0.61/0.60  (ePrincess v.1.0)
% 0.61/0.60  
% 0.61/0.60  (c) Philipp Rümmer, 2009-2015
% 0.61/0.60  (c) Peter Backeman, 2014-2015
% 0.61/0.60  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.61/0.60  Free software under GNU Lesser General Public License (LGPL).
% 0.61/0.60  Bug reports to peter@backeman.se
% 0.61/0.60  
% 0.61/0.60  For more information, visit http://user.uu.se/~petba168/breu/
% 0.61/0.60  
% 0.61/0.60  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.70/0.65  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.68/0.95  Prover 0: Preprocessing ...
% 2.04/1.09  Prover 0: Warning: ignoring some quantifiers
% 2.04/1.11  Prover 0: Constructing countermodel ...
% 2.54/1.33  Prover 0: gave up
% 2.54/1.33  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 2.91/1.36  Prover 1: Preprocessing ...
% 3.19/1.43  Prover 1: Warning: ignoring some quantifiers
% 3.19/1.44  Prover 1: Constructing countermodel ...
% 3.77/1.59  Prover 1: gave up
% 3.77/1.59  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 3.91/1.61  Prover 2: Preprocessing ...
% 4.08/1.66  Prover 2: Warning: ignoring some quantifiers
% 4.08/1.66  Prover 2: Constructing countermodel ...
% 4.56/1.76  Prover 2: gave up
% 4.56/1.76  Prover 3: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 4.56/1.78  Prover 3: Preprocessing ...
% 4.86/1.80  Prover 3: Warning: ignoring some quantifiers
% 4.86/1.80  Prover 3: Constructing countermodel ...
% 4.86/1.86  Prover 3: gave up
% 4.86/1.86  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete
% 5.25/1.88  Prover 4: Preprocessing ...
% 5.45/1.92  Prover 4: Warning: ignoring some quantifiers
% 5.45/1.93  Prover 4: Constructing countermodel ...
% 5.94/2.08  Prover 4: gave up
% 5.94/2.08  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 6.22/2.09  Prover 5: Preprocessing ...
% 6.22/2.12  Prover 5: Warning: ignoring some quantifiers
% 6.22/2.12  Prover 5: Constructing countermodel ...
% 6.60/2.18  Prover 5: gave up
% 6.60/2.18  Prover 6: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 6.68/2.19  Prover 6: Preprocessing ...
% 6.68/2.21  Prover 6: Warning: ignoring some quantifiers
% 6.68/2.21  Prover 6: Constructing countermodel ...
% 6.96/2.27  Prover 6: gave up
% 6.96/2.27  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all
% 6.96/2.29  Prover 7: Preprocessing ...
% 6.96/2.30  Prover 7: Proving ...
% 8.84/2.74  Prover 7: proved (466ms)
% 8.84/2.74  
% 8.84/2.74  % SZS status Theorem for theBenchmark
% 8.84/2.74  
% 8.84/2.74  Generating proof ... found it (size 12)
% 10.60/3.12  
% 10.60/3.12  % SZS output start Proof for theBenchmark
% 10.60/3.12  Assumed formulas after preprocessing and simplification: 
% 10.60/3.12  | (0)  ! [v0] :  ! [v1] : (v1 = v0 |  ! [v2] : ( ~ r2(v1, v2) |  ~ r2(v0, v2))) &  ! [v0] :  ! [v1] : ( ~ r2(v0, v1) |  ~ r1(v1)) &  ! [v0] :  ! [v1] :  ? [v2] :  ! [v3] : ((v3 = v2 & r4(v0, v1, v2)) | ( ~ (v3 = v2) &  ~ r4(v0, v1, v3))) &  ! [v0] :  ! [v1] :  ? [v2] :  ! [v3] : ((v3 = v2 & r3(v0, v1, v2)) | ( ~ (v3 = v2) &  ~ r3(v0, v1, v3))) &  ! [v0] :  ? [v1] :  ! [v2] : ((v2 = v1 & r2(v0, v1)) | ( ~ (v2 = v1) &  ~ r2(v0, v2))) &  ? [v0] :  ! [v1] : ((v1 = v0 & r1(v0)) | ( ~ (v1 = v0) &  ~ r1(v1))) &  ! [v0] : (r1(v0) |  ? [v1] : r2(v1, v0)) &  ! [v0] : r1(v0) &  ! [v0] :  ! [v1] :  ? [v2] : ( ? [v3] : (r4(v0, v3, v2) & r2(v1, v3)) &  ? [v3] : (r4(v0, v1, v3) & r3(v3, v0, v2))) &  ! [v0] :  ! [v1] :  ? [v2] : ( ? [v3] : (r3(v0, v3, v2) & r2(v1, v3)) &  ? [v3] : (r3(v0, v1, v3) & r2(v3, v2))) &  ! [v0] :  ? [v1] : (r3(v0, v1, v0) & r1(v1)) &  ! [v0] :  ? [v1] : (r1(v1) &  ? [v2] : (r4(v0, v2, v1) & r1(v2)))
% 10.60/3.13  | Applying alpha-rule on (0) yields:
% 10.60/3.13  | (1)  ! [v0] :  ? [v1] : (r1(v1) &  ? [v2] : (r4(v0, v2, v1) & r1(v2)))
% 10.60/3.13  | (2)  ! [v0] : (r1(v0) |  ? [v1] : r2(v1, v0))
% 10.60/3.13  | (3)  ! [v0] :  ! [v1] :  ? [v2] :  ! [v3] : ((v3 = v2 & r3(v0, v1, v2)) | ( ~ (v3 = v2) &  ~ r3(v0, v1, v3)))
% 10.60/3.13  | (4)  ! [v0] :  ? [v1] :  ! [v2] : ((v2 = v1 & r2(v0, v1)) | ( ~ (v2 = v1) &  ~ r2(v0, v2)))
% 10.60/3.13  | (5)  ! [v0] :  ! [v1] :  ? [v2] : ( ? [v3] : (r3(v0, v3, v2) & r2(v1, v3)) &  ? [v3] : (r3(v0, v1, v3) & r2(v3, v2)))
% 10.60/3.13  | (6)  ! [v0] :  ! [v1] : ( ~ r2(v0, v1) |  ~ r1(v1))
% 10.60/3.13  | (7)  ? [v0] :  ! [v1] : ((v1 = v0 & r1(v0)) | ( ~ (v1 = v0) &  ~ r1(v1)))
% 10.60/3.13  | (8)  ! [v0] :  ! [v1] :  ? [v2] :  ! [v3] : ((v3 = v2 & r4(v0, v1, v2)) | ( ~ (v3 = v2) &  ~ r4(v0, v1, v3)))
% 10.60/3.13  | (9)  ! [v0] :  ! [v1] : (v1 = v0 |  ! [v2] : ( ~ r2(v1, v2) |  ~ r2(v0, v2)))
% 10.60/3.13  | (10)  ! [v0] :  ? [v1] : (r3(v0, v1, v0) & r1(v1))
% 10.60/3.13  | (11)  ! [v0] : r1(v0)
% 10.60/3.13  | (12)  ! [v0] :  ! [v1] :  ? [v2] : ( ? [v3] : (r4(v0, v3, v2) & r2(v1, v3)) &  ? [v3] : (r4(v0, v1, v3) & r3(v3, v0, v2)))
% 10.60/3.13  |
% 10.60/3.13  | Instantiating formula (12) with ex_15_0_6, ex_15_1_7 yields:
% 10.60/3.13  | (13)  ? [v0] : ( ? [v1] : (r4(ex_15_1_7, v1, v0) & r2(ex_15_0_6, v1)) &  ? [v1] : (r4(ex_15_1_7, ex_15_0_6, v1) & r3(v1, ex_15_1_7, v0)))
% 10.60/3.13  |
% 10.60/3.13  | Instantiating (13) with all_16_0_8 yields:
% 10.60/3.13  | (14)  ? [v0] : (r4(ex_15_1_7, v0, all_16_0_8) & r2(ex_15_0_6, v0)) &  ? [v0] : (r4(ex_15_1_7, ex_15_0_6, v0) & r3(v0, ex_15_1_7, all_16_0_8))
% 10.60/3.13  |
% 10.60/3.13  | Applying alpha-rule on (14) yields:
% 10.60/3.13  | (15)  ? [v0] : (r4(ex_15_1_7, v0, all_16_0_8) & r2(ex_15_0_6, v0))
% 10.60/3.13  | (16)  ? [v0] : (r4(ex_15_1_7, ex_15_0_6, v0) & r3(v0, ex_15_1_7, all_16_0_8))
% 10.60/3.13  |
% 10.60/3.13  | Instantiating (15) with all_19_0_10 yields:
% 10.60/3.13  | (17) r4(ex_15_1_7, all_19_0_10, all_16_0_8) & r2(ex_15_0_6, all_19_0_10)
% 10.60/3.13  |
% 10.60/3.13  | Applying alpha-rule on (17) yields:
% 10.60/3.13  | (18) r4(ex_15_1_7, all_19_0_10, all_16_0_8)
% 10.60/3.13  | (19) r2(ex_15_0_6, all_19_0_10)
% 10.60/3.13  |
% 10.60/3.13  | Introducing new symbol ex_34_0_13 defined by:
% 10.60/3.13  | (20) ex_34_0_13 = all_19_0_10
% 10.60/3.13  |
% 10.60/3.13  | Instantiating formula (11) with ex_34_0_13 yields:
% 10.60/3.13  | (21) r1(ex_34_0_13)
% 10.60/3.13  |
% 10.60/3.13  | Instantiating formula (6) with all_19_0_10, ex_15_0_6 and discharging atoms r2(ex_15_0_6, all_19_0_10), yields:
% 10.60/3.14  | (22)  ~ r1(all_19_0_10)
% 10.60/3.14  |
% 10.60/3.14  | From (20) and (21) follows:
% 10.60/3.14  | (23) r1(all_19_0_10)
% 10.60/3.14  |
% 10.60/3.14  | Using (23) and (22) yields:
% 10.60/3.14  | (24) $false
% 10.60/3.14  |
% 10.60/3.14  |-The branch is then unsatisfiable
% 10.60/3.14  % SZS output end Proof for theBenchmark
% 10.60/3.14  
% 10.60/3.14  2523ms
%------------------------------------------------------------------------------