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

View Problem - Process Solution

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

% Computer : n010.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:06 EDT 2022

% Result   : Theorem 13.35s 2.98s
% Output   : CNFRefutation 13.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   27 (  13 unt;   0 def)
%            Number of atoms       :   48 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   40 (  19   ~;  15   |;   2   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :   47 (   9 sgn  25   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(less_entry_point_pos_pos,axiom,
    ! [X1,X2,X10,X11] :
      ( ( rdn_translate(X1,rdn_pos(X10))
        & rdn_translate(X2,rdn_pos(X11))
        & rdn_positive_less(X10,X11) )
     => less(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',less_entry_point_pos_pos) ).

fof(n12_less_something,conjecture,
    ? [X1] : less(n12,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',n12_less_something) ).

fof(rdn104,axiom,
    rdn_translate(n104,rdn_pos(rdn(rdnn(n4),rdn(rdnn(n0),rdnn(n1))))),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn104) ).

fof(rdn_positive_less_multi_digit_high,axiom,
    ! [X4,X5,X6,X7] :
      ( rdn_positive_less(X5,X7)
     => rdn_positive_less(rdn(rdnn(X4),X5),rdn(rdnn(X6),X7)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less_multi_digit_high) ).

fof(rdn_extra_digits_positive_less,axiom,
    ! [X9,X6,X7] :
      ( rdn_non_zero(X7)
     => rdn_positive_less(rdnn(X9),rdn(rdnn(X6),X7)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_extra_digits_positive_less) ).

fof(rdn_non_zero_by_digit,axiom,
    ! [X1] :
      ( rdn_non_zero_digit(rdnn(X1))
     => rdn_non_zero(rdnn(X1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_non_zero_by_digit) ).

fof(rdn12,axiom,
    rdn_translate(n12,rdn_pos(rdn(rdnn(n2),rdnn(n1)))),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn12) ).

fof(rdn_digit1,axiom,
    rdn_non_zero_digit(rdnn(n1)),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_digit1) ).

fof(c_0_8,plain,
    ! [X49,X50,X51,X52] :
      ( ~ rdn_translate(X49,rdn_pos(X51))
      | ~ rdn_translate(X50,rdn_pos(X52))
      | ~ rdn_positive_less(X51,X52)
      | less(X49,X50) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_entry_point_pos_pos])]) ).

fof(c_0_9,negated_conjecture,
    ~ ? [X1] : less(n12,X1),
    inference(assume_negation,[status(cth)],[n12_less_something]) ).

cnf(c_0_10,plain,
    ( less(X1,X3)
    | ~ rdn_translate(X1,rdn_pos(X2))
    | ~ rdn_translate(X3,rdn_pos(X4))
    | ~ rdn_positive_less(X2,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,plain,
    rdn_translate(n104,rdn_pos(rdn(rdnn(n4),rdn(rdnn(n0),rdnn(n1))))),
    inference(split_conjunct,[status(thm)],[rdn104]) ).

fof(c_0_12,negated_conjecture,
    ! [X154] : ~ less(n12,X154),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])]) ).

fof(c_0_13,plain,
    ! [X36,X37,X38,X39] :
      ( ~ rdn_positive_less(X37,X39)
      | rdn_positive_less(rdn(rdnn(X36),X37),rdn(rdnn(X38),X39)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdn_positive_less_multi_digit_high])]) ).

fof(c_0_14,plain,
    ! [X43,X44,X45] :
      ( ~ rdn_non_zero(X45)
      | rdn_positive_less(rdnn(X43),rdn(rdnn(X44),X45)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdn_extra_digits_positive_less])]) ).

fof(c_0_15,plain,
    ! [X46] :
      ( ~ rdn_non_zero_digit(rdnn(X46))
      | rdn_non_zero(rdnn(X46)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdn_non_zero_by_digit])]) ).

cnf(c_0_16,plain,
    ( less(X1,n104)
    | ~ rdn_positive_less(X2,rdn(rdnn(n4),rdn(rdnn(n0),rdnn(n1))))
    | ~ rdn_translate(X1,rdn_pos(X2)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_17,plain,
    rdn_translate(n12,rdn_pos(rdn(rdnn(n2),rdnn(n1)))),
    inference(split_conjunct,[status(thm)],[rdn12]) ).

cnf(c_0_18,negated_conjecture,
    ~ less(n12,X1),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_19,plain,
    ( rdn_positive_less(rdn(rdnn(X3),X1),rdn(rdnn(X4),X2))
    | ~ rdn_positive_less(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_20,plain,
    ( rdn_positive_less(rdnn(X2),rdn(rdnn(X3),X1))
    | ~ rdn_non_zero(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_21,plain,
    ( rdn_non_zero(rdnn(X1))
    | ~ rdn_non_zero_digit(rdnn(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_22,plain,
    rdn_non_zero_digit(rdnn(n1)),
    inference(split_conjunct,[status(thm)],[rdn_digit1]) ).

cnf(c_0_23,plain,
    ~ rdn_positive_less(rdn(rdnn(n2),rdnn(n1)),rdn(rdnn(n4),rdn(rdnn(n0),rdnn(n1)))),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).

cnf(c_0_24,plain,
    ( rdn_positive_less(rdn(rdnn(X1),rdnn(X2)),rdn(rdnn(X3),rdn(rdnn(X4),X5)))
    | ~ rdn_non_zero(X5) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_25,plain,
    rdn_non_zero(rdnn(n1)),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_26,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11  % Problem  : NUM294+1 : TPTP v8.1.0. Released v3.1.0.
% 0.05/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n010.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 : Thu Jul  7 23:57:33 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
% 13.35/2.98  # ENIGMATIC: Solved by autoschedule:
% 13.35/2.98  # No SInE strategy applied
% 13.35/2.98  # Trying AutoSched0 for 150 seconds
% 13.35/2.98  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 13.35/2.98  # and selection function SelectNewComplexAHP.
% 13.35/2.98  #
% 13.35/2.98  # Preprocessing time       : 0.034 s
% 13.35/2.98  # Presaturation interreduction done
% 13.35/2.98  
% 13.35/2.98  # Proof found!
% 13.35/2.98  # SZS status Theorem
% 13.35/2.98  # SZS output start CNFRefutation
% See solution above
% 13.35/2.98  # Training examples: 0 positive, 0 negative
% 13.35/2.98  
% 13.35/2.98  # -------------------------------------------------
% 13.35/2.98  # User time                : 0.676 s
% 13.35/2.98  # System time              : 0.037 s
% 13.35/2.98  # Total time               : 0.713 s
% 13.35/2.98  # Maximum resident set size: 7124 pages
% 13.35/2.98  
%------------------------------------------------------------------------------