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

View Problem - Process Solution

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

% Computer : n022.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:01 EDT 2022

% Result   : Theorem 9.54s 2.66s
% Output   : CNFRefutation 9.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   21
% Syntax   : Number of clauses     :   62 (  26 unt;   8 nHn;  62 RR)
%            Number of literals    :  151 (  50 equ;  91 neg)
%            Maximal clause size   :    9 (   2 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :   53 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_206,negated_conjecture,
    app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yd2_s358/lgb.p',i_0_206) ).

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

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

cnf(i_0_207,negated_conjecture,
    ssList(esk55_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yd2_s358/lgb.p',i_0_207) ).

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

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

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

cnf(i_0_209,negated_conjecture,
    ssItem(esk53_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yd2_s358/lgb.p',i_0_209) ).

cnf(i_0_208,negated_conjecture,
    ssList(esk54_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yd2_s358/lgb.p',i_0_208) ).

cnf(i_0_210,negated_conjecture,
    ssItem(esk52_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yd2_s358/lgb.p',i_0_210) ).

cnf(i_0_205,negated_conjecture,
    ~ neq(esk52_0,esk53_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yd2_s358/lgb.p',i_0_205) ).

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

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

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

cnf(i_0_138,plain,
    ( duplicatefreeP(cons(X1,nil))
    | ~ ssItem(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yd2_s358/lgb.p',i_0_138) ).

cnf(i_0_197,negated_conjecture,
    ( esk50_0 = nil
    | cons(esk56_0,nil) = esk50_0 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yd2_s358/lgb.p',i_0_197) ).

cnf(i_0_203,negated_conjecture,
    ( esk50_0 = nil
    | ssItem(esk56_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yd2_s358/lgb.p',i_0_203) ).

cnf(i_0_45,plain,
    ( cons(X1,X2) != X2
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yd2_s358/lgb.p',i_0_45) ).

cnf(i_0_33,plain,
    ( X1 != X2
    | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X6
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssList(X3)
    | ~ ssList(X6)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ duplicatefreeP(X6) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yd2_s358/lgb.p',i_0_33) ).

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-yd2_s358/lgb.p',i_0_154) ).

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

cnf(c_0_238,negated_conjecture,
    app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0,
    i_0_206 ).

cnf(c_0_239,negated_conjecture,
    esk50_0 = esk48_0,
    i_0_211 ).

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

cnf(c_0_241,negated_conjecture,
    app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk50_0,
    inference(rw,[status(thm)],[c_0_238,c_0_239]) ).

cnf(c_0_242,negated_conjecture,
    ssList(esk55_0),
    i_0_207 ).

cnf(c_0_243,negated_conjecture,
    ( app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)) = nil
    | esk50_0 != nil
    | ~ ssList(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_241]),c_0_242])]) ).

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

cnf(c_0_245,plain,
    ( nil = X1
    | app(X2,X1) != nil
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    i_0_158 ).

cnf(c_0_246,plain,
    ( app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)) = nil
    | esk50_0 != nil
    | ~ ssList(app(esk54_0,cons(esk52_0,nil)))
    | ~ ssList(cons(esk53_0,nil)) ),
    inference(spm,[status(thm)],[c_0_243,c_0_244]) ).

cnf(c_0_247,plain,
    ( X1 = X2
    | neq(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1) ),
    i_0_48 ).

cnf(c_0_248,negated_conjecture,
    ssItem(esk53_0),
    i_0_209 ).

cnf(c_0_249,plain,
    ( cons(esk53_0,nil) = nil
    | esk50_0 != nil
    | ~ ssList(app(esk54_0,cons(esk52_0,nil)))
    | ~ ssList(cons(esk53_0,nil)) ),
    inference(spm,[status(thm)],[c_0_245,c_0_246]) ).

cnf(c_0_250,negated_conjecture,
    ssList(esk54_0),
    i_0_208 ).

cnf(c_0_251,negated_conjecture,
    ( X1 = esk53_0
    | neq(X1,esk53_0)
    | ~ ssItem(X1) ),
    inference(spm,[status(thm)],[c_0_247,c_0_248]) ).

cnf(c_0_252,negated_conjecture,
    ssItem(esk52_0),
    i_0_210 ).

cnf(c_0_253,negated_conjecture,
    ~ neq(esk52_0,esk53_0),
    i_0_205 ).

cnf(c_0_254,plain,
    ( cons(esk53_0,nil) = nil
    | esk50_0 != nil
    | ~ ssList(cons(esk53_0,nil))
    | ~ ssList(cons(esk52_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_249,c_0_244]),c_0_250])]) ).

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

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

cnf(c_0_257,negated_conjecture,
    esk53_0 = esk52_0,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_251,c_0_252]),c_0_253]) ).

cnf(c_0_258,plain,
    ( cons(esk53_0,nil) = nil
    | esk50_0 != nil
    | ~ ssList(cons(esk52_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_254,c_0_255]),c_0_248]),c_0_256])]) ).

cnf(c_0_259,plain,
    ( app(app(X1,X2),X3) = app(X1,app(X2,X3))
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    i_0_155 ).

cnf(c_0_260,negated_conjecture,
    app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk52_0,nil)),esk55_0) = esk50_0,
    inference(rw,[status(thm)],[c_0_241,c_0_257]) ).

cnf(c_0_261,plain,
    ( duplicatefreeP(cons(X1,nil))
    | ~ ssItem(X1) ),
    i_0_138 ).

cnf(c_0_262,negated_conjecture,
    ( esk50_0 = nil
    | cons(esk56_0,nil) = esk50_0 ),
    i_0_197 ).

cnf(c_0_263,negated_conjecture,
    ( esk50_0 = nil
    | ssItem(esk56_0) ),
    i_0_203 ).

cnf(c_0_264,plain,
    ( cons(X1,X2) != X2
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    i_0_45 ).

cnf(c_0_265,plain,
    ( cons(esk53_0,nil) = nil
    | esk50_0 != nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_258,c_0_255]),c_0_252]),c_0_256])]) ).

