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

View Problem - Process Solution

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

% Computer : n016.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 : Sat Jul 16 04:05:59 EDT 2022

% Result   : Theorem 1.24s 31.43s
% Output   : CNFRefutation 1.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   28 (   6 unt;   0 def)
%            Number of atoms       :   67 (  55 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   66 (  27   ~;  24   |;   7   &)
%                                         (   3 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :   10 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   16 (  16 usr;   8 con; 0-4 aty)
%            Number of variables   :   77 (  12 sgn  51   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(aPERMUTESu_INVERSESu_o,conjecture,
    ! [X1560,X7,X97] :
      ( p(s(bool,i(s(fun(fun(X1560,bool),bool),i(s(fun(fun(X1560,X1560),fun(fun(X1560,bool),bool)),permutes),s(fun(X1560,X1560),X7))),s(fun(X1560,bool),X97))))
     => ( s(fun(X1560,X1560),i(s(fun(fun(X1560,X1560),fun(X1560,X1560)),i(s(fun(fun(X1560,X1560),fun(fun(X1560,X1560),fun(X1560,X1560))),o),s(fun(X1560,X1560),X7))),s(fun(X1560,X1560),i(s(fun(fun(X1560,X1560),fun(X1560,X1560)),inverse),s(fun(X1560,X1560),X7))))) = s(fun(X1560,X1560),i1)
        & s(fun(X1560,X1560),i(s(fun(fun(X1560,X1560),fun(X1560,X1560)),i(s(fun(fun(X1560,X1560),fun(fun(X1560,X1560),fun(X1560,X1560))),o),s(fun(X1560,X1560),i(s(fun(fun(X1560,X1560),fun(X1560,X1560)),inverse),s(fun(X1560,X1560),X7))))),s(fun(X1560,X1560),X7))) = s(fun(X1560,X1560),i1) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',aPERMUTESu_INVERSESu_o) ).

fof(aPERMUTESu_SURJECTIVE,axiom,
    ! [X1559,X7,X97] :
      ( p(s(bool,i(s(fun(fun(X1559,bool),bool),i(s(fun(fun(X1559,X1559),fun(fun(X1559,bool),bool)),permutes),s(fun(X1559,X1559),X7))),s(fun(X1559,bool),X97))))
     => ! [X8] :
        ? [X1] : s(X1559,i(s(fun(X1559,X1559),X7),s(X1559,X1))) = s(X1559,X8) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',aPERMUTESu_SURJECTIVE) ).

fof(aSURJECTIVEu_INVERSEu_o,axiom,
    ! [X1541,X1542,X11] :
      ( ! [X8] :
        ? [X1] : s(X1542,i(s(fun(X1541,X1542),X11),s(X1541,X1))) = s(X1542,X8)
    <=> s(fun(X1542,X1542),i(s(fun(fun(X1542,X1541),fun(X1542,X1542)),i(s(fun(fun(X1541,X1542),fun(fun(X1542,X1541),fun(X1542,X1542))),o),s(fun(X1541,X1542),X11))),s(fun(X1542,X1541),i(s(fun(fun(X1541,X1542),fun(X1542,X1541)),inverse),s(fun(X1541,X1542),X11))))) = s(fun(X1542,X1542),i1) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',aSURJECTIVEu_INVERSEu_o) ).

fof(aINJECTIVEu_INVERSEu_o,axiom,
    ! [X1545,X1546,X11] :
      ( ! [X1,X2] :
          ( s(X1545,i(s(fun(X1546,X1545),X11),s(X1546,X1))) = s(X1545,i(s(fun(X1546,X1545),X11),s(X1546,X2)))
         => s(X1546,X1) = s(X1546,X2) )
    <=> s(fun(X1546,X1546),i(s(fun(fun(X1546,X1545),fun(X1546,X1546)),i(s(fun(fun(X1545,X1546),fun(fun(X1546,X1545),fun(X1546,X1546))),o),s(fun(X1545,X1546),i(s(fun(fun(X1546,X1545),fun(X1545,X1546)),inverse),s(fun(X1546,X1545),X11))))),s(fun(X1546,X1545),X11))) = s(fun(X1546,X1546),i1) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',aINJECTIVEu_INVERSEu_o) ).

fof(aPERMUTESu_INJECTIVE,axiom,
    ! [X1558,X7,X97] :
      ( p(s(bool,i(s(fun(fun(X1558,bool),bool),i(s(fun(fun(X1558,X1558),fun(fun(X1558,bool),bool)),permutes),s(fun(X1558,X1558),X7))),s(fun(X1558,bool),X97))))
     => ! [X1,X8] :
          ( s(X1558,i(s(fun(X1558,X1558),X7),s(X1558,X1))) = s(X1558,i(s(fun(X1558,X1558),X7),s(X1558,X8)))
        <=> s(X1558,X1) = s(X1558,X8) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',aPERMUTESu_INJECTIVE) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X1560,X7,X97] :
        ( p(s(bool,i(s(fun(fun(X1560,bool),bool),i(s(fun(fun(X1560,X1560),fun(fun(X1560,bool),bool)),permutes),s(fun(X1560,X1560),X7))),s(fun(X1560,bool),X97))))
       => ( s(fun(X1560,X1560),i(s(fun(fun(X1560,X1560),fun(X1560,X1560)),i(s(fun(fun(X1560,X1560),fun(fun(X1560,X1560),fun(X1560,X1560))),o),s(fun(X1560,X1560),X7))),s(fun(X1560,X1560),i(s(fun(fun(X1560,X1560),fun(X1560,X1560)),inverse),s(fun(X1560,X1560),X7))))) = s(fun(X1560,X1560),i1)
          & s(fun(X1560,X1560),i(s(fun(fun(X1560,X1560),fun(X1560,X1560)),i(s(fun(fun(X1560,X1560),fun(fun(X1560,X1560),fun(X1560,X1560))),o),s(fun(X1560,X1560),i(s(fun(fun(X1560,X1560),fun(X1560,X1560)),inverse),s(fun(X1560,X1560),X7))))),s(fun(X1560,X1560),X7))) = s(fun(X1560,X1560),i1) ) ),
    inference(assume_negation,[status(cth)],[aPERMUTESu_INVERSESu_o]) ).

fof(c_0_6,plain,
    ! [X1560,X1561,X1562,X1563] :
      ( ~ p(s(bool,i(s(fun(fun(X1560,bool),bool),i(s(fun(fun(X1560,X1560),fun(fun(X1560,bool),bool)),permutes),s(fun(X1560,X1560),X1561))),s(fun(X1560,bool),X1562))))
      | s(X1560,i(s(fun(X1560,X1560),X1561),s(X1560,esk238_3(X1560,X1561,X1563)))) = s(X1560,X1563) ),
    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)],[aPERMUTESu_SURJECTIVE])])])])])]) ).

fof(c_0_7,negated_conjecture,
    ( p(s(bool,i(s(fun(fun(esk1_0,bool),bool),i(s(fun(fun(esk1_0,esk1_0),fun(fun(esk1_0,bool),bool)),permutes),s(fun(esk1_0,esk1_0),esk2_0))),s(fun(esk1_0,bool),esk3_0))))
    & ( s(fun(esk1_0,esk1_0),i(s(fun(fun(esk1_0,esk1_0),fun(esk1_0,esk1_0)),i(s(fun(fun(esk1_0,esk1_0),fun(fun(esk1_0,esk1_0),fun(esk1_0,esk1_0))),o),s(fun(esk1_0,esk1_0),esk2_0))),s(fun(esk1_0,esk1_0),i(s(fun(fun(esk1_0,esk1_0),fun(esk1_0,esk1_0)),inverse),s(fun(esk1_0,esk1_0),esk2_0))))) != s(fun(esk1_0,esk1_0),i1)
      | s(fun(esk1_0,esk1_0),i(s(fun(fun(esk1_0,esk1_0),fun(esk1_0,esk1_0)),i(s(fun(fun(esk1_0,esk1_0),fun(fun(esk1_0,esk1_0),fun(esk1_0,esk1_0))),o),s(fun(esk1_0,esk1_0),i(s(fun(fun(esk1_0,esk1_0),fun(esk1_0,esk1_0)),inverse),s(fun(esk1_0,esk1_0),esk2_0))))),s(fun(esk1_0,esk1_0),esk2_0))) != s(fun(esk1_0,esk1_0),i1) ) ),
    inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).

fof(c_0_8,plain,
    ! [X1543,X1544,X1545,X1547,X1543,X1544,X1545,X1548] :
      ( ( s(X1544,i(s(fun(X1543,X1544),X1545),s(X1543,X1547))) != s(X1544,esk40_3(X1543,X1544,X1545))
        | s(fun(X1544,X1544),i(s(fun(fun(X1544,X1543),fun(X1544,X1544)),i(s(fun(fun(X1543,X1544),fun(fun(X1544,X1543),fun(X1544,X1544))),o),s(fun(X1543,X1544),X1545))),s(fun(X1544,X1543),i(s(fun(fun(X1543,X1544),fun(X1544,X1543)),inverse),s(fun(X1543,X1544),X1545))))) = s(fun(X1544,X1544),i1) )
      & ( s(fun(X1544,X1544),i(s(fun(fun(X1544,X1543),fun(X1544,X1544)),i(s(fun(fun(X1543,X1544),fun(fun(X1544,X1543),fun(X1544,X1544))),o),s(fun(X1543,X1544),X1545))),s(fun(X1544,X1543),i(s(fun(fun(X1543,X1544),fun(X1544,X1543)),inverse),s(fun(X1543,X1544),X1545))))) != s(fun(X1544,X1544),i1)
        | s(X1544,i(s(fun(X1543,X1544),X1545),s(X1543,esk41_4(X1543,X1544,X1545,X1548)))) = s(X1544,X1548) ) ),
    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)],[aSURJECTIVEu_INVERSEu_o])])])])])]) ).

