TSTP Solution File: KLE145+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE145+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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 08:13:08 EST 2010
% Result : Theorem 18.13s
% Output : Solution 18.13s
% 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/SystemOnTPTP17811/KLE145+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17811/KLE145+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17811/KLE145+1.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 17907
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.93 CPU 2.03 WC
% PrfWatch: 3.91 CPU 4.04 WC
% PrfWatch: 5.90 CPU 6.04 WC
% PrfWatch: 7.88 CPU 8.05 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 9.86 CPU 10.06 WC
% PrfWatch: 11.46 CPU 12.07 WC
% PrfWatch: 13.10 CPU 14.07 WC
% PrfWatch: 15.09 CPU 16.08 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:strong_iteration(X1)=addition(star(X1),multiplication(strong_iteration(X1),zero)),file('/tmp/SRASS.s.p', isolation)).
% fof(2, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(3, axiom,![X1]:![X2]:![X3]:multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(4, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(5, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(6, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', distributivity1)).
% fof(7, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', distributivity2)).
% fof(8, axiom,![X1]:multiplication(zero,X1)=zero,file('/tmp/SRASS.s.p', left_annihilation)).
% fof(9, axiom,![X1]:strong_iteration(X1)=addition(multiplication(X1,strong_iteration(X1)),one),file('/tmp/SRASS.s.p', infty_unfold1)).
% fof(10, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(11, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(12, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', idempotence)).
% fof(13, axiom,![X1]:addition(one,multiplication(X1,star(X1)))=star(X1),file('/tmp/SRASS.s.p', star_unfold1)).
% fof(14, axiom,![X1]:addition(one,multiplication(star(X1),X1))=star(X1),file('/tmp/SRASS.s.p', star_unfold2)).
% fof(15, axiom,![X1]:![X2]:![X3]:(leq(X3,addition(multiplication(X1,X3),X2))=>leq(X3,multiplication(strong_iteration(X1),X2))),file('/tmp/SRASS.s.p', infty_coinduction)).
% fof(16, axiom,![X1]:![X2]:![X3]:(leq(addition(multiplication(X1,X3),X2),X3)=>leq(multiplication(star(X1),X2),X3)),file('/tmp/SRASS.s.p', star_induction1)).
% fof(17, axiom,![X1]:![X2]:![X3]:(leq(addition(multiplication(X3,X1),X2),X3)=>leq(multiplication(X2,star(X1)),X3)),file('/tmp/SRASS.s.p', star_induction2)).
% fof(18, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(19, conjecture,![X4]:star(strong_iteration(X4))=strong_iteration(X4),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X4]:star(strong_iteration(X4))=strong_iteration(X4)),inference(assume_negation,[status(cth)],[19])).
% fof(21, plain,![X2]:strong_iteration(X2)=addition(star(X2),multiplication(strong_iteration(X2),zero)),inference(variable_rename,[status(thm)],[1])).
% cnf(22,plain,(strong_iteration(X1)=addition(star(X1),multiplication(strong_iteration(X1),zero))),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[2])).
% cnf(24,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X4]:![X5]:![X6]:multiplication(X4,multiplication(X5,X6))=multiplication(multiplication(X4,X5),X6),inference(variable_rename,[status(thm)],[3])
% ).
% cnf(26,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[4])).
% cnf(28,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[5])).
% cnf(30,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[6])).
% cnf(32,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[7])).
% cnf(34,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X2]:multiplication(zero,X2)=zero,inference(variable_rename,[status(thm)],[8])).
% cnf(36,plain,(multiplication(zero,X1)=zero),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X2]:strong_iteration(X2)=addition(multiplication(X2,strong_iteration(X2)),one),inference(variable_rename,[status(thm)],[9])).
% cnf(38,plain,(strong_iteration(X1)=addition(multiplication(X1,strong_iteration(X1)),one)),inference(split_conjunct,[status(thm)],[37])).
% fof(39, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[10])).
% cnf(40,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[11])).
% cnf(42,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[41])).
% fof(43, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[12])).
% cnf(44,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X2]:addition(one,multiplication(X2,star(X2)))=star(X2),inference(variable_rename,[status(thm)],[13])).
% cnf(46,plain,(addition(one,multiplication(X1,star(X1)))=star(X1)),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X2]:addition(one,multiplication(star(X2),X2))=star(X2),inference(variable_rename,[status(thm)],[14])).
% cnf(48,plain,(addition(one,multiplication(star(X1),X1))=star(X1)),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X1]:![X2]:![X3]:(~(leq(X3,addition(multiplication(X1,X3),X2)))|leq(X3,multiplication(strong_iteration(X1),X2))),inference(fof_nnf,[status(thm)],[15])).
% fof(50, plain,![X4]:![X5]:![X6]:(~(leq(X6,addition(multiplication(X4,X6),X5)))|leq(X6,multiplication(strong_iteration(X4),X5))),inference(variable_rename,[status(thm)],[49])).
% cnf(51,plain,(leq(X1,multiplication(strong_iteration(X2),X3))|~leq(X1,addition(multiplication(X2,X1),X3))),inference(split_conjunct,[status(thm)],[50])).
% fof(52, plain,![X1]:![X2]:![X3]:(~(leq(addition(multiplication(X1,X3),X2),X3))|leq(multiplication(star(X1),X2),X3)),inference(fof_nnf,[status(thm)],[16])).
% fof(53, plain,![X4]:![X5]:![X6]:(~(leq(addition(multiplication(X4,X6),X5),X6))|leq(multiplication(star(X4),X5),X6)),inference(variable_rename,[status(thm)],[52])).
% cnf(54,plain,(leq(multiplication(star(X1),X2),X3)|~leq(addition(multiplication(X1,X3),X2),X3)),inference(split_conjunct,[status(thm)],[53])).
% fof(55, plain,![X1]:![X2]:![X3]:(~(leq(addition(multiplication(X3,X1),X2),X3))|leq(multiplication(X2,star(X1)),X3)),inference(fof_nnf,[status(thm)],[17])).
% fof(56, plain,![X4]:![X5]:![X6]:(~(leq(addition(multiplication(X6,X4),X5),X6))|leq(multiplication(X5,star(X4)),X6)),inference(variable_rename,[status(thm)],[55])).
% cnf(57,plain,(leq(multiplication(X1,star(X2)),X3)|~leq(addition(multiplication(X3,X2),X1),X3)),inference(split_conjunct,[status(thm)],[56])).
% fof(58, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[18])).
% fof(59, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[58])).
% cnf(60,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[59])).
% cnf(61,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[59])).
% fof(62, negated_conjecture,?[X4]:~(star(strong_iteration(X4))=strong_iteration(X4)),inference(fof_nnf,[status(thm)],[20])).
% fof(63, negated_conjecture,?[X5]:~(star(strong_iteration(X5))=strong_iteration(X5)),inference(variable_rename,[status(thm)],[62])).
% fof(64, negated_conjecture,~(star(strong_iteration(esk1_0))=strong_iteration(esk1_0)),inference(skolemize,[status(esa)],[63])).
% cnf(65,negated_conjecture,(star(strong_iteration(esk1_0))!=strong_iteration(esk1_0)),inference(split_conjunct,[status(thm)],[64])).
% cnf(66,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[24,40,theory(equality)])).
% cnf(76,plain,(addition(one,multiplication(X1,strong_iteration(X1)))=strong_iteration(X1)),inference(rw,[status(thm)],[38,40,theory(equality)])).
% cnf(84,plain,(leq(X1,X1)),inference(spm,[status(thm)],[60,44,theory(equality)])).
% cnf(91,plain,(leq(multiplication(multiplication(X1,X2),star(X2)),X1)|~leq(multiplication(X1,X2),X1)),inference(spm,[status(thm)],[57,44,theory(equality)])).
% cnf(103,plain,(addition(one,multiplication(X1,multiplication(X2,star(multiplication(X1,X2)))))=star(multiplication(X1,X2))),inference(spm,[status(thm)],[46,26,theory(equality)])).
% cnf(125,plain,(addition(star(X1),X2)=addition(one,addition(multiplication(X1,star(X1)),X2))),inference(spm,[status(thm)],[42,46,theory(equality)])).
% cnf(126,plain,(addition(strong_iteration(X1),X2)=addition(one,addition(multiplication(X1,strong_iteration(X1)),X2))),inference(spm,[status(thm)],[42,76,theory(equality)])).
% cnf(128,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[42,44,theory(equality)])).
% cnf(145,plain,(addition(strong_iteration(X1),X2)=addition(star(X1),addition(multiplication(strong_iteration(X1),zero),X2))),inference(spm,[status(thm)],[42,22,theory(equality)])).
% cnf(157,plain,(addition(multiplication(X1,X2),X1)=multiplication(X1,addition(X2,one))),inference(spm,[status(thm)],[32,28,theory(equality)])).
% cnf(185,plain,(leq(multiplication(star(X1),multiplication(X2,X3)),X3)|~leq(multiplication(addition(X1,X2),X3),X3)),inference(spm,[status(thm)],[54,34,theory(equality)])).
% cnf(187,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[34,30,theory(equality)])).
% cnf(188,plain,(addition(multiplication(X1,X2),multiplication(X3,multiplication(X4,X2)))=multiplication(addition(X1,multiplication(X3,X4)),X2)),inference(spm,[status(thm)],[34,26,theory(equality)])).
% cnf(244,plain,(leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[60,128,theory(equality)])).
% cnf(247,plain,(addition(one,star(X1))=star(X1)),inference(spm,[status(thm)],[128,48,theory(equality)])).
% cnf(249,plain,(addition(one,strong_iteration(X1))=strong_iteration(X1)),inference(spm,[status(thm)],[128,76,theory(equality)])).
% cnf(259,plain,(addition(X1,addition(X2,X1))=addition(X2,X1)),inference(spm,[status(thm)],[128,40,theory(equality)])).
% cnf(288,plain,(leq(X1,addition(X2,X1))),inference(spm,[status(thm)],[244,40,theory(equality)])).
% cnf(387,plain,(leq(X1,addition(X2,addition(X3,X1)))),inference(spm,[status(thm)],[288,42,theory(equality)])).
% cnf(440,plain,(addition(multiplication(star(X1),X1),star(X1))=star(X1)),inference(spm,[status(thm)],[259,48,theory(equality)])).
% cnf(506,plain,(addition(X1,multiplication(X1,X2))=multiplication(X1,addition(X2,one))),inference(rw,[status(thm)],[157,40,theory(equality)])).
% cnf(606,plain,(leq(X1,addition(X2,addition(X1,X3)))),inference(spm,[status(thm)],[387,40,theory(equality)])).
% cnf(671,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[187,40,theory(equality)])).
% cnf(678,plain,(multiplication(addition(X1,one),zero)=multiplication(X1,zero)),inference(spm,[status(thm)],[66,671,theory(equality)])).
% cnf(692,plain,(addition(X1,multiplication(X2,multiplication(X3,X1)))=multiplication(addition(multiplication(X2,X3),one),X1)),inference(spm,[status(thm)],[671,26,theory(equality)])).
% cnf(717,plain,(multiplication(addition(one,X1),zero)=multiplication(X1,zero)),inference(spm,[status(thm)],[678,40,theory(equality)])).
% cnf(805,plain,(leq(one,addition(X1,star(X2)))),inference(spm,[status(thm)],[606,48,theory(equality)])).
% cnf(845,plain,(leq(one,multiplication(strong_iteration(X1),star(X2)))),inference(spm,[status(thm)],[51,805,theory(equality)])).
% cnf(851,plain,(leq(one,addition(star(X2),X1))),inference(spm,[status(thm)],[805,40,theory(equality)])).
% cnf(1055,plain,(leq(one,multiplication(star(X1),addition(X2,one)))),inference(spm,[status(thm)],[851,506,theory(equality)])).
% cnf(1382,plain,(addition(one,multiplication(strong_iteration(X1),star(X2)))=multiplication(strong_iteration(X1),star(X2))),inference(spm,[status(thm)],[61,845,theory(equality)])).
% cnf(1988,plain,(leq(multiplication(X1,multiplication(X2,star(X2))),X1)|~leq(multiplication(X1,X2),X1)),inference(rw,[status(thm)],[91,26,theory(equality)])).
% cnf(2408,plain,(leq(one,multiplication(star(X1),addition(one,X2)))),inference(spm,[status(thm)],[1055,40,theory(equality)])).
% cnf(3319,plain,(multiplication(strong_iteration(X1),star(strong_iteration(X1)))=star(strong_iteration(X1))),inference(spm,[status(thm)],[46,1382,theory(equality)])).
% cnf(3356,plain,(addition(one,multiplication(star(X1),addition(one,X2)))=multiplication(star(X1),addition(one,X2))),inference(spm,[status(thm)],[61,2408,theory(equality)])).
% cnf(5209,plain,(multiplication(star(X1),addition(X1,one))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[440,40,theory(equality)]),506,theory(equality)])).
% cnf(5221,plain,(addition(addition(X1,one),star(X1))=multiplication(addition(star(X1),one),addition(X1,one))),inference(spm,[status(thm)],[671,5209,theory(equality)])).
% cnf(5248,plain,(addition(X1,star(X1))=multiplication(addition(star(X1),one),addition(X1,one))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[5221,42,theory(equality)]),247,theory(equality)])).
% cnf(5249,plain,(addition(X1,star(X1))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[5248,40,theory(equality)]),247,theory(equality)]),5209,theory(equality)])).
% cnf(5715,plain,(addition(one,multiplication(addition(one,X1),multiplication(zero,star(multiplication(X1,zero)))))=star(multiplication(X1,zero))),inference(spm,[status(thm)],[103,717,theory(equality)])).
% cnf(5762,plain,(addition(one,multiplication(X1,zero))=star(multiplication(X1,zero))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[5715,36,theory(equality)]),717,theory(equality)])).
% cnf(10109,plain,(addition(one,multiplication(X1,star(X1)))=addition(star(X1),multiplication(X1,star(X1)))),inference(spm,[status(thm)],[125,44,theory(equality)])).
% cnf(10177,plain,(star(X1)=addition(star(X1),multiplication(X1,star(X1)))),inference(rw,[status(thm)],[10109,46,theory(equality)])).
% cnf(10178,plain,(star(X1)=multiplication(addition(X1,one),star(X1))),inference(rw,[status(thm)],[10177,671,theory(equality)])).
% cnf(10194,plain,(addition(multiplication(X1,star(X2)),star(X2))=multiplication(addition(X1,addition(X2,one)),star(X2))),inference(spm,[status(thm)],[34,10178,theory(equality)])).
% cnf(11190,plain,(addition(one,multiplication(X1,strong_iteration(X1)))=addition(strong_iteration(X1),multiplication(X1,strong_iteration(X1)))),inference(spm,[status(thm)],[126,44,theory(equality)])).
% cnf(11258,plain,(strong_iteration(X1)=addition(strong_iteration(X1),multiplication(X1,strong_iteration(X1)))),inference(rw,[status(thm)],[11190,76,theory(equality)])).
% cnf(11259,plain,(strong_iteration(X1)=multiplication(addition(X1,one),strong_iteration(X1))),inference(rw,[status(thm)],[11258,671,theory(equality)])).
% cnf(30364,plain,(leq(multiplication(star(X1),multiplication(one,strong_iteration(X1))),strong_iteration(X1))|~leq(strong_iteration(X1),strong_iteration(X1))),inference(spm,[status(thm)],[185,11259,theory(equality)])).
% cnf(30455,plain,(leq(multiplication(star(X1),strong_iteration(X1)),strong_iteration(X1))|~leq(strong_iteration(X1),strong_iteration(X1))),inference(rw,[status(thm)],[30364,30,theory(equality)])).
% cnf(30456,plain,(leq(multiplication(star(X1),strong_iteration(X1)),strong_iteration(X1))|$false),inference(rw,[status(thm)],[30455,84,theory(equality)])).
% cnf(30457,plain,(leq(multiplication(star(X1),strong_iteration(X1)),strong_iteration(X1))),inference(cn,[status(thm)],[30456,theory(equality)])).
% cnf(30469,plain,(addition(multiplication(star(X1),strong_iteration(X1)),strong_iteration(X1))=strong_iteration(X1)),inference(spm,[status(thm)],[61,30457,theory(equality)])).
% cnf(31809,plain,(addition(multiplication(X1,X2),multiplication(X3,zero))=multiplication(addition(X1,multiplication(X3,zero)),X2)),inference(spm,[status(thm)],[188,36,theory(equality)])).
% cnf(90639,plain,(addition(X1,multiplication(X2,zero))=multiplication(addition(one,multiplication(X2,zero)),X1)),inference(spm,[status(thm)],[31809,30,theory(equality)])).
% cnf(108983,plain,(addition(X1,multiplication(X2,multiplication(X3,X1)))=multiplication(addition(one,multiplication(X2,X3)),X1)),inference(rw,[status(thm)],[692,40,theory(equality)])).
% cnf(109274,plain,(multiplication(addition(one,multiplication(X1,X2)),X1)=multiplication(X1,addition(multiplication(X2,X1),one))),inference(spm,[status(thm)],[506,108983,theory(equality)])).
% cnf(135570,plain,(multiplication(addition(one,multiplication(X1,X2)),X1)=multiplication(X1,addition(one,multiplication(X2,X1)))),inference(rw,[status(thm)],[109274,40,theory(equality)])).
% cnf(242398,plain,(multiplication(addition(X1,one),star(X2))=multiplication(addition(X1,addition(X2,one)),star(X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[10194,40,theory(equality)]),671,theory(equality)])).
% cnf(242588,plain,(multiplication(addition(strong_iteration(X1),one),star(multiplication(strong_iteration(X1),zero)))=multiplication(addition(star(X1),one),star(multiplication(strong_iteration(X1),zero)))),inference(spm,[status(thm)],[242398,145,theory(equality)])).
% cnf(242805,plain,(multiplication(strong_iteration(X1),addition(one,multiplication(strong_iteration(X1),zero)))=multiplication(addition(star(X1),one),star(multiplication(strong_iteration(X1),zero)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[242588,40,theory(equality)]),249,theory(equality)]),5762,theory(equality)])).
% cnf(242806,plain,(multiplication(strong_iteration(X1),addition(one,multiplication(strong_iteration(X1),zero)))=multiplication(star(X1),addition(one,multiplication(strong_iteration(X1),zero)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[242805,40,theory(equality)]),247,theory(equality)]),5762,theory(equality)])).
% cnf(332014,plain,(multiplication(star(X1),strong_iteration(X1))=strong_iteration(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[30469,40,theory(equality)]),671,theory(equality)]),40,theory(equality)]),247,theory(equality)])).
% cnf(706288,plain,(multiplication(addition(one,multiplication(star(X1),addition(one,multiplication(strong_iteration(X1),zero)))),strong_iteration(X1))=multiplication(strong_iteration(X1),addition(one,multiplication(addition(one,multiplication(strong_iteration(X1),zero)),strong_iteration(X1))))),inference(spm,[status(thm)],[135570,242806,theory(equality)])).
% cnf(706642,plain,(strong_iteration(X1)=multiplication(strong_iteration(X1),addition(one,multiplication(addition(one,multiplication(strong_iteration(X1),zero)),strong_iteration(X1))))),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)],[706288,3356,theory(equality)]),26,theory(equality)]),90639,theory(equality)]),506,theory(equality)]),66,theory(equality)]),28,theory(equality)]),332014,theory(equality)])).
% cnf(706643,plain,(strong_iteration(X1)=multiplication(strong_iteration(X1),strong_iteration(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[706642,90639,theory(equality)]),506,theory(equality)]),66,theory(equality)]),28,theory(equality)]),249,theory(equality)])).
% cnf(707049,plain,(leq(multiplication(strong_iteration(X1),multiplication(strong_iteration(X1),star(strong_iteration(X1)))),strong_iteration(X1))|~leq(strong_iteration(X1),strong_iteration(X1))),inference(spm,[status(thm)],[1988,706643,theory(equality)])).
% cnf(707480,plain,(leq(star(strong_iteration(X1)),strong_iteration(X1))|~leq(strong_iteration(X1),strong_iteration(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[707049,3319,theory(equality)]),3319,theory(equality)])).
% cnf(707481,plain,(leq(star(strong_iteration(X1)),strong_iteration(X1))|$false),inference(rw,[status(thm)],[707480,84,theory(equality)])).
% cnf(707482,plain,(leq(star(strong_iteration(X1)),strong_iteration(X1))),inference(cn,[status(thm)],[707481,theory(equality)])).
% cnf(707940,plain,(addition(star(strong_iteration(X1)),strong_iteration(X1))=strong_iteration(X1)),inference(spm,[status(thm)],[61,707482,theory(equality)])).
% cnf(708064,plain,(star(strong_iteration(X1))=strong_iteration(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[707940,40,theory(equality)]),5249,theory(equality)])).
% cnf(709169,negated_conjecture,($false),inference(rw,[status(thm)],[65,708064,theory(equality)])).
% cnf(709170,negated_conjecture,($false),inference(cn,[status(thm)],[709169,theory(equality)])).
% cnf(709171,negated_conjecture,($false),709170,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 17.07 CPU 18.09 WC
% # Processed clauses : 11438
% # ...of these trivial : 3517
% # ...subsumed : 5838
% # ...remaining for further processing: 2083
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 8
% # Backward-rewritten : 492
% # Generated clauses : 359675
% # ...of the previous two non-trivial : 149177
% # Contextual simplify-reflections : 0
% # Paramodulations : 359673
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 1583
% # Positive orientable unit clauses: 1223
% # Positive unorientable unit clauses: 9
% # Negative unit clauses : 0
% # Non-unit-clauses : 351
% # Current number of unprocessed clauses: 113692
% # ...number of literals in the above : 157039
% # Clause-clause subsumption calls (NU) : 30270
% # Rec. Clause-clause subsumption calls : 30270
% # Unit Clause-clause subsumption calls : 932
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 11726
% # Indexed BW rewrite successes : 341
% # Backwards rewriting index: 811 leaves, 2.97+/-3.286 terms/leaf
% # Paramod-from index: 478 leaves, 2.59+/-3.493 terms/leaf
% # Paramod-into index: 707 leaves, 2.99+/-3.369 terms/leaf
% # -------------------------------------------------
% # User time : 8.455 s
% # System time : 0.372 s
% # Total time : 8.827 s
% # Maximum resident set size: 0 pages
% PrfWatch: 17.13 CPU 18.14 WC
% FINAL PrfWatch: 17.13 CPU 18.14 WC
% SZS output end Solution for /tmp/SystemOnTPTP17811/KLE145+1.tptp
%
%------------------------------------------------------------------------------