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

View Problem - Process Solution

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

% Computer : n015.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:07 EDT 2022

% Result   : Theorem 7.58s 2.37s
% Output   : CNFRefutation 7.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   31 (  17 unt;   8 nHn;  31 RR)
%            Number of literals    :   51 (  13 equ;  17 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :    5 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_199,negated_conjecture,
    ( ~ ssList(X1)
    | ~ neq(X1,nil)
    | ~ frontsegP(esk48_0,X1)
    | ~ frontsegP(esk49_0,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uyx1fpoh/lgb.p',i_0_199) ).

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

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

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

cnf(i_0_92,plain,
    ( frontsegP(X1,nil)
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uyx1fpoh/lgb.p',i_0_92) ).

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

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

cnf(i_0_194,negated_conjecture,
    ( nil = esk51_0
    | frontsegP(esk51_0,esk52_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uyx1fpoh/lgb.p',i_0_194) ).

cnf(i_0_198,negated_conjecture,
    ( nil = esk51_0
    | ssList(esk52_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uyx1fpoh/lgb.p',i_0_198) ).

cnf(i_0_196,negated_conjecture,
    ( nil = esk51_0
    | neq(esk52_0,nil) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uyx1fpoh/lgb.p',i_0_196) ).

cnf(i_0_192,negated_conjecture,
    ( nil = esk51_0
    | frontsegP(esk50_0,esk52_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uyx1fpoh/lgb.p',i_0_192) ).

cnf(i_0_204,negated_conjecture,
    ssList(esk50_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uyx1fpoh/lgb.p',i_0_204) ).

cnf(c_0_218,negated_conjecture,
    ( ~ ssList(X1)
    | ~ neq(X1,nil)
    | ~ frontsegP(esk48_0,X1)
    | ~ frontsegP(esk49_0,X1) ),
    i_0_199 ).

cnf(c_0_219,negated_conjecture,
    esk49_0 = esk51_0,
    i_0_202 ).

cnf(c_0_220,negated_conjecture,
    esk50_0 = esk48_0,
    i_0_201 ).

cnf(c_0_221,negated_conjecture,
    ssList(esk49_0),
    i_0_205 ).

cnf(c_0_222,negated_conjecture,
    ( ~ frontsegP(esk51_0,X1)
    | ~ frontsegP(esk50_0,X1)
    | ~ neq(X1,nil)
    | ~ ssList(X1) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_218,c_0_219]),c_0_220]) ).

cnf(c_0_223,plain,
    ( frontsegP(X1,nil)
    | ~ ssList(X1) ),
    i_0_92 ).

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

cnf(c_0_225,negated_conjecture,
    ssList(esk51_0),
    inference(rw,[status(thm)],[c_0_221,c_0_219]) ).

cnf(c_0_226,negated_conjecture,
    neq(esk49_0,nil),
    i_0_200 ).

cnf(c_0_227,negated_conjecture,
    ( nil = esk51_0
    | frontsegP(esk51_0,esk52_0) ),
    i_0_194 ).

cnf(c_0_228,negated_conjecture,
    ( nil = esk51_0
    | ssList(esk52_0) ),
    i_0_198 ).

cnf(c_0_229,negated_conjecture,
    ( nil = esk51_0
    | neq(esk52_0,nil) ),
    i_0_196 ).

cnf(c_0_230,negated_conjecture,
    ( nil = esk51_0
    | frontsegP(esk50_0,esk52_0) ),
    i_0_192 ).

cnf(c_0_231,plain,
    ( ~ frontsegP(esk50_0,nil)
    | ~ neq(nil,nil) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_222,c_0_223]),c_0_224]),c_0_225])]) ).

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

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

cnf(c_0_234,negated_conjecture,
    esk51_0 = nil,
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_222,c_0_227]),c_0_228]),c_0_229]),c_0_230]) ).

cnf(c_0_235,plain,
    ~ neq(nil,nil),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_231,c_0_223]),c_0_232])]) ).

cnf(c_0_236,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_233,c_0_234]),c_0_235]),
    [proof] ).

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