TSTP Solution File: NUM317+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : NUM317+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n027.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 09:31:36 EDT 2022

% Result   : Theorem 0.24s 1.42s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   38 (  23 unt;   0 def)
%            Number of atoms       :   80 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   79 (  37   ~;  33   |;   6   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-4 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-1 aty)
%            Number of variables   :   56 (   0 sgn  28   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
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(sum_entry_point_pos_neg_2,axiom,
    ! [X1,X2,X3,X10,X11,X12] :
      ( ( rdn_translate(X1,rdn_pos(X10))
        & rdn_translate(X2,rdn_neg(X11))
        & rdn_positive_less(X11,X10)
        & rdn_add_with_carry(rdnn(n0),X11,X12,X10)
        & rdn_translate(X3,rdn_pos(X12)) )
     => sum(X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',sum_entry_point_pos_neg_2) ).

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

fof(sum_n5_nn2_n3,conjecture,
    sum(n5,nn2,n3),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sum_n5_nn2_n3) ).

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

fof(rdn_positive_less_transitivity,axiom,
    ! [X1,X2,X3] :
      ( ( rdn_positive_less(rdnn(X1),rdnn(X2))
        & rdn_positive_less(rdnn(X2),rdnn(X3)) )
     => rdn_positive_less(rdnn(X1),rdnn(X3)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less_transitivity) ).

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

fof(rdn_positive_less34,axiom,
    rdn_positive_less(rdnn(n3),rdnn(n4)),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less34) ).

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

fof(rdn3,axiom,
    rdn_translate(n3,rdn_pos(rdnn(n3))),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn3) ).

fof(rdn_positive_less45,axiom,
    rdn_positive_less(rdnn(n4),rdnn(n5)),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less45) ).

fof(rdn_positive_less23,axiom,
    rdn_positive_less(rdnn(n2),rdnn(n3)),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less23) ).

fof(c_0_12,plain,
    ! [X26,X27,X28,X29,X30] :
      ( ~ rdn_digit_add(rdnn(X27),rdnn(X28),rdnn(X30),rdnn(n0))
      | ~ rdn_digit_add(rdnn(X30),rdnn(X26),rdnn(X29),rdnn(n0))
      | rdn_add_with_carry(rdnn(X26),rdnn(X27),rdnn(X28),rdnn(X29)) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[add_digit_digit_digit])])])]) ).

fof(c_0_13,plain,
    ! [X13,X14,X15,X16,X17,X18] :
      ( ~ rdn_translate(X13,rdn_pos(X16))
      | ~ rdn_translate(X14,rdn_neg(X17))
      | ~ rdn_positive_less(X17,X16)
      | ~ rdn_add_with_carry(rdnn(n0),X17,X18,X16)
      | ~ rdn_translate(X15,rdn_pos(X18))
      | sum(X13,X14,X15) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sum_entry_point_pos_neg_2])])])]) ).

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

cnf(c_0_15,plain,
    rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
    inference(split_conjunct,[status(thm)],[rdn_digit_add_n5_n0_n5_n0]) ).

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

cnf(c_0_17,plain,
    ( rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n5))
    | ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n5),rdnn(n0)) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

fof(c_0_18,negated_conjecture,
    ~ sum(n5,nn2,n3),
    inference(assume_negation,[status(cth)],[sum_n5_nn2_n3]) ).

cnf(c_0_19,plain,
    ( sum(X1,X2,X3)
    | ~ rdn_digit_add(rdnn(X4),rdnn(X5),rdnn(n5),rdnn(n0))
    | ~ rdn_positive_less(rdnn(X4),rdnn(n5))
    | ~ rdn_translate(X1,rdn_pos(rdnn(n5)))
    | ~ rdn_translate(X3,rdn_pos(rdnn(X5)))
    | ~ rdn_translate(X2,rdn_neg(rdnn(X4))) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,plain,
    rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
    inference(split_conjunct,[status(thm)],[rdn_digit_add_n2_n3_n5_n0]) ).

fof(c_0_21,plain,
    ! [X4,X5,X6] :
      ( ~ rdn_positive_less(rdnn(X4),rdnn(X5))
      | ~ rdn_positive_less(rdnn(X5),rdnn(X6))
      | rdn_positive_less(rdnn(X4),rdnn(X6)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdn_positive_less_transitivity])]) ).

