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

View Problem - Process Solution

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

% Computer : n019.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 : Thu Jul 14 16:49:32 EDT 2022

% Result   : Theorem 0.15s 1.33s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   12 (   6 unt;   0 def)
%            Number of atoms       :  157 ( 149 equ)
%            Maximal formula atoms :   50 (  13 avg)
%            Number of connectives :  214 (  69   ~;  13   |; 131   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   30 (  10 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   2 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ~ ( ( ( op(e0,e0) != e0
          & op(e1,e0) != e1
          & op(e2,e0) != e2
          & op(e3,e0) != e3
          & op(e4,e0) != e4 )
        | ( op(e0,e1) != e0
          & op(e1,e1) != e1
          & op(e2,e1) != e2
          & op(e3,e1) != e3
          & op(e4,e1) != e4 )
        | ( op(e0,e2) != e0
          & op(e1,e2) != e1
          & op(e2,e2) != e2
          & op(e3,e2) != e3
          & op(e4,e2) != e4 )
        | ( op(e0,e3) != e0
          & op(e1,e3) != e1
          & op(e2,e3) != e2
          & op(e3,e3) != e3
          & op(e4,e3) != e4 )
        | ( op(e0,e4) != e0
          & op(e1,e4) != e1
          & op(e2,e4) != e2
          & op(e3,e4) != e3
          & op(e4,e4) != e4 ) )
      & op(e0,op(e0,e0)) = e0
      & op(e0,op(e0,e1)) = e1
      & op(e0,op(e0,e2)) = e2
      & op(e0,op(e0,e3)) = e3
      & op(e0,op(e0,e4)) = e4
      & op(e1,op(e1,e0)) = e0
      & op(e1,op(e1,e1)) = e1
      & op(e1,op(e1,e2)) = e2
      & op(e1,op(e1,e3)) = e3
      & op(e1,op(e1,e4)) = e4
      & op(e2,op(e2,e0)) = e0
      & op(e2,op(e2,e1)) = e1
      & op(e2,op(e2,e2)) = e2
      & op(e2,op(e2,e3)) = e3
      & op(e2,op(e2,e4)) = e4
      & op(e3,op(e3,e0)) = e0
      & op(e3,op(e3,e1)) = e1
      & op(e3,op(e3,e2)) = e2
      & op(e3,op(e3,e3)) = e3
      & op(e3,op(e3,e4)) = e4
      & op(e4,op(e4,e0)) = e0
      & op(e4,op(e4,e1)) = e1
      & op(e4,op(e4,e2)) = e2
      & op(e4,op(e4,e3)) = e3
      & op(e4,op(e4,e4)) = e4 ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).

fof(ax6,axiom,
    ( e0 = op(e4,op(e4,e4))
    & e1 = op(e4,e4)
    & e2 = op(op(e4,op(e4,e4)),op(e4,e4))
    & e3 = op(op(e4,op(e4,e4)),op(e4,op(e4,e4))) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax6) ).

fof(ax5,axiom,
    ( e0 != e1
    & e0 != e2
    & e0 != e3
    & e0 != e4
    & e1 != e2
    & e1 != e3
    & e1 != e4
    & e2 != e3
    & e2 != e4
    & e3 != e4 ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax5) ).

fof(c_0_3,plain,
    ( epred2_0
  <=> ( ( op(e0,e0) != e0
        & op(e1,e0) != e1
        & op(e2,e0) != e2
        & op(e3,e0) != e3
        & op(e4,e0) != e4 )
      | ( op(e0,e1) != e0
        & op(e1,e1) != e1
        & op(e2,e1) != e2
        & op(e3,e1) != e3
        & op(e4,e1) != e4 )
      | ( op(e0,e2) != e0
        & op(e1,e2) != e1
        & op(e2,e2) != e2
        & op(e3,e2) != e3
        & op(e4,e2) != e4 )
      | ( op(e0,e3) != e0
        & op(e1,e3) != e1
        & op(e2,e3) != e2
        & op(e3,e3) != e3
        & op(e4,e3) != e4 ) ) ),
    introduced(definition) ).

fof(c_0_4,negated_conjecture,
    ~ ~ ( ( epred2_0
          | ( op(e0,e4) != e0
            & op(e1,e4) != e1
            & op(e2,e4) != e2
            & op(e3,e4) != e3
            & op(e4,e4) != e4 ) )
        & op(e0,op(e0,e0)) = e0
        & op(e0,op(e0,e1)) = e1
        & op(e0,op(e0,e2)) = e2
        & op(e0,op(e0,e3)) = e3
        & op(e0,op(e0,e4)) = e4
        & op(e1,op(e1,e0)) = e0
        & op(e1,op(e1,e1)) = e1
        & op(e1,op(e1,e2)) = e2
        & op(e1,op(e1,e3)) = e3
        & op(e1,op(e1,e4)) = e4
        & op(e2,op(e2,e0)) = e0
        & op(e2,op(e2,e1)) = e1
        & op(e2,op(e2,e2)) = e2
        & op(e2,op(e2,e3)) = e3
        & op(e2,op(e2,e4)) = e4
        & op(e3,op(e3,e0)) = e0
        & op(e3,op(e3,e1)) = e1
        & op(e3,op(e3,e2)) = e2
        & op(e3,op(e3,e3)) = e3
        & op(e3,op(e3,e4)) = e4
        & op(e4,op(e4,e0)) = e0
        & op(e4,op(e4,e1)) = e1
        & op(e4,op(e4,e2)) = e2
        & op(e4,op(e4,e3)) = e3
        & op(e4,op(e4,e4)) = e4 ),
    inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[co1]),c_0_3]) ).

