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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : NUM343+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:44 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(sum_something_n0_samething,conjecture,
    ? [X1] :
      ( ( less(nn1,X1)
        & less(X1,n1) )
     => sum(n21,X1,n21) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sum_something_n0_samething) ).

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(c_0_2,negated_conjecture,
    ~ ? [X1] :
        ( ( less(nn1,X1)
          & less(X1,n1) )
       => sum(n21,X1,n21) ),
    inference(assume_negation,[status(cth)],[sum_something_n0_samething]) ).

fof(c_0_3,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_4,negated_conjecture,
    ! [X2,X2,X2] :
      ( less(nn1,X2)
      & less(X2,n1)
      & ~ sum(n21,X2,n21) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).

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

cnf(c_0_6,negated_conjecture,
    less(nn1,X1),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    ~ less(X1,nn1),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_7,c_0_6]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NUM343+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/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 : Wed Jul  6 06:38:14 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.25/1.43  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43  # Preprocessing time       : 0.022 s
% 0.25/1.43  
% 0.25/1.43  # Proof found!
% 0.25/1.43  # SZS status Theorem
% 0.25/1.43  # SZS output start CNFRefutation
% See solution above
% 0.25/1.43  # Proof object total steps             : 9
% 0.25/1.43  # Proof object clause steps            : 4
% 0.25/1.43  # Proof object formula steps           : 5
% 0.25/1.43  # Proof object conjectures             : 6
% 0.25/1.43  # Proof object clause conjectures      : 3
% 0.25/1.43  # Proof object formula conjectures     : 3
% 0.25/1.43  # Proof object initial clauses used    : 2
% 0.25/1.43  # Proof object initial formulas used   : 2
% 0.25/1.43  # Proof object generating inferences   : 2
% 0.25/1.43  # Proof object simplifying inferences  : 0
% 0.25/1.43  # Training examples: 0 positive, 0 negative
% 0.25/1.43  # Parsed axioms                        : 402
% 0.25/1.43  # Removed by relevancy pruning/SinE    : 301
% 0.25/1.43  # Initial clauses                      : 105
% 0.25/1.43  # Removed in clause preprocessing      : 0
% 0.25/1.43  # Initial clauses in saturation        : 105
% 0.25/1.43  # Processed clauses                    : 106
% 0.25/1.43  # ...of these trivial                  : 0
% 0.25/1.43  # ...subsumed                          : 0
% 0.25/1.43  # ...remaining for further processing  : 106
% 0.25/1.43  # Other redundant clauses eliminated   : 1
% 0.25/1.43  # Clauses deleted for lack of memory   : 0
% 0.25/1.43  # Backward-subsumed                    : 0
% 0.25/1.43  # Backward-rewritten                   : 0
% 0.25/1.43  # Generated clauses                    : 78
% 0.25/1.43  # ...of the previous two non-trivial   : 69
% 0.25/1.43  # Contextual simplify-reflections      : 0
% 0.25/1.43  # Paramodulations                      : 75
% 0.25/1.43  # Factorizations                       : 2
% 0.25/1.43  # Equation resolutions                 : 1
% 0.25/1.43  # Current number of processed clauses  : 105
% 0.25/1.43  #    Positive orientable unit clauses  : 84
% 0.25/1.43  #    Positive unorientable unit clauses: 0
% 0.25/1.43  #    Negative unit clauses             : 2
% 0.25/1.43  #    Non-unit-clauses                  : 19
% 0.25/1.43  # Current number of unprocessed clauses: 68
% 0.25/1.43  # ...number of literals in the above   : 148
% 0.25/1.43  # Current number of archived formulas  : 0
% 0.25/1.43  # Current number of archived clauses   : 0
% 0.25/1.43  # Clause-clause subsumption calls (NU) : 72
% 0.25/1.43  # Rec. Clause-clause subsumption calls : 33
% 0.25/1.43  # Non-unit clause-clause subsumptions  : 0
% 0.25/1.43  # Unit Clause-clause subsumption calls : 19
% 0.25/1.43  # Rewrite failures with RHS unbound    : 0
% 0.25/1.43  # BW rewrite match attempts            : 0
% 0.25/1.43  # BW rewrite match successes           : 0
% 0.25/1.43  # Condensation attempts                : 0
% 0.25/1.43  # Condensation successes               : 0
% 0.25/1.43  # Termbank termtop insertions          : 9928
% 0.25/1.43  
% 0.25/1.43  # -------------------------------------------------
% 0.25/1.43  # User time                : 0.022 s
% 0.25/1.43  # System time              : 0.005 s
% 0.25/1.43  # Total time               : 0.027 s
% 0.25/1.43  # Maximum resident set size: 4280 pages
%------------------------------------------------------------------------------