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

View Problem - Process Solution

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

% Computer : n015.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:34:24 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(mSuccEquSucc,axiom,
    ! [X1,X2] :
      ( ( aElementOf0(X1,szNzAzT0)
        & aElementOf0(X2,szNzAzT0) )
     => ( szszuzczcdt0(X1) = szszuzczcdt0(X2)
       => X1 = X2 ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSuccEquSucc) ).

fof(m__5255,hypothesis,
    ( sbrdtbr0(xQ) = szszuzczcdt0(xk)
    & szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ)
    & aElementOf0(sbrdtbr0(xP),szNzAzT0) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__5255) ).

fof(m__,conjecture,
    sbrdtbr0(xP) = xk,
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).

fof(m__3533,hypothesis,
    ( aElementOf0(xk,szNzAzT0)
    & szszuzczcdt0(xk) = xK ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3533) ).

fof(c_0_4,plain,
    ! [X3,X4] :
      ( ~ aElementOf0(X3,szNzAzT0)
      | ~ aElementOf0(X4,szNzAzT0)
      | szszuzczcdt0(X3) != szszuzczcdt0(X4)
      | X3 = X4 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccEquSucc])]) ).

cnf(c_0_5,hypothesis,
    szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ),
    inference(split_conjunct,[status(thm)],[m__5255]) ).

cnf(c_0_6,hypothesis,
    sbrdtbr0(xQ) = szszuzczcdt0(xk),
    inference(split_conjunct,[status(thm)],[m__5255]) ).

fof(c_0_7,negated_conjecture,
    sbrdtbr0(xP) != xk,
    inference(assume_negation,[status(cth)],[m__]) ).

