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

View Problem - Process Solution

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

% Computer : n016.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:13 EDT 2022

% Result   : Theorem 15.03s 3.28s
% Output   : CNFRefutation 15.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   15
% Syntax   : Number of clauses     :   44 (  22 unt;   0 nHn;  44 RR)
%            Number of literals    :  100 (  17 equ;  59 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-2 aty)
%            Number of variables   :   39 (   0 sgn)

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

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

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/sandbox/tmp/enigma-theBenchmark.p-a1v83oyk/input.p',i_0_149) ).

cnf(i_0_192,negated_conjecture,
    ( cons(esk52_0,nil) = esk50_0
    | ~ neq(esk51_0,nil) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a1v83oyk/input.p',i_0_192) ).

cnf(i_0_193,negated_conjecture,
    ( ssItem(esk52_0)
    | ~ neq(esk51_0,nil) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a1v83oyk/input.p',i_0_193) ).

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

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-a1v83oyk/input.p',i_0_154) ).

cnf(i_0_191,negated_conjecture,
    ( memberP(esk51_0,esk52_0)
    | ~ neq(esk51_0,nil) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a1v83oyk/input.p',i_0_191) ).

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

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

cnf(i_0_82,plain,
    ( app(esk29_2(X1,X2),cons(X2,esk30_2(X1,X2))) = X1
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | ~ memberP(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a1v83oyk/input.p',i_0_82) ).

cnf(i_0_83,plain,
    ( ssList(esk30_2(X1,X2))
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | ~ memberP(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a1v83oyk/input.p',i_0_83) ).

cnf(i_0_84,plain,
    ( ssList(esk29_2(X1,X2))
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | ~ memberP(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a1v83oyk/input.p',i_0_84) ).

cnf(i_0_195,negated_conjecture,
    ~ segmentP(esk49_0,esk48_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a1v83oyk/input.p',i_0_195) ).

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

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

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

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

cnf(c_0_220,negated_conjecture,
    ( cons(esk52_0,nil) = esk50_0
    | ~ neq(esk51_0,nil) ),
    i_0_192 ).

cnf(c_0_221,negated_conjecture,
    neq(esk51_0,nil),
    inference(rw,[status(thm)],[c_0_217,c_0_218]) ).

cnf(c_0_222,negated_conjecture,
    ( ssItem(esk52_0)
    | ~ neq(esk51_0,nil) ),
    i_0_193 ).

cnf(c_0_223,plain,
    ( segmentP(app(app(X1,X2),X3),X2)
    | ~ ssList(app(app(X1,X2),X3))
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(er,[status(thm)],[c_0_219]) ).

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

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

cnf(c_0_226,negated_conjecture,
    cons(esk52_0,nil) = esk50_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_220,c_0_221])]) ).

cnf(c_0_227,negated_conjecture,
    ssItem(esk52_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_222,c_0_221])]) ).

cnf(c_0_228,negated_conjecture,
    ( memberP(esk51_0,esk52_0)
    | ~ neq(esk51_0,nil) ),
    i_0_191 ).

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

cnf(c_0_230,plain,
    ( segmentP(app(X1,app(X2,X3)),X2)
    | ~ ssList(app(X1,app(X2,X3)))
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(spm,[status(thm)],[c_0_223,c_0_224]) ).

cnf(c_0_231,negated_conjecture,
    ( app(esk50_0,X1) = cons(esk52_0,X1)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_225,c_0_226]),c_0_227])]) ).

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

cnf(c_0_233,plain,
    ( app(esk29_2(X1,X2),cons(X2,esk30_2(X1,X2))) = X1
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | ~ memberP(X1,X2) ),
    i_0_82 ).

cnf(c_0_234,negated_conjecture,
    memberP(esk51_0,esk52_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_228,c_0_221])]) ).

cnf(c_0_235,negated_conjecture,
    ssList(esk51_0),
    inference(rw,[status(thm)],[c_0_229,c_0_218]) ).

cnf(c_0_236,plain,
    ( ssList(esk30_2(X1,X2))
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | ~ memberP(X1,X2) ),
    i_0_83 ).

cnf(c_0_237,plain,
    ( ssList(esk29_2(X1,X2))
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | ~ memberP(X1,X2) ),
    i_0_84 ).

cnf(c_0_238,negated_conjecture,
    ~ segmentP(esk49_0,esk48_0),
    i_0_195 ).

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

cnf(c_0_240,negated_conjecture,
    ( segmentP(app(X1,cons(esk52_0,X2)),esk50_0)
    | ~ ssList(app(X1,cons(esk52_0,X2)))
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_231]),c_0_232])]) ).

cnf(c_0_241,negated_conjecture,
    app(esk29_2(esk51_0,esk52_0),cons(esk52_0,esk30_2(esk51_0,esk52_0))) = esk51_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_233,c_0_234]),c_0_227]),c_0_235])]) ).

cnf(c_0_242,negated_conjecture,
    ssList(esk30_2(esk51_0,esk52_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_234]),c_0_227]),c_0_235])]) ).

cnf(c_0_243,negated_conjecture,
    ssList(esk29_2(esk51_0,esk52_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_234]),c_0_227]),c_0_235])]) ).

cnf(c_0_244,negated_conjecture,
    ~ segmentP(esk51_0,esk50_0),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_238,c_0_218]),c_0_239]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWC363+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 : n016.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 18:16:45 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected SinE mode:
% 0.19/0.45  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.45  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.45  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 15.03/3.28  # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l6400-e0.15+coop-eprover66:
% 15.03/3.28  # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 48; version: 991; iters: 150)
% 15.03/3.28  # Preprocessing time       : 0.835 s
% 15.03/3.28  # Presaturation interreduction done
% 15.03/3.28  
% 15.03/3.28  # Proof found!
% 15.03/3.28  # SZS status Theorem
% 15.03/3.28  # SZS output start CNFRefutation
% See solution above
% 15.03/3.28  # Training examples: 0 positive, 0 negative
% 15.03/3.28  
% 15.03/3.28  # -------------------------------------------------
% 15.03/3.28  # User time                : 0.752 s
% 15.03/3.28  # System time              : 0.113 s
% 15.03/3.28  # Total time               : 0.865 s
% 15.03/3.28  # ...preprocessing         : 0.835 s
% 15.03/3.28  # ...main loop             : 0.030 s
% 15.03/3.28  # Maximum resident set size: 167672 pages
% 15.03/3.28  
%------------------------------------------------------------------------------