TSTP Solution File: KLE044+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE044+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 : art04.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:50 EST 2010
% Result : Theorem 2.61s
% Output : Solution 2.61s
% 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/SystemOnTPTP15471/KLE044+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15471/KLE044+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15471/KLE044+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 15567
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:leq(addition(one,multiplication(X1,star(X1))),star(X1)),file('/tmp/SRASS.s.p', star_unfold_right)).
% fof(2, axiom,![X1]:leq(addition(one,multiplication(star(X1),X1)),star(X1)),file('/tmp/SRASS.s.p', star_unfold_left)).
% fof(3, 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(4, 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(5, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(6, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(7, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(8, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(9, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(10, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(11, axiom,![X1]:![X2]:![X3]:multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(12, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', right_distributivity)).
% fof(13, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(17, conjecture,![X4]:(leq(star(addition(one,X4)),star(X4))&leq(star(X4),star(addition(one,X4)))),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X4]:(leq(star(addition(one,X4)),star(X4))&leq(star(X4),star(addition(one,X4))))),inference(assume_negation,[status(cth)],[17])).
% fof(19, plain,![X2]:leq(addition(one,multiplication(X2,star(X2))),star(X2)),inference(variable_rename,[status(thm)],[1])).
% cnf(20,plain,(leq(addition(one,multiplication(X1,star(X1))),star(X1))),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X2]:leq(addition(one,multiplication(star(X2),X2)),star(X2)),inference(variable_rename,[status(thm)],[2])).
% cnf(22,plain,(leq(addition(one,multiplication(star(X1),X1)),star(X1))),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X1]:![X2]:![X3]:(~(leq(addition(multiplication(X1,X2),X3),X2))|leq(multiplication(star(X1),X3),X2)),inference(fof_nnf,[status(thm)],[3])).
% fof(24, plain,![X4]:![X5]:![X6]:(~(leq(addition(multiplication(X4,X5),X6),X5))|leq(multiplication(star(X4),X6),X5)),inference(variable_rename,[status(thm)],[23])).
% cnf(25,plain,(leq(multiplication(star(X1),X2),X3)|~leq(addition(multiplication(X1,X3),X2),X3)),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X1]:![X2]:![X3]:(~(leq(addition(multiplication(X1,X2),X3),X1))|leq(multiplication(X3,star(X2)),X1)),inference(fof_nnf,[status(thm)],[4])).
% fof(27, plain,![X4]:![X5]:![X6]:(~(leq(addition(multiplication(X4,X5),X6),X4))|leq(multiplication(X6,star(X5)),X4)),inference(variable_rename,[status(thm)],[26])).
% cnf(28,plain,(leq(multiplication(X1,star(X2)),X3)|~leq(addition(multiplication(X3,X2),X1),X3)),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[5])).
% fof(30, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[29])).
% cnf(31,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[30])).
% cnf(32,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[30])).
% fof(33, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[6])).
% cnf(34,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[7])).
% cnf(36,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[8])).
% cnf(38,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[37])).
% fof(39, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[9])).
% cnf(40,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[10])).
% cnf(42,plain,(addition(X1,X1)=X1),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)],[11])).
% cnf(44,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[12])).
% cnf(46,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[13])).
% cnf(48,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[47])).
% fof(55, negated_conjecture,?[X4]:(~(leq(star(addition(one,X4)),star(X4)))|~(leq(star(X4),star(addition(one,X4))))),inference(fof_nnf,[status(thm)],[18])).
% fof(56, negated_conjecture,?[X5]:(~(leq(star(addition(one,X5)),star(X5)))|~(leq(star(X5),star(addition(one,X5))))),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,(~(leq(star(addition(one,esk1_0)),star(esk1_0)))|~(leq(star(esk1_0),star(addition(one,esk1_0))))),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(~leq(star(esk1_0),star(addition(one,esk1_0)))|~leq(star(addition(one,esk1_0)),star(esk1_0))),inference(split_conjunct,[status(thm)],[57])).
% cnf(84,plain,(addition(X1,addition(X2,X3))=addition(X3,addition(X1,X2))),inference(spm,[status(thm)],[38,40,theory(equality)])).
% cnf(88,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[40,42,theory(equality)])).
% cnf(89,plain,(addition(addition(X2,X1),X3)=addition(X1,addition(X2,X3))),inference(spm,[status(thm)],[40,38,theory(equality)])).
% cnf(94,plain,(addition(X2,addition(X1,X3))=addition(X1,addition(X2,X3))),inference(rw,[status(thm)],[89,40,theory(equality)])).
% cnf(98,plain,(leq(X1,X1)),inference(spm,[status(thm)],[31,42,theory(equality)])).
% cnf(105,plain,(leq(multiplication(X1,star(one)),X2)|~leq(addition(X2,X1),X2)),inference(spm,[status(thm)],[28,34,theory(equality)])).
% cnf(107,plain,(leq(multiplication(multiplication(X1,X2),star(X2)),X1)|~leq(multiplication(X1,X2),X1)),inference(spm,[status(thm)],[28,42,theory(equality)])).
% cnf(108,plain,(leq(multiplication(X1,star(X2)),X3)|~leq(addition(X1,multiplication(X3,X2)),X3)),inference(spm,[status(thm)],[28,38,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)],[25,38,theory(equality)])).
% cnf(133,plain,(addition(multiplication(X1,X2),X1)=multiplication(X1,addition(X2,one))),inference(spm,[status(thm)],[46,34,theory(equality)])).
% cnf(163,plain,(leq(multiplication(star(X1),multiplication(X2,X3)),X3)|~leq(multiplication(addition(X1,X2),X3),X3)),inference(spm,[status(thm)],[25,48,theory(equality)])).
% cnf(167,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[48,36,theory(equality)])).
% cnf(191,plain,(addition(addition(one,multiplication(X1,star(X1))),star(X1))=star(X1)),inference(spm,[status(thm)],[32,20,theory(equality)])).
% cnf(194,plain,(leq(addition(one,star(one)),star(one))),inference(spm,[status(thm)],[20,36,theory(equality)])).
% cnf(195,plain,(addition(one,addition(multiplication(X1,star(X1)),star(X1)))=star(X1)),inference(rw,[status(thm)],[191,40,theory(equality)])).
% cnf(197,plain,(addition(addition(one,multiplication(star(X1),X1)),star(X1))=star(X1)),inference(spm,[status(thm)],[32,22,theory(equality)])).
% cnf(200,plain,(addition(one,addition(multiplication(star(X1),X1),star(X1)))=star(X1)),inference(rw,[status(thm)],[197,40,theory(equality)])).
% cnf(259,plain,(leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[31,88,theory(equality)])).
% cnf(332,plain,(addition(addition(one,star(one)),star(one))=star(one)),inference(spm,[status(thm)],[32,194,theory(equality)])).
% cnf(333,plain,(addition(one,star(one))=star(one)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[332,40,theory(equality)]),42,theory(equality)])).
% cnf(413,plain,(leq(X1,addition(X3,addition(X1,X2)))),inference(spm,[status(thm)],[259,84,theory(equality)])).
% cnf(1262,plain,(addition(X1,multiplication(X1,X2))=multiplication(X1,addition(X2,one))),inference(rw,[status(thm)],[133,38,theory(equality)])).
% cnf(1365,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[167,38,theory(equality)])).
% cnf(1380,plain,(leq(X1,multiplication(addition(X2,one),X1))),inference(spm,[status(thm)],[259,1365,theory(equality)])).
% cnf(1397,plain,(leq(X1,addition(X2,multiplication(addition(X3,one),X1)))),inference(spm,[status(thm)],[413,1365,theory(equality)])).
% cnf(2717,plain,(leq(multiplication(X1,star(one)),X1)|~leq(X1,X1)),inference(spm,[status(thm)],[105,42,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(2740,plain,(leq(star(one),one)),inference(spm,[status(thm)],[2733,36,theory(equality)])).
% cnf(2745,plain,(addition(star(one),one)=one),inference(spm,[status(thm)],[32,2740,theory(equality)])).
% cnf(2747,plain,(star(one)=one),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2745,38,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)]),34,theory(equality)])).
% cnf(3133,plain,(leq(X1,X2)|~leq(addition(X1,X2),X2)),inference(spm,[status(thm)],[2781,38,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(4093,plain,(leq(X1,addition(X2,multiplication(addition(one,X3),X1)))),inference(spm,[status(thm)],[1397,38,theory(equality)])).
% cnf(5924,plain,(leq(X1,multiplication(addition(one,X2),addition(X3,X1)))),inference(spm,[status(thm)],[4093,46,theory(equality)])).
% cnf(6838,plain,(leq(X1,multiplication(addition(one,X2),addition(X1,X3)))),inference(spm,[status(thm)],[5924,38,theory(equality)])).
% cnf(7648,plain,(addition(one,multiplication(addition(X1,one),star(X1)))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[195,38,theory(equality)]),1365,theory(equality)])).
% cnf(7651,plain,(addition(one,star(X1))=star(X1)),inference(spm,[status(thm)],[88,7648,theory(equality)])).
% cnf(7658,plain,(leq(one,multiplication(addition(X1,one),star(X1)))|~leq(star(X1),multiplication(addition(X1,one),star(X1)))),inference(spm,[status(thm)],[3133,7648,theory(equality)])).
% cnf(7717,plain,(leq(multiplication(star(addition(X1,one)),one),star(X1))|~leq(star(X1),star(X1))),inference(spm,[status(thm)],[119,7648,theory(equality)])).
% cnf(7749,plain,(leq(one,multiplication(addition(X1,one),star(X1)))|$false),inference(rw,[status(thm)],[7658,1380,theory(equality)])).
% cnf(7750,plain,(leq(one,multiplication(addition(X1,one),star(X1)))),inference(cn,[status(thm)],[7749,theory(equality)])).
% cnf(7762,plain,(leq(star(addition(X1,one)),star(X1))|~leq(star(X1),star(X1))),inference(rw,[status(thm)],[7717,34,theory(equality)])).
% cnf(7763,plain,(leq(star(addition(X1,one)),star(X1))|$false),inference(rw,[status(thm)],[7762,98,theory(equality)])).
% cnf(7764,plain,(leq(star(addition(X1,one)),star(X1))),inference(cn,[status(thm)],[7763,theory(equality)])).
% cnf(7783,plain,(addition(star(X1),X2)=addition(one,addition(star(X1),X2))),inference(spm,[status(thm)],[40,7651,theory(equality)])).
% cnf(7855,plain,(leq(X1,multiplication(star(X2),addition(X1,X3)))),inference(spm,[status(thm)],[6838,7651,theory(equality)])).
% cnf(8499,plain,(addition(one,multiplication(star(X1),addition(X2,one)))=multiplication(star(X1),addition(X2,one))),inference(spm,[status(thm)],[7783,1262,theory(equality)])).
% cnf(8638,plain,(addition(star(addition(X1,one)),star(X1))=star(X1)),inference(spm,[status(thm)],[32,7764,theory(equality)])).
% cnf(8644,plain,(leq(star(addition(one,X1)),star(X1))),inference(spm,[status(thm)],[7764,38,theory(equality)])).
% cnf(8680,negated_conjecture,(~leq(star(esk1_0),star(addition(one,esk1_0)))|$false),inference(rw,[status(thm)],[58,8644,theory(equality)])).
% cnf(8681,negated_conjecture,(~leq(star(esk1_0),star(addition(one,esk1_0)))),inference(cn,[status(thm)],[8680,theory(equality)])).
% cnf(8791,plain,(addition(one,multiplication(addition(X1,one),star(X1)))=multiplication(addition(X1,one),star(X1))),inference(spm,[status(thm)],[32,7750,theory(equality)])).
% cnf(8799,plain,(star(X1)=multiplication(addition(X1,one),star(X1))),inference(rw,[status(thm)],[8791,7648,theory(equality)])).
% cnf(8806,plain,(addition(star(X1),multiplication(X2,star(X1)))=multiplication(addition(addition(X1,one),X2),star(X1))),inference(spm,[status(thm)],[48,8799,theory(equality)])).
% cnf(8810,plain,(addition(addition(X1,one),star(X1))=multiplication(addition(X1,one),addition(star(X1),one))),inference(spm,[status(thm)],[1262,8799,theory(equality)])).
% cnf(8850,plain,(multiplication(addition(one,X1),star(X1))=star(X1)),inference(spm,[status(thm)],[8799,38,theory(equality)])).
% cnf(8854,plain,(multiplication(addition(X2,one),star(X1))=multiplication(addition(addition(X1,one),X2),star(X1))),inference(rw,[status(thm)],[8806,1365,theory(equality)])).
% cnf(8855,plain,(multiplication(addition(X2,one),star(X1))=multiplication(addition(X1,addition(one,X2)),star(X1))),inference(rw,[status(thm)],[8854,40,theory(equality)])).
% cnf(8858,plain,(addition(X1,star(X1))=multiplication(addition(X1,one),addition(star(X1),one))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[8810,40,theory(equality)]),7651,theory(equality)])).
% cnf(8859,plain,(addition(X1,star(X1))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[8858,38,theory(equality)]),7651,theory(equality)]),8799,theory(equality)])).
% cnf(8964,plain,(addition(X1,star(X2))=addition(X2,addition(X1,star(X2)))),inference(spm,[status(thm)],[94,8859,theory(equality)])).
% cnf(9778,plain,(multiplication(star(X1),star(star(X1)))=star(star(X1))),inference(spm,[status(thm)],[8850,7651,theory(equality)])).
% cnf(10469,plain,(addition(star(X1),star(addition(X1,one)))=star(X1)),inference(rw,[status(thm)],[8638,38,theory(equality)])).
% cnf(10836,plain,(leq(multiplication(star(X1),multiplication(one,star(X1))),star(X1))|~leq(star(X1),star(X1))),inference(spm,[status(thm)],[163,8799,theory(equality)])).
% cnf(10877,plain,(leq(multiplication(star(X1),star(X1)),star(X1))|~leq(star(X1),star(X1))),inference(rw,[status(thm)],[10836,36,theory(equality)])).
% cnf(10878,plain,(leq(multiplication(star(X1),star(X1)),star(X1))|$false),inference(rw,[status(thm)],[10877,98,theory(equality)])).
% cnf(10879,plain,(leq(multiplication(star(X1),star(X1)),star(X1))),inference(cn,[status(thm)],[10878,theory(equality)])).
% cnf(12686,plain,(leq(X1,multiplication(star(X2),star(X1)))),inference(spm,[status(thm)],[7855,8859,theory(equality)])).
% cnf(12705,plain,(addition(X1,multiplication(star(X2),star(X1)))=multiplication(star(X2),star(X1))),inference(spm,[status(thm)],[32,12686,theory(equality)])).
% cnf(13595,plain,(multiplication(star(X1),addition(X1,one))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[200,38,theory(equality)]),1262,theory(equality)]),8499,theory(equality)])).
% cnf(13655,plain,(multiplication(star(X1),addition(one,X1))=star(X1)),inference(spm,[status(thm)],[13595,38,theory(equality)])).
% cnf(13794,plain,(multiplication(star(addition(X1,star(one))),addition(X1,star(one)))=star(addition(X1,star(one)))),inference(spm,[status(thm)],[13655,8964,theory(equality)])).
% cnf(13820,plain,(multiplication(star(star(X1)),star(X1))=star(star(X1))),inference(spm,[status(thm)],[13655,7651,theory(equality)])).
% cnf(13877,plain,(multiplication(star(addition(X1,one)),addition(X1,one))=star(addition(X1,star(one)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[13794,2747,theory(equality)]),2747,theory(equality)])).
% cnf(13878,plain,(multiplication(star(addition(X1,one)),addition(X1,one))=star(addition(X1,one))),inference(rw,[status(thm)],[13877,2747,theory(equality)])).
% cnf(17747,plain,(leq(multiplication(star(X1),multiplication(star(X1),star(star(X1)))),star(X1))),inference(spm,[status(thm)],[111,10879,theory(equality)])).
% cnf(17755,plain,(leq(star(star(X1)),star(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[17747,9778,theory(equality)]),9778,theory(equality)])).
% cnf(17762,plain,(addition(star(star(X1)),star(X1))=star(X1)),inference(spm,[status(thm)],[32,17755,theory(equality)])).
% cnf(17781,plain,(star(star(X1))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[17762,38,theory(equality)]),8859,theory(equality)])).
% cnf(17861,plain,(multiplication(star(X1),star(X1))=star(star(X1))),inference(rw,[status(thm)],[13820,17781,theory(equality)])).
% cnf(17862,plain,(multiplication(star(X1),star(X1))=star(X1)),inference(rw,[status(thm)],[17861,17781,theory(equality)])).
% cnf(28570,plain,(multiplication(addition(X1,multiplication(star(X2),star(one))),star(X1))=multiplication(addition(multiplication(star(X2),star(one)),one),star(X1))),inference(spm,[status(thm)],[8855,12705,theory(equality)])).
% cnf(28698,plain,(multiplication(addition(X1,star(X2)),star(X1))=multiplication(addition(multiplication(star(X2),star(one)),one),star(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[28570,2747,theory(equality)]),34,theory(equality)])).
% cnf(28699,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)],[28698,2747,theory(equality)]),34,theory(equality)]),38,theory(equality)]),7651,theory(equality)])).
% cnf(29084,plain,(multiplication(star(X1),star(star(X1)))=multiplication(star(addition(X1,one)),star(star(X1)))),inference(spm,[status(thm)],[28699,10469,theory(equality)])).
% cnf(29167,plain,(star(X1)=multiplication(star(addition(X1,one)),star(star(X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[29084,17781,theory(equality)]),17862,theory(equality)])).
% cnf(29168,plain,(star(X1)=multiplication(star(addition(X1,one)),star(X1))),inference(rw,[status(thm)],[29167,17781,theory(equality)])).
% cnf(70550,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,13878,theory(equality)])).
% cnf(70575,plain,(leq(star(X1),star(addition(X1,one)))|~leq(star(addition(X1,one)),star(addition(X1,one)))),inference(rw,[status(thm)],[70550,29168,theory(equality)])).
% cnf(70576,plain,(leq(star(X1),star(addition(X1,one)))|$false),inference(rw,[status(thm)],[70575,98,theory(equality)])).
% cnf(70577,plain,(leq(star(X1),star(addition(X1,one)))),inference(cn,[status(thm)],[70576,theory(equality)])).
% cnf(70730,plain,(addition(star(X1),star(addition(X1,one)))=star(addition(X1,one))),inference(spm,[status(thm)],[32,70577,theory(equality)])).
% cnf(70739,plain,(star(X1)=star(addition(X1,one))),inference(rw,[status(thm)],[70730,10469,theory(equality)])).
% cnf(71082,plain,(star(addition(one,X1))=star(X1)),inference(spm,[status(thm)],[70739,38,theory(equality)])).
% cnf(71732,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[8681,71082,theory(equality)]),98,theory(equality)])).
% cnf(71733,negated_conjecture,($false),inference(cn,[status(thm)],[71732,theory(equality)])).
% cnf(71734,negated_conjecture,($false),71733,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2493
% # ...of these trivial : 871
% # ...subsumed : 1006
% # ...remaining for further processing: 616
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 5
% # Backward-rewritten : 140
% # Generated clauses : 40461
% # ...of the previous two non-trivial : 23016
% # Contextual simplify-reflections : 0
% # Paramodulations : 40460
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 471
% # Positive orientable unit clauses: 330
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 0
% # Non-unit-clauses : 137
% # Current number of unprocessed clauses: 16697
% # ...number of literals in the above : 23345
% # Clause-clause subsumption calls (NU) : 8754
% # Rec. Clause-clause subsumption calls : 8754
% # Unit Clause-clause subsumption calls : 185
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2050
% # Indexed BW rewrite successes : 152
% # Backwards rewriting index: 264 leaves, 2.95+/-2.970 terms/leaf
% # Paramod-from index: 128 leaves, 2.62+/-3.295 terms/leaf
% # Paramod-into index: 230 leaves, 2.98+/-3.065 terms/leaf
% # -------------------------------------------------
% # User time : 0.866 s
% # System time : 0.040 s
% # Total time : 0.906 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.81 CPU 1.90 WC
% FINAL PrfWatch: 1.81 CPU 1.90 WC
% SZS output end Solution for /tmp/SystemOnTPTP15471/KLE044+2.tptp
%
%------------------------------------------------------------------------------