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

View Problem - Process Solution

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

% Computer : n011.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:23 EDT 2022

% Result   : Theorem 9.95s 3.69s
% Output   : CNFRefutation 9.95s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   19
% Syntax   : Number of clauses     :   58 (  22 unt;   6 nHn;  58 RR)
%            Number of literals    :  124 (  26 equ;  66 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;   7 con; 0-2 aty)
%            Number of variables   :   46 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_13,plain,
    ( aSubsetOf0(X1,X2)
    | aElementOf0(esk2_2(X2,X1),X1)
    | ~ aSet0(X1)
    | ~ aSet0(X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fsclf_kc/lgb.p',i_0_13) ).

cnf(i_0_151,hypothesis,
    aSet0(xS),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fsclf_kc/lgb.p',i_0_151) ).

cnf(i_0_109,plain,
    ( isFinite0(X1)
    | slbdtsldtrb0(X1,X2) != slcrc0
    | ~ aSet0(X1)
    | ~ aElementOf0(X2,szNzAzT0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fsclf_kc/lgb.p',i_0_109) ).

cnf(i_0_158,hypothesis,
    slbdtsldtrb0(xS,xK) = szDzozmdt0(xc),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fsclf_kc/lgb.p',i_0_158) ).

cnf(i_0_147,hypothesis,
    aElementOf0(xK,szNzAzT0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fsclf_kc/lgb.p',i_0_147) ).

cnf(i_0_12,plain,
    ( aSubsetOf0(X1,X2)
    | ~ aSet0(X1)
    | ~ aSet0(X2)
    | ~ aElementOf0(esk2_2(X2,X1),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fsclf_kc/lgb.p',i_0_12) ).

cnf(i_0_116,plain,
    ( aSet0(szDzozmdt0(X1))
    | ~ aFunction0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fsclf_kc/lgb.p',i_0_116) ).

cnf(i_0_166,hypothesis,
    aFunction0(xc),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fsclf_kc/lgb.p',i_0_166) ).

cnf(i_0_10,plain,
    ( ~ aSet0(X1)
    | ~ isFinite0(X1)
    | ~ isCountable0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fsclf_kc/lgb.p',i_0_10) ).

cnf(i_0_148,hypothesis,
    isCountable0(xS),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fsclf_kc/lgb.p',i_0_148) ).

cnf(i_0_4137,negated_conjecture,
    ( aElementOf0(esk32_2(X1,X2),slbdtsldtrb0(X2,xK))
    | ~ isCountable0(X2)
    | ~ aElementOf0(X1,xT)
    | ~ aSubsetOf0(X2,xS) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fsclf_kc/lgb.p',i_0_4137) ).

cnf(i_0_5,plain,
    ( X1 = slcrc0
    | aElementOf0(esk1_1(X1),X1)
    | ~ aSet0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fsclf_kc/lgb.p',i_0_5) ).

cnf(i_0_69,plain,
    ( X1 = slcrc0
    | sbrdtbr0(X1) != sz00
    | ~ aSet0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fsclf_kc/lgb.p',i_0_69) ).

cnf(i_0_4154,negated_conjecture,
    xK = sz00,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fsclf_kc/lgb.p',i_0_4154) ).

cnf(i_0_162,hypothesis,
    ( sbrdtbr0(X1) = xK
    | ~ aElementOf0(X1,szDzozmdt0(xc)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fsclf_kc/lgb.p',i_0_162) ).

cnf(i_0_165,hypothesis,
    ( aSet0(X1)
    | ~ aElementOf0(X1,szDzozmdt0(xc)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fsclf_kc/lgb.p',i_0_165) ).

cnf(i_0_154,hypothesis,
    ( aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc)))
    | sdtlpdtrp0(xc,X2) != X1
    | ~ aElementOf0(X2,szDzozmdt0(xc)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fsclf_kc/lgb.p',i_0_154) ).

cnf(i_0_4136,negated_conjecture,
    ( sdtlpdtrp0(xc,esk32_2(X1,X2)) != X1
    | ~ isCountable0(X2)
    | ~ aElementOf0(X1,xT)
    | ~ aSubsetOf0(X2,xS) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fsclf_kc/lgb.p',i_0_4136) ).

cnf(i_0_153,hypothesis,
    ( aElementOf0(X1,xT)
    | ~ aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc))) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fsclf_kc/lgb.p',i_0_153) ).

cnf(c_0_4174,plain,
    ( aSubsetOf0(X1,X2)
    | aElementOf0(esk2_2(X2,X1),X1)
    | ~ aSet0(X1)
    | ~ aSet0(X2) ),
    i_0_13 ).

cnf(c_0_4175,hypothesis,
    aSet0(xS),
    i_0_151 ).

cnf(c_0_4176,hypothesis,
    ( aSubsetOf0(X1,xS)
    | aElementOf0(esk2_2(xS,X1),X1)
    | ~ aSet0(X1) ),
    inference(spm,[status(thm)],[c_0_4174,c_0_4175]) ).

cnf(c_0_4177,plain,
    ( isFinite0(X1)
    | slbdtsldtrb0(X1,X2) != slcrc0
    | ~ aSet0(X1)
    | ~ aElementOf0(X2,szNzAzT0) ),
    i_0_109 ).

cnf(c_0_4178,hypothesis,
    slbdtsldtrb0(xS,xK) = szDzozmdt0(xc),
    i_0_158 ).

cnf(c_0_4179,hypothesis,
    aElementOf0(xK,szNzAzT0),
    i_0_147 ).

cnf(c_0_4180,plain,
    ( aSubsetOf0(X1,X2)
    | ~ aSet0(X1)
    | ~ aSet0(X2)
    | ~ aElementOf0(esk2_2(X2,X1),X2) ),
    i_0_12 ).

cnf(c_0_4181,hypothesis,
    ( aSubsetOf0(xS,xS)
    | aElementOf0(esk2_2(xS,xS),xS) ),
    inference(spm,[status(thm)],[c_0_4176,c_0_4175]) ).

cnf(c_0_4182,plain,
    ( aSet0(szDzozmdt0(X1))
    | ~ aFunction0(X1) ),
    i_0_116 ).

cnf(c_0_4183,hypothesis,
    aFunction0(xc),
    i_0_166 ).

cnf(c_0_4184,plain,
    ( ~ aSet0(X1)
    | ~ isFinite0(X1)
    | ~ isCountable0(X1) ),
    i_0_10 ).

cnf(c_0_4185,hypothesis,
    ( isFinite0(xS)
    | szDzozmdt0(xc) != slcrc0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4177,c_0_4178]),c_0_4179]),c_0_4175])]) ).

cnf(c_0_4186,hypothesis,
    isCountable0(xS),
    i_0_148 ).

cnf(c_0_4187,negated_conjecture,
    ( aElementOf0(esk32_2(X1,X2),slbdtsldtrb0(X2,xK))
    | ~ isCountable0(X2)
    | ~ aElementOf0(X1,xT)
    | ~ aSubsetOf0(X2,xS) ),
    i_0_4137 ).

cnf(c_0_4188,plain,
    aSubsetOf0(xS,xS),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4180,c_0_4181]),c_0_4175])]) ).

cnf(c_0_4189,plain,
    ( X1 = slcrc0
    | aElementOf0(esk1_1(X1),X1)
    | ~ aSet0(X1) ),
    i_0_5 ).

cnf(c_0_4190,hypothesis,
    aSet0(szDzozmdt0(xc)),
    inference(spm,[status(thm)],[c_0_4182,c_0_4183]) ).

cnf(c_0_4191,plain,
    szDzozmdt0(xc) != slcrc0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4184,c_0_4185]),c_0_4186]),c_0_4175])]) ).

cnf(c_0_4192,plain,
    ( X1 = slcrc0
    | sbrdtbr0(X1) != sz00
    | ~ aSet0(X1) ),
    i_0_69 ).

cnf(c_0_4193,negated_conjecture,
    xK = sz00,
    i_0_4154 ).

cnf(c_0_4194,hypothesis,
    ( sbrdtbr0(X1) = xK
    | ~ aElementOf0(X1,szDzozmdt0(xc)) ),
    i_0_162 ).

cnf(c_0_4195,hypothesis,
    ( aElementOf0(esk32_2(X1,xS),szDzozmdt0(xc))
    | ~ aElementOf0(X1,xT) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4187,c_0_4178]),c_0_4188]),c_0_4186])]) ).

cnf(c_0_4196,hypothesis,
    ( aSet0(X1)
    | ~ aElementOf0(X1,szDzozmdt0(xc)) ),
    i_0_165 ).

cnf(c_0_4197,hypothesis,
    aElementOf0(esk1_1(szDzozmdt0(xc)),szDzozmdt0(xc)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_4189,c_0_4190]),c_0_4191]) ).

cnf(c_0_4198,plain,
    ( X1 = slcrc0
    | sbrdtbr0(X1) != xK
    | ~ aSet0(X1) ),
    inference(rw,[status(thm)],[c_0_4192,c_0_4193]) ).

cnf(c_0_4199,hypothesis,
    ( sbrdtbr0(esk32_2(X1,xS)) = xK
    | ~ aElementOf0(X1,xT) ),
    inference(spm,[status(thm)],[c_0_4194,c_0_4195]) ).

cnf(c_0_4200,hypothesis,
    ( aSet0(esk32_2(X1,xS))
    | ~ aElementOf0(X1,xT) ),
    inference(spm,[status(thm)],[c_0_4196,c_0_4195]) ).

cnf(c_0_4201,hypothesis,
    ( aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc)))
    | sdtlpdtrp0(xc,X2) != X1
    | ~ aElementOf0(X2,szDzozmdt0(xc)) ),
    i_0_154 ).

