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

View Problem - Process Solution

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

% Result   : Theorem 7.42s 2.35s
% Output   : CNFRefutation 7.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   33 (  10 unt;   6 nHn;  33 RR)
%            Number of literals    :   86 (  24 equ;  56 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-3 aty)
%            Number of variables   :   40 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_79,plain,
    ( ~ ssItem(X1)
    | ~ memberP(nil,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7lttzuxl/lgb.p',i_0_79) ).

cnf(i_0_201,negated_conjecture,
    ( memberP(X1,esk52_3(X2,X1,X3))
    | app(app(X1,cons(X2,nil)),X3) != esk48_0
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssItem(X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7lttzuxl/lgb.p',i_0_201) ).

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

cnf(i_0_202,negated_conjecture,
    ( ssItem(esk52_3(X1,X2,X3))
    | app(app(X2,cons(X1,nil)),X3) != esk48_0
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7lttzuxl/lgb.p',i_0_202) ).

cnf(i_0_60,plain,
    ( app(nil,X1) = X1
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7lttzuxl/lgb.p',i_0_60) ).

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-7lttzuxl/lgb.p',i_0_154) ).

cnf(i_0_43,plain,
    ( ssList(cons(X1,X2))
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7lttzuxl/lgb.p',i_0_43) ).

cnf(i_0_147,plain,
    ( nil = X1
    | cons(hd(X1),tl(X1)) = X1
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7lttzuxl/lgb.p',i_0_147) ).

cnf(i_0_209,negated_conjecture,
    ssList(esk48_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7lttzuxl/lgb.p',i_0_209) ).

cnf(i_0_203,negated_conjecture,
    nil != esk48_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7lttzuxl/lgb.p',i_0_203) ).

cnf(i_0_56,plain,
    ( nil = X1
    | ssList(tl(X1))
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7lttzuxl/lgb.p',i_0_56) ).

cnf(i_0_54,plain,
    ( nil = X1
    | ssItem(hd(X1))
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7lttzuxl/lgb.p',i_0_54) ).

cnf(c_0_222,plain,
    ( ~ ssItem(X1)
    | ~ memberP(nil,X1) ),
    i_0_79 ).

cnf(c_0_223,negated_conjecture,
    ( memberP(X1,esk52_3(X2,X1,X3))
    | app(app(X1,cons(X2,nil)),X3) != esk48_0
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssItem(X2) ),
    i_0_201 ).

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

cnf(c_0_225,plain,
    ( app(app(nil,cons(X1,nil)),X2) != esk48_0
    | ~ ssList(X2)
    | ~ ssItem(esk52_3(X1,nil,X2))
    | ~ ssItem(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_222,c_0_223]),c_0_224])]) ).

cnf(c_0_226,negated_conjecture,
    ( ssItem(esk52_3(X1,X2,X3))
    | app(app(X2,cons(X1,nil)),X3) != esk48_0
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    i_0_202 ).

cnf(c_0_227,negated_conjecture,
    ( app(app(nil,cons(X1,nil)),X2) != esk48_0
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_225,c_0_226]),c_0_224])]) ).

cnf(c_0_228,plain,
    ( app(nil,X1) = X1
    | ~ ssList(X1) ),
    i_0_60 ).

cnf(c_0_229,plain,
    ( app(cons(X1,nil),X2) != esk48_0
    | ~ ssList(cons(X1,nil))
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(spm,[status(thm)],[c_0_227,c_0_228]) ).

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

cnf(c_0_231,plain,
    ( cons(X1,X2) != esk48_0
    | ~ ssList(cons(X1,nil))
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(spm,[status(thm)],[c_0_229,c_0_230]) ).

cnf(c_0_232,plain,
    ( ssList(cons(X1,X2))
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    i_0_43 ).

cnf(c_0_233,plain,
    ( nil = X1
    | cons(hd(X1),tl(X1)) = X1
    | ~ ssList(X1) ),
    i_0_147 ).

cnf(c_0_234,negated_conjecture,
    ssList(esk48_0),
    i_0_209 ).

cnf(c_0_235,negated_conjecture,
    nil != esk48_0,
    i_0_203 ).

cnf(c_0_236,plain,
    ( nil = X1
    | ssList(tl(X1))
    | ~ ssList(X1) ),
    i_0_56 ).

cnf(c_0_237,plain,
    ( nil = X1
    | ssItem(hd(X1))
    | ~ ssList(X1) ),
    i_0_54 ).

cnf(c_0_238,plain,
    ( cons(X1,X2) != esk48_0
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_231,c_0_232]),c_0_224])]) ).

cnf(c_0_239,negated_conjecture,
    cons(hd(esk48_0),tl(esk48_0)) = esk48_0,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_233,c_0_234]),c_0_235]) ).

cnf(c_0_240,negated_conjecture,
    ssList(tl(esk48_0)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_234]),c_0_235]) ).

cnf(c_0_241,negated_conjecture,
    ssItem(hd(esk48_0)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_234]),c_0_235]) ).

cnf(c_0_242,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_238,c_0_239]),c_0_240]),c_0_241])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SWC227+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n022.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jun 12 23:10:35 EDT 2022
% 0.12/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.42/2.35  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.42/2.35  # No SInE strategy applied
% 7.42/2.35  # Trying AutoSched0 for 150 seconds
% 7.42/2.35  # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_RG_S04BN
% 7.42/2.35  # and selection function PSelectComplexExceptUniqMaxHorn.
% 7.42/2.35  #
% 7.42/2.35  # Preprocessing time       : 0.026 s
% 7.42/2.35  
% 7.42/2.35  # Proof found!
% 7.42/2.35  # SZS status Theorem
% 7.42/2.35  # SZS output start CNFRefutation
% See solution above
% 7.42/2.35  # Training examples: 0 positive, 0 negative
% 7.42/2.35  
% 7.42/2.35  # -------------------------------------------------
% 7.42/2.35  # User time                : 0.036 s
% 7.42/2.35  # System time              : 0.008 s
% 7.42/2.35  # Total time               : 0.043 s
% 7.42/2.35  # Maximum resident set size: 7128 pages
% 7.42/2.35  
%------------------------------------------------------------------------------