TSTP Solution File: NUM449+6 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n018.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:36:07 EDT 2022

% Result   : Theorem 9.52s 2.49s
% Output   : CNFRefutation 9.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   29 (  13 unt;   7 nHn;  29 RR)
%            Number of literals    :   63 (  12 equ;  32 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_124,hypothesis,
    ( szAzrzSzezqlpdtcmdtrp0(sz00,esk16_1(X1)) = X1
    | ~ aElementOf0(X1,xS) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_0mj3xua/lgb.p',i_0_124) ).

cnf(i_0_110,plain,
    ( isClosed0(sbsmnsldt0(X1))
    | aElementOf0(esk15_1(X1),X1)
    | ~ aSet0(X1)
    | ~ isFinite0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_0mj3xua/lgb.p',i_0_110) ).

cnf(i_0_137,hypothesis,
    aSet0(xS),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_0mj3xua/lgb.p',i_0_137) ).

cnf(i_0_151,hypothesis,
    isFinite0(xS),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_0mj3xua/lgb.p',i_0_151) ).

cnf(i_0_152,negated_conjecture,
    ~ isClosed0(sbsmnsldt0(xS)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_0mj3xua/lgb.p',i_0_152) ).

cnf(i_0_136,hypothesis,
    ( aInteger0(esk16_1(X1))
    | ~ aElementOf0(X1,xS) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_0mj3xua/lgb.p',i_0_136) ).

cnf(i_0_111,plain,
    ( X1 = sz00
    | isClosed0(szAzrzSzezqlpdtcmdtrp0(X2,X1))
    | ~ aInteger0(X1)
    | ~ aInteger0(X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_0mj3xua/lgb.p',i_0_111) ).

cnf(i_0_2,plain,
    aInteger0(sz00),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_0mj3xua/lgb.p',i_0_2) ).

cnf(i_0_109,plain,
    ( isClosed0(sbsmnsldt0(X1))
    | ~ aSet0(X1)
    | ~ isFinite0(X1)
    | ~ isClosed0(esk15_1(X1))
    | ~ aSubsetOf0(esk15_1(X1),cS1395) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_0mj3xua/lgb.p',i_0_109) ).

cnf(i_0_112,plain,
    ( X1 = sz00
    | aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(X2,X1),cS1395)
    | ~ aInteger0(X1)
    | ~ aInteger0(X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_0mj3xua/lgb.p',i_0_112) ).

cnf(i_0_135,hypothesis,
    ( esk16_1(X1) != sz00
    | ~ aElementOf0(X1,xS) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_0mj3xua/lgb.p',i_0_135) ).

cnf(c_0_164,hypothesis,
    ( szAzrzSzezqlpdtcmdtrp0(sz00,esk16_1(X1)) = X1
    | ~ aElementOf0(X1,xS) ),
    i_0_124 ).

cnf(c_0_165,plain,
    ( isClosed0(sbsmnsldt0(X1))
    | aElementOf0(esk15_1(X1),X1)
    | ~ aSet0(X1)
    | ~ isFinite0(X1) ),
    i_0_110 ).

cnf(c_0_166,hypothesis,
    aSet0(xS),
    i_0_137 ).

cnf(c_0_167,hypothesis,
    isFinite0(xS),
    i_0_151 ).

cnf(c_0_168,negated_conjecture,
    ~ isClosed0(sbsmnsldt0(xS)),
    i_0_152 ).

cnf(c_0_169,hypothesis,
    ( aInteger0(esk16_1(X1))
    | ~ aElementOf0(X1,xS) ),
    i_0_136 ).

cnf(c_0_170,plain,
    ( X1 = sz00
    | isClosed0(szAzrzSzezqlpdtcmdtrp0(X2,X1))
    | ~ aInteger0(X1)
    | ~ aInteger0(X2) ),
    i_0_111 ).

cnf(c_0_171,hypothesis,
    szAzrzSzezqlpdtcmdtrp0(sz00,esk16_1(esk15_1(xS))) = esk15_1(xS),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_164,c_0_165]),c_0_166]),c_0_167])]),c_0_168]) ).

cnf(c_0_172,plain,
    aInteger0(sz00),
    i_0_2 ).

cnf(c_0_173,hypothesis,
    aInteger0(esk16_1(esk15_1(xS))),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_169,c_0_165]),c_0_166]),c_0_167])]),c_0_168]) ).

cnf(c_0_174,plain,
    ( isClosed0(sbsmnsldt0(X1))
    | ~ aSet0(X1)
    | ~ isFinite0(X1)
    | ~ isClosed0(esk15_1(X1))
    | ~ aSubsetOf0(esk15_1(X1),cS1395) ),
    i_0_109 ).

cnf(c_0_175,plain,
    ( esk16_1(esk15_1(xS)) = sz00
    | isClosed0(esk15_1(xS)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_170,c_0_171]),c_0_172]),c_0_173])]) ).

cnf(c_0_176,plain,
    ( X1 = sz00
    | aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(X2,X1),cS1395)
    | ~ aInteger0(X1)
    | ~ aInteger0(X2) ),
    i_0_112 ).

cnf(c_0_177,plain,
    ( esk16_1(esk15_1(xS)) = sz00
    | ~ aSubsetOf0(esk15_1(xS),cS1395) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_174,c_0_175]),c_0_166]),c_0_167])]),c_0_168]) ).

cnf(c_0_178,hypothesis,
    ( esk16_1(X1) != sz00
    | ~ aElementOf0(X1,xS) ),
    i_0_135 ).

cnf(c_0_179,plain,
    esk16_1(esk15_1(xS)) = sz00,
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_176,c_0_171]),c_0_172]),c_0_173])]),c_0_177]) ).

cnf(c_0_180,hypothesis,
    ~ aElementOf0(esk15_1(xS),xS),
    inference(spm,[status(thm)],[c_0_178,c_0_179]) ).

cnf(c_0_181,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_180,c_0_165]),c_0_166]),c_0_167])]),c_0_168]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : NUM449+6 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n018.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Fri Jul  8 01:22:42 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.20/0.44  # ENIGMATIC: Selected complete mode:
% 9.52/2.49  # ENIGMATIC: Solved by autoschedule-lgb:
% 9.52/2.49  # No SInE strategy applied
% 9.52/2.49  # Trying AutoSched0 for 150 seconds
% 9.52/2.49  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 9.52/2.49  # and selection function SelectNewComplexAHP.
% 9.52/2.49  #
% 9.52/2.49  # Preprocessing time       : 0.026 s
% 9.52/2.49  # Presaturation interreduction done
% 9.52/2.49  
% 9.52/2.49  # Proof found!
% 9.52/2.49  # SZS status Theorem
% 9.52/2.49  # SZS output start CNFRefutation
% See solution above
% 9.52/2.49  # Training examples: 0 positive, 0 negative
% 9.52/2.49  
% 9.52/2.49  # -------------------------------------------------
% 9.52/2.49  # User time                : 0.038 s
% 9.52/2.49  # System time              : 0.004 s
% 9.52/2.49  # Total time               : 0.042 s
% 9.52/2.49  # Maximum resident set size: 7124 pages
% 9.52/2.49  
%------------------------------------------------------------------------------