TSTP Solution File: KLE023+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE023+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 : art06.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:24 EST 2010
% Result : Theorem 125.38s
% Output : Solution 166.28s
% 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/SystemOnTPTP14550/KLE023+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~goals:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... additive_commutativity:
% CSA axiom additive_commutativity found
% Looking for CSA axiom ... additive_associativity:
% CSA axiom additive_associativity found
% Looking for CSA axiom ... additive_idempotence: CSA axiom additive_idempotence found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... multiplicative_associativity:
% CSA axiom multiplicative_associativity found
% Looking for CSA axiom ... right_distributivity:
% CSA axiom right_distributivity found
% Looking for CSA axiom ... left_distributivity:
% CSA axiom left_distributivity found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... test_deMorgan1:
% CSA axiom test_deMorgan1 found
% Looking for CSA axiom ... test_deMorgan2:
% CSA axiom test_deMorgan2 found
% Looking for CSA axiom ... test_4:
% CSA axiom test_4 found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... test_3:
% CSA axiom test_3 found
% Looking for CSA axiom ... test_1: CSA axiom test_1 found
% Looking for CSA axiom ... multiplicative_right_identity:
% CSA axiom multiplicative_right_identity found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... multiplicative_left_identity:
% CSA axiom multiplicative_left_identity found
% Looking for CSA axiom ... order:
% CSA axiom order found
% Looking for CSA axiom ... additive_identity:
% CSA axiom additive_identity found
% ---- Iteration 6 (15 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... right_annihilation:
% CSA axiom right_annihilation found
% Looking for CSA axiom ... left_annihilation:
% CSA axiom left_annihilation found
% Looking for CSA axiom ... test_2:
% CSA axiom test_2 found
% ---- Selection completed
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% Selected axioms are ... :test_2:left_annihilation:right_annihilation:additive_identity:order:multiplicative_left_identity:multiplicative_right_identity:test_1:test_3:test_4:test_deMorgan2:test_deMorgan1:left_distributivity:right_distributivity:multiplicative_associativity:additive_idempotence:additive_associativity:additive_commutativity (18)
% Unselected axioms are ... (0)
% SZS status THM for /tmp/SystemOnTPTP14550/KLE023+2.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP14550/KLE023+2.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=600 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC time limit is 1200s
% TreeLimitedRun: PID is 17489
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.55 CPU 2.03 WC
% PrfWatch: 3.19 CPU 4.03 WC
% PrfWatch: 5.19 CPU 6.04 WC
% PrfWatch: 7.18 CPU 8.04 WC
% PrfWatch: 9.15 CPU 10.05 WC
% PrfWatch: 11.14 CPU 12.05 WC
% PrfWatch: 13.12 CPU 14.06 WC
% PrfWatch: 15.11 CPU 16.06 WC
% PrfWatch: 17.10 CPU 18.07 WC
% PrfWatch: 19.07 CPU 20.07 WC
% PrfWatch: 21.06 CPU 22.08 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 23.04 CPU 24.08 WC
% PrfWatch: 25.03 CPU 26.09 WC
% PrfWatch: 27.03 CPU 28.09 WC
% PrfWatch: 29.02 CPU 30.09 WC
% PrfWatch: 31.00 CPU 32.10 WC
% PrfWatch: 32.99 CPU 34.10 WC
% PrfWatch: 34.99 CPU 36.11 WC
% PrfWatch: 36.98 CPU 38.11 WC
% PrfWatch: 38.98 CPU 40.12 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(complement(X2,X1)<=>((multiplication(X1,X2)=zero&multiplication(X2,X1)=zero)&addition(X1,X2)=one)),file('/tmp/SRASS.s.p', test_2)).
% fof(3, axiom,![X3]:multiplication(X3,zero)=zero,file('/tmp/SRASS.s.p', right_annihilation)).
% fof(4, axiom,![X3]:addition(X3,zero)=X3,file('/tmp/SRASS.s.p', additive_identity)).
% fof(5, axiom,![X3]:![X4]:(leq(X3,X4)<=>addition(X3,X4)=X4),file('/tmp/SRASS.s.p', order)).
% fof(6, axiom,![X3]:multiplication(one,X3)=X3,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(7, axiom,![X3]:multiplication(X3,one)=X3,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(8, axiom,![X1]:(test(X1)<=>?[X2]:complement(X2,X1)),file('/tmp/SRASS.s.p', test_1)).
% fof(9, axiom,![X1]:![X2]:(test(X1)=>(c(X1)=X2<=>complement(X1,X2))),file('/tmp/SRASS.s.p', test_3)).
% fof(13, axiom,![X3]:![X4]:![X5]:multiplication(addition(X3,X4),X5)=addition(multiplication(X3,X5),multiplication(X4,X5)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(14, axiom,![X3]:![X4]:![X5]:multiplication(X3,addition(X4,X5))=addition(multiplication(X3,X4),multiplication(X3,X5)),file('/tmp/SRASS.s.p', right_distributivity)).
% fof(15, axiom,![X3]:![X4]:![X5]:multiplication(X3,multiplication(X4,X5))=multiplication(multiplication(X3,X4),X5),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(16, axiom,![X3]:addition(X3,X3)=X3,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(17, axiom,![X5]:![X4]:![X3]:addition(X3,addition(X4,X5))=addition(addition(X3,X4),X5),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(18, axiom,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(19, conjecture,![X1]:![X2]:![X6]:((test(X2)&test(X6))=>(addition(multiplication(X2,X1),multiplication(X1,X6))=multiplication(X1,X6)=>addition(multiplication(X1,c(X6)),multiplication(c(X2),X1))=multiplication(c(X2),X1))),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X1]:![X2]:![X6]:((test(X2)&test(X6))=>(addition(multiplication(X2,X1),multiplication(X1,X6))=multiplication(X1,X6)=>addition(multiplication(X1,c(X6)),multiplication(c(X2),X1))=multiplication(c(X2),X1)))),inference(assume_negation,[status(cth)],[19])).
% fof(22, plain,![X1]:![X2]:((~(complement(X2,X1))|((multiplication(X1,X2)=zero&multiplication(X2,X1)=zero)&addition(X1,X2)=one))&(((~(multiplication(X1,X2)=zero)|~(multiplication(X2,X1)=zero))|~(addition(X1,X2)=one))|complement(X2,X1))),inference(fof_nnf,[status(thm)],[1])).
% fof(23, plain,![X3]:![X4]:((~(complement(X4,X3))|((multiplication(X3,X4)=zero&multiplication(X4,X3)=zero)&addition(X3,X4)=one))&(((~(multiplication(X3,X4)=zero)|~(multiplication(X4,X3)=zero))|~(addition(X3,X4)=one))|complement(X4,X3))),inference(variable_rename,[status(thm)],[22])).
% fof(24, plain,![X3]:![X4]:((((multiplication(X3,X4)=zero|~(complement(X4,X3)))&(multiplication(X4,X3)=zero|~(complement(X4,X3))))&(addition(X3,X4)=one|~(complement(X4,X3))))&(((~(multiplication(X3,X4)=zero)|~(multiplication(X4,X3)=zero))|~(addition(X3,X4)=one))|complement(X4,X3))),inference(distribute,[status(thm)],[23])).
% cnf(25,plain,(complement(X1,X2)|addition(X2,X1)!=one|multiplication(X1,X2)!=zero|multiplication(X2,X1)!=zero),inference(split_conjunct,[status(thm)],[24])).
% cnf(26,plain,(addition(X2,X1)=one|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[24])).
% cnf(27,plain,(multiplication(X1,X2)=zero|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[24])).
% cnf(28,plain,(multiplication(X2,X1)=zero|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[24])).
% fof(31, plain,![X4]:multiplication(X4,zero)=zero,inference(variable_rename,[status(thm)],[3])).
% cnf(32,plain,(multiplication(X1,zero)=zero),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X4]:addition(X4,zero)=X4,inference(variable_rename,[status(thm)],[4])).
% cnf(34,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(fof_nnf,[status(thm)],[5])).
% fof(36, plain,![X5]:![X6]:((~(leq(X5,X6))|addition(X5,X6)=X6)&(~(addition(X5,X6)=X6)|leq(X5,X6))),inference(variable_rename,[status(thm)],[35])).
% cnf(37,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[36])).
% cnf(38,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[36])).
% fof(39, plain,![X4]:multiplication(one,X4)=X4,inference(variable_rename,[status(thm)],[6])).
% cnf(40,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X4]:multiplication(X4,one)=X4,inference(variable_rename,[status(thm)],[7])).
% cnf(42,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[41])).
% fof(43, plain,![X1]:((~(test(X1))|?[X2]:complement(X2,X1))&(![X2]:~(complement(X2,X1))|test(X1))),inference(fof_nnf,[status(thm)],[8])).
% fof(44, plain,![X3]:((~(test(X3))|?[X4]:complement(X4,X3))&(![X5]:~(complement(X5,X3))|test(X3))),inference(variable_rename,[status(thm)],[43])).
% fof(45, plain,![X3]:((~(test(X3))|complement(esk1_1(X3),X3))&(![X5]:~(complement(X5,X3))|test(X3))),inference(skolemize,[status(esa)],[44])).
% fof(46, plain,![X3]:![X5]:((~(complement(X5,X3))|test(X3))&(~(test(X3))|complement(esk1_1(X3),X3))),inference(shift_quantors,[status(thm)],[45])).
% cnf(47,plain,(complement(esk1_1(X1),X1)|~test(X1)),inference(split_conjunct,[status(thm)],[46])).
% fof(49, plain,![X1]:![X2]:(~(test(X1))|((~(c(X1)=X2)|complement(X1,X2))&(~(complement(X1,X2))|c(X1)=X2))),inference(fof_nnf,[status(thm)],[9])).
% fof(50, plain,![X3]:![X4]:(~(test(X3))|((~(c(X3)=X4)|complement(X3,X4))&(~(complement(X3,X4))|c(X3)=X4))),inference(variable_rename,[status(thm)],[49])).
% fof(51, plain,![X3]:![X4]:(((~(c(X3)=X4)|complement(X3,X4))|~(test(X3)))&((~(complement(X3,X4))|c(X3)=X4)|~(test(X3)))),inference(distribute,[status(thm)],[50])).
% cnf(52,plain,(c(X1)=X2|~test(X1)|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[51])).
% cnf(53,plain,(complement(X1,X2)|~test(X1)|c(X1)!=X2),inference(split_conjunct,[status(thm)],[51])).
% fof(63, plain,![X6]:![X7]:![X8]:multiplication(addition(X6,X7),X8)=addition(multiplication(X6,X8),multiplication(X7,X8)),inference(variable_rename,[status(thm)],[13])).
% cnf(64,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[63])).
% fof(65, plain,![X6]:![X7]:![X8]:multiplication(X6,addition(X7,X8))=addition(multiplication(X6,X7),multiplication(X6,X8)),inference(variable_rename,[status(thm)],[14])).
% cnf(66,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[65])).
% fof(67, plain,![X6]:![X7]:![X8]:multiplication(X6,multiplication(X7,X8))=multiplication(multiplication(X6,X7),X8),inference(variable_rename,[status(thm)],[15])).
% cnf(68,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[67])).
% fof(69, plain,![X4]:addition(X4,X4)=X4,inference(variable_rename,[status(thm)],[16])).
% cnf(70,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[69])).
% fof(71, plain,![X6]:![X7]:![X8]:addition(X8,addition(X7,X6))=addition(addition(X8,X7),X6),inference(variable_rename,[status(thm)],[17])).
% cnf(72,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[71])).
% fof(73, plain,![X5]:![X6]:addition(X5,X6)=addition(X6,X5),inference(variable_rename,[status(thm)],[18])).
% cnf(74,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[73])).
% fof(75, negated_conjecture,?[X1]:?[X2]:?[X6]:((test(X2)&test(X6))&(addition(multiplication(X2,X1),multiplication(X1,X6))=multiplication(X1,X6)&~(addition(multiplication(X1,c(X6)),multiplication(c(X2),X1))=multiplication(c(X2),X1)))),inference(fof_nnf,[status(thm)],[20])).
% fof(76, negated_conjecture,?[X7]:?[X8]:?[X9]:((test(X8)&test(X9))&(addition(multiplication(X8,X7),multiplication(X7,X9))=multiplication(X7,X9)&~(addition(multiplication(X7,c(X9)),multiplication(c(X8),X7))=multiplication(c(X8),X7)))),inference(variable_rename,[status(thm)],[75])).
% fof(77, negated_conjecture,((test(esk3_0)&test(esk4_0))&(addition(multiplication(esk3_0,esk2_0),multiplication(esk2_0,esk4_0))=multiplication(esk2_0,esk4_0)&~(addition(multiplication(esk2_0,c(esk4_0)),multiplication(c(esk3_0),esk2_0))=multiplication(c(esk3_0),esk2_0)))),inference(skolemize,[status(esa)],[76])).
% cnf(78,negated_conjecture,(addition(multiplication(esk2_0,c(esk4_0)),multiplication(c(esk3_0),esk2_0))!=multiplication(c(esk3_0),esk2_0)),inference(split_conjunct,[status(thm)],[77])).
% cnf(79,negated_conjecture,(addition(multiplication(esk3_0,esk2_0),multiplication(esk2_0,esk4_0))=multiplication(esk2_0,esk4_0)),inference(split_conjunct,[status(thm)],[77])).
% cnf(80,negated_conjecture,(test(esk4_0)),inference(split_conjunct,[status(thm)],[77])).
% cnf(81,negated_conjecture,(test(esk3_0)),inference(split_conjunct,[status(thm)],[77])).
% cnf(84,plain,(complement(X1,c(X1))|~test(X1)),inference(er,[status(thm)],[53,theory(equality)])).
% cnf(86,plain,(multiplication(X1,esk1_1(X1))=zero|~test(X1)),inference(spm,[status(thm)],[28,47,theory(equality)])).
% cnf(87,plain,(addition(X1,esk1_1(X1))=one|~test(X1)),inference(spm,[status(thm)],[26,47,theory(equality)])).
% cnf(89,plain,(multiplication(esk1_1(X1),X1)=zero|~test(X1)),inference(spm,[status(thm)],[27,47,theory(equality)])).
% cnf(128,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[72,70,theory(equality)])).
% cnf(133,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[34,74,theory(equality)])).
% cnf(135,plain,(leq(X1,X2)|addition(X2,X1)!=X2),inference(spm,[status(thm)],[37,74,theory(equality)])).
% cnf(142,negated_conjecture,(addition(multiplication(esk2_0,esk4_0),multiplication(esk3_0,esk2_0))=multiplication(esk2_0,esk4_0)),inference(rw,[status(thm)],[79,74,theory(equality)])).
% cnf(155,plain,(addition(multiplication(X1,X2),X1)=multiplication(X1,addition(X2,one))),inference(spm,[status(thm)],[66,42,theory(equality)])).
% cnf(235,plain,(addition(c(X1),X1)=one|~test(X1)),inference(spm,[status(thm)],[26,84,theory(equality)])).
% cnf(333,plain,(zero=multiplication(X1,multiplication(X2,esk1_1(multiplication(X1,X2))))|~test(multiplication(X1,X2))),inference(spm,[status(thm)],[68,86,theory(equality)])).
% cnf(338,plain,(addition(multiplication(X1,X2),zero)=multiplication(X1,addition(X2,esk1_1(X1)))|~test(X1)),inference(spm,[status(thm)],[66,86,theory(equality)])).
% cnf(345,plain,(multiplication(X1,X2)=multiplication(X1,addition(X2,esk1_1(X1)))|~test(X1)),inference(rw,[status(thm)],[338,34,theory(equality)])).
% cnf(517,plain,(addition(X1,one)=one|~test(X1)),inference(spm,[status(thm)],[128,87,theory(equality)])).
% cnf(628,plain,(complement(X1,esk1_1(X1))|multiplication(X1,esk1_1(X1))!=zero|addition(esk1_1(X1),X1)!=one|~test(X1)),inference(spm,[status(thm)],[25,89,theory(equality)])).
% cnf(650,plain,(addition(X1,multiplication(X1,X2))=multiplication(X1,addition(X2,one))),inference(rw,[status(thm)],[155,74,theory(equality)])).
% cnf(660,plain,(leq(multiplication(X1,X2),X1)|multiplication(X1,addition(X2,one))!=X1),inference(spm,[status(thm)],[135,650,theory(equality)])).
% cnf(694,negated_conjecture,(addition(esk4_0,one)=one),inference(spm,[status(thm)],[517,80,theory(equality)])).
% cnf(695,negated_conjecture,(addition(esk3_0,one)=one),inference(spm,[status(thm)],[517,81,theory(equality)])).
% cnf(720,negated_conjecture,(addition(one,esk4_0)=one),inference(rw,[status(thm)],[694,74,theory(equality)])).
% cnf(722,negated_conjecture,(addition(one,X1)=addition(one,addition(esk4_0,X1))),inference(spm,[status(thm)],[72,720,theory(equality)])).
% cnf(737,negated_conjecture,(addition(one,esk3_0)=one),inference(rw,[status(thm)],[695,74,theory(equality)])).
% cnf(739,negated_conjecture,(addition(one,X1)=addition(one,addition(esk3_0,X1))),inference(spm,[status(thm)],[72,737,theory(equality)])).
% cnf(934,negated_conjecture,(addition(one,one)=addition(one,esk1_1(esk4_0))|~test(esk4_0)),inference(spm,[status(thm)],[722,87,theory(equality)])).
% cnf(952,negated_conjecture,(one=addition(one,esk1_1(esk4_0))|~test(esk4_0)),inference(rw,[status(thm)],[934,70,theory(equality)])).
% cnf(953,negated_conjecture,(one=addition(one,esk1_1(esk4_0))|$false),inference(rw,[status(thm)],[952,80,theory(equality)])).
% cnf(954,negated_conjecture,(one=addition(one,esk1_1(esk4_0))),inference(cn,[status(thm)],[953,theory(equality)])).
% cnf(1052,negated_conjecture,(addition(one,one)=addition(one,esk1_1(esk3_0))|~test(esk3_0)),inference(spm,[status(thm)],[739,87,theory(equality)])).
% cnf(1071,negated_conjecture,(one=addition(one,esk1_1(esk3_0))|~test(esk3_0)),inference(rw,[status(thm)],[1052,70,theory(equality)])).
% cnf(1072,negated_conjecture,(one=addition(one,esk1_1(esk3_0))|$false),inference(rw,[status(thm)],[1071,81,theory(equality)])).
% cnf(1073,negated_conjecture,(one=addition(one,esk1_1(esk3_0))),inference(cn,[status(thm)],[1072,theory(equality)])).
% cnf(1472,plain,(leq(multiplication(X1,X2),X1)|multiplication(X1,addition(one,X2))!=X1),inference(spm,[status(thm)],[660,74,theory(equality)])).
% cnf(4981,plain,(addition(X1,c(X1))=one|~test(X1)),inference(rw,[status(thm)],[235,74,theory(equality)])).
% cnf(4982,negated_conjecture,(addition(one,one)=addition(one,c(esk4_0))|~test(esk4_0)),inference(spm,[status(thm)],[722,4981,theory(equality)])).
% cnf(4985,negated_conjecture,(addition(one,one)=addition(one,c(esk3_0))|~test(esk3_0)),inference(spm,[status(thm)],[739,4981,theory(equality)])).
% cnf(5048,negated_conjecture,(one=addition(one,c(esk4_0))|~test(esk4_0)),inference(rw,[status(thm)],[4982,70,theory(equality)])).
% cnf(5049,negated_conjecture,(one=addition(one,c(esk4_0))|$false),inference(rw,[status(thm)],[5048,80,theory(equality)])).
% cnf(5050,negated_conjecture,(one=addition(one,c(esk4_0))),inference(cn,[status(thm)],[5049,theory(equality)])).
% cnf(5057,negated_conjecture,(one=addition(one,c(esk3_0))|~test(esk3_0)),inference(rw,[status(thm)],[4985,70,theory(equality)])).
% cnf(5058,negated_conjecture,(one=addition(one,c(esk3_0))|$false),inference(rw,[status(thm)],[5057,81,theory(equality)])).
% cnf(5059,negated_conjecture,(one=addition(one,c(esk3_0))),inference(cn,[status(thm)],[5058,theory(equality)])).
% cnf(5200,negated_conjecture,(leq(multiplication(X1,c(esk4_0)),X1)|multiplication(X1,one)!=X1),inference(spm,[status(thm)],[1472,5050,theory(equality)])).
% cnf(5234,negated_conjecture,(leq(multiplication(X1,c(esk4_0)),X1)|$false),inference(rw,[status(thm)],[5200,42,theory(equality)])).
% cnf(5235,negated_conjecture,(leq(multiplication(X1,c(esk4_0)),X1)),inference(cn,[status(thm)],[5234,theory(equality)])).
% cnf(5684,negated_conjecture,(leq(multiplication(X1,multiplication(X2,c(esk4_0))),multiplication(X1,X2))),inference(spm,[status(thm)],[5235,68,theory(equality)])).
% cnf(15021,plain,(multiplication(X1,one)=multiplication(X1,X1)|~test(X1)),inference(spm,[status(thm)],[345,87,theory(equality)])).
% cnf(15077,plain,(X1=multiplication(X1,X1)|~test(X1)),inference(rw,[status(thm)],[15021,42,theory(equality)])).
% cnf(22562,negated_conjecture,(multiplication(esk4_0,esk4_0)=esk4_0),inference(spm,[status(thm)],[15077,80,theory(equality)])).
% cnf(22563,negated_conjecture,(multiplication(esk3_0,esk3_0)=esk3_0),inference(spm,[status(thm)],[15077,81,theory(equality)])).
% cnf(22621,negated_conjecture,(multiplication(esk4_0,X1)=multiplication(esk4_0,multiplication(esk4_0,X1))),inference(spm,[status(thm)],[68,22562,theory(equality)])).
% cnf(22631,negated_conjecture,(multiplication(esk4_0,multiplication(esk4_0,esk1_1(esk4_0)))=zero|~test(esk4_0)),inference(spm,[status(thm)],[333,22562,theory(equality)])).
% cnf(22693,negated_conjecture,(multiplication(esk4_0,multiplication(esk4_0,esk1_1(esk4_0)))=zero|$false),inference(rw,[status(thm)],[22631,80,theory(equality)])).
% cnf(22694,negated_conjecture,(multiplication(esk4_0,multiplication(esk4_0,esk1_1(esk4_0)))=zero),inference(cn,[status(thm)],[22693,theory(equality)])).
% cnf(22708,negated_conjecture,(multiplication(esk3_0,X1)=multiplication(esk3_0,multiplication(esk3_0,X1))),inference(spm,[status(thm)],[68,22563,theory(equality)])).
% cnf(22718,negated_conjecture,(multiplication(esk3_0,multiplication(esk3_0,esk1_1(esk3_0)))=zero|~test(esk3_0)),inference(spm,[status(thm)],[333,22563,theory(equality)])).
% cnf(22774,negated_conjecture,(multiplication(esk3_0,multiplication(esk3_0,esk1_1(esk3_0)))=zero|$false),inference(rw,[status(thm)],[22718,81,theory(equality)])).
% cnf(22775,negated_conjecture,(multiplication(esk3_0,multiplication(esk3_0,esk1_1(esk3_0)))=zero),inference(cn,[status(thm)],[22774,theory(equality)])).
% cnf(23330,negated_conjecture,(multiplication(esk4_0,esk1_1(esk4_0))=zero),inference(rw,[status(thm)],[22694,22621,theory(equality)])).
% cnf(23338,negated_conjecture,(addition(zero,multiplication(X1,esk1_1(esk4_0)))=multiplication(addition(esk4_0,X1),esk1_1(esk4_0))),inference(spm,[status(thm)],[64,23330,theory(equality)])).
% cnf(23381,negated_conjecture,(multiplication(X1,esk1_1(esk4_0))=multiplication(addition(esk4_0,X1),esk1_1(esk4_0))),inference(rw,[status(thm)],[23338,133,theory(equality)])).
% cnf(23640,negated_conjecture,(addition(multiplication(esk3_0,X1),multiplication(esk3_0,X2))=multiplication(esk3_0,addition(X1,multiplication(esk3_0,X2)))),inference(spm,[status(thm)],[66,22708,theory(equality)])).
% cnf(23694,negated_conjecture,(multiplication(esk3_0,addition(X1,X2))=multiplication(esk3_0,addition(X1,multiplication(esk3_0,X2)))),inference(rw,[status(thm)],[23640,66,theory(equality)])).
% cnf(23729,negated_conjecture,(multiplication(esk3_0,esk1_1(esk3_0))=zero),inference(rw,[status(thm)],[22775,22708,theory(equality)])).
% cnf(23737,negated_conjecture,(addition(zero,multiplication(X1,esk1_1(esk3_0)))=multiplication(addition(esk3_0,X1),esk1_1(esk3_0))),inference(spm,[status(thm)],[64,23729,theory(equality)])).
% cnf(23780,negated_conjecture,(multiplication(X1,esk1_1(esk3_0))=multiplication(addition(esk3_0,X1),esk1_1(esk3_0))),inference(rw,[status(thm)],[23737,133,theory(equality)])).
% cnf(25699,negated_conjecture,(multiplication(one,esk1_1(esk4_0))=multiplication(c(esk4_0),esk1_1(esk4_0))|~test(esk4_0)),inference(spm,[status(thm)],[23381,4981,theory(equality)])).
% cnf(25739,negated_conjecture,(esk1_1(esk4_0)=multiplication(c(esk4_0),esk1_1(esk4_0))|~test(esk4_0)),inference(rw,[status(thm)],[25699,40,theory(equality)])).
% cnf(25740,negated_conjecture,(esk1_1(esk4_0)=multiplication(c(esk4_0),esk1_1(esk4_0))|$false),inference(rw,[status(thm)],[25739,80,theory(equality)])).
% cnf(25741,negated_conjecture,(esk1_1(esk4_0)=multiplication(c(esk4_0),esk1_1(esk4_0))),inference(cn,[status(thm)],[25740,theory(equality)])).
% cnf(25819,negated_conjecture,(addition(c(esk4_0),esk1_1(esk4_0))=multiplication(c(esk4_0),addition(esk1_1(esk4_0),one))),inference(spm,[status(thm)],[650,25741,theory(equality)])).
% cnf(25851,negated_conjecture,(addition(c(esk4_0),esk1_1(esk4_0))=c(esk4_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[25819,74,theory(equality)]),954,theory(equality)]),42,theory(equality)])).
% cnf(27087,negated_conjecture,(multiplication(one,esk1_1(esk3_0))=multiplication(c(esk3_0),esk1_1(esk3_0))|~test(esk3_0)),inference(spm,[status(thm)],[23780,4981,theory(equality)])).
% cnf(27129,negated_conjecture,(esk1_1(esk3_0)=multiplication(c(esk3_0),esk1_1(esk3_0))|~test(esk3_0)),inference(rw,[status(thm)],[27087,40,theory(equality)])).
% cnf(27130,negated_conjecture,(esk1_1(esk3_0)=multiplication(c(esk3_0),esk1_1(esk3_0))|$false),inference(rw,[status(thm)],[27129,81,theory(equality)])).
% cnf(27131,negated_conjecture,(esk1_1(esk3_0)=multiplication(c(esk3_0),esk1_1(esk3_0))),inference(cn,[status(thm)],[27130,theory(equality)])).
% cnf(27214,negated_conjecture,(addition(c(esk3_0),esk1_1(esk3_0))=multiplication(c(esk3_0),addition(esk1_1(esk3_0),one))),inference(spm,[status(thm)],[650,27131,theory(equality)])).
% cnf(27248,negated_conjecture,(addition(c(esk3_0),esk1_1(esk3_0))=c(esk3_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[27214,74,theory(equality)]),1073,theory(equality)]),42,theory(equality)])).
% cnf(40189,plain,(complement(X1,esk1_1(X1))|multiplication(X1,esk1_1(X1))!=zero|addition(X1,esk1_1(X1))!=one|~test(X1)),inference(rw,[status(thm)],[628,74,theory(equality)])).
% cnf(40190,plain,(complement(X1,esk1_1(X1))|multiplication(X1,esk1_1(X1))!=zero|~test(X1)),inference(csr,[status(thm)],[40189,87])).
% cnf(40191,plain,(complement(X1,esk1_1(X1))|~test(X1)),inference(csr,[status(thm)],[40190,86])).
% cnf(40195,plain,(c(X1)=esk1_1(X1)|~test(X1)),inference(spm,[status(thm)],[52,40191,theory(equality)])).
% cnf(40240,negated_conjecture,(multiplication(addition(esk4_0,X1),c(esk4_0))=multiplication(X1,c(esk4_0))|~test(esk4_0)),inference(spm,[status(thm)],[23381,40195,theory(equality)])).
% cnf(40302,negated_conjecture,(multiplication(addition(esk3_0,X1),c(esk3_0))=multiplication(X1,c(esk3_0))|~test(esk3_0)),inference(spm,[status(thm)],[23780,40195,theory(equality)])).
% cnf(40405,negated_conjecture,(multiplication(addition(esk4_0,X1),c(esk4_0))=multiplication(X1,c(esk4_0))|$false),inference(rw,[status(thm)],[40240,80,theory(equality)])).
% cnf(40406,negated_conjecture,(multiplication(addition(esk4_0,X1),c(esk4_0))=multiplication(X1,c(esk4_0))),inference(cn,[status(thm)],[40405,theory(equality)])).
% cnf(40575,negated_conjecture,(multiplication(addition(esk3_0,X1),c(esk3_0))=multiplication(X1,c(esk3_0))|$false),inference(rw,[status(thm)],[40302,81,theory(equality)])).
% cnf(40576,negated_conjecture,(multiplication(addition(esk3_0,X1),c(esk3_0))=multiplication(X1,c(esk3_0))),inference(cn,[status(thm)],[40575,theory(equality)])).
% cnf(44746,negated_conjecture,(multiplication(one,c(esk4_0))=multiplication(esk1_1(esk4_0),c(esk4_0))|~test(esk4_0)),inference(spm,[status(thm)],[40406,87,theory(equality)])).
% cnf(44807,negated_conjecture,(c(esk4_0)=multiplication(esk1_1(esk4_0),c(esk4_0))|~test(esk4_0)),inference(rw,[status(thm)],[44746,40,theory(equality)])).
% cnf(44808,negated_conjecture,(c(esk4_0)=multiplication(esk1_1(esk4_0),c(esk4_0))|$false),inference(rw,[status(thm)],[44807,80,theory(equality)])).
% cnf(44809,negated_conjecture,(c(esk4_0)=multiplication(esk1_1(esk4_0),c(esk4_0))),inference(cn,[status(thm)],[44808,theory(equality)])).
% cnf(44837,negated_conjecture,(addition(esk1_1(esk4_0),c(esk4_0))=multiplication(esk1_1(esk4_0),addition(c(esk4_0),one))),inference(spm,[status(thm)],[650,44809,theory(equality)])).
% cnf(44884,negated_conjecture,(c(esk4_0)=multiplication(esk1_1(esk4_0),addition(c(esk4_0),one))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[44837,74,theory(equality)]),25851,theory(equality)])).
% cnf(44885,negated_conjecture,(c(esk4_0)=esk1_1(esk4_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[44884,74,theory(equality)]),5050,theory(equality)]),42,theory(equality)])).
% cnf(46574,negated_conjecture,(multiplication(one,c(esk3_0))=multiplication(esk1_1(esk3_0),c(esk3_0))|~test(esk3_0)),inference(spm,[status(thm)],[40576,87,theory(equality)])).
% cnf(46636,negated_conjecture,(c(esk3_0)=multiplication(esk1_1(esk3_0),c(esk3_0))|~test(esk3_0)),inference(rw,[status(thm)],[46574,40,theory(equality)])).
% cnf(46637,negated_conjecture,(c(esk3_0)=multiplication(esk1_1(esk3_0),c(esk3_0))|$false),inference(rw,[status(thm)],[46636,81,theory(equality)])).
% cnf(46638,negated_conjecture,(c(esk3_0)=multiplication(esk1_1(esk3_0),c(esk3_0))),inference(cn,[status(thm)],[46637,theory(equality)])).
% cnf(46666,negated_conjecture,(addition(esk1_1(esk3_0),c(esk3_0))=multiplication(esk1_1(esk3_0),addition(c(esk3_0),one))),inference(spm,[status(thm)],[650,46638,theory(equality)])).
% cnf(46713,negated_conjecture,(c(esk3_0)=multiplication(esk1_1(esk3_0),addition(c(esk3_0),one))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[46666,74,theory(equality)]),27248,theory(equality)])).
% cnf(46714,negated_conjecture,(c(esk3_0)=esk1_1(esk3_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[46713,74,theory(equality)]),5059,theory(equality)]),42,theory(equality)])).
% cnf(167246,negated_conjecture,(multiplication(esk3_0,multiplication(esk2_0,esk4_0))=multiplication(esk3_0,addition(multiplication(esk2_0,esk4_0),esk2_0))),inference(spm,[status(thm)],[23694,142,theory(equality)])).
% cnf(167486,negated_conjecture,(multiplication(esk3_0,esk2_0)=multiplication(esk3_0,multiplication(esk2_0,esk4_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[167246,74,theory(equality)]),650,theory(equality)]),74,theory(equality)]),720,theory(equality)]),42,theory(equality)])).
% cnf(167497,negated_conjecture,(multiplication(multiplication(esk3_0,esk2_0),X1)=multiplication(esk3_0,multiplication(multiplication(esk2_0,esk4_0),X1))),inference(spm,[status(thm)],[68,167486,theory(equality)])).
% cnf(167586,negated_conjecture,(multiplication(esk3_0,multiplication(esk2_0,X1))=multiplication(esk3_0,multiplication(multiplication(esk2_0,esk4_0),X1))),inference(rw,[status(thm)],[167497,68,theory(equality)])).
% cnf(167587,negated_conjecture,(multiplication(esk3_0,multiplication(esk2_0,X1))=multiplication(esk3_0,multiplication(esk2_0,multiplication(esk4_0,X1)))),inference(rw,[status(thm)],[167586,68,theory(equality)])).
% cnf(169173,negated_conjecture,(multiplication(esk3_0,multiplication(esk2_0,zero))=multiplication(esk3_0,multiplication(esk2_0,esk1_1(esk4_0)))|~test(esk4_0)),inference(spm,[status(thm)],[167587,86,theory(equality)])).
% cnf(169266,negated_conjecture,(zero=multiplication(esk3_0,multiplication(esk2_0,esk1_1(esk4_0)))|~test(esk4_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[169173,32,theory(equality)]),32,theory(equality)])).
% cnf(169267,negated_conjecture,(zero=multiplication(esk3_0,multiplication(esk2_0,c(esk4_0)))|~test(esk4_0)),inference(rw,[status(thm)],[169266,44885,theory(equality)])).
% cnf(169268,negated_conjecture,(zero=multiplication(esk3_0,multiplication(esk2_0,c(esk4_0)))|$false),inference(rw,[status(thm)],[169267,80,theory(equality)])).
% cnf(169269,negated_conjecture,(zero=multiplication(esk3_0,multiplication(esk2_0,c(esk4_0)))),inference(cn,[status(thm)],[169268,theory(equality)])).
% cnf(169327,negated_conjecture,(addition(zero,multiplication(X1,multiplication(esk2_0,c(esk4_0))))=multiplication(addition(esk3_0,X1),multiplication(esk2_0,c(esk4_0)))),inference(spm,[status(thm)],[64,169269,theory(equality)])).
% cnf(169432,negated_conjecture,(multiplication(X1,multiplication(esk2_0,c(esk4_0)))=multiplication(addition(esk3_0,X1),multiplication(esk2_0,c(esk4_0)))),inference(rw,[status(thm)],[169327,133,theory(equality)])).
% cnf(496089,negated_conjecture,(multiplication(one,multiplication(esk2_0,c(esk4_0)))=multiplication(esk1_1(esk3_0),multiplication(esk2_0,c(esk4_0)))|~test(esk3_0)),inference(spm,[status(thm)],[169432,87,theory(equality)])).
% cnf(496246,negated_conjecture,(multiplication(esk2_0,c(esk4_0))=multiplication(esk1_1(esk3_0),multiplication(esk2_0,c(esk4_0)))|~test(esk3_0)),inference(rw,[status(thm)],[496089,40,theory(equality)])).
% cnf(496247,negated_conjecture,(multiplication(esk2_0,c(esk4_0))=multiplication(c(esk3_0),multiplication(esk2_0,c(esk4_0)))|~test(esk3_0)),inference(rw,[status(thm)],[496246,46714,theory(equality)])).
% cnf(496248,negated_conjecture,(multiplication(esk2_0,c(esk4_0))=multiplication(c(esk3_0),multiplication(esk2_0,c(esk4_0)))|$false),inference(rw,[status(thm)],[496247,81,theory(equality)])).
% cnf(496249,negated_conjecture,(multiplication(esk2_0,c(esk4_0))=multiplication(c(esk3_0),multiplication(esk2_0,c(esk4_0)))),inference(cn,[status(thm)],[496248,theory(equality)])).
% cnf(1214648,negated_conjecture,(leq(multiplication(esk2_0,c(esk4_0)),multiplication(c(esk3_0),esk2_0))),inference(spm,[status(thm)],[5684,496249,theory(equality)])).
% cnf(1306331,negated_conjecture,(addition(multiplication(esk2_0,c(esk4_0)),multiplication(c(esk3_0),esk2_0))=multiplication(c(esk3_0),esk2_0)),inference(spm,[status(thm)],[38,1214648,theory(equality)])).
% cnf(1306338,negated_conjecture,($false),inference(sr,[status(thm)],[1306331,78,theory(equality)])).
% cnf(1306339,negated_conjecture,($false),1306338,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 27582
% # ...of these trivial : 2613
% # ...subsumed : 21975
% # ...remaining for further processing: 2994
% # Other redundant clauses eliminated : 110
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 106
% # Backward-rewritten : 520
% # Generated clauses : 608241
% # ...of the previous two non-trivial : 437041
% # Contextual simplify-reflections : 2788
% # Paramodulations : 606256
% # Factorizations : 4
% # Equation resolutions : 148
% # Current number of processed clauses: 2368
% # Positive orientable unit clauses: 847
% # Positive unorientable unit clauses: 22
% # Negative unit clauses : 145
% # Non-unit-clauses : 1354
% # Current number of unprocessed clauses: 354593
% # ...number of literals in the above : 875265
% # Clause-clause subsumption calls (NU) : 252438
% # Rec. Clause-clause subsumption calls : 245974
% # Unit Clause-clause subsumption calls : 22370
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3323
% # Indexed BW rewrite successes : 489
% # Backwards rewriting index: 1577 leaves, 1.89+/-2.225 terms/leaf
% # Paramod-from index: 804 leaves, 1.65+/-1.326 terms/leaf
% # Paramod-into index: 1224 leaves, 1.78+/-1.954 terms/leaf
% # -------------------------------------------------
% # User time : 21.199 s
% # System time : 0.839 s
% # Total time : 22.038 s
% # Maximum resident set size: 0 pages
% PrfWatch: 40.21 CPU 41.35 WC
% FINAL PrfWatch: 40.21 CPU 41.35 WC
% SZS output end Solution for /tmp/SystemOnTPTP14550/KLE023+2.tptp
%
%------------------------------------------------------------------------------