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

View Problem - Process Solution

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

% Computer : n020.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:36:59 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof('qe(171)',conjecture,
    ? [X1] : vd269 = vplus(vd268,X1),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','qe(171)') ).

fof('def(cond(conseq(axiom(3)), 12), 1)',axiom,
    ! [X16,X17] :
      ( less(X17,X16)
    <=> ? [X18] : X16 = vplus(X17,X18) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','def(cond(conseq(axiom(3)), 12), 1)') ).

fof('holds(conjunct1(170), 270, 0)',axiom,
    less(vd268,vd269),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(conjunct1(170), 270, 0)') ).

fof(c_0_3,negated_conjecture,
    ~ ? [X1] : vd269 = vplus(vd268,X1),
    inference(assume_negation,[status(cth)],['qe(171)']) ).

fof(c_0_4,negated_conjecture,
    ! [X2] : vd269 != vplus(vd268,X2),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).

fof(c_0_5,plain,
    ! [X19,X20,X19,X20,X22] :
      ( ( ~ less(X20,X19)
        | X19 = vplus(X20,esk3_2(X19,X20)) )
      & ( X19 != vplus(X20,X22)
        | less(X20,X19) ) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 12), 1)'])])])])])]) ).

cnf(c_0_6,negated_conjecture,
    vd269 != vplus(vd268,X1),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,plain,
    ( X1 = vplus(X2,esk3_2(X1,X2))
    | ~ less(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    ( X1 != vd269
    | ~ less(vd268,X1) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_9,plain,
    less(vd268,vd269),
    inference(split_conjunct,[status(thm)],['holds(conjunct1(170), 270, 0)']) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : NUM837+1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.11  % Command  : run_ET %s %d
% 0.12/0.32  % Computer : n020.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Thu Jul  7 15:14:14 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.22/1.40  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40  # Preprocessing time       : 0.015 s
% 0.22/1.40  
% 0.22/1.40  # Proof found!
% 0.22/1.40  # SZS status Theorem
% 0.22/1.40  # SZS output start CNFRefutation
% See solution above
% 0.22/1.40  # Proof object total steps             : 11
% 0.22/1.40  # Proof object clause steps            : 5
% 0.22/1.40  # Proof object formula steps           : 6
% 0.22/1.40  # Proof object conjectures             : 6
% 0.22/1.40  # Proof object clause conjectures      : 3
% 0.22/1.40  # Proof object formula conjectures     : 3
% 0.22/1.40  # Proof object initial clauses used    : 3
% 0.22/1.40  # Proof object initial formulas used   : 3
% 0.22/1.40  # Proof object generating inferences   : 2
% 0.22/1.40  # Proof object simplifying inferences  : 0
% 0.22/1.40  # Training examples: 0 positive, 0 negative
% 0.22/1.40  # Parsed axioms                        : 31
% 0.22/1.40  # Removed by relevancy pruning/SinE    : 13
% 0.22/1.40  # Initial clauses                      : 20
% 0.22/1.40  # Removed in clause preprocessing      : 0
% 0.22/1.40  # Initial clauses in saturation        : 20
% 0.22/1.40  # Processed clauses                    : 33
% 0.22/1.40  # ...of these trivial                  : 2
% 0.22/1.40  # ...subsumed                          : 3
% 0.22/1.40  # ...remaining for further processing  : 28
% 0.22/1.40  # Other redundant clauses eliminated   : 13
% 0.22/1.40  # Clauses deleted for lack of memory   : 0
% 0.22/1.40  # Backward-subsumed                    : 0
% 0.22/1.40  # Backward-rewritten                   : 0
% 0.22/1.40  # Generated clauses                    : 108
% 0.22/1.40  # ...of the previous two non-trivial   : 84
% 0.22/1.40  # Contextual simplify-reflections      : 0
% 0.22/1.40  # Paramodulations                      : 91
% 0.22/1.40  # Factorizations                       : 0
% 0.22/1.40  # Equation resolutions                 : 17
% 0.22/1.40  # Current number of processed clauses  : 24
% 0.22/1.40  #    Positive orientable unit clauses  : 6
% 0.22/1.40  #    Positive unorientable unit clauses: 1
% 0.22/1.40  #    Negative unit clauses             : 5
% 0.22/1.40  #    Non-unit-clauses                  : 12
% 0.22/1.40  # Current number of unprocessed clauses: 71
% 0.22/1.40  # ...number of literals in the above   : 142
% 0.22/1.40  # Current number of archived formulas  : 0
% 0.22/1.40  # Current number of archived clauses   : 0
% 0.22/1.40  # Clause-clause subsumption calls (NU) : 4
% 0.22/1.40  # Rec. Clause-clause subsumption calls : 4
% 0.22/1.40  # Non-unit clause-clause subsumptions  : 0
% 0.22/1.40  # Unit Clause-clause subsumption calls : 10
% 0.22/1.40  # Rewrite failures with RHS unbound    : 0
% 0.22/1.40  # BW rewrite match attempts            : 14
% 0.22/1.40  # BW rewrite match successes           : 12
% 0.22/1.40  # Condensation attempts                : 0
% 0.22/1.40  # Condensation successes               : 0
% 0.22/1.40  # Termbank termtop insertions          : 1496
% 0.22/1.40  
% 0.22/1.40  # -------------------------------------------------
% 0.22/1.40  # User time                : 0.016 s
% 0.22/1.40  # System time              : 0.001 s
% 0.22/1.40  # Total time               : 0.017 s
% 0.22/1.40  # Maximum resident set size: 2820 pages
%------------------------------------------------------------------------------