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

View Problem - Process Solution

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

% Computer : n004.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:16 EDT 2023

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

% 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/tmp/tmp.q2g00jmDPs/E---3.1_858.p',less_entry_point_pos_pos) ).

fof(rdn13,axiom,
    rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1)))),
    file('/export/starexec/sandbox/tmp/tmp.q2g00jmDPs/E---3.1_858.p',rdn13) ).

fof(n2_less_n13,conjecture,
    less(n2,n13),
    file('/export/starexec/sandbox/tmp/tmp.q2g00jmDPs/E---3.1_858.p',n2_less_n13) ).

fof(rdn_non_zero_by_digit,axiom,
    ! [X1] :
      ( rdn_non_zero_digit(rdnn(X1))
     => rdn_non_zero(rdnn(X1)) ),
    file('/export/starexec/sandbox/tmp/tmp.q2g00jmDPs/E---3.1_858.p',rdn_non_zero_by_digit) ).

fof(rdn2,axiom,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    file('/export/starexec/sandbox/tmp/tmp.q2g00jmDPs/E---3.1_858.p',rdn2) ).

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/tmp/tmp.q2g00jmDPs/E---3.1_858.p',rdn_extra_digits_positive_less) ).

fof(rdn_digit1,axiom,
    rdn_non_zero_digit(rdnn(n1)),
    file('/export/starexec/sandbox/tmp/tmp.q2g00jmDPs/E---3.1_858.p',rdn_digit1) ).

fof(c_0_7,plain,
    ! [X33,X34,X35,X36] :
      ( ~ rdn_translate(X33,rdn_pos(X35))
      | ~ rdn_translate(X34,rdn_pos(X36))
      | ~ rdn_positive_less(X35,X36)
      | less(X33,X34) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_entry_point_pos_pos])]) ).

cnf(c_0_8,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_7]) ).

cnf(c_0_9,plain,
    rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1)))),
    inference(split_conjunct,[status(thm)],[rdn13]) ).

fof(c_0_10,negated_conjecture,
    ~ less(n2,n13),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[n2_less_n13])]) ).

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

cnf(c_0_12,plain,
    ( less(X1,n13)
    | ~ rdn_positive_less(X2,rdn(rdnn(n3),rdnn(n1)))
    | ~ rdn_translate(X1,rdn_pos(X2)) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,plain,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    inference(split_conjunct,[status(thm)],[rdn2]) ).

cnf(c_0_14,negated_conjecture,
    ~ less(n2,n13),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_15,plain,
    ! [X62,X63,X64] :
      ( ~ rdn_non_zero(X64)
      | rdn_positive_less(rdnn(X62),rdn(rdnn(X63),X64)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdn_extra_digits_positive_less])]) ).

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

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

cnf(c_0_18,plain,
    ~ rdn_positive_less(rdnn(n2),rdn(rdnn(n3),rdnn(n1))),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).

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