cnf(c_0_266,plain,
    ( X1 != X2
    | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X6
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssList(X3)
    | ~ ssList(X6)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ duplicatefreeP(X6) ),
    i_0_33 ).

cnf(c_0_267,plain,
    ( app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0)) = esk50_0
    | ~ ssList(app(esk54_0,cons(esk52_0,nil)))
    | ~ ssList(cons(esk52_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_259,c_0_260]),c_0_242])]) ).

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

cnf(c_0_269,negated_conjecture,
    ( esk50_0 = nil
    | duplicatefreeP(esk50_0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_261,c_0_262]),c_0_263]) ).

cnf(c_0_270,plain,
    esk50_0 != nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_264,c_0_265]),c_0_248]),c_0_256])]) ).

cnf(c_0_271,negated_conjecture,
    ssList(esk48_0),
    i_0_216 ).

cnf(c_0_272,plain,
    ( ~ duplicatefreeP(app(app(X1,cons(X2,X3)),cons(X2,X4)))
    | ~ ssItem(X2)
    | ~ ssList(app(app(X1,cons(X2,X3)),cons(X2,X4)))
    | ~ ssList(X4)
    | ~ ssList(X3)
    | ~ ssList(X1) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_266])]) ).

cnf(c_0_273,plain,
    ( app(app(esk54_0,cons(esk52_0,nil)),cons(esk52_0,esk55_0)) = esk50_0
    | ~ ssList(app(esk54_0,cons(esk52_0,nil)))
    | ~ ssList(cons(esk52_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_267,c_0_268]),c_0_252]),c_0_242])]) ).

cnf(c_0_274,negated_conjecture,
    duplicatefreeP(esk50_0),
    inference(sr,[status(thm)],[c_0_269,c_0_270]) ).

cnf(c_0_275,negated_conjecture,
    ssList(esk50_0),
    inference(rw,[status(thm)],[c_0_271,c_0_239]) ).

cnf(c_0_276,plain,
    ( ~ ssList(app(esk54_0,cons(esk52_0,nil)))
    | ~ ssList(cons(esk52_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_272,c_0_273]),c_0_274]),c_0_252]),c_0_275]),c_0_242]),c_0_256]),c_0_250])]) ).

cnf(c_0_277,plain,
    ~ ssList(cons(esk52_0,nil)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_276,c_0_244]),c_0_250])]) ).

cnf(c_0_278,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_277,c_0_255]),c_0_252]),c_0_256])]),
    [proof] ).

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