TSTP Solution File: NUM342+1 by E-SAT---3.1

View Problem - Process Solution

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

% 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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 18:58:48 EDT 2023

% Result   : Theorem 1.20s 0.62s
% Output   : CNFRefutation 1.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   39 (  18 unt;   0 def)
%            Number of atoms       :   80 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   75 (  34   ~;  31   |;   7   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-4 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-1 aty)
%            Number of variables   :   66 (   0 sgn;  30   !;   4   ?)

% 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.CADJqHndxd/E---3.1_4621.p',add_digit_digit_digit) ).

fof(rdn_digit_add_n4_n0_n4_n0,axiom,
    rdn_digit_add(rdnn(n4),rdnn(n0),rdnn(n4),rdnn(n0)),
    file('/export/starexec/sandbox2/tmp/tmp.CADJqHndxd/E---3.1_4621.p',rdn_digit_add_n4_n0_n4_n0) ).

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.CADJqHndxd/E---3.1_4621.p',sum_entry_point_pos_pos) ).

fof(rdn_digit_add_n8_n0_n8_n0,axiom,
    rdn_digit_add(rdnn(n8),rdnn(n0),rdnn(n8),rdnn(n0)),
    file('/export/starexec/sandbox2/tmp/tmp.CADJqHndxd/E---3.1_4621.p',rdn_digit_add_n8_n0_n8_n0) ).

fof(rdn_digit_add_n4_n4_n8_n0,axiom,
    rdn_digit_add(rdnn(n4),rdnn(n4),rdnn(n8),rdnn(n0)),
    file('/export/starexec/sandbox2/tmp/tmp.CADJqHndxd/E---3.1_4621.p',rdn_digit_add_n4_n4_n8_n0) ).

fof(rdn4,axiom,
    rdn_translate(n4,rdn_pos(rdnn(n4))),
    file('/export/starexec/sandbox2/tmp/tmp.CADJqHndxd/E---3.1_4621.p',rdn4) ).

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

fof(rdn8,axiom,
    rdn_translate(n8,rdn_pos(rdnn(n8))),
    file('/export/starexec/sandbox2/tmp/tmp.CADJqHndxd/E---3.1_4621.p',rdn8) ).

fof(sum_and_difference,conjecture,
    ? [X1,X2] :
      ( sum(X1,X2,n8)
      & difference(X1,X2,n0) ),
    file('/export/starexec/sandbox2/tmp/tmp.CADJqHndxd/E---3.1_4621.p',sum_and_difference) ).

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

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

cnf(c_0_11,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_10]) ).

cnf(c_0_12,plain,
    rdn_digit_add(rdnn(n4),rdnn(n0),rdnn(n4),rdnn(n0)),
    inference(split_conjunct,[status(thm)],[rdn_digit_add_n4_n0_n4_n0]) ).

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

cnf(c_0_14,plain,
    ( rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n4))
    | ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n4),rdnn(n0)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

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

cnf(c_0_16,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_13]) ).

cnf(c_0_17,plain,
    rdn_add_with_carry(rdnn(n0),rdnn(n4),rdnn(n0),rdnn(n4)),
    inference(spm,[status(thm)],[c_0_14,c_0_12]) ).

cnf(c_0_18,plain,
    ( rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n8))
    | ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n8),rdnn(n0)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_15]) ).

cnf(c_0_19,plain,
    rdn_digit_add(rdnn(n4),rdnn(n4),rdnn(n8),rdnn(n0)),
    inference(split_conjunct,[status(thm)],[rdn_digit_add_n4_n4_n8_n0]) ).

