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

View Problem - Process Solution

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

% Computer : n026.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:17 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof(less_property,axiom,
    ! [X1,X2] :
      ( less(X1,X2)
    <=> ( ~ less(X2,X1)
        & X2 != X1 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.9y4S931sb5/E---3.1_17147.p',less_property) ).

fof(less_entry_point_neg_pos,axiom,
    ! [X1,X2,X10,X11] :
      ( ( rdn_translate(X1,rdn_neg(X10))
        & rdn_translate(X2,rdn_pos(X11)) )
     => less(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.9y4S931sb5/E---3.1_17147.p',less_entry_point_neg_pos) ).

fof(n2_not_less_nn2,conjecture,
    ~ less(n2,nn2),
    file('/export/starexec/sandbox2/tmp/tmp.9y4S931sb5/E---3.1_17147.p',n2_not_less_nn2) ).

fof(rdn2,axiom,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    file('/export/starexec/sandbox2/tmp/tmp.9y4S931sb5/E---3.1_17147.p',rdn2) ).

fof(rdnn2,axiom,
    rdn_translate(nn2,rdn_neg(rdnn(n2))),
    file('/export/starexec/sandbox2/tmp/tmp.9y4S931sb5/E---3.1_17147.p',rdnn2) ).

fof(c_0_5,plain,
    ! [X1,X2] :
      ( less(X1,X2)
    <=> ( ~ less(X2,X1)
        & X2 != X1 ) ),
    inference(fof_simplification,[status(thm)],[less_property]) ).

fof(c_0_6,plain,
    ! [X37,X38,X39,X40] :
      ( ~ rdn_translate(X37,rdn_neg(X39))
      | ~ rdn_translate(X38,rdn_pos(X40))
      | less(X37,X38) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_entry_point_neg_pos])]) ).

fof(c_0_7,plain,
    ! [X45,X46] :
      ( ( ~ less(X46,X45)
        | ~ less(X45,X46) )
      & ( X46 != X45
        | ~ less(X45,X46) )
      & ( less(X46,X45)
        | X46 = X45
        | less(X45,X46) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

fof(c_0_8,negated_conjecture,
    less(n2,nn2),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[n2_not_less_nn2])]) ).

cnf(c_0_9,plain,
    ( less(X1,X3)
    | ~ rdn_translate(X1,rdn_neg(X2))
    | ~ rdn_translate(X3,rdn_pos(X4)) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

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

cnf(c_0_11,plain,
    ( ~ less(X1,X2)
    | ~ less(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,negated_conjecture,
    less(n2,nn2),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    ( less(X1,n2)
    | ~ rdn_translate(X1,rdn_neg(X2)) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

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

cnf(c_0_15,negated_conjecture,
    ~ less(nn2,n2),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem    : NUM298+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.12  % Command    : run_E %s %d THM
% 0.11/0.32  % Computer : n026.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 2400
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Mon Oct  2 15:21:59 EDT 2023
% 0.11/0.32  % CPUTime    : 
% 0.17/0.45  Running first-order theorem proving
% 0.17/0.45  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.9y4S931sb5/E---3.1_17147.p
% 0.17/0.47  # Version: 3.1pre001
% 0.17/0.47  # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.17/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.17/0.47  # Starting new_bool_3 with 600s (2) cores
% 0.17/0.47  # Starting new_bool_1 with 600s (2) cores
% 0.17/0.47  # Starting sh5l with 300s (1) cores
% 0.17/0.47  # new_bool_1 with pid 17296 completed with status 0
% 0.17/0.47  # Result found by new_bool_1
% 0.17/0.47  # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.17/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.17/0.47  # Starting new_bool_3 with 600s (2) cores
% 0.17/0.47  # Starting new_bool_1 with 600s (2) cores
% 0.17/0.47  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47  # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.17/0.47  # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.17/0.47  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 325s (1) cores
% 0.17/0.47  # Starting new_bool_1 with 61s (1) cores
% 0.17/0.47  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 17300 completed with status 0
% 0.17/0.47  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.17/0.47  # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.17/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.17/0.47  # Starting new_bool_3 with 600s (2) cores
% 0.17/0.47  # Starting new_bool_1 with 600s (2) cores
% 0.17/0.47  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47  # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.17/0.47  # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.17/0.47  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 325s (1) cores
% 0.17/0.47  # Preprocessing time       : 0.002 s
% 0.17/0.47  # Presaturation interreduction done
% 0.17/0.47  
% 0.17/0.47  # Proof found!
% 0.17/0.47  # SZS status Theorem
% 0.17/0.47  # SZS output start CNFRefutation
% See solution above
% 0.17/0.47  # Parsed axioms                        : 402
% 0.17/0.47  # Removed by relevancy pruning/SinE    : 275
% 0.17/0.47  # Initial clauses                      : 129
% 0.17/0.47  # Removed in clause preprocessing      : 0
% 0.17/0.47  # Initial clauses in saturation        : 129
% 0.17/0.47  # Processed clauses                    : 161
% 0.17/0.47  # ...of these trivial                  : 0
% 0.17/0.47  # ...subsumed                          : 0
% 0.17/0.47  # ...remaining for further processing  : 161
% 0.17/0.47  # Other redundant clauses eliminated   : 1
% 0.17/0.47  # Clauses deleted for lack of memory   : 0
% 0.17/0.47  # Backward-subsumed                    : 0
% 0.17/0.47  # Backward-rewritten                   : 0
% 0.17/0.47  # Generated clauses                    : 19
% 0.17/0.47  # ...of the previous two non-redundant : 12
% 0.17/0.47  # ...aggressively subsumed             : 0
% 0.17/0.47  # Contextual simplify-reflections      : 0
% 0.17/0.47  # Paramodulations                      : 16
% 0.17/0.47  # Factorizations                       : 2
% 0.17/0.47  # NegExts                              : 0
% 0.17/0.47  # Equation resolutions                 : 1
% 0.17/0.47  # Total rewrite steps                  : 2
% 0.17/0.47  # Propositional unsat checks           : 0
% 0.17/0.47  #    Propositional check models        : 0
% 0.17/0.47  #    Propositional check unsatisfiable : 0
% 0.17/0.47  #    Propositional clauses             : 0
% 0.17/0.47  #    Propositional clauses after purity: 0
% 0.17/0.47  #    Propositional unsat core size     : 0
% 0.17/0.47  #    Propositional preprocessing time  : 0.000
% 0.17/0.47  #    Propositional encoding time       : 0.000
% 0.17/0.47  #    Propositional solver time         : 0.000
% 0.17/0.47  #    Success case prop preproc time    : 0.000
% 0.17/0.47  #    Success case prop encoding time   : 0.000
% 0.17/0.47  #    Success case prop solver time     : 0.000
% 0.17/0.47  # Current number of processed clauses  : 31
% 0.17/0.47  #    Positive orientable unit clauses  : 25
% 0.17/0.47  #    Positive unorientable unit clauses: 0
% 0.17/0.47  #    Negative unit clauses             : 2
% 0.17/0.47  #    Non-unit-clauses                  : 4
% 0.17/0.47  # Current number of unprocessed clauses: 109
% 0.17/0.47  # ...number of literals in the above   : 127
% 0.17/0.47  # Current number of archived formulas  : 0
% 0.17/0.47  # Current number of archived clauses   : 129
% 0.17/0.47  # Clause-clause subsumption calls (NU) : 28
% 0.17/0.47  # Rec. Clause-clause subsumption calls : 21
% 0.17/0.47  # Non-unit clause-clause subsumptions  : 0
% 0.17/0.47  # Unit Clause-clause subsumption calls : 2
% 0.17/0.47  # Rewrite failures with RHS unbound    : 0
% 0.17/0.47  # BW rewrite match attempts            : 0
% 0.17/0.47  # BW rewrite match successes           : 0
% 0.17/0.47  # Condensation attempts                : 0
% 0.17/0.47  # Condensation successes               : 0
% 0.17/0.47  # Termbank termtop insertions          : 8272
% 0.17/0.47  
% 0.17/0.47  # -------------------------------------------------
% 0.17/0.47  # User time                : 0.009 s
% 0.17/0.47  # System time              : 0.003 s
% 0.17/0.47  # Total time               : 0.012 s
% 0.17/0.47  # Maximum resident set size: 2700 pages
% 0.17/0.47  
% 0.17/0.47  # -------------------------------------------------
% 0.17/0.47  # User time                : 0.022 s
% 0.17/0.47  # System time              : 0.006 s
% 0.17/0.47  # Total time               : 0.028 s
% 0.17/0.47  # Maximum resident set size: 2032 pages
% 0.17/0.47  % E---3.1 exiting
% 0.17/0.47  % E---3.1 exiting
%------------------------------------------------------------------------------