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

View Problem - Process Solution

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

% Computer : n021.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:14:19 EDT 2022

% Result   : Theorem 7.89s 2.53s
% Output   : CNFRefutation 7.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   15
% Syntax   : Number of clauses     :   50 (  22 unt;  11 nHn;  50 RR)
%            Number of literals    :  117 (  38 equ;  65 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :   45 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_192,negated_conjecture,
    ~ neq(esk48_0,nil),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hpc_jcvv/lgb.p',i_0_192) ).

cnf(i_0_195,negated_conjecture,
    esk50_0 = esk48_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hpc_jcvv/lgb.p',i_0_195) ).

cnf(i_0_200,negated_conjecture,
    ssList(esk48_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hpc_jcvv/lgb.p',i_0_200) ).

cnf(i_0_193,negated_conjecture,
    ( app(X1,cons(X2,nil)) = esk50_0
    | app(cons(X2,nil),X1) != esk51_0
    | ~ ssList(X1)
    | ~ ssItem(X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hpc_jcvv/lgb.p',i_0_193) ).

cnf(i_0_196,negated_conjecture,
    esk49_0 = esk51_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hpc_jcvv/lgb.p',i_0_196) ).

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

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

cnf(i_0_154,plain,
    ( app(cons(X1,nil),X2) = cons(X1,X2)
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hpc_jcvv/lgb.p',i_0_154) ).

cnf(i_0_81,plain,
    ( memberP(X1,X2)
    | app(X3,cons(X2,X4)) != X1
    | ~ ssList(X1)
    | ~ ssList(X4)
    | ~ ssList(X3)
    | ~ ssItem(X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hpc_jcvv/lgb.p',i_0_81) ).

cnf(i_0_79,plain,
    ( ~ ssItem(X1)
    | ~ memberP(nil,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hpc_jcvv/lgb.p',i_0_79) ).

cnf(i_0_50,plain,
    ( nil = X1
    | cons(esk26_1(X1),esk25_1(X1)) = X1
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hpc_jcvv/lgb.p',i_0_50) ).

cnf(i_0_199,negated_conjecture,
    ssList(esk49_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hpc_jcvv/lgb.p',i_0_199) ).

cnf(i_0_51,plain,
    ( nil = X1
    | ssItem(esk26_1(X1))
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hpc_jcvv/lgb.p',i_0_51) ).

cnf(i_0_52,plain,
    ( nil = X1
    | ssList(esk25_1(X1))
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hpc_jcvv/lgb.p',i_0_52) ).

cnf(i_0_194,negated_conjecture,
    neq(esk49_0,nil),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hpc_jcvv/lgb.p',i_0_194) ).

cnf(c_0_216,negated_conjecture,
    ~ neq(esk48_0,nil),
    i_0_192 ).

cnf(c_0_217,negated_conjecture,
    esk50_0 = esk48_0,
    i_0_195 ).

cnf(c_0_218,negated_conjecture,
    ssList(esk48_0),
    i_0_200 ).

cnf(c_0_219,negated_conjecture,
    ( app(X1,cons(X2,nil)) = esk50_0
    | app(cons(X2,nil),X1) != esk51_0
    | ~ ssList(X1)
    | ~ ssItem(X2) ),
    i_0_193 ).

cnf(c_0_220,negated_conjecture,
    esk49_0 = esk51_0,
    i_0_196 ).

cnf(c_0_221,negated_conjecture,
    ~ neq(esk50_0,nil),
    inference(rw,[status(thm)],[c_0_216,c_0_217]) ).

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

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

cnf(c_0_224,negated_conjecture,
    ssList(esk50_0),
    inference(rw,[status(thm)],[c_0_218,c_0_217]) ).

cnf(c_0_225,negated_conjecture,
    ( app(X1,cons(X2,nil)) = esk50_0
    | app(cons(X2,nil),X1) != esk49_0
    | ~ ssItem(X2)
    | ~ ssList(X1) ),
    inference(rw,[status(thm)],[c_0_219,c_0_220]) ).

cnf(c_0_226,negated_conjecture,
    nil = esk50_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_221,c_0_222]),c_0_223]),c_0_224])]) ).

cnf(c_0_227,plain,
    ( app(cons(X1,nil),X2) = cons(X1,X2)
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    i_0_154 ).

cnf(c_0_228,plain,
    ( memberP(X1,X2)
    | app(X3,cons(X2,X4)) != X1
    | ~ ssList(X1)
    | ~ ssList(X4)
    | ~ ssList(X3)
    | ~ ssItem(X2) ),
    i_0_81 ).

cnf(c_0_229,negated_conjecture,
    ( app(X1,cons(X2,esk50_0)) = esk50_0
    | app(cons(X2,esk50_0),X1) != esk49_0
    | ~ ssItem(X2)
    | ~ ssList(X1) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_225,c_0_226]),c_0_226]) ).

cnf(c_0_230,plain,
    ( app(cons(X1,esk50_0),X2) = cons(X1,X2)
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    inference(rw,[status(thm)],[c_0_227,c_0_226]) ).

cnf(c_0_231,plain,
    ( ~ ssItem(X1)
    | ~ memberP(nil,X1) ),
    i_0_79 ).

cnf(c_0_232,plain,
    ( memberP(app(X1,cons(X2,X3)),X2)
    | ~ ssItem(X2)
    | ~ ssList(app(X1,cons(X2,X3)))
    | ~ ssList(X3)
    | ~ ssList(X1) ),
    inference(er,[status(thm)],[c_0_228]) ).

cnf(c_0_233,negated_conjecture,
    ( app(X1,cons(X2,esk50_0)) = esk50_0
    | cons(X2,X1) != esk49_0
    | ~ ssItem(X2)
    | ~ ssList(X1) ),
    inference(spm,[status(thm)],[c_0_229,c_0_230]) ).

cnf(c_0_234,plain,
    ( ~ memberP(esk50_0,X1)
    | ~ ssItem(X1) ),
    inference(rw,[status(thm)],[c_0_231,c_0_226]) ).

cnf(c_0_235,plain,
    ( nil = X1
    | cons(esk26_1(X1),esk25_1(X1)) = X1
    | ~ ssList(X1) ),
    i_0_50 ).

cnf(c_0_236,plain,
    ( cons(X1,X2) != esk49_0
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_233]),c_0_224])]),c_0_234]) ).

cnf(c_0_237,plain,
    ( cons(esk26_1(X1),esk25_1(X1)) = X1
    | esk50_0 = X1
    | ~ ssList(X1) ),
    inference(rw,[status(thm)],[c_0_235,c_0_226]) ).

cnf(c_0_238,negated_conjecture,
    ssList(esk49_0),
    i_0_199 ).

cnf(c_0_239,plain,
    ( nil = X1
    | ssItem(esk26_1(X1))
    | ~ ssList(X1) ),
    i_0_51 ).

cnf(c_0_240,plain,
    ( esk50_0 = esk49_0
    | ~ ssItem(esk26_1(esk49_0))
    | ~ ssList(esk25_1(esk49_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_237])]),c_0_238])]) ).

cnf(c_0_241,plain,
    ( esk50_0 = X1
    | ssItem(esk26_1(X1))
    | ~ ssList(X1) ),
    inference(rw,[status(thm)],[c_0_239,c_0_226]) ).

cnf(c_0_242,plain,
    ( nil = X1
    | ssList(esk25_1(X1))
    | ~ ssList(X1) ),
    i_0_52 ).

cnf(c_0_243,plain,
    ( esk50_0 = esk49_0
    | ~ ssList(esk25_1(esk49_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_241]),c_0_238])]) ).

cnf(c_0_244,plain,
    ( esk50_0 = X1
    | ssList(esk25_1(X1))
    | ~ ssList(X1) ),
    inference(rw,[status(thm)],[c_0_242,c_0_226]) ).

cnf(c_0_245,negated_conjecture,
    neq(esk49_0,nil),
    i_0_194 ).

cnf(c_0_246,negated_conjecture,
    ~ neq(esk50_0,esk50_0),
    inference(rw,[status(thm)],[c_0_221,c_0_226]) ).

cnf(c_0_247,plain,
    esk50_0 = esk49_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_243,c_0_244]),c_0_238])]) ).