cnf(c_0_9,plain,
    ( s(X1,i(s(fun(X1,X1),X2),s(X1,esk238_3(X1,X2,X3)))) = s(X1,X3)
    | ~ p(s(bool,i(s(fun(fun(X1,bool),bool),i(s(fun(fun(X1,X1),fun(fun(X1,bool),bool)),permutes),s(fun(X1,X1),X2))),s(fun(X1,bool),X4)))) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    p(s(bool,i(s(fun(fun(esk1_0,bool),bool),i(s(fun(fun(esk1_0,esk1_0),fun(fun(esk1_0,bool),bool)),permutes),s(fun(esk1_0,esk1_0),esk2_0))),s(fun(esk1_0,bool),esk3_0)))),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_11,plain,
    ! [X1547,X1548,X1549,X1547,X1548,X1549,X1552,X1553] :
      ( ( s(X1547,i(s(fun(X1548,X1547),X1549),s(X1548,esk45_3(X1547,X1548,X1549)))) = s(X1547,i(s(fun(X1548,X1547),X1549),s(X1548,esk46_3(X1547,X1548,X1549))))
        | s(fun(X1548,X1548),i(s(fun(fun(X1548,X1547),fun(X1548,X1548)),i(s(fun(fun(X1547,X1548),fun(fun(X1548,X1547),fun(X1548,X1548))),o),s(fun(X1547,X1548),i(s(fun(fun(X1548,X1547),fun(X1547,X1548)),inverse),s(fun(X1548,X1547),X1549))))),s(fun(X1548,X1547),X1549))) = s(fun(X1548,X1548),i1) )
      & ( s(X1548,esk45_3(X1547,X1548,X1549)) != s(X1548,esk46_3(X1547,X1548,X1549))
        | s(fun(X1548,X1548),i(s(fun(fun(X1548,X1547),fun(X1548,X1548)),i(s(fun(fun(X1547,X1548),fun(fun(X1548,X1547),fun(X1548,X1548))),o),s(fun(X1547,X1548),i(s(fun(fun(X1548,X1547),fun(X1547,X1548)),inverse),s(fun(X1548,X1547),X1549))))),s(fun(X1548,X1547),X1549))) = s(fun(X1548,X1548),i1) )
      & ( s(fun(X1548,X1548),i(s(fun(fun(X1548,X1547),fun(X1548,X1548)),i(s(fun(fun(X1547,X1548),fun(fun(X1548,X1547),fun(X1548,X1548))),o),s(fun(X1547,X1548),i(s(fun(fun(X1548,X1547),fun(X1547,X1548)),inverse),s(fun(X1548,X1547),X1549))))),s(fun(X1548,X1547),X1549))) != s(fun(X1548,X1548),i1)
        | s(X1547,i(s(fun(X1548,X1547),X1549),s(X1548,X1552))) != s(X1547,i(s(fun(X1548,X1547),X1549),s(X1548,X1553)))
        | s(X1548,X1552) = s(X1548,X1553) ) ),
    inference(distribute,[status(thm)],[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)],[aINJECTIVEu_INVERSEu_o])])])])])])]) ).