cnf(c_0_20,plain,
    rdn_non_zero(rdnn(n1)),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_21,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13  % Problem    : NUM292+1 : TPTP v8.1.2. Released v3.1.0.
% 0.10/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n004.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:09:45 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 0.19/0.45  Running first-order theorem proving
% 0.19/0.45  Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.q2g00jmDPs/E---3.1_858.p
% 0.19/0.50  # Version: 3.1pre001
% 0.19/0.50  # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.19/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.19/0.50  # Starting new_bool_3 with 600s (2) cores
% 0.19/0.50  # Starting new_bool_1 with 600s (2) cores
% 0.19/0.50  # Starting sh5l with 300s (1) cores
% 0.19/0.50  # sh5l with pid 974 completed with status 0
% 0.19/0.50  # Result found by sh5l
% 0.19/0.50  # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.19/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.19/0.50  # Starting new_bool_3 with 600s (2) cores
% 0.19/0.50  # Starting new_bool_1 with 600s (2) cores
% 0.19/0.50  # Starting sh5l with 300s (1) cores
% 0.19/0.50  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.50  # Search class: FGHSF-FFLM21-MFFFFFNN
% 0.19/0.50  # partial match(1): FGHSF-FSLM21-MFFFFFNN
% 0.19/0.50  # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50  # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.19/0.50  # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 985 completed with status 0
% 0.19/0.50  # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 0.19/0.50  # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.19/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.19/0.50  # Starting new_bool_3 with 600s (2) cores
% 0.19/0.50  # Starting new_bool_1 with 600s (2) cores
% 0.19/0.50  # Starting sh5l with 300s (1) cores
% 0.19/0.50  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.50  # Search class: FGHSF-FFLM21-MFFFFFNN
% 0.19/0.50  # partial match(1): FGHSF-FSLM21-MFFFFFNN
% 0.19/0.50  # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50  # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.19/0.50  # Preprocessing time       : 0.003 s
% 0.19/0.50  # Presaturation interreduction done
% 0.19/0.50  
% 0.19/0.50  # Proof found!
% 0.19/0.50  # SZS status Theorem
% 0.19/0.50  # SZS output start CNFRefutation
% See solution above
% 0.19/0.50  # Parsed axioms                        : 402
% 0.19/0.50  # Removed by relevancy pruning/SinE    : 246
% 0.19/0.50  # Initial clauses                      : 160
% 0.19/0.50  # Removed in clause preprocessing      : 0
% 0.19/0.50  # Initial clauses in saturation        : 160
% 0.19/0.50  # Processed clauses                    : 440
% 0.19/0.50  # ...of these trivial                  : 0
% 0.19/0.50  # ...subsumed                          : 2
% 0.19/0.50  # ...remaining for further processing  : 438
% 0.19/0.50  # Other redundant clauses eliminated   : 2
% 0.19/0.50  # Clauses deleted for lack of memory   : 0
% 0.19/0.50  # Backward-subsumed                    : 0
% 0.19/0.50  # Backward-rewritten                   : 1
% 0.19/0.50  # Generated clauses                    : 597
% 0.19/0.50  # ...of the previous two non-redundant : 569
% 0.19/0.50  # ...aggressively subsumed             : 0
% 0.19/0.50  # Contextual simplify-reflections      : 0
% 0.19/0.50  # Paramodulations                      : 593
% 0.19/0.50  # Factorizations                       : 2
% 0.19/0.50  # NegExts                              : 0
% 0.19/0.50  # Equation resolutions                 : 2
% 0.19/0.50  # Total rewrite steps                  : 33
% 0.19/0.50  # Propositional unsat checks           : 0
% 0.19/0.50  #    Propositional check models        : 0
% 0.19/0.50  #    Propositional check unsatisfiable : 0
% 0.19/0.50  #    Propositional clauses             : 0
% 0.19/0.50  #    Propositional clauses after purity: 0
% 0.19/0.50  #    Propositional unsat core size     : 0
% 0.19/0.50  #    Propositional preprocessing time  : 0.000
% 0.19/0.50  #    Propositional encoding time       : 0.000
% 0.19/0.50  #    Propositional solver time         : 0.000
% 0.19/0.50  #    Success case prop preproc time    : 0.000
% 0.19/0.50  #    Success case prop encoding time   : 0.000
% 0.19/0.50  #    Success case prop solver time     : 0.000
% 0.19/0.50  # Current number of processed clauses  : 275
% 0.19/0.50  #    Positive orientable unit clauses  : 158
% 0.19/0.50  #    Positive unorientable unit clauses: 0
% 0.19/0.50  #    Negative unit clauses             : 23
% 0.19/0.50  #    Non-unit-clauses                  : 94
% 0.19/0.50  # Current number of unprocessed clauses: 449
% 0.19/0.50  # ...number of literals in the above   : 1954
% 0.19/0.50  # Current number of archived formulas  : 0
% 0.19/0.50  # Current number of archived clauses   : 161
% 0.19/0.50  # Clause-clause subsumption calls (NU) : 1805
% 0.19/0.50  # Rec. Clause-clause subsumption calls : 1129
% 0.19/0.50  # Non-unit clause-clause subsumptions  : 2
% 0.19/0.50  # Unit Clause-clause subsumption calls : 875
% 0.19/0.50  # Rewrite failures with RHS unbound    : 0
% 0.19/0.50  # BW rewrite match attempts            : 1
% 0.19/0.50  # BW rewrite match successes           : 1
% 0.19/0.50  # Condensation attempts                : 0
% 0.19/0.50  # Condensation successes               : 0
% 0.19/0.50  # Termbank termtop insertions          : 25486
% 0.19/0.50  
% 0.19/0.50  # -------------------------------------------------
% 0.19/0.50  # User time                : 0.030 s
% 0.19/0.50  # System time              : 0.006 s
% 0.19/0.50  # Total time               : 0.037 s
% 0.19/0.50  # Maximum resident set size: 2772 pages
% 0.19/0.50  
% 0.19/0.50  # -------------------------------------------------
% 0.19/0.50  # User time                : 0.032 s
% 0.19/0.50  # System time              : 0.009 s
% 0.19/0.50  # Total time               : 0.041 s
% 0.19/0.50  # Maximum resident set size: 2036 pages
% 0.19/0.50  % E---3.1 exiting
% 0.19/0.50  % E---3.1 exiting
%------------------------------------------------------------------------------