↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SWC382+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n014.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:15:20 EDT 2022

% Result   : Theorem 8.53s 2.54s
% Output   : CNFRefutation 8.53s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :   30
% Syntax   : Number of clauses     :   99 (  18 unt;  27 nHn;  99 RR)
%            Number of literals    :  297 (  95 equ; 181 neg)
%            Maximal clause size   :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   5 con; 0-2 aty)
%            Number of variables   :  110 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_196,negated_conjecture,
    neq(esk49_0,nil),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i20vnut1/input.p',i_0_196) ).

cnf(i_0_198,negated_conjecture,
    esk49_0 = esk51_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i20vnut1/input.p',i_0_198) ).

cnf(i_0_193,negated_conjecture,
    ( esk50_0 = X1
    | hd(esk51_0) != X2
    | cons(X2,nil) != X1
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | ~ neq(nil,esk51_0)
    | ~ neq(esk51_0,nil) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i20vnut1/input.p',i_0_193) ).

cnf(i_0_197,negated_conjecture,
    esk50_0 = esk48_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i20vnut1/input.p',i_0_197) ).

cnf(i_0_201,negated_conjecture,
    ssList(esk49_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i20vnut1/input.p',i_0_201) ).

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

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

cnf(i_0_43,plain,
    ( ssList(cons(X1,X2))
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i20vnut1/input.p',i_0_43) ).

cnf(i_0_55,plain,
    ( hd(cons(X1,X2)) = X1
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i20vnut1/input.p',i_0_55) ).

cnf(i_0_53,plain,
    ( cons(X1,X2) != nil
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i20vnut1/input.p',i_0_53) ).

cnf(i_0_54,plain,
    ( nil = X1
    | ssItem(hd(X1))
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i20vnut1/input.p',i_0_54) ).

cnf(i_0_200,negated_conjecture,
    ssList(esk50_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i20vnut1/input.p',i_0_200) ).

cnf(i_0_57,plain,
    ( tl(cons(X1,X2)) = X2
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i20vnut1/input.p',i_0_57) ).

cnf(i_0_147,plain,
    ( nil = X1
    | cons(hd(X1),tl(X1)) = X1
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i20vnut1/input.p',i_0_147) ).

cnf(i_0_77,plain,
    ( memberP(cons(X1,X2),X3)
    | X3 != X1
    | ~ ssList(X2)
    | ~ ssItem(X1)
    | ~ ssItem(X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i20vnut1/input.p',i_0_77) ).

cnf(i_0_98,plain,
    ( singletonP(X1)
    | cons(X2,nil) != X1
    | ~ ssList(X1)
    | ~ ssItem(X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i20vnut1/input.p',i_0_98) ).

cnf(i_0_78,plain,
    ( X1 = X2
    | memberP(X3,X2)
    | ~ ssList(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ memberP(cons(X1,X3),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i20vnut1/input.p',i_0_78) ).

cnf(i_0_79,plain,
    ( ~ ssItem(X1)
    | ~ memberP(nil,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i20vnut1/input.p',i_0_79) ).

cnf(i_0_99,plain,
    ( cons(esk31_1(X1),nil) = X1
    | ~ ssList(X1)
    | ~ singletonP(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i20vnut1/input.p',i_0_99) ).

cnf(i_0_100,plain,
    ( ssItem(esk31_1(X1))
    | ~ ssList(X1)
    | ~ singletonP(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i20vnut1/input.p',i_0_100) ).

cnf(i_0_191,negated_conjecture,
    ( ~ singletonP(esk48_0)
    | ~ neq(esk51_0,nil)
    | ~ segmentP(esk49_0,esk48_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i20vnut1/input.p',i_0_191) ).

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

cnf(i_0_149,plain,
    ( segmentP(X1,X2)
    | app(app(X3,X2),X4) != X1
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X4)
    | ~ ssList(X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i20vnut1/input.p',i_0_149) ).

cnf(i_0_60,plain,
    ( app(nil,X1) = X1
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i20vnut1/input.p',i_0_60) ).

cnf(i_0_114,plain,
    ( app(X1,esk32_2(X2,X1)) = X2
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ frontsegP(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i20vnut1/input.p',i_0_114) ).

cnf(i_0_115,plain,
    ( ssList(esk32_2(X1,X2))
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ frontsegP(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i20vnut1/input.p',i_0_115) ).

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-i20vnut1/input.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-i20vnut1/input.p',i_0_58) ).

cnf(i_0_56,plain,
    ( nil = X1
    | ssList(tl(X1))
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i20vnut1/input.p',i_0_56) ).

cnf(i_0_42,plain,
    ( X1 != X2
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ neq(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i20vnut1/input.p',i_0_42) ).

cnf(c_0_232,negated_conjecture,
    neq(esk49_0,nil),
    i_0_196 ).

cnf(c_0_233,negated_conjecture,
    esk49_0 = esk51_0,
    i_0_198 ).

cnf(c_0_234,negated_conjecture,
    ( esk50_0 = X1
    | hd(esk51_0) != X2
    | cons(X2,nil) != X1
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | ~ neq(nil,esk51_0)
    | ~ neq(esk51_0,nil) ),
    i_0_193 ).

cnf(c_0_235,negated_conjecture,
    esk50_0 = esk48_0,
    i_0_197 ).

cnf(c_0_236,negated_conjecture,
    neq(esk51_0,nil),
    inference(rw,[status(thm)],[c_0_232,c_0_233]) ).

cnf(c_0_237,negated_conjecture,
    ssList(esk49_0),
    i_0_201 ).

cnf(c_0_238,negated_conjecture,
    ( esk48_0 = X1
    | cons(X2,nil) != X1
    | hd(esk51_0) != X2
    | ~ neq(nil,esk51_0)
    | ~ ssItem(X2)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_234,c_0_235]),c_0_236])]) ).

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

cnf(c_0_240,negated_conjecture,
    ssList(esk51_0),
    inference(rw,[status(thm)],[c_0_237,c_0_233]) ).

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

cnf(c_0_242,plain,
    ( esk51_0 = nil
    | esk48_0 = X1
    | cons(X2,nil) != X1
    | hd(esk51_0) != X2
    | ~ ssItem(X2)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_238,c_0_239]),c_0_240]),c_0_241])]) ).

cnf(c_0_243,plain,
    ( cons(X1,nil) = esk48_0
    | esk51_0 = nil
    | hd(esk51_0) != X1
    | ~ ssItem(X1)
    | ~ ssList(cons(X1,nil)) ),
    inference(er,[status(thm)],[c_0_242]) ).

cnf(c_0_244,plain,
    ( ssList(cons(X1,X2))
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    i_0_43 ).

cnf(c_0_245,plain,
    ( cons(X1,nil) = esk48_0
    | esk51_0 = nil
    | hd(esk51_0) != X1
    | ~ ssItem(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_243,c_0_244]),c_0_241])]) ).

cnf(c_0_246,plain,
    ( hd(cons(X1,X2)) = X1
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    i_0_55 ).

cnf(c_0_247,plain,
    ( cons(hd(esk51_0),nil) = esk48_0
    | esk51_0 = nil
    | ~ ssItem(hd(esk51_0)) ),
    inference(er,[status(thm)],[c_0_245]) ).

cnf(c_0_248,plain,
    ( cons(X1,X2) != nil
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    i_0_53 ).

cnf(c_0_249,plain,
    ( hd(esk48_0) = hd(esk51_0)
    | esk51_0 = nil
    | ~ ssItem(hd(esk51_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_246,c_0_247]),c_0_241])]) ).

cnf(c_0_250,plain,
    ( nil = X1
    | ssItem(hd(X1))
    | ~ ssList(X1) ),
    i_0_54 ).

cnf(c_0_251,negated_conjecture,
    ssList(esk50_0),
    i_0_200 ).

cnf(c_0_252,plain,
    ( esk51_0 = nil
    | esk48_0 != nil
    | ~ ssItem(hd(esk51_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_248,c_0_247]),c_0_241])]) ).

cnf(c_0_253,plain,
    ( tl(cons(X1,X2)) = X2
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    i_0_57 ).

cnf(c_0_254,plain,
    ( hd(esk48_0) = hd(esk51_0)
    | esk51_0 = nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_249,c_0_250]),c_0_240])]) ).

cnf(c_0_255,negated_conjecture,
    ssList(esk48_0),
    inference(rw,[status(thm)],[c_0_251,c_0_235]) ).

cnf(c_0_256,plain,
    ( esk51_0 = nil
    | esk48_0 != nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_252,c_0_250]),c_0_240])]) ).

cnf(c_0_257,plain,
    ( nil = X1
    | cons(hd(X1),tl(X1)) = X1
    | ~ ssList(X1) ),
    i_0_147 ).

cnf(c_0_258,plain,
    ( tl(esk48_0) = nil
    | esk51_0 = nil
    | ~ ssItem(hd(esk51_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_253,c_0_247]),c_0_241])]) ).

cnf(c_0_259,plain,
    ( esk51_0 = nil
    | ssItem(hd(esk51_0)) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_250,c_0_254]),c_0_255])]),c_0_256]) ).

cnf(c_0_260,plain,
    ( cons(hd(esk48_0),nil) = esk48_0
    | esk51_0 = nil ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_257,c_0_258]),c_0_255])]),c_0_259]),c_0_256]) ).

cnf(c_0_261,plain,
    ( memberP(cons(X1,X2),X3)
    | X3 != X1
    | ~ ssList(X2)
    | ~ ssItem(X1)
    | ~ ssItem(X3) ),
    i_0_77 ).

cnf(c_0_262,plain,
    ( singletonP(X1)
    | cons(X2,nil) != X1
    | ~ ssList(X1)
    | ~ ssItem(X2) ),
    i_0_98 ).

cnf(c_0_263,plain,
    ( X1 = X2
    | memberP(X3,X2)
    | ~ ssList(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ memberP(cons(X1,X3),X2) ),
    i_0_78 ).

cnf(c_0_264,plain,
    ( cons(hd(esk51_0),nil) = esk48_0
    | esk51_0 = nil ),
    inference(spm,[status(thm)],[c_0_260,c_0_254]) ).

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

cnf(c_0_266,plain,
    ( memberP(cons(X1,X2),X1)
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    inference(er,[status(thm)],[c_0_261]) ).

cnf(c_0_267,plain,
    ( cons(esk31_1(X1),nil) = X1
    | ~ ssList(X1)
    | ~ singletonP(X1) ),
    i_0_99 ).

cnf(c_0_268,plain,
    ( ssItem(esk31_1(X1))
    | ~ ssList(X1)
    | ~ singletonP(X1) ),
    i_0_100 ).

cnf(c_0_269,plain,
    ( singletonP(cons(X1,nil))
    | ~ ssItem(X1)
    | ~ ssList(cons(X1,nil)) ),
    inference(er,[status(thm)],[c_0_262]) ).

cnf(c_0_270,plain,
    ( hd(esk51_0) = X1
    | esk51_0 = nil
    | ~ memberP(esk48_0,X1)
    | ~ ssItem(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_263,c_0_264]),c_0_241])]),c_0_259]),c_0_265]) ).

cnf(c_0_271,plain,
    ( memberP(X1,esk31_1(X1))
    | ~ singletonP(X1)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_266,c_0_267]),c_0_241])]),c_0_268]) ).

