TSTP Solution File: KLE027+2 by SInE---0.4

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : KLE027+2 : TPTP v5.0.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : Source/sine.py -e eprover -t %d %s

% Computer : art07.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 2018MB
% OS       : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sat Dec 25 11:50:39 EST 2010

% Result   : Theorem 0.57s
% Output   : CNFRefutation 0.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   83 (  46 unt;   0 def)
%            Number of atoms       :  168 ( 101 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :  151 (  66   ~;  53   |;  26   &)
%                                         (   3 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   7 con; 0-2 aty)
%            Number of variables   :  128 (   4 sgn  68   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(2,axiom,
    ! [X1] : multiplication(one,X1) = X1,
    file('/tmp/tmpuH3eba/sel_KLE027+2.p_1',multiplicative_left_identity) ).

fof(3,axiom,
    ! [X1] : addition(X1,zero) = X1,
    file('/tmp/tmpuH3eba/sel_KLE027+2.p_1',additive_identity) ).

fof(4,axiom,
    ! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
    file('/tmp/tmpuH3eba/sel_KLE027+2.p_1',left_distributivity) ).

fof(5,axiom,
    ! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
    file('/tmp/tmpuH3eba/sel_KLE027+2.p_1',additive_associativity) ).

fof(6,axiom,
    ! [X1,X2] : addition(X1,X2) = addition(X2,X1),
    file('/tmp/tmpuH3eba/sel_KLE027+2.p_1',additive_commutativity) ).

fof(7,axiom,
    ! [X1] : addition(X1,X1) = X1,
    file('/tmp/tmpuH3eba/sel_KLE027+2.p_1',additive_idempotence) ).

fof(8,axiom,
    ! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
    file('/tmp/tmpuH3eba/sel_KLE027+2.p_1',multiplicative_associativity) ).

fof(9,axiom,
    ! [X1] : multiplication(zero,X1) = zero,
    file('/tmp/tmpuH3eba/sel_KLE027+2.p_1',left_annihilation) ).

fof(11,axiom,
    ! [X4,X5] :
      ( test(X4)
     => ( c(X4) = X5
      <=> complement(X4,X5) ) ),
    file('/tmp/tmpuH3eba/sel_KLE027+2.p_1',test_3) ).

fof(12,axiom,
    ! [X4,X5] :
      ( complement(X5,X4)
    <=> ( multiplication(X4,X5) = zero
        & multiplication(X5,X4) = zero
        & addition(X4,X5) = one ) ),
    file('/tmp/tmpuH3eba/sel_KLE027+2.p_1',test_2) ).

fof(15,axiom,
    ! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
    file('/tmp/tmpuH3eba/sel_KLE027+2.p_1',right_distributivity) ).

fof(16,axiom,
    ! [X1,X2] :
      ( leq(X1,X2)
    <=> addition(X1,X2) = X2 ),
    file('/tmp/tmpuH3eba/sel_KLE027+2.p_1',order) ).

fof(17,conjecture,
    ! [X4,X5,X6,X7,X8] :
      ( ( test(X7)
        & test(X8) )
     => ( leq(addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6)),addition(multiplication(X7,X4),multiplication(c(X7),X6)))
        & leq(addition(multiplication(X7,X4),multiplication(c(X7),X6)),addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6))) ) ),
    file('/tmp/tmpuH3eba/sel_KLE027+2.p_1',goals) ).

fof(18,negated_conjecture,
    ~ ! [X4,X5,X6,X7,X8] :
        ( ( test(X7)
          & test(X8) )
       => ( leq(addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6)),addition(multiplication(X7,X4),multiplication(c(X7),X6)))
          & leq(addition(multiplication(X7,X4),multiplication(c(X7),X6)),addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6))) ) ),
    inference(assume_negation,[status(cth)],[17]) ).

fof(22,plain,
    ! [X2] : multiplication(one,X2) = X2,
    inference(variable_rename,[status(thm)],[2]) ).

cnf(23,plain,
    multiplication(one,X1) = X1,
    inference(split_conjunct,[status(thm)],[22]) ).

fof(24,plain,
    ! [X2] : addition(X2,zero) = X2,
    inference(variable_rename,[status(thm)],[3]) ).

cnf(25,plain,
    addition(X1,zero) = X1,
    inference(split_conjunct,[status(thm)],[24]) ).

fof(26,plain,
    ! [X4,X5,X6] : multiplication(addition(X4,X5),X6) = addition(multiplication(X4,X6),multiplication(X5,X6)),
    inference(variable_rename,[status(thm)],[4]) ).

cnf(27,plain,
    multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
    inference(split_conjunct,[status(thm)],[26]) ).

fof(28,plain,
    ! [X4,X5,X6] : addition(X6,addition(X5,X4)) = addition(addition(X6,X5),X4),
    inference(variable_rename,[status(thm)],[5]) ).

