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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SWC256+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:35 EDT 2022

% Result   : Theorem 7.68s 2.41s
% Output   : CNFRefutation 7.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   28 (  16 unt;   6 nHn;  28 RR)
%            Number of literals    :   49 (  18 equ;  20 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   10 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_98,plain,
    ( singletonP(X1)
    | cons(X2,nil) != X1
    | ~ ssList(X1)
    | ~ ssItem(X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x0j4w89w/lgb.p',i_0_98) ).

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

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

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

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

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

cnf(i_0_197,negated_conjecture,
    ~ singletonP(esk48_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x0j4w89w/lgb.p',i_0_197) ).

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

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

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

cnf(c_0_214,plain,
    ( singletonP(X1)
    | cons(X2,nil) != X1
    | ~ ssList(X1)
    | ~ ssItem(X2) ),
    i_0_98 ).

cnf(c_0_215,negated_conjecture,
    ( nil = esk51_0
    | cons(esk52_0,nil) = esk50_0 ),
    i_0_194 ).

cnf(c_0_216,negated_conjecture,
    esk49_0 = esk51_0,
    i_0_200 ).

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

cnf(c_0_218,negated_conjecture,
    ssList(esk50_0),
    i_0_202 ).

cnf(c_0_219,negated_conjecture,
    ( nil = esk51_0
    | ssItem(esk52_0) ),
    i_0_196 ).

cnf(c_0_220,plain,
    ( singletonP(cons(X1,nil))
    | ~ ssList(cons(X1,nil))
    | ~ ssItem(X1) ),
    inference(er,[status(thm)],[c_0_214]) ).

cnf(c_0_221,negated_conjecture,
    ( cons(esk52_0,nil) = esk48_0
    | nil = esk49_0 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_215,c_0_216]),c_0_217]) ).

cnf(c_0_222,negated_conjecture,
    ssList(esk48_0),
    inference(rw,[status(thm)],[c_0_218,c_0_217]) ).

cnf(c_0_223,negated_conjecture,
    ~ singletonP(esk48_0),
    i_0_197 ).

cnf(c_0_224,negated_conjecture,
    ( nil = esk49_0
    | ssItem(esk52_0) ),
    inference(rw,[status(thm)],[c_0_219,c_0_216]) ).

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

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

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

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

cnf(c_0_229,negated_conjecture,
    neq(esk49_0,esk49_0),
    inference(rw,[status(thm)],[c_0_226,c_0_227]) ).

cnf(c_0_230,negated_conjecture,
    ssList(esk49_0),
    i_0_203 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : SWC256+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.35  % Computer : n022.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Sun Jun 12 16:07:05 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.46  # ENIGMATIC: Selected SinE mode:
% 0.21/0.47  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.21/0.47  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.21/0.47  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.68/2.41  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.68/2.41  # No SInE strategy applied
% 7.68/2.41  # Trying AutoSched0 for 150 seconds
% 7.68/2.41  # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.68/2.41  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.68/2.41  #
% 7.68/2.41  # Preprocessing time       : 0.013 s
% 7.68/2.41  
% 7.68/2.41  # Proof found!
% 7.68/2.41  # SZS status Theorem
% 7.68/2.41  # SZS output start CNFRefutation
% See solution above
% 7.68/2.41  # Training examples: 0 positive, 0 negative
% 7.68/2.41  
% 7.68/2.41  # -------------------------------------------------
% 7.68/2.41  # User time                : 0.016 s
% 7.68/2.41  # System time              : 0.004 s
% 7.68/2.41  # Total time               : 0.020 s
% 7.68/2.41  # Maximum resident set size: 7132 pages
% 7.68/2.41  
%------------------------------------------------------------------------------