cnf(c_0_20,plain,
    ( sum(X1,X2,X3)
    | ~ rdn_translate(X3,rdn_pos(rdnn(n4)))
    | ~ rdn_translate(X2,rdn_pos(rdnn(n0)))
    | ~ rdn_translate(X1,rdn_pos(rdnn(n4))) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_21,plain,
    rdn_translate(n4,rdn_pos(rdnn(n4))),
    inference(split_conjunct,[status(thm)],[rdn4]) ).

cnf(c_0_22,plain,
    rdn_add_with_carry(rdnn(n0),rdnn(n4),rdnn(n4),rdnn(n8)),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_23,plain,
    ( sum(X1,X2,n4)
    | ~ rdn_translate(X2,rdn_pos(rdnn(n0)))
    | ~ rdn_translate(X1,rdn_pos(rdnn(n4))) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

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

cnf(c_0_25,plain,
    ( sum(X1,X2,X3)
    | ~ rdn_translate(X3,rdn_pos(rdnn(n8)))
    | ~ rdn_translate(X2,rdn_pos(rdnn(n4)))
    | ~ rdn_translate(X1,rdn_pos(rdnn(n4))) ),
    inference(spm,[status(thm)],[c_0_16,c_0_22]) ).

cnf(c_0_26,plain,
    rdn_translate(n8,rdn_pos(rdnn(n8))),
    inference(split_conjunct,[status(thm)],[rdn8]) ).

fof(c_0_27,negated_conjecture,
    ~ ? [X1,X2] :
        ( sum(X1,X2,n8)
        & difference(X1,X2,n0) ),
    inference(assume_negation,[status(cth)],[sum_and_difference]) ).

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

cnf(c_0_29,plain,
    ( sum(X1,n0,n4)
    | ~ rdn_translate(X1,rdn_pos(rdnn(n4))) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_30,plain,
    ( sum(X1,X2,n8)
    | ~ rdn_translate(X2,rdn_pos(rdnn(n4)))
    | ~ rdn_translate(X1,rdn_pos(rdnn(n4))) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

fof(c_0_31,negated_conjecture,
    ! [X33,X34] :
      ( ~ sum(X33,X34,n8)
      | ~ difference(X33,X34,n0) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])]) ).

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

cnf(c_0_33,plain,
    sum(n4,n0,n4),
    inference(spm,[status(thm)],[c_0_29,c_0_21]) ).

cnf(c_0_34,plain,
    ( sum(X1,n4,n8)
    | ~ rdn_translate(X1,rdn_pos(rdnn(n4))) ),
    inference(spm,[status(thm)],[c_0_30,c_0_21]) ).

cnf(c_0_35,negated_conjecture,
    ( ~ sum(X1,X2,n8)
    | ~ difference(X1,X2,n0) ),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_36,plain,
    difference(n4,n4,n0),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_37,plain,
    sum(n4,n4,n8),
    inference(spm,[status(thm)],[c_0_34,c_0_21]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : NUM342+1 : TPTP v8.1.2. Released v3.1.0.
% 0.08/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n010.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 2400
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon Oct  2 14:25:20 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 0.20/0.49  Running first-order model finding
% 0.20/0.49  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.CADJqHndxd/E---3.1_4621.p
% 1.20/0.62  # Version: 3.1pre001
% 1.20/0.62  # Preprocessing class: FSLMSMSLSSSNFFN.
% 1.20/0.62  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.62  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 1.20/0.62  # Starting new_bool_3 with 600s (2) cores
% 1.20/0.62  # Starting new_bool_1 with 600s (2) cores
% 1.20/0.62  # Starting sh5l with 300s (1) cores
% 1.20/0.62  # new_bool_3 with pid 4785 completed with status 0
% 1.20/0.62  # Result found by new_bool_3
% 1.20/0.62  # Preprocessing class: FSLMSMSLSSSNFFN.
% 1.20/0.62  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.62  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 1.20/0.62  # Starting new_bool_3 with 600s (2) cores
% 1.20/0.62  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.20/0.62  # Search class: FHHSF-FFMM21-SFFFFFNN
% 1.20/0.62  # partial match(1): FGHSF-FFMM21-SFFFFFNN
% 1.20/0.62  # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 1.20/0.62  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 325s (1) cores
% 1.20/0.62  # Starting new_bool_3 with 61s (1) cores
% 1.20/0.62  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 4789 completed with status 0
% 1.20/0.62  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 1.20/0.62  # Preprocessing class: FSLMSMSLSSSNFFN.
% 1.20/0.62  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.62  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 1.20/0.62  # Starting new_bool_3 with 600s (2) cores
% 1.20/0.62  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.20/0.62  # Search class: FHHSF-FFMM21-SFFFFFNN
% 1.20/0.62  # partial match(1): FGHSF-FFMM21-SFFFFFNN
% 1.20/0.62  # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 1.20/0.62  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 325s (1) cores
% 1.20/0.62  # Preprocessing time       : 0.003 s
% 1.20/0.62  # Presaturation interreduction done
% 1.20/0.62  
% 1.20/0.62  # Proof found!
% 1.20/0.62  # SZS status Theorem
% 1.20/0.62  # SZS output start CNFRefutation
% See solution above
% 1.20/0.62  # Parsed axioms                        : 402
% 1.20/0.62  # Removed by relevancy pruning/SinE    : 261
% 1.20/0.62  # Initial clauses                      : 142
% 1.20/0.62  # Removed in clause preprocessing      : 0
% 1.20/0.62  # Initial clauses in saturation        : 142
% 1.20/0.62  # Processed clauses                    : 1123
% 1.20/0.62  # ...of these trivial                  : 0
% 1.20/0.62  # ...subsumed                          : 0
% 1.20/0.62  # ...remaining for further processing  : 1123
% 1.20/0.62  # Other redundant clauses eliminated   : 0
% 1.20/0.62  # Clauses deleted for lack of memory   : 0
% 1.20/0.62  # Backward-subsumed                    : 17
% 1.20/0.62  # Backward-rewritten                   : 17
% 1.20/0.62  # Generated clauses                    : 1508
% 1.20/0.62  # ...of the previous two non-redundant : 1365
% 1.20/0.62  # ...aggressively subsumed             : 0
% 1.20/0.62  # Contextual simplify-reflections      : 0
% 1.20/0.62  # Paramodulations                      : 1508
% 1.20/0.62  # Factorizations                       : 0
% 1.20/0.62  # NegExts                              : 0
% 1.20/0.62  # Equation resolutions                 : 0
% 1.20/0.62  # Total rewrite steps                  : 247
% 1.20/0.62  # Propositional unsat checks           : 0
% 1.20/0.62  #    Propositional check models        : 0
% 1.20/0.62  #    Propositional check unsatisfiable : 0
% 1.20/0.62  #    Propositional clauses             : 0
% 1.20/0.62  #    Propositional clauses after purity: 0
% 1.20/0.62  #    Propositional unsat core size     : 0
% 1.20/0.62  #    Propositional preprocessing time  : 0.000
% 1.20/0.62  #    Propositional encoding time       : 0.000
% 1.20/0.62  #    Propositional solver time         : 0.000
% 1.20/0.62  #    Success case prop preproc time    : 0.000
% 1.20/0.62  #    Success case prop encoding time   : 0.000
% 1.20/0.62  #    Success case prop solver time     : 0.000
% 1.20/0.62  # Current number of processed clauses  : 947
% 1.20/0.62  #    Positive orientable unit clauses  : 424
% 1.20/0.62  #    Positive unorientable unit clauses: 0
% 1.20/0.62  #    Negative unit clauses             : 6
% 1.20/0.62  #    Non-unit-clauses                  : 517
% 1.20/0.62  # Current number of unprocessed clauses: 526
% 1.20/0.62  # ...number of literals in the above   : 2082
% 1.20/0.62  # Current number of archived formulas  : 0
% 1.20/0.62  # Current number of archived clauses   : 176
% 1.20/0.62  # Clause-clause subsumption calls (NU) : 63600
% 1.20/0.62  # Rec. Clause-clause subsumption calls : 41733
% 1.20/0.62  # Non-unit clause-clause subsumptions  : 17
% 1.20/0.62  # Unit Clause-clause subsumption calls : 1781
% 1.20/0.62  # Rewrite failures with RHS unbound    : 0
% 1.20/0.62  # BW rewrite match attempts            : 1252
% 1.20/0.62  # BW rewrite match successes           : 17
% 1.20/0.62  # Condensation attempts                : 0
% 1.20/0.62  # Condensation successes               : 0
% 1.20/0.62  # Termbank termtop insertions          : 47725
% 1.20/0.62  
% 1.20/0.62  # -------------------------------------------------
% 1.20/0.62  # User time                : 0.096 s
% 1.20/0.62  # System time              : 0.013 s
% 1.20/0.62  # Total time               : 0.109 s
% 1.20/0.62  # Maximum resident set size: 2988 pages
% 1.20/0.62  
% 1.20/0.62  # -------------------------------------------------
% 1.20/0.62  # User time                : 0.205 s
% 1.20/0.62  # System time              : 0.016 s
% 1.20/0.62  # Total time               : 0.221 s
% 1.20/0.62  # Maximum resident set size: 2036 pages
% 1.20/0.62  % E---3.1 exiting
%------------------------------------------------------------------------------