TSTP Solution File: KLE025+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE025+2 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art03.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:35:59 EST 2010
% Result : Theorem 3.58s
% Output : Solution 3.58s
% 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/SystemOnTPTP8014/KLE025+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8014/KLE025+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8014/KLE025+2.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 8110
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.93 CPU 2.02 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(6, axiom,![X4]:![X5]:((test(X4)&test(X5))=>c(multiplication(X4,X5))=addition(c(X4),c(X5))),file('/tmp/SRASS.s.p', test_deMorgan2)).
% fof(7, axiom,![X4]:![X5]:(test(X4)=>(c(X4)=X5<=>complement(X4,X5))),file('/tmp/SRASS.s.p', test_3)).
% fof(8, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(9, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(11, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(12, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', right_distributivity)).
% fof(13, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(14, axiom,![X4]:(test(X4)<=>?[X5]:complement(X5,X4)),file('/tmp/SRASS.s.p', test_1)).
% fof(15, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(16, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(17, axiom,![X4]:![X5]:(complement(X5,X4)<=>((multiplication(X4,X5)=zero&multiplication(X5,X4)=zero)&addition(X4,X5)=one)),file('/tmp/SRASS.s.p', test_2)).
% fof(19, conjecture,![X4]:![X5]:![X6]:((test(X5)&test(X6))=>(multiplication(multiplication(X5,X4),c(X6))=zero=>multiplication(X5,X4)=multiplication(multiplication(X5,X4),X6))),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X4]:![X5]:![X6]:((test(X5)&test(X6))=>(multiplication(multiplication(X5,X4),c(X6))=zero=>multiplication(X5,X4)=multiplication(multiplication(X5,X4),X6)))),inference(assume_negation,[status(cth)],[19])).
% fof(22, plain,![X4]:![X5]:![X6]:multiplication(X4,multiplication(X5,X6))=multiplication(multiplication(X4,X5),X6),inference(variable_rename,[status(thm)],[1])).
% cnf(23,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[22])).
% fof(34, plain,![X4]:![X5]:((~(test(X4))|~(test(X5)))|c(multiplication(X4,X5))=addition(c(X4),c(X5))),inference(fof_nnf,[status(thm)],[6])).
% fof(35, plain,![X6]:![X7]:((~(test(X6))|~(test(X7)))|c(multiplication(X6,X7))=addition(c(X6),c(X7))),inference(variable_rename,[status(thm)],[34])).
% cnf(36,plain,(c(multiplication(X1,X2))=addition(c(X1),c(X2))|~test(X2)|~test(X1)),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X4]:![X5]:(~(test(X4))|((~(c(X4)=X5)|complement(X4,X5))&(~(complement(X4,X5))|c(X4)=X5))),inference(fof_nnf,[status(thm)],[7])).
% fof(38, plain,![X6]:![X7]:(~(test(X6))|((~(c(X6)=X7)|complement(X6,X7))&(~(complement(X6,X7))|c(X6)=X7))),inference(variable_rename,[status(thm)],[37])).
% fof(39, plain,![X6]:![X7]:(((~(c(X6)=X7)|complement(X6,X7))|~(test(X6)))&((~(complement(X6,X7))|c(X6)=X7)|~(test(X6)))),inference(distribute,[status(thm)],[38])).
% cnf(41,plain,(complement(X1,X2)|~test(X1)|c(X1)!=X2),inference(split_conjunct,[status(thm)],[39])).
% fof(42, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[8])).
% cnf(43,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[42])).
% fof(44, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[9])).
% cnf(45,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[44])).
% fof(48, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[11])).
% cnf(49,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[48])).
% fof(50, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[12])).
% cnf(51,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[50])).
% fof(52, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[13])).
% cnf(53,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[52])).
% fof(54, plain,![X4]:((~(test(X4))|?[X5]:complement(X5,X4))&(![X5]:~(complement(X5,X4))|test(X4))),inference(fof_nnf,[status(thm)],[14])).
% fof(55, plain,![X6]:((~(test(X6))|?[X7]:complement(X7,X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(variable_rename,[status(thm)],[54])).
% fof(56, plain,![X6]:((~(test(X6))|complement(esk1_1(X6),X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(skolemize,[status(esa)],[55])).
% fof(57, plain,![X6]:![X8]:((~(complement(X8,X6))|test(X6))&(~(test(X6))|complement(esk1_1(X6),X6))),inference(shift_quantors,[status(thm)],[56])).
% cnf(58,plain,(complement(esk1_1(X1),X1)|~test(X1)),inference(split_conjunct,[status(thm)],[57])).
% cnf(59,plain,(test(X1)|~complement(X2,X1)),inference(split_conjunct,[status(thm)],[57])).
% fof(60, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[15])).
% cnf(61,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[60])).
% fof(62, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[16])).
% cnf(63,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[62])).
% fof(64, 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)],[17])).
% fof(65, 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)],[64])).
% fof(66, 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)],[65])).
% cnf(68,plain,(addition(X2,X1)=one|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[66])).
% cnf(70,plain,(multiplication(X2,X1)=zero|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[66])).
% fof(75, negated_conjecture,?[X4]:?[X5]:?[X6]:((test(X5)&test(X6))&(multiplication(multiplication(X5,X4),c(X6))=zero&~(multiplication(X5,X4)=multiplication(multiplication(X5,X4),X6)))),inference(fof_nnf,[status(thm)],[20])).
% fof(76, negated_conjecture,?[X7]:?[X8]:?[X9]:((test(X8)&test(X9))&(multiplication(multiplication(X8,X7),c(X9))=zero&~(multiplication(X8,X7)=multiplication(multiplication(X8,X7),X9)))),inference(variable_rename,[status(thm)],[75])).
% fof(77, negated_conjecture,((test(esk3_0)&test(esk4_0))&(multiplication(multiplication(esk3_0,esk2_0),c(esk4_0))=zero&~(multiplication(esk3_0,esk2_0)=multiplication(multiplication(esk3_0,esk2_0),esk4_0)))),inference(skolemize,[status(esa)],[76])).
% cnf(78,negated_conjecture,(multiplication(esk3_0,esk2_0)!=multiplication(multiplication(esk3_0,esk2_0),esk4_0)),inference(split_conjunct,[status(thm)],[77])).
% cnf(79,negated_conjecture,(multiplication(multiplication(esk3_0,esk2_0),c(esk4_0))=zero),inference(split_conjunct,[status(thm)],[77])).
% cnf(80,negated_conjecture,(test(esk4_0)),inference(split_conjunct,[status(thm)],[77])).
% cnf(84,plain,(complement(X1,c(X1))|~test(X1)),inference(er,[status(thm)],[41,theory(equality)])).
% cnf(87,plain,(multiplication(X1,esk1_1(X1))=zero|~test(X1)),inference(spm,[status(thm)],[70,58,theory(equality)])).
% cnf(88,plain,(addition(X1,esk1_1(X1))=one|~test(X1)),inference(spm,[status(thm)],[68,58,theory(equality)])).
% cnf(116,negated_conjecture,(multiplication(esk3_0,multiplication(esk2_0,c(esk4_0)))=zero),inference(rw,[status(thm)],[79,23,theory(equality)])).
% cnf(117,negated_conjecture,(multiplication(esk3_0,multiplication(esk2_0,esk4_0))!=multiplication(esk3_0,esk2_0)),inference(rw,[status(thm)],[78,23,theory(equality)])).
% cnf(138,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[43,45,theory(equality)])).
% cnf(224,plain,(c(multiplication(X1,X1))=c(X1)|~test(X1)),inference(spm,[status(thm)],[49,36,theory(equality)])).
% cnf(246,plain,(addition(c(X1),X1)=one|~test(X1)),inference(spm,[status(thm)],[68,84,theory(equality)])).
% cnf(252,negated_conjecture,(addition(zero,multiplication(esk3_0,X1))=multiplication(esk3_0,addition(multiplication(esk2_0,c(esk4_0)),X1))),inference(spm,[status(thm)],[51,116,theory(equality)])).
% cnf(260,negated_conjecture,(multiplication(esk3_0,X1)=multiplication(esk3_0,addition(multiplication(esk2_0,c(esk4_0)),X1))),inference(rw,[status(thm)],[252,138,theory(equality)])).
% cnf(336,plain,(zero=multiplication(X1,multiplication(X2,esk1_1(multiplication(X1,X2))))|~test(multiplication(X1,X2))),inference(spm,[status(thm)],[23,87,theory(equality)])).
% cnf(339,plain,(addition(zero,multiplication(X1,X2))=multiplication(X1,addition(esk1_1(X1),X2))|~test(X1)),inference(spm,[status(thm)],[51,87,theory(equality)])).
% cnf(341,plain,(addition(multiplication(X1,X2),zero)=multiplication(X1,addition(X2,esk1_1(X1)))|~test(X1)),inference(spm,[status(thm)],[51,87,theory(equality)])).
% cnf(342,plain,(addition(multiplication(X1,esk1_1(X2)),zero)=multiplication(addition(X1,X2),esk1_1(X2))|~test(X2)),inference(spm,[status(thm)],[53,87,theory(equality)])).
% cnf(346,plain,(multiplication(X1,X2)=multiplication(X1,addition(esk1_1(X1),X2))|~test(X1)),inference(rw,[status(thm)],[339,138,theory(equality)])).
% cnf(348,plain,(multiplication(X1,X2)=multiplication(X1,addition(X2,esk1_1(X1)))|~test(X1)),inference(rw,[status(thm)],[341,43,theory(equality)])).
% cnf(349,plain,(multiplication(X1,esk1_1(X2))=multiplication(addition(X1,X2),esk1_1(X2))|~test(X2)),inference(rw,[status(thm)],[342,43,theory(equality)])).
% cnf(5748,plain,(addition(X1,c(X1))=one|~test(X1)),inference(rw,[status(thm)],[246,45,theory(equality)])).
% cnf(8822,plain,(complement(multiplication(X1,X1),c(X1))|~test(multiplication(X1,X1))|~test(X1)),inference(spm,[status(thm)],[84,224,theory(equality)])).
% cnf(11420,negated_conjecture,(multiplication(esk3_0,multiplication(esk2_0,addition(c(esk4_0),X1)))=multiplication(esk3_0,multiplication(esk2_0,X1))),inference(spm,[status(thm)],[260,51,theory(equality)])).
% cnf(15726,plain,(multiplication(X1,one)=multiplication(X1,esk1_1(esk1_1(X1)))|~test(X1)|~test(esk1_1(X1))),inference(spm,[status(thm)],[346,88,theory(equality)])).
% cnf(15798,plain,(X1=multiplication(X1,esk1_1(esk1_1(X1)))|~test(X1)|~test(esk1_1(X1))),inference(rw,[status(thm)],[15726,61,theory(equality)])).
% cnf(16831,plain,(multiplication(X1,one)=multiplication(X1,X1)|~test(X1)),inference(spm,[status(thm)],[348,88,theory(equality)])).
% cnf(16892,plain,(X1=multiplication(X1,X1)|~test(X1)),inference(rw,[status(thm)],[16831,61,theory(equality)])).
% cnf(20197,negated_conjecture,(multiplication(esk4_0,esk4_0)=esk4_0),inference(spm,[status(thm)],[16892,80,theory(equality)])).
% cnf(20252,negated_conjecture,(multiplication(esk4_0,X1)=multiplication(esk4_0,multiplication(esk4_0,X1))),inference(spm,[status(thm)],[23,20197,theory(equality)])).
% cnf(20260,negated_conjecture,(multiplication(esk4_0,multiplication(esk4_0,esk1_1(esk4_0)))=zero|~test(esk4_0)),inference(spm,[status(thm)],[336,20197,theory(equality)])).
% cnf(20311,negated_conjecture,(multiplication(esk4_0,multiplication(esk4_0,esk1_1(esk4_0)))=zero|$false),inference(rw,[status(thm)],[20260,80,theory(equality)])).
% cnf(20312,negated_conjecture,(multiplication(esk4_0,multiplication(esk4_0,esk1_1(esk4_0)))=zero),inference(cn,[status(thm)],[20311,theory(equality)])).
% cnf(20774,negated_conjecture,(multiplication(esk4_0,esk1_1(esk4_0))=zero),inference(rw,[status(thm)],[20312,20252,theory(equality)])).
% cnf(20780,negated_conjecture,(addition(zero,multiplication(X1,esk1_1(esk4_0)))=multiplication(addition(esk4_0,X1),esk1_1(esk4_0))),inference(spm,[status(thm)],[53,20774,theory(equality)])).
% cnf(20813,negated_conjecture,(multiplication(X1,esk1_1(esk4_0))=multiplication(addition(esk4_0,X1),esk1_1(esk4_0))),inference(rw,[status(thm)],[20780,138,theory(equality)])).
% cnf(21916,negated_conjecture,(multiplication(one,esk1_1(esk4_0))=multiplication(c(esk4_0),esk1_1(esk4_0))|~test(esk4_0)),inference(spm,[status(thm)],[20813,5748,theory(equality)])).
% cnf(21952,negated_conjecture,(esk1_1(esk4_0)=multiplication(c(esk4_0),esk1_1(esk4_0))|~test(esk4_0)),inference(rw,[status(thm)],[21916,63,theory(equality)])).
% cnf(21953,negated_conjecture,(esk1_1(esk4_0)=multiplication(c(esk4_0),esk1_1(esk4_0))|$false),inference(rw,[status(thm)],[21952,80,theory(equality)])).
% cnf(21954,negated_conjecture,(esk1_1(esk4_0)=multiplication(c(esk4_0),esk1_1(esk4_0))),inference(cn,[status(thm)],[21953,theory(equality)])).
% cnf(37311,negated_conjecture,(complement(esk4_0,c(esk4_0))|~test(esk4_0)),inference(spm,[status(thm)],[8822,20197,theory(equality)])).
% cnf(37322,negated_conjecture,(complement(esk4_0,c(esk4_0))|$false),inference(rw,[status(thm)],[37311,80,theory(equality)])).
% cnf(37323,negated_conjecture,(complement(esk4_0,c(esk4_0))),inference(cn,[status(thm)],[37322,theory(equality)])).
% cnf(37459,negated_conjecture,(test(c(esk4_0))),inference(spm,[status(thm)],[59,37323,theory(equality)])).
% cnf(37460,negated_conjecture,(multiplication(c(esk4_0),esk4_0)=zero),inference(spm,[status(thm)],[70,37323,theory(equality)])).
% cnf(37461,negated_conjecture,(addition(c(esk4_0),esk4_0)=one),inference(spm,[status(thm)],[68,37323,theory(equality)])).
% cnf(37464,negated_conjecture,(addition(esk4_0,c(esk4_0))=one),inference(rw,[status(thm)],[37461,45,theory(equality)])).
% cnf(37492,negated_conjecture,(addition(zero,multiplication(c(esk4_0),X1))=multiplication(c(esk4_0),addition(esk4_0,X1))),inference(spm,[status(thm)],[51,37460,theory(equality)])).
% cnf(37555,negated_conjecture,(multiplication(c(esk4_0),X1)=multiplication(c(esk4_0),addition(esk4_0,X1))),inference(rw,[status(thm)],[37492,138,theory(equality)])).
% cnf(37634,negated_conjecture,(multiplication(one,esk1_1(c(esk4_0)))=multiplication(esk4_0,esk1_1(c(esk4_0)))|~test(c(esk4_0))),inference(spm,[status(thm)],[349,37464,theory(equality)])).
% cnf(37711,negated_conjecture,(esk1_1(c(esk4_0))=multiplication(esk4_0,esk1_1(c(esk4_0)))|~test(c(esk4_0))),inference(rw,[status(thm)],[37634,63,theory(equality)])).
% cnf(37712,negated_conjecture,(esk1_1(c(esk4_0))=multiplication(esk4_0,esk1_1(c(esk4_0)))|$false),inference(rw,[status(thm)],[37711,37459,theory(equality)])).
% cnf(37713,negated_conjecture,(esk1_1(c(esk4_0))=multiplication(esk4_0,esk1_1(c(esk4_0)))),inference(cn,[status(thm)],[37712,theory(equality)])).
% cnf(41166,negated_conjecture,(multiplication(c(esk4_0),one)=multiplication(c(esk4_0),esk1_1(esk4_0))|~test(esk4_0)),inference(spm,[status(thm)],[37555,88,theory(equality)])).
% cnf(41258,negated_conjecture,(c(esk4_0)=multiplication(c(esk4_0),esk1_1(esk4_0))|~test(esk4_0)),inference(rw,[status(thm)],[41166,61,theory(equality)])).
% cnf(41259,negated_conjecture,(c(esk4_0)=esk1_1(esk4_0)|~test(esk4_0)),inference(rw,[status(thm)],[41258,21954,theory(equality)])).
% cnf(41260,negated_conjecture,(c(esk4_0)=esk1_1(esk4_0)|$false),inference(rw,[status(thm)],[41259,80,theory(equality)])).
% cnf(41261,negated_conjecture,(c(esk4_0)=esk1_1(esk4_0)),inference(cn,[status(thm)],[41260,theory(equality)])).
% cnf(41288,negated_conjecture,(multiplication(esk4_0,esk1_1(c(esk4_0)))=esk4_0|~test(c(esk4_0))|~test(esk4_0)),inference(spm,[status(thm)],[15798,41261,theory(equality)])).
% cnf(41386,negated_conjecture,(esk1_1(c(esk4_0))=esk4_0|~test(c(esk4_0))|~test(esk4_0)),inference(rw,[status(thm)],[41288,37713,theory(equality)])).
% cnf(41387,negated_conjecture,(esk1_1(c(esk4_0))=esk4_0|$false|~test(esk4_0)),inference(rw,[status(thm)],[41386,37459,theory(equality)])).
% cnf(41388,negated_conjecture,(esk1_1(c(esk4_0))=esk4_0|$false|$false),inference(rw,[status(thm)],[41387,80,theory(equality)])).
% cnf(41389,negated_conjecture,(esk1_1(c(esk4_0))=esk4_0),inference(cn,[status(thm)],[41388,theory(equality)])).
% cnf(107082,negated_conjecture,(multiplication(esk3_0,multiplication(esk2_0,one))=multiplication(esk3_0,multiplication(esk2_0,esk1_1(c(esk4_0))))|~test(c(esk4_0))),inference(spm,[status(thm)],[11420,88,theory(equality)])).
% cnf(107175,negated_conjecture,(multiplication(esk3_0,esk2_0)=multiplication(esk3_0,multiplication(esk2_0,esk1_1(c(esk4_0))))|~test(c(esk4_0))),inference(rw,[status(thm)],[107082,61,theory(equality)])).
% cnf(107176,negated_conjecture,(multiplication(esk3_0,esk2_0)=multiplication(esk3_0,multiplication(esk2_0,esk4_0))|~test(c(esk4_0))),inference(rw,[status(thm)],[107175,41389,theory(equality)])).
% cnf(107177,negated_conjecture,(multiplication(esk3_0,esk2_0)=multiplication(esk3_0,multiplication(esk2_0,esk4_0))|$false),inference(rw,[status(thm)],[107176,37459,theory(equality)])).
% cnf(107178,negated_conjecture,(multiplication(esk3_0,esk2_0)=multiplication(esk3_0,multiplication(esk2_0,esk4_0))),inference(cn,[status(thm)],[107177,theory(equality)])).
% cnf(107179,negated_conjecture,($false),inference(sr,[status(thm)],[107178,117,theory(equality)])).
% cnf(107180,negated_conjecture,($false),107179,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 4522
% # ...of these trivial : 895
% # ...subsumed : 2654
% # ...remaining for further processing: 973
% # Other redundant clauses eliminated : 4
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 7
% # Backward-rewritten : 191
% # Generated clauses : 52658
% # ...of the previous two non-trivial : 32223
% # Contextual simplify-reflections : 309
% # Paramodulations : 52625
% # Factorizations : 0
% # Equation resolutions : 24
% # Current number of processed clauses: 775
% # Positive orientable unit clauses: 430
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 3
% # Non-unit-clauses : 337
% # Current number of unprocessed clauses: 24019
% # ...number of literals in the above : 45843
% # Clause-clause subsumption calls (NU) : 13644
% # Rec. Clause-clause subsumption calls : 13453
% # Unit Clause-clause subsumption calls : 215
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 893
% # Indexed BW rewrite successes : 113
% # Backwards rewriting index: 713 leaves, 1.55+/-1.332 terms/leaf
% # Paramod-from index: 374 leaves, 1.50+/-1.089 terms/leaf
% # Paramod-into index: 562 leaves, 1.60+/-1.396 terms/leaf
% # -------------------------------------------------
% # User time : 1.373 s
% # System time : 0.048 s
% # Total time : 1.421 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.77 CPU 2.88 WC
% FINAL PrfWatch: 2.77 CPU 2.88 WC
% SZS output end Solution for /tmp/SystemOnTPTP8014/KLE025+2.tptp
%
%------------------------------------------------------------------------------