TSTP Solution File: GRP667+6 by SInE---0.4

View Problem - Process Solution

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

% Computer : art11.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory   : 2006MB
% OS       : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sat Dec 25 11:26:47 EST 2010

% Result   : Theorem 9.93s
% Output   : CNFRefutation 9.93s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   32
%            Number of leaves      :   10
% Syntax   : Number of formulae    :  108 ( 103 unt;   0 def)
%            Number of atoms       :  123 ( 120 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   29 (  14   ~;   6   |;   9   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   2 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;  13 con; 0-2 aty)
%            Number of variables   :  253 (   0 sgn  56   !;  24   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ! [X1] : mult(X1,unit) = X1,
    file('/tmp/tmpRIdNdk/sel_GRP667+6.p_1',f05) ).

fof(2,axiom,
    ! [X2,X1] : rd(mult(X1,X2),X2) = X1,
    file('/tmp/tmpRIdNdk/sel_GRP667+6.p_1',f04) ).

fof(3,axiom,
    ! [X3,X2,X1] : mult(mult(X1,X2),mult(mult(X3,X2),X3)) = mult(mult(X1,mult(mult(X2,X3),X2)),X3),
    file('/tmp/tmpRIdNdk/sel_GRP667+6.p_1',f07) ).

fof(4,axiom,
    ! [X1] : mult(unit,X1) = X1,
    file('/tmp/tmpRIdNdk/sel_GRP667+6.p_1',f06) ).

fof(5,axiom,
    ! [X2,X1] : mult(X1,ld(X1,X2)) = X2,
    file('/tmp/tmpRIdNdk/sel_GRP667+6.p_1',f01) ).

fof(6,conjecture,
    ( ! [X4,X5,X6] : mult(X6,mult(X4,mult(X6,X5))) = mult(mult(mult(X6,X4),X6),X5)
    | ! [X7,X8,X9] : mult(X7,mult(X9,mult(X8,X9))) = mult(mult(mult(X7,X9),X8),X9)
    | ! [X10,X11,X12] : mult(mult(X12,X10),mult(X11,X12)) = mult(mult(X12,mult(X10,X11)),X12)
    | ! [X13,X14,X15] : mult(mult(X15,X13),mult(X14,X15)) = mult(X15,mult(mult(X13,X14),X15)) ),
    file('/tmp/tmpRIdNdk/sel_GRP667+6.p_1',goals) ).

fof(7,axiom,
    ! [X2,X1] : mult(rd(X1,X2),X2) = X1,
    file('/tmp/tmpRIdNdk/sel_GRP667+6.p_1',f03) ).

fof(8,axiom,
    ! [X2,X1] : ld(X1,mult(X1,X2)) = X2,
    file('/tmp/tmpRIdNdk/sel_GRP667+6.p_1',f02) ).

fof(9,axiom,
    ! [X1] : mult(f(X1),f(X1)) = X1,
    file('/tmp/tmpRIdNdk/sel_GRP667+6.p_1',f09) ).

fof(10,axiom,
    ! [X2,X1] : mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
    file('/tmp/tmpRIdNdk/sel_GRP667+6.p_1',f08) ).

fof(11,negated_conjecture,
    ~ ( ! [X4,X5,X6] : mult(X6,mult(X4,mult(X6,X5))) = mult(mult(mult(X6,X4),X6),X5)
      | ! [X7,X8,X9] : mult(X7,mult(X9,mult(X8,X9))) = mult(mult(mult(X7,X9),X8),X9)
      | ! [X10,X11,X12] : mult(mult(X12,X10),mult(X11,X12)) = mult(mult(X12,mult(X10,X11)),X12)
      | ! [X13,X14,X15] : mult(mult(X15,X13),mult(X14,X15)) = mult(X15,mult(mult(X13,X14),X15)) ),
    inference(assume_negation,[status(cth)],[6]) ).

fof(12,plain,
    ! [X2] : mult(X2,unit) = X2,
    inference(variable_rename,[status(thm)],[1]) ).

cnf(13,plain,
    mult(X1,unit) = X1,
    inference(split_conjunct,[status(thm)],[12]) ).

fof(14,plain,
    ! [X3,X4] : rd(mult(X4,X3),X3) = X4,
    inference(variable_rename,[status(thm)],[2]) ).

cnf(15,plain,
    rd(mult(X1,X2),X2) = X1,
    inference(split_conjunct,[status(thm)],[14]) ).

fof(16,plain,
    ! [X4,X5,X6] : mult(mult(X6,X5),mult(mult(X4,X5),X4)) = mult(mult(X6,mult(mult(X5,X4),X5)),X4),
    inference(variable_rename,[status(thm)],[3]) ).

cnf(17,plain,
    mult(mult(X1,X2),mult(mult(X3,X2),X3)) = mult(mult(X1,mult(mult(X2,X3),X2)),X3),
    inference(split_conjunct,[status(thm)],[16]) ).

fof(18,plain,
    ! [X2] : mult(unit,X2) = X2,
    inference(variable_rename,[status(thm)],[4]) ).

cnf(19,plain,
    mult(unit,X1) = X1,
    inference(split_conjunct,[status(thm)],[18]) ).

fof(20,plain,
    ! [X3,X4] : mult(X4,ld(X4,X3)) = X3,
    inference(variable_rename,[status(thm)],[5]) ).

cnf(21,plain,
    mult(X1,ld(X1,X2)) = X2,
    inference(split_conjunct,[status(thm)],[20]) ).

fof(22,negated_conjecture,
    ( ? [X4,X5,X6] : mult(X6,mult(X4,mult(X6,X5))) != mult(mult(mult(X6,X4),X6),X5)
    & ? [X7,X8,X9] : mult(X7,mult(X9,mult(X8,X9))) != mult(mult(mult(X7,X9),X8),X9)
    & ? [X10,X11,X12] : mult(mult(X12,X10),mult(X11,X12)) != mult(mult(X12,mult(X10,X11)),X12)
    & ? [X13,X14,X15] : mult(mult(X15,X13),mult(X14,X15)) != mult(X15,mult(mult(X13,X14),X15)) ),
    inference(fof_nnf,[status(thm)],[11]) ).

fof(23,negated_conjecture,
    ( ? [X16,X17,X18] : mult(X18,mult(X16,mult(X18,X17))) != mult(mult(mult(X18,X16),X18),X17)
    & ? [X19,X20,X21] : mult(X19,mult(X21,mult(X20,X21))) != mult(mult(mult(X19,X21),X20),X21)
    & ? [X22,X23,X24] : mult(mult(X24,X22),mult(X23,X24)) != mult(mult(X24,mult(X22,X23)),X24)
    & ? [X25,X26,X27] : mult(mult(X27,X25),mult(X26,X27)) != mult(X27,mult(mult(X25,X26),X27)) ),
    inference(variable_rename,[status(thm)],[22]) ).

fof(24,negated_conjecture,
    ( mult(esk3_0,mult(esk1_0,mult(esk3_0,esk2_0))) != mult(mult(mult(esk3_0,esk1_0),esk3_0),esk2_0)
    & mult(esk4_0,mult(esk6_0,mult(esk5_0,esk6_0))) != mult(mult(mult(esk4_0,esk6_0),esk5_0),esk6_0)
    & mult(mult(esk9_0,esk7_0),mult(esk8_0,esk9_0)) != mult(mult(esk9_0,mult(esk7_0,esk8_0)),esk9_0)
    & mult(mult(esk12_0,esk10_0),mult(esk11_0,esk12_0)) != mult(esk12_0,mult(mult(esk10_0,esk11_0),esk12_0)) ),
    inference(skolemize,[status(esa)],[23]) ).

cnf(27,negated_conjecture,
    mult(esk4_0,mult(esk6_0,mult(esk5_0,esk6_0))) != mult(mult(mult(esk4_0,esk6_0),esk5_0),esk6_0),
    inference(split_conjunct,[status(thm)],[24]) ).

fof(29,plain,
    ! [X3,X4] : mult(rd(X4,X3),X3) = X4,
    inference(variable_rename,[status(thm)],[7]) ).

cnf(30,plain,
    mult(rd(X1,X2),X2) = X1,
    inference(split_conjunct,[status(thm)],[29]) ).

fof(31,plain,
    ! [X3,X4] : ld(X4,mult(X4,X3)) = X3,
    inference(variable_rename,[status(thm)],[8]) ).

cnf(32,plain,
    ld(X1,mult(X1,X2)) = X2,
    inference(split_conjunct,[status(thm)],[31]) ).

fof(33,plain,
    ! [X2] : mult(f(X2),f(X2)) = X2,
    inference(variable_rename,[status(thm)],[9]) ).

cnf(34,plain,
    mult(f(X1),f(X1)) = X1,
    inference(split_conjunct,[status(thm)],[33]) ).

fof(35,plain,
    ! [X3,X4] : mult(mult(X4,X3),X4) = mult(X4,mult(X3,X4)),
    inference(variable_rename,[status(thm)],[10]) ).

cnf(36,plain,
    mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
    inference(split_conjunct,[status(thm)],[35]) ).

cnf(38,plain,
    ld(X1,X1) = unit,
    inference(spm,[status(thm)],[32,13,theory(equality)]) ).

cnf(42,plain,
    ld(rd(X1,X2),X1) = X2,
    inference(spm,[status(thm)],[32,30,theory(equality)]) ).

cnf(51,plain,
    mult(X2,X1) = mult(X1,mult(ld(X1,X2),X1)),
    inference(spm,[status(thm)],[36,21,theory(equality)]) ).

cnf(53,plain,
    mult(X1,rd(X1,X2)) = mult(rd(X1,X2),mult(X2,rd(X1,X2))),
    inference(spm,[status(thm)],[36,30,theory(equality)]) ).

cnf(54,plain,
    rd(mult(X1,mult(X2,X1)),X1) = mult(X1,X2),
    inference(spm,[status(thm)],[15,36,theory(equality)]) ).

cnf(64,plain,
    mult(mult(X1,mult(X2,mult(X3,X2))),X3) = mult(mult(X1,X2),mult(mult(X3,X2),X3)),
    inference(rw,[status(thm)],[17,36,theory(equality)]) ).

cnf(65,plain,
    mult(mult(X1,mult(X2,mult(X3,X2))),X3) = mult(mult(X1,X2),mult(X3,mult(X2,X3))),
    inference(rw,[status(thm)],[64,36,theory(equality)]) ).

cnf(66,plain,
    mult(mult(X1,X2),mult(unit,mult(X2,unit))) = mult(X1,mult(X2,mult(unit,X2))),
    inference(spm,[status(thm)],[13,65,theory(equality)]) ).

cnf(70,plain,
    mult(mult(X1,mult(X2,X1)),X2) = mult(mult(unit,X1),mult(X2,mult(X1,X2))),
    inference(spm,[status(thm)],[65,19,theory(equality)]) ).

cnf(72,plain,
    mult(mult(X1,mult(ld(X2,X3),X3)),X2) = mult(mult(X1,ld(X2,X3)),mult(X2,mult(ld(X2,X3),X2))),
    inference(spm,[status(thm)],[65,21,theory(equality)]) ).

cnf(74,plain,
    mult(mult(X1,mult(X2,X3)),rd(X3,X2)) = mult(mult(X1,X2),mult(rd(X3,X2),mult(X2,rd(X3,X2)))),
    inference(spm,[status(thm)],[65,30,theory(equality)]) ).

cnf(76,plain,
    rd(mult(mult(X1,X2),mult(X3,mult(X2,X3))),X3) = mult(X1,mult(X2,mult(X3,X2))),
    inference(spm,[status(thm)],[15,65,theory(equality)]) ).

cnf(83,plain,
    mult(mult(X1,X2),X2) = mult(X1,mult(X2,mult(unit,X2))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[66,13,theory(equality)]),19,theory(equality)]) ).

