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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SWC100+1 : TPTP v8.1.0. Released v2.4.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 : Tue Jul 19 20:13:37 EDT 2022

% Result   : Theorem 7.80s 2.36s
% Output   : CNFRefutation 7.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   39 (  18 unt;   2 nHn;  39 RR)
%            Number of literals    :   81 (  33 equ;  44 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   20 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_113,plain,
    ( frontsegP(X1,X2)
    | app(X2,X3) != X1
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f_06zsck/lgb.p',i_0_113) ).

cnf(i_0_58,plain,
    ( ssList(app(X1,X2))
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f_06zsck/lgb.p',i_0_58) ).

cnf(i_0_198,negated_conjecture,
    app(esk50_0,esk52_0) = esk51_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f_06zsck/lgb.p',i_0_198) ).

cnf(i_0_200,negated_conjecture,
    esk50_0 = esk48_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f_06zsck/lgb.p',i_0_200) ).

cnf(i_0_201,negated_conjecture,
    esk49_0 = esk51_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f_06zsck/lgb.p',i_0_201) ).

cnf(i_0_199,negated_conjecture,
    ssList(esk52_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f_06zsck/lgb.p',i_0_199) ).

cnf(i_0_205,negated_conjecture,
    ssList(esk48_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f_06zsck/lgb.p',i_0_205) ).

cnf(i_0_193,negated_conjecture,
    ( nil = esk49_0
    | ~ neq(esk48_0,nil)
    | ~ frontsegP(esk49_0,esk48_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f_06zsck/lgb.p',i_0_193) ).

cnf(i_0_195,negated_conjecture,
    ( nil = esk51_0
    | esk50_0 != nil ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f_06zsck/lgb.p',i_0_195) ).

cnf(i_0_157,plain,
    ( nil = X1
    | app(X1,X2) != nil
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f_06zsck/lgb.p',i_0_157) ).

cnf(i_0_41,plain,
    ( X1 = X2
    | neq(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f_06zsck/lgb.p',i_0_41) ).

cnf(i_0_44,plain,
    ssList(nil),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f_06zsck/lgb.p',i_0_44) ).

cnf(i_0_191,negated_conjecture,
    ( nil != esk48_0
    | ~ neq(esk48_0,nil)
    | ~ frontsegP(esk49_0,esk48_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f_06zsck/lgb.p',i_0_191) ).

cnf(i_0_192,negated_conjecture,
    ( neq(esk49_0,nil)
    | nil != esk48_0 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f_06zsck/lgb.p',i_0_192) ).

cnf(c_0_220,plain,
    ( frontsegP(X1,X2)
    | app(X2,X3) != X1
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3) ),
    i_0_113 ).

cnf(c_0_221,plain,
    ( ssList(app(X1,X2))
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    i_0_58 ).

cnf(c_0_222,negated_conjecture,
    app(esk50_0,esk52_0) = esk51_0,
    i_0_198 ).

cnf(c_0_223,negated_conjecture,
    esk50_0 = esk48_0,
    i_0_200 ).

cnf(c_0_224,negated_conjecture,
    esk49_0 = esk51_0,
    i_0_201 ).

cnf(c_0_225,plain,
    ( frontsegP(app(X1,X2),X1)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_220]),c_0_221]) ).

cnf(c_0_226,negated_conjecture,
    app(esk48_0,esk52_0) = esk49_0,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_222,c_0_223]),c_0_224]) ).

cnf(c_0_227,negated_conjecture,
    ssList(esk52_0),
    i_0_199 ).

cnf(c_0_228,negated_conjecture,
    ssList(esk48_0),
    i_0_205 ).

cnf(c_0_229,negated_conjecture,
    ( nil = esk49_0
    | ~ neq(esk48_0,nil)
    | ~ frontsegP(esk49_0,esk48_0) ),
    i_0_193 ).

cnf(c_0_230,negated_conjecture,
    frontsegP(esk49_0,esk48_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_225,c_0_226]),c_0_227]),c_0_228])]) ).

cnf(c_0_231,negated_conjecture,
    ( nil = esk51_0
    | esk50_0 != nil ),
    i_0_195 ).

cnf(c_0_232,plain,
    ( nil = X1
    | app(X1,X2) != nil
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    i_0_157 ).

cnf(c_0_233,negated_conjecture,
    ( esk49_0 = nil
    | ~ neq(esk48_0,nil) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_229,c_0_230])]) ).

cnf(c_0_234,plain,
    ( X1 = X2
    | neq(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    i_0_41 ).

cnf(c_0_235,plain,
    ssList(nil),
    i_0_44 ).

cnf(c_0_236,negated_conjecture,
    ( esk49_0 = nil
    | esk48_0 != nil ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_231,c_0_224]),c_0_223]) ).

cnf(c_0_237,negated_conjecture,
    ( nil != esk48_0
    | ~ neq(esk48_0,nil)
    | ~ frontsegP(esk49_0,esk48_0) ),
    i_0_191 ).

cnf(c_0_238,negated_conjecture,
    ( esk48_0 = nil
    | esk49_0 != nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_226]),c_0_227]),c_0_228])]) ).

cnf(c_0_239,plain,
    esk49_0 = nil,
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_233,c_0_234]),c_0_235]),c_0_228])]),c_0_236]) ).

cnf(c_0_240,negated_conjecture,
    ( esk48_0 != nil
    | ~ neq(esk48_0,nil) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_237,c_0_230])]) ).

cnf(c_0_241,negated_conjecture,
    esk48_0 = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_238,c_0_239])]) ).

cnf(c_0_242,negated_conjecture,
    ( neq(esk49_0,nil)
    | nil != esk48_0 ),
    i_0_192 ).

cnf(c_0_243,negated_conjecture,
    ~ neq(nil,nil),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_240,c_0_241]),c_0_241])]) ).

cnf(c_0_244,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_242,c_0_239]),c_0_241])]),c_0_243]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SWC100+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.34  % Computer : n028.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Sun Jun 12 16:09:53 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.46  # ENIGMATIC: Selected SinE mode:
% 0.21/0.47  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.21/0.47  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.21/0.47  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.80/2.36  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.80/2.36  # No SInE strategy applied
% 7.80/2.36  # Trying AutoSched0 for 150 seconds
% 7.80/2.36  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 7.80/2.36  # and selection function SelectNewComplexAHP.
% 7.80/2.36  #
% 7.80/2.36  # Preprocessing time       : 0.024 s
% 7.80/2.36  # Presaturation interreduction done
% 7.80/2.36  
% 7.80/2.36  # Proof found!
% 7.80/2.36  # SZS status Theorem
% 7.80/2.36  # SZS output start CNFRefutation
% See solution above
% 7.80/2.36  # Training examples: 0 positive, 0 negative
% 7.80/2.36  
% 7.80/2.36  # -------------------------------------------------
% 7.80/2.36  # User time                : 0.034 s
% 7.80/2.36  # System time              : 0.009 s
% 7.80/2.36  # Total time               : 0.043 s
% 7.80/2.36  # Maximum resident set size: 7124 pages
% 7.80/2.36  
%------------------------------------------------------------------------------