TSTP Solution File: KLE145+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE145+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 : art02.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:14 EST 2010
% Result : Theorem 17.10s
% Output : Solution 17.10s
% 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/SystemOnTPTP30253/KLE145+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30253/KLE145+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30253/KLE145+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 30349
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.94 CPU 2.02 WC
% PrfWatch: 3.92 CPU 4.03 WC
% PrfWatch: 5.91 CPU 6.03 WC
% PrfWatch: 7.91 CPU 8.04 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 9.87 CPU 10.04 WC
% PrfWatch: 11.87 CPU 12.05 WC
% PrfWatch: 13.86 CPU 14.05 WC
% PrfWatch: 15.86 CPU 16.05 WC
% # SZS output start CNFRefutation.
% fof(2, 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(3, 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(4, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(5, axiom,![X1]:strong_iteration(X1)=addition(star(X1),multiplication(strong_iteration(X1),zero)),file('/tmp/SRASS.s.p', isolation)).
% 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,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(9, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', idempotence)).
% fof(10, axiom,![X1]:multiplication(zero,X1)=zero,file('/tmp/SRASS.s.p', left_annihilation)).
% fof(11, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', distributivity1)).
% fof(12, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', distributivity2)).
% fof(13, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(14, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(15, axiom,![X1]:![X2]:![X3]:multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(16, axiom,![X1]:strong_iteration(X1)=addition(multiplication(X1,strong_iteration(X1)),one),file('/tmp/SRASS.s.p', infty_unfold1)).
% fof(17, axiom,![X1]:addition(one,multiplication(X1,star(X1)))=star(X1),file('/tmp/SRASS.s.p', star_unfold1)).
% fof(18, axiom,![X1]:addition(one,multiplication(star(X1),X1))=star(X1),file('/tmp/SRASS.s.p', star_unfold2)).
% fof(19, conjecture,![X4]:(leq(star(strong_iteration(X4)),strong_iteration(X4))&leq(strong_iteration(X4),star(strong_iteration(X4)))),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X4]:(leq(star(strong_iteration(X4)),strong_iteration(X4))&leq(strong_iteration(X4),star(strong_iteration(X4))))),inference(assume_negation,[status(cth)],[19])).
% fof(24, plain,![X1]:![X2]:![X3]:(~(leq(addition(multiplication(X1,X3),X2),X3))|leq(multiplication(star(X1),X2),X3)),inference(fof_nnf,[status(thm)],[2])).
% fof(25, plain,![X4]:![X5]:![X6]:(~(leq(addition(multiplication(X4,X6),X5),X6))|leq(multiplication(star(X4),X5),X6)),inference(variable_rename,[status(thm)],[24])).
% cnf(26,plain,(leq(multiplication(star(X1),X2),X3)|~leq(addition(multiplication(X1,X3),X2),X3)),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X1]:![X2]:![X3]:(~(leq(addition(multiplication(X3,X1),X2),X3))|leq(multiplication(X2,star(X1)),X3)),inference(fof_nnf,[status(thm)],[3])).
% fof(28, plain,![X4]:![X5]:![X6]:(~(leq(addition(multiplication(X6,X4),X5),X6))|leq(multiplication(X5,star(X4)),X6)),inference(variable_rename,[status(thm)],[27])).
% cnf(29,plain,(leq(multiplication(X1,star(X2)),X3)|~leq(addition(multiplication(X3,X2),X1),X3)),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(31, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[30])).
% cnf(32,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[31])).
% cnf(33,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[31])).
% fof(34, plain,![X2]:strong_iteration(X2)=addition(star(X2),multiplication(strong_iteration(X2),zero)),inference(variable_rename,[status(thm)],[5])).
% cnf(35,plain,(strong_iteration(X1)=addition(star(X1),multiplication(strong_iteration(X1),zero))),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[6])).
% cnf(37,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[7])).
% cnf(39,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[38])).
% fof(40, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[8])).
% cnf(41,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[40])).
% fof(42, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[9])).
% cnf(43,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[42])).
% fof(44, plain,![X2]:multiplication(zero,X2)=zero,inference(variable_rename,[status(thm)],[10])).
% cnf(45,plain,(multiplication(zero,X1)=zero),inference(split_conjunct,[status(thm)],[44])).
% fof(46, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[11])).
% cnf(47,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[46])).
% fof(48, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[12])).
% cnf(49,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[48])).
% fof(50, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[13])).
% cnf(51,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[50])).
% fof(52, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[14])).
% cnf(53,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[52])).
% fof(54, plain,![X4]:![X5]:![X6]:multiplication(X4,multiplication(X5,X6))=multiplication(multiplication(X4,X5),X6),inference(variable_rename,[status(thm)],[15])).
% cnf(55,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[54])).
% fof(56, plain,![X2]:strong_iteration(X2)=addition(multiplication(X2,strong_iteration(X2)),one),inference(variable_rename,[status(thm)],[16])).
% cnf(57,plain,(strong_iteration(X1)=addition(multiplication(X1,strong_iteration(X1)),one)),inference(split_conjunct,[status(thm)],[56])).
% fof(58, plain,![X2]:addition(one,multiplication(X2,star(X2)))=star(X2),inference(variable_rename,[status(thm)],[17])).
% cnf(59,plain,(addition(one,multiplication(X1,star(X1)))=star(X1)),inference(split_conjunct,[status(thm)],[58])).
% fof(60, plain,![X2]:addition(one,multiplication(star(X2),X2))=star(X2),inference(variable_rename,[status(thm)],[18])).
% cnf(61,plain,(addition(one,multiplication(star(X1),X1))=star(X1)),inference(split_conjunct,[status(thm)],[60])).
% fof(62, negated_conjecture,?[X4]:(~(leq(star(strong_iteration(X4)),strong_iteration(X4)))|~(leq(strong_iteration(X4),star(strong_iteration(X4))))),inference(fof_nnf,[status(thm)],[20])).
% fof(63, negated_conjecture,?[X5]:(~(leq(star(strong_iteration(X5)),strong_iteration(X5)))|~(leq(strong_iteration(X5),star(strong_iteration(X5))))),inference(variable_rename,[status(thm)],[62])).
% fof(64, negated_conjecture,(~(leq(star(strong_iteration(esk1_0)),strong_iteration(esk1_0)))|~(leq(strong_iteration(esk1_0),star(strong_iteration(esk1_0))))),inference(skolemize,[status(esa)],[63])).
% cnf(65,negated_conjecture,(~leq(strong_iteration(esk1_0),star(strong_iteration(esk1_0)))|~leq(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)],[41,37,theory(equality)])).
% cnf(76,plain,(addition(one,multiplication(X1,strong_iteration(X1)))=strong_iteration(X1)),inference(rw,[status(thm)],[57,37,theory(equality)])).
% cnf(84,plain,(leq(X1,X1)),inference(spm,[status(thm)],[32,43,theory(equality)])).
% cnf(88,plain,(addition(one,multiplication(X1,multiplication(X2,star(multiplication(X1,X2)))))=star(multiplication(X1,X2))),inference(spm,[status(thm)],[59,55,theory(equality)])).
% cnf(107,plain,(addition(star(X1),X2)=addition(one,addition(multiplication(star(X1),X1),X2))),inference(spm,[status(thm)],[39,61,theory(equality)])).
% cnf(108,plain,(addition(star(X1),X2)=addition(one,addition(multiplication(X1,star(X1)),X2))),inference(spm,[status(thm)],[39,59,theory(equality)])).
% cnf(109,plain,(addition(strong_iteration(X1),X2)=addition(one,addition(multiplication(X1,strong_iteration(X1)),X2))),inference(spm,[status(thm)],[39,76,theory(equality)])).
% cnf(111,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[39,43,theory(equality)])).
% cnf(132,plain,(leq(multiplication(multiplication(X1,X2),star(X2)),X1)|~leq(multiplication(X1,X2),X1)),inference(spm,[status(thm)],[29,43,theory(equality)])).
% cnf(136,plain,(leq(multiplication(X1,multiplication(X2,star(X2))),X1)|~leq(multiplication(X1,X2),X1)),inference(rw,[status(thm)],[132,55,theory(equality)])).
% cnf(146,plain,(addition(strong_iteration(X1),X2)=addition(star(X1),addition(multiplication(strong_iteration(X1),zero),X2))),inference(spm,[status(thm)],[39,35,theory(equality)])).
% cnf(158,plain,(addition(multiplication(X1,X2),X1)=multiplication(X1,addition(X2,one))),inference(spm,[status(thm)],[47,51,theory(equality)])).
% cnf(186,plain,(leq(multiplication(star(X1),multiplication(X2,X3)),X3)|~leq(multiplication(addition(X1,X2),X3),X3)),inference(spm,[status(thm)],[26,49,theory(equality)])).
% cnf(188,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[49,53,theory(equality)])).
% cnf(190,plain,(addition(multiplication(X1,X2),multiplication(X3,multiplication(X4,X2)))=multiplication(addition(X1,multiplication(X3,X4)),X2)),inference(spm,[status(thm)],[49,55,theory(equality)])).
% cnf(245,plain,(leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[32,111,theory(equality)])).
% cnf(250,plain,(addition(one,star(X1))=star(X1)),inference(spm,[status(thm)],[111,61,theory(equality)])).
% cnf(252,plain,(addition(one,strong_iteration(X1))=strong_iteration(X1)),inference(spm,[status(thm)],[111,76,theory(equality)])).
% cnf(289,plain,(leq(X1,addition(X2,X1))),inference(spm,[status(thm)],[245,37,theory(equality)])).
% cnf(390,plain,(leq(X1,addition(X2,addition(X3,X1)))),inference(spm,[status(thm)],[289,39,theory(equality)])).
% cnf(507,plain,(addition(X1,multiplication(X1,X2))=multiplication(X1,addition(X2,one))),inference(rw,[status(thm)],[158,37,theory(equality)])).
% cnf(612,plain,(leq(X1,addition(X2,addition(X1,X3)))),inference(spm,[status(thm)],[390,37,theory(equality)])).
% cnf(672,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[188,37,theory(equality)])).
% cnf(674,plain,(multiplication(addition(X1,one),zero)=multiplication(X1,zero)),inference(spm,[status(thm)],[66,672,theory(equality)])).
% cnf(694,plain,(addition(X1,multiplication(X2,multiplication(X3,X1)))=multiplication(addition(multiplication(X2,X3),one),X1)),inference(spm,[status(thm)],[672,55,theory(equality)])).
% cnf(718,plain,(multiplication(addition(one,X1),zero)=multiplication(X1,zero)),inference(spm,[status(thm)],[674,37,theory(equality)])).
% cnf(806,plain,(leq(one,addition(X1,star(X2)))),inference(spm,[status(thm)],[612,250,theory(equality)])).
% cnf(852,plain,(leq(one,addition(star(X2),X1))),inference(spm,[status(thm)],[806,37,theory(equality)])).
% cnf(1040,plain,(addition(one,multiplication(addition(one,X1),multiplication(zero,star(multiplication(X1,zero)))))=star(multiplication(X1,zero))),inference(spm,[status(thm)],[88,718,theory(equality)])).
% cnf(1062,plain,(addition(one,multiplication(X1,zero))=star(multiplication(X1,zero))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1040,45,theory(equality)]),718,theory(equality)])).
% cnf(1079,plain,(leq(one,multiplication(star(X1),addition(X2,one)))),inference(spm,[status(thm)],[852,507,theory(equality)])).
% cnf(2550,plain,(addition(one,multiplication(star(X1),X1))=addition(star(X1),multiplication(star(X1),X1))),inference(spm,[status(thm)],[107,43,theory(equality)])).
% cnf(2581,plain,(star(X1)=addition(star(X1),multiplication(star(X1),X1))),inference(rw,[status(thm)],[2550,61,theory(equality)])).
% cnf(2582,plain,(star(X1)=multiplication(star(X1),addition(X1,one))),inference(rw,[status(thm)],[2581,507,theory(equality)])).
% cnf(2594,plain,(addition(addition(X1,one),star(X1))=multiplication(addition(star(X1),one),addition(X1,one))),inference(spm,[status(thm)],[672,2582,theory(equality)])).
% cnf(2613,plain,(addition(X1,star(X1))=multiplication(addition(star(X1),one),addition(X1,one))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2594,39,theory(equality)]),250,theory(equality)])).
% cnf(2614,plain,(addition(X1,star(X1))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2613,37,theory(equality)]),250,theory(equality)]),2582,theory(equality)])).
% cnf(2637,plain,(leq(X1,star(X1))),inference(spm,[status(thm)],[32,2614,theory(equality)])).
% cnf(2686,negated_conjecture,($false|~leq(star(strong_iteration(esk1_0)),strong_iteration(esk1_0))),inference(rw,[status(thm)],[65,2637,theory(equality)])).
% cnf(2687,negated_conjecture,(~leq(star(strong_iteration(esk1_0)),strong_iteration(esk1_0))),inference(cn,[status(thm)],[2686,theory(equality)])).
% cnf(2968,plain,(addition(one,multiplication(X1,star(X1)))=addition(star(X1),multiplication(X1,star(X1)))),inference(spm,[status(thm)],[108,43,theory(equality)])).
% cnf(3004,plain,(star(X1)=addition(star(X1),multiplication(X1,star(X1)))),inference(rw,[status(thm)],[2968,59,theory(equality)])).
% cnf(3005,plain,(star(X1)=multiplication(addition(X1,one),star(X1))),inference(rw,[status(thm)],[3004,672,theory(equality)])).
% cnf(3409,plain,(addition(one,multiplication(X1,strong_iteration(X1)))=addition(strong_iteration(X1),multiplication(X1,strong_iteration(X1)))),inference(spm,[status(thm)],[109,43,theory(equality)])).
% cnf(3448,plain,(strong_iteration(X1)=addition(strong_iteration(X1),multiplication(X1,strong_iteration(X1)))),inference(rw,[status(thm)],[3409,76,theory(equality)])).
% cnf(3449,plain,(strong_iteration(X1)=multiplication(addition(X1,one),strong_iteration(X1))),inference(rw,[status(thm)],[3448,672,theory(equality)])).
% cnf(4088,plain,(addition(multiplication(X1,star(X2)),star(X2))=multiplication(addition(X1,addition(X2,one)),star(X2))),inference(spm,[status(thm)],[49,3005,theory(equality)])).
% cnf(4099,plain,(multiplication(addition(one,X1),star(X1))=star(X1)),inference(spm,[status(thm)],[3005,37,theory(equality)])).
% cnf(8133,plain,(multiplication(strong_iteration(X1),star(strong_iteration(X1)))=star(strong_iteration(X1))),inference(spm,[status(thm)],[4099,252,theory(equality)])).
% cnf(9342,plain,(leq(one,multiplication(star(X1),addition(one,X2)))),inference(spm,[status(thm)],[1079,37,theory(equality)])).
% cnf(16698,plain,(addition(one,multiplication(star(X1),addition(one,X2)))=multiplication(star(X1),addition(one,X2))),inference(spm,[status(thm)],[33,9342,theory(equality)])).
% cnf(28882,plain,(leq(multiplication(star(X1),multiplication(one,strong_iteration(X1))),strong_iteration(X1))|~leq(strong_iteration(X1),strong_iteration(X1))),inference(spm,[status(thm)],[186,3449,theory(equality)])).
% cnf(28978,plain,(leq(multiplication(star(X1),strong_iteration(X1)),strong_iteration(X1))|~leq(strong_iteration(X1),strong_iteration(X1))),inference(rw,[status(thm)],[28882,53,theory(equality)])).
% cnf(28979,plain,(leq(multiplication(star(X1),strong_iteration(X1)),strong_iteration(X1))|$false),inference(rw,[status(thm)],[28978,84,theory(equality)])).
% cnf(28980,plain,(leq(multiplication(star(X1),strong_iteration(X1)),strong_iteration(X1))),inference(cn,[status(thm)],[28979,theory(equality)])).
% cnf(30867,plain,(addition(multiplication(X1,X2),multiplication(X3,zero))=multiplication(addition(X1,multiplication(X3,zero)),X2)),inference(spm,[status(thm)],[190,45,theory(equality)])).
% cnf(35784,plain,(addition(multiplication(star(X1),strong_iteration(X1)),strong_iteration(X1))=strong_iteration(X1)),inference(spm,[status(thm)],[33,28980,theory(equality)])).
% cnf(86540,plain,(addition(X1,multiplication(X2,zero))=multiplication(addition(one,multiplication(X2,zero)),X1)),inference(spm,[status(thm)],[30867,53,theory(equality)])).
% cnf(105473,plain,(addition(X1,multiplication(X2,multiplication(X3,X1)))=multiplication(addition(one,multiplication(X2,X3)),X1)),inference(rw,[status(thm)],[694,37,theory(equality)])).
% cnf(105765,plain,(multiplication(addition(one,multiplication(X1,X2)),X1)=multiplication(X1,addition(multiplication(X2,X1),one))),inference(spm,[status(thm)],[507,105473,theory(equality)])).
% cnf(126765,plain,(multiplication(addition(one,multiplication(X1,X2)),X1)=multiplication(X1,addition(one,multiplication(X2,X1)))),inference(rw,[status(thm)],[105765,37,theory(equality)])).
% cnf(237705,plain,(multiplication(addition(X1,one),star(X2))=multiplication(addition(X1,addition(X2,one)),star(X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[4088,37,theory(equality)]),672,theory(equality)])).
% cnf(237904,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)],[237705,146,theory(equality)])).
% cnf(238137,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)],[237904,37,theory(equality)]),252,theory(equality)]),1062,theory(equality)])).
% cnf(238138,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)],[238137,37,theory(equality)]),250,theory(equality)]),1062,theory(equality)])).
% cnf(331670,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)],[35784,37,theory(equality)]),672,theory(equality)]),37,theory(equality)]),250,theory(equality)])).
% cnf(680058,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)],[126765,238138,theory(equality)])).
% cnf(680422,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)],[680058,16698,theory(equality)]),55,theory(equality)]),86540,theory(equality)]),507,theory(equality)]),66,theory(equality)]),51,theory(equality)]),331670,theory(equality)])).
% cnf(680423,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)],[680422,86540,theory(equality)]),507,theory(equality)]),66,theory(equality)]),51,theory(equality)]),252,theory(equality)])).
% cnf(680842,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)],[136,680423,theory(equality)])).
% cnf(681285,plain,(leq(star(strong_iteration(X1)),strong_iteration(X1))|~leq(strong_iteration(X1),strong_iteration(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[680842,8133,theory(equality)]),8133,theory(equality)])).
% cnf(681286,plain,(leq(star(strong_iteration(X1)),strong_iteration(X1))|$false),inference(rw,[status(thm)],[681285,84,theory(equality)])).
% cnf(681287,plain,(leq(star(strong_iteration(X1)),strong_iteration(X1))),inference(cn,[status(thm)],[681286,theory(equality)])).
% cnf(683462,negated_conjecture,($false),inference(rw,[status(thm)],[2687,681287,theory(equality)])).
% cnf(683463,negated_conjecture,($false),inference(cn,[status(thm)],[683462,theory(equality)])).
% cnf(683464,negated_conjecture,($false),683463,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 11571
% # ...of these trivial : 3540
% # ...subsumed : 6106
% # ...remaining for further processing: 1925
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 11
% # Backward-rewritten : 285
% # Generated clauses : 348094
% # ...of the previous two non-trivial : 150427
% # Contextual simplify-reflections : 0
% # Paramodulations : 348092
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 1629
% # Positive orientable unit clauses: 1292
% # Positive unorientable unit clauses: 12
% # Negative unit clauses : 0
% # Non-unit-clauses : 325
% # Current number of unprocessed clauses: 128741
% # ...number of literals in the above : 173528
% # Clause-clause subsumption calls (NU) : 30043
% # Rec. Clause-clause subsumption calls : 30043
% # Unit Clause-clause subsumption calls : 903
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 10821
% # Indexed BW rewrite successes : 496
% # Backwards rewriting index: 842 leaves, 2.95+/-3.416 terms/leaf
% # Paramod-from index: 523 leaves, 2.51+/-3.468 terms/leaf
% # Paramod-into index: 721 leaves, 3.02+/-3.546 terms/leaf
% # -------------------------------------------------
% # User time : 7.920 s
% # System time : 0.363 s
% # Total time : 8.283 s
% # Maximum resident set size: 0 pages
% PrfWatch: 16.25 CPU 16.47 WC
% FINAL PrfWatch: 16.25 CPU 16.47 WC
% SZS output end Solution for /tmp/SystemOnTPTP30253/KLE145+2.tptp
%
%------------------------------------------------------------------------------