cnf(c_0_8,plain,
    ( X1 = X2
    | szszuzczcdt0(X1) != szszuzczcdt0(X2)
    | ~ aElementOf0(X2,szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_9,hypothesis,
    szszuzczcdt0(xk) = xK,
    inference(split_conjunct,[status(thm)],[m__3533]) ).

cnf(c_0_10,hypothesis,
    aElementOf0(xk,szNzAzT0),
    inference(split_conjunct,[status(thm)],[m__3533]) ).

cnf(c_0_11,hypothesis,
    szszuzczcdt0(sbrdtbr0(xP)) = szszuzczcdt0(xk),
    inference(rw,[status(thm)],[c_0_5,c_0_6]) ).

fof(c_0_12,negated_conjecture,
    sbrdtbr0(xP) != xk,
    inference(fof_simplification,[status(thm)],[c_0_7]) ).

cnf(c_0_13,hypothesis,
    ( X1 = xk
    | szszuzczcdt0(X1) != xK
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).

cnf(c_0_14,hypothesis,
    szszuzczcdt0(sbrdtbr0(xP)) = xK,
    inference(rw,[status(thm)],[c_0_11,c_0_9]) ).

cnf(c_0_15,hypothesis,
    aElementOf0(sbrdtbr0(xP),szNzAzT0),
    inference(split_conjunct,[status(thm)],[m__5255]) ).

cnf(c_0_16,negated_conjecture,
    sbrdtbr0(xP) != xk,
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_17,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),c_0_16]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : NUM613+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14  % Command  : run_ET %s %d
% 0.15/0.36  % Computer : n015.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Wed Jul  6 20:07:04 EDT 2022
% 0.15/0.36  % CPUTime  : 
% 0.28/1.46  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.28/1.46  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.28/1.46  # Preprocessing time       : 0.028 s
% 0.28/1.46  
% 0.28/1.46  # Proof found!
% 0.28/1.46  # SZS status Theorem
% 0.28/1.46  # SZS output start CNFRefutation
% See solution above
% 0.28/1.46  # Proof object total steps             : 18
% 0.28/1.46  # Proof object clause steps            : 11
% 0.28/1.46  # Proof object formula steps           : 7
% 0.28/1.46  # Proof object conjectures             : 4
% 0.28/1.46  # Proof object clause conjectures      : 1
% 0.28/1.46  # Proof object formula conjectures     : 3
% 0.28/1.46  # Proof object initial clauses used    : 7
% 0.28/1.46  # Proof object initial formulas used   : 4
% 0.28/1.46  # Proof object generating inferences   : 2
% 0.28/1.46  # Proof object simplifying inferences  : 7
% 0.28/1.46  # Training examples: 0 positive, 0 negative
% 0.28/1.46  # Parsed axioms                        : 110
% 0.28/1.46  # Removed by relevancy pruning/SinE    : 9
% 0.28/1.46  # Initial clauses                      : 190
% 0.28/1.46  # Removed in clause preprocessing      : 7
% 0.28/1.46  # Initial clauses in saturation        : 183
% 0.28/1.46  # Processed clauses                    : 284
% 0.28/1.46  # ...of these trivial                  : 11
% 0.28/1.46  # ...subsumed                          : 28
% 0.28/1.46  # ...remaining for further processing  : 245
% 0.28/1.46  # Other redundant clauses eliminated   : 10
% 0.28/1.46  # Clauses deleted for lack of memory   : 0
% 0.28/1.46  # Backward-subsumed                    : 0
% 0.28/1.46  # Backward-rewritten                   : 2
% 0.28/1.46  # Generated clauses                    : 684
% 0.28/1.46  # ...of the previous two non-trivial   : 631
% 0.28/1.46  # Contextual simplify-reflections      : 23
% 0.28/1.46  # Paramodulations                      : 654
% 0.28/1.46  # Factorizations                       : 0
% 0.28/1.46  # Equation resolutions                 : 30
% 0.28/1.46  # Current number of processed clauses  : 241
% 0.28/1.46  #    Positive orientable unit clauses  : 67
% 0.28/1.46  #    Positive unorientable unit clauses: 0
% 0.28/1.46  #    Negative unit clauses             : 22
% 0.28/1.46  #    Non-unit-clauses                  : 152
% 0.28/1.46  # Current number of unprocessed clauses: 530
% 0.28/1.46  # ...number of literals in the above   : 2707
% 0.28/1.46  # Current number of archived formulas  : 0
% 0.28/1.46  # Current number of archived clauses   : 2
% 0.28/1.46  # Clause-clause subsumption calls (NU) : 5768
% 0.28/1.46  # Rec. Clause-clause subsumption calls : 1281
% 0.28/1.46  # Non-unit clause-clause subsumptions  : 26
% 0.28/1.46  # Unit Clause-clause subsumption calls : 2058
% 0.28/1.46  # Rewrite failures with RHS unbound    : 0
% 0.28/1.46  # BW rewrite match attempts            : 1
% 0.28/1.46  # BW rewrite match successes           : 1
% 0.28/1.46  # Condensation attempts                : 0
% 0.28/1.46  # Condensation successes               : 0
% 0.28/1.46  # Termbank termtop insertions          : 24793
% 0.28/1.46  
% 0.28/1.46  # -------------------------------------------------
% 0.28/1.46  # User time                : 0.048 s
% 0.28/1.46  # System time              : 0.009 s
% 0.28/1.46  # Total time               : 0.057 s
% 0.28/1.46  # Maximum resident set size: 4820 pages
% 0.28/23.46  eprover: CPU time limit exceeded, terminating
% 0.28/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.47  eprover: No such file or directory
% 0.28/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.48  eprover: No such file or directory
% 0.28/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.49  eprover: No such file or directory
% 0.28/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.49  eprover: No such file or directory
% 0.28/23.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.50  eprover: No such file or directory
% 0.28/23.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.50  eprover: No such file or directory
% 0.28/23.51  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.51  eprover: No such file or directory
% 0.28/23.52  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.52  eprover: No such file or directory
% 0.28/23.52  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.52  eprover: No such file or directory
% 0.28/23.53  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.53  eprover: No such file or directory
% 0.28/23.53  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.53  eprover: No such file or directory
%------------------------------------------------------------------------------