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

View Problem - Process Solution

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

% Computer : n025.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:15:09 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_195,negated_conjecture,
    app(esk50_0,esk52_0) = esk51_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-odhtsgdo/lgb.p',i_0_195) ).

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

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

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

cnf(i_0_113,plain,
    ( frontsegP(X1,X2)
    | app(X2,X3) != X1
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-odhtsgdo/lgb.p',i_0_113) ).

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

cnf(i_0_192,negated_conjecture,
    ~ frontsegP(esk49_0,esk48_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-odhtsgdo/lgb.p',i_0_192) ).

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

cnf(c_0_212,negated_conjecture,
    app(esk50_0,esk52_0) = esk51_0,
    i_0_195 ).

cnf(c_0_213,negated_conjecture,
    esk49_0 = esk51_0,
    i_0_199 ).

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

cnf(c_0_215,negated_conjecture,
    esk50_0 = esk48_0,
    i_0_198 ).

cnf(c_0_216,plain,
    ( frontsegP(X1,X2)
    | app(X2,X3) != X1
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3) ),
    i_0_113 ).

cnf(c_0_217,negated_conjecture,
    app(esk50_0,esk52_0) = esk49_0,
    inference(rw,[status(thm)],[c_0_212,c_0_213]) ).

cnf(c_0_218,negated_conjecture,
    ssList(esk52_0),
    i_0_196 ).

cnf(c_0_219,negated_conjecture,
    ssList(esk50_0),
    inference(rw,[status(thm)],[c_0_214,c_0_215]) ).

cnf(c_0_220,negated_conjecture,
    ~ frontsegP(esk49_0,esk48_0),
    i_0_192 ).

cnf(c_0_221,negated_conjecture,
    ( frontsegP(X1,esk50_0)
    | esk49_0 != X1
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_216,c_0_217]),c_0_218]),c_0_219])]) ).

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

cnf(c_0_223,negated_conjecture,
    ~ frontsegP(esk49_0,esk50_0),
    inference(rw,[status(thm)],[c_0_220,c_0_215]) ).

cnf(c_0_224,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_221]),c_0_222])]),c_0_223]),
    [proof] ).

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