TSTP Solution File: NUM340+1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : NUM340+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n022.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 18:46:23 EDT 2023

% Result   : Theorem 0.19s 0.52s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   28 (  14 unt;   0 def)
%            Number of atoms       :   62 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   64 (  30   ~;  26   |;   5   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-4 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :   60 (   0 sgn;  29   !;   2   ?)

% 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/sandbox2/tmp/tmp.uLb31ox4p0/E---3.1_20638.p',add_digit_digit_digit) ).

fof(sum_entry_point_pos_pos,axiom,
    ! [X1,X2,X3,X10,X11,X12] :
      ( ( rdn_translate(X1,rdn_pos(X10))
        & rdn_translate(X2,rdn_pos(X11))
        & rdn_add_with_carry(rdnn(n0),X10,X11,X12)
        & rdn_translate(X3,rdn_pos(X12)) )
     => sum(X1,X2,X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.uLb31ox4p0/E---3.1_20638.p',sum_entry_point_pos_pos) ).

fof(rdn_digit_add_n9_n0_n9_n0,axiom,
    rdn_digit_add(rdnn(n9),rdnn(n0),rdnn(n9),rdnn(n0)),
    file('/export/starexec/sandbox2/tmp/tmp.uLb31ox4p0/E---3.1_20638.p',rdn_digit_add_n9_n0_n9_n0) ).

fof(rdn_digit_add_n0_n9_n9_n0,axiom,
    rdn_digit_add(rdnn(n0),rdnn(n9),rdnn(n9),rdnn(n0)),
    file('/export/starexec/sandbox2/tmp/tmp.uLb31ox4p0/E---3.1_20638.p',rdn_digit_add_n0_n9_n9_n0) ).

fof(diff_zero_identity,conjecture,
    ? [X1] : difference(X1,n0,X1),
    file('/export/starexec/sandbox2/tmp/tmp.uLb31ox4p0/E---3.1_20638.p',diff_zero_identity) ).

fof(rdn9,axiom,
    rdn_translate(n9,rdn_pos(rdnn(n9))),
    file('/export/starexec/sandbox2/tmp/tmp.uLb31ox4p0/E---3.1_20638.p',rdn9) ).

fof(minus_entry_point,axiom,
    ! [X1,X2,X3] :
      ( sum(X2,X3,X1)
    <=> difference(X1,X2,X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.uLb31ox4p0/E---3.1_20638.p',minus_entry_point) ).

fof(rdn0,axiom,
    rdn_translate(n0,rdn_pos(rdnn(n0))),
    file('/export/starexec/sandbox2/tmp/tmp.uLb31ox4p0/E---3.1_20638.p',rdn0) ).

fof(c_0_8,plain,
    ! [X81,X82,X83,X84,X85] :
      ( ~ rdn_digit_add(rdnn(X82),rdnn(X83),rdnn(X85),rdnn(n0))
      | ~ rdn_digit_add(rdnn(X85),rdnn(X81),rdnn(X84),rdnn(n0))
      | rdn_add_with_carry(rdnn(X81),rdnn(X82),rdnn(X83),rdnn(X84)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[add_digit_digit_digit])]) ).

fof(c_0_9,plain,
    ! [X37,X38,X39,X40,X41,X42] :
      ( ~ rdn_translate(X37,rdn_pos(X40))
      | ~ rdn_translate(X38,rdn_pos(X41))
      | ~ rdn_add_with_carry(rdnn(n0),X40,X41,X42)
      | ~ rdn_translate(X39,rdn_pos(X42))
      | sum(X37,X38,X39) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sum_entry_point_pos_pos])]) ).

cnf(c_0_10,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_8]) ).

cnf(c_0_11,plain,
    rdn_digit_add(rdnn(n9),rdnn(n0),rdnn(n9),rdnn(n0)),
    inference(split_conjunct,[status(thm)],[rdn_digit_add_n9_n0_n9_n0]) ).

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

cnf(c_0_13,plain,
    ( rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n9))
    | ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n9),rdnn(n0)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,plain,
    ( sum(X1,X2,X3)
    | ~ rdn_digit_add(rdnn(X4),rdnn(X5),rdnn(n9),rdnn(n0))
    | ~ rdn_translate(X3,rdn_pos(rdnn(n9)))
    | ~ rdn_translate(X2,rdn_pos(rdnn(X5)))
    | ~ rdn_translate(X1,rdn_pos(rdnn(X4))) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

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

fof(c_0_16,negated_conjecture,
    ~ ? [X1] : difference(X1,n0,X1),
    inference(assume_negation,[status(cth)],[diff_zero_identity]) ).

cnf(c_0_17,plain,
    ( sum(X1,X2,X3)
    | ~ rdn_translate(X3,rdn_pos(rdnn(n9)))
    | ~ rdn_translate(X2,rdn_pos(rdnn(n9)))
    | ~ rdn_translate(X1,rdn_pos(rdnn(n0))) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,plain,
    rdn_translate(n9,rdn_pos(rdnn(n9))),
    inference(split_conjunct,[status(thm)],[rdn9]) ).

fof(c_0_19,negated_conjecture,
    ! [X33] : ~ difference(X33,n0,X33),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])]) ).

