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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ePrincess---1.0
% Problem  : LCL636+1.001 : TPTP v8.1.0. Released v4.0.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 : Sun Jul 17 09:37:25 EDT 2022

% Result   : Theorem 2.19s 1.20s
% Output   : Proof 3.01s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL636+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12  % Command  : ePrincess-casc -timeout=%d %s
% 0.13/0.33  % Computer : n026.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  5 00:20:22 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.74/0.64  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.64/0.96  Prover 0: Preprocessing ...
% 2.00/1.11  Prover 0: Constructing countermodel ...
% 2.19/1.19  Prover 0: proved (557ms)
% 2.19/1.20  
% 2.19/1.20  No countermodel exists, formula is valid
% 2.19/1.20  % SZS status Theorem for theBenchmark
% 2.19/1.20  
% 2.19/1.20  Generating proof ... found it (size 4)
% 3.01/1.39  
% 3.01/1.39  % SZS output start Proof for theBenchmark
% 3.01/1.39  Assumed formulas after preprocessing and simplification: 
% 3.01/1.39  | (0)  ? [v0] :  ? [v1] :  ? [v2] : (p100(v0) & p101(v2) & p101(v1) & p2(v1) & r1(v0, v2) & r1(v0, v1) &  ~ p101(v0) &  ~ p102(v2) &  ~ p102(v1) &  ~ p102(v0) &  ~ p2(v2) &  ! [v3] :  ! [v4] : ( ~ p1(v4) |  ~ p100(v4) |  ~ p100(v3) |  ~ r1(v3, v4) |  ~ r1(v0, v3) | p1(v3)) &  ! [v3] :  ! [v4] : ( ~ p1(v3) |  ~ p100(v4) |  ~ p100(v3) |  ~ r1(v3, v4) |  ~ r1(v0, v3) | p1(v4)) &  ! [v3] :  ! [v4] : ( ~ p101(v4) |  ~ p101(v3) |  ~ p2(v4) |  ~ r1(v3, v4) |  ~ r1(v0, v3) | p2(v3)) &  ! [v3] :  ! [v4] : ( ~ p101(v4) |  ~ p101(v3) |  ~ p2(v3) |  ~ r1(v3, v4) |  ~ r1(v0, v3) | p2(v4)) &  ! [v3] : ( ~ p100(v3) |  ~ r1(v0, v3) | p101(v3) |  ? [v4] : (p101(v4) & p2(v4) & r1(v3, v4) &  ~ p102(v4))) &  ! [v3] : ( ~ p100(v3) |  ~ r1(v0, v3) | p101(v3) |  ? [v4] : (p101(v4) & r1(v3, v4) &  ~ p102(v4) &  ~ p2(v4))) &  ! [v3] : ( ~ p101(v3) |  ~ r1(v0, v3) | p100(v3)) &  ! [v3] : ( ~ p102(v3) |  ~ r1(v0, v3) | p101(v3)) &  ! [v3] : ( ~ r1(v0, v3) | p2(v3)) & ( ~ p1(v0) |  ! [v3] : ( ~ p100(v3) |  ~ r1(v0, v3) | p1(v3))) & (p1(v0) |  ! [v3] : ( ~ p1(v3) |  ~ p100(v3) |  ~ r1(v0, v3))))
% 3.01/1.40  | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2 yields:
% 3.01/1.40  | (1) p100(all_0_2_2) & p101(all_0_0_0) & p101(all_0_1_1) & p2(all_0_1_1) & r1(all_0_2_2, all_0_0_0) & r1(all_0_2_2, all_0_1_1) &  ~ p101(all_0_2_2) &  ~ p102(all_0_0_0) &  ~ p102(all_0_1_1) &  ~ p102(all_0_2_2) &  ~ p2(all_0_0_0) &  ! [v0] :  ! [v1] : ( ~ p1(v1) |  ~ p100(v1) |  ~ p100(v0) |  ~ r1(v0, v1) |  ~ r1(all_0_2_2, v0) | p1(v0)) &  ! [v0] :  ! [v1] : ( ~ p1(v0) |  ~ p100(v1) |  ~ p100(v0) |  ~ r1(v0, v1) |  ~ r1(all_0_2_2, v0) | p1(v1)) &  ! [v0] :  ! [v1] : ( ~ p101(v1) |  ~ p101(v0) |  ~ p2(v1) |  ~ r1(v0, v1) |  ~ r1(all_0_2_2, v0) | p2(v0)) &  ! [v0] :  ! [v1] : ( ~ p101(v1) |  ~ p101(v0) |  ~ p2(v0) |  ~ r1(v0, v1) |  ~ r1(all_0_2_2, v0) | p2(v1)) &  ! [v0] : ( ~ p100(v0) |  ~ r1(all_0_2_2, v0) | p101(v0) |  ? [v1] : (p101(v1) & p2(v1) & r1(v0, v1) &  ~ p102(v1))) &  ! [v0] : ( ~ p100(v0) |  ~ r1(all_0_2_2, v0) | p101(v0) |  ? [v1] : (p101(v1) & r1(v0, v1) &  ~ p102(v1) &  ~ p2(v1))) &  ! [v0] : ( ~ p101(v0) |  ~ r1(all_0_2_2, v0) | p100(v0)) &  ! [v0] : ( ~ p102(v0) |  ~ r1(all_0_2_2, v0) | p101(v0)) &  ! [v0] : ( ~ r1(all_0_2_2, v0) | p2(v0)) & ( ~ p1(all_0_2_2) |  ! [v0] : ( ~ p100(v0) |  ~ r1(all_0_2_2, v0) | p1(v0))) & (p1(all_0_2_2) |  ! [v0] : ( ~ p1(v0) |  ~ p100(v0) |  ~ r1(all_0_2_2, v0)))
% 3.01/1.41  |
% 3.01/1.41  | Applying alpha-rule on (1) yields:
% 3.01/1.41  | (2)  ~ p101(all_0_2_2)
% 3.01/1.41  | (3) p100(all_0_2_2)
% 3.01/1.41  | (4)  ! [v0] :  ! [v1] : ( ~ p1(v0) |  ~ p100(v1) |  ~ p100(v0) |  ~ r1(v0, v1) |  ~ r1(all_0_2_2, v0) | p1(v1))
% 3.01/1.41  | (5)  ! [v0] : ( ~ p102(v0) |  ~ r1(all_0_2_2, v0) | p101(v0))
% 3.01/1.41  | (6)  ~ p102(all_0_1_1)
% 3.01/1.41  | (7)  ! [v0] : ( ~ p100(v0) |  ~ r1(all_0_2_2, v0) | p101(v0) |  ? [v1] : (p101(v1) & r1(v0, v1) &  ~ p102(v1) &  ~ p2(v1)))
% 3.01/1.41  | (8)  ! [v0] :  ! [v1] : ( ~ p1(v1) |  ~ p100(v1) |  ~ p100(v0) |  ~ r1(v0, v1) |  ~ r1(all_0_2_2, v0) | p1(v0))
% 3.01/1.41  | (9)  ! [v0] :  ! [v1] : ( ~ p101(v1) |  ~ p101(v0) |  ~ p2(v0) |  ~ r1(v0, v1) |  ~ r1(all_0_2_2, v0) | p2(v1))
% 3.01/1.41  | (10) p2(all_0_1_1)
% 3.01/1.41  | (11) p1(all_0_2_2) |  ! [v0] : ( ~ p1(v0) |  ~ p100(v0) |  ~ r1(all_0_2_2, v0))
% 3.01/1.41  | (12)  ! [v0] : ( ~ p100(v0) |  ~ r1(all_0_2_2, v0) | p101(v0) |  ? [v1] : (p101(v1) & p2(v1) & r1(v0, v1) &  ~ p102(v1)))
% 3.01/1.41  | (13)  ~ p1(all_0_2_2) |  ! [v0] : ( ~ p100(v0) |  ~ r1(all_0_2_2, v0) | p1(v0))
% 3.01/1.41  | (14)  ~ p102(all_0_0_0)
% 3.01/1.41  | (15)  ~ p2(all_0_0_0)
% 3.01/1.41  | (16) p101(all_0_1_1)
% 3.01/1.41  | (17)  ! [v0] : ( ~ r1(all_0_2_2, v0) | p2(v0))
% 3.01/1.41  | (18)  ~ p102(all_0_2_2)
% 3.01/1.41  | (19) p101(all_0_0_0)
% 3.01/1.41  | (20)  ! [v0] :  ! [v1] : ( ~ p101(v1) |  ~ p101(v0) |  ~ p2(v1) |  ~ r1(v0, v1) |  ~ r1(all_0_2_2, v0) | p2(v0))
% 3.01/1.42  | (21) r1(all_0_2_2, all_0_0_0)
% 3.01/1.42  | (22)  ! [v0] : ( ~ p101(v0) |  ~ r1(all_0_2_2, v0) | p100(v0))
% 3.01/1.42  | (23) r1(all_0_2_2, all_0_1_1)
% 3.01/1.42  |
% 3.01/1.42  | Instantiating formula (17) with all_0_0_0 and discharging atoms r1(all_0_2_2, all_0_0_0),  ~ p2(all_0_0_0), yields:
% 3.01/1.42  | (24) $false
% 3.01/1.42  |
% 3.01/1.42  |-The branch is then unsatisfiable
% 3.01/1.42  % SZS output end Proof for theBenchmark
% 3.01/1.42  
% 3.01/1.42  821ms
%------------------------------------------------------------------------------