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

View Problem - Process Solution

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

% 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 : Mon Jul 18 08:37:44 EDT 2022

% Result   : Theorem 8.82s 3.45s
% Output   : CNFRefutation 8.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   25 (  10 unt;   0 nHn;  25 RR)
%            Number of literals    :   52 (  16 equ;  29 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;  10 con; 0-2 aty)
%            Number of variables   :   19 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4200,hypothesis,
    ( sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2) = esk34_1(X1)
    | sbrdtbr0(X2) != xk
    | ~ aSet0(X2)
    | ~ aElementOf0(X1,szNzAzT0)
    | ~ aSubsetOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X1))) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5g2uh0ve/lgb.p',i_0_4200) ).

cnf(i_0_4230,hypothesis,
    ( aSubsetOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xi)))
    | ~ aElementOf0(X1,xX) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5g2uh0ve/lgb.p',i_0_4230) ).

cnf(i_0_4223,hypothesis,
    aElementOf0(xi,szNzAzT0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5g2uh0ve/lgb.p',i_0_4223) ).

cnf(i_0_4232,hypothesis,
    ( aSet0(X1)
    | ~ aElementOf0(X1,xX) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5g2uh0ve/lgb.p',i_0_4232) ).

cnf(i_0_4229,hypothesis,
    ( sbrdtbr0(X1) = xk
    | ~ aElementOf0(X1,xX) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5g2uh0ve/lgb.p',i_0_4229) ).

cnf(i_0_4210,hypothesis,
    ( sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2) = sdtlpdtrp0(xd,X1)
    | sbrdtbr0(X2) != xk
    | ~ aSet0(X2)
    | ~ aElementOf0(X1,szNzAzT0)
    | ~ aSubsetOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X1))) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5g2uh0ve/lgb.p',i_0_4210) ).

cnf(i_0_4222,hypothesis,
    sdtlpdtrp0(xd,xi) = xx,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5g2uh0ve/lgb.p',i_0_4222) ).

cnf(i_0_4224,hypothesis,
    aElementOf0(esk40_0,xX),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5g2uh0ve/lgb.p',i_0_4224) ).

cnf(i_0_4203,hypothesis,
    ( aElementOf0(esk34_1(X1),xT)
    | ~ aElementOf0(X1,szNzAzT0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5g2uh0ve/lgb.p',i_0_4203) ).

cnf(i_0_4234,negated_conjecture,
    ~ aElementOf0(xx,xT),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5g2uh0ve/lgb.p',i_0_4234) ).

cnf(c_0_4245,hypothesis,
    ( sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2) = esk34_1(X1)
    | sbrdtbr0(X2) != xk
    | ~ aSet0(X2)
    | ~ aElementOf0(X1,szNzAzT0)
    | ~ aSubsetOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X1))) ),
    i_0_4200 ).

cnf(c_0_4246,hypothesis,
    ( aSubsetOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xi)))
    | ~ aElementOf0(X1,xX) ),
    i_0_4230 ).

cnf(c_0_4247,hypothesis,
    aElementOf0(xi,szNzAzT0),
    i_0_4223 ).

cnf(c_0_4248,hypothesis,
    ( aSet0(X1)
    | ~ aElementOf0(X1,xX) ),
    i_0_4232 ).

cnf(c_0_4249,hypothesis,
    ( sbrdtbr0(X1) = xk
    | ~ aElementOf0(X1,xX) ),
    i_0_4229 ).

cnf(c_0_4250,hypothesis,
    ( sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2) = sdtlpdtrp0(xd,X1)
    | sbrdtbr0(X2) != xk
    | ~ aSet0(X2)
    | ~ aElementOf0(X1,szNzAzT0)
    | ~ aSubsetOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X1))) ),
    i_0_4210 ).

cnf(c_0_4251,hypothesis,
    sdtlpdtrp0(xd,xi) = xx,
    i_0_4222 ).

cnf(c_0_4252,hypothesis,
    ( sdtlpdtrp0(sdtlpdtrp0(xC,xi),X1) = esk34_1(xi)
    | ~ aElementOf0(X1,xX) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4245,c_0_4246]),c_0_4247])]),c_0_4248]),c_0_4249]) ).

cnf(c_0_4253,hypothesis,
    ( sdtlpdtrp0(sdtlpdtrp0(xC,xi),X1) = xx
    | ~ aElementOf0(X1,xX) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4250,c_0_4246]),c_0_4251]),c_0_4247])]),c_0_4248]),c_0_4249]) ).

cnf(c_0_4254,hypothesis,
    ( esk34_1(xi) = xx
    | ~ aElementOf0(X1,xX) ),
    inference(spm,[status(thm)],[c_0_4252,c_0_4253]) ).

cnf(c_0_4255,hypothesis,
    aElementOf0(esk40_0,xX),
    i_0_4224 ).

cnf(c_0_4256,hypothesis,
    ( aElementOf0(esk34_1(X1),xT)
    | ~ aElementOf0(X1,szNzAzT0) ),
    i_0_4203 ).

cnf(c_0_4257,hypothesis,
    esk34_1(xi) = xx,
    inference(spm,[status(thm)],[c_0_4254,c_0_4255]) ).

cnf(c_0_4258,negated_conjecture,
    ~ aElementOf0(xx,xT),
    i_0_4234 ).

cnf(c_0_4259,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4256,c_0_4257]),c_0_4247])]),c_0_4258]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : NUM595+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n008.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Thu Jul  7 08:38:55 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 8.82/3.45  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.82/3.45  # No SInE strategy applied
% 8.82/3.45  # Trying AutoSched0 for 150 seconds
% 8.82/3.45  # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 8.82/3.45  # and selection function SelectMaxLComplexAvoidPosPred.
% 8.82/3.45  #
% 8.82/3.45  # Preprocessing time       : 0.026 s
% 8.82/3.45  
% 8.82/3.45  # Proof found!
% 8.82/3.45  # SZS status Theorem
% 8.82/3.45  # SZS output start CNFRefutation
% See solution above
% 8.82/3.45  # Training examples: 0 positive, 0 negative
% 8.82/3.45  
% 8.82/3.45  # -------------------------------------------------
% 8.82/3.45  # User time                : 0.110 s
% 8.82/3.45  # System time              : 0.005 s
% 8.82/3.45  # Total time               : 0.115 s
% 8.82/3.45  # Maximum resident set size: 7124 pages
% 8.82/3.45  
%------------------------------------------------------------------------------