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

View Problem - Process Solution

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

% Computer : n015.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:08 EDT 2022

% Result   : Theorem 7.74s 2.32s
% Output   : CNFRefutation 7.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   35 (  15 unt;  12 nHn;  35 RR)
%            Number of literals    :   94 (  10 equ;  55 neg)
%            Maximal clause size   :    9 (   2 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   2 con; 0-2 aty)
%            Number of variables   :   33 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_192,negated_conjecture,
    ~ duplicatefreeP(esk48_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jm_ag7t_/lgb.p',i_0_192) ).

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

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

cnf(i_0_26,plain,
    ( esk16_1(X1) = esk17_1(X1)
    | duplicatefreeP(X1)
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jm_ag7t_/lgb.p',i_0_26) ).

cnf(i_0_25,plain,
    ( lt(X1,X2)
    | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X6
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssList(X3)
    | ~ ssList(X6)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ strictorderedP(X6) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jm_ag7t_/lgb.p',i_0_25) ).

cnf(i_0_27,plain,
    ( app(app(esk18_1(X1),cons(esk16_1(X1),esk19_1(X1))),cons(esk17_1(X1),esk20_1(X1))) = X1
    | duplicatefreeP(X1)
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jm_ag7t_/lgb.p',i_0_27) ).

cnf(i_0_32,plain,
    ( duplicatefreeP(X1)
    | ssItem(esk16_1(X1))
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jm_ag7t_/lgb.p',i_0_32) ).

cnf(i_0_195,negated_conjecture,
    strictorderedP(esk50_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jm_ag7t_/lgb.p',i_0_195) ).

cnf(i_0_69,plain,
    ( ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ lt(X1,X2)
    | ~ lt(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jm_ag7t_/lgb.p',i_0_69) ).

cnf(i_0_28,plain,
    ( duplicatefreeP(X1)
    | ssList(esk20_1(X1))
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jm_ag7t_/lgb.p',i_0_28) ).

cnf(i_0_29,plain,
    ( duplicatefreeP(X1)
    | ssList(esk19_1(X1))
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jm_ag7t_/lgb.p',i_0_29) ).

cnf(i_0_30,plain,
    ( duplicatefreeP(X1)
    | ssList(esk18_1(X1))
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jm_ag7t_/lgb.p',i_0_30) ).

cnf(c_0_217,negated_conjecture,
    ~ duplicatefreeP(esk48_0),
    i_0_192 ).

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

cnf(c_0_219,negated_conjecture,
    ssList(esk48_0),
    i_0_204 ).

cnf(c_0_220,negated_conjecture,
    ~ duplicatefreeP(esk50_0),
    inference(rw,[status(thm)],[c_0_217,c_0_218]) ).

cnf(c_0_221,plain,
    ( esk16_1(X1) = esk17_1(X1)
    | duplicatefreeP(X1)
    | ~ ssList(X1) ),
    i_0_26 ).

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

cnf(c_0_223,plain,
    ( lt(X1,X2)
    | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X6
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssList(X3)
    | ~ ssList(X6)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ strictorderedP(X6) ),
    i_0_25 ).

cnf(c_0_224,plain,
    ( app(app(esk18_1(X1),cons(esk16_1(X1),esk19_1(X1))),cons(esk17_1(X1),esk20_1(X1))) = X1
    | duplicatefreeP(X1)
    | ~ ssList(X1) ),
    i_0_27 ).

cnf(c_0_225,negated_conjecture,
    esk16_1(esk50_0) = esk17_1(esk50_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_220,c_0_221]),c_0_222])]) ).

cnf(c_0_226,plain,
    ( duplicatefreeP(X1)
    | ssItem(esk16_1(X1))
    | ~ ssList(X1) ),
    i_0_32 ).

cnf(c_0_227,plain,
    ( lt(X1,X2)
    | ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssList(X3) ),
    inference(er,[status(thm)],[c_0_223]) ).

cnf(c_0_228,plain,
    app(app(esk18_1(esk50_0),cons(esk17_1(esk50_0),esk19_1(esk50_0))),cons(esk17_1(esk50_0),esk20_1(esk50_0))) = esk50_0,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_224,c_0_225]),c_0_222])]),c_0_220]) ).

cnf(c_0_229,negated_conjecture,
    strictorderedP(esk50_0),
    i_0_195 ).

cnf(c_0_230,plain,
    ssItem(esk17_1(esk50_0)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_226,c_0_225]),c_0_222])]),c_0_220]) ).

cnf(c_0_231,plain,
    ( ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ lt(X1,X2)
    | ~ lt(X2,X1) ),
    i_0_69 ).

cnf(c_0_232,plain,
    ( lt(esk17_1(esk50_0),esk17_1(esk50_0))
    | ~ ssList(esk20_1(esk50_0))
    | ~ ssList(esk19_1(esk50_0))
    | ~ ssList(esk18_1(esk50_0)) ),
    inference(cn,[status(thm)],[inference(rw,[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_230]),c_0_222])]) ).

cnf(c_0_233,plain,
    ( ~ ssList(esk20_1(esk50_0))
    | ~ ssList(esk19_1(esk50_0))
    | ~ ssList(esk18_1(esk50_0)) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_231,c_0_232]),c_0_230])]),c_0_232]) ).

cnf(c_0_234,plain,
    ( duplicatefreeP(X1)
    | ssList(esk20_1(X1))
    | ~ ssList(X1) ),
    i_0_28 ).

cnf(c_0_235,plain,
    ( ~ ssList(esk19_1(esk50_0))
    | ~ ssList(esk18_1(esk50_0)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_233,c_0_234]),c_0_222])]),c_0_220]) ).

cnf(c_0_236,plain,
    ( duplicatefreeP(X1)
    | ssList(esk19_1(X1))
    | ~ ssList(X1) ),
    i_0_29 ).

cnf(c_0_237,plain,
    ~ ssList(esk18_1(esk50_0)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_235,c_0_236]),c_0_222])]),c_0_220]) ).

cnf(c_0_238,plain,
    ( duplicatefreeP(X1)
    | ssList(esk18_1(X1))
    | ~ ssList(X1) ),
    i_0_30 ).

cnf(c_0_239,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_238]),c_0_222])]),c_0_220]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SWC181+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n015.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 : Sat Jun 11 20:12:07 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected SinE mode:
% 0.19/0.45  # Parsing /export/starexec/sandbox/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.74/2.32  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.74/2.32  # No SInE strategy applied
% 7.74/2.32  # Trying AutoSched0 for 150 seconds
% 7.74/2.32  # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.74/2.32  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.74/2.32  #
% 7.74/2.32  # Preprocessing time       : 0.015 s
% 7.74/2.32  
% 7.74/2.32  # Proof found!
% 7.74/2.32  # SZS status Theorem
% 7.74/2.32  # SZS output start CNFRefutation
% See solution above
% 7.74/2.32  # Training examples: 0 positive, 0 negative
% 7.74/2.32  
% 7.74/2.32  # -------------------------------------------------
% 7.74/2.32  # User time                : 0.017 s
% 7.74/2.32  # System time              : 0.006 s
% 7.74/2.32  # Total time               : 0.023 s
% 7.74/2.32  # Maximum resident set size: 7128 pages
% 7.74/2.32  
%------------------------------------------------------------------------------