%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SWV166+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n028.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 : Wed Jul 20 17:46:04 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_174,plain,
    ( a_select2(rhoold_init,X1) = init
    | ~ epred1_0
    | ~ leq(X1,n4)
    | ~ leq(n0,X1)
    | ~ gt(loopcounter,n1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eyy8clh3/lgb.p',i_0_174) ).

cnf(i_0_4,negated_conjecture,
    epred1_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eyy8clh3/lgb.p',i_0_4) ).

cnf(i_0_181,plain,
    ( gt(loopcounter,n1)
    | ~ epred1_0 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eyy8clh3/lgb.p',i_0_181) ).

cnf(i_0_1,negated_conjecture,
    a_select2(rhoold_init,esk1_0) != init,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eyy8clh3/lgb.p',i_0_1) ).

cnf(i_0_2,negated_conjecture,
    leq(esk1_0,n4),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eyy8clh3/lgb.p',i_0_2) ).

cnf(i_0_3,negated_conjecture,
    leq(n0,esk1_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eyy8clh3/lgb.p',i_0_3) ).

cnf(c_0_188,plain,
    ( a_select2(rhoold_init,X1) = init
    | ~ epred1_0
    | ~ leq(X1,n4)
    | ~ leq(n0,X1)
    | ~ gt(loopcounter,n1) ),
    i_0_174 ).

cnf(c_0_189,negated_conjecture,
    epred1_0,
    i_0_4 ).

cnf(c_0_190,plain,
    ( gt(loopcounter,n1)
    | ~ epred1_0 ),
    i_0_181 ).

cnf(c_0_191,plain,
    ( a_select2(rhoold_init,X1) = init
    | ~ gt(loopcounter,n1)
    | ~ leq(X1,n4)
    | ~ leq(n0,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_188,c_0_189])]) ).

cnf(c_0_192,plain,
    gt(loopcounter,n1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_190,c_0_189])]) ).

cnf(c_0_193,negated_conjecture,
    a_select2(rhoold_init,esk1_0) != init,
    i_0_1 ).

cnf(c_0_194,plain,
    ( a_select2(rhoold_init,X1) = init
    | ~ leq(X1,n4)
    | ~ leq(n0,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_191,c_0_192])]) ).

cnf(c_0_195,negated_conjecture,
    leq(esk1_0,n4),
    i_0_2 ).

cnf(c_0_196,negated_conjecture,
    leq(n0,esk1_0),
    i_0_3 ).

cnf(c_0_197,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_193,c_0_194]),c_0_195]),c_0_196])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SWV166+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.12/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n028.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 : Wed Jun 15 20:42:42 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
% 8.51/2.48  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.51/2.48  # No SInE strategy applied
% 8.51/2.48  # Trying AutoSched0 for 150 seconds
% 8.51/2.48  # AutoSched0-Mode selected heuristic G_E___300_C18_F1_URBAN_S0Y
% 8.51/2.48  # and selection function SelectMaxLComplexAvoidPosPred.
% 8.51/2.48  #
% 8.51/2.48  # Preprocessing time       : 0.023 s
% 8.51/2.48  
% 8.51/2.48  # Proof found!
% 8.51/2.48  # SZS status Theorem
% 8.51/2.48  # SZS output start CNFRefutation
% See solution above
% 8.51/2.48  # Training examples: 0 positive, 0 negative
% 8.51/2.48  
% 8.51/2.48  # -------------------------------------------------
% 8.51/2.48  # User time                : 0.029 s
% 8.51/2.48  # System time              : 0.007 s
% 8.51/2.48  # Total time               : 0.035 s
% 8.51/2.48  # Maximum resident set size: 7128 pages
% 8.51/2.48  
%------------------------------------------------------------------------------