cnf(c_0_4202,hypothesis,
    sbrdtbr0(esk1_1(szDzozmdt0(xc))) = xK,
    inference(spm,[status(thm)],[c_0_4194,c_0_4197]) ).

cnf(c_0_4203,hypothesis,
    aSet0(esk1_1(szDzozmdt0(xc))),
    inference(spm,[status(thm)],[c_0_4196,c_0_4197]) ).

cnf(c_0_4204,negated_conjecture,
    ( sdtlpdtrp0(xc,esk32_2(X1,X2)) != X1
    | ~ isCountable0(X2)
    | ~ aElementOf0(X1,xT)
    | ~ aSubsetOf0(X2,xS) ),
    i_0_4136 ).

cnf(c_0_4205,plain,
    ( esk32_2(X1,xS) = slcrc0
    | ~ aElementOf0(X1,xT) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_4198,c_0_4199]),c_0_4200]) ).

cnf(c_0_4206,hypothesis,
    ( aElementOf0(X1,xT)
    | ~ aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc))) ),
    i_0_153 ).

cnf(c_0_4207,hypothesis,
    ( aElementOf0(sdtlpdtrp0(xc,X1),sdtlcdtrc0(xc,szDzozmdt0(xc)))
    | ~ aElementOf0(X1,szDzozmdt0(xc)) ),
    inference(er,[status(thm)],[c_0_4201]) ).