cnf(c_0_12,plain,
    ( s(fun(X1,X1),i(s(fun(fun(X1,X2),fun(X1,X1)),i(s(fun(fun(X2,X1),fun(fun(X1,X2),fun(X1,X1))),o),s(fun(X2,X1),X3))),s(fun(X1,X2),i(s(fun(fun(X2,X1),fun(X1,X2)),inverse),s(fun(X2,X1),X3))))) = s(fun(X1,X1),i1)
    | s(X1,i(s(fun(X2,X1),X3),s(X2,X4))) != s(X1,esk40_3(X2,X1,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    s(esk1_0,i(s(fun(esk1_0,esk1_0),esk2_0),s(esk1_0,esk238_3(esk1_0,esk2_0,X1)))) = s(esk1_0,X1),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

fof(c_0_14,plain,
    ! [X1559,X1560,X1561,X1562,X1563,X1562,X1563] :
      ( ( s(X1559,i(s(fun(X1559,X1559),X1560),s(X1559,X1562))) != s(X1559,i(s(fun(X1559,X1559),X1560),s(X1559,X1563)))
        | s(X1559,X1562) = s(X1559,X1563)
        | ~ p(s(bool,i(s(fun(fun(X1559,bool),bool),i(s(fun(fun(X1559,X1559),fun(fun(X1559,bool),bool)),permutes),s(fun(X1559,X1559),X1560))),s(fun(X1559,bool),X1561)))) )
      & ( s(X1559,X1562) != s(X1559,X1563)
        | s(X1559,i(s(fun(X1559,X1559),X1560),s(X1559,X1562))) = s(X1559,i(s(fun(X1559,X1559),X1560),s(X1559,X1563)))
        | ~ p(s(bool,i(s(fun(fun(X1559,bool),bool),i(s(fun(fun(X1559,X1559),fun(fun(X1559,bool),bool)),permutes),s(fun(X1559,X1559),X1560))),s(fun(X1559,bool),X1561)))) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[aPERMUTESu_INJECTIVE])])])])])]) ).

