%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NUM582+1 : 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:36 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_168,hypothesis,
    ( aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2))
    | ~ sdtlseqdt0(X2,X1)
    | ~ aElementOf0(X2,szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hpm3c130/lgb.p',i_0_168) ).

cnf(i_0_163,hypothesis,
    sdtlpdtrp0(xN,sz00) = xS,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hpm3c130/lgb.p',i_0_163) ).

cnf(i_0_46,plain,
    aElementOf0(sz00,szNzAzT0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hpm3c130/lgb.p',i_0_46) ).

cnf(i_0_54,plain,
    ( sdtlseqdt0(sz00,X1)
    | ~ aElementOf0(X1,szNzAzT0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hpm3c130/lgb.p',i_0_54) ).

cnf(i_0_173,negated_conjecture,
    ~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hpm3c130/lgb.p',i_0_173) ).

cnf(i_0_170,hypothesis,
    aElementOf0(xi,szNzAzT0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hpm3c130/lgb.p',i_0_170) ).

cnf(c_0_180,hypothesis,
    ( aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2))
    | ~ sdtlseqdt0(X2,X1)
    | ~ aElementOf0(X2,szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0) ),
    i_0_168 ).

cnf(c_0_181,hypothesis,
    sdtlpdtrp0(xN,sz00) = xS,
    i_0_163 ).

cnf(c_0_182,plain,
    aElementOf0(sz00,szNzAzT0),
    i_0_46 ).

cnf(c_0_183,plain,
    ( sdtlseqdt0(sz00,X1)
    | ~ aElementOf0(X1,szNzAzT0) ),
    i_0_54 ).

cnf(c_0_184,negated_conjecture,
    ~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
    i_0_173 ).

cnf(c_0_185,hypothesis,
    ( aSubsetOf0(sdtlpdtrp0(xN,X1),xS)
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_180,c_0_181]),c_0_182])]),c_0_183]) ).

cnf(c_0_186,hypothesis,
    aElementOf0(xi,szNzAzT0),
    i_0_170 ).

cnf(c_0_187,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_184,c_0_185]),c_0_186])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NUM582+1 : 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 : Wed Jul  6 23:34:54 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.62/2.35  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.62/2.35  # No SInE strategy applied
% 7.62/2.35  # Trying AutoSched0 for 150 seconds
% 7.62/2.35  # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_RG_S04BN
% 7.62/2.35  # and selection function PSelectComplexExceptUniqMaxHorn.
% 7.62/2.35  #
% 7.62/2.35  # Preprocessing time       : 0.025 s
% 7.62/2.35  
% 7.62/2.35  # Proof found!
% 7.62/2.35  # SZS status Theorem
% 7.62/2.35  # SZS output start CNFRefutation
% See solution above
% 7.62/2.35  # Training examples: 0 positive, 0 negative
% 7.62/2.35  
% 7.62/2.35  # -------------------------------------------------
% 7.62/2.35  # User time                : 0.034 s
% 7.62/2.35  # System time              : 0.006 s
% 7.62/2.35  # Total time               : 0.040 s
% 7.62/2.35  # Maximum resident set size: 7124 pages
% 7.62/2.35  
%------------------------------------------------------------------------------