cnf(c_0_272,plain,
    ( esk51_0 = nil
    | singletonP(esk48_0) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_269,c_0_264]),c_0_255])]),c_0_259]) ).

cnf(c_0_273,negated_conjecture,
    ( ~ singletonP(esk48_0)
    | ~ neq(esk51_0,nil)
    | ~ segmentP(esk49_0,esk48_0) ),
    i_0_191 ).

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

cnf(c_0_275,plain,
    ( esk31_1(esk48_0) = hd(esk51_0)
    | esk51_0 = nil
    | ~ ssItem(esk31_1(esk48_0)) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_270,c_0_271]),c_0_255])]),c_0_272]) ).

cnf(c_0_276,negated_conjecture,
    ( ~ segmentP(esk51_0,esk48_0)
    | ~ singletonP(esk48_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_273,c_0_233]),c_0_236])]) ).

cnf(c_0_277,plain,
    ( esk51_0 = nil
    | singletonP(esk48_0)
    | ~ ssItem(hd(esk51_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_269,c_0_247]),c_0_255])]) ).

cnf(c_0_278,plain,
    ( segmentP(X1,X2)
    | app(app(X3,X2),X4) != X1
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X4)
    | ~ ssList(X3) ),
    i_0_149 ).

cnf(c_0_279,plain,
    ( app(nil,X1) = X1
    | ~ ssList(X1) ),
    i_0_60 ).

