%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE044+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 : 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 07:44:45 EST 2010
% Result : Theorem 2.53s
% Output : Solution 2.53s
% 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/SystemOnTPTP13335/KLE044+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13335/KLE044+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13335/KLE044+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 13431
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(2, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(3, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(4, axiom,![X1]: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', right_distributivity)).
% fof(7, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(8, axiom,![X1]:leq(addition(one,multiplication(X1,star(X1))),star(X1)),file('/tmp/SRASS.s.p', star_unfold_right)).
% fof(9, axiom,![X1]:leq(addition(one,multiplication(star(X1),X1)),star(X1)),file('/tmp/SRASS.s.p', star_unfold_left)).
% fof(10, axiom,![X1]:![X2]:![X3]:(leq(addition(multiplication(X1,X2),X3),X2)=>leq(multiplication(star(X1),X3),X2)),file('/tmp/SRASS.s.p', star_induction_left)).
% fof(11, axiom,![X1]:![X2]:![X3]:(leq(addition(multiplication(X1,X2),X3),X1)=>leq(multiplication(X3,star(X2)),X1)),file('/tmp/SRASS.s.p', star_induction_right)).
% fof(12, axiom,![X1]:![X2]:![X3]:multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(13, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(17, conjecture,![X4]:star(addition(one,X4))=star(X4),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X4]:star(addition(one,X4))=star(X4)),inference(assume_negation,[status(cth)],[17])).
% fof(19, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(20,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[2])).
% cnf(22,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(24,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[4])).
% cnf(26,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[5])).
% cnf(28,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[6])).
% cnf(30,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[7])).
% cnf(32,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X2]:leq(addition(one,multiplication(X2,star(X2))),star(X2)),inference(variable_rename,[status(thm)],[8])).
% cnf(34,plain,(leq(addition(one,multiplication(X1,star(X1))),star(X1))),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X2]:leq(addition(one,multiplication(star(X2),X2)),star(X2)),inference(variable_rename,[status(thm)],[9])).
% cnf(36,plain,(leq(addition(one,multiplication(star(X1),X1)),star(X1))),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X1]:![X2]:![X3]:(~(leq(addition(multiplication(X1,X2),X3),X2))|leq(multiplication(star(X1),X3),X2)),inference(fof_nnf,[status(thm)],[10])).
% fof(38, plain,![X4]:![X5]:![X6]:(~(leq(addition(multiplication(X4,X5),X6),X5))|leq(multiplication(star(X4),X6),X5)),inference(variable_rename,[status(thm)],[37])).
% cnf(39,plain,(leq(multiplication(star(X1),X2),X3)|~leq(addition(multiplication(X1,X3),X2),X3)),inference(split_conjunct,[status(thm)],[38])).
% fof(40, plain,![X1]:![X2]:![X3]:(~(leq(addition(multiplication(X1,X2),X3),X1))|leq(multiplication(X3,star(X2)),X1)),inference(fof_nnf,[status(thm)],[11])).
% fof(41, plain,![X4]:![X5]:![X6]:(~(leq(addition(multiplication(X4,X5),X6),X4))|leq(multiplication(X6,star(X5)),X4)),inference(variable_rename,[status(thm)],[40])).
% cnf(42,plain,(leq(multiplication(X1,star(X2)),X3)|~leq(addition(multiplication(X3,X2),X1),X3)),inference(split_conjunct,[status(thm)],[41])).
% fof(43, plain,![X4]:![X5]:![X6]:multiplication(X4,multiplication(X5,X6))=multiplication(multiplication(X4,X5),X6),inference(variable_rename,[status(thm)],[12])).
% cnf(44,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[13])).
% fof(46, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[45])).
% cnf(47,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[46])).
% cnf(48,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[46])).
% fof(55, negated_conjecture,?[X4]:~(star(addition(one,X4))=star(X4)),inference(fof_nnf,[status(thm)],[18])).
% fof(56, negated_conjecture,?[X5]:~(star(addition(one,X5))=star(X5)),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,~(star(addition(one,esk1_0))=star(esk1_0)),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(star(addition(one,esk1_0))!=star(esk1_0)),inference(split_conjunct,[status(thm)],[57])).
% cnf(67,plain,(addition(X1,addition(X2,X3))=addition(X3,addition(X1,X2))),inference(spm,[status(thm)],[20,22,theory(equality)])).
% cnf(71,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[22,24,theory(equality)])).
% cnf(72,plain,(addition(addition(X2,X1),X3)=addition(X1,addition(X2,X3))),inference(spm,[status(thm)],[22,20,theory(equality)])).
% cnf(77,plain,(addition(X2,addition(X1,X3))=addition(X1,addition(X2,X3))),inference(rw,[status(thm)],[72,22,theory(equality)])).
% cnf(98,plain,(leq(X1,X1)),inference(spm,[status(thm)],[47,24,theory(equality)])).
% cnf(105,plain,(leq(multiplication(X1,star(one)),X2)|~leq(addition(X2,X1),X2)),inference(spm,[status(thm)],[42,26,theory(equality)])).
% cnf(107,plain,(leq(multiplication(multiplication(X1,X2),star(X2)),X1)|~leq(multiplication(X1,X2),X1)),inference(spm,[status(thm)],[42,24,theory(equality)])).
% cnf(108,plain,(leq(multiplication(X1,star(X2)),X3)|~leq(addition(X1,multiplication(X3,X2)),X3)),inference(spm,[status(thm)],[42,20,theory(equality)])).
% cnf(111,plain,(leq(multiplication(X1,multiplication(X2,star(X2))),X1)|~leq(multiplication(X1,X2),X1)),inference(rw,[status(thm)],[107,44,theory(equality)])).
% cnf(119,plain,(leq(multiplication(star(X1),X2),X3)|~leq(addition(X2,multiplication(X1,X3)),X3)),inference(spm,[status(thm)],[39,20,theory(equality)])).
% cnf(133,plain,(addition(multiplication(X1,X2),X1)=multiplication(X1,addition(X2,one))),inference(spm,[status(thm)],[30,26,theory(equality)])).
% cnf(163,plain,(leq(multiplication(star(X1),multiplication(X2,X3)),X3)|~leq(multiplication(addition(X1,X2),X3),X3)),inference(spm,[status(thm)],[39,32,theory(equality)])).
% cnf(167,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[32,28,theory(equality)])).
% cnf(191,plain,(addition(addition(one,multiplication(X1,star(X1))),star(X1))=star(X1)),inference(spm,[status(thm)],[48,34,theory(equality)])).
% cnf(194,plain,(leq(addition(one,star(one)),star(one))),inference(spm,[status(thm)],[34,28,theory(equality)])).
% cnf(195,plain,(addition(one,addition(multiplication(X1,star(X1)),star(X1)))=star(X1)),inference(rw,[status(thm)],[191,22,theory(equality)])).
% cnf(197,plain,(addition(addition(one,multiplication(star(X1),X1)),star(X1))=star(X1)),inference(spm,[status(thm)],[48,36,theory(equality)])).
% cnf(200,plain,(addition(one,addition(multiplication(star(X1),X1),star(X1)))=star(X1)),inference(rw,[status(thm)],[197,22,theory(equality)])).
% cnf(259,plain,(leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[47,71,theory(equality)])).
% cnf(332,plain,(addition(addition(one,star(one)),star(one))=star(one)),inference(spm,[status(thm)],[48,194,theory(equality)])).
% cnf(333,plain,(addition(one,star(one))=star(one)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[332,22,theory(equality)]),24,theory(equality)])).
% cnf(413,plain,(leq(X1,addition(X3,addition(X1,X2)))),inference(spm,[status(thm)],[259,67,theory(equality)])).
% cnf(1262,plain,(addition(X1,multiplication(X1,X2))=multiplication(X1,addition(X2,one))),inference(rw,[status(thm)],[133,20,theory(equality)])).
% cnf(1293,plain,(leq(X1,addition(X2,multiplication(X1,addition(X3,one))))),inference(spm,[status(thm)],[413,1262,theory(equality)])).
% cnf(1365,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[167,20,theory(equality)])).
% cnf(1380,plain,(leq(X1,multiplication(addition(X2,one),X1))),inference(spm,[status(thm)],[259,1365,theory(equality)])).
% cnf(2717,plain,(leq(multiplication(X1,star(one)),X1)|~leq(X1,X1)),inference(spm,[status(thm)],[105,24,theory(equality)])).
% cnf(2732,plain,(leq(multiplication(X1,star(one)),X1)|$false),inference(rw,[status(thm)],[2717,98,theory(equality)])).
% cnf(2733,plain,(leq(multiplication(X1,star(one)),X1)),inference(cn,[status(thm)],[2732,theory(equality)])).
% cnf(2738,plain,(leq(star(one),one)),inference(spm,[status(thm)],[2733,28,theory(equality)])).
% cnf(2745,plain,(addition(star(one),one)=one),inference(spm,[status(thm)],[48,2738,theory(equality)])).
% cnf(2747,plain,(star(one)=one),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2745,20,theory(equality)]),333,theory(equality)])).
% cnf(2781,plain,(leq(X1,X2)|~leq(addition(X2,X1),X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[105,2747,theory(equality)]),26,theory(equality)])).
% cnf(3133,plain,(leq(X1,X2)|~leq(addition(X1,X2),X2)),inference(spm,[status(thm)],[2781,20,theory(equality)])).
% cnf(4042,plain,(leq(multiplication(X1,star(X2)),X1)|~leq(multiplication(X1,addition(X2,one)),X1)),inference(spm,[status(thm)],[108,1262,theory(equality)])).
% cnf(4060,plain,(leq(X1,addition(X2,multiplication(X1,addition(one,X3))))),inference(spm,[status(thm)],[1293,20,theory(equality)])).
% cnf(5571,plain,(leq(X1,addition(multiplication(X1,addition(one,X3)),X2))),inference(spm,[status(thm)],[4060,20,theory(equality)])).
% cnf(7755,plain,(addition(one,multiplication(addition(X1,one),star(X1)))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[195,20,theory(equality)]),1365,theory(equality)])).
% cnf(7759,plain,(addition(one,star(X1))=star(X1)),inference(spm,[status(thm)],[71,7755,theory(equality)])).
% cnf(7765,plain,(leq(one,multiplication(addition(X1,one),star(X1)))|~leq(star(X1),multiplication(addition(X1,one),star(X1)))),inference(spm,[status(thm)],[3133,7755,theory(equality)])).
% cnf(7825,plain,(leq(multiplication(star(addition(X1,one)),one),star(X1))|~leq(star(X1),star(X1))),inference(spm,[status(thm)],[119,7755,theory(equality)])).
% cnf(7858,plain,(leq(one,multiplication(addition(X1,one),star(X1)))|$false),inference(rw,[status(thm)],[7765,1380,theory(equality)])).
% cnf(7859,plain,(leq(one,multiplication(addition(X1,one),star(X1)))),inference(cn,[status(thm)],[7858,theory(equality)])).
% cnf(7872,plain,(leq(star(addition(X1,one)),star(X1))|~leq(star(X1),star(X1))),inference(rw,[status(thm)],[7825,26,theory(equality)])).
% cnf(7873,plain,(leq(star(addition(X1,one)),star(X1))|$false),inference(rw,[status(thm)],[7872,98,theory(equality)])).
% cnf(7874,plain,(leq(star(addition(X1,one)),star(X1))),inference(cn,[status(thm)],[7873,theory(equality)])).
% cnf(7894,plain,(addition(star(X1),X2)=addition(one,addition(star(X1),X2))),inference(spm,[status(thm)],[22,7759,theory(equality)])).
% cnf(7964,plain,(leq(X1,addition(multiplication(X1,star(X2)),X3))),inference(spm,[status(thm)],[5571,7759,theory(equality)])).
% cnf(8538,plain,(addition(one,multiplication(star(X1),addition(X2,one)))=multiplication(star(X1),addition(X2,one))),inference(spm,[status(thm)],[7894,1262,theory(equality)])).
% cnf(8845,plain,(addition(star(addition(X1,one)),star(X1))=star(X1)),inference(spm,[status(thm)],[48,7874,theory(equality)])).
% cnf(8907,plain,(addition(one,multiplication(addition(X1,one),star(X1)))=multiplication(addition(X1,one),star(X1))),inference(spm,[status(thm)],[48,7859,theory(equality)])).
% cnf(8915,plain,(star(X1)=multiplication(addition(X1,one),star(X1))),inference(rw,[status(thm)],[8907,7755,theory(equality)])).
% cnf(8922,plain,(addition(star(X1),multiplication(X2,star(X1)))=multiplication(addition(addition(X1,one),X2),star(X1))),inference(spm,[status(thm)],[32,8915,theory(equality)])).
% cnf(8926,plain,(addition(addition(X1,one),star(X1))=multiplication(addition(X1,one),addition(star(X1),one))),inference(spm,[status(thm)],[1262,8915,theory(equality)])).
% cnf(8967,plain,(multiplication(addition(one,X1),star(X1))=star(X1)),inference(spm,[status(thm)],[8915,20,theory(equality)])).
% cnf(8971,plain,(multiplication(addition(X2,one),star(X1))=multiplication(addition(addition(X1,one),X2),star(X1))),inference(rw,[status(thm)],[8922,1365,theory(equality)])).
% cnf(8972,plain,(multiplication(addition(X2,one),star(X1))=multiplication(addition(X1,addition(one,X2)),star(X1))),inference(rw,[status(thm)],[8971,22,theory(equality)])).
% cnf(8975,plain,(addition(X1,star(X1))=multiplication(addition(X1,one),addition(star(X1),one))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[8926,22,theory(equality)]),7759,theory(equality)])).
% cnf(8976,plain,(addition(X1,star(X1))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[8975,20,theory(equality)]),7759,theory(equality)]),8915,theory(equality)])).
% cnf(9085,plain,(addition(X1,star(X2))=addition(X2,addition(X1,star(X2)))),inference(spm,[status(thm)],[77,8976,theory(equality)])).
% cnf(9895,plain,(multiplication(star(X1),star(star(X1)))=star(star(X1))),inference(spm,[status(thm)],[8967,7759,theory(equality)])).
% cnf(10621,plain,(addition(star(X1),star(addition(X1,one)))=star(X1)),inference(rw,[status(thm)],[8845,20,theory(equality)])).
% cnf(10798,plain,(leq(multiplication(star(X1),multiplication(one,star(X1))),star(X1))|~leq(star(X1),star(X1))),inference(spm,[status(thm)],[163,8915,theory(equality)])).
% cnf(10839,plain,(leq(multiplication(star(X1),star(X1)),star(X1))|~leq(star(X1),star(X1))),inference(rw,[status(thm)],[10798,28,theory(equality)])).
% cnf(10840,plain,(leq(multiplication(star(X1),star(X1)),star(X1))|$false),inference(rw,[status(thm)],[10839,98,theory(equality)])).
% cnf(10841,plain,(leq(multiplication(star(X1),star(X1)),star(X1))),inference(cn,[status(thm)],[10840,theory(equality)])).
% cnf(11935,plain,(leq(X1,star(multiplication(X1,star(X2))))),inference(spm,[status(thm)],[7964,8976,theory(equality)])).
% cnf(11967,plain,(addition(X1,star(multiplication(X1,star(X2))))=star(multiplication(X1,star(X2)))),inference(spm,[status(thm)],[48,11935,theory(equality)])).
% cnf(13567,plain,(addition(one,multiplication(star(X1),addition(X1,one)))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[200,20,theory(equality)]),1262,theory(equality)])).
% cnf(13889,plain,(multiplication(star(X1),addition(X1,one))=star(X1)),inference(rw,[status(thm)],[13567,8538,theory(equality)])).
% cnf(14033,plain,(multiplication(star(X1),addition(one,X1))=star(X1)),inference(spm,[status(thm)],[13889,20,theory(equality)])).
% cnf(14161,plain,(multiplication(star(addition(X1,star(one))),addition(X1,star(one)))=star(addition(X1,star(one)))),inference(spm,[status(thm)],[14033,9085,theory(equality)])).
% cnf(14173,plain,(multiplication(star(star(X1)),star(X1))=star(star(X1))),inference(spm,[status(thm)],[14033,7759,theory(equality)])).
% cnf(14253,plain,(multiplication(star(addition(X1,one)),addition(X1,one))=star(addition(X1,star(one)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[14161,2747,theory(equality)]),2747,theory(equality)])).
% cnf(14254,plain,(multiplication(star(addition(X1,one)),addition(X1,one))=star(addition(X1,one))),inference(rw,[status(thm)],[14253,2747,theory(equality)])).
% cnf(17923,plain,(leq(multiplication(star(X1),multiplication(star(X1),star(star(X1)))),star(X1))),inference(spm,[status(thm)],[111,10841,theory(equality)])).
% cnf(17931,plain,(leq(star(star(X1)),star(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[17923,9895,theory(equality)]),9895,theory(equality)])).
% cnf(17938,plain,(addition(star(star(X1)),star(X1))=star(X1)),inference(spm,[status(thm)],[48,17931,theory(equality)])).
% cnf(17957,plain,(star(star(X1))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[17938,20,theory(equality)]),8976,theory(equality)])).
% cnf(18037,plain,(multiplication(star(X1),star(X1))=star(star(X1))),inference(rw,[status(thm)],[14173,17957,theory(equality)])).
% cnf(18038,plain,(multiplication(star(X1),star(X1))=star(X1)),inference(rw,[status(thm)],[18037,17957,theory(equality)])).
% cnf(28740,plain,(multiplication(addition(X1,star(multiplication(one,star(X2)))),star(X1))=multiplication(addition(star(multiplication(one,star(X2))),one),star(X1))),inference(spm,[status(thm)],[8972,11967,theory(equality)])).
% cnf(28865,plain,(multiplication(addition(X1,star(X2)),star(X1))=multiplication(addition(star(multiplication(one,star(X2))),one),star(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[28740,28,theory(equality)]),17957,theory(equality)])).
% cnf(28866,plain,(multiplication(addition(X1,star(X2)),star(X1))=multiplication(star(X2),star(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[28865,28,theory(equality)]),17957,theory(equality)]),20,theory(equality)]),7759,theory(equality)])).
% cnf(29103,plain,(multiplication(star(X1),star(star(X1)))=multiplication(star(addition(X1,one)),star(star(X1)))),inference(spm,[status(thm)],[28866,10621,theory(equality)])).
% cnf(29185,plain,(star(X1)=multiplication(star(addition(X1,one)),star(star(X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[29103,17957,theory(equality)]),18038,theory(equality)])).
% cnf(29186,plain,(star(X1)=multiplication(star(addition(X1,one)),star(X1))),inference(rw,[status(thm)],[29185,17957,theory(equality)])).
% cnf(69949,plain,(leq(multiplication(star(addition(X1,one)),star(X1)),star(addition(X1,one)))|~leq(star(addition(X1,one)),star(addition(X1,one)))),inference(spm,[status(thm)],[4042,14254,theory(equality)])).
% cnf(69973,plain,(leq(star(X1),star(addition(X1,one)))|~leq(star(addition(X1,one)),star(addition(X1,one)))),inference(rw,[status(thm)],[69949,29186,theory(equality)])).
% cnf(69974,plain,(leq(star(X1),star(addition(X1,one)))|$false),inference(rw,[status(thm)],[69973,98,theory(equality)])).
% cnf(69975,plain,(leq(star(X1),star(addition(X1,one)))),inference(cn,[status(thm)],[69974,theory(equality)])).
% cnf(70133,plain,(addition(star(X1),star(addition(X1,one)))=star(addition(X1,one))),inference(spm,[status(thm)],[48,69975,theory(equality)])).
% cnf(70142,plain,(star(X1)=star(addition(X1,one))),inference(rw,[status(thm)],[70133,10621,theory(equality)])).
% cnf(70483,plain,(star(addition(one,X1))=star(X1)),inference(spm,[status(thm)],[70142,20,theory(equality)])).
% cnf(71137,negated_conjecture,($false),inference(rw,[status(thm)],[58,70483,theory(equality)])).
% cnf(71138,negated_conjecture,($false),inference(cn,[status(thm)],[71137,theory(equality)])).
% cnf(71139,negated_conjecture,($false),71138,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2493
% # ...of these trivial : 879
% # ...subsumed : 1004
% # ...remaining for further processing: 610
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 5
% # Backward-rewritten : 143
% # Generated clauses : 40160
% # ...of the previous two non-trivial : 23106
% # Contextual simplify-reflections : 0
% # Paramodulations : 40159
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 462
% # Positive orientable unit clauses: 320
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 0
% # Non-unit-clauses : 138
% # Current number of unprocessed clauses: 16612
% # ...number of literals in the above : 23372
% # Clause-clause subsumption calls (NU) : 8802
% # Rec. Clause-clause subsumption calls : 8802
% # Unit Clause-clause subsumption calls : 179
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1935
% # Indexed BW rewrite successes : 152
% # Backwards rewriting index: 260 leaves, 2.90+/-2.817 terms/leaf
% # Paramod-from index: 128 leaves, 2.55+/-3.089 terms/leaf
% # Paramod-into index: 226 leaves, 2.92+/-2.890 terms/leaf
% # -------------------------------------------------
% # User time : 0.868 s
% # System time : 0.030 s
% # Total time : 0.898 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.72 CPU 1.82 WC
% FINAL PrfWatch: 1.72 CPU 1.82 WC
% SZS output end Solution for /tmp/SystemOnTPTP13335/KLE044+1.tptp
%
%------------------------------------------------------------------------------