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

View Problem - Process Solution

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

% Computer : n013.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:14 EDT 2022

% Result   : Theorem 7.45s 2.36s
% Output   : CNFRefutation 7.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   28 (  24 unt;   0 nHn;  28 RR)
%            Number of literals    :   40 (  23 equ;  15 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :    8 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_199,negated_conjecture,
    esk49_0 = nil,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9crh9o74/lgb.p',i_0_199) ).

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

cnf(i_0_194,negated_conjecture,
    app(esk50_0,esk52_0) = esk51_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9crh9o74/lgb.p',i_0_194) ).

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

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

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

cnf(i_0_195,negated_conjecture,
    ssList(esk52_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9crh9o74/lgb.p',i_0_195) ).

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

cnf(i_0_196,negated_conjecture,
    esk48_0 != nil,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9crh9o74/lgb.p',i_0_196) ).

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

cnf(c_0_214,negated_conjecture,
    esk49_0 = nil,
    i_0_199 ).

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

cnf(c_0_216,negated_conjecture,
    app(esk50_0,esk52_0) = esk51_0,
    i_0_194 ).

cnf(c_0_217,negated_conjecture,
    esk51_0 = nil,
    inference(rw,[status(thm)],[c_0_214,c_0_215]) ).

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

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

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

cnf(c_0_221,negated_conjecture,
    app(esk50_0,esk52_0) = nil,
    inference(rw,[status(thm)],[c_0_216,c_0_217]) ).

cnf(c_0_222,negated_conjecture,
    ssList(esk50_0),
    inference(rw,[status(thm)],[c_0_218,c_0_219]) ).

cnf(c_0_223,negated_conjecture,
    ssList(esk52_0),
    i_0_195 ).

cnf(c_0_224,negated_conjecture,
    esk52_0 = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_220,c_0_221]),c_0_222]),c_0_223])]) ).

cnf(c_0_225,negated_conjecture,
    ssList(esk49_0),
    i_0_202 ).

cnf(c_0_226,negated_conjecture,
    esk48_0 != nil,
    i_0_196 ).

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

cnf(c_0_228,negated_conjecture,
    app(esk50_0,nil) = nil,
    inference(rw,[status(thm)],[c_0_221,c_0_224]) ).

cnf(c_0_229,negated_conjecture,
    ssList(nil),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_225,c_0_215]),c_0_217]) ).

cnf(c_0_230,negated_conjecture,
    esk50_0 != nil,
    inference(rw,[status(thm)],[c_0_226,c_0_219]) ).

cnf(c_0_231,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_227,c_0_228]),c_0_229]),c_0_222])]),c_0_230]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SWC043+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.32  % Computer : n013.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Sun Jun 12 20:55:00 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.18/0.43  # ENIGMATIC: Selected SinE mode:
% 0.18/0.44  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.44  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.44  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.45/2.36  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.45/2.36  # No SInE strategy applied
% 7.45/2.36  # Trying AutoSched0 for 150 seconds
% 7.45/2.36  # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 7.45/2.36  # and selection function SelectCQIPrecWNTNp.
% 7.45/2.36  #
% 7.45/2.36  # Preprocessing time       : 0.023 s
% 7.45/2.36  
% 7.45/2.36  # Proof found!
% 7.45/2.36  # SZS status Theorem
% 7.45/2.36  # SZS output start CNFRefutation
% See solution above
% 7.45/2.36  # Training examples: 0 positive, 0 negative
% 7.45/2.36  
% 7.45/2.36  # -------------------------------------------------
% 7.45/2.36  # User time                : 0.028 s
% 7.45/2.36  # System time              : 0.000 s
% 7.45/2.36  # Total time               : 0.028 s
% 7.45/2.36  # Maximum resident set size: 7128 pages
% 7.45/2.36  
%------------------------------------------------------------------------------