cnf(c_0_280,plain,
    ( cons(esk31_1(X1),X2) = app(X1,X2)
    | ~ singletonP(X1)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_274,c_0_267]),c_0_268]) ).

cnf(c_0_281,plain,
    ( esk31_1(esk48_0) = hd(esk51_0)
    | esk51_0 = nil ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_275,c_0_268]),c_0_255])]),c_0_272]) ).

cnf(c_0_282,negated_conjecture,
    ( esk51_0 = nil
    | ~ segmentP(esk51_0,esk48_0)
    | ~ ssItem(hd(esk51_0)) ),
    inference(spm,[status(thm)],[c_0_276,c_0_277]) ).

cnf(c_0_283,plain,
    ( segmentP(X1,X2)
    | app(X2,X3) != X1
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_278,c_0_279]),c_0_241])]) ).

cnf(c_0_284,plain,
    ( app(X1,esk32_2(X2,X1)) = X2
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ frontsegP(X2,X1) ),
    i_0_114 ).

cnf(c_0_285,plain,
    ( ssList(esk32_2(X1,X2))
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ frontsegP(X1,X2) ),
    i_0_115 ).

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

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

cnf(c_0_288,plain,
    ( cons(hd(esk51_0),X1) = app(esk48_0,X1)
    | esk51_0 = nil
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_280,c_0_281]),c_0_255])]),c_0_272]) ).