cnf(c_0_4208,plain,
    esk1_1(szDzozmdt0(xc)) = slcrc0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4198,c_0_4202]),c_0_4203])]) ).

cnf(c_0_4209,negated_conjecture,
    ~ aElementOf0(sdtlpdtrp0(xc,slcrc0),xT),
    inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4204,c_0_4205]),c_0_4188]),c_0_4186])])]) ).

cnf(c_0_4210,hypothesis,
    ( aElementOf0(sdtlpdtrp0(xc,X1),xT)
    | ~ aElementOf0(X1,szDzozmdt0(xc)) ),
    inference(spm,[status(thm)],[c_0_4206,c_0_4207]) ).

cnf(c_0_4211,hypothesis,
    aElementOf0(slcrc0,szDzozmdt0(xc)),
    inference(rw,[status(thm)],[c_0_4197,c_0_4208]) ).

cnf(c_0_4212,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4209,c_0_4210]),c_0_4211])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : NUM563+3 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.36  % Computer : n011.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Wed Jul  6 18:52:25 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.21/0.47  # ENIGMATIC: Selected complete mode:
% 9.95/3.69  # ENIGMATIC: Solved by autoschedule-lgb:
% 9.95/3.69  # No SInE strategy applied
% 9.95/3.69  # Trying AutoSched0 for 150 seconds
% 9.95/3.69  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 9.95/3.69  # and selection function SelectComplexExceptUniqMaxHorn.
% 9.95/3.69  #
% 9.95/3.69  # Preprocessing time       : 0.026 s
% 9.95/3.69  # Presaturation interreduction done
% 9.95/3.69  
% 9.95/3.69  # Proof found!
% 9.95/3.69  # SZS status Theorem
% 9.95/3.69  # SZS output start CNFRefutation
% See solution above
% 9.95/3.69  # Training examples: 0 positive, 0 negative
% 9.95/3.69  
% 9.95/3.69  # -------------------------------------------------
% 9.95/3.69  # User time                : 0.047 s
% 9.95/3.69  # System time              : 0.005 s
% 9.95/3.69  # Total time               : 0.052 s
% 9.95/3.69  # Maximum resident set size: 7120 pages
% 9.95/3.69  
%------------------------------------------------------------------------------