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

View Problem - Process Solution

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

% Computer : n017.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 : Mon Jul 18 08:24:08 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
    ( less(X1,X2)
    | ~ rdn_positive_less(X3,X4)
    | ~ rdn_translate(X2,rdn_neg(X3))
    | ~ rdn_translate(X1,rdn_neg(X4)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xs2th6ct/lgb.p',i_0_6) ).

cnf(i_0_139,plain,
    rdn_translate(nn2,rdn_neg(rdnn(n2))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xs2th6ct/lgb.p',i_0_139) ).

cnf(i_0_14,plain,
    ( ~ less(X1,X2)
    | ~ less(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xs2th6ct/lgb.p',i_0_14) ).

cnf(i_0_18,negated_conjecture,
    less(nn2,nn4),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xs2th6ct/lgb.p',i_0_18) ).

cnf(i_0_154,plain,
    ( rdn_positive_less(rdnn(X1),rdnn(X2))
    | ~ rdn_positive_less(rdnn(X3),rdnn(X2))
    | ~ rdn_positive_less(rdnn(X1),rdnn(X3)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xs2th6ct/lgb.p',i_0_154) ).

cnf(i_0_146,plain,
    rdn_positive_less(rdnn(n3),rdnn(n4)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xs2th6ct/lgb.p',i_0_146) ).

cnf(i_0_140,plain,
    rdn_translate(nn4,rdn_neg(rdnn(n4))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xs2th6ct/lgb.p',i_0_140) ).

cnf(i_0_145,plain,
    rdn_positive_less(rdnn(n2),rdnn(n3)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xs2th6ct/lgb.p',i_0_145) ).

cnf(c_0_163,plain,
    ( less(X1,X2)
    | ~ rdn_positive_less(X3,X4)
    | ~ rdn_translate(X2,rdn_neg(X3))
    | ~ rdn_translate(X1,rdn_neg(X4)) ),
    i_0_6 ).

cnf(c_0_164,plain,
    rdn_translate(nn2,rdn_neg(rdnn(n2))),
    i_0_139 ).

cnf(c_0_165,plain,
    ( ~ less(X1,X2)
    | ~ less(X2,X1) ),
    i_0_14 ).

cnf(c_0_166,negated_conjecture,
    less(nn2,nn4),
    i_0_18 ).

cnf(c_0_167,plain,
    ( rdn_positive_less(rdnn(X1),rdnn(X2))
    | ~ rdn_positive_less(rdnn(X3),rdnn(X2))
    | ~ rdn_positive_less(rdnn(X1),rdnn(X3)) ),
    i_0_154 ).

cnf(c_0_168,plain,
    rdn_positive_less(rdnn(n3),rdnn(n4)),
    i_0_146 ).

cnf(c_0_169,plain,
    ( less(X1,nn2)
    | ~ rdn_translate(X1,rdn_neg(X2))
    | ~ rdn_positive_less(rdnn(n2),X2) ),
    inference(spm,[status(thm)],[c_0_163,c_0_164]) ).

cnf(c_0_170,plain,
    rdn_translate(nn4,rdn_neg(rdnn(n4))),
    i_0_140 ).

cnf(c_0_171,negated_conjecture,
    ~ less(nn4,nn2),
    inference(spm,[status(thm)],[c_0_165,c_0_166]) ).

cnf(c_0_172,plain,
    ( rdn_positive_less(rdnn(X1),rdnn(n4))
    | ~ rdn_positive_less(rdnn(X1),rdnn(n3)) ),
    inference(spm,[status(thm)],[c_0_167,c_0_168]) ).

cnf(c_0_173,plain,
    rdn_positive_less(rdnn(n2),rdnn(n3)),
    i_0_145 ).

cnf(c_0_174,plain,
    ~ rdn_positive_less(rdnn(n2),rdnn(n4)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_169,c_0_170]),c_0_171]) ).

cnf(c_0_175,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_172,c_0_173]),c_0_174]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : NUM299+1 : TPTP v8.1.0. Released v3.1.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n017.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 : Tue Jul  5 17:39:45 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.45  # ENIGMATIC: Selected SinE mode:
% 0.18/0.46  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.46  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.46  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.46  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.14/2.40  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.14/2.40  # No SInE strategy applied
% 8.14/2.40  # Trying AutoSched0 for 150 seconds
% 8.14/2.40  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 8.14/2.40  # and selection function SelectNewComplexAHP.
% 8.14/2.40  #
% 8.14/2.40  # Preprocessing time       : 0.022 s
% 8.14/2.40  # Presaturation interreduction done
% 8.14/2.40  
% 8.14/2.40  # Proof found!
% 8.14/2.40  # SZS status Theorem
% 8.14/2.40  # SZS output start CNFRefutation
% See solution above
% 8.14/2.40  # Training examples: 0 positive, 0 negative
% 8.14/2.40  
% 8.14/2.40  # -------------------------------------------------
% 8.14/2.40  # User time                : 0.034 s
% 8.14/2.40  # System time              : 0.003 s
% 8.14/2.40  # Total time               : 0.037 s
% 8.14/2.40  # Maximum resident set size: 7128 pages
% 8.14/2.40  
%------------------------------------------------------------------------------