cnf(84,plain,
    mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)),
    inference(rw,[status(thm)],[83,19,theory(equality)]) ).

cnf(91,plain,
    mult(mult(X1,mult(X2,X1)),X2) = mult(X1,mult(X2,mult(X1,X2))),
    inference(rw,[status(thm)],[70,19,theory(equality)]) ).

cnf(142,plain,
    mult(X2,ld(X1,X2)) = mult(X1,mult(ld(X1,X2),ld(X1,X2))),
    inference(spm,[status(thm)],[84,21,theory(equality)]) ).

cnf(144,plain,
    mult(X1,X2) = mult(rd(X1,X2),mult(X2,X2)),
    inference(spm,[status(thm)],[84,30,theory(equality)]) ).

cnf(145,plain,
    rd(mult(X1,mult(X2,X2)),X2) = mult(X1,X2),
    inference(spm,[status(thm)],[15,84,theory(equality)]) ).

cnf(180,plain,
    ld(X1,mult(X2,X1)) = mult(ld(X1,X2),X1),
    inference(spm,[status(thm)],[32,51,theory(equality)]) ).

cnf(276,plain,
    ld(X1,X1) = mult(ld(X1,unit),X1),
    inference(spm,[status(thm)],[180,19,theory(equality)]) ).

cnf(281,plain,
    ld(X1,X2) = mult(ld(X1,rd(X2,X1)),X1),
    inference(spm,[status(thm)],[180,30,theory(equality)]) ).