cnf(29,plain,
    addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
    inference(split_conjunct,[status(thm)],[28]) ).

fof(30,plain,
    ! [X3,X4] : addition(X3,X4) = addition(X4,X3),
    inference(variable_rename,[status(thm)],[6]) ).

cnf(31,plain,
    addition(X1,X2) = addition(X2,X1),
    inference(split_conjunct,[status(thm)],[30]) ).

fof(32,plain,
    ! [X2] : addition(X2,X2) = X2,
    inference(variable_rename,[status(thm)],[7]) ).

cnf(33,plain,
    addition(X1,X1) = X1,
    inference(split_conjunct,[status(thm)],[32]) ).

fof(34,plain,
    ! [X4,X5,X6] : multiplication(X4,multiplication(X5,X6)) = multiplication(multiplication(X4,X5),X6),
    inference(variable_rename,[status(thm)],[8]) ).

cnf(35,plain,
    multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
    inference(split_conjunct,[status(thm)],[34]) ).

fof(36,plain,
    ! [X2] : multiplication(zero,X2) = zero,
    inference(variable_rename,[status(thm)],[9]) ).

cnf(37,plain,
    multiplication(zero,X1) = zero,
    inference(split_conjunct,[status(thm)],[36]) ).

fof(41,plain,
    ! [X4,X5] :
      ( ~ test(X4)
      | ( ( c(X4) != X5
          | complement(X4,X5) )
        & ( ~ complement(X4,X5)
          | c(X4) = X5 ) ) ),
    inference(fof_nnf,[status(thm)],[11]) ).

fof(42,plain,
    ! [X6,X7] :
      ( ~ test(X6)
      | ( ( c(X6) != X7
          | complement(X6,X7) )
        & ( ~ complement(X6,X7)
          | c(X6) = X7 ) ) ),
    inference(variable_rename,[status(thm)],[41]) ).

fof(43,plain,
    ! [X6,X7] :
      ( ( c(X6) != X7
        | complement(X6,X7)
        | ~ test(X6) )
      & ( ~ complement(X6,X7)
        | c(X6) = X7
        | ~ test(X6) ) ),
    inference(distribute,[status(thm)],[42]) ).

cnf(45,plain,
    ( complement(X1,X2)
    | ~ test(X1)
    | c(X1) != X2 ),
    inference(split_conjunct,[status(thm)],[43]) ).

fof(46,plain,
    ! [X4,X5] :
      ( ( ~ complement(X5,X4)
        | ( multiplication(X4,X5) = zero
          & multiplication(X5,X4) = zero
          & addition(X4,X5) = one ) )
      & ( multiplication(X4,X5) != zero
        | multiplication(X5,X4) != zero
        | addition(X4,X5) != one
        | complement(X5,X4) ) ),
    inference(fof_nnf,[status(thm)],[12]) ).

fof(47,plain,
    ! [X6,X7] :
      ( ( ~ complement(X7,X6)
        | ( multiplication(X6,X7) = zero
          & multiplication(X7,X6) = zero
          & addition(X6,X7) = one ) )
      & ( multiplication(X6,X7) != zero
        | multiplication(X7,X6) != zero
        | addition(X6,X7) != one
        | complement(X7,X6) ) ),
    inference(variable_rename,[status(thm)],[46]) ).

fof(48,plain,
    ! [X6,X7] :
      ( ( multiplication(X6,X7) = zero
        | ~ complement(X7,X6) )
      & ( multiplication(X7,X6) = zero
        | ~ complement(X7,X6) )
      & ( addition(X6,X7) = one
        | ~ complement(X7,X6) )
      & ( multiplication(X6,X7) != zero
        | multiplication(X7,X6) != zero
        | addition(X6,X7) != one
        | complement(X7,X6) ) ),
    inference(distribute,[status(thm)],[47]) ).

cnf(50,plain,
    ( addition(X2,X1) = one
    | ~ complement(X1,X2) ),
    inference(split_conjunct,[status(thm)],[48]) ).

cnf(51,plain,
    ( multiplication(X1,X2) = zero
    | ~ complement(X1,X2) ),
    inference(split_conjunct,[status(thm)],[48]) ).

cnf(52,plain,
    ( multiplication(X2,X1) = zero
    | ~ complement(X1,X2) ),
    inference(split_conjunct,[status(thm)],[48]) ).

fof(61,plain,
    ! [X4,X5,X6] : multiplication(X4,addition(X5,X6)) = addition(multiplication(X4,X5),multiplication(X4,X6)),
    inference(variable_rename,[status(thm)],[15]) ).

cnf(62,plain,
    multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
    inference(split_conjunct,[status(thm)],[61]) ).