cnf(c_0_248,negated_conjecture,
    neq(esk49_0,esk50_0),
    inference(rw,[status(thm)],[c_0_245,c_0_226]) ).

cnf(c_0_249,negated_conjecture,
    ~ neq(esk49_0,esk49_0),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_246,c_0_247]),c_0_247]) ).

cnf(c_0_250,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_248,c_0_247]),c_0_249]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SWC211+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n021.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sun Jun 12 01:09:42 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected SinE mode:
% 0.20/0.47  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.20/0.47  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.20/0.47  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.89/2.53  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.89/2.53  # No SInE strategy applied
% 7.89/2.53  # Trying AutoSched0 for 150 seconds
% 7.89/2.53  # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.89/2.53  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.89/2.53  #
% 7.89/2.53  # Preprocessing time       : 0.016 s
% 7.89/2.53  
% 7.89/2.53  # Proof found!
% 7.89/2.53  # SZS status Theorem
% 7.89/2.53  # SZS output start CNFRefutation
% See solution above
% 7.89/2.53  # Training examples: 0 positive, 0 negative
% 7.89/2.53  
% 7.89/2.53  # -------------------------------------------------
% 7.89/2.53  # User time                : 0.034 s
% 7.89/2.53  # System time              : 0.002 s
% 7.89/2.53  # Total time               : 0.036 s
% 7.89/2.53  # Maximum resident set size: 7128 pages
% 7.89/2.53  
%------------------------------------------------------------------------------