cnf(c_0_289,plain,
    ( esk51_0 = nil
    | ~ segmentP(esk51_0,esk48_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_282,c_0_250]),c_0_240])]) ).

cnf(c_0_290,plain,
    ( segmentP(X1,X2)
    | ~ frontsegP(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_283,c_0_284])]),c_0_285]) ).

cnf(c_0_291,plain,
    ( frontsegP(app(X1,X2),X1)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_286]),c_0_287]) ).

cnf(c_0_292,plain,
    ( app(esk48_0,tl(esk51_0)) = esk51_0
    | esk51_0 = nil
    | ~ ssList(tl(esk51_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_257,c_0_288]),c_0_240])]) ).

cnf(c_0_293,plain,
    ( esk51_0 = nil
    | ~ frontsegP(esk51_0,esk48_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_289,c_0_290]),c_0_255]),c_0_240])]) ).

cnf(c_0_294,plain,
    ( esk51_0 = nil
    | ~ ssList(tl(esk51_0)) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_291,c_0_292]),c_0_255])]),c_0_293]) ).

cnf(c_0_295,plain,
    ( nil = X1
    | ssList(tl(X1))
    | ~ ssList(X1) ),
    i_0_56 ).

cnf(c_0_296,plain,
    ( X1 != X2
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ neq(X1,X2) ),
    i_0_42 ).

cnf(c_0_297,plain,
    esk51_0 = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_294,c_0_295]),c_0_240])]) ).

cnf(c_0_298,plain,
    ( ~ neq(X1,X1)
    | ~ ssList(X1) ),
    inference(er,[status(thm)],[c_0_296]) ).

cnf(c_0_299,negated_conjecture,
    neq(nil,nil),
    inference(rw,[status(thm)],[c_0_236,c_0_297]) ).

