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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NUM323+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:16 EDT 2022

% Result   : Theorem 47.97s 7.42s
% Output   : CNFRefutation 47.97s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   25 (  16 unt;   0 def)
%            Number of atoms       :   48 (   0 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   45 (  22   ~;  17   |;   4   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-4 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-1 aty)
%            Number of variables   :   45 (   2 sgn  23   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(sum_entry_point_neg_neg,axiom,
    ! [X1,X2,X3,X10,X11,X12] :
      ( ( rdn_translate(X1,rdn_neg(X10))
        & rdn_translate(X2,rdn_neg(X11))
        & rdn_add_with_carry(rdnn(n0),X10,X11,X12)
        & rdn_translate(X3,rdn_neg(X12)) )
     => sum(X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',sum_entry_point_neg_neg) ).

fof(sum_what_nn5_nn7,conjecture,
    ? [X1] : sum(X1,nn5,nn7),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_what_nn5_nn7) ).

fof(rdnn7,axiom,
    rdn_translate(nn7,rdn_neg(rdnn(n7))),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdnn7) ).

fof(add_digit_digit_digit,axiom,
    ! [X21,X22,X23,X24,X25] :
      ( ( rdn_digit_add(rdnn(X22),rdnn(X23),rdnn(X25),rdnn(n0))
        & rdn_digit_add(rdnn(X25),rdnn(X21),rdnn(X24),rdnn(n0)) )
     => rdn_add_with_carry(rdnn(X21),rdnn(X22),rdnn(X23),rdnn(X24)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',add_digit_digit_digit) ).

fof(rdnn5,axiom,
    rdn_translate(nn5,rdn_neg(rdnn(n5))),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdnn5) ).

fof(rdn_digit_add_n7_n0_n7_n0,axiom,
    rdn_digit_add(rdnn(n7),rdnn(n0),rdnn(n7),rdnn(n0)),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',rdn_digit_add_n7_n0_n7_n0) ).

fof(rdnn2,axiom,
    rdn_translate(nn2,rdn_neg(rdnn(n2))),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdnn2) ).

fof(rdn_digit_add_n2_n5_n7_n0,axiom,
    rdn_digit_add(rdnn(n2),rdnn(n5),rdnn(n7),rdnn(n0)),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',rdn_digit_add_n2_n5_n7_n0) ).

fof(c_0_8,plain,
    ! [X74,X75,X76,X77,X78,X79] :
      ( ~ rdn_translate(X74,rdn_neg(X77))
      | ~ rdn_translate(X75,rdn_neg(X78))
      | ~ rdn_add_with_carry(rdnn(n0),X77,X78,X79)
      | ~ rdn_translate(X76,rdn_neg(X79))
      | sum(X74,X75,X76) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sum_entry_point_neg_neg])]) ).

fof(c_0_9,negated_conjecture,
    ~ ? [X1] : sum(X1,nn5,nn7),
    inference(assume_negation,[status(cth)],[sum_what_nn5_nn7]) ).

cnf(c_0_10,plain,
    ( sum(X1,X3,X6)
    | ~ rdn_translate(X1,rdn_neg(X2))
    | ~ rdn_translate(X3,rdn_neg(X4))
    | ~ rdn_add_with_carry(rdnn(n0),X2,X4,X5)
    | ~ rdn_translate(X6,rdn_neg(X5)) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,plain,
    rdn_translate(nn7,rdn_neg(rdnn(n7))),
    inference(split_conjunct,[status(thm)],[rdnn7]) ).

fof(c_0_12,negated_conjecture,
    ! [X154] : ~ sum(X154,nn5,nn7),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])]) ).

fof(c_0_13,plain,
    ! [X115,X116,X117,X118,X119] :
      ( ~ rdn_digit_add(rdnn(X116),rdnn(X117),rdnn(X119),rdnn(n0))
      | ~ rdn_digit_add(rdnn(X119),rdnn(X115),rdnn(X118),rdnn(n0))
      | rdn_add_with_carry(rdnn(X115),rdnn(X116),rdnn(X117),rdnn(X118)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[add_digit_digit_digit])]) ).

cnf(c_0_14,plain,
    ( sum(X1,X2,nn7)
    | ~ rdn_add_with_carry(rdnn(n0),X3,X4,rdnn(n7))
    | ~ rdn_translate(X2,rdn_neg(X4))
    | ~ rdn_translate(X1,rdn_neg(X3)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,plain,
    rdn_translate(nn5,rdn_neg(rdnn(n5))),
    inference(split_conjunct,[status(thm)],[rdnn5]) ).

cnf(c_0_16,negated_conjecture,
    ~ sum(X1,nn5,nn7),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_17,plain,
    ( rdn_add_with_carry(rdnn(X4),rdnn(X1),rdnn(X2),rdnn(X5))
    | ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(X3),rdnn(n0))
    | ~ rdn_digit_add(rdnn(X3),rdnn(X4),rdnn(X5),rdnn(n0)) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_18,plain,
    rdn_digit_add(rdnn(n7),rdnn(n0),rdnn(n7),rdnn(n0)),
    inference(split_conjunct,[status(thm)],[rdn_digit_add_n7_n0_n7_n0]) ).

cnf(c_0_19,plain,
    ( ~ rdn_add_with_carry(rdnn(n0),X1,rdnn(n5),rdnn(n7))
    | ~ rdn_translate(X2,rdn_neg(X1)) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).

cnf(c_0_20,plain,
    rdn_translate(nn2,rdn_neg(rdnn(n2))),
    inference(split_conjunct,[status(thm)],[rdnn2]) ).

cnf(c_0_21,plain,
    ( rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n7))
    | ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n7),rdnn(n0)) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,plain,
    rdn_digit_add(rdnn(n2),rdnn(n5),rdnn(n7),rdnn(n0)),
    inference(split_conjunct,[status(thm)],[rdn_digit_add_n2_n5_n7_n0]) ).

cnf(c_0_23,plain,
    ~ rdn_add_with_carry(rdnn(n0),rdnn(n2),rdnn(n5),rdnn(n7)),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_24,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : NUM323+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n017.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Fri Jul  8 00:48:02 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected SinE mode:
% 0.19/0.45  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.45  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.45  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 47.97/7.42  # ENIGMATIC: Solved by autoschedule:
% 47.97/7.42  # No SInE strategy applied
% 47.97/7.42  # Trying AutoSched0 for 150 seconds
% 47.97/7.42  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 47.97/7.42  # and selection function SelectNewComplexAHP.
% 47.97/7.42  #
% 47.97/7.42  # Preprocessing time       : 0.024 s
% 47.97/7.42  # Presaturation interreduction done
% 47.97/7.42  
% 47.97/7.42  # Proof found!
% 47.97/7.42  # SZS status Theorem
% 47.97/7.42  # SZS output start CNFRefutation
% See solution above
% 47.97/7.42  # Training examples: 0 positive, 0 negative
% 47.97/7.42  
% 47.97/7.42  # -------------------------------------------------
% 47.97/7.42  # User time                : 5.075 s
% 47.97/7.42  # System time              : 0.122 s
% 47.97/7.42  # Total time               : 5.197 s
% 47.97/7.42  # Maximum resident set size: 7124 pages
% 47.97/7.42  
%------------------------------------------------------------------------------