cnf(c_0_15,negated_conjecture,
    ( s(fun(esk1_0,esk1_0),i(s(fun(fun(esk1_0,esk1_0),fun(esk1_0,esk1_0)),i(s(fun(fun(esk1_0,esk1_0),fun(fun(esk1_0,esk1_0),fun(esk1_0,esk1_0))),o),s(fun(esk1_0,esk1_0),i(s(fun(fun(esk1_0,esk1_0),fun(esk1_0,esk1_0)),inverse),s(fun(esk1_0,esk1_0),esk2_0))))),s(fun(esk1_0,esk1_0),esk2_0))) != s(fun(esk1_0,esk1_0),i1)
    | s(fun(esk1_0,esk1_0),i(s(fun(fun(esk1_0,esk1_0),fun(esk1_0,esk1_0)),i(s(fun(fun(esk1_0,esk1_0),fun(fun(esk1_0,esk1_0),fun(esk1_0,esk1_0))),o),s(fun(esk1_0,esk1_0),esk2_0))),s(fun(esk1_0,esk1_0),i(s(fun(fun(esk1_0,esk1_0),fun(esk1_0,esk1_0)),inverse),s(fun(esk1_0,esk1_0),esk2_0))))) != s(fun(esk1_0,esk1_0),i1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_16,plain,
    ( s(fun(X1,X1),i(s(fun(fun(X1,X2),fun(X1,X1)),i(s(fun(fun(X2,X1),fun(fun(X1,X2),fun(X1,X1))),o),s(fun(X2,X1),i(s(fun(fun(X1,X2),fun(X2,X1)),inverse),s(fun(X1,X2),X3))))),s(fun(X1,X2),X3))) = s(fun(X1,X1),i1)
    | s(X2,i(s(fun(X1,X2),X3),s(X1,esk45_3(X2,X1,X3)))) = s(X2,i(s(fun(X1,X2),X3),s(X1,esk46_3(X2,X1,X3)))) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_17,negated_conjecture,
    ( s(fun(esk1_0,esk1_0),i(s(fun(fun(esk1_0,esk1_0),fun(esk1_0,esk1_0)),i(s(fun(fun(esk1_0,esk1_0),fun(fun(esk1_0,esk1_0),fun(esk1_0,esk1_0))),o),s(fun(esk1_0,esk1_0),esk2_0))),s(fun(esk1_0,esk1_0),i(s(fun(fun(esk1_0,esk1_0),fun(esk1_0,esk1_0)),inverse),s(fun(esk1_0,esk1_0),esk2_0))))) = s(fun(esk1_0,esk1_0),i1)
    | s(esk1_0,X1) != s(esk1_0,esk40_3(esk1_0,esk1_0,esk2_0)) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_18,plain,
    ( s(X1,X4) = s(X1,X5)
    | ~ p(s(bool,i(s(fun(fun(X1,bool),bool),i(s(fun(fun(X1,X1),fun(fun(X1,bool),bool)),permutes),s(fun(X1,X1),X2))),s(fun(X1,bool),X3))))
    | s(X1,i(s(fun(X1,X1),X2),s(X1,X4))) != s(X1,i(s(fun(X1,X1),X2),s(X1,X5))) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_19,negated_conjecture,
    ( s(esk1_0,i(s(fun(esk1_0,esk1_0),esk2_0),s(esk1_0,esk45_3(esk1_0,esk1_0,esk2_0)))) = s(esk1_0,i(s(fun(esk1_0,esk1_0),esk2_0),s(esk1_0,esk46_3(esk1_0,esk1_0,esk2_0))))
    | s(fun(esk1_0,esk1_0),i(s(fun(fun(esk1_0,esk1_0),fun(esk1_0,esk1_0)),i(s(fun(fun(esk1_0,esk1_0),fun(fun(esk1_0,esk1_0),fun(esk1_0,esk1_0))),o),s(fun(esk1_0,esk1_0),esk2_0))),s(fun(esk1_0,esk1_0),i(s(fun(fun(esk1_0,esk1_0),fun(esk1_0,esk1_0)),inverse),s(fun(esk1_0,esk1_0),esk2_0))))) != s(fun(esk1_0,esk1_0),i1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,negated_conjecture,
    s(fun(esk1_0,esk1_0),i(s(fun(fun(esk1_0,esk1_0),fun(esk1_0,esk1_0)),i(s(fun(fun(esk1_0,esk1_0),fun(fun(esk1_0,esk1_0),fun(esk1_0,esk1_0))),o),s(fun(esk1_0,esk1_0),esk2_0))),s(fun(esk1_0,esk1_0),i(s(fun(fun(esk1_0,esk1_0),fun(esk1_0,esk1_0)),inverse),s(fun(esk1_0,esk1_0),esk2_0))))) = s(fun(esk1_0,esk1_0),i1),
    inference(er,[status(thm)],[c_0_17]) ).

cnf(c_0_21,plain,
    ( s(fun(X1,X1),i(s(fun(fun(X1,X2),fun(X1,X1)),i(s(fun(fun(X2,X1),fun(fun(X1,X2),fun(X1,X1))),o),s(fun(X2,X1),i(s(fun(fun(X1,X2),fun(X2,X1)),inverse),s(fun(X1,X2),X3))))),s(fun(X1,X2),X3))) = s(fun(X1,X1),i1)
    | s(X1,esk45_3(X2,X1,X3)) != s(X1,esk46_3(X2,X1,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_22,negated_conjecture,
    ( s(esk1_0,X1) = s(esk1_0,X2)
    | s(esk1_0,i(s(fun(esk1_0,esk1_0),esk2_0),s(esk1_0,X1))) != s(esk1_0,i(s(fun(esk1_0,esk1_0),esk2_0),s(esk1_0,X2))) ),
    inference(spm,[status(thm)],[c_0_18,c_0_10]) ).

cnf(c_0_23,negated_conjecture,
    s(esk1_0,i(s(fun(esk1_0,esk1_0),esk2_0),s(esk1_0,esk45_3(esk1_0,esk1_0,esk2_0)))) = s(esk1_0,i(s(fun(esk1_0,esk1_0),esk2_0),s(esk1_0,esk46_3(esk1_0,esk1_0,esk2_0)))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).

cnf(c_0_24,negated_conjecture,
    ( s(fun(esk1_0,esk1_0),i(s(fun(fun(esk1_0,esk1_0),fun(esk1_0,esk1_0)),i(s(fun(fun(esk1_0,esk1_0),fun(fun(esk1_0,esk1_0),fun(esk1_0,esk1_0))),o),s(fun(esk1_0,esk1_0),esk2_0))),s(fun(esk1_0,esk1_0),i(s(fun(fun(esk1_0,esk1_0),fun(esk1_0,esk1_0)),inverse),s(fun(esk1_0,esk1_0),esk2_0))))) != s(fun(esk1_0,esk1_0),i1)
    | s(esk1_0,esk45_3(esk1_0,esk1_0,esk2_0)) != s(esk1_0,esk46_3(esk1_0,esk1_0,esk2_0)) ),
    inference(spm,[status(thm)],[c_0_15,c_0_21]) ).

cnf(c_0_25,negated_conjecture,
    ( s(esk1_0,X1) = s(esk1_0,esk45_3(esk1_0,esk1_0,esk2_0))
    | s(esk1_0,i(s(fun(esk1_0,esk1_0),esk2_0),s(esk1_0,X1))) != s(esk1_0,i(s(fun(esk1_0,esk1_0),esk2_0),s(esk1_0,esk46_3(esk1_0,esk1_0,esk2_0)))) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_26,negated_conjecture,
    s(esk1_0,esk45_3(esk1_0,esk1_0,esk2_0)) != s(esk1_0,esk46_3(esk1_0,esk1_0,esk2_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_20])]) ).

cnf(c_0_27,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_25]),c_0_26]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : GEO483+1 : TPTP v8.1.0. Released v7.0.0.
% 0.07/0.14  % Command  : run_ET %s %d
% 0.13/0.35  % Computer : n016.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sat Jun 18 12:23:22 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 1.19/24.21  eprover: CPU time limit exceeded, terminating
% 1.19/24.22  eprover: CPU time limit exceeded, terminating
% 1.19/24.22  eprover: CPU time limit exceeded, terminating
% 1.19/24.27  eprover: CPU time limit exceeded, terminating
% 1.24/31.43  # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 1.24/31.43  
% 1.24/31.43  # Failure: Resource limit exceeded (time)
% 1.24/31.43  # OLD status Res
% 1.24/31.43  # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 1.24/31.43  # Preprocessing time       : 0.757 s
% 1.24/31.43  # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 1.24/31.43  # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 1.24/31.43  # Preprocessing time       : 0.435 s
% 1.24/31.43  
% 1.24/31.43  # Proof found!
% 1.24/31.43  # SZS status Theorem
% 1.24/31.43  # SZS output start CNFRefutation
% See solution above
% 1.24/31.43  # Proof object total steps             : 28
% 1.24/31.43  # Proof object clause steps            : 17
% 1.24/31.43  # Proof object formula steps           : 11
% 1.24/31.43  # Proof object conjectures             : 15
% 1.24/31.43  # Proof object clause conjectures      : 12
% 1.24/31.43  # Proof object formula conjectures     : 3
% 1.24/31.43  # Proof object initial clauses used    : 7
% 1.24/31.43  # Proof object initial formulas used   : 5
% 1.24/31.43  # Proof object generating inferences   : 8
% 1.24/31.43  # Proof object simplifying inferences  : 5
% 1.24/31.43  # Training examples: 0 positive, 0 negative
% 1.24/31.43  # Parsed axioms                        : 3656
% 1.24/31.43  # Removed by relevancy pruning/SinE    : 3523
% 1.24/31.43  # Initial clauses                      : 477
% 1.24/31.43  # Removed in clause preprocessing      : 141
% 1.24/31.43  # Initial clauses in saturation        : 336
% 1.24/31.43  # Processed clauses                    : 6434
% 1.24/31.43  # ...of these trivial                  : 188
% 1.24/31.43  # ...subsumed                          : 4716
% 1.24/31.43  # ...remaining for further processing  : 1530
% 1.24/31.43  # Other redundant clauses eliminated   : 0
% 1.24/31.43  # Clauses deleted for lack of memory   : 54387
% 1.24/31.43  # Backward-subsumed                    : 33
% 1.24/31.43  # Backward-rewritten                   : 34
% 1.24/31.43  # Generated clauses                    : 182541
% 1.24/31.43  # ...of the previous two non-trivial   : 178734
% 1.24/31.43  # Contextual simplify-reflections      : 863
% 1.24/31.43  # Paramodulations                      : 182507
% 1.24/31.43  # Factorizations                       : 4
% 1.24/31.43  # Equation resolutions                 : 30
% 1.24/31.43  # Current number of processed clauses  : 1463
% 1.24/31.43  #    Positive orientable unit clauses  : 155
% 1.24/31.43  #    Positive unorientable unit clauses: 2
% 1.24/31.43  #    Negative unit clauses             : 9
% 1.24/31.43  #    Non-unit-clauses                  : 1297
% 1.24/31.43  # Current number of unprocessed clauses: 106182
% 1.24/31.43  # ...number of literals in the above   : 424241
% 1.24/31.43  # Current number of archived formulas  : 0
% 1.24/31.43  # Current number of archived clauses   : 67
% 1.24/31.43  # Clause-clause subsumption calls (NU) : 411887
% 1.24/31.43  # Rec. Clause-clause subsumption calls : 265349
% 1.24/31.43  # Non-unit clause-clause subsumptions  : 4683
% 1.24/31.43  # Unit Clause-clause subsumption calls : 7526
% 1.24/31.43  # Rewrite failures with RHS unbound    : 0
% 1.24/31.43  # BW rewrite match attempts            : 18087
% 1.24/31.43  # BW rewrite match successes           : 31
% 1.24/31.43  # Condensation attempts                : 0
% 1.24/31.43  # Condensation successes               : 0
% 1.24/31.43  # Termbank termtop insertions          : 15593784
% 1.24/31.43  
% 1.24/31.43  # -------------------------------------------------
% 1.24/31.43  # User time                : 6.397 s
% 1.24/31.43  # System time              : 0.084 s
% 1.24/31.43  # Total time               : 6.481 s
% 1.24/31.43  # Maximum resident set size: 136040 pages
% 1.24/47.23  eprover: CPU time limit exceeded, terminating
% 1.24/47.24  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/47.24  eprover: No such file or directory
% 1.24/47.25  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/47.25  eprover: No such file or directory
% 1.24/47.25  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/47.25  eprover: No such file or directory
% 1.24/47.26  eprover: CPU time limit exceeded, terminating
% 1.24/47.26  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/47.26  eprover: No such file or directory
% 1.24/47.27  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/47.27  eprover: No such file or directory
% 1.24/47.27  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/47.27  eprover: No such file or directory
% 1.24/47.27  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/47.27  eprover: No such file or directory
% 1.24/47.27  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/47.27  eprover: No such file or directory
% 1.24/47.28  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/47.28  eprover: No such file or directory
% 1.24/47.28  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/47.28  eprover: No such file or directory
% 1.24/47.28  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/47.28  eprover: No such file or directory
% 1.24/47.28  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/47.28  eprover: No such file or directory
% 1.24/47.29  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/47.29  eprover: No such file or directory
% 1.24/47.29  eprover: CPU time limit exceeded, terminating
% 1.24/47.29  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/47.29  eprover: No such file or directory
% 1.24/47.29  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/47.29  eprover: No such file or directory
% 1.24/47.29  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/47.29  eprover: No such file or directory
% 1.24/47.30  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/47.30  eprover: No such file or directory
% 1.24/47.30  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.24/47.30  eprover: No such file or directory
% 1.24/47.30  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/47.30  eprover: No such file or directory
% 1.24/47.30  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.24/47.30  eprover: No such file or directory
% 1.24/47.31  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/47.31  eprover: No such file or directory
% 1.24/47.31  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.24/47.31  eprover: No such file or directory
% 1.24/47.31  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.24/47.31  eprover: No such file or directory
% 1.24/47.31  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.24/47.31  eprover: No such file or directory
% 1.24/47.31  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.24/47.31  eprover: No such file or directory
% 1.24/47.32  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.24/47.32  eprover: No such file or directory
% 1.24/47.32  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.24/47.32  eprover: No such file or directory
% 1.24/47.32  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.24/47.32  eprover: No such file or directory
% 1.24/47.33  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.24/47.33  eprover: No such file or directory
% 1.24/47.33  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.24/47.33  eprover: No such file or directory
%------------------------------------------------------------------------------