TSTP Solution File: NUM566+1 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n028.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:25 EDT 2022

% Result   : Theorem 8.78s 2.41s
% Output   : CNFRefutation 8.78s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   16
% Syntax   : Number of clauses     :   45 (  26 unt;   0 nHn;  45 RR)
%            Number of literals    :   82 (  12 equ;  41 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   7 con; 0-2 aty)
%            Number of variables   :   32 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_151,hypothesis,
    slbdtsldtrb0(xS,xK) = szDzozmdt0(xc),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pjxzc2pc/lgb.p',i_0_151) ).

cnf(i_0_157,hypothesis,
    xK = sz00,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pjxzc2pc/lgb.p',i_0_157) ).

cnf(i_0_158,hypothesis,
    aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pjxzc2pc/lgb.p',i_0_158) ).

cnf(i_0_161,negated_conjecture,
    ( aElementOf0(esk22_2(X1,X2),slbdtsldtrb0(X2,xK))
    | ~ isCountable0(X2)
    | ~ aElementOf0(X1,xT)
    | ~ aSubsetOf0(X2,xS) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pjxzc2pc/lgb.p',i_0_161) ).

cnf(i_0_15,plain,
    ( aSet0(X1)
    | ~ aSet0(X2)
    | ~ aSubsetOf0(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pjxzc2pc/lgb.p',i_0_15) ).

cnf(i_0_149,hypothesis,
    aSubsetOf0(xS,szNzAzT0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pjxzc2pc/lgb.p',i_0_149) ).

cnf(i_0_45,plain,
    aSet0(szNzAzT0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pjxzc2pc/lgb.p',i_0_45) ).

cnf(i_0_14,plain,
    ( aElementOf0(X1,X2)
    | ~ aSet0(X2)
    | ~ aElementOf0(X1,X3)
    | ~ aSubsetOf0(X3,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pjxzc2pc/lgb.p',i_0_14) ).

cnf(i_0_150,hypothesis,
    aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pjxzc2pc/lgb.p',i_0_150) ).

cnf(i_0_146,hypothesis,
    aSet0(xT),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pjxzc2pc/lgb.p',i_0_146) ).

cnf(i_0_133,plain,
    ( aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,szDzozmdt0(X1)))
    | ~ aFunction0(X1)
    | ~ aElementOf0(X2,szDzozmdt0(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pjxzc2pc/lgb.p',i_0_133) ).

cnf(i_0_152,hypothesis,
    aFunction0(xc),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pjxzc2pc/lgb.p',i_0_152) ).

cnf(i_0_17,plain,
    ( aSubsetOf0(X1,X1)
    | ~ aSet0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pjxzc2pc/lgb.p',i_0_17) ).

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

cnf(i_0_160,negated_conjecture,
    ( sdtlpdtrp0(xc,esk22_2(X1,X2)) != X1
    | ~ isCountable0(X2)
    | ~ aElementOf0(X1,xT)
    | ~ aSubsetOf0(X2,xS) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pjxzc2pc/lgb.p',i_0_160) ).

cnf(i_0_159,hypothesis,
    ( sdtlpdtrp0(xc,X1) = sdtlpdtrp0(xc,slcrc0)
    | ~ aElementOf0(X1,slbdtsldtrb0(xS,sz00)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pjxzc2pc/lgb.p',i_0_159) ).

cnf(c_0_178,hypothesis,
    slbdtsldtrb0(xS,xK) = szDzozmdt0(xc),
    i_0_151 ).

cnf(c_0_179,hypothesis,
    xK = sz00,
    i_0_157 ).

cnf(c_0_180,hypothesis,
    aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00)),
    i_0_158 ).

cnf(c_0_181,hypothesis,
    slbdtsldtrb0(xS,sz00) = szDzozmdt0(xc),
    inference(rw,[status(thm)],[c_0_178,c_0_179]) ).

cnf(c_0_182,negated_conjecture,
    ( aElementOf0(esk22_2(X1,X2),slbdtsldtrb0(X2,xK))
    | ~ isCountable0(X2)
    | ~ aElementOf0(X1,xT)
    | ~ aSubsetOf0(X2,xS) ),
    i_0_161 ).

cnf(c_0_183,plain,
    ( aSet0(X1)
    | ~ aSet0(X2)
    | ~ aSubsetOf0(X1,X2) ),
    i_0_15 ).

cnf(c_0_184,hypothesis,
    aSubsetOf0(xS,szNzAzT0),
    i_0_149 ).

cnf(c_0_185,plain,
    aSet0(szNzAzT0),
    i_0_45 ).

cnf(c_0_186,plain,
    ( aElementOf0(X1,X2)
    | ~ aSet0(X2)
    | ~ aElementOf0(X1,X3)
    | ~ aSubsetOf0(X3,X2) ),
    i_0_14 ).

cnf(c_0_187,hypothesis,
    aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT),
    i_0_150 ).

cnf(c_0_188,hypothesis,
    aSet0(xT),
    i_0_146 ).

cnf(c_0_189,plain,
    ( aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,szDzozmdt0(X1)))
    | ~ aFunction0(X1)
    | ~ aElementOf0(X2,szDzozmdt0(X1)) ),
    i_0_133 ).

cnf(c_0_190,hypothesis,
    aElementOf0(slcrc0,szDzozmdt0(xc)),
    inference(rw,[status(thm)],[c_0_180,c_0_181]) ).

cnf(c_0_191,hypothesis,
    aFunction0(xc),
    i_0_152 ).

cnf(c_0_192,negated_conjecture,
    ( aElementOf0(esk22_2(X1,X2),slbdtsldtrb0(X2,sz00))
    | ~ aSubsetOf0(X2,xS)
    | ~ isCountable0(X2)
    | ~ aElementOf0(X1,xT) ),
    inference(rw,[status(thm)],[c_0_182,c_0_179]) ).

cnf(c_0_193,plain,
    ( aSubsetOf0(X1,X1)
    | ~ aSet0(X1) ),
    i_0_17 ).

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

cnf(c_0_195,hypothesis,
    aSet0(xS),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_183,c_0_184]),c_0_185])]) ).

cnf(c_0_196,hypothesis,
    ( aElementOf0(X1,xT)
    | ~ aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_186,c_0_187]),c_0_188])]) ).

cnf(c_0_197,hypothesis,
    aElementOf0(sdtlpdtrp0(xc,slcrc0),sdtlcdtrc0(xc,szDzozmdt0(xc))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_189,c_0_190]),c_0_191])]) ).

cnf(c_0_198,negated_conjecture,
    ( sdtlpdtrp0(xc,esk22_2(X1,X2)) != X1
    | ~ isCountable0(X2)
    | ~ aElementOf0(X1,xT)
    | ~ aSubsetOf0(X2,xS) ),
    i_0_160 ).

cnf(c_0_199,hypothesis,
    ( sdtlpdtrp0(xc,X1) = sdtlpdtrp0(xc,slcrc0)
    | ~ aElementOf0(X1,slbdtsldtrb0(xS,sz00)) ),
    i_0_159 ).

cnf(c_0_200,plain,
    ( aElementOf0(esk22_2(X1,xS),szDzozmdt0(xc))
    | ~ aElementOf0(X1,xT) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_192,c_0_193]),c_0_181]),c_0_194])]),c_0_195])]) ).