fof(c_0_5,negated_conjecture,
    ( ( op(e0,e4) != e0
      | epred2_0 )
    & ( op(e1,e4) != e1
      | epred2_0 )
    & ( op(e2,e4) != e2
      | epred2_0 )
    & ( op(e3,e4) != e3
      | epred2_0 )
    & ( op(e4,e4) != e4
      | epred2_0 )
    & op(e0,op(e0,e0)) = e0
    & op(e0,op(e0,e1)) = e1
    & op(e0,op(e0,e2)) = e2
    & op(e0,op(e0,e3)) = e3
    & op(e0,op(e0,e4)) = e4
    & op(e1,op(e1,e0)) = e0
    & op(e1,op(e1,e1)) = e1
    & op(e1,op(e1,e2)) = e2
    & op(e1,op(e1,e3)) = e3
    & op(e1,op(e1,e4)) = e4
    & op(e2,op(e2,e0)) = e0
    & op(e2,op(e2,e1)) = e1
    & op(e2,op(e2,e2)) = e2
    & op(e2,op(e2,e3)) = e3
    & op(e2,op(e2,e4)) = e4
    & op(e3,op(e3,e0)) = e0
    & op(e3,op(e3,e1)) = e1
    & op(e3,op(e3,e2)) = e2
    & op(e3,op(e3,e3)) = e3
    & op(e3,op(e3,e4)) = e4
    & op(e4,op(e4,e0)) = e0
    & op(e4,op(e4,e1)) = e1
    & op(e4,op(e4,e2)) = e2
    & op(e4,op(e4,e3)) = e3
    & op(e4,op(e4,e4)) = e4 ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).

cnf(c_0_6,plain,
    e0 = op(e4,op(e4,e4)),
    inference(split_conjunct,[status(thm)],[ax6]) ).

cnf(c_0_7,plain,
    e1 = op(e4,e4),
    inference(split_conjunct,[status(thm)],[ax6]) ).

cnf(c_0_8,negated_conjecture,
    op(e4,op(e4,e4)) = e4,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    op(e4,e1) = e0,
    inference(rw,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,plain,
    e0 != e4,
    inference(split_conjunct,[status(thm)],[ax5]) ).

cnf(c_0_11,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7]),c_0_9]),c_0_10]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.07  % Problem  : ALG171+1 : TPTP v8.1.0. Released v2.7.0.
% 0.04/0.08  % Command  : run_ET %s %d
% 0.07/0.26  % Computer : n019.cluster.edu
% 0.07/0.26  % Model    : x86_64 x86_64
% 0.07/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26  % Memory   : 8042.1875MB
% 0.07/0.26  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26  % CPULimit : 300
% 0.07/0.26  % WCLimit  : 600
% 0.07/0.26  % DateTime : Wed Jun  8 19:07:10 EDT 2022
% 0.07/0.26  % CPUTime  : 
% 0.15/1.33  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.15/1.33  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.15/1.33  # Preprocessing time       : 0.026 s
% 0.15/1.33  
% 0.15/1.33  # Proof found!
% 0.15/1.33  # SZS status Theorem
% 0.15/1.33  # SZS output start CNFRefutation
% See solution above
% 0.15/1.33  # Proof object total steps             : 12
% 0.15/1.33  # Proof object clause steps            : 6
% 0.15/1.33  # Proof object formula steps           : 6
% 0.15/1.33  # Proof object conjectures             : 5
% 0.15/1.33  # Proof object clause conjectures      : 2
% 0.15/1.33  # Proof object formula conjectures     : 3
% 0.15/1.33  # Proof object initial clauses used    : 4
% 0.15/1.33  # Proof object initial formulas used   : 3
% 0.15/1.33  # Proof object generating inferences   : 0
% 0.15/1.33  # Proof object simplifying inferences  : 4
% 0.15/1.33  # Training examples: 0 positive, 0 negative
% 0.15/1.33  # Parsed axioms                        : 7
% 0.15/1.33  # Removed by relevancy pruning/SinE    : 0
% 0.15/1.33  # Initial clauses                      : 294
% 0.15/1.33  # Removed in clause preprocessing      : 0
% 0.15/1.33  # Initial clauses in saturation        : 294
% 0.15/1.33  # Processed clauses                    : 52
% 0.15/1.33  # ...of these trivial                  : 0
% 0.15/1.33  # ...subsumed                          : 0
% 0.15/1.33  # ...remaining for further processing  : 51
% 0.15/1.33  # Other redundant clauses eliminated   : 0
% 0.15/1.33  # Clauses deleted for lack of memory   : 0
% 0.15/1.33  # Backward-subsumed                    : 0
% 0.15/1.33  # Backward-rewritten                   : 1
% 0.15/1.33  # Generated clauses                    : 0
% 0.15/1.33  # ...of the previous two non-trivial   : 0
% 0.15/1.33  # Contextual simplify-reflections      : 0
% 0.15/1.33  # Paramodulations                      : 0
% 0.15/1.33  # Factorizations                       : 0
% 0.15/1.33  # Equation resolutions                 : 0
% 0.15/1.33  # Current number of processed clauses  : 50
% 0.15/1.33  #    Positive orientable unit clauses  : 25
% 0.15/1.33  #    Positive unorientable unit clauses: 0
% 0.15/1.33  #    Negative unit clauses             : 20
% 0.15/1.33  #    Non-unit-clauses                  : 5
% 0.15/1.33  # Current number of unprocessed clauses: 242
% 0.15/1.33  # ...number of literals in the above   : 667
% 0.15/1.33  # Current number of archived formulas  : 0
% 0.15/1.33  # Current number of archived clauses   : 1
% 0.15/1.33  # Clause-clause subsumption calls (NU) : 1
% 0.15/1.33  # Rec. Clause-clause subsumption calls : 1
% 0.15/1.33  # Non-unit clause-clause subsumptions  : 0
% 0.15/1.33  # Unit Clause-clause subsumption calls : 5
% 0.15/1.33  # Rewrite failures with RHS unbound    : 0
% 0.15/1.33  # BW rewrite match attempts            : 1
% 0.15/1.33  # BW rewrite match successes           : 1
% 0.15/1.33  # Condensation attempts                : 0
% 0.15/1.33  # Condensation successes               : 0
% 0.15/1.33  # Termbank termtop insertions          : 14683
% 0.15/1.33  
% 0.15/1.33  # -------------------------------------------------
% 0.15/1.33  # User time                : 0.027 s
% 0.15/1.33  # System time              : 0.000 s
% 0.15/1.33  # Total time               : 0.027 s
% 0.15/1.33  # Maximum resident set size: 3264 pages
%------------------------------------------------------------------------------