TSTP Solution File: KLE010+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE010+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 : art07.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:24 EST 2010
% Result : Theorem 1.59s
% Output : Solution 1.59s
% 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/SystemOnTPTP19030/KLE010+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19030/KLE010+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19030/KLE010+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 19126
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(2, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(3, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(4, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', right_distributivity)).
% fof(5, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(6, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(7, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(8, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(10, axiom,![X4]:(~(test(X4))=>c(X4)=zero),file('/tmp/SRASS.s.p', test_4)).
% fof(11, axiom,![X4]:![X5]:(test(X4)=>(c(X4)=X5<=>complement(X4,X5))),file('/tmp/SRASS.s.p', test_3)).
% fof(12, 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(13, axiom,![X4]:(test(X4)<=>?[X5]:complement(X5,X4)),file('/tmp/SRASS.s.p', test_1)).
% fof(14, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(17, conjecture,![X4]:![X5]:((test(X5)&test(X4))=>(leq(one,addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))))&leq(addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))),one))),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X4]:![X5]:((test(X5)&test(X4))=>(leq(one,addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))))&leq(addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))),one)))),inference(assume_negation,[status(cth)],[17])).
% fof(19, plain,![X4]:(~(test(X4))=>c(X4)=zero),inference(fof_simplification,[status(thm)],[10,theory(equality)])).
% fof(20, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(21, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[20])).
% cnf(22,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[21])).
% fof(24, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[2])).
% cnf(25,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(27,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[4])).
% cnf(29,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[5])).
% cnf(31,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[6])).
% cnf(33,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[7])).
% cnf(35,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[8])).
% cnf(37,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[36])).
% fof(40, plain,![X4]:(test(X4)|c(X4)=zero),inference(fof_nnf,[status(thm)],[19])).
% fof(41, plain,![X5]:(test(X5)|c(X5)=zero),inference(variable_rename,[status(thm)],[40])).
% cnf(42,plain,(c(X1)=zero|test(X1)),inference(split_conjunct,[status(thm)],[41])).
% fof(43, plain,![X4]:![X5]:(~(test(X4))|((~(c(X4)=X5)|complement(X4,X5))&(~(complement(X4,X5))|c(X4)=X5))),inference(fof_nnf,[status(thm)],[11])).
% fof(44, plain,![X6]:![X7]:(~(test(X6))|((~(c(X6)=X7)|complement(X6,X7))&(~(complement(X6,X7))|c(X6)=X7))),inference(variable_rename,[status(thm)],[43])).
% fof(45, plain,![X6]:![X7]:(((~(c(X6)=X7)|complement(X6,X7))|~(test(X6)))&((~(complement(X6,X7))|c(X6)=X7)|~(test(X6)))),inference(distribute,[status(thm)],[44])).
% cnf(46,plain,(c(X1)=X2|~test(X1)|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[45])).
% cnf(47,plain,(complement(X1,X2)|~test(X1)|c(X1)!=X2),inference(split_conjunct,[status(thm)],[45])).
% fof(48, 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)],[12])).
% fof(49, 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)],[48])).
% fof(50, 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)],[49])).
% cnf(51,plain,(complement(X1,X2)|addition(X2,X1)!=one|multiplication(X1,X2)!=zero|multiplication(X2,X1)!=zero),inference(split_conjunct,[status(thm)],[50])).
% cnf(52,plain,(addition(X2,X1)=one|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[50])).
% cnf(53,plain,(multiplication(X1,X2)=zero|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[50])).
% cnf(54,plain,(multiplication(X2,X1)=zero|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[50])).
% fof(55, plain,![X4]:((~(test(X4))|?[X5]:complement(X5,X4))&(![X5]:~(complement(X5,X4))|test(X4))),inference(fof_nnf,[status(thm)],[13])).
% fof(56, plain,![X6]:((~(test(X6))|?[X7]:complement(X7,X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(variable_rename,[status(thm)],[55])).
% fof(57, plain,![X6]:((~(test(X6))|complement(esk1_1(X6),X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(skolemize,[status(esa)],[56])).
% fof(58, plain,![X6]:![X8]:((~(complement(X8,X6))|test(X6))&(~(test(X6))|complement(esk1_1(X6),X6))),inference(shift_quantors,[status(thm)],[57])).
% cnf(59,plain,(complement(esk1_1(X1),X1)|~test(X1)),inference(split_conjunct,[status(thm)],[58])).
% cnf(60,plain,(test(X1)|~complement(X2,X1)),inference(split_conjunct,[status(thm)],[58])).
% fof(61, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[14])).
% cnf(62,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[61])).
% fof(67, negated_conjecture,?[X4]:?[X5]:((test(X5)&test(X4))&(~(leq(one,addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5)))))|~(leq(addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))),one)))),inference(fof_nnf,[status(thm)],[18])).
% fof(68, negated_conjecture,?[X6]:?[X7]:((test(X7)&test(X6))&(~(leq(one,addition(addition(addition(addition(multiplication(X7,X6),multiplication(c(X7),X6)),multiplication(X6,X7)),multiplication(c(X6),X7)),multiplication(c(X6),c(X7)))))|~(leq(addition(addition(addition(addition(multiplication(X7,X6),multiplication(c(X7),X6)),multiplication(X6,X7)),multiplication(c(X6),X7)),multiplication(c(X6),c(X7))),one)))),inference(variable_rename,[status(thm)],[67])).
% fof(69, negated_conjecture,((test(esk3_0)&test(esk2_0))&(~(leq(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)))))|~(leq(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))),one)))),inference(skolemize,[status(esa)],[68])).
% cnf(70,negated_conjecture,(~leq(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))),one)|~leq(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)],[69])).
% cnf(71,negated_conjecture,(test(esk2_0)),inference(split_conjunct,[status(thm)],[69])).
% cnf(72,negated_conjecture,(test(esk3_0)),inference(split_conjunct,[status(thm)],[69])).
% cnf(73,negated_conjecture,(~leq(one,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)))))|~leq(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))),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)],[70,31,theory(equality)]),33,theory(equality)]),35,theory(equality)]),33,theory(equality)]),35,theory(equality)]),35,theory(equality)]),33,theory(equality)])).
% cnf(74,negated_conjecture,(~leq(one,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)))))|~leq(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)],[73,31,theory(equality)]),33,theory(equality)]),35,theory(equality)]),33,theory(equality)]),35,theory(equality)]),35,theory(equality)]),33,theory(equality)])).
% cnf(79,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[35,37,theory(equality)])).
% cnf(83,plain,(addition(X3,addition(X1,X2))=addition(X1,addition(X2,X3))),inference(spm,[status(thm)],[35,33,theory(equality)])).
% cnf(84,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[62,33,theory(equality)])).
% cnf(114,plain,(addition(X1,esk1_1(X1))=one|~test(X1)),inference(spm,[status(thm)],[52,59,theory(equality)])).
% cnf(125,plain,(addition(multiplication(X1,X2),X1)=multiplication(X1,addition(X2,one))),inference(spm,[status(thm)],[29,25,theory(equality)])).
% cnf(148,negated_conjecture,(complement(esk3_0,X1)|c(esk3_0)!=X1),inference(spm,[status(thm)],[47,72,theory(equality)])).
% cnf(149,negated_conjecture,(complement(esk2_0,X1)|c(esk2_0)!=X1),inference(spm,[status(thm)],[47,71,theory(equality)])).
% cnf(150,plain,(complement(X1,X2)|c(X1)=zero|c(X1)!=X2),inference(spm,[status(thm)],[47,42,theory(equality)])).
% cnf(185,plain,(c(X1)=X2|~test(X1)|addition(X2,X1)!=one|multiplication(X2,X1)!=zero|multiplication(X1,X2)!=zero),inference(spm,[status(thm)],[46,51,theory(equality)])).
% cnf(187,negated_conjecture,(~leq(one,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)))))|addition(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)!=one),inference(spm,[status(thm)],[74,22,theory(equality)])).
% cnf(188,negated_conjecture,(~leq(one,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)))))|addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),addition(multiplication(c(esk2_0),c(esk3_0)),addition(multiplication(addition(esk3_0,c(esk3_0)),esk2_0),one))))!=one),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[187,35,theory(equality)]),35,theory(equality)]),35,theory(equality)])).
% cnf(196,negated_conjecture,(test(X1)|c(esk3_0)!=X1),inference(spm,[status(thm)],[60,148,theory(equality)])).
% cnf(197,negated_conjecture,(addition(X1,esk3_0)=one|c(esk3_0)!=X1),inference(spm,[status(thm)],[52,148,theory(equality)])).
% cnf(198,negated_conjecture,(multiplication(X1,esk3_0)=zero|c(esk3_0)!=X1),inference(spm,[status(thm)],[54,148,theory(equality)])).
% cnf(200,negated_conjecture,(multiplication(esk3_0,X1)=zero|c(esk3_0)!=X1),inference(spm,[status(thm)],[53,148,theory(equality)])).
% cnf(232,negated_conjecture,(~leq(one,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)))))|addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),addition(multiplication(c(esk2_0),c(esk3_0)),addition(one,multiplication(addition(esk3_0,c(esk3_0)),esk2_0)))))!=one),inference(rw,[status(thm)],[188,33,theory(equality)])).
% cnf(233,negated_conjecture,(addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),addition(multiplication(c(esk2_0),c(esk3_0)),addition(one,multiplication(addition(esk3_0,c(esk3_0)),esk2_0)))))!=one|addition(one,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)))))!=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))))),inference(spm,[status(thm)],[232,22,theory(equality)])).
% cnf(235,negated_conjecture,(addition(c(esk3_0),esk3_0)=one),inference(er,[status(thm)],[197,theory(equality)])).
% cnf(236,negated_conjecture,(addition(esk3_0,c(esk3_0))=one),inference(rw,[status(thm)],[235,33,theory(equality)])).
% cnf(239,negated_conjecture,(addition(one,addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),addition(esk2_0,multiplication(c(esk2_0),c(esk3_0))))))!=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))))|addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),addition(multiplication(c(esk2_0),c(esk3_0)),addition(one,multiplication(addition(esk3_0,c(esk3_0)),esk2_0)))))!=one),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[233,236,theory(equality)]),27,theory(equality)]),33,theory(equality)])).
% cnf(240,negated_conjecture,(addition(one,addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),addition(esk2_0,multiplication(c(esk2_0),c(esk3_0))))))!=addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),addition(esk2_0,multiplication(c(esk2_0),c(esk3_0)))))|addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),addition(multiplication(c(esk2_0),c(esk3_0)),addition(one,multiplication(addition(esk3_0,c(esk3_0)),esk2_0)))))!=one),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[239,236,theory(equality)]),27,theory(equality)]),33,theory(equality)])).
% cnf(241,negated_conjecture,(addition(one,addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),addition(esk2_0,multiplication(c(esk2_0),c(esk3_0))))))!=addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),addition(esk2_0,multiplication(c(esk2_0),c(esk3_0)))))|addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),addition(one,addition(esk2_0,multiplication(c(esk2_0),c(esk3_0))))))!=one),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[240,236,theory(equality)]),27,theory(equality)]),33,theory(equality)]),35,theory(equality)])).
% cnf(260,negated_conjecture,(multiplication(c(esk3_0),esk3_0)=zero),inference(er,[status(thm)],[198,theory(equality)])).
% cnf(262,negated_conjecture,(addition(zero,multiplication(c(esk3_0),X1))=multiplication(c(esk3_0),addition(esk3_0,X1))),inference(spm,[status(thm)],[29,260,theory(equality)])).
% cnf(267,negated_conjecture,(multiplication(c(esk3_0),X1)=multiplication(c(esk3_0),addition(esk3_0,X1))),inference(rw,[status(thm)],[262,84,theory(equality)])).
% cnf(287,negated_conjecture,(addition(X1,esk2_0)=one|c(esk2_0)!=X1),inference(spm,[status(thm)],[52,149,theory(equality)])).
% cnf(290,negated_conjecture,(multiplication(esk2_0,X1)=zero|c(esk2_0)!=X1),inference(spm,[status(thm)],[53,149,theory(equality)])).
% cnf(295,negated_conjecture,(addition(c(esk2_0),esk2_0)=one),inference(er,[status(thm)],[287,theory(equality)])).
% cnf(296,negated_conjecture,(addition(esk2_0,c(esk2_0))=one),inference(rw,[status(thm)],[295,33,theory(equality)])).
% cnf(308,negated_conjecture,(multiplication(esk3_0,c(esk3_0))=zero),inference(er,[status(thm)],[200,theory(equality)])).
% cnf(331,negated_conjecture,(addition(esk3_0,one)=one),inference(spm,[status(thm)],[79,236,theory(equality)])).
% cnf(333,negated_conjecture,(addition(esk2_0,one)=one),inference(spm,[status(thm)],[79,296,theory(equality)])).
% cnf(339,plain,(addition(X1,one)=one|~test(X1)),inference(spm,[status(thm)],[79,114,theory(equality)])).
% cnf(364,negated_conjecture,(addition(one,esk3_0)=one),inference(rw,[status(thm)],[331,33,theory(equality)])).
% cnf(371,negated_conjecture,(addition(one,esk2_0)=one),inference(rw,[status(thm)],[333,33,theory(equality)])).
% cnf(372,negated_conjecture,(addition(one,X1)=addition(one,addition(esk2_0,X1))),inference(spm,[status(thm)],[35,371,theory(equality)])).
% cnf(523,negated_conjecture,(addition(one,multiplication(esk2_0,esk3_0))!=addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),addition(esk2_0,multiplication(c(esk2_0),c(esk3_0)))))|addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),addition(one,addition(esk2_0,multiplication(c(esk2_0),c(esk3_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)],[inference(rw,[status(thm)],[241,83,theory(equality)]),29,theory(equality)]),33,theory(equality)]),236,theory(equality)]),25,theory(equality)]),296,theory(equality)]),33,theory(equality)]),79,theory(equality)])).
% cnf(524,negated_conjecture,($false|addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),addition(one,addition(esk2_0,multiplication(c(esk2_0),c(esk3_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)],[523,83,theory(equality)]),29,theory(equality)]),33,theory(equality)]),236,theory(equality)]),25,theory(equality)]),296,theory(equality)]),33,theory(equality)])).
% cnf(525,negated_conjecture,($false|addition(one,multiplication(esk2_0,esk3_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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[524,83,theory(equality)]),35,theory(equality)]),29,theory(equality)]),33,theory(equality)]),236,theory(equality)]),25,theory(equality)]),296,theory(equality)]),37,theory(equality)]),33,theory(equality)])).
% cnf(526,negated_conjecture,(addition(one,multiplication(esk2_0,esk3_0))!=one),inference(cn,[status(thm)],[525,theory(equality)])).
% cnf(1140,plain,(addition(X1,multiplication(X1,X2))=multiplication(X1,addition(X2,one))),inference(rw,[status(thm)],[125,33,theory(equality)])).
% cnf(1142,negated_conjecture,(addition(one,multiplication(esk2_0,addition(X1,one)))=addition(one,multiplication(esk2_0,X1))),inference(spm,[status(thm)],[372,1140,theory(equality)])).
% cnf(1287,negated_conjecture,(multiplication(esk2_0,c(esk2_0))=zero),inference(er,[status(thm)],[290,theory(equality)])).
% cnf(1295,negated_conjecture,(addition(multiplication(esk2_0,X1),zero)=multiplication(esk2_0,addition(X1,c(esk2_0)))),inference(spm,[status(thm)],[29,1287,theory(equality)])).
% cnf(1306,negated_conjecture,(multiplication(esk2_0,X1)=multiplication(esk2_0,addition(X1,c(esk2_0)))),inference(rw,[status(thm)],[1295,62,theory(equality)])).
% cnf(1476,plain,(test(X1)|c(X2)=zero|c(X2)!=X1),inference(spm,[status(thm)],[60,150,theory(equality)])).
% cnf(3274,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)],[185,236,theory(equality)])).
% cnf(3287,negated_conjecture,(c(esk3_0)=one|multiplication(one,esk3_0)!=zero|multiplication(esk3_0,one)!=zero|~test(esk3_0)),inference(spm,[status(thm)],[185,364,theory(equality)])).
% cnf(3319,negated_conjecture,(c(c(esk3_0))=esk3_0|$false|multiplication(c(esk3_0),esk3_0)!=zero|~test(c(esk3_0))),inference(rw,[status(thm)],[3274,308,theory(equality)])).
% cnf(3320,negated_conjecture,(c(c(esk3_0))=esk3_0|$false|$false|~test(c(esk3_0))),inference(rw,[status(thm)],[3319,260,theory(equality)])).
% cnf(3321,negated_conjecture,(c(c(esk3_0))=esk3_0|~test(c(esk3_0))),inference(cn,[status(thm)],[3320,theory(equality)])).
% cnf(3346,negated_conjecture,(c(esk3_0)=one|esk3_0!=zero|multiplication(esk3_0,one)!=zero|~test(esk3_0)),inference(rw,[status(thm)],[3287,27,theory(equality)])).
% cnf(3347,negated_conjecture,(c(esk3_0)=one|esk3_0!=zero|esk3_0!=zero|~test(esk3_0)),inference(rw,[status(thm)],[3346,25,theory(equality)])).
% cnf(3348,negated_conjecture,(c(esk3_0)=one|esk3_0!=zero|esk3_0!=zero|$false),inference(rw,[status(thm)],[3347,72,theory(equality)])).
% cnf(3349,negated_conjecture,(c(esk3_0)=one|esk3_0!=zero),inference(cn,[status(thm)],[3348,theory(equality)])).
% cnf(3481,negated_conjecture,(c(c(esk3_0))=esk3_0),inference(spm,[status(thm)],[3321,196,theory(equality)])).
% cnf(3649,negated_conjecture,(multiplication(one,addition(esk3_0,X1))=multiplication(one,X1)|esk3_0!=zero),inference(spm,[status(thm)],[267,3349,theory(equality)])).
% cnf(3674,negated_conjecture,(addition(esk3_0,X1)=multiplication(one,X1)|esk3_0!=zero),inference(rw,[status(thm)],[3649,27,theory(equality)])).
% cnf(3675,negated_conjecture,(addition(esk3_0,X1)=X1|esk3_0!=zero),inference(rw,[status(thm)],[3674,27,theory(equality)])).
% cnf(3688,negated_conjecture,(multiplication(esk2_0,c(esk2_0))=multiplication(esk2_0,esk3_0)|esk3_0!=zero),inference(spm,[status(thm)],[1306,3675,theory(equality)])).
% cnf(3730,negated_conjecture,(zero=multiplication(esk2_0,esk3_0)|esk3_0!=zero),inference(rw,[status(thm)],[3688,1287,theory(equality)])).
% cnf(3841,negated_conjecture,(addition(one,zero)!=one|esk3_0!=zero),inference(spm,[status(thm)],[526,3730,theory(equality)])).
% cnf(3865,negated_conjecture,($false|esk3_0!=zero),inference(rw,[status(thm)],[3841,62,theory(equality)])).
% cnf(3866,negated_conjecture,(esk3_0!=zero),inference(cn,[status(thm)],[3865,theory(equality)])).
% cnf(11726,negated_conjecture,(esk3_0=zero|test(X1)|esk3_0!=X1),inference(spm,[status(thm)],[1476,3481,theory(equality)])).
% cnf(11729,negated_conjecture,(test(X1)|esk3_0!=X1),inference(sr,[status(thm)],[11726,3866,theory(equality)])).
% cnf(11736,negated_conjecture,(addition(X1,one)=one|esk3_0!=X1),inference(spm,[status(thm)],[339,11729,theory(equality)])).
% cnf(25568,negated_conjecture,(addition(one,multiplication(esk2_0,one))=addition(one,multiplication(esk2_0,X1))|esk3_0!=X1),inference(spm,[status(thm)],[1142,11736,theory(equality)])).
% cnf(25634,negated_conjecture,(one=addition(one,multiplication(esk2_0,X1))|esk3_0!=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[25568,25,theory(equality)]),371,theory(equality)])).
% cnf(26400,negated_conjecture,($false),inference(spm,[status(thm)],[526,25634,theory(equality)])).
% cnf(26480,negated_conjecture,($false),26400,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1756
% # ...of these trivial : 192
% # ...subsumed : 1133
% # ...remaining for further processing: 431
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 34
% # Backward-rewritten : 49
% # Generated clauses : 13477
% # ...of the previous two non-trivial : 9277
% # Contextual simplify-reflections : 167
% # Paramodulations : 13465
% # Factorizations : 1
% # Equation resolutions : 11
% # Current number of processed clauses: 323
% # Positive orientable unit clauses: 118
% # Positive unorientable unit clauses: 7
% # Negative unit clauses : 11
% # Non-unit-clauses : 187
% # Current number of unprocessed clauses: 7041
% # ...number of literals in the above : 12632
% # Clause-clause subsumption calls (NU) : 5780
% # Rec. Clause-clause subsumption calls : 5741
% # Unit Clause-clause subsumption calls : 94
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 214
% # Indexed BW rewrite successes : 133
% # Backwards rewriting index: 222 leaves, 1.44+/-1.253 terms/leaf
% # Paramod-from index: 154 leaves, 1.18+/-0.604 terms/leaf
% # Paramod-into index: 204 leaves, 1.36+/-1.064 terms/leaf
% # -------------------------------------------------
% # User time : 0.355 s
% # System time : 0.017 s
% # Total time : 0.372 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.77 CPU 0.86 WC
% FINAL PrfWatch: 0.77 CPU 0.86 WC
% SZS output end Solution for /tmp/SystemOnTPTP19030/KLE010+2.tptp
%
%------------------------------------------------------------------------------