TSTP Solution File: GRP683+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRP683+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.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 : Wed Dec 29 07:19:37 EST 2010
% Result : Theorem 1.10s
% Output : Solution 1.10s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP1015/GRP683+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP1015/GRP683+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1015/GRP683+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 1111
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:ld(X1,mult(X1,X1))=X1,file('/tmp/SRASS.s.p', f01)).
% fof(2, axiom,![X1]:rd(mult(X1,X1),X1)=X1,file('/tmp/SRASS.s.p', f02)).
% fof(3, axiom,![X2]:![X1]:mult(X1,ld(X1,X2))=ld(X1,mult(X1,X2)),file('/tmp/SRASS.s.p', f03)).
% fof(4, axiom,![X2]:![X1]:mult(rd(X1,X2),X2)=rd(mult(X1,X2),X2),file('/tmp/SRASS.s.p', f04)).
% fof(5, axiom,![X3]:![X4]:![X2]:![X1]:ld(ld(X1,X2),mult(ld(X1,X2),mult(X4,X3)))=mult(ld(X1,mult(X1,X4)),X3),file('/tmp/SRASS.s.p', f05)).
% fof(6, axiom,![X3]:![X4]:![X2]:![X1]:rd(mult(mult(X1,X2),rd(X4,X3)),rd(X4,X3))=mult(X1,rd(mult(X2,X3),X3)),file('/tmp/SRASS.s.p', f06)).
% fof(7, axiom,![X2]:![X1]:ld(X1,mult(X1,ld(X2,X2)))=rd(mult(rd(X1,X1),X2),X2),file('/tmp/SRASS.s.p', f07)).
% fof(8, conjecture,![X5]:![X6]:![X7]:(mult(X5,ld(X6,mult(X6,X7)))=mult(X5,X7)&mult(rd(mult(X5,X6),X6),X7)=mult(X5,X7)),file('/tmp/SRASS.s.p', goals)).
% fof(9, negated_conjecture,~(![X5]:![X6]:![X7]:(mult(X5,ld(X6,mult(X6,X7)))=mult(X5,X7)&mult(rd(mult(X5,X6),X6),X7)=mult(X5,X7))),inference(assume_negation,[status(cth)],[8])).
% fof(10, plain,![X2]:ld(X2,mult(X2,X2))=X2,inference(variable_rename,[status(thm)],[1])).
% cnf(11,plain,(ld(X1,mult(X1,X1))=X1),inference(split_conjunct,[status(thm)],[10])).
% fof(12, plain,![X2]:rd(mult(X2,X2),X2)=X2,inference(variable_rename,[status(thm)],[2])).
% cnf(13,plain,(rd(mult(X1,X1),X1)=X1),inference(split_conjunct,[status(thm)],[12])).
% fof(14, plain,![X3]:![X4]:mult(X4,ld(X4,X3))=ld(X4,mult(X4,X3)),inference(variable_rename,[status(thm)],[3])).
% cnf(15,plain,(mult(X1,ld(X1,X2))=ld(X1,mult(X1,X2))),inference(split_conjunct,[status(thm)],[14])).
% fof(16, plain,![X3]:![X4]:mult(rd(X4,X3),X3)=rd(mult(X4,X3),X3),inference(variable_rename,[status(thm)],[4])).
% cnf(17,plain,(mult(rd(X1,X2),X2)=rd(mult(X1,X2),X2)),inference(split_conjunct,[status(thm)],[16])).
% fof(18, plain,![X5]:![X6]:![X7]:![X8]:ld(ld(X8,X7),mult(ld(X8,X7),mult(X6,X5)))=mult(ld(X8,mult(X8,X6)),X5),inference(variable_rename,[status(thm)],[5])).
% cnf(19,plain,(ld(ld(X1,X2),mult(ld(X1,X2),mult(X3,X4)))=mult(ld(X1,mult(X1,X3)),X4)),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X5]:![X6]:![X7]:![X8]:rd(mult(mult(X8,X7),rd(X6,X5)),rd(X6,X5))=mult(X8,rd(mult(X7,X5),X5)),inference(variable_rename,[status(thm)],[6])).
% cnf(21,plain,(rd(mult(mult(X1,X2),rd(X3,X4)),rd(X3,X4))=mult(X1,rd(mult(X2,X4),X4))),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X3]:![X4]:ld(X4,mult(X4,ld(X3,X3)))=rd(mult(rd(X4,X4),X3),X3),inference(variable_rename,[status(thm)],[7])).
% cnf(23,plain,(ld(X1,mult(X1,ld(X2,X2)))=rd(mult(rd(X1,X1),X2),X2)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, negated_conjecture,?[X5]:?[X6]:?[X7]:(~(mult(X5,ld(X6,mult(X6,X7)))=mult(X5,X7))|~(mult(rd(mult(X5,X6),X6),X7)=mult(X5,X7))),inference(fof_nnf,[status(thm)],[9])).
% fof(25, negated_conjecture,?[X8]:?[X9]:?[X10]:(~(mult(X8,ld(X9,mult(X9,X10)))=mult(X8,X10))|~(mult(rd(mult(X8,X9),X9),X10)=mult(X8,X10))),inference(variable_rename,[status(thm)],[24])).
% fof(26, negated_conjecture,(~(mult(esk1_0,ld(esk2_0,mult(esk2_0,esk3_0)))=mult(esk1_0,esk3_0))|~(mult(rd(mult(esk1_0,esk2_0),esk2_0),esk3_0)=mult(esk1_0,esk3_0))),inference(skolemize,[status(esa)],[25])).
% cnf(27,negated_conjecture,(mult(rd(mult(esk1_0,esk2_0),esk2_0),esk3_0)!=mult(esk1_0,esk3_0)|mult(esk1_0,ld(esk2_0,mult(esk2_0,esk3_0)))!=mult(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[26])).
% cnf(28,plain,(mult(X1,ld(X1,X1))=X1),inference(rw,[status(thm)],[11,15,theory(equality)])).
% cnf(29,negated_conjecture,(mult(esk1_0,mult(esk2_0,ld(esk2_0,esk3_0)))!=mult(esk1_0,esk3_0)|mult(rd(mult(esk1_0,esk2_0),esk2_0),esk3_0)!=mult(esk1_0,esk3_0)),inference(rw,[status(thm)],[27,15,theory(equality)])).
% cnf(30,plain,(mult(rd(X1,X1),X1)=X1),inference(rw,[status(thm)],[13,17,theory(equality)])).
% cnf(31,plain,(mult(rd(rd(X1,X1),X2),X2)=ld(X1,mult(X1,ld(X2,X2)))),inference(rw,[status(thm)],[23,17,theory(equality)])).
% cnf(32,plain,(mult(rd(rd(X1,X1),X2),X2)=mult(X1,ld(X1,ld(X2,X2)))),inference(rw,[status(thm)],[31,15,theory(equality)])).
% cnf(35,plain,(mult(ld(X1,X2),ld(ld(X1,X2),mult(X3,X4)))=mult(ld(X1,mult(X1,X3)),X4)),inference(rw,[status(thm)],[19,15,theory(equality)])).
% cnf(36,plain,(mult(ld(X1,X2),ld(ld(X1,X2),mult(X3,X4)))=mult(mult(X1,ld(X1,X3)),X4)),inference(rw,[status(thm)],[35,15,theory(equality)])).
% cnf(41,plain,(mult(mult(X1,ld(X1,X2)),ld(mult(X1,ld(X1,X2)),mult(X3,X4)))=mult(mult(X1,ld(X1,X3)),X4)),inference(spm,[status(thm)],[36,15,theory(equality)])).
% cnf(46,plain,(mult(rd(mult(X1,X2),rd(X3,X4)),rd(X3,X4))=mult(X1,rd(mult(X2,X4),X4))),inference(rw,[status(thm)],[21,17,theory(equality)])).
% cnf(47,plain,(mult(rd(mult(X1,X2),rd(X3,X4)),rd(X3,X4))=mult(X1,mult(rd(X2,X4),X4))),inference(rw,[status(thm)],[46,17,theory(equality)])).
% cnf(61,negated_conjecture,(mult(esk1_0,mult(esk2_0,ld(esk2_0,esk3_0)))!=mult(esk1_0,esk3_0)|mult(mult(rd(esk1_0,esk2_0),esk2_0),esk3_0)!=mult(esk1_0,esk3_0)),inference(rw,[status(thm)],[29,17,theory(equality)])).
% cnf(62,plain,(ld(X1,X1)=mult(X1,ld(X1,ld(X1,X1)))),inference(spm,[status(thm)],[15,28,theory(equality)])).
% cnf(63,plain,(rd(X1,ld(X1,X1))=mult(rd(X1,ld(X1,X1)),ld(X1,X1))),inference(spm,[status(thm)],[17,28,theory(equality)])).
% cnf(67,plain,(rd(X1,X1)=mult(rd(rd(X1,X1),X1),X1)),inference(spm,[status(thm)],[17,30,theory(equality)])).
% cnf(71,plain,(rd(X1,X1)=mult(X1,ld(X1,ld(X1,X1)))),inference(rw,[status(thm)],[67,32,theory(equality)])).
% cnf(76,plain,(ld(X1,X1)=rd(X1,X1)),inference(rw,[status(thm)],[71,62,theory(equality)])).
% cnf(77,plain,(mult(rd(mult(X1,X2),ld(X3,X3)),ld(X3,X3))=mult(X1,mult(rd(X2,X3),X3))),inference(spm,[status(thm)],[47,76,theory(equality)])).
% cnf(78,plain,(mult(rd(ld(X1,X1),X2),X2)=mult(X1,ld(X1,ld(X2,X2)))),inference(rw,[status(thm)],[32,76,theory(equality)])).
% cnf(79,plain,(mult(ld(X1,X1),X1)=X1),inference(rw,[status(thm)],[30,76,theory(equality)])).
% cnf(177,plain,(mult(mult(rd(X1,ld(X2,X2)),ld(X2,X2)),ld(X2,X2))=mult(X1,mult(rd(ld(X2,X2),X2),X2))),inference(spm,[status(thm)],[77,17,theory(equality)])).
% cnf(191,plain,(mult(mult(rd(X1,ld(X2,X2)),ld(X2,X2)),ld(X2,X2))=mult(X1,ld(X2,X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[177,78,theory(equality)]),62,theory(equality)])).
% cnf(228,plain,(mult(rd(X1,ld(X1,X1)),ld(X1,X1))=mult(X1,ld(X1,X1))),inference(spm,[status(thm)],[191,63,theory(equality)])).
% cnf(242,plain,(rd(X1,ld(X1,X1))=mult(X1,ld(X1,X1))),inference(rw,[status(thm)],[228,63,theory(equality)])).
% cnf(243,plain,(rd(X1,ld(X1,X1))=X1),inference(rw,[status(thm)],[242,28,theory(equality)])).
% cnf(246,plain,(mult(rd(mult(X1,X2),X3),X3)=mult(X1,mult(rd(X2,ld(X3,X3)),ld(X3,X3)))),inference(spm,[status(thm)],[47,243,theory(equality)])).
% cnf(360,plain,(mult(X1,mult(ld(ld(X2,X2),ld(X2,X2)),ld(X2,X2)))=mult(rd(mult(X1,ld(X2,X2)),X2),X2)),inference(spm,[status(thm)],[246,76,theory(equality)])).
% cnf(361,plain,(mult(X1,mult(X2,ld(X2,X2)))=mult(rd(mult(X1,X2),X2),X2)),inference(spm,[status(thm)],[246,243,theory(equality)])).
% cnf(376,plain,(mult(X1,ld(X2,X2))=mult(rd(mult(X1,ld(X2,X2)),X2),X2)),inference(rw,[status(thm)],[360,79,theory(equality)])).
% cnf(377,plain,(mult(X1,X2)=mult(rd(mult(X1,X2),X2),X2)),inference(rw,[status(thm)],[361,28,theory(equality)])).
% cnf(378,plain,(mult(X1,X2)=mult(mult(rd(X1,X2),X2),X2)),inference(rw,[status(thm)],[377,17,theory(equality)])).
% cnf(396,plain,(mult(mult(X1,ld(X1,ld(X2,X2))),X2)=mult(ld(X1,X1),X2)),inference(spm,[status(thm)],[378,78,theory(equality)])).
% cnf(429,plain,(mult(X1,ld(ld(X2,X2),ld(X2,X2)))=mult(X1,mult(rd(ld(ld(X2,X2),ld(X2,X2)),X2),X2))),inference(spm,[status(thm)],[77,376,theory(equality)])).
% cnf(444,plain,(mult(X1,ld(ld(X2,X2),ld(X2,X2)))=mult(X1,ld(X2,X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[429,78,theory(equality)]),28,theory(equality)])).
% cnf(460,plain,(mult(ld(X1,X1),X1)=mult(ld(ld(X1,X1),ld(X1,X1)),X1)),inference(spm,[status(thm)],[396,28,theory(equality)])).
% cnf(470,plain,(X1=mult(ld(ld(X1,X1),ld(X1,X1)),X1)),inference(rw,[status(thm)],[460,79,theory(equality)])).
% cnf(495,plain,(mult(ld(ld(ld(X1,X1),ld(X1,X1)),ld(ld(X1,X1),ld(X1,X1))),ld(X1,X1))=ld(ld(X1,X1),ld(X1,X1))),inference(spm,[status(thm)],[79,444,theory(equality)])).
% cnf(518,plain,(ld(X1,X1)=ld(ld(X1,X1),ld(X1,X1))),inference(rw,[status(thm)],[495,470,theory(equality)])).
% cnf(538,plain,(mult(ld(X1,X1),ld(ld(X1,X1),mult(X2,X3)))=mult(mult(ld(X1,X1),ld(ld(X1,X1),X2)),X3)),inference(spm,[status(thm)],[36,518,theory(equality)])).
% cnf(554,plain,(mult(rd(mult(X1,X2),ld(X3,X3)),ld(X3,X3))=mult(X1,mult(rd(X2,ld(X3,X3)),ld(X3,X3)))),inference(spm,[status(thm)],[77,518,theory(equality)])).
% cnf(564,plain,(mult(mult(X1,ld(X1,X2)),X3)=mult(mult(ld(X1,X1),ld(ld(X1,X1),X2)),X3)),inference(rw,[status(thm)],[538,36,theory(equality)])).
% cnf(581,plain,(mult(X1,mult(rd(X2,X3),X3))=mult(X1,mult(rd(X2,ld(X3,X3)),ld(X3,X3)))),inference(rw,[status(thm)],[554,77,theory(equality)])).
% cnf(582,plain,(mult(X1,mult(rd(X2,X3),X3))=mult(rd(mult(X1,X2),X3),X3)),inference(rw,[status(thm)],[581,246,theory(equality)])).
% cnf(711,plain,(mult(mult(X1,mult(rd(X2,X3),X3)),X3)=mult(mult(X1,X2),X3)),inference(spm,[status(thm)],[378,582,theory(equality)])).
% cnf(728,plain,(mult(rd(X1,X2),X2)=mult(X1,mult(rd(ld(X1,X1),X2),X2))),inference(spm,[status(thm)],[582,28,theory(equality)])).
% cnf(752,plain,(mult(rd(X1,X2),X2)=mult(X1,mult(X1,ld(X1,ld(X2,X2))))),inference(rw,[status(thm)],[728,78,theory(equality)])).
% cnf(1277,plain,(mult(mult(mult(X1,ld(X1,X2)),X3),X4)=mult(mult(X1,ld(X1,mult(X2,X3))),X4)),inference(spm,[status(thm)],[564,36,theory(equality)])).
% cnf(1354,plain,(mult(mult(X1,X2),X3)=mult(mult(X1,ld(X1,mult(X1,X2))),X3)),inference(spm,[status(thm)],[1277,28,theory(equality)])).
% cnf(1408,plain,(mult(mult(X1,X2),X3)=mult(mult(X1,mult(X1,ld(X1,X2))),X3)),inference(rw,[status(thm)],[1354,15,theory(equality)])).
% cnf(1654,plain,(mult(mult(rd(X1,X2),X2),X3)=mult(mult(X1,ld(X2,X2)),X3)),inference(spm,[status(thm)],[1408,752,theory(equality)])).
% cnf(1743,plain,(mult(mult(X1,ld(X2,X2)),X2)=mult(X1,X2)),inference(rw,[status(thm)],[378,1654,theory(equality)])).
% cnf(1745,negated_conjecture,(mult(esk1_0,mult(esk2_0,ld(esk2_0,esk3_0)))!=mult(esk1_0,esk3_0)|mult(mult(esk1_0,ld(esk2_0,esk2_0)),esk3_0)!=mult(esk1_0,esk3_0)),inference(rw,[status(thm)],[61,1654,theory(equality)])).
% cnf(1794,plain,(rd(mult(X1,X2),X2)=mult(rd(mult(X1,ld(X2,X2)),X2),X2)),inference(spm,[status(thm)],[17,1743,theory(equality)])).
% cnf(1827,plain,(mult(rd(X1,X2),X2)=mult(rd(mult(X1,ld(X2,X2)),X2),X2)),inference(rw,[status(thm)],[1794,17,theory(equality)])).
% cnf(1828,plain,(mult(rd(X1,X2),X2)=mult(X1,ld(X2,X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1827,582,theory(equality)]),78,theory(equality)]),62,theory(equality)])).
% cnf(1873,plain,(mult(mult(X1,mult(X2,ld(X3,X3))),X3)=mult(mult(X1,X2),X3)),inference(rw,[status(thm)],[711,1828,theory(equality)])).
% cnf(1879,plain,(rd(mult(X1,X2),X2)=mult(X1,ld(X2,X2))),inference(rw,[status(thm)],[17,1828,theory(equality)])).
% cnf(1880,plain,(mult(mult(X1,X2),ld(X3,X3))=mult(X1,mult(rd(X2,X3),X3))),inference(rw,[status(thm)],[582,1828,theory(equality)])).
% cnf(1881,plain,(mult(mult(X1,X2),ld(X3,X3))=mult(X1,mult(X2,ld(X3,X3)))),inference(rw,[status(thm)],[1880,1828,theory(equality)])).
% cnf(1902,plain,(mult(mult(X1,ld(X2,X2)),X2)=mult(mult(X1,X2),ld(X2,X2))),inference(spm,[status(thm)],[1828,1879,theory(equality)])).
% cnf(1919,plain,(mult(X1,X2)=mult(mult(X1,X2),ld(X2,X2))),inference(rw,[status(thm)],[1902,1743,theory(equality)])).
% cnf(1958,plain,(rd(mult(X1,X2),ld(X2,X2))=mult(mult(X1,X2),ld(ld(X2,X2),ld(X2,X2)))),inference(spm,[status(thm)],[1879,1919,theory(equality)])).
% cnf(1986,plain,(rd(mult(X1,X2),ld(X2,X2))=mult(X1,X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1958,518,theory(equality)]),1919,theory(equality)])).
% cnf(2461,plain,(mult(X1,ld(X1,mult(X2,X3)))=mult(mult(X1,ld(X1,X2)),X3)),inference(spm,[status(thm)],[41,28,theory(equality)])).
% cnf(2573,plain,(rd(mult(X1,ld(X1,mult(X2,X3))),X3)=mult(mult(X1,ld(X1,X2)),ld(X3,X3))),inference(spm,[status(thm)],[1879,2461,theory(equality)])).
% cnf(2587,plain,(mult(X1,X2)=mult(X1,ld(X1,mult(X1,X2)))),inference(spm,[status(thm)],[2461,28,theory(equality)])).
% cnf(2591,plain,(mult(X1,ld(X1,X2))=mult(ld(X1,X1),X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[396,2461,theory(equality)]),79,theory(equality)])).
% cnf(2593,plain,(mult(ld(X1,X2),ld(ld(X1,X2),mult(X3,X4)))=mult(X1,ld(X1,mult(X3,X4)))),inference(rw,[status(thm)],[36,2461,theory(equality)])).
% cnf(2615,plain,(rd(mult(X1,ld(X1,mult(X2,X3))),X3)=mult(X1,mult(ld(X1,X2),ld(X3,X3)))),inference(rw,[status(thm)],[2573,1881,theory(equality)])).
% cnf(2628,plain,(mult(X1,X2)=mult(X1,mult(X1,ld(X1,X2)))),inference(rw,[status(thm)],[2587,15,theory(equality)])).
% cnf(2638,plain,(mult(mult(X1,mult(X2,ld(X2,ld(X3,X3)))),X3)=mult(mult(X1,ld(X2,X2)),X3)),inference(spm,[status(thm)],[1873,2591,theory(equality)])).
% cnf(2645,plain,(rd(mult(X1,ld(X1,X2)),ld(X2,X2))=mult(X1,ld(X1,X2))),inference(spm,[status(thm)],[1986,2591,theory(equality)])).
% cnf(3351,plain,(rd(mult(X1,ld(X1,X2)),ld(X2,X2))=mult(X1,mult(ld(X1,X2),ld(ld(X2,X2),ld(X2,X2))))),inference(spm,[status(thm)],[2615,28,theory(equality)])).
% cnf(3377,plain,(mult(X1,ld(X1,X2))=mult(X1,mult(ld(X1,X2),ld(ld(X2,X2),ld(X2,X2))))),inference(rw,[status(thm)],[3351,2645,theory(equality)])).
% cnf(3378,plain,(mult(X1,ld(X1,X2))=mult(X1,mult(ld(X1,X2),ld(X2,X2)))),inference(rw,[status(thm)],[3377,518,theory(equality)])).
% cnf(3397,plain,(ld(X1,mult(X1,ld(X1,X2)))=mult(X1,ld(X1,mult(ld(X1,X2),ld(X2,X2))))),inference(spm,[status(thm)],[15,3378,theory(equality)])).
% cnf(3415,plain,(mult(X1,ld(X1,ld(X1,X2)))=mult(X1,ld(X1,mult(ld(X1,X2),ld(X2,X2))))),inference(rw,[status(thm)],[3397,15,theory(equality)])).
% cnf(5183,plain,(mult(ld(X1,X2),ld(ld(X1,X2),X3))=mult(X1,ld(X1,X3))),inference(spm,[status(thm)],[2593,28,theory(equality)])).
% cnf(5304,plain,(mult(X1,ld(X1,ld(X1,X2)))=ld(X1,X2)),inference(spm,[status(thm)],[28,5183,theory(equality)])).
% cnf(5323,plain,(mult(ld(X1,X2),mult(ld(X1,X2),ld(ld(X1,X2),X3)))=mult(X1,ld(X1,mult(ld(X1,X2),X3)))),inference(spm,[status(thm)],[5183,15,theory(equality)])).
% cnf(5373,plain,(mult(ld(X1,X2),X3)=mult(X1,ld(X1,mult(ld(X1,X2),X3)))),inference(rw,[status(thm)],[5323,2628,theory(equality)])).
% cnf(7676,plain,(mult(ld(X1,X2),ld(X2,X2))=mult(X1,ld(X1,ld(X1,X2)))),inference(rw,[status(thm)],[3415,5373,theory(equality)])).
% cnf(7677,plain,(mult(ld(X1,X2),ld(X2,X2))=ld(X1,X2)),inference(rw,[status(thm)],[7676,5304,theory(equality)])).
% cnf(7678,plain,(ld(ld(X1,X2),ld(X1,X2))=mult(ld(X1,X2),ld(ld(X1,X2),ld(X2,X2)))),inference(spm,[status(thm)],[15,7677,theory(equality)])).
% cnf(7712,plain,(ld(ld(X1,X2),ld(X1,X2))=mult(X1,ld(X1,ld(X2,X2)))),inference(rw,[status(thm)],[7678,5183,theory(equality)])).
% cnf(7806,plain,(mult(mult(X1,ld(X1,ld(X2,X2))),X3)=mult(ld(X1,X2),ld(ld(X1,X2),X3))),inference(spm,[status(thm)],[2591,7712,theory(equality)])).
% cnf(7870,plain,(mult(X1,ld(X1,mult(X2,ld(X2,X3))))=mult(ld(X1,X2),ld(ld(X1,X2),X3))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[7806,2461,theory(equality)]),2591,theory(equality)])).
% cnf(7871,plain,(mult(X1,ld(X1,mult(X2,ld(X2,X3))))=mult(X1,ld(X1,X3))),inference(rw,[status(thm)],[7870,5183,theory(equality)])).
% cnf(8282,plain,(ld(X1,mult(X1,ld(X1,X3)))=mult(X1,ld(X1,ld(X1,mult(X2,ld(X2,X3)))))),inference(spm,[status(thm)],[15,7871,theory(equality)])).
% cnf(8354,plain,(ld(X1,X3)=mult(X1,ld(X1,ld(X1,mult(X2,ld(X2,X3)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[8282,15,theory(equality)]),5304,theory(equality)])).
% cnf(8355,plain,(ld(X1,X3)=ld(X1,mult(X2,ld(X2,X3)))),inference(rw,[status(thm)],[8354,5304,theory(equality)])).
% cnf(8439,plain,(mult(X1,mult(X1,ld(X1,X3)))=mult(X1,mult(X2,ld(X2,X3)))),inference(spm,[status(thm)],[2628,8355,theory(equality)])).
% cnf(8541,plain,(mult(X1,X3)=mult(X1,mult(X2,ld(X2,X3)))),inference(rw,[status(thm)],[8439,2628,theory(equality)])).
% cnf(8638,plain,(mult(X1,X3)=mult(mult(X1,ld(X2,X2)),X3)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2638,8541,theory(equality)]),1743,theory(equality)])).
% cnf(8640,negated_conjecture,($false|mult(mult(esk1_0,ld(esk2_0,esk2_0)),esk3_0)!=mult(esk1_0,esk3_0)),inference(rw,[status(thm)],[1745,8541,theory(equality)])).
% cnf(8641,negated_conjecture,(mult(mult(esk1_0,ld(esk2_0,esk2_0)),esk3_0)!=mult(esk1_0,esk3_0)),inference(cn,[status(thm)],[8640,theory(equality)])).
% cnf(8781,negated_conjecture,($false),inference(rw,[status(thm)],[8641,8638,theory(equality)])).
% cnf(8782,negated_conjecture,($false),inference(cn,[status(thm)],[8781,theory(equality)])).
% cnf(8783,negated_conjecture,($false),8782,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 204
% # ...of these trivial : 52
% # ...subsumed : 0
% # ...remaining for further processing: 152
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 95
% # Generated clauses : 4441
% # ...of the previous two non-trivial : 2812
% # Contextual simplify-reflections : 0
% # Paramodulations : 4441
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 57
% # Positive orientable unit clauses: 57
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 803
% # ...number of literals in the above : 803
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 295
% # Indexed BW rewrite successes : 80
% # Backwards rewriting index: 69 leaves, 1.86+/-1.497 terms/leaf
% # Paramod-from index: 42 leaves, 1.36+/-0.781 terms/leaf
% # Paramod-into index: 65 leaves, 1.75+/-1.289 terms/leaf
% # -------------------------------------------------
% # User time : 0.111 s
% # System time : 0.011 s
% # Total time : 0.122 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.30 CPU 0.40 WC
% FINAL PrfWatch: 0.30 CPU 0.40 WC
% SZS output end Solution for /tmp/SystemOnTPTP1015/GRP683+1.tptp
%
%------------------------------------------------------------------------------