TSTP Solution File: GRP654+3 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : GRP654+3 : 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:15:31 EST 2010

% Result   : Theorem 26.30s
% Output   : Solution 26.30s
% 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/SystemOnTPTP32399/GRP654+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP32399/GRP654+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32399/GRP654+3.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 32495
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.92 CPU 2.01 WC
% PrfWatch: 3.91 CPU 4.01 WC
% PrfWatch: 5.90 CPU 6.02 WC
% PrfWatch: 7.90 CPU 8.02 WC
% PrfWatch: 9.88 CPU 10.03 WC
% PrfWatch: 11.87 CPU 12.03 WC
% PrfWatch: 13.85 CPU 14.04 WC
% # Preprocessing time     : 0.009 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 15.84 CPU 16.04 WC
% PrfWatch: 17.65 CPU 18.06 WC
% PrfWatch: 19.26 CPU 20.08 WC
% PrfWatch: 21.13 CPU 22.09 WC
% PrfWatch: 23.12 CPU 24.09 WC
% PrfWatch: 25.11 CPU 26.09 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:mult(X2,ld(X2,X1))=X1,file('/tmp/SRASS.s.p', f01)).
% fof(2, axiom,![X1]:![X2]:ld(X2,mult(X2,X1))=X1,file('/tmp/SRASS.s.p', f02)).
% fof(3, axiom,![X1]:![X2]:mult(rd(X2,X1),X1)=X2,file('/tmp/SRASS.s.p', f03)).
% fof(4, axiom,![X1]:![X2]:rd(mult(X2,X1),X1)=X2,file('/tmp/SRASS.s.p', f04)).
% fof(5, axiom,![X3]:![X1]:![X2]:mult(X2,mult(X1,mult(X2,X3)))=mult(mult(mult(X2,X1),X2),X3),file('/tmp/SRASS.s.p', f05)).
% fof(6, conjecture,![X4]:![X5]:(mult(X4,ld(X5,X5))=X4&mult(ld(X5,X5),X4)=X4),file('/tmp/SRASS.s.p', goals)).
% fof(7, negated_conjecture,~(![X4]:![X5]:(mult(X4,ld(X5,X5))=X4&mult(ld(X5,X5),X4)=X4)),inference(assume_negation,[status(cth)],[6])).
% fof(8, plain,![X3]:![X4]:mult(X4,ld(X4,X3))=X3,inference(variable_rename,[status(thm)],[1])).
% cnf(9,plain,(mult(X1,ld(X1,X2))=X2),inference(split_conjunct,[status(thm)],[8])).
% fof(10, plain,![X3]:![X4]:ld(X4,mult(X4,X3))=X3,inference(variable_rename,[status(thm)],[2])).
% cnf(11,plain,(ld(X1,mult(X1,X2))=X2),inference(split_conjunct,[status(thm)],[10])).
% fof(12, plain,![X3]:![X4]:mult(rd(X4,X3),X3)=X4,inference(variable_rename,[status(thm)],[3])).
% cnf(13,plain,(mult(rd(X1,X2),X2)=X1),inference(split_conjunct,[status(thm)],[12])).
% fof(14, plain,![X3]:![X4]:rd(mult(X4,X3),X3)=X4,inference(variable_rename,[status(thm)],[4])).
% cnf(15,plain,(rd(mult(X1,X2),X2)=X1),inference(split_conjunct,[status(thm)],[14])).
% fof(16, plain,![X4]:![X5]:![X6]:mult(X6,mult(X5,mult(X6,X4)))=mult(mult(mult(X6,X5),X6),X4),inference(variable_rename,[status(thm)],[5])).
% cnf(17,plain,(mult(X1,mult(X2,mult(X1,X3)))=mult(mult(mult(X1,X2),X1),X3)),inference(split_conjunct,[status(thm)],[16])).
% fof(18, negated_conjecture,?[X4]:?[X5]:(~(mult(X4,ld(X5,X5))=X4)|~(mult(ld(X5,X5),X4)=X4)),inference(fof_nnf,[status(thm)],[7])).
% fof(19, negated_conjecture,?[X6]:?[X7]:(~(mult(X6,ld(X7,X7))=X6)|~(mult(ld(X7,X7),X6)=X6)),inference(variable_rename,[status(thm)],[18])).
% fof(20, negated_conjecture,(~(mult(esk1_0,ld(esk2_0,esk2_0))=esk1_0)|~(mult(ld(esk2_0,esk2_0),esk1_0)=esk1_0)),inference(skolemize,[status(esa)],[19])).
% cnf(21,negated_conjecture,(mult(ld(esk2_0,esk2_0),esk1_0)!=esk1_0|mult(esk1_0,ld(esk2_0,esk2_0))!=esk1_0),inference(split_conjunct,[status(thm)],[20])).
% cnf(22,plain,(ld(rd(X1,X2),X1)=X2),inference(spm,[status(thm)],[11,13,theory(equality)])).
% cnf(23,plain,(rd(X2,ld(X1,X2))=X1),inference(spm,[status(thm)],[15,9,theory(equality)])).
% cnf(30,plain,(mult(mult(X2,X1),X3)=mult(X1,mult(ld(X1,X2),mult(X1,X3)))),inference(spm,[status(thm)],[17,9,theory(equality)])).
% cnf(41,plain,(ld(X1,mult(mult(X2,X1),X3))=mult(ld(X1,X2),mult(X1,X3))),inference(spm,[status(thm)],[11,30,theory(equality)])).
% cnf(47,plain,(mult(X1,mult(ld(X1,X2),X3))=mult(mult(X2,X1),ld(X1,X3))),inference(spm,[status(thm)],[30,9,theory(equality)])).
% cnf(61,plain,(ld(X1,X3)=mult(ld(X1,X2),mult(X1,ld(mult(X2,X1),X3)))),inference(spm,[status(thm)],[41,9,theory(equality)])).
% cnf(66,plain,(ld(mult(X1,X2),mult(X2,mult(ld(X2,X1),X3)))=ld(X2,X3)),inference(spm,[status(thm)],[11,47,theory(equality)])).
% cnf(87,plain,(ld(ld(X1,X2),ld(X1,X3))=mult(X1,ld(mult(X2,X1),X3))),inference(spm,[status(thm)],[11,61,theory(equality)])).
% cnf(118,plain,(ld(ld(X1,X2),X3)=mult(X1,ld(mult(X2,X1),mult(X1,X3)))),inference(spm,[status(thm)],[87,11,theory(equality)])).
% cnf(121,plain,(ld(X2,ld(X1,X3))=mult(X1,ld(mult(mult(X1,X2),X1),X3))),inference(spm,[status(thm)],[87,11,theory(equality)])).
% cnf(125,plain,(ld(X1,ld(ld(X1,X2),X3))=ld(mult(X2,X1),mult(X1,X3))),inference(spm,[status(thm)],[11,118,theory(equality)])).
% cnf(165,plain,(ld(X1,ld(X2,X3))=ld(mult(mult(X1,X2),X1),mult(X1,X3))),inference(spm,[status(thm)],[125,11,theory(equality)])).
% cnf(174,plain,(ld(X1,ld(X2,ld(X1,X3)))=ld(mult(mult(X1,X2),X1),X3)),inference(spm,[status(thm)],[11,121,theory(equality)])).
% cnf(244,plain,(rd(mult(X1,X2),ld(X1,ld(X3,X2)))=mult(mult(X1,X3),X1)),inference(spm,[status(thm)],[23,165,theory(equality)])).
% cnf(523,plain,(rd(mult(X1,X2),ld(X1,X3))=mult(mult(X1,rd(X2,X3)),X1)),inference(spm,[status(thm)],[244,22,theory(equality)])).
% cnf(604,plain,(mult(mult(X1,rd(X2,mult(X1,X2))),X1)=X1),inference(spm,[status(thm)],[23,523,theory(equality)])).
% cnf(606,plain,(mult(mult(X1,rd(ld(X1,X2),X2)),X1)=X1),inference(spm,[status(thm)],[15,523,theory(equality)])).
% cnf(641,plain,(ld(X1,mult(X1,mult(ld(X1,mult(X1,rd(X2,mult(X1,X2)))),X3)))=ld(X1,X3)),inference(spm,[status(thm)],[66,604,theory(equality)])).
% cnf(669,plain,(mult(rd(X2,mult(X1,X2)),X3)=ld(X1,X3)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[641,11,theory(equality)]),11,theory(equality)])).
% cnf(711,plain,(mult(rd(X1,X2),X3)=ld(rd(X2,X1),X3)),inference(spm,[status(thm)],[669,13,theory(equality)])).
% cnf(720,plain,(mult(rd(ld(X1,X2),X2),X3)=ld(X1,X3)),inference(spm,[status(thm)],[669,9,theory(equality)])).
% cnf(934,plain,(mult(rd(X2,X1),mult(rd(X1,X2),X3))=X3),inference(spm,[status(thm)],[11,711,theory(equality)])).
% cnf(1201,plain,(ld(rd(ld(X1,X2),X2),X1)=mult(ld(rd(ld(X1,X2),X2),X1),mult(rd(ld(X1,X2),X2),X1))),inference(spm,[status(thm)],[41,606,theory(equality)])).
% cnf(1231,plain,(mult(X1,X1)=mult(ld(rd(ld(X1,X2),X2),X1),mult(rd(ld(X1,X2),X2),X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1201,711,theory(equality)]),23,theory(equality)])).
% cnf(1232,plain,(mult(X1,X1)=mult(X1,mult(ld(X1,X1),X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1231,711,theory(equality)]),23,theory(equality)]),720,theory(equality)]),47,theory(equality)])).
% cnf(1248,plain,(ld(X1,mult(X1,X1))=mult(ld(X1,X1),X1)),inference(spm,[status(thm)],[11,1232,theory(equality)])).
% cnf(1284,plain,(X1=mult(ld(X1,X1),X1)),inference(rw,[status(thm)],[1248,11,theory(equality)])).
% cnf(1301,plain,(rd(X1,X1)=ld(X1,X1)),inference(spm,[status(thm)],[15,1284,theory(equality)])).
% cnf(1303,plain,(ld(X1,mult(X1,mult(ld(X1,ld(X1,X1)),X2)))=ld(X1,X2)),inference(spm,[status(thm)],[66,1284,theory(equality)])).
% cnf(1306,plain,(mult(ld(X1,X1),ld(mult(X1,ld(X1,X1)),X2))=ld(X1,ld(ld(X1,X1),X2))),inference(spm,[status(thm)],[121,1284,theory(equality)])).
% cnf(1307,plain,(ld(mult(X1,ld(X1,X1)),mult(ld(X1,X1),X2))=ld(ld(X1,X1),ld(X1,X2))),inference(spm,[status(thm)],[165,1284,theory(equality)])).
% cnf(1312,plain,(mult(ld(X1,X1),mult(ld(ld(X1,X1),X2),X1))=mult(mult(X2,ld(X1,X1)),X1)),inference(spm,[status(thm)],[30,1284,theory(equality)])).
% cnf(1314,plain,(ld(mult(mult(ld(X1,X1),X2),ld(X1,X1)),X1)=ld(ld(X1,X1),ld(X2,X1))),inference(spm,[status(thm)],[165,1284,theory(equality)])).
% cnf(1318,plain,(mult(X1,ld(X1,mult(X1,X2)))=ld(ld(X1,ld(X1,X1)),X2)),inference(spm,[status(thm)],[118,1284,theory(equality)])).
% cnf(1319,plain,(ld(mult(X1,X1),mult(X1,X1))=ld(X1,X1)),inference(spm,[status(thm)],[66,1284,theory(equality)])).
% cnf(1325,plain,(mult(ld(X1,ld(X1,X1)),X2)=ld(X1,X2)),inference(rw,[status(thm)],[1303,11,theory(equality)])).
% cnf(1328,plain,(mult(ld(X1,X1),ld(X1,X2))=ld(X1,ld(ld(X1,X1),X2))),inference(rw,[status(thm)],[1306,9,theory(equality)])).
% cnf(1329,plain,(mult(ld(X1,X1),ld(X1,X2))=ld(mult(X1,X1),mult(X1,X2))),inference(rw,[status(thm)],[1328,125,theory(equality)])).
% cnf(1330,plain,(ld(X1,mult(ld(X1,X1),X2))=ld(ld(X1,X1),ld(X1,X2))),inference(rw,[status(thm)],[1307,9,theory(equality)])).
% cnf(1331,plain,(ld(X1,mult(ld(X1,X1),X2))=mult(X1,ld(mult(X1,X1),X2))),inference(rw,[status(thm)],[1330,87,theory(equality)])).
% cnf(1334,plain,(mult(X1,X2)=ld(ld(X1,ld(X1,X1)),X2)),inference(rw,[status(thm)],[1318,11,theory(equality)])).
% cnf(1365,plain,(ld(ld(X1,X1),X2)=mult(rd(X1,X1),X2)),inference(spm,[status(thm)],[711,1301,theory(equality)])).
% cnf(1370,plain,(ld(ld(X1,X1),X2)=mult(ld(X1,X1),X2)),inference(rw,[status(thm)],[1365,1301,theory(equality)])).
% cnf(1377,plain,(mult(ld(X1,X1),mult(ld(X1,X1),X2))=X2),inference(spm,[status(thm)],[11,1370,theory(equality)])).
% cnf(1380,plain,(ld(X1,mult(ld(X2,X2),ld(X1,X3)))=ld(mult(mult(X1,ld(X2,X2)),X1),X3)),inference(spm,[status(thm)],[174,1370,theory(equality)])).
% cnf(1399,plain,(ld(mult(X1,ld(mult(X2,X1),X2)),X3)=mult(mult(X1,ld(mult(X2,X1),X2)),X3)),inference(spm,[status(thm)],[1370,87,theory(equality)])).
% cnf(2518,plain,(ld(X1,X1)=mult(X1,ld(mult(X1,X1),X1))),inference(spm,[status(thm)],[1331,1284,theory(equality)])).
% cnf(2561,plain,(ld(X1,ld(X1,X1))=ld(mult(X1,X1),X1)),inference(spm,[status(thm)],[11,2518,theory(equality)])).
% cnf(2575,plain,(mult(X1,ld(mult(X2,X1),ld(X1,X1)))=ld(ld(X1,X2),ld(mult(X1,X1),X1))),inference(spm,[status(thm)],[118,2518,theory(equality)])).
% cnf(2759,plain,(ld(ld(mult(X1,X1),X1),X2)=mult(X1,X2)),inference(rw,[status(thm)],[1334,2561,theory(equality)])).
% cnf(2760,plain,(mult(ld(mult(X1,X1),X1),X2)=ld(X1,X2)),inference(rw,[status(thm)],[1325,2561,theory(equality)])).
% cnf(32017,plain,(ld(X1,ld(X1,X2))=ld(mult(mult(X1,ld(ld(X1,X2),ld(X1,X2))),X1),X2)),inference(spm,[status(thm)],[1380,1284,theory(equality)])).
% cnf(32111,plain,(ld(X1,ld(X1,X2))=ld(mult(mult(X1,mult(X1,ld(mult(X2,X1),X2))),X1),X2)),inference(rw,[status(thm)],[32017,87,theory(equality)])).
% cnf(32300,plain,(ld(mult(ld(X1,X2),ld(X2,X1)),X3)=mult(mult(ld(X1,X2),ld(X2,X1)),X3)),inference(spm,[status(thm)],[1399,9,theory(equality)])).
% cnf(39635,plain,(ld(mult(ld(mult(X1,X2),X1),X2),X3)=mult(mult(ld(mult(X1,X2),X1),X2),X3)),inference(spm,[status(thm)],[32300,11,theory(equality)])).
% cnf(41347,plain,(ld(mult(ld(X1,ld(X2,X2)),X1),X3)=mult(mult(ld(X1,ld(X2,X2)),X1),X3)),inference(spm,[status(thm)],[39635,165,theory(equality)])).
% cnf(62936,plain,(mult(ld(X1,X1),mult(mult(ld(X1,X1),X2),X1))=mult(mult(X2,ld(X1,X1)),X1)),inference(rw,[status(thm)],[1312,1370,theory(equality)])).
% cnf(63815,plain,(ld(mult(mult(ld(X1,X1),X2),ld(X1,X1)),X1)=mult(ld(X1,X1),ld(X2,X1))),inference(rw,[status(thm)],[1314,1370,theory(equality)])).
% cnf(63879,plain,(rd(X1,mult(ld(X1,X1),ld(X2,X1)))=mult(mult(ld(X1,X1),X2),ld(X1,X1))),inference(spm,[status(thm)],[23,63815,theory(equality)])).
% cnf(135634,plain,(ld(mult(ld(mult(X2,rd(X1,X1)),X2),rd(X1,X1)),X2)=ld(rd(X1,X1),ld(rd(X1,X1),X2))),inference(spm,[status(thm)],[32111,934,theory(equality)])).
% cnf(136006,plain,(mult(mult(ld(mult(X2,ld(X1,X1)),X2),ld(X1,X1)),X2)=ld(rd(X1,X1),ld(rd(X1,X1),X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[135634,1301,theory(equality)]),1301,theory(equality)]),39635,theory(equality)])).
% cnf(136007,plain,(mult(mult(ld(mult(X2,ld(X1,X1)),X2),ld(X1,X1)),X2)=X2),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[136006,1301,theory(equality)]),1301,theory(equality)]),1370,theory(equality)]),1370,theory(equality)]),1377,theory(equality)])).
% cnf(136091,plain,(rd(X1,X1)=mult(ld(mult(X1,ld(X2,X2)),X1),ld(X2,X2))),inference(spm,[status(thm)],[15,136007,theory(equality)])).
% cnf(136394,plain,(ld(X1,X1)=mult(ld(mult(X1,ld(X2,X2)),X1),ld(X2,X2))),inference(rw,[status(thm)],[136091,1301,theory(equality)])).
% cnf(136648,plain,(rd(ld(X1,X1),ld(X2,X2))=ld(mult(X1,ld(X2,X2)),X1)),inference(spm,[status(thm)],[15,136394,theory(equality)])).
% cnf(137251,plain,(rd(mult(X1,ld(mult(X1,X1),X1)),ld(X2,X2))=ld(mult(ld(mult(X1,X1),X1),ld(X2,X2)),ld(mult(X1,X1),X1))),inference(spm,[status(thm)],[136648,2759,theory(equality)])).
% cnf(137381,plain,(ld(mult(X1,ld(X2,X2)),X1)=ld(mult(ld(mult(X1,X1),X1),ld(X2,X2)),ld(mult(X1,X1),X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[137251,2518,theory(equality)]),136648,theory(equality)])).
% cnf(137382,plain,(ld(mult(X1,ld(X2,X2)),X1)=mult(X1,ld(mult(ld(X2,X2),X1),ld(X1,X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[137381,2760,theory(equality)]),2575,theory(equality)])).
% cnf(139089,plain,(ld(X1,ld(mult(X1,ld(X2,X2)),X1))=ld(mult(ld(X2,X2),X1),ld(X1,X1))),inference(spm,[status(thm)],[11,137382,theory(equality)])).
% cnf(139805,plain,(rd(ld(X1,X1),ld(X1,ld(mult(X1,ld(X2,X2)),X1)))=mult(ld(X2,X2),X1)),inference(spm,[status(thm)],[23,139089,theory(equality)])).
% cnf(589260,plain,(rd(ld(ld(ld(X1,X1),ld(X2,X2)),ld(ld(X1,X1),ld(X2,X2))),ld(ld(ld(X1,X1),ld(X2,X2)),mult(mult(ld(ld(X1,X1),ld(X2,X2)),ld(X1,X1)),ld(ld(X1,X1),ld(X2,X2)))))=mult(ld(X1,X1),ld(ld(X1,X1),ld(X2,X2)))),inference(spm,[status(thm)],[139805,41347,theory(equality)])).
% cnf(589601,plain,(ld(mult(ld(X1,X1),ld(X2,X2)),mult(ld(X1,X1),ld(X2,X2)))=mult(ld(X1,X1),ld(ld(X1,X1),ld(X2,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)],[589260,1370,theory(equality)]),1370,theory(equality)]),1370,theory(equality)]),1370,theory(equality)]),1370,theory(equality)]),17,theory(equality)]),1377,theory(equality)]),1329,theory(equality)]),1319,theory(equality)]),136648,theory(equality)]),9,theory(equality)])).
% cnf(589602,plain,(ld(mult(ld(X1,X1),ld(X2,X2)),mult(ld(X1,X1),ld(X2,X2)))=ld(X2,X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[589601,1370,theory(equality)]),1377,theory(equality)])).
% cnf(589843,plain,(rd(mult(ld(X1,X1),ld(X2,X2)),ld(X2,X2))=mult(ld(X1,X1),ld(X2,X2))),inference(spm,[status(thm)],[23,589602,theory(equality)])).
% cnf(590486,plain,(ld(X1,X1)=mult(ld(X1,X1),ld(X2,X2))),inference(rw,[status(thm)],[589843,15,theory(equality)])).
% cnf(591606,plain,(mult(ld(X1,X1),mult(ld(X1,X1),X1))=mult(mult(ld(X2,X2),ld(X1,X1)),X1)),inference(spm,[status(thm)],[62936,590486,theory(equality)])).
% cnf(592888,plain,(X1=mult(mult(ld(X2,X2),ld(X1,X1)),X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[591606,1284,theory(equality)]),1284,theory(equality)])).
% cnf(592889,plain,(X1=mult(ld(X2,X2),X1)),inference(rw,[status(thm)],[592888,590486,theory(equality)])).
% cnf(594190,plain,(X2=mult(mult(ld(X1,X1),X2),ld(X1,X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[63879,592889,theory(equality)]),23,theory(equality)])).
% cnf(594191,plain,(X2=mult(X2,ld(X1,X1))),inference(rw,[status(thm)],[594190,592889,theory(equality)])).
% cnf(594220,negated_conjecture,(mult(esk1_0,ld(esk2_0,esk2_0))!=esk1_0|$false),inference(rw,[status(thm)],[21,592889,theory(equality)])).
% cnf(594221,negated_conjecture,(mult(esk1_0,ld(esk2_0,esk2_0))!=esk1_0),inference(cn,[status(thm)],[594220,theory(equality)])).
% cnf(598338,negated_conjecture,($false),inference(rw,[status(thm)],[594221,594191,theory(equality)])).
% cnf(598339,negated_conjecture,($false),inference(cn,[status(thm)],[598338,theory(equality)])).
% cnf(598340,negated_conjecture,($false),598339,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 3925
% # ...of these trivial                : 1927
% # ...subsumed                        : 1233
% # ...remaining for further processing: 765
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 247
% # Generated clauses                  : 313713
% # ...of the previous two non-trivial : 273385
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 313713
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 518
% #    Positive orientable unit clauses: 501
% #    Positive unorientable unit clauses: 17
% #    Negative unit clauses           : 0
% #    Non-unit-clauses                : 0
% # Current number of unprocessed clauses: 177180
% # ...number of literals in the above : 177180
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 229
% # Rewrite failures with RHS unbound  : 456
% # Indexed BW rewrite attempts        : 5195
% # Indexed BW rewrite successes       : 312
% # Backwards rewriting index:   373 leaves,   3.47+/-4.533 terms/leaf
% # Paramod-from index:          292 leaves,   1.78+/-1.454 terms/leaf
% # Paramod-into index:          349 leaves,   2.99+/-3.737 terms/leaf
% # -------------------------------------------------
% # User time              : 14.050 s
% # System time            : 0.521 s
% # Total time             : 14.571 s
% # Maximum resident set size: 0 pages
% PrfWatch: 25.45 CPU 26.43 WC
% FINAL PrfWatch: 25.45 CPU 26.43 WC
% SZS output end Solution for /tmp/SystemOnTPTP32399/GRP654+3.tptp
% 
%------------------------------------------------------------------------------