fof(63,plain,
    ! [X1,X2] :
      ( ( ~ leq(X1,X2)
        | addition(X1,X2) = X2 )
      & ( addition(X1,X2) != X2
        | leq(X1,X2) ) ),
    inference(fof_nnf,[status(thm)],[16]) ).

fof(64,plain,
    ! [X3,X4] :
      ( ( ~ leq(X3,X4)
        | addition(X3,X4) = X4 )
      & ( addition(X3,X4) != X4
        | leq(X3,X4) ) ),
    inference(variable_rename,[status(thm)],[63]) ).

cnf(65,plain,
    ( leq(X1,X2)
    | addition(X1,X2) != X2 ),
    inference(split_conjunct,[status(thm)],[64]) ).

fof(67,negated_conjecture,
    ? [X4,X5,X6,X7,X8] :
      ( test(X7)
      & test(X8)
      & ( ~ leq(addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6)),addition(multiplication(X7,X4),multiplication(c(X7),X6)))
        | ~ leq(addition(multiplication(X7,X4),multiplication(c(X7),X6)),addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6))) ) ),
    inference(fof_nnf,[status(thm)],[18]) ).

fof(68,negated_conjecture,
    ? [X9,X10,X11,X12,X13] :
      ( test(X12)
      & test(X13)
      & ( ~ leq(addition(multiplication(X12,addition(multiplication(X12,X9),multiplication(c(X12),X10))),multiplication(c(X12),X11)),addition(multiplication(X12,X9),multiplication(c(X12),X11)))
        | ~ leq(addition(multiplication(X12,X9),multiplication(c(X12),X11)),addition(multiplication(X12,addition(multiplication(X12,X9),multiplication(c(X12),X10))),multiplication(c(X12),X11))) ) ),
    inference(variable_rename,[status(thm)],[67]) ).

fof(69,negated_conjecture,
    ( test(esk5_0)
    & test(esk6_0)
    & ( ~ leq(addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)))
      | ~ leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0))) ) ),
    inference(skolemize,[status(esa)],[68]) ).

cnf(70,negated_conjecture,
    ( ~ leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)))
    | ~ leq(addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0))) ),
    inference(split_conjunct,[status(thm)],[69]) ).

cnf(72,negated_conjecture,
    test(esk5_0),
    inference(split_conjunct,[status(thm)],[69]) ).

cnf(84,negated_conjecture,
    ( complement(esk5_0,X1)
    | c(esk5_0) != X1 ),
    inference(spm,[status(thm)],[45,72,theory(equality)]) ).

cnf(106,plain,
    addition(X1,X2) = addition(X1,addition(X1,X2)),
    inference(spm,[status(thm)],[29,33,theory(equality)]) ).

cnf(110,plain,
    addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
    inference(spm,[status(thm)],[31,29,theory(equality)]) ).

cnf(130,plain,
    addition(multiplication(X1,addition(X2,X3)),X4) = addition(multiplication(X1,X2),addition(multiplication(X1,X3),X4)),
    inference(spm,[status(thm)],[29,62,theory(equality)]) ).

cnf(187,negated_conjecture,
    ( ~ leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))))
    | ~ leq(addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0))) ),
    inference(rw,[status(thm)],[70,31,theory(equality)]) ).

cnf(188,negated_conjecture,
    ( ~ leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))))
    | ~ leq(addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0))) ),
    inference(rw,[status(thm)],[187,31,theory(equality)]) ).

cnf(189,negated_conjecture,
    ( ~ leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))))
    | addition(addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0))) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)) ),
    inference(spm,[status(thm)],[188,65,theory(equality)]) ).

cnf(190,negated_conjecture,
    ( ~ leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))))
    | addition(multiplication(c(esk5_0),esk4_0),addition(multiplication(esk5_0,esk2_0),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))))) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[189,29,theory(equality)]),31,theory(equality)]),29,theory(equality)]) ).

cnf(198,negated_conjecture,
    ( addition(multiplication(c(esk5_0),esk4_0),addition(multiplication(esk5_0,esk2_0),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))))) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0))
    | addition(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))))) != addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))) ),
    inference(spm,[status(thm)],[190,65,theory(equality)]) ).

cnf(199,negated_conjecture,
    ( addition(multiplication(c(esk5_0),esk4_0),addition(multiplication(esk5_0,esk2_0),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))))) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0))
    | addition(multiplication(esk5_0,esk2_0),addition(multiplication(c(esk5_0),esk4_0),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))))) != addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))) ),
    inference(rw,[status(thm)],[198,29,theory(equality)]) ).

cnf(201,negated_conjecture,
    ( multiplication(X1,esk5_0) = zero
    | c(esk5_0) != X1 ),
    inference(spm,[status(thm)],[52,84,theory(equality)]) ).