cnf(296,plain,
    unit = mult(ld(X1,unit),X1),
    inference(rw,[status(thm)],[276,38,theory(equality)]) ).

cnf(530,plain,
    rd(mult(X1,X2),X1) = mult(X1,rd(X2,X1)),
    inference(spm,[status(thm)],[54,30,theory(equality)]) ).

cnf(680,plain,
    rd(mult(X1,mult(X2,X2)),mult(X1,X2)) = mult(mult(X1,X2),rd(X2,mult(X1,X2))),
    inference(spm,[status(thm)],[530,84,theory(equality)]) ).

cnf(720,plain,
    ld(rd(X1,X2),mult(X1,X2)) = mult(X2,X2),
    inference(spm,[status(thm)],[32,144,theory(equality)]) ).

cnf(756,plain,
    rd(mult(X1,X2),f(X2)) = mult(X1,f(X2)),
    inference(spm,[status(thm)],[145,34,theory(equality)]) ).

cnf(792,plain,
    rd(ld(X1,X2),X1) = ld(X1,rd(X2,X1)),
    inference(spm,[status(thm)],[15,281,theory(equality)]) ).

cnf(794,plain,
    mult(ld(X1,X2),ld(X1,rd(X2,X1))) = mult(ld(X1,rd(X2,X1)),mult(X1,ld(X1,rd(X2,X1)))),
    inference(spm,[status(thm)],[36,281,theory(equality)]) ).

