TSTP Solution File: ALG199+1 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : ALG199+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s

% Computer : n018.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:51:55 EDT 2022

% Result   : Theorem 0.12s 0.39s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   19 (  13 unt;   0 def)
%            Number of atoms       :  110 ( 109 equ)
%            Maximal formula atoms :   21 (   5 avg)
%            Number of connectives :  164 (  73   ~;  42   |;  49   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   6 avg)
%            Maximal term depth    :    6 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ~ ( op(e0,e0) != e0
      & op(e1,e1) != e1
      & op(e2,e2) != e2
      & op(e3,e3) != e3
      & op(e4,e4) != e4
      & op(e5,e5) != e5
      & op(e6,e6) != e6
      & ( op(e0,e0) = e0
        | op(e1,e1) = e1
        | op(e2,e2) = e2
        | op(e3,e3) = e3
        | op(e4,e4) = e4
        | op(e5,e5) = e5
        | op(e6,e6) = e6 )
      & ( op(e0,e0) != e0
        | op(e1,e1) != e1
        | op(e2,e2) != e2
        | op(e3,e3) != e3
        | op(e4,e4) != e4
        | op(e5,e5) != e5
        | op(e6,e6) != e6 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

fof(ax6,axiom,
    ( e0 = op(op(op(e5,op(e5,e5)),op(e5,op(e5,e5))),op(e5,op(e5,e5)))
    & e1 = op(e5,e5)
    & e2 = op(op(e5,op(e5,e5)),op(e5,op(e5,e5)))
    & e3 = op(op(op(e5,op(e5,e5)),op(e5,op(e5,e5))),e5)
    & e4 = op(e5,op(e5,e5))
    & e6 = op(op(op(op(e5,op(e5,e5)),op(e5,op(e5,e5))),e5),op(e5,op(e5,e5))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax6) ).

fof(ax5,axiom,
    ( e0 != e1
    & e0 != e2
    & e0 != e3
    & e0 != e4
    & e0 != e5
    & e0 != e6
    & e1 != e2
    & e1 != e3
    & e1 != e4
    & e1 != e5
    & e1 != e6
    & e2 != e3
    & e2 != e4
    & e2 != e5
    & e2 != e6
    & e3 != e4
    & e3 != e5
    & e3 != e6
    & e4 != e5
    & e4 != e6
    & e5 != e6 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).

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

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

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

fof(c_0_6,negated_conjecture,
    ( op(e0,e0) != e0
    & op(e1,e1) != e1
    & op(e2,e2) != e2
    & op(e3,e3) != e3
    & op(e4,e4) != e4
    & op(e5,e5) != e5
    & op(e6,e6) != e6
    & ( op(e0,e0) = e0
      | op(e1,e1) = e1
      | op(e2,e2) = e2
      | op(e3,e3) = e3
      | op(e4,e4) = e4
      | op(e5,e5) = e5
      | op(e6,e6) = e6 )
    & ( op(e0,e0) != e0
      | op(e1,e1) != e1
      | op(e2,e2) != e2
      | op(e3,e3) != e3
      | op(e4,e4) != e4
      | op(e5,e5) != e5
      | op(e6,e6) != e6 ) ),
    inference(fof_nnf,[status(thm)],[c_0_3]) ).

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

cnf(c_0_8,plain,
    op(e5,e1) = e4,
    inference(rw,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_9,negated_conjecture,
    ( op(e0,e0) = e0
    | op(e1,e1) = e1
    | op(e2,e2) = e2
    | op(e3,e3) = e3
    | op(e4,e4) = e4
    | op(e5,e5) = e5
    | op(e6,e6) = e6 ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    op(e4,e4) = e2,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_5]),c_0_8]),c_0_5]),c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    op(e0,e0) != e0,
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_12,negated_conjecture,
    op(e1,e1) != e1,
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_13,negated_conjecture,
    op(e2,e2) != e2,
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_14,negated_conjecture,
    op(e3,e3) != e3,
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

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

cnf(c_0_16,plain,
    e1 != e5,
    inference(split_conjunct,[status(thm)],[ax5]) ).

cnf(c_0_17,negated_conjecture,
    op(e6,e6) != e6,
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_18,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_5]),c_0_11]),c_0_12]),c_0_13]),c_0_14]),c_0_15]),c_0_16]),c_0_17]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : ALG199+1 : TPTP v8.1.0. Released v2.7.0.
% 0.10/0.13  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.34  % Computer : n018.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 Jun  8 00:46:51 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.39  # No SInE strategy applied
% 0.12/0.39  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.39  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.39  #
% 0.12/0.39  # Presaturation interreduction done
% 0.12/0.39  
% 0.12/0.39  # Proof found!
% 0.12/0.39  # SZS status Theorem
% 0.12/0.39  # SZS output start CNFRefutation
% See solution above
% 0.12/0.39  # Training examples: 0 positive, 0 negative
%------------------------------------------------------------------------------