cnf(202,negated_conjecture,
    ( multiplication(esk5_0,X1) = zero
    | c(esk5_0) != X1 ),
    inference(spm,[status(thm)],[51,84,theory(equality)]) ).

cnf(203,negated_conjecture,
    ( addition(X1,esk5_0) = one
    | c(esk5_0) != X1 ),
    inference(spm,[status(thm)],[50,84,theory(equality)]) ).

cnf(208,negated_conjecture,
    multiplication(c(esk5_0),esk5_0) = zero,
    inference(er,[status(thm)],[201,theory(equality)]) ).

cnf(213,negated_conjecture,
    addition(multiplication(X1,esk5_0),zero) = multiplication(addition(X1,c(esk5_0)),esk5_0),
    inference(spm,[status(thm)],[27,208,theory(equality)]) ).

cnf(218,negated_conjecture,
    multiplication(X1,esk5_0) = multiplication(addition(X1,c(esk5_0)),esk5_0),
    inference(rw,[status(thm)],[213,25,theory(equality)]) ).

cnf(307,negated_conjecture,
    ( addition(multiplication(esk5_0,esk2_0),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))))) != addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))))
    | addition(multiplication(c(esk5_0),esk4_0),addition(multiplication(esk5_0,esk2_0),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))))) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)) ),
    inference(rw,[status(thm)],[199,106,theory(equality)]) ).

cnf(531,negated_conjecture,
    multiplication(esk5_0,c(esk5_0)) = zero,
    inference(er,[status(thm)],[202,theory(equality)]) ).

cnf(534,negated_conjecture,
    multiplication(zero,X1) = multiplication(esk5_0,multiplication(c(esk5_0),X1)),
    inference(spm,[status(thm)],[35,531,theory(equality)]) ).

cnf(541,negated_conjecture,
    zero = multiplication(esk5_0,multiplication(c(esk5_0),X1)),
    inference(rw,[status(thm)],[534,37,theory(equality)]) ).

cnf(559,negated_conjecture,
    addition(c(esk5_0),esk5_0) = one,
    inference(er,[status(thm)],[203,theory(equality)]) ).

cnf(561,negated_conjecture,
    addition(esk5_0,c(esk5_0)) = one,
    inference(rw,[status(thm)],[559,31,theory(equality)]) ).

cnf(602,negated_conjecture,
    addition(multiplication(esk5_0,X1),zero) = multiplication(esk5_0,addition(X1,multiplication(c(esk5_0),X2))),
    inference(spm,[status(thm)],[62,541,theory(equality)]) ).

cnf(615,negated_conjecture,
    multiplication(esk5_0,X1) = multiplication(esk5_0,addition(X1,multiplication(c(esk5_0),X2))),
    inference(rw,[status(thm)],[602,25,theory(equality)]) ).

cnf(684,negated_conjecture,
    ( addition(multiplication(esk5_0,esk2_0),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))))) != addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))))
    | addition(multiplication(esk5_0,esk2_0),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))))) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[307,110,theory(equality)]),29,theory(equality)]),31,theory(equality)]),106,theory(equality)]) ).

cnf(976,negated_conjecture,
    multiplication(one,esk5_0) = multiplication(esk5_0,esk5_0),
    inference(spm,[status(thm)],[218,561,theory(equality)]) ).

cnf(987,negated_conjecture,
    esk5_0 = multiplication(esk5_0,esk5_0),
    inference(rw,[status(thm)],[976,23,theory(equality)]) ).

cnf(992,negated_conjecture,
    multiplication(esk5_0,X1) = multiplication(esk5_0,multiplication(esk5_0,X1)),
    inference(spm,[status(thm)],[35,987,theory(equality)]) ).

cnf(11811,negated_conjecture,
    ( addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)) != addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))))
    | addition(multiplication(esk5_0,esk2_0),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))))) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[684,615,theory(equality)]),992,theory(equality)]),31,theory(equality)]),130,theory(equality)]),33,theory(equality)]) ).

cnf(11812,negated_conjecture,
    ( $false
    | addition(multiplication(esk5_0,esk2_0),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))))) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[11811,615,theory(equality)]),992,theory(equality)]),31,theory(equality)]) ).

cnf(11813,negated_conjecture,
    ( $false
    | $false ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[11812,615,theory(equality)]),992,theory(equality)]),31,theory(equality)]),130,theory(equality)]),33,theory(equality)]) ).

cnf(11814,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[11813,theory(equality)]) ).

cnf(11815,negated_conjecture,
    $false,
    11814,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE027+2.p
% --creating new selector for [KLE001+0.ax, KLE001+1.ax]
% -running prover on /tmp/tmpuH3eba/sel_KLE027+2.p_1 with time limit 29
% -prover status Theorem
% Problem KLE027+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE027+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE027+2.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
% 
%------------------------------------------------------------------------------