cnf(795,plain,
    mult(mult(X1,mult(X2,ld(X2,X3))),ld(X2,rd(X3,X2))) = mult(mult(X1,X2),mult(ld(X2,rd(X3,X2)),mult(X2,ld(X2,rd(X3,X2))))),
    inference(spm,[status(thm)],[65,281,theory(equality)]) ).

cnf(818,plain,
    mult(ld(X1,X2),ld(X1,rd(X2,X1))) = mult(ld(X1,rd(X2,X1)),rd(X2,X1)),
    inference(rw,[status(thm)],[794,21,theory(equality)]) ).

cnf(819,plain,
    mult(mult(X1,X3),ld(X2,rd(X3,X2))) = mult(mult(X1,X2),mult(ld(X2,rd(X3,X2)),mult(X2,ld(X2,rd(X3,X2))))),
    inference(rw,[status(thm)],[795,21,theory(equality)]) ).

cnf(820,plain,
    mult(mult(X1,X3),ld(X2,rd(X3,X2))) = mult(mult(X1,X2),mult(ld(X2,rd(X3,X2)),rd(X3,X2))),
    inference(rw,[status(thm)],[819,21,theory(equality)]) ).

cnf(1170,plain,
    ld(rd(X1,ld(X1,X2)),X2) = mult(ld(X1,X2),ld(X1,X2)),
    inference(spm,[status(thm)],[720,21,theory(equality)]) ).

cnf(1349,plain,
    ld(mult(X1,f(X2)),mult(X1,X2)) = f(X2),
    inference(spm,[status(thm)],[42,756,theory(equality)]) ).

cnf(1402,plain,
    mult(mult(ld(X1,X2),X2),X1) = mult(ld(X1,X2),mult(X1,mult(ld(X1,X2),X1))),
    inference(spm,[status(thm)],[91,21,theory(equality)]) ).

cnf(1453,plain,
    mult(mult(ld(X1,X2),X2),X1) = mult(ld(X1,X2),mult(X2,X1)),
    inference(rw,[status(thm)],[1402,51,theory(equality)]) ).

