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

View Problem - Process Solution

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

% Computer : n023.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:13:49 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_41,plain,
    ( X1 = X2
    | neq(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wy0hcvqa/lgb.p',i_0_41) ).

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

cnf(i_0_191,negated_conjecture,
    ~ cyclefreeP(esk49_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wy0hcvqa/lgb.p',i_0_191) ).

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

cnf(i_0_195,negated_conjecture,
    ssList(esk51_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wy0hcvqa/lgb.p',i_0_195) ).

cnf(i_0_192,negated_conjecture,
    ~ neq(esk51_0,nil),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wy0hcvqa/lgb.p',i_0_192) ).

cnf(i_0_116,plain,
    cyclefreeP(nil),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wy0hcvqa/lgb.p',i_0_116) ).

cnf(c_0_203,plain,
    ( X1 = X2
    | neq(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    i_0_41 ).

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

cnf(c_0_205,negated_conjecture,
    ~ cyclefreeP(esk49_0),
    i_0_191 ).

cnf(c_0_206,negated_conjecture,
    esk49_0 = esk51_0,
    i_0_194 ).

cnf(c_0_207,plain,
    ( X1 = nil
    | neq(X1,nil)
    | ~ ssList(X1) ),
    inference(spm,[status(thm)],[c_0_203,c_0_204]) ).

cnf(c_0_208,negated_conjecture,
    ssList(esk51_0),
    i_0_195 ).

cnf(c_0_209,negated_conjecture,
    ~ neq(esk51_0,nil),
    i_0_192 ).

cnf(c_0_210,negated_conjecture,
    ~ cyclefreeP(esk51_0),
    inference(rw,[status(thm)],[c_0_205,c_0_206]) ).

cnf(c_0_211,negated_conjecture,
    esk51_0 = nil,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_207,c_0_208]),c_0_209]) ).

cnf(c_0_212,plain,
    cyclefreeP(nil),
    i_0_116 ).

cnf(c_0_213,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_210,c_0_211]),c_0_212])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SWC131+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n023.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jun 12 20:05:08 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected SinE mode:
% 0.20/0.47  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.20/0.47  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.20/0.47  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.70/2.39  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.70/2.39  # No SInE strategy applied
% 7.70/2.39  # Trying AutoSched0 for 150 seconds
% 7.70/2.39  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.70/2.39  # and selection function SelectComplexExceptUniqMaxHorn.
% 7.70/2.39  #
% 7.70/2.39  # Preprocessing time       : 0.023 s
% 7.70/2.39  # Presaturation interreduction done
% 7.70/2.39  
% 7.70/2.39  # Proof found!
% 7.70/2.39  # SZS status Theorem
% 7.70/2.39  # SZS output start CNFRefutation
% See solution above
% 7.70/2.39  # Training examples: 0 positive, 0 negative
% 7.70/2.39  
% 7.70/2.39  # -------------------------------------------------
% 7.70/2.39  # User time                : 0.026 s
% 7.70/2.39  # System time              : 0.005 s
% 7.70/2.39  # Total time               : 0.031 s
% 7.70/2.39  # Maximum resident set size: 7128 pages
% 7.70/2.39  
%------------------------------------------------------------------------------