↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SWC198+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:14:14 EDT 2022

% Result   : Theorem 7.80s 2.34s
% Output   : CNFRefutation 7.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   38 (  10 unt;  15 nHn;  38 RR)
%            Number of literals    :   79 (  33 equ;  34 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :   23 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_195,negated_conjecture,
    ( esk50_0 = nil
    | cons(esk53_0,nil) = esk50_0 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t3djwbb1/lgb.p',i_0_195) ).

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

cnf(i_0_197,negated_conjecture,
    ( esk50_0 = nil
    | ssItem(esk53_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t3djwbb1/lgb.p',i_0_197) ).

cnf(i_0_78,plain,
    ( X1 = X2
    | memberP(X3,X2)
    | ~ ssList(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ memberP(cons(X1,X3),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t3djwbb1/lgb.p',i_0_78) ).

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

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

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

cnf(i_0_200,negated_conjecture,
    ( memberP(esk48_0,esk52_1(X1))
    | ~ ssItem(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t3djwbb1/lgb.p',i_0_200) ).

cnf(i_0_201,negated_conjecture,
    ( ssItem(esk52_1(X1))
    | ~ ssItem(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t3djwbb1/lgb.p',i_0_201) ).

cnf(i_0_53,plain,
    ( cons(X1,X2) != nil
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t3djwbb1/lgb.p',i_0_53) ).

cnf(i_0_198,negated_conjecture,
    ( nil = esk51_0
    | ssItem(esk53_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t3djwbb1/lgb.p',i_0_198) ).

cnf(i_0_199,negated_conjecture,
    ( esk52_1(X1) != X1
    | ~ ssItem(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t3djwbb1/lgb.p',i_0_199) ).

cnf(i_0_63,plain,
    ssItem(esk28_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t3djwbb1/lgb.p',i_0_63) ).

cnf(c_0_216,negated_conjecture,
    ( esk50_0 = nil
    | cons(esk53_0,nil) = esk50_0 ),
    i_0_195 ).

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

cnf(c_0_218,negated_conjecture,
    ( esk50_0 = nil
    | ssItem(esk53_0) ),
    i_0_197 ).

cnf(c_0_219,plain,
    ( X1 = X2
    | memberP(X3,X2)
    | ~ ssList(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ memberP(cons(X1,X3),X2) ),
    i_0_78 ).

cnf(c_0_220,negated_conjecture,
    ( cons(esk53_0,nil) = esk48_0
    | nil = esk48_0 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_216,c_0_217]),c_0_217]) ).

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

cnf(c_0_222,negated_conjecture,
    ( nil = esk48_0
    | ssItem(esk53_0) ),
    inference(rw,[status(thm)],[c_0_218,c_0_217]) ).

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

cnf(c_0_224,negated_conjecture,
    ( nil = esk51_0
    | cons(esk53_0,nil) = esk50_0 ),
    i_0_196 ).

cnf(c_0_225,negated_conjecture,
    ( nil = esk48_0
    | esk53_0 = X1
    | ~ memberP(esk48_0,X1)
    | ~ ssItem(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_219,c_0_220]),c_0_221])]),c_0_222]),c_0_223]) ).

cnf(c_0_226,negated_conjecture,
    ( memberP(esk48_0,esk52_1(X1))
    | ~ ssItem(X1) ),
    i_0_200 ).

cnf(c_0_227,negated_conjecture,
    ( ssItem(esk52_1(X1))
    | ~ ssItem(X1) ),
    i_0_201 ).

cnf(c_0_228,plain,
    ( cons(X1,X2) != nil
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    i_0_53 ).

cnf(c_0_229,negated_conjecture,
    ( cons(esk53_0,nil) = esk48_0
    | nil = esk51_0 ),
    inference(rw,[status(thm)],[c_0_224,c_0_217]) ).

cnf(c_0_230,negated_conjecture,
    ( nil = esk51_0
    | ssItem(esk53_0) ),
    i_0_198 ).

cnf(c_0_231,negated_conjecture,
    ( esk52_1(X1) != X1
    | ~ ssItem(X1) ),
    i_0_199 ).

cnf(c_0_232,negated_conjecture,
    ( esk52_1(X1) = esk53_0
    | nil = esk48_0
    | ~ ssItem(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_225,c_0_226]),c_0_227]) ).

cnf(c_0_233,negated_conjecture,
    ( nil = esk51_0
    | nil != esk48_0 ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_228,c_0_229]),c_0_221])]),c_0_230]) ).

cnf(c_0_234,negated_conjecture,
    nil = esk48_0,
    inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_231,c_0_232])]),c_0_222]) ).

cnf(c_0_235,negated_conjecture,
    esk48_0 = esk51_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_233,c_0_234]),c_0_234])]) ).

cnf(c_0_236,plain,
    ( ~ memberP(esk51_0,X1)
    | ~ ssItem(X1) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_223,c_0_234]),c_0_235]) ).

cnf(c_0_237,negated_conjecture,
    ( memberP(esk51_0,esk52_1(X1))
    | ~ ssItem(X1) ),
    inference(rw,[status(thm)],[c_0_226,c_0_235]) ).

cnf(c_0_238,plain,
    ssItem(esk28_0),
    i_0_63 ).

cnf(c_0_239,plain,
    ~ ssItem(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_237]),c_0_227]) ).

cnf(c_0_240,plain,
    $false,
    inference(sr,[status(thm)],[c_0_238,c_0_239]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWC198+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/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 23:51:57 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 0.18/0.45  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.45  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.45  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.80/2.34  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.80/2.34  # No SInE strategy applied
% 7.80/2.34  # Trying AutoSched0 for 150 seconds
% 7.80/2.34  # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.80/2.34  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.80/2.34  #
% 7.80/2.34  # Preprocessing time       : 0.014 s
% 7.80/2.34  
% 7.80/2.34  # Proof found!
% 7.80/2.34  # SZS status Theorem
% 7.80/2.34  # SZS output start CNFRefutation
% See solution above
% 7.80/2.34  # Training examples: 0 positive, 0 negative
% 7.80/2.35  
% 7.80/2.35  # -------------------------------------------------
% 7.80/2.35  # User time                : 0.050 s
% 7.80/2.35  # System time              : 0.006 s
% 7.80/2.35  # Total time               : 0.056 s
% 7.80/2.35  # Maximum resident set size: 7124 pages
% 7.80/2.35  
%------------------------------------------------------------------------------