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

View Problem - Process Solution

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

% Computer : n012.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:21 EDT 2022

% Result   : Theorem 7.72s 2.30s
% Output   : CNFRefutation 7.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   35 (  13 unt;   4 nHn;  35 RR)
%            Number of literals    :   67 (  22 equ;  31 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :    9 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_196,negated_conjecture,
    ( neq(esk50_0,nil)
    | ~ neq(esk51_0,nil) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hnmpu6iu/lgb.p',i_0_196) ).

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

cnf(i_0_199,negated_conjecture,
    esk49_0 = esk51_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hnmpu6iu/lgb.p',i_0_199) ).

cnf(i_0_195,negated_conjecture,
    ( segmentP(esk51_0,esk50_0)
    | ~ neq(esk51_0,nil) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hnmpu6iu/lgb.p',i_0_195) ).

cnf(i_0_107,plain,
    ( segmentP(X1,X1)
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hnmpu6iu/lgb.p',i_0_107) ).

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

cnf(i_0_194,negated_conjecture,
    ( nil = esk49_0
    | neq(esk49_0,nil) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hnmpu6iu/lgb.p',i_0_194) ).

cnf(i_0_197,negated_conjecture,
    ( esk50_0 = nil
    | nil != esk51_0 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hnmpu6iu/lgb.p',i_0_197) ).

cnf(i_0_193,negated_conjecture,
    ( nil = esk49_0
    | ~ ssList(X1)
    | ~ neq(X1,nil)
    | ~ segmentP(esk48_0,X1)
    | ~ segmentP(esk49_0,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hnmpu6iu/lgb.p',i_0_193) ).

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

cnf(i_0_192,negated_conjecture,
    ( neq(esk49_0,nil)
    | nil != esk48_0 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hnmpu6iu/lgb.p',i_0_192) ).

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

cnf(c_0_216,negated_conjecture,
    ( neq(esk50_0,nil)
    | ~ neq(esk51_0,nil) ),
    i_0_196 ).

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

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

cnf(c_0_219,negated_conjecture,
    ( segmentP(esk51_0,esk50_0)
    | ~ neq(esk51_0,nil) ),
    i_0_195 ).

cnf(c_0_220,plain,
    ( segmentP(X1,X1)
    | ~ ssList(X1) ),
    i_0_107 ).

cnf(c_0_221,negated_conjecture,
    ssList(esk48_0),
    i_0_203 ).

cnf(c_0_222,negated_conjecture,
    ( neq(esk48_0,nil)
    | ~ neq(esk49_0,nil) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_216,c_0_217]),c_0_218]) ).

cnf(c_0_223,negated_conjecture,
    ( nil = esk49_0
    | neq(esk49_0,nil) ),
    i_0_194 ).

cnf(c_0_224,negated_conjecture,
    ( segmentP(esk49_0,esk48_0)
    | ~ neq(esk49_0,nil) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_219,c_0_218]),c_0_217]),c_0_218]) ).

cnf(c_0_225,negated_conjecture,
    ( esk50_0 = nil
    | nil != esk51_0 ),
    i_0_197 ).

cnf(c_0_226,negated_conjecture,
    ( nil = esk49_0
    | ~ ssList(X1)
    | ~ neq(X1,nil)
    | ~ segmentP(esk48_0,X1)
    | ~ segmentP(esk49_0,X1) ),
    i_0_193 ).

cnf(c_0_227,negated_conjecture,
    segmentP(esk48_0,esk48_0),
    inference(spm,[status(thm)],[c_0_220,c_0_221]) ).

cnf(c_0_228,negated_conjecture,
    ( esk49_0 = nil
    | neq(esk48_0,nil) ),
    inference(spm,[status(thm)],[c_0_222,c_0_223]) ).

cnf(c_0_229,negated_conjecture,
    ( esk49_0 = nil
    | segmentP(esk49_0,esk48_0) ),
    inference(spm,[status(thm)],[c_0_224,c_0_223]) ).

cnf(c_0_230,negated_conjecture,
    ( esk48_0 = nil
    | esk49_0 != nil ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_225,c_0_217]),c_0_218]) ).

cnf(c_0_231,negated_conjecture,
    esk49_0 = nil,
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_226,c_0_227]),c_0_221])]),c_0_228]),c_0_229]) ).

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

cnf(c_0_233,negated_conjecture,
    ( neq(esk49_0,nil)
    | nil != esk48_0 ),
    i_0_192 ).

cnf(c_0_234,negated_conjecture,
    esk48_0 = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_230,c_0_231])]) ).

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

cnf(c_0_236,negated_conjecture,
    neq(nil,nil),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_233,c_0_231]),c_0_234])]) ).

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

cnf(c_0_238,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_235,c_0_236]),c_0_237])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWC059+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n012.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 09:41:28 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 0.19/0.45  # Parsing /export/starexec/sandbox2/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
% 7.72/2.30  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.72/2.30  # No SInE strategy applied
% 7.72/2.30  # Trying AutoSched0 for 150 seconds
% 7.72/2.30  # AutoSched0-Mode selected heuristic G_E___200_C45_F1_AE_CS_SP_PI_S0S
% 7.72/2.30  # and selection function SelectComplexG.
% 7.72/2.30  #
% 7.72/2.30  # Preprocessing time       : 0.023 s
% 7.72/2.30  
% 7.72/2.30  # Proof found!
% 7.72/2.30  # SZS status Theorem
% 7.72/2.30  # SZS output start CNFRefutation
% See solution above
% 7.72/2.30  # Training examples: 0 positive, 0 negative
% 7.72/2.30  
% 7.72/2.30  # -------------------------------------------------
% 7.72/2.30  # User time                : 0.025 s
% 7.72/2.30  # System time              : 0.005 s
% 7.72/2.30  # Total time               : 0.030 s
% 7.72/2.30  # Maximum resident set size: 7116 pages
% 7.72/2.30  
%------------------------------------------------------------------------------