cnf(c_0_300,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_298,c_0_299]),c_0_241])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWC382+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n014.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 : Sun Jun 12 19:34:54 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 0.18/0.45  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.45  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.45  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.53/2.54  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.53/2.54  # Version: 2.1pre011
% 8.53/2.54  # Preprocessing time       : 0.012 s
% 8.53/2.54  
% 8.53/2.54  # Proof found!
% 8.53/2.54  # SZS status Theorem
% 8.53/2.54  # SZS output start CNFRefutation
% See solution above
% 8.53/2.54  # Proof object total steps             : 99
% 8.53/2.54  # Proof object clause steps            : 69
% 8.53/2.54  # Proof object formula steps           : 30
% 8.53/2.54  # Proof object conjectures             : 21
% 8.53/2.54  # Proof object clause conjectures      : 14
% 8.53/2.54  # Proof object formula conjectures     : 7
% 8.53/2.54  # Proof object initial clauses used    : 30
% 8.53/2.54  # Proof object initial formulas used   : 30
% 8.53/2.54  # Proof object generating inferences   : 31
% 8.53/2.54  # Proof object simplifying inferences  : 75
% 8.53/2.54  # Training examples: 0 positive, 0 negative
% 8.53/2.54  # Parsed axioms                        : 200
% 8.53/2.54  # Removed by relevancy pruning/SinE    : 0
% 8.53/2.54  # Initial clauses                      : 200
% 8.53/2.54  # Removed in clause preprocessing      : 0
% 8.53/2.54  # Initial clauses in saturation        : 200
% 8.53/2.54  # Processed clauses                    : 1114
% 8.53/2.54  # ...of these trivial                  : 8
% 8.53/2.54  # ...subsumed                          : 502
% 8.53/2.54  # ...remaining for further processing  : 604
% 8.53/2.54  # Other redundant clauses eliminated   : 202
% 8.53/2.54  # Clauses deleted for lack of memory   : 0
% 8.53/2.54  # Backward-subsumed                    : 54
% 8.53/2.54  # Backward-rewritten                   : 173
% 8.53/2.54  # Generated clauses                    : 5345
% 8.53/2.54  # ...of the previous two non-trivial   : 4853
% 8.53/2.54  # Contextual simplify-reflections      : 879
% 8.53/2.54  # Paramodulations                      : 5074
% 8.53/2.54  # Factorizations                       : 0
% 8.53/2.54  # Equation resolutions                 : 271
% 8.53/2.54  # Propositional unsat checks           : 0
% 8.53/2.54  # Propositional unsat check successes  : 0
% 8.53/2.54  # Current number of processed clauses  : 371
% 8.53/2.54  #    Positive orientable unit clauses  : 15
% 8.53/2.54  #    Positive unorientable unit clauses: 0
% 8.53/2.54  #    Negative unit clauses             : 2
% 8.53/2.54  #    Non-unit-clauses                  : 354
% 8.53/2.54  # Current number of unprocessed clauses: 2725
% 8.53/2.54  # ...number of literals in the above   : 21005
% 8.53/2.54  # Current number of archived formulas  : 0
% 8.53/2.54  # Current number of archived clauses   : 227
% 8.53/2.54  # Clause-clause subsumption calls (NU) : 94941
% 8.53/2.54  # Rec. Clause-clause subsumption calls : 15690
% 8.53/2.54  # Non-unit clause-clause subsumptions  : 1430
% 8.53/2.54  # Unit Clause-clause subsumption calls : 268
% 8.53/2.54  # Rewrite failures with RHS unbound    : 0
% 8.53/2.54  # BW rewrite match attempts            : 2
% 8.53/2.54  # BW rewrite match successes           : 2
% 8.53/2.54  # Condensation attempts                : 0
% 8.53/2.54  # Condensation successes               : 0
% 8.53/2.54  # Termbank termtop insertions          : 107705
% 8.53/2.54  
% 8.53/2.54  # -------------------------------------------------
% 8.53/2.54  # User time                : 0.145 s
% 8.53/2.54  # System time              : 0.006 s
% 8.53/2.54  # Total time               : 0.151 s
% 8.53/2.54  # ...preprocessing         : 0.012 s
% 8.53/2.54  # ...main loop             : 0.139 s
% 8.53/2.54  # Maximum resident set size: 9464 pages
% 8.53/2.54  
%------------------------------------------------------------------------------