TSTP Solution File: NUM592+3 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NUM592+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n014.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 08:37:42 EDT 2022

% Result   : Theorem 131.31s 18.70s
% Output   : CNFRefutation 131.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   27 (  12 unt;   7 nHn;  21 RR)
%            Number of literals    :   63 (  10 equ;  31 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;   9 con; 0-2 aty)
%            Number of variables   :   23 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4849,plain,
    ( epred4_1(X1)
    | aElementOf0(esk43_2(X1,X2),slbdtsldtrb0(X2,xk))
    | ~ isCountable0(X2)
    | ~ aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g2z0dpe9/input.p',i_0_4849) ).

cnf(i_0_4201,hypothesis,
    sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))) = xY,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g2z0dpe9/input.p',i_0_4201) ).

cnf(i_0_4848,plain,
    ( epred4_1(X1)
    | sdtlpdtrp0(sdtlpdtrp0(xC,xi),esk43_2(X1,X2)) != X1
    | ~ isCountable0(X2)
    | ~ aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g2z0dpe9/input.p',i_0_4848) ).

cnf(i_0_4200,hypothesis,
    sdtlpdtrp0(xC,xi) = xd,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g2z0dpe9/input.p',i_0_4200) ).

cnf(i_0_4224,hypothesis,
    ( sdtlpdtrp0(xd,X1) = xu
    | ~ aSet0(X1)
    | ~ aElementOf0(X1,slbdtsldtrb0(xX,xk)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g2z0dpe9/input.p',i_0_4224) ).

cnf(i_0_4229,hypothesis,
    aSubsetOf0(xX,xY),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g2z0dpe9/input.p',i_0_4229) ).

cnf(i_0_4228,hypothesis,
    isCountable0(xX),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g2z0dpe9/input.p',i_0_4228) ).

cnf(i_0_4853,plain,
    ( epred4_1(X1)
    | aSet0(esk43_2(X1,X2))
    | ~ isCountable0(X2)
    | ~ aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g2z0dpe9/input.p',i_0_4853) ).

cnf(i_0_4233,negated_conjecture,
    ( ~ epred4_1(X1)
    | ~ aElementOf0(X1,xT) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g2z0dpe9/input.p',i_0_4233) ).

cnf(i_0_4232,hypothesis,
    aElementOf0(xu,xT),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g2z0dpe9/input.p',i_0_4232) ).

cnf(c_0_4864,plain,
    ( epred4_1(X1)
    | aElementOf0(esk43_2(X1,X2),slbdtsldtrb0(X2,xk))
    | ~ isCountable0(X2)
    | ~ aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) ),
    i_0_4849 ).

cnf(c_0_4865,hypothesis,
    sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))) = xY,
    i_0_4201 ).

cnf(c_0_4866,plain,
    ( epred4_1(X1)
    | sdtlpdtrp0(sdtlpdtrp0(xC,xi),esk43_2(X1,X2)) != X1
    | ~ isCountable0(X2)
    | ~ aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) ),
    i_0_4848 ).

cnf(c_0_4867,hypothesis,
    sdtlpdtrp0(xC,xi) = xd,
    i_0_4200 ).

cnf(c_0_4868,hypothesis,
    ( sdtlpdtrp0(xd,X1) = xu
    | ~ aSet0(X1)
    | ~ aElementOf0(X1,slbdtsldtrb0(xX,xk)) ),
    i_0_4224 ).

cnf(c_0_4869,plain,
    ( epred4_1(X1)
    | aElementOf0(esk43_2(X1,X2),slbdtsldtrb0(X2,xk))
    | ~ aSubsetOf0(X2,xY)
    | ~ isCountable0(X2) ),
    inference(rw,[status(thm)],[c_0_4864,c_0_4865]) ).

cnf(c_0_4870,hypothesis,
    aSubsetOf0(xX,xY),
    i_0_4229 ).

cnf(c_0_4871,hypothesis,
    isCountable0(xX),
    i_0_4228 ).

cnf(c_0_4872,plain,
    ( epred4_1(X1)
    | sdtlpdtrp0(xd,esk43_2(X1,X2)) != X1
    | ~ aSubsetOf0(X2,xY)
    | ~ isCountable0(X2) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4866,c_0_4867]),c_0_4865]) ).

cnf(c_0_4873,hypothesis,
    ( sdtlpdtrp0(xd,esk43_2(X1,xX)) = xu
    | epred4_1(X1)
    | ~ aSet0(esk43_2(X1,xX)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4868,c_0_4869]),c_0_4870]),c_0_4871])]) ).

cnf(c_0_4874,plain,
    ( epred4_1(X1)
    | aSet0(esk43_2(X1,X2))
    | ~ isCountable0(X2)
    | ~ aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) ),
    i_0_4853 ).

cnf(c_0_4875,plain,
    ( epred4_1(xu)
    | ~ aSet0(esk43_2(xu,xX)) ),
    inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4872,c_0_4873]),c_0_4870]),c_0_4871])])]) ).

cnf(c_0_4876,plain,
    ( epred4_1(X1)
    | aSet0(esk43_2(X1,X2))
    | ~ aSubsetOf0(X2,xY)
    | ~ isCountable0(X2) ),
    inference(rw,[status(thm)],[c_0_4874,c_0_4865]) ).

cnf(c_0_4877,negated_conjecture,
    ( ~ epred4_1(X1)
    | ~ aElementOf0(X1,xT) ),
    i_0_4233 ).

cnf(c_0_4878,plain,
    epred4_1(xu),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4875,c_0_4876]),c_0_4870]),c_0_4871])]) ).

cnf(c_0_4879,hypothesis,
    aElementOf0(xu,xT),
    i_0_4232 ).

cnf(c_0_4880,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4877,c_0_4878]),c_0_4879])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : NUM592+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.32  % Computer : n014.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Tue Jul  5 15:26:25 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 131.31/18.70  # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d60-l8000-e0.15+coop-eprover73:
% 131.31/18.70  # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d60-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 27; version: 991; iters: 150)
% 131.31/18.70  # Preprocessing time       : 2.368 s
% 131.31/18.70  # Presaturation interreduction done
% 131.31/18.70  
% 131.31/18.70  # Proof found!
% 131.31/18.70  # SZS status Theorem
% 131.31/18.70  # SZS output start CNFRefutation
% See solution above
% 131.31/18.70  # Training examples: 0 positive, 0 negative
% 131.31/18.70  
% 131.31/18.70  # -------------------------------------------------
% 131.31/18.70  # User time                : 15.144 s
% 131.31/18.70  # System time              : 0.235 s
% 131.31/18.70  # Total time               : 15.379 s
% 131.31/18.70  # ...preprocessing         : 2.368 s
% 131.31/18.70  # ...main loop             : 13.012 s
% 131.31/18.70  # Maximum resident set size: 199696 pages
% 131.31/18.70  
%------------------------------------------------------------------------------