fof(c_0_22,negated_conjecture,
    ~ sum(n5,nn2,n3),
    inference(fof_simplification,[status(thm)],[c_0_18]) ).

cnf(c_0_23,plain,
    ( sum(X1,X2,X3)
    | ~ rdn_positive_less(rdnn(n2),rdnn(n5))
    | ~ rdn_translate(X1,rdn_pos(rdnn(n5)))
    | ~ rdn_translate(X3,rdn_pos(rdnn(n3)))
    | ~ rdn_translate(X2,rdn_neg(rdnn(n2))) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

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

cnf(c_0_25,plain,
    ( rdn_positive_less(rdnn(X1),rdnn(X2))
    | ~ rdn_positive_less(rdnn(X3),rdnn(X2))
    | ~ rdn_positive_less(rdnn(X1),rdnn(X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_26,plain,
    rdn_positive_less(rdnn(n3),rdnn(n4)),
    inference(split_conjunct,[status(thm)],[rdn_positive_less34]) ).

cnf(c_0_27,negated_conjecture,
    ~ sum(n5,nn2,n3),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_28,plain,
    ( sum(X1,nn2,X2)
    | ~ rdn_positive_less(rdnn(n2),rdnn(n5))
    | ~ rdn_translate(X1,rdn_pos(rdnn(n5)))
    | ~ rdn_translate(X2,rdn_pos(rdnn(n3))) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_29,plain,
    rdn_translate(n5,rdn_pos(rdnn(n5))),
    inference(split_conjunct,[status(thm)],[rdn5]) ).

cnf(c_0_30,plain,
    rdn_translate(n3,rdn_pos(rdnn(n3))),
    inference(split_conjunct,[status(thm)],[rdn3]) ).

cnf(c_0_31,plain,
    rdn_positive_less(rdnn(n4),rdnn(n5)),
    inference(split_conjunct,[status(thm)],[rdn_positive_less45]) ).

cnf(c_0_32,plain,
    ( rdn_positive_less(rdnn(X1),rdnn(n4))
    | ~ rdn_positive_less(rdnn(X1),rdnn(n3)) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_33,plain,
    rdn_positive_less(rdnn(n2),rdnn(n3)),
    inference(split_conjunct,[status(thm)],[rdn_positive_less23]) ).

cnf(c_0_34,negated_conjecture,
    ~ rdn_positive_less(rdnn(n2),rdnn(n5)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]) ).

cnf(c_0_35,plain,
    ( rdn_positive_less(rdnn(X1),rdnn(n5))
    | ~ rdn_positive_less(rdnn(X1),rdnn(n4)) ),
    inference(spm,[status(thm)],[c_0_25,c_0_31]) ).

cnf(c_0_36,plain,
    rdn_positive_less(rdnn(n2),rdnn(n4)),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_37,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM317+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n027.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 Jul  6 13:04:58 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.24/1.42  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42  # Preprocessing time       : 0.022 s
% 0.24/1.42  
% 0.24/1.42  # Proof found!
% 0.24/1.42  # SZS status Theorem
% 0.24/1.42  # SZS output start CNFRefutation
% See solution above
% 0.24/1.42  # Proof object total steps             : 38
% 0.24/1.42  # Proof object clause steps            : 21
% 0.24/1.42  # Proof object formula steps           : 17
% 0.24/1.42  # Proof object conjectures             : 6
% 0.24/1.42  # Proof object clause conjectures      : 3
% 0.24/1.42  # Proof object formula conjectures     : 3
% 0.24/1.42  # Proof object initial clauses used    : 12
% 0.24/1.42  # Proof object initial formulas used   : 12
% 0.24/1.42  # Proof object generating inferences   : 9
% 0.24/1.42  # Proof object simplifying inferences  : 5
% 0.24/1.42  # Training examples: 0 positive, 0 negative
% 0.24/1.42  # Parsed axioms                        : 402
% 0.24/1.42  # Removed by relevancy pruning/SinE    : 301
% 0.24/1.42  # Initial clauses                      : 101
% 0.24/1.42  # Removed in clause preprocessing      : 0
% 0.24/1.42  # Initial clauses in saturation        : 101
% 0.24/1.42  # Processed clauses                    : 1064
% 0.24/1.42  # ...of these trivial                  : 2
% 0.24/1.42  # ...subsumed                          : 325
% 0.24/1.42  # ...remaining for further processing  : 737
% 0.24/1.42  # Other redundant clauses eliminated   : 0
% 0.24/1.42  # Clauses deleted for lack of memory   : 0
% 0.24/1.42  # Backward-subsumed                    : 38
% 0.24/1.42  # Backward-rewritten                   : 0
% 0.24/1.42  # Generated clauses                    : 2433
% 0.24/1.42  # ...of the previous two non-trivial   : 2391
% 0.24/1.42  # Contextual simplify-reflections      : 180
% 0.24/1.42  # Paramodulations                      : 2433
% 0.24/1.42  # Factorizations                       : 0
% 0.24/1.42  # Equation resolutions                 : 0
% 0.24/1.42  # Current number of processed clauses  : 699
% 0.24/1.42  #    Positive orientable unit clauses  : 116
% 0.24/1.42  #    Positive unorientable unit clauses: 0
% 0.24/1.42  #    Negative unit clauses             : 2
% 0.24/1.42  #    Non-unit-clauses                  : 581
% 0.24/1.42  # Current number of unprocessed clauses: 1140
% 0.24/1.42  # ...number of literals in the above   : 5744
% 0.24/1.42  # Current number of archived formulas  : 0
% 0.24/1.42  # Current number of archived clauses   : 38
% 0.24/1.42  # Clause-clause subsumption calls (NU) : 46193
% 0.24/1.42  # Rec. Clause-clause subsumption calls : 21587
% 0.24/1.42  # Non-unit clause-clause subsumptions  : 543
% 0.24/1.42  # Unit Clause-clause subsumption calls : 212
% 0.24/1.42  # Rewrite failures with RHS unbound    : 0
% 0.24/1.42  # BW rewrite match attempts            : 1
% 0.24/1.42  # BW rewrite match successes           : 0
% 0.24/1.42  # Condensation attempts                : 0
% 0.24/1.42  # Condensation successes               : 0
% 0.24/1.42  # Termbank termtop insertions          : 54278
% 0.24/1.42  
% 0.24/1.42  # -------------------------------------------------
% 0.24/1.42  # User time                : 0.125 s
% 0.24/1.42  # System time              : 0.006 s
% 0.24/1.42  # Total time               : 0.131 s
% 0.24/1.42  # Maximum resident set size: 6100 pages
% 0.24/23.42  eprover: CPU time limit exceeded, terminating
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44  eprover: CPU time limit exceeded, terminating
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48  eprover: No such file or directory
% 0.24/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48  eprover: No such file or directory
% 0.24/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48  eprover: No such file or directory
% 0.24/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48  eprover: No such file or directory
% 0.24/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49  eprover: No such file or directory
% 0.24/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.49  eprover: No such file or directory
% 0.24/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49  eprover: No such file or directory
% 0.24/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.49  eprover: No such file or directory
% 0.24/23.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.50  eprover: No such file or directory
% 0.24/23.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.50  eprover: No such file or directory
% 0.24/23.51  eprover: CPU time limit exceeded, terminating
% 0.24/23.53  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.53  eprover: No such file or directory
% 0.24/23.53  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.53  eprover: No such file or directory
% 0.24/23.54  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.54  eprover: No such file or directory
% 0.24/23.54  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.54  eprover: No such file or directory
% 0.24/23.55  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.55  eprover: No such file or directory
% 0.24/23.55  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.55  eprover: No such file or directory
% 0.24/23.56  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.56  eprover: No such file or directory
% 0.24/23.56  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.56  eprover: No such file or directory
%------------------------------------------------------------------------------