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

View Problem - Process Solution

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

% Computer : n013.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:29 EDT 2022

% Result   : Theorem 0.24s 1.44s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   17 (  10 unt;   0 def)
%            Number of atoms       :   33 (   3 equ)
%            Maximal formula atoms :    7 (   1 avg)
%            Number of connectives :   33 (  17   ~;  10   |;   4   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   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 (   5 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(n2_not_less_nn2,conjecture,
    ~ less(n2,nn2),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',n2_not_less_nn2) ).

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/benchmark/Axioms/NUM005+1.ax',less_entry_point_neg_pos) ).

fof(less_property,axiom,
    ! [X1,X2] :
      ( less(X1,X2)
    <=> ( ~ less(X2,X1)
        & X2 != X1 ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+1.ax',less_property) ).

fof(rdn2,axiom,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+0.ax',rdn2) ).

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

fof(c_0_5,negated_conjecture,
    ~ ~ less(n2,nn2),
    inference(assume_negation,[status(cth)],[n2_not_less_nn2]) ).

fof(c_0_6,plain,
    ! [X12,X13,X14,X15] :
      ( ~ rdn_translate(X12,rdn_neg(X14))
      | ~ rdn_translate(X13,rdn_pos(X15))
      | less(X12,X13) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_entry_point_neg_pos])])])]) ).

fof(c_0_7,plain,
    ! [X3,X4,X3,X4] :
      ( ( ~ less(X4,X3)
        | ~ less(X3,X4) )
      & ( X4 != X3
        | ~ less(X3,X4) )
      & ( less(X4,X3)
        | X4 = X3
        | less(X3,X4) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[less_property])])])])])]) ).

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

cnf(c_0_9,plain,
    ( less(X1,X2)
    | ~ rdn_translate(X2,rdn_pos(X3))
    | ~ rdn_translate(X1,rdn_neg(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.08/0.12  % Problem  : NUM298+1 : TPTP v8.1.0. Released v3.1.0.
% 0.08/0.13  % Command  : run_ET %s %d
% 0.12/0.34  % Computer : n013.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Fri Jul  8 01:37:59 EDT 2022
% 0.12/0.35  % CPUTime  : 
% 0.24/1.44  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.44  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.44  # Preprocessing time       : 0.022 s
% 0.24/1.44  
% 0.24/1.44  # Proof found!
% 0.24/1.44  # SZS status Theorem
% 0.24/1.44  # SZS output start CNFRefutation
% See solution above
% 0.24/1.44  # Proof object total steps             : 17
% 0.24/1.44  # Proof object clause steps            : 8
% 0.24/1.44  # Proof object formula steps           : 9
% 0.24/1.44  # Proof object conjectures             : 5
% 0.24/1.44  # Proof object clause conjectures      : 2
% 0.24/1.44  # Proof object formula conjectures     : 3
% 0.24/1.44  # Proof object initial clauses used    : 5
% 0.24/1.44  # Proof object initial formulas used   : 5
% 0.24/1.44  # Proof object generating inferences   : 3
% 0.24/1.44  # Proof object simplifying inferences  : 1
% 0.24/1.44  # Training examples: 0 positive, 0 negative
% 0.24/1.44  # Parsed axioms                        : 402
% 0.24/1.44  # Removed by relevancy pruning/SinE    : 301
% 0.24/1.44  # Initial clauses                      : 103
% 0.24/1.44  # Removed in clause preprocessing      : 0
% 0.24/1.44  # Initial clauses in saturation        : 103
% 0.24/1.44  # Processed clauses                    : 106
% 0.24/1.44  # ...of these trivial                  : 0
% 0.24/1.44  # ...subsumed                          : 0
% 0.24/1.44  # ...remaining for further processing  : 106
% 0.24/1.44  # Other redundant clauses eliminated   : 1
% 0.24/1.44  # Clauses deleted for lack of memory   : 0
% 0.24/1.44  # Backward-subsumed                    : 0
% 0.24/1.44  # Backward-rewritten                   : 0
% 0.24/1.44  # Generated clauses                    : 29
% 0.24/1.44  # ...of the previous two non-trivial   : 24
% 0.24/1.44  # Contextual simplify-reflections      : 0
% 0.24/1.44  # Paramodulations                      : 26
% 0.24/1.44  # Factorizations                       : 2
% 0.24/1.44  # Equation resolutions                 : 1
% 0.24/1.44  # Current number of processed clauses  : 105
% 0.24/1.44  #    Positive orientable unit clauses  : 95
% 0.24/1.44  #    Positive unorientable unit clauses: 0
% 0.24/1.44  #    Negative unit clauses             : 2
% 0.24/1.44  #    Non-unit-clauses                  : 8
% 0.24/1.44  # Current number of unprocessed clauses: 21
% 0.24/1.44  # ...number of literals in the above   : 49
% 0.24/1.44  # Current number of archived formulas  : 0
% 0.24/1.44  # Current number of archived clauses   : 0
% 0.24/1.44  # Clause-clause subsumption calls (NU) : 3
% 0.24/1.44  # Rec. Clause-clause subsumption calls : 1
% 0.24/1.44  # Non-unit clause-clause subsumptions  : 0
% 0.24/1.44  # Unit Clause-clause subsumption calls : 3
% 0.24/1.44  # Rewrite failures with RHS unbound    : 0
% 0.24/1.44  # BW rewrite match attempts            : 0
% 0.24/1.44  # BW rewrite match successes           : 0
% 0.24/1.44  # Condensation attempts                : 0
% 0.24/1.44  # Condensation successes               : 0
% 0.24/1.44  # Termbank termtop insertions          : 7708
% 0.24/1.44  
% 0.24/1.44  # -------------------------------------------------
% 0.24/1.44  # User time                : 0.020 s
% 0.24/1.44  # System time              : 0.006 s
% 0.24/1.44  # Total time               : 0.026 s
% 0.24/1.44  # Maximum resident set size: 4196 pages
%------------------------------------------------------------------------------