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

View Problem - Process Solution

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

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

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_23,plain,
    rdn_translate(n31,rdn_pos(rdn(rdnn(n1),rdnn(n3)))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ocz97rwt/lgb.p',i_0_23) ).

cnf(i_0_18,negated_conjecture,
    n21 = n31,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ocz97rwt/lgb.p',i_0_18) ).

cnf(i_0_8,plain,
    ( less(X1,X2)
    | ~ rdn_positive_less(X3,X4)
    | ~ rdn_translate(X2,rdn_pos(X4))
    | ~ rdn_translate(X1,rdn_pos(X3)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ocz97rwt/lgb.p',i_0_8) ).

cnf(i_0_152,plain,
    ( rdn_positive_less(rdn(rdnn(X1),X2),rdn(rdnn(X3),X4))
    | ~ rdn_positive_less(X2,X4) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ocz97rwt/lgb.p',i_0_152) ).

cnf(i_0_13,plain,
    ( X1 != X2
    | ~ less(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ocz97rwt/lgb.p',i_0_13) ).

cnf(i_0_21,plain,
    rdn_translate(n21,rdn_pos(rdn(rdnn(n1),rdnn(n2)))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ocz97rwt/lgb.p',i_0_21) ).

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

cnf(c_0_160,plain,
    rdn_translate(n31,rdn_pos(rdn(rdnn(n1),rdnn(n3)))),
    i_0_23 ).

cnf(c_0_161,negated_conjecture,
    n21 = n31,
    i_0_18 ).

cnf(c_0_162,plain,
    ( less(X1,X2)
    | ~ rdn_positive_less(X3,X4)
    | ~ rdn_translate(X2,rdn_pos(X4))
    | ~ rdn_translate(X1,rdn_pos(X3)) ),
    i_0_8 ).

cnf(c_0_163,plain,
    rdn_translate(n21,rdn_pos(rdn(rdnn(n1),rdnn(n3)))),
    inference(rw,[status(thm)],[c_0_160,c_0_161]) ).

cnf(c_0_164,plain,
    ( less(X1,n21)
    | ~ rdn_positive_less(X2,rdn(rdnn(n1),rdnn(n3)))
    | ~ rdn_translate(X1,rdn_pos(X2)) ),
    inference(spm,[status(thm)],[c_0_162,c_0_163]) ).

cnf(c_0_165,plain,
    ( rdn_positive_less(rdn(rdnn(X1),X2),rdn(rdnn(X3),X4))
    | ~ rdn_positive_less(X2,X4) ),
    i_0_152 ).

cnf(c_0_166,plain,
    ( X1 != X2
    | ~ less(X2,X1) ),
    i_0_13 ).

cnf(c_0_167,plain,
    ( less(X1,n21)
    | ~ rdn_positive_less(X2,rdnn(n3))
    | ~ rdn_translate(X1,rdn_pos(rdn(rdnn(X3),X2))) ),
    inference(spm,[status(thm)],[c_0_164,c_0_165]) ).

cnf(c_0_168,plain,
    rdn_translate(n21,rdn_pos(rdn(rdnn(n1),rdnn(n2)))),
    i_0_21 ).

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

cnf(c_0_170,plain,
    ~ less(X1,X1),
    inference(er,[status(thm)],[c_0_166]) ).

cnf(c_0_171,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_167,c_0_168]),c_0_169])]),c_0_170]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : NUM303+1 : TPTP v8.1.0. Released v3.1.0.
% 0.04/0.14  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n013.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Thu Jul  7 01:40:46 EDT 2022
% 0.13/0.36  % CPUTime  : 
% 0.21/0.47  # ENIGMATIC: Selected SinE mode:
% 0.21/0.49  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.49  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.21/0.49  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.21/0.49  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.94/2.53  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.94/2.53  # No SInE strategy applied
% 7.94/2.53  # Trying AutoSched0 for 150 seconds
% 7.94/2.53  # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.94/2.53  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.94/2.53  #
% 7.94/2.53  # Preprocessing time       : 0.024 s
% 7.94/2.53  
% 7.94/2.53  # Proof found!
% 7.94/2.53  # SZS status Theorem
% 7.94/2.53  # SZS output start CNFRefutation
% See solution above
% 7.94/2.53  # Training examples: 0 positive, 0 negative
% 7.94/2.53  
% 7.94/2.53  # -------------------------------------------------
% 7.94/2.53  # User time                : 0.037 s
% 7.94/2.53  # System time              : 0.004 s
% 7.94/2.53  # Total time               : 0.041 s
% 7.94/2.53  # Maximum resident set size: 7128 pages
% 7.94/2.53  
%------------------------------------------------------------------------------