fof(c_0_20,plain,
    ! [X34,X35,X36] :
      ( ( ~ sum(X35,X36,X34)
        | difference(X34,X35,X36) )
      & ( ~ difference(X34,X35,X36)
        | sum(X35,X36,X34) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[minus_entry_point])]) ).

cnf(c_0_21,plain,
    ( sum(X1,X2,n9)
    | ~ rdn_translate(X2,rdn_pos(rdnn(n9)))
    | ~ rdn_translate(X1,rdn_pos(rdnn(n0))) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    ~ difference(X1,n0,X1),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_23,plain,
    ( difference(X3,X1,X2)
    | ~ sum(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_24,plain,
    ( sum(X1,n9,n9)
    | ~ rdn_translate(X1,rdn_pos(rdnn(n0))) ),
    inference(spm,[status(thm)],[c_0_21,c_0_18]) ).

cnf(c_0_25,plain,
    rdn_translate(n0,rdn_pos(rdnn(n0))),
    inference(split_conjunct,[status(thm)],[rdn0]) ).

cnf(c_0_26,negated_conjecture,
    ~ sum(n0,X1,X1),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_27,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.13  % Problem    : NUM340+1 : TPTP v8.1.2. Released v3.1.0.
% 0.02/0.14  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n022.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 2400
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon Oct  2 13:21:54 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 0.19/0.47  Running first-order theorem proving
% 0.19/0.47  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.uLb31ox4p0/E---3.1_20638.p
% 0.19/0.52  # Version: 3.1pre001
% 0.19/0.52  # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.19/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.19/0.52  # Starting new_bool_3 with 600s (2) cores
% 0.19/0.52  # Starting new_bool_1 with 600s (2) cores
% 0.19/0.52  # Starting sh5l with 300s (1) cores
% 0.19/0.52  # new_bool_3 with pid 20717 completed with status 0
% 0.19/0.52  # Result found by new_bool_3
% 0.19/0.52  # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.19/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.19/0.52  # Starting new_bool_3 with 600s (2) cores
% 0.19/0.52  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.52  # Search class: FHUSF-FFMM21-SFFFFFNN
% 0.19/0.52  # partial match(1): FHUNF-FFMM21-SFFFFFNN
% 0.19/0.52  # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.19/0.52  # Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.19/0.52  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 61s (1) cores
% 0.19/0.52  # SAT001_MinMin_p005000_rr_RG with pid 20720 completed with status 0
% 0.19/0.52  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.52  # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.19/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.19/0.52  # Starting new_bool_3 with 600s (2) cores
% 0.19/0.52  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.52  # Search class: FHUSF-FFMM21-SFFFFFNN
% 0.19/0.52  # partial match(1): FHUNF-FFMM21-SFFFFFNN
% 0.19/0.52  # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.19/0.52  # Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.19/0.52  # Preprocessing time       : 0.002 s
% 0.19/0.52  # Presaturation interreduction done
% 0.19/0.52  
% 0.19/0.52  # Proof found!
% 0.19/0.52  # SZS status Theorem
% 0.19/0.52  # SZS output start CNFRefutation
% See solution above
% 0.19/0.52  # Parsed axioms                        : 402
% 0.19/0.52  # Removed by relevancy pruning/SinE    : 265
% 0.19/0.52  # Initial clauses                      : 138
% 0.19/0.52  # Removed in clause preprocessing      : 0
% 0.19/0.52  # Initial clauses in saturation        : 138
% 0.19/0.52  # Processed clauses                    : 525
% 0.19/0.52  # ...of these trivial                  : 0
% 0.19/0.52  # ...subsumed                          : 120
% 0.19/0.52  # ...remaining for further processing  : 405
% 0.19/0.52  # Other redundant clauses eliminated   : 0
% 0.19/0.52  # Clauses deleted for lack of memory   : 0
% 0.19/0.52  # Backward-subsumed                    : 0
% 0.19/0.52  # Backward-rewritten                   : 0
% 0.19/0.52  # Generated clauses                    : 432
% 0.19/0.52  # ...of the previous two non-redundant : 430
% 0.19/0.52  # ...aggressively subsumed             : 0
% 0.19/0.52  # Contextual simplify-reflections      : 0
% 0.19/0.52  # Paramodulations                      : 432
% 0.19/0.52  # Factorizations                       : 0
% 0.19/0.52  # NegExts                              : 0
% 0.19/0.52  # Equation resolutions                 : 0
% 0.19/0.52  # Total rewrite steps                  : 0
% 0.19/0.52  # Propositional unsat checks           : 0
% 0.19/0.52  #    Propositional check models        : 0
% 0.19/0.52  #    Propositional check unsatisfiable : 0
% 0.19/0.52  #    Propositional clauses             : 0
% 0.19/0.52  #    Propositional clauses after purity: 0
% 0.19/0.52  #    Propositional unsat core size     : 0
% 0.19/0.52  #    Propositional preprocessing time  : 0.000
% 0.19/0.52  #    Propositional encoding time       : 0.000
% 0.19/0.52  #    Propositional solver time         : 0.000
% 0.19/0.52  #    Success case prop preproc time    : 0.000
% 0.19/0.52  #    Success case prop encoding time   : 0.000
% 0.19/0.52  #    Success case prop solver time     : 0.000
% 0.19/0.52  # Current number of processed clauses  : 267
% 0.19/0.52  #    Positive orientable unit clauses  : 120
% 0.19/0.52  #    Positive unorientable unit clauses: 0
% 0.19/0.52  #    Negative unit clauses             : 2
% 0.19/0.52  #    Non-unit-clauses                  : 145
% 0.19/0.52  # Current number of unprocessed clauses: 181
% 0.19/0.52  # ...number of literals in the above   : 956
% 0.19/0.52  # Current number of archived formulas  : 0
% 0.19/0.52  # Current number of archived clauses   : 138
% 0.19/0.52  # Clause-clause subsumption calls (NU) : 9495
% 0.19/0.52  # Rec. Clause-clause subsumption calls : 8498
% 0.19/0.52  # Non-unit clause-clause subsumptions  : 120
% 0.19/0.52  # Unit Clause-clause subsumption calls : 3
% 0.19/0.52  # Rewrite failures with RHS unbound    : 0
% 0.19/0.52  # BW rewrite match attempts            : 0
% 0.19/0.52  # BW rewrite match successes           : 0
% 0.19/0.52  # Condensation attempts                : 0
% 0.19/0.52  # Condensation successes               : 0
% 0.19/0.52  # Termbank termtop insertions          : 21100
% 0.19/0.52  
% 0.19/0.52  # -------------------------------------------------
% 0.19/0.52  # User time                : 0.022 s
% 0.19/0.52  # System time              : 0.010 s
% 0.19/0.52  # Total time               : 0.032 s
% 0.19/0.52  # Maximum resident set size: 2832 pages
% 0.19/0.52  
% 0.19/0.52  # -------------------------------------------------
% 0.19/0.52  # User time                : 0.048 s
% 0.19/0.52  # System time              : 0.018 s
% 0.19/0.52  # Total time               : 0.066 s
% 0.19/0.52  # Maximum resident set size: 2036 pages
% 0.19/0.52  % E---3.1 exiting
% 0.19/0.52  % E---3.1 exiting
%------------------------------------------------------------------------------