cnf(2200,plain,
    mult(mult(X1,ld(X2,X3)),mult(X3,X2)) = mult(mult(X1,mult(ld(X2,X3),X3)),X2),
    inference(rw,[status(thm)],[72,51,theory(equality)]) ).

cnf(3426,plain,
    mult(mult(X1,X2),mult(X3,rd(X3,X2))) = mult(mult(X1,mult(X2,X3)),rd(X3,X2)),
    inference(rw,[status(thm)],[74,53,theory(equality)]) ).

cnf(4595,plain,
    rd(mult(unit,mult(X2,mult(X1,X2))),X2) = mult(ld(X1,unit),mult(X1,mult(X2,X1))),
    inference(spm,[status(thm)],[76,296,theory(equality)]) ).

cnf(4697,plain,
    mult(X2,X1) = mult(ld(X1,unit),mult(X1,mult(X2,X1))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[4595,19,theory(equality)]),530,theory(equality)]),15,theory(equality)]) ).

cnf(15116,plain,
    mult(ld(X1,unit),mult(X1,ld(X1,X2))) = ld(X1,X2),
    inference(spm,[status(thm)],[4697,281,theory(equality)]) ).

cnf(15264,plain,
    mult(ld(X1,unit),X2) = ld(X1,X2),
    inference(rw,[status(thm)],[15116,21,theory(equality)]) ).

cnf(15341,plain,
    rd(ld(X1,X2),X2) = ld(X1,unit),
    inference(spm,[status(thm)],[15,15264,theory(equality)]) ).

cnf(15350,plain,
    mult(ld(X1,X2),X2) = mult(ld(X1,unit),mult(X2,X2)),
    inference(spm,[status(thm)],[84,15264,theory(equality)]) ).

cnf(15553,plain,
    mult(ld(X1,X2),X2) = ld(X1,mult(X2,X2)),
    inference(rw,[status(thm)],[15350,15264,theory(equality)]) ).

cnf(15764,plain,
    rd(X2,mult(X1,X2)) = ld(X1,unit),
    inference(spm,[status(thm)],[15341,32,theory(equality)]) ).

cnf(15770,plain,
    rd(X2,X1) = ld(rd(X1,X2),unit),
    inference(spm,[status(thm)],[15341,42,theory(equality)]) ).

cnf(17231,plain,
    mult(rd(X2,X1),X3) = ld(rd(X1,X2),X3),
    inference(spm,[status(thm)],[15264,15770,theory(equality)]) ).

cnf(17294,plain,
    mult(X1,mult(ld(X1,X2),X2)) = mult(X2,X2),
    inference(spm,[status(thm)],[21,15553,theory(equality)]) ).

cnf(17597,plain,
    mult(ld(X1,rd(X2,X1)),X2) = mult(ld(X1,X2),ld(X1,X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[1170,17231,theory(equality)]),792,theory(equality)]) ).

cnf(19933,plain,
    mult(mult(X2,X2),X1) = mult(mult(X1,ld(X1,X2)),mult(X2,X1)),
    inference(spm,[status(thm)],[2200,17294,theory(equality)]) ).

cnf(20062,plain,
    mult(mult(X2,X2),X1) = mult(X2,mult(X2,X1)),
    inference(rw,[status(thm)],[19933,21,theory(equality)]) ).

cnf(20170,plain,
    mult(X1,X2) = mult(f(X1),mult(f(X1),X2)),
    inference(spm,[status(thm)],[20062,34,theory(equality)]) ).

cnf(20185,plain,
    ld(X1,mult(X2,mult(X2,X1))) = mult(ld(X1,mult(X2,X2)),X1),
    inference(spm,[status(thm)],[180,20062,theory(equality)]) ).

cnf(20372,plain,
    ld(X1,mult(X2,mult(X2,X1))) = mult(ld(X1,X2),mult(X2,X1)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[20185,15553,theory(equality)]),1453,theory(equality)]) ).

cnf(43925,plain,
    ld(X1,mult(rd(X2,X1),X2)) = mult(ld(X1,rd(X2,X1)),X2),
    inference(spm,[status(thm)],[20372,30,theory(equality)]) ).

