TSTP Solution File: CSR043+2 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n021.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 : Fri Jul 15 02:46:54 EDT 2022

% Result   : Theorem 6.84s 2.58s
% Output   : CNFRefutation 6.84s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    2
% Syntax   : Number of clauses     :    5 (   5 unt;   0 nHn;   5 RR)
%            Number of literals    :    5 (   0 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1071,negated_conjecture,
    ~ genls(c_tptpcol_16_30972,c_tptpcol_15_30970),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3spdsqoc/lgb.p',i_0_1071) ).

cnf(i_0_289,plain,
    genls(c_tptpcol_16_30972,c_tptpcol_15_30970),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3spdsqoc/lgb.p',i_0_289) ).

cnf(c_0_1074,negated_conjecture,
    ~ genls(c_tptpcol_16_30972,c_tptpcol_15_30970),
    i_0_1071 ).

cnf(c_0_1075,plain,
    genls(c_tptpcol_16_30972,c_tptpcol_15_30970),
    i_0_289 ).

cnf(c_0_1076,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_1074,c_0_1075])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : CSR043+2 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n021.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 : Sat Jun 11 05:03:41 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 0.19/0.48  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.48  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.48  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.48  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 6.84/2.58  # ENIGMATIC: Solved by autoschedule-lgb:
% 6.84/2.58  # No SInE strategy applied
% 6.84/2.58  # Trying AutoSched0 for 150 seconds
% 6.84/2.58  # AutoSched0-Mode selected heuristic G_____0021_C18_F1_SE_CS_SP_S4S
% 6.84/2.58  # and selection function SelectNewComplexAHPNS.
% 6.84/2.58  #
% 6.84/2.58  # Preprocessing time       : 0.026 s
% 6.84/2.58  
% 6.84/2.58  # Proof found!
% 6.84/2.58  # SZS status Theorem
% 6.84/2.58  # SZS output start CNFRefutation
% See solution above
% 6.84/2.58  # Training examples: 0 positive, 0 negative
% 6.84/2.58  
% 6.84/2.58  # -------------------------------------------------
% 6.84/2.58  # User time                : 0.029 s
% 6.84/2.58  # System time              : 0.006 s
% 6.84/2.58  # Total time               : 0.035 s
% 6.84/2.58  # Maximum resident set size: 7120 pages
% 6.84/2.58  
%------------------------------------------------------------------------------