cnf(c_0_201,hypothesis,
    aElementOf0(sdtlpdtrp0(xc,slcrc0),xT),
    inference(spm,[status(thm)],[c_0_196,c_0_197]) ).

cnf(c_0_202,plain,
    ( sdtlpdtrp0(xc,esk22_2(X1,xS)) != X1
    | ~ aElementOf0(X1,xT) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_198,c_0_193]),c_0_194])]),c_0_195])]) ).

cnf(c_0_203,hypothesis,
    ( sdtlpdtrp0(xc,X1) = sdtlpdtrp0(xc,slcrc0)
    | ~ aElementOf0(X1,szDzozmdt0(xc)) ),
    inference(rw,[status(thm)],[c_0_199,c_0_181]) ).

cnf(c_0_204,plain,
    aElementOf0(esk22_2(sdtlpdtrp0(xc,slcrc0),xS),szDzozmdt0(xc)),
    inference(spm,[status(thm)],[c_0_200,c_0_201]) ).

cnf(c_0_205,plain,
    sdtlpdtrp0(xc,esk22_2(sdtlpdtrp0(xc,slcrc0),xS)) != sdtlpdtrp0(xc,slcrc0),
    inference(spm,[status(thm)],[c_0_202,c_0_201]) ).

cnf(c_0_206,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_203,c_0_204]),c_0_205]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : NUM566+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.33  % Computer : n028.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Wed Jul  6 12:45:54 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 8.78/2.41  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.78/2.41  # No SInE strategy applied
% 8.78/2.41  # Trying AutoSched0 for 150 seconds
% 8.78/2.41  # AutoSched0-Mode selected heuristic G_E___008_C18_F1_PI_SE_CS_SP_CO_S4S
% 8.78/2.41  # and selection function SelectNewComplexAHPNS.
% 8.78/2.41  #
% 8.78/2.41  # Preprocessing time       : 0.013 s
% 8.78/2.41  
% 8.78/2.41  # Proof found!
% 8.78/2.41  # SZS status Theorem
% 8.78/2.41  # SZS output start CNFRefutation
% See solution above
% 8.78/2.41  # Training examples: 0 positive, 0 negative
% 8.78/2.41  
% 8.78/2.41  # -------------------------------------------------
% 8.78/2.41  # User time                : 0.017 s
% 8.78/2.41  # System time              : 0.005 s
% 8.78/2.41  # Total time               : 0.022 s
% 8.78/2.41  # Maximum resident set size: 7124 pages
% 8.78/2.41  
%------------------------------------------------------------------------------