cnf(44079,plain,
    ld(X1,mult(rd(X2,X1),X2)) = mult(ld(X1,X2),ld(X1,X2)),
    inference(rw,[status(thm)],[43925,17597,theory(equality)]) ).

cnf(54880,plain,
    mult(X1,mult(ld(X1,X2),ld(X1,X2))) = mult(rd(X2,X1),X2),
    inference(spm,[status(thm)],[21,44079,theory(equality)]) ).

cnf(55039,plain,
    mult(X2,ld(X1,X2)) = mult(rd(X2,X1),X2),
    inference(rw,[status(thm)],[54880,142,theory(equality)]) ).

cnf(55214,plain,
    rd(mult(X1,ld(X2,X1)),X1) = rd(X1,X2),
    inference(spm,[status(thm)],[15,55039,theory(equality)]) ).

cnf(55440,plain,
    mult(X1,ld(X2,unit)) = rd(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[55214,530,theory(equality)]),15341,theory(equality)]) ).

cnf(55577,plain,
    ld(X1,rd(X1,X2)) = ld(X2,unit),
    inference(spm,[status(thm)],[32,55440,theory(equality)]) ).

cnf(55714,plain,
    mult(f(X1),rd(f(X1),X2)) = mult(X1,ld(X2,unit)),
    inference(spm,[status(thm)],[20170,55440,theory(equality)]) ).

cnf(56015,plain,
    mult(f(X1),rd(f(X1),X2)) = rd(X1,X2),
    inference(rw,[status(thm)],[55714,55440,theory(equality)]) ).

cnf(56129,plain,
    ld(mult(X1,X2),mult(X1,rd(X2,X1))) = ld(X1,unit),
    inference(spm,[status(thm)],[55577,530,theory(equality)]) ).

cnf(74360,plain,
    rd(mult(X1,mult(X2,X2)),mult(X1,X2)) = mult(X1,rd(X2,X1)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[680,15764,theory(equality)]),55440,theory(equality)]),530,theory(equality)]) ).

cnf(74366,plain,
    rd(mult(X1,X2),mult(X1,f(X2))) = mult(X1,rd(f(X2),X1)),
    inference(spm,[status(thm)],[74360,34,theory(equality)]) ).

cnf(108722,plain,
    mult(mult(X1,X2),mult(ld(X2,X3),ld(X2,rd(X3,X2)))) = mult(mult(X1,X3),ld(X2,rd(X3,X2))),
    inference(rw,[status(thm)],[820,818,theory(equality)]) ).

cnf(261414,plain,
    mult(mult(X1,mult(X2,f(X3))),mult(ld(mult(X2,f(X3)),mult(X2,X3)),ld(mult(X2,f(X3)),mult(X2,rd(f(X3),X2))))) = mult(mult(X1,mult(X2,X3)),ld(mult(X2,f(X3)),mult(X2,rd(f(X3),X2)))),
    inference(spm,[status(thm)],[108722,74366,theory(equality)]) ).

cnf(261908,plain,
    mult(mult(X1,X2),rd(X3,X2)) = mult(mult(X1,mult(X2,X3)),ld(mult(X2,f(X3)),mult(X2,rd(f(X3),X2)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[261414,1349,theory(equality)]),56129,theory(equality)]),55440,theory(equality)]),3426,theory(equality)]),56015,theory(equality)]) ).

cnf(261909,plain,
    mult(mult(X1,X2),rd(X3,X2)) = rd(mult(X1,mult(X2,X3)),X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[261908,56129,theory(equality)]),55440,theory(equality)]) ).

cnf(262786,plain,
    mult(mult(mult(X1,X2),X3),X2) = mult(X1,mult(X2,mult(X3,X2))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[76,261909,theory(equality)]),15,theory(equality)]) ).

cnf(264117,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[27,262786,theory(equality)]) ).

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

cnf(264119,negated_conjecture,
    $false,
    264118,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
%   from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/GRP/GRP667+6.p
% --creating new selector for []
% -running prover on /tmp/tmpRIdNdk/sel_GRP667+6.p_1 with time limit 29
% -prover status Theorem
% Problem GRP667+6.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/GRP/GRP667+6.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/GRP/GRP667+6.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
% 
%------------------------------------------------------------------------------