TSTP Solution File: GRP682+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRP682+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:30 EST 2010
% Result : Theorem 1.23s
% Output : Solution 1.23s
% 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/SystemOnTPTP756/GRP682+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP756/GRP682+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP756/GRP682+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 852
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.010 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]:(ld(ld(X5,X6),mult(ld(X5,X6),X7))=ld(X5,mult(X5,X7))&ld(rd(X5,X6),mult(rd(X5,X6),X7))=ld(X5,mult(X5,X7))),file('/tmp/SRASS.s.p', goals)).
% fof(9, negated_conjecture,~(![X5]:![X6]:![X7]:(ld(ld(X5,X6),mult(ld(X5,X6),X7))=ld(X5,mult(X5,X7))&ld(rd(X5,X6),mult(rd(X5,X6),X7))=ld(X5,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]:(~(ld(ld(X5,X6),mult(ld(X5,X6),X7))=ld(X5,mult(X5,X7)))|~(ld(rd(X5,X6),mult(rd(X5,X6),X7))=ld(X5,mult(X5,X7)))),inference(fof_nnf,[status(thm)],[9])).
% fof(25, negated_conjecture,?[X8]:?[X9]:?[X10]:(~(ld(ld(X8,X9),mult(ld(X8,X9),X10))=ld(X8,mult(X8,X10)))|~(ld(rd(X8,X9),mult(rd(X8,X9),X10))=ld(X8,mult(X8,X10)))),inference(variable_rename,[status(thm)],[24])).
% fof(26, negated_conjecture,(~(ld(ld(esk1_0,esk2_0),mult(ld(esk1_0,esk2_0),esk3_0))=ld(esk1_0,mult(esk1_0,esk3_0)))|~(ld(rd(esk1_0,esk2_0),mult(rd(esk1_0,esk2_0),esk3_0))=ld(esk1_0,mult(esk1_0,esk3_0)))),inference(skolemize,[status(esa)],[25])).
% cnf(27,negated_conjecture,(ld(rd(esk1_0,esk2_0),mult(rd(esk1_0,esk2_0),esk3_0))!=ld(esk1_0,mult(esk1_0,esk3_0))|ld(ld(esk1_0,esk2_0),mult(ld(esk1_0,esk2_0),esk3_0))!=ld(esk1_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(ld(esk1_0,esk2_0),ld(ld(esk1_0,esk2_0),esk3_0))!=ld(esk1_0,mult(esk1_0,esk3_0))|ld(rd(esk1_0,esk2_0),mult(rd(esk1_0,esk2_0),esk3_0))!=ld(esk1_0,mult(esk1_0,esk3_0))),inference(rw,[status(thm)],[27,15,theory(equality)])).
% cnf(30,negated_conjecture,(mult(ld(esk1_0,esk2_0),ld(ld(esk1_0,esk2_0),esk3_0))!=mult(esk1_0,ld(esk1_0,esk3_0))|ld(rd(esk1_0,esk2_0),mult(rd(esk1_0,esk2_0),esk3_0))!=ld(esk1_0,mult(esk1_0,esk3_0))),inference(rw,[status(thm)],[29,15,theory(equality)])).
% cnf(31,negated_conjecture,(mult(ld(esk1_0,esk2_0),ld(ld(esk1_0,esk2_0),esk3_0))!=mult(esk1_0,ld(esk1_0,esk3_0))|mult(rd(esk1_0,esk2_0),ld(rd(esk1_0,esk2_0),esk3_0))!=ld(esk1_0,mult(esk1_0,esk3_0))),inference(rw,[status(thm)],[30,15,theory(equality)])).
% cnf(32,negated_conjecture,(mult(ld(esk1_0,esk2_0),ld(ld(esk1_0,esk2_0),esk3_0))!=mult(esk1_0,ld(esk1_0,esk3_0))|mult(rd(esk1_0,esk2_0),ld(rd(esk1_0,esk2_0),esk3_0))!=mult(esk1_0,ld(esk1_0,esk3_0))),inference(rw,[status(thm)],[31,15,theory(equality)])).
% cnf(33,plain,(mult(rd(X1,X1),X1)=X1),inference(rw,[status(thm)],[13,17,theory(equality)])).
% cnf(34,plain,(mult(rd(rd(X1,X1),X2),X2)=ld(X1,mult(X1,ld(X2,X2)))),inference(rw,[status(thm)],[23,17,theory(equality)])).
% cnf(35,plain,(mult(rd(rd(X1,X1),X2),X2)=mult(X1,ld(X1,ld(X2,X2)))),inference(rw,[status(thm)],[34,15,theory(equality)])).
% cnf(38,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(39,plain,(mult(ld(X1,X2),ld(ld(X1,X2),mult(X3,X4)))=mult(mult(X1,ld(X1,X3)),X4)),inference(rw,[status(thm)],[38,15,theory(equality)])).
% cnf(44,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)],[39,15,theory(equality)])).
% cnf(49,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(50,plain,(mult(rd(mult(X1,X2),rd(X3,X4)),rd(X3,X4))=mult(X1,mult(rd(X2,X4),X4))),inference(rw,[status(thm)],[49,17,theory(equality)])).
% cnf(64,plain,(ld(X1,X1)=mult(X1,ld(X1,ld(X1,X1)))),inference(spm,[status(thm)],[15,28,theory(equality)])).
% cnf(65,plain,(rd(X1,ld(X1,X1))=mult(rd(X1,ld(X1,X1)),ld(X1,X1))),inference(spm,[status(thm)],[17,28,theory(equality)])).
% cnf(69,plain,(rd(X1,X1)=mult(rd(rd(X1,X1),X1),X1)),inference(spm,[status(thm)],[17,33,theory(equality)])).
% cnf(73,plain,(rd(X1,X1)=mult(X1,ld(X1,ld(X1,X1)))),inference(rw,[status(thm)],[69,35,theory(equality)])).
% cnf(78,plain,(ld(X1,X1)=rd(X1,X1)),inference(rw,[status(thm)],[73,64,theory(equality)])).
% cnf(79,plain,(mult(rd(mult(X1,X2),ld(X3,X3)),ld(X3,X3))=mult(X1,mult(rd(X2,X3),X3))),inference(spm,[status(thm)],[50,78,theory(equality)])).
% cnf(80,plain,(mult(rd(ld(X1,X1),X2),X2)=mult(X1,ld(X1,ld(X2,X2)))),inference(rw,[status(thm)],[35,78,theory(equality)])).
% cnf(81,plain,(mult(ld(X1,X1),X1)=X1),inference(rw,[status(thm)],[33,78,theory(equality)])).
% cnf(173,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)],[79,17,theory(equality)])).
% cnf(187,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)],[173,80,theory(equality)]),64,theory(equality)])).
% cnf(211,plain,(mult(rd(X1,ld(X1,X1)),ld(X1,X1))=mult(X1,ld(X1,X1))),inference(spm,[status(thm)],[187,65,theory(equality)])).
% cnf(224,plain,(rd(X1,ld(X1,X1))=mult(X1,ld(X1,X1))),inference(rw,[status(thm)],[211,65,theory(equality)])).
% cnf(225,plain,(rd(X1,ld(X1,X1))=X1),inference(rw,[status(thm)],[224,28,theory(equality)])).
% cnf(229,plain,(mult(rd(mult(X1,X2),X3),X3)=mult(X1,mult(rd(X2,ld(X3,X3)),ld(X3,X3)))),inference(spm,[status(thm)],[50,225,theory(equality)])).
% cnf(334,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)],[229,78,theory(equality)])).
% cnf(335,plain,(mult(X1,mult(X2,ld(X2,X2)))=mult(rd(mult(X1,X2),X2),X2)),inference(spm,[status(thm)],[229,225,theory(equality)])).
% cnf(347,plain,(mult(X1,ld(X2,X2))=mult(rd(mult(X1,ld(X2,X2)),X2),X2)),inference(rw,[status(thm)],[334,81,theory(equality)])).
% cnf(348,plain,(mult(X1,X2)=mult(rd(mult(X1,X2),X2),X2)),inference(rw,[status(thm)],[335,28,theory(equality)])).
% cnf(349,plain,(mult(X1,X2)=mult(mult(rd(X1,X2),X2),X2)),inference(rw,[status(thm)],[348,17,theory(equality)])).
% cnf(366,plain,(mult(mult(X1,ld(X1,ld(X2,X2))),X2)=mult(ld(X1,X1),X2)),inference(spm,[status(thm)],[349,80,theory(equality)])).
% cnf(397,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)],[79,347,theory(equality)])).
% cnf(410,plain,(mult(X1,ld(ld(X2,X2),ld(X2,X2)))=mult(X1,ld(X2,X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[397,80,theory(equality)]),28,theory(equality)])).
% cnf(426,plain,(mult(ld(X1,X1),X1)=mult(ld(ld(X1,X1),ld(X1,X1)),X1)),inference(spm,[status(thm)],[366,28,theory(equality)])).
% cnf(435,plain,(X1=mult(ld(ld(X1,X1),ld(X1,X1)),X1)),inference(rw,[status(thm)],[426,81,theory(equality)])).
% cnf(458,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)],[81,410,theory(equality)])).
% cnf(480,plain,(ld(X1,X1)=ld(ld(X1,X1),ld(X1,X1))),inference(rw,[status(thm)],[458,435,theory(equality)])).
% cnf(499,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)],[39,480,theory(equality)])).
% cnf(513,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)],[79,480,theory(equality)])).
% cnf(521,plain,(mult(mult(X1,ld(X1,X2)),X3)=mult(mult(ld(X1,X1),ld(ld(X1,X1),X2)),X3)),inference(rw,[status(thm)],[499,39,theory(equality)])).
% cnf(535,plain,(mult(X1,mult(rd(X2,X3),X3))=mult(X1,mult(rd(X2,ld(X3,X3)),ld(X3,X3)))),inference(rw,[status(thm)],[513,79,theory(equality)])).
% cnf(536,plain,(mult(X1,mult(rd(X2,X3),X3))=mult(rd(mult(X1,X2),X3),X3)),inference(rw,[status(thm)],[535,229,theory(equality)])).
% cnf(574,plain,(mult(mult(X1,mult(rd(X2,X3),X3)),X3)=mult(mult(X1,X2),X3)),inference(spm,[status(thm)],[349,536,theory(equality)])).
% cnf(589,plain,(mult(rd(X1,X2),X2)=mult(X1,mult(rd(ld(X1,X1),X2),X2))),inference(spm,[status(thm)],[536,28,theory(equality)])).
% cnf(598,plain,(mult(X1,mult(rd(X2,rd(X3,X4)),rd(X3,X4)))=mult(X1,mult(rd(X2,X4),X4))),inference(rw,[status(thm)],[50,536,theory(equality)])).
% cnf(611,plain,(mult(rd(X1,X2),X2)=mult(X1,mult(X1,ld(X1,ld(X2,X2))))),inference(rw,[status(thm)],[589,80,theory(equality)])).
% cnf(1212,plain,(mult(mult(mult(X1,ld(X1,X2)),X3),X4)=mult(mult(X1,ld(X1,mult(X2,X3))),X4)),inference(spm,[status(thm)],[521,39,theory(equality)])).
% cnf(1290,plain,(mult(mult(X1,X2),X3)=mult(mult(X1,ld(X1,mult(X1,X2))),X3)),inference(spm,[status(thm)],[1212,28,theory(equality)])).
% cnf(1346,plain,(mult(mult(X1,X2),X3)=mult(mult(X1,mult(X1,ld(X1,X2))),X3)),inference(rw,[status(thm)],[1290,15,theory(equality)])).
% cnf(1486,plain,(mult(mult(rd(X1,X2),X2),X3)=mult(mult(X1,ld(X2,X2)),X3)),inference(spm,[status(thm)],[1346,611,theory(equality)])).
% cnf(1570,plain,(mult(mult(X1,ld(X2,X2)),X2)=mult(X1,X2)),inference(rw,[status(thm)],[349,1486,theory(equality)])).
% cnf(1617,plain,(rd(mult(X1,X2),X2)=mult(rd(mult(X1,ld(X2,X2)),X2),X2)),inference(spm,[status(thm)],[17,1570,theory(equality)])).
% cnf(1648,plain,(mult(rd(X1,X2),X2)=mult(rd(mult(X1,ld(X2,X2)),X2),X2)),inference(rw,[status(thm)],[1617,17,theory(equality)])).
% cnf(1649,plain,(mult(rd(X1,X2),X2)=mult(X1,ld(X2,X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1648,536,theory(equality)]),80,theory(equality)]),64,theory(equality)])).
% cnf(1681,plain,(ld(rd(X1,X2),mult(X1,ld(X2,X2)))=mult(rd(X1,X2),ld(rd(X1,X2),X2))),inference(spm,[status(thm)],[15,1649,theory(equality)])).
% cnf(1689,plain,(mult(mult(X1,mult(X2,ld(X3,X3))),X3)=mult(mult(X1,X2),X3)),inference(rw,[status(thm)],[574,1649,theory(equality)])).
% cnf(1695,plain,(rd(mult(X1,X2),X2)=mult(X1,ld(X2,X2))),inference(rw,[status(thm)],[17,1649,theory(equality)])).
% cnf(1696,plain,(mult(mult(X1,X2),ld(X3,X3))=mult(X1,mult(rd(X2,X3),X3))),inference(rw,[status(thm)],[536,1649,theory(equality)])).
% cnf(1697,plain,(mult(mult(X1,X2),ld(X3,X3))=mult(X1,mult(X2,ld(X3,X3)))),inference(rw,[status(thm)],[1696,1649,theory(equality)])).
% cnf(1699,plain,(mult(ld(X1,X1),ld(X2,X2))=mult(X1,ld(X1,ld(X2,X2)))),inference(rw,[status(thm)],[80,1649,theory(equality)])).
% cnf(1797,plain,(mult(mult(X1,ld(X2,X2)),X2)=mult(mult(X1,X2),ld(X2,X2))),inference(spm,[status(thm)],[1649,1695,theory(equality)])).
% cnf(1814,plain,(mult(X1,X2)=mult(mult(X1,X2),ld(X2,X2))),inference(rw,[status(thm)],[1797,1570,theory(equality)])).
% cnf(1853,plain,(rd(mult(X1,X2),ld(X2,X2))=mult(mult(X1,X2),ld(ld(X2,X2),ld(X2,X2)))),inference(spm,[status(thm)],[1695,1814,theory(equality)])).
% cnf(1881,plain,(rd(mult(X1,X2),ld(X2,X2))=mult(X1,X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1853,480,theory(equality)]),1814,theory(equality)])).
% cnf(1955,plain,(mult(mult(X1,ld(X2,X2)),ld(X3,X3))=mult(rd(X1,X2),mult(X2,ld(X3,X3)))),inference(spm,[status(thm)],[1697,1649,theory(equality)])).
% cnf(1991,plain,(mult(X1,mult(ld(X2,X2),ld(X3,X3)))=mult(rd(X1,X2),mult(X2,ld(X3,X3)))),inference(rw,[status(thm)],[1955,1697,theory(equality)])).
% cnf(2503,plain,(mult(X1,ld(X1,mult(X2,X3)))=mult(mult(X1,ld(X1,X2)),X3)),inference(spm,[status(thm)],[44,28,theory(equality)])).
% cnf(2625,plain,(rd(mult(X1,ld(X1,mult(X2,X3))),X3)=mult(mult(X1,ld(X1,X2)),ld(X3,X3))),inference(spm,[status(thm)],[1695,2503,theory(equality)])).
% cnf(2633,plain,(mult(mult(X1,mult(X1,ld(X1,X2))),X3)=mult(X1,ld(X1,mult(mult(X1,X2),X3)))),inference(spm,[status(thm)],[2503,15,theory(equality)])).
% cnf(2640,plain,(mult(X1,X2)=mult(X1,ld(X1,mult(X1,X2)))),inference(spm,[status(thm)],[2503,28,theory(equality)])).
% cnf(2644,plain,(mult(X1,ld(X1,X2))=mult(ld(X1,X1),X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[366,2503,theory(equality)]),81,theory(equality)])).
% cnf(2646,plain,(mult(ld(X1,X2),ld(ld(X1,X2),mult(X3,X4)))=mult(X1,ld(X1,mult(X3,X4)))),inference(rw,[status(thm)],[39,2503,theory(equality)])).
% cnf(2670,plain,(rd(mult(X1,ld(X1,mult(X2,X3))),X3)=mult(X1,mult(ld(X1,X2),ld(X3,X3)))),inference(rw,[status(thm)],[2625,1697,theory(equality)])).
% cnf(2680,plain,(mult(mult(X1,X2),X3)=mult(X1,ld(X1,mult(mult(X1,X2),X3)))),inference(rw,[status(thm)],[2633,1346,theory(equality)])).
% cnf(2685,plain,(mult(X1,X2)=mult(X1,mult(X1,ld(X1,X2)))),inference(rw,[status(thm)],[2640,15,theory(equality)])).
% cnf(2697,plain,(mult(mult(X1,mult(X2,ld(X2,ld(X3,X3)))),X3)=mult(mult(X1,ld(X2,X2)),X3)),inference(spm,[status(thm)],[1689,2644,theory(equality)])).
% cnf(2703,plain,(rd(mult(X1,ld(X1,X2)),ld(X2,X2))=mult(X1,ld(X1,X2))),inference(spm,[status(thm)],[1881,2644,theory(equality)])).
% cnf(2705,plain,(mult(ld(X1,X1),X2)=mult(ld(X1,X1),ld(ld(X1,X1),X2))),inference(spm,[status(thm)],[2644,480,theory(equality)])).
% cnf(2738,plain,(mult(X1,ld(X1,X2))=mult(ld(X1,X1),ld(ld(X1,X1),X2))),inference(rw,[status(thm)],[2705,2644,theory(equality)])).
% cnf(2739,plain,(mult(X1,ld(X1,X2))=mult(X1,ld(X1,ld(ld(X1,X1),X2)))),inference(rw,[status(thm)],[2738,2644,theory(equality)])).
% cnf(3187,plain,(mult(mult(X1,X2),ld(mult(X1,X2),ld(X2,X2)))=ld(mult(X1,X2),mult(mult(X1,X2),ld(ld(X2,X2),ld(X2,X2))))),inference(spm,[status(thm)],[1681,1881,theory(equality)])).
% cnf(3210,plain,(mult(mult(X1,X2),ld(mult(X1,X2),ld(X2,X2)))=ld(mult(X1,X2),mult(X1,X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[3187,480,theory(equality)]),1697,theory(equality)]),28,theory(equality)])).
% cnf(3235,plain,(mult(rd(X1,X2),mult(X2,ld(X3,X3)))=mult(X1,mult(X2,ld(X2,ld(X3,X3))))),inference(rw,[status(thm)],[1991,1699,theory(equality)])).
% cnf(3329,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)],[2670,28,theory(equality)])).
% cnf(3355,plain,(mult(X1,ld(X1,X2))=mult(X1,mult(ld(X1,X2),ld(ld(X2,X2),ld(X2,X2))))),inference(rw,[status(thm)],[3329,2703,theory(equality)])).
% cnf(3356,plain,(mult(X1,ld(X1,X2))=mult(X1,mult(ld(X1,X2),ld(X2,X2)))),inference(rw,[status(thm)],[3355,480,theory(equality)])).
% cnf(3373,plain,(ld(X1,mult(X1,ld(X1,X2)))=mult(X1,ld(X1,mult(ld(X1,X2),ld(X2,X2))))),inference(spm,[status(thm)],[15,3356,theory(equality)])).
% cnf(3390,plain,(mult(X1,ld(X1,ld(X1,X2)))=mult(X1,ld(X1,mult(ld(X1,X2),ld(X2,X2))))),inference(rw,[status(thm)],[3373,15,theory(equality)])).
% cnf(3725,plain,(mult(X1,mult(X2,ld(rd(X3,X4),rd(X3,X4))))=mult(X1,mult(rd(X2,X4),X4))),inference(rw,[status(thm)],[598,1649,theory(equality)])).
% cnf(3726,plain,(mult(X1,mult(X2,ld(rd(X3,X4),rd(X3,X4))))=mult(X1,mult(X2,ld(X4,X4)))),inference(rw,[status(thm)],[3725,1649,theory(equality)])).
% cnf(3782,plain,(mult(X1,rd(X2,X3))=mult(X1,mult(rd(X2,X3),ld(X3,X3)))),inference(spm,[status(thm)],[3726,28,theory(equality)])).
% cnf(5303,plain,(mult(ld(X1,X2),ld(ld(X1,X2),X3))=mult(X1,ld(X1,X3))),inference(spm,[status(thm)],[2646,28,theory(equality)])).
% cnf(5422,plain,(mult(X1,ld(X1,ld(X1,X2)))=ld(X1,X2)),inference(spm,[status(thm)],[28,5303,theory(equality)])).
% cnf(5440,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)],[5303,15,theory(equality)])).
% cnf(5452,negated_conjecture,($false|mult(rd(esk1_0,esk2_0),ld(rd(esk1_0,esk2_0),esk3_0))!=mult(esk1_0,ld(esk1_0,esk3_0))),inference(rw,[status(thm)],[32,5303,theory(equality)])).
% cnf(5453,negated_conjecture,(mult(rd(esk1_0,esk2_0),ld(rd(esk1_0,esk2_0),esk3_0))!=mult(esk1_0,ld(esk1_0,esk3_0))),inference(cn,[status(thm)],[5452,theory(equality)])).
% cnf(5489,plain,(mult(ld(X1,X2),X3)=mult(X1,ld(X1,mult(ld(X1,X2),X3)))),inference(rw,[status(thm)],[5440,2685,theory(equality)])).
% cnf(5508,plain,(ld(ld(X1,X1),X2)=mult(X1,ld(X1,ld(ld(X1,X1),ld(ld(X1,X1),X2))))),inference(spm,[status(thm)],[2644,5422,theory(equality)])).
% cnf(5509,plain,(ld(ld(X1,X2),X3)=mult(X1,ld(X1,ld(ld(X1,X2),X3)))),inference(spm,[status(thm)],[5303,5422,theory(equality)])).
% cnf(5511,plain,(mult(X1,ld(X1,ld(mult(X1,X2),X3)))=ld(mult(X1,X2),X3)),inference(spm,[status(thm)],[2680,5422,theory(equality)])).
% cnf(5538,plain,(ld(ld(X1,X1),X2)=mult(X1,ld(X1,X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[5508,2739,theory(equality)]),2739,theory(equality)])).
% cnf(7811,plain,(mult(ld(X1,X2),ld(X2,X2))=mult(X1,ld(X1,ld(X1,X2)))),inference(rw,[status(thm)],[3390,5489,theory(equality)])).
% cnf(7812,plain,(mult(ld(X1,X2),ld(X2,X2))=ld(X1,X2)),inference(rw,[status(thm)],[7811,5422,theory(equality)])).
% cnf(7813,plain,(ld(ld(X1,X2),ld(X1,X2))=mult(ld(X1,X2),ld(ld(X1,X2),ld(X2,X2)))),inference(spm,[status(thm)],[15,7812,theory(equality)])).
% cnf(7845,plain,(ld(ld(X1,X2),ld(X1,X2))=mult(X1,ld(X1,ld(X2,X2)))),inference(rw,[status(thm)],[7813,5303,theory(equality)])).
% cnf(7938,plain,(mult(mult(X1,ld(X1,ld(X2,X2))),X3)=mult(ld(X1,X2),ld(ld(X1,X2),X3))),inference(spm,[status(thm)],[2644,7845,theory(equality)])).
% cnf(8002,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)],[7938,2503,theory(equality)]),2644,theory(equality)])).
% cnf(8003,plain,(mult(X1,ld(X1,mult(X2,ld(X2,X3))))=mult(X1,ld(X1,X3))),inference(rw,[status(thm)],[8002,5303,theory(equality)])).
% cnf(8494,plain,(ld(X1,mult(X1,ld(X1,X3)))=mult(X1,ld(X1,ld(X1,mult(X2,ld(X2,X3)))))),inference(spm,[status(thm)],[15,8003,theory(equality)])).
% cnf(8567,plain,(ld(X1,X3)=mult(X1,ld(X1,ld(X1,mult(X2,ld(X2,X3)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[8494,15,theory(equality)]),5422,theory(equality)])).
% cnf(8568,plain,(ld(X1,X3)=ld(X1,mult(X2,ld(X2,X3)))),inference(rw,[status(thm)],[8567,5422,theory(equality)])).
% cnf(8650,plain,(mult(X1,mult(X1,ld(X1,X3)))=mult(X1,mult(X2,ld(X2,X3)))),inference(spm,[status(thm)],[2685,8568,theory(equality)])).
% cnf(8708,plain,(mult(X1,ld(X1,X3))=mult(mult(X1,X2),ld(mult(X1,X2),X3))),inference(spm,[status(thm)],[2680,8568,theory(equality)])).
% cnf(8752,plain,(mult(X1,X3)=mult(X1,mult(X2,ld(X2,X3)))),inference(rw,[status(thm)],[8650,2685,theory(equality)])).
% cnf(8850,plain,(mult(rd(X1,X2),mult(X2,ld(X3,X3)))=mult(X1,ld(X3,X3))),inference(rw,[status(thm)],[3235,8752,theory(equality)])).
% cnf(8851,plain,(mult(X1,X3)=mult(mult(X1,ld(X2,X2)),X3)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2697,8752,theory(equality)]),1570,theory(equality)])).
% cnf(9710,plain,(mult(X1,ld(X1,X3))=mult(X1,ld(mult(X1,ld(X2,X2)),X3))),inference(spm,[status(thm)],[8851,8708,theory(equality)])).
% cnf(9773,plain,(mult(X1,ld(X1,ld(X2,X2)))=ld(mult(X1,X2),mult(X1,X2))),inference(rw,[status(thm)],[3210,8708,theory(equality)])).
% cnf(9942,plain,(ld(mult(X1,X1),mult(X1,X1))=ld(X1,X1)),inference(spm,[status(thm)],[5422,9773,theory(equality)])).
% cnf(10465,plain,(mult(X1,ld(X3,X3))=mult(rd(X1,rd(X2,X3)),rd(X2,X3))),inference(spm,[status(thm)],[3782,8850,theory(equality)])).
% cnf(10526,plain,(mult(X1,ld(X3,X3))=mult(X1,ld(rd(X2,X3),rd(X2,X3)))),inference(rw,[status(thm)],[10465,1649,theory(equality)])).
% cnf(10970,plain,(ld(X1,mult(X1,ld(X1,X3)))=mult(X1,ld(X1,ld(mult(X1,ld(X2,X2)),X3)))),inference(spm,[status(thm)],[15,9710,theory(equality)])).
% cnf(11038,plain,(ld(X1,X3)=mult(X1,ld(X1,ld(mult(X1,ld(X2,X2)),X3)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[10970,15,theory(equality)]),5422,theory(equality)])).
% cnf(11039,plain,(ld(X1,X3)=ld(mult(X1,ld(X2,X2)),X3)),inference(rw,[status(thm)],[11038,5511,theory(equality)])).
% cnf(12615,plain,(ld(mult(ld(rd(X1,X2),rd(X1,X2)),ld(X2,X2)),mult(ld(rd(X1,X2),rd(X1,X2)),ld(X2,X2)))=ld(ld(rd(X1,X2),rd(X1,X2)),ld(rd(X1,X2),rd(X1,X2)))),inference(spm,[status(thm)],[9942,10526,theory(equality)])).
% cnf(12711,plain,(ld(mult(X1,X2),mult(X1,X2))=ld(ld(rd(X1,X2),rd(X1,X2)),ld(rd(X1,X2),rd(X1,X2)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[12615,2644,theory(equality)]),9773,theory(equality)]),1649,theory(equality)]),1649,theory(equality)]),11039,theory(equality)]),15,theory(equality)]),9773,theory(equality)]),2644,theory(equality)]),9773,theory(equality)]),1649,theory(equality)]),1649,theory(equality)]),11039,theory(equality)]),15,theory(equality)]),9773,theory(equality)]),480,theory(equality)])).
% cnf(12712,plain,(ld(mult(X1,X2),mult(X1,X2))=ld(rd(X1,X2),rd(X1,X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[12711,5538,theory(equality)]),5422,theory(equality)])).
% cnf(13293,plain,(mult(rd(X1,X2),ld(rd(X1,X2),ld(ld(mult(X1,X2),mult(X1,X2)),X3)))=ld(ld(mult(X1,X2),mult(X1,X2)),X3)),inference(spm,[status(thm)],[5509,12712,theory(equality)])).
% cnf(13339,plain,(mult(rd(X1,X2),ld(rd(X1,X2),X3))=ld(ld(mult(X1,X2),mult(X1,X2)),X3)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[13293,5538,theory(equality)]),8708,theory(equality)]),8568,theory(equality)])).
% cnf(13340,plain,(mult(rd(X1,X2),ld(rd(X1,X2),X3))=mult(X1,ld(X1,X3))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[13339,5538,theory(equality)]),8708,theory(equality)])).
% cnf(14633,negated_conjecture,($false),inference(rw,[status(thm)],[5453,13340,theory(equality)])).
% cnf(14634,negated_conjecture,($false),inference(cn,[status(thm)],[14633,theory(equality)])).
% cnf(14635,negated_conjecture,($false),14634,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 267
% # ...of these trivial : 78
% # ...subsumed : 0
% # ...remaining for further processing: 189
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 139
% # Generated clauses : 6895
% # ...of the previous two non-trivial : 3856
% # Contextual simplify-reflections : 0
% # Paramodulations : 6895
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 50
% # Positive orientable unit clauses: 50
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 581
% # ...number of literals in the above : 581
% # 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 : 367
% # Indexed BW rewrite successes : 118
% # Backwards rewriting index: 56 leaves, 1.96+/-1.569 terms/leaf
% # Paramod-from index: 38 leaves, 1.32+/-0.862 terms/leaf
% # Paramod-into index: 54 leaves, 1.78+/-1.286 terms/leaf
% # -------------------------------------------------
% # User time : 0.169 s
% # System time : 0.010 s
% # Total time : 0.179 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.43 CPU 0.53 WC
% FINAL PrfWatch: 0.43 CPU 0.53 WC
% SZS output end Solution for /tmp/SystemOnTPTP756/GRP682+1.tptp
%
%------------------------------------------------------------------------------