TSTP Solution File: KLE010+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE010+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 : art04.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:31:31 EST 2010
% Result : Theorem 2.69s
% Output : Solution 2.69s
% 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/SystemOnTPTP8520/KLE010+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8520/KLE010+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8520/KLE010+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 8616
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(2, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(3, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(4, axiom,![X1]:![X2]:![X3]:multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(5, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(6, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(7, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', right_distributivity)).
% fof(8, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(10, axiom,![X4]:![X5]:((test(X4)&test(X5))=>c(multiplication(X4,X5))=addition(c(X4),c(X5))),file('/tmp/SRASS.s.p', test_deMorgan2)).
% fof(12, axiom,![X4]:![X5]:(test(X4)=>(c(X4)=X5<=>complement(X4,X5))),file('/tmp/SRASS.s.p', test_3)).
% fof(13, 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(14, axiom,![X4]:(test(X4)<=>?[X5]:complement(X5,X4)),file('/tmp/SRASS.s.p', test_1)).
% fof(16, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(18, axiom,![X1]:multiplication(zero,X1)=zero,file('/tmp/SRASS.s.p', left_annihilation)).
% fof(19, conjecture,![X4]:![X5]:((test(X5)&test(X4))=>one=addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5)))),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X4]:![X5]:((test(X5)&test(X4))=>one=addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))))),inference(assume_negation,[status(cth)],[19])).
% fof(22, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(23,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[2])).
% cnf(25,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(27,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X4]:![X5]:![X6]:multiplication(X4,multiplication(X5,X6))=multiplication(multiplication(X4,X5),X6),inference(variable_rename,[status(thm)],[4])).
% cnf(29,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[5])).
% cnf(31,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[6])).
% cnf(33,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[7])).
% cnf(35,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[8])).
% cnf(37,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[36])).
% fof(41, plain,![X4]:![X5]:((~(test(X4))|~(test(X5)))|c(multiplication(X4,X5))=addition(c(X4),c(X5))),inference(fof_nnf,[status(thm)],[10])).
% fof(42, plain,![X6]:![X7]:((~(test(X6))|~(test(X7)))|c(multiplication(X6,X7))=addition(c(X6),c(X7))),inference(variable_rename,[status(thm)],[41])).
% cnf(43,plain,(c(multiplication(X1,X2))=addition(c(X1),c(X2))|~test(X2)|~test(X1)),inference(split_conjunct,[status(thm)],[42])).
% fof(47, plain,![X4]:![X5]:(~(test(X4))|((~(c(X4)=X5)|complement(X4,X5))&(~(complement(X4,X5))|c(X4)=X5))),inference(fof_nnf,[status(thm)],[12])).
% fof(48, plain,![X6]:![X7]:(~(test(X6))|((~(c(X6)=X7)|complement(X6,X7))&(~(complement(X6,X7))|c(X6)=X7))),inference(variable_rename,[status(thm)],[47])).
% fof(49, plain,![X6]:![X7]:(((~(c(X6)=X7)|complement(X6,X7))|~(test(X6)))&((~(complement(X6,X7))|c(X6)=X7)|~(test(X6)))),inference(distribute,[status(thm)],[48])).
% cnf(50,plain,(c(X1)=X2|~test(X1)|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[49])).
% cnf(51,plain,(complement(X1,X2)|~test(X1)|c(X1)!=X2),inference(split_conjunct,[status(thm)],[49])).
% fof(52, 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)],[13])).
% fof(53, 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)],[52])).
% fof(54, 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)],[53])).
% cnf(55,plain,(complement(X1,X2)|addition(X2,X1)!=one|multiplication(X1,X2)!=zero|multiplication(X2,X1)!=zero),inference(split_conjunct,[status(thm)],[54])).
% cnf(56,plain,(addition(X2,X1)=one|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[54])).
% cnf(57,plain,(multiplication(X1,X2)=zero|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[54])).
% cnf(58,plain,(multiplication(X2,X1)=zero|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[54])).
% fof(59, plain,![X4]:((~(test(X4))|?[X5]:complement(X5,X4))&(![X5]:~(complement(X5,X4))|test(X4))),inference(fof_nnf,[status(thm)],[14])).
% fof(60, plain,![X6]:((~(test(X6))|?[X7]:complement(X7,X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(variable_rename,[status(thm)],[59])).
% fof(61, plain,![X6]:((~(test(X6))|complement(esk1_1(X6),X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(skolemize,[status(esa)],[60])).
% fof(62, plain,![X6]:![X8]:((~(complement(X8,X6))|test(X6))&(~(test(X6))|complement(esk1_1(X6),X6))),inference(shift_quantors,[status(thm)],[61])).
% cnf(63,plain,(complement(esk1_1(X1),X1)|~test(X1)),inference(split_conjunct,[status(thm)],[62])).
% cnf(64,plain,(test(X1)|~complement(X2,X1)),inference(split_conjunct,[status(thm)],[62])).
% fof(69, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[16])).
% cnf(70,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[69])).
% fof(73, plain,![X2]:multiplication(zero,X2)=zero,inference(variable_rename,[status(thm)],[18])).
% cnf(74,plain,(multiplication(zero,X1)=zero),inference(split_conjunct,[status(thm)],[73])).
% fof(75, negated_conjecture,?[X4]:?[X5]:((test(X5)&test(X4))&~(one=addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))))),inference(fof_nnf,[status(thm)],[20])).
% fof(76, negated_conjecture,?[X6]:?[X7]:((test(X7)&test(X6))&~(one=addition(addition(addition(addition(multiplication(X7,X6),multiplication(c(X7),X6)),multiplication(X6,X7)),multiplication(c(X6),X7)),multiplication(c(X6),c(X7))))),inference(variable_rename,[status(thm)],[75])).
% fof(77, negated_conjecture,((test(esk3_0)&test(esk2_0))&~(one=addition(addition(addition(addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)),multiplication(esk2_0,esk3_0)),multiplication(c(esk2_0),esk3_0)),multiplication(c(esk2_0),c(esk3_0))))),inference(skolemize,[status(esa)],[76])).
% cnf(78,negated_conjecture,(one!=addition(addition(addition(addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)),multiplication(esk2_0,esk3_0)),multiplication(c(esk2_0),esk3_0)),multiplication(c(esk2_0),c(esk3_0)))),inference(split_conjunct,[status(thm)],[77])).
% cnf(79,negated_conjecture,(test(esk2_0)),inference(split_conjunct,[status(thm)],[77])).
% cnf(80,negated_conjecture,(test(esk3_0)),inference(split_conjunct,[status(thm)],[77])).
% cnf(81,negated_conjecture,(addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),addition(multiplication(c(esk2_0),c(esk3_0)),multiplication(addition(esk3_0,c(esk3_0)),esk2_0))))!=one),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)],[78,37,theory(equality)]),23,theory(equality)]),25,theory(equality)]),23,theory(equality)]),25,theory(equality)]),25,theory(equality)]),23,theory(equality)])).
% cnf(82,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[70,23,theory(equality)])).
% cnf(90,plain,(addition(X1,esk1_1(X1))=one|~test(X1)),inference(spm,[status(thm)],[56,63,theory(equality)])).
% cnf(91,plain,(multiplication(X1,esk1_1(X1))=zero|~test(X1)),inference(spm,[status(thm)],[58,63,theory(equality)])).
% cnf(99,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[25,27,theory(equality)])).
% cnf(100,plain,(addition(addition(X2,X1),X3)=addition(X1,addition(X2,X3))),inference(spm,[status(thm)],[25,23,theory(equality)])).
% cnf(105,plain,(addition(X2,addition(X1,X3))=addition(X1,addition(X2,X3))),inference(rw,[status(thm)],[100,25,theory(equality)])).
% cnf(124,plain,(test(X1)|c(X2)!=X1|~test(X2)),inference(spm,[status(thm)],[64,51,theory(equality)])).
% cnf(125,plain,(addition(X1,X2)=one|c(X2)!=X1|~test(X2)),inference(spm,[status(thm)],[56,51,theory(equality)])).
% cnf(126,plain,(multiplication(X1,X2)=zero|c(X2)!=X1|~test(X2)),inference(spm,[status(thm)],[58,51,theory(equality)])).
% cnf(127,plain,(multiplication(X1,X2)=zero|c(X1)!=X2|~test(X1)),inference(spm,[status(thm)],[57,51,theory(equality)])).
% cnf(138,plain,(addition(multiplication(X1,X2),X1)=multiplication(X1,addition(X2,one))),inference(spm,[status(thm)],[35,31,theory(equality)])).
% cnf(161,plain,(c(multiplication(X1,X1))=c(X1)|~test(X1)),inference(spm,[status(thm)],[27,43,theory(equality)])).
% cnf(203,plain,(c(X1)=X2|~test(X1)|addition(X2,X1)!=one|multiplication(X2,X1)!=zero|multiplication(X1,X2)!=zero),inference(spm,[status(thm)],[50,55,theory(equality)])).
% cnf(224,plain,(test(c(X1))|~test(X1)),inference(er,[status(thm)],[124,theory(equality)])).
% cnf(236,plain,(addition(multiplication(X1,X2),zero)=multiplication(X1,addition(X2,esk1_1(X1)))|~test(X1)),inference(spm,[status(thm)],[35,91,theory(equality)])).
% cnf(241,plain,(multiplication(X1,X2)=multiplication(X1,addition(X2,esk1_1(X1)))|~test(X1)),inference(rw,[status(thm)],[236,70,theory(equality)])).
% cnf(256,plain,(addition(X1,one)=one|~test(X1)),inference(spm,[status(thm)],[99,90,theory(equality)])).
% cnf(273,negated_conjecture,(addition(esk2_0,one)=one),inference(spm,[status(thm)],[256,79,theory(equality)])).
% cnf(280,negated_conjecture,(addition(one,esk2_0)=one),inference(rw,[status(thm)],[273,23,theory(equality)])).
% cnf(281,negated_conjecture,(addition(one,X1)=addition(one,addition(esk2_0,X1))),inference(spm,[status(thm)],[25,280,theory(equality)])).
% cnf(899,plain,(addition(c(X1),X1)=one|~test(X1)),inference(er,[status(thm)],[125,theory(equality)])).
% cnf(902,plain,(addition(X1,multiplication(X2,X2))=one|c(X2)!=X1|~test(multiplication(X2,X2))|~test(X2)),inference(spm,[status(thm)],[125,161,theory(equality)])).
% cnf(906,plain,(addition(X1,c(X1))=one|~test(X1)),inference(rw,[status(thm)],[899,23,theory(equality)])).
% cnf(908,negated_conjecture,(addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),addition(multiplication(c(esk2_0),c(esk3_0)),multiplication(one,esk2_0))))!=one|~test(esk3_0)),inference(spm,[status(thm)],[81,906,theory(equality)])).
% cnf(919,plain,(addition(X1,one)=addition(X2,addition(X1,c(X2)))|~test(X2)),inference(spm,[status(thm)],[105,906,theory(equality)])).
% cnf(928,negated_conjecture,(addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),addition(multiplication(c(esk2_0),c(esk3_0)),esk2_0)))!=one|~test(esk3_0)),inference(rw,[status(thm)],[908,33,theory(equality)])).
% cnf(929,negated_conjecture,(addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),addition(multiplication(c(esk2_0),c(esk3_0)),esk2_0)))!=one|$false),inference(rw,[status(thm)],[928,80,theory(equality)])).
% cnf(930,negated_conjecture,(addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),addition(multiplication(c(esk2_0),c(esk3_0)),esk2_0)))!=one),inference(cn,[status(thm)],[929,theory(equality)])).
% cnf(948,negated_conjecture,(addition(esk2_0,addition(multiplication(esk2_0,esk3_0),multiplication(c(esk2_0),addition(esk3_0,c(esk3_0)))))!=one),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[930,23,theory(equality)]),105,theory(equality)]),35,theory(equality)]),105,theory(equality)])).
% cnf(950,negated_conjecture,(addition(esk2_0,addition(multiplication(esk2_0,esk3_0),multiplication(c(esk2_0),one)))!=one|~test(esk3_0)),inference(spm,[status(thm)],[948,906,theory(equality)])).
% cnf(954,negated_conjecture,(addition(esk2_0,addition(multiplication(esk2_0,esk3_0),c(esk2_0)))!=one|~test(esk3_0)),inference(rw,[status(thm)],[950,31,theory(equality)])).
% cnf(955,negated_conjecture,(addition(esk2_0,addition(multiplication(esk2_0,esk3_0),c(esk2_0)))!=one|$false),inference(rw,[status(thm)],[954,80,theory(equality)])).
% cnf(956,negated_conjecture,(addition(esk2_0,addition(multiplication(esk2_0,esk3_0),c(esk2_0)))!=one),inference(cn,[status(thm)],[955,theory(equality)])).
% cnf(988,plain,(multiplication(c(X1),X1)=zero|~test(X1)),inference(er,[status(thm)],[126,theory(equality)])).
% cnf(1060,plain,(multiplication(X1,c(X1))=zero|~test(X1)),inference(er,[status(thm)],[127,theory(equality)])).
% cnf(1074,plain,(multiplication(zero,X2)=multiplication(c(X1),multiplication(X1,X2))|~test(X1)),inference(spm,[status(thm)],[29,988,theory(equality)])).
% cnf(1075,plain,(addition(zero,multiplication(c(X1),X2))=multiplication(c(X1),addition(X1,X2))|~test(X1)),inference(spm,[status(thm)],[35,988,theory(equality)])).
% cnf(1085,plain,(zero=multiplication(c(X1),multiplication(X1,X2))|~test(X1)),inference(rw,[status(thm)],[1074,74,theory(equality)])).
% cnf(1086,plain,(multiplication(c(X1),X2)=multiplication(c(X1),addition(X1,X2))|~test(X1)),inference(rw,[status(thm)],[1075,82,theory(equality)])).
% cnf(1202,plain,(multiplication(zero,X2)=multiplication(X1,multiplication(c(X1),X2))|~test(X1)),inference(spm,[status(thm)],[29,1060,theory(equality)])).
% cnf(1214,plain,(zero=multiplication(X1,multiplication(c(X1),X2))|~test(X1)),inference(rw,[status(thm)],[1202,74,theory(equality)])).
% cnf(1530,plain,(addition(X1,multiplication(X1,X2))=multiplication(X1,addition(X2,one))),inference(rw,[status(thm)],[138,23,theory(equality)])).
% cnf(1532,negated_conjecture,(addition(one,multiplication(esk2_0,addition(X1,one)))=addition(one,multiplication(esk2_0,X1))),inference(spm,[status(thm)],[281,1530,theory(equality)])).
% cnf(7150,plain,(multiplication(X1,one)=multiplication(X1,X1)|~test(X1)),inference(spm,[status(thm)],[241,90,theory(equality)])).
% cnf(7179,plain,(X1=multiplication(X1,X1)|~test(X1)),inference(rw,[status(thm)],[7150,31,theory(equality)])).
% cnf(7182,negated_conjecture,(multiplication(esk3_0,esk3_0)=esk3_0),inference(spm,[status(thm)],[7179,80,theory(equality)])).
% cnf(16663,negated_conjecture,(multiplication(c(esk3_0),esk3_0)=zero|~test(esk3_0)),inference(spm,[status(thm)],[1085,7182,theory(equality)])).
% cnf(16769,negated_conjecture,(multiplication(c(esk3_0),esk3_0)=zero|$false),inference(rw,[status(thm)],[16663,80,theory(equality)])).
% cnf(16770,negated_conjecture,(multiplication(c(esk3_0),esk3_0)=zero),inference(cn,[status(thm)],[16769,theory(equality)])).
% cnf(23406,negated_conjecture,(addition(X1,esk3_0)=one|c(esk3_0)!=X1|~test(esk3_0)),inference(spm,[status(thm)],[902,7182,theory(equality)])).
% cnf(23421,negated_conjecture,(addition(X1,esk3_0)=one|c(esk3_0)!=X1|$false),inference(rw,[status(thm)],[23406,80,theory(equality)])).
% cnf(23422,negated_conjecture,(addition(X1,esk3_0)=one|c(esk3_0)!=X1),inference(cn,[status(thm)],[23421,theory(equality)])).
% cnf(23447,negated_conjecture,(addition(c(esk3_0),esk3_0)=one),inference(er,[status(thm)],[23422,theory(equality)])).
% cnf(23458,negated_conjecture,(addition(esk3_0,c(esk3_0))=one),inference(rw,[status(thm)],[23447,23,theory(equality)])).
% cnf(23474,negated_conjecture,(c(c(esk3_0))=esk3_0|multiplication(esk3_0,c(esk3_0))!=zero|multiplication(c(esk3_0),esk3_0)!=zero|~test(c(esk3_0))),inference(spm,[status(thm)],[203,23458,theory(equality)])).
% cnf(23544,negated_conjecture,(c(c(esk3_0))=esk3_0|multiplication(esk3_0,c(esk3_0))!=zero|$false|~test(c(esk3_0))),inference(rw,[status(thm)],[23474,16770,theory(equality)])).
% cnf(23545,negated_conjecture,(c(c(esk3_0))=esk3_0|multiplication(esk3_0,c(esk3_0))!=zero|~test(c(esk3_0))),inference(cn,[status(thm)],[23544,theory(equality)])).
% cnf(23779,negated_conjecture,(c(c(esk3_0))=esk3_0|multiplication(esk3_0,c(esk3_0))!=zero|~test(esk3_0)),inference(spm,[status(thm)],[23545,224,theory(equality)])).
% cnf(23803,negated_conjecture,(c(c(esk3_0))=esk3_0|multiplication(esk3_0,c(esk3_0))!=zero|$false),inference(rw,[status(thm)],[23779,80,theory(equality)])).
% cnf(23804,negated_conjecture,(c(c(esk3_0))=esk3_0|multiplication(esk3_0,c(esk3_0))!=zero),inference(cn,[status(thm)],[23803,theory(equality)])).
% cnf(25409,negated_conjecture,(addition(multiplication(esk2_0,esk3_0),one)!=one|~test(esk2_0)),inference(spm,[status(thm)],[956,919,theory(equality)])).
% cnf(25593,negated_conjecture,(addition(one,multiplication(esk2_0,esk3_0))!=one|~test(esk2_0)),inference(rw,[status(thm)],[25409,23,theory(equality)])).
% cnf(25594,negated_conjecture,(addition(one,multiplication(esk2_0,esk3_0))!=one|$false),inference(rw,[status(thm)],[25593,79,theory(equality)])).
% cnf(25595,negated_conjecture,(addition(one,multiplication(esk2_0,esk3_0))!=one),inference(cn,[status(thm)],[25594,theory(equality)])).
% cnf(27088,negated_conjecture,(multiplication(c(esk3_0),one)=multiplication(c(esk3_0),c(esk3_0))|~test(esk3_0)),inference(spm,[status(thm)],[1086,23458,theory(equality)])).
% cnf(27231,negated_conjecture,(c(esk3_0)=multiplication(c(esk3_0),c(esk3_0))|~test(esk3_0)),inference(rw,[status(thm)],[27088,31,theory(equality)])).
% cnf(27232,negated_conjecture,(c(esk3_0)=multiplication(c(esk3_0),c(esk3_0))|$false),inference(rw,[status(thm)],[27231,80,theory(equality)])).
% cnf(27233,negated_conjecture,(c(esk3_0)=multiplication(c(esk3_0),c(esk3_0))),inference(cn,[status(thm)],[27232,theory(equality)])).
% cnf(27473,negated_conjecture,(multiplication(esk3_0,c(esk3_0))=zero|~test(esk3_0)),inference(spm,[status(thm)],[1214,27233,theory(equality)])).
% cnf(27511,negated_conjecture,(multiplication(esk3_0,c(esk3_0))=zero|$false),inference(rw,[status(thm)],[27473,80,theory(equality)])).
% cnf(27512,negated_conjecture,(multiplication(esk3_0,c(esk3_0))=zero),inference(cn,[status(thm)],[27511,theory(equality)])).
% cnf(27571,negated_conjecture,(c(c(esk3_0))=esk3_0|$false),inference(rw,[status(thm)],[23804,27512,theory(equality)])).
% cnf(27572,negated_conjecture,(c(c(esk3_0))=esk3_0),inference(cn,[status(thm)],[27571,theory(equality)])).
% cnf(27692,negated_conjecture,(test(X1)|esk3_0!=X1|~test(c(esk3_0))),inference(spm,[status(thm)],[124,27572,theory(equality)])).
% cnf(27809,negated_conjecture,(test(X1)|esk3_0!=X1|~test(esk3_0)),inference(spm,[status(thm)],[27692,224,theory(equality)])).
% cnf(27824,negated_conjecture,(test(X1)|esk3_0!=X1|$false),inference(rw,[status(thm)],[27809,80,theory(equality)])).
% cnf(27825,negated_conjecture,(test(X1)|esk3_0!=X1),inference(cn,[status(thm)],[27824,theory(equality)])).
% cnf(28036,negated_conjecture,(addition(X1,one)=one|esk3_0!=X1),inference(spm,[status(thm)],[256,27825,theory(equality)])).
% cnf(47454,negated_conjecture,(addition(one,multiplication(esk2_0,one))=addition(one,multiplication(esk2_0,X1))|esk3_0!=X1),inference(spm,[status(thm)],[1532,28036,theory(equality)])).
% cnf(47569,negated_conjecture,(one=addition(one,multiplication(esk2_0,X1))|esk3_0!=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[47454,31,theory(equality)]),280,theory(equality)])).
% cnf(62736,negated_conjecture,($false),inference(spm,[status(thm)],[25595,47569,theory(equality)])).
% cnf(62900,negated_conjecture,($false),62736,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2995
% # ...of these trivial : 218
% # ...subsumed : 2252
% # ...remaining for further processing: 525
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 32
% # Backward-rewritten : 65
% # Generated clauses : 30724
% # ...of the previous two non-trivial : 23623
% # Contextual simplify-reflections : 369
% # Paramodulations : 30712
% # Factorizations : 4
% # Equation resolutions : 8
% # Current number of processed clauses: 401
% # Positive orientable unit clauses: 113
% # Positive unorientable unit clauses: 9
% # Negative unit clauses : 25
% # Non-unit-clauses : 254
% # Current number of unprocessed clauses: 19393
% # ...number of literals in the above : 49074
% # Clause-clause subsumption calls (NU) : 11896
% # Rec. Clause-clause subsumption calls : 11198
% # Unit Clause-clause subsumption calls : 357
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 331
% # Indexed BW rewrite successes : 182
% # Backwards rewriting index: 286 leaves, 1.65+/-1.545 terms/leaf
% # Paramod-from index: 192 leaves, 1.30+/-0.936 terms/leaf
% # Paramod-into index: 269 leaves, 1.53+/-1.320 terms/leaf
% # -------------------------------------------------
% # User time : 0.913 s
% # System time : 0.040 s
% # Total time : 0.953 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.89 CPU 1.99 WC
% FINAL PrfWatch: 1.89 CPU 1.99 WC
% SZS output end Solution for /tmp/SystemOnTPTP8520/KLE010+3.tptp
%
%------------------------------------------------------------------------------