TSTP Solution File: KLE041+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE041+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 07:43:48 EST 2010
% Result : Theorem 4.84s
% Output : Solution 4.84s
% 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/SystemOnTPTP30244/KLE041+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30244/KLE041+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30244/KLE041+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 30340
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.93 CPU 2.03 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]:![X3]:(leq(addition(multiplication(X1,X2),X3),X2)=>leq(multiplication(star(X1),X3),X2)),file('/tmp/SRASS.s.p', star_induction_left)).
% fof(2, 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(3, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(4, axiom,![X1]:leq(addition(one,multiplication(X1,star(X1))),star(X1)),file('/tmp/SRASS.s.p', star_unfold_right)).
% fof(5, axiom,![X1]:leq(addition(one,multiplication(star(X1),X1)),star(X1)),file('/tmp/SRASS.s.p', star_unfold_left)).
% 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]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', right_distributivity)).
% fof(9, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', left_distributivity)).
% 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', additive_idempotence)).
% fof(13, axiom,![X1]:![X2]:![X3]:multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(17, conjecture,![X4]:![X5]:(leq(X4,X5)=>leq(star(X4),star(X5))),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X4]:![X5]:(leq(X4,X5)=>leq(star(X4),star(X5)))),inference(assume_negation,[status(cth)],[17])).
% fof(19, plain,![X1]:![X2]:![X3]:(~(leq(addition(multiplication(X1,X2),X3),X2))|leq(multiplication(star(X1),X3),X2)),inference(fof_nnf,[status(thm)],[1])).
% fof(20, plain,![X4]:![X5]:![X6]:(~(leq(addition(multiplication(X4,X5),X6),X5))|leq(multiplication(star(X4),X6),X5)),inference(variable_rename,[status(thm)],[19])).
% cnf(21,plain,(leq(multiplication(star(X1),X2),X3)|~leq(addition(multiplication(X1,X3),X2),X3)),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X1]:![X2]:![X3]:(~(leq(addition(multiplication(X1,X2),X3),X1))|leq(multiplication(X3,star(X2)),X1)),inference(fof_nnf,[status(thm)],[2])).
% fof(23, plain,![X4]:![X5]:![X6]:(~(leq(addition(multiplication(X4,X5),X6),X4))|leq(multiplication(X6,star(X5)),X4)),inference(variable_rename,[status(thm)],[22])).
% cnf(24,plain,(leq(multiplication(X1,star(X2)),X3)|~leq(addition(multiplication(X3,X2),X1),X3)),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(26, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[25])).
% cnf(27,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[26])).
% cnf(28,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[26])).
% fof(29, plain,![X2]:leq(addition(one,multiplication(X2,star(X2))),star(X2)),inference(variable_rename,[status(thm)],[4])).
% cnf(30,plain,(leq(addition(one,multiplication(X1,star(X1))),star(X1))),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X2]:leq(addition(one,multiplication(star(X2),X2)),star(X2)),inference(variable_rename,[status(thm)],[5])).
% cnf(32,plain,(leq(addition(one,multiplication(star(X1),X1)),star(X1))),inference(split_conjunct,[status(thm)],[31])).
% 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,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[8])).
% cnf(38,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[37])).
% fof(39, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[9])).
% cnf(40,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[10])).
% cnf(42,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[41])).
% fof(43, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[11])).
% cnf(44,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[12])).
% cnf(46,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X4]:![X5]:![X6]:multiplication(X4,multiplication(X5,X6))=multiplication(multiplication(X4,X5),X6),inference(variable_rename,[status(thm)],[13])).
% cnf(48,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[47])).
% fof(55, negated_conjecture,?[X4]:?[X5]:(leq(X4,X5)&~(leq(star(X4),star(X5)))),inference(fof_nnf,[status(thm)],[18])).
% fof(56, negated_conjecture,?[X6]:?[X7]:(leq(X6,X7)&~(leq(star(X6),star(X7)))),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,(leq(esk1_0,esk2_0)&~(leq(star(esk1_0),star(esk2_0)))),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(~leq(star(esk1_0),star(esk2_0))),inference(split_conjunct,[status(thm)],[57])).
% cnf(59,negated_conjecture,(leq(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[57])).
% cnf(83,negated_conjecture,(addition(esk1_0,esk2_0)=esk2_0),inference(spm,[status(thm)],[28,59,theory(equality)])).
% cnf(85,plain,(leq(X1,X1)),inference(spm,[status(thm)],[27,46,theory(equality)])).
% cnf(95,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[44,46,theory(equality)])).
% cnf(107,plain,(leq(multiplication(X1,star(one)),X2)|~leq(addition(X2,X1),X2)),inference(spm,[status(thm)],[24,34,theory(equality)])).
% cnf(109,plain,(leq(multiplication(multiplication(X1,X2),star(X2)),X1)|~leq(multiplication(X1,X2),X1)),inference(spm,[status(thm)],[24,46,theory(equality)])).
% cnf(110,plain,(leq(multiplication(X1,star(X2)),X3)|~leq(addition(X1,multiplication(X3,X2)),X3)),inference(spm,[status(thm)],[24,42,theory(equality)])).
% cnf(113,plain,(leq(multiplication(X1,multiplication(X2,star(X2))),X1)|~leq(multiplication(X1,X2),X1)),inference(rw,[status(thm)],[109,48,theory(equality)])).
% cnf(135,plain,(addition(multiplication(X1,X2),X1)=multiplication(X1,addition(X2,one))),inference(spm,[status(thm)],[38,34,theory(equality)])).
% cnf(165,plain,(leq(multiplication(star(X1),multiplication(X2,X3)),X3)|~leq(multiplication(addition(X1,X2),X3),X3)),inference(spm,[status(thm)],[21,40,theory(equality)])).
% cnf(168,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[40,36,theory(equality)])).
% cnf(193,plain,(addition(addition(one,multiplication(X1,star(X1))),star(X1))=star(X1)),inference(spm,[status(thm)],[28,30,theory(equality)])).
% cnf(195,plain,(leq(addition(one,star(one)),star(one))),inference(spm,[status(thm)],[30,36,theory(equality)])).
% cnf(197,plain,(addition(one,addition(multiplication(X1,star(X1)),star(X1)))=star(X1)),inference(rw,[status(thm)],[193,44,theory(equality)])).
% cnf(199,plain,(addition(addition(one,multiplication(star(X1),X1)),star(X1))=star(X1)),inference(spm,[status(thm)],[28,32,theory(equality)])).
% cnf(202,plain,(addition(one,addition(multiplication(star(X1),X1),star(X1)))=star(X1)),inference(rw,[status(thm)],[199,44,theory(equality)])).
% cnf(206,negated_conjecture,(addition(esk2_0,X1)=addition(esk1_0,addition(esk2_0,X1))),inference(spm,[status(thm)],[44,83,theory(equality)])).
% cnf(232,plain,(leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[27,95,theory(equality)])).
% cnf(263,plain,(leq(multiplication(X1,X2),multiplication(X1,addition(X2,X3)))),inference(spm,[status(thm)],[232,38,theory(equality)])).
% cnf(268,plain,(leq(X1,addition(X2,X1))),inference(spm,[status(thm)],[232,42,theory(equality)])).
% cnf(281,plain,(leq(X1,addition(X2,addition(X3,X1)))),inference(spm,[status(thm)],[268,44,theory(equality)])).
% cnf(298,plain,(addition(addition(one,star(one)),star(one))=star(one)),inference(spm,[status(thm)],[28,195,theory(equality)])).
% cnf(299,plain,(addition(one,star(one))=star(one)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[298,44,theory(equality)]),46,theory(equality)])).
% cnf(496,plain,(leq(X1,addition(X2,addition(X1,X3)))),inference(spm,[status(thm)],[281,42,theory(equality)])).
% cnf(1565,plain,(addition(X1,multiplication(X1,X2))=multiplication(X1,addition(X2,one))),inference(rw,[status(thm)],[135,42,theory(equality)])).
% cnf(1600,plain,(leq(X1,addition(X2,multiplication(X1,addition(X3,one))))),inference(spm,[status(thm)],[496,1565,theory(equality)])).
% cnf(1631,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[168,42,theory(equality)])).
% cnf(1650,plain,(leq(X1,multiplication(addition(X2,one),X1))),inference(spm,[status(thm)],[232,1631,theory(equality)])).
% cnf(1670,plain,(addition(X1,multiplication(X2,multiplication(X3,X1)))=multiplication(addition(multiplication(X2,X3),one),X1)),inference(spm,[status(thm)],[1631,48,theory(equality)])).
% cnf(2908,plain,(leq(multiplication(X1,star(one)),X1)|~leq(X1,X1)),inference(spm,[status(thm)],[107,46,theory(equality)])).
% cnf(2924,plain,(leq(multiplication(X1,star(one)),X1)|$false),inference(rw,[status(thm)],[2908,85,theory(equality)])).
% cnf(2925,plain,(leq(multiplication(X1,star(one)),X1)),inference(cn,[status(thm)],[2924,theory(equality)])).
% cnf(2929,plain,(leq(star(one),one)),inference(spm,[status(thm)],[2925,36,theory(equality)])).
% cnf(2937,plain,(addition(star(one),one)=one),inference(spm,[status(thm)],[28,2929,theory(equality)])).
% cnf(2939,plain,(star(one)=one),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2937,42,theory(equality)]),299,theory(equality)])).
% cnf(2964,plain,(leq(X1,X2)|~leq(addition(X2,X1),X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[107,2939,theory(equality)]),34,theory(equality)])).
% cnf(3180,plain,(leq(X1,X2)|~leq(addition(X1,X2),X2)),inference(spm,[status(thm)],[2964,42,theory(equality)])).
% cnf(3555,negated_conjecture,(leq(multiplication(X1,esk1_0),multiplication(X1,addition(esk2_0,X2)))),inference(spm,[status(thm)],[263,206,theory(equality)])).
% cnf(3963,plain,(leq(multiplication(X1,star(X2)),X1)|~leq(multiplication(X1,addition(X2,one)),X1)),inference(spm,[status(thm)],[110,1565,theory(equality)])).
% cnf(4748,plain,(leq(X1,multiplication(addition(X2,X1),addition(X3,one)))),inference(spm,[status(thm)],[1600,40,theory(equality)])).
% cnf(8477,plain,(leq(X1,multiplication(addition(X1,X2),addition(X3,one)))),inference(spm,[status(thm)],[4748,42,theory(equality)])).
% cnf(13939,plain,(addition(X1,multiplication(X2,multiplication(X3,X1)))=multiplication(addition(one,multiplication(X2,X3)),X1)),inference(rw,[status(thm)],[1670,42,theory(equality)])).
% cnf(14085,plain,(multiplication(addition(one,multiplication(X1,X2)),X1)=multiplication(X1,addition(multiplication(X2,X1),one))),inference(spm,[status(thm)],[1565,13939,theory(equality)])).
% cnf(14185,plain,(multiplication(addition(one,multiplication(X1,X2)),X1)=multiplication(X1,addition(one,multiplication(X2,X1)))),inference(rw,[status(thm)],[14085,42,theory(equality)])).
% cnf(15246,plain,(addition(one,multiplication(addition(X1,one),star(X1)))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[197,42,theory(equality)]),1631,theory(equality)])).
% cnf(15250,plain,(addition(one,star(X1))=star(X1)),inference(spm,[status(thm)],[95,15246,theory(equality)])).
% cnf(15262,plain,(leq(one,multiplication(addition(X1,one),star(X1)))|~leq(star(X1),multiplication(addition(X1,one),star(X1)))),inference(spm,[status(thm)],[3180,15246,theory(equality)])).
% cnf(15367,plain,(leq(one,multiplication(addition(X1,one),star(X1)))|$false),inference(rw,[status(thm)],[15262,1650,theory(equality)])).
% cnf(15368,plain,(leq(one,multiplication(addition(X1,one),star(X1)))),inference(cn,[status(thm)],[15367,theory(equality)])).
% cnf(15423,plain,(leq(one,multiplication(star(X1),addition(X2,one)))),inference(spm,[status(thm)],[8477,15250,theory(equality)])).
% cnf(16354,plain,(addition(one,multiplication(star(X1),addition(X1,one)))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[202,42,theory(equality)]),1565,theory(equality)])).
% cnf(16871,plain,(addition(one,multiplication(addition(X1,one),star(X1)))=multiplication(addition(X1,one),star(X1))),inference(spm,[status(thm)],[28,15368,theory(equality)])).
% cnf(16879,plain,(star(X1)=multiplication(addition(X1,one),star(X1))),inference(rw,[status(thm)],[16871,15246,theory(equality)])).
% cnf(16891,plain,(addition(addition(X1,one),star(X1))=multiplication(addition(X1,one),addition(star(X1),one))),inference(spm,[status(thm)],[1565,16879,theory(equality)])).
% cnf(16900,plain,(multiplication(addition(one,star(X1)),addition(X1,one))=multiplication(addition(X1,one),addition(one,multiplication(star(X1),addition(X1,one))))),inference(spm,[status(thm)],[14185,16879,theory(equality)])).
% cnf(16923,plain,(leq(multiplication(star(X1),multiplication(one,star(X1))),star(X1))|~leq(star(X1),star(X1))),inference(spm,[status(thm)],[165,16879,theory(equality)])).
% cnf(16939,plain,(multiplication(addition(one,X1),star(X1))=star(X1)),inference(spm,[status(thm)],[16879,42,theory(equality)])).
% cnf(16948,plain,(addition(X1,star(X1))=multiplication(addition(X1,one),addition(star(X1),one))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[16891,44,theory(equality)]),15250,theory(equality)])).
% cnf(16949,plain,(addition(X1,star(X1))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[16948,42,theory(equality)]),15250,theory(equality)]),16879,theory(equality)])).
% cnf(16959,plain,(multiplication(star(X1),addition(X1,one))=multiplication(addition(X1,one),addition(one,multiplication(star(X1),addition(X1,one))))),inference(rw,[status(thm)],[16900,15250,theory(equality)])).
% cnf(16960,plain,(multiplication(star(X1),addition(X1,one))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[16959,16354,theory(equality)]),16879,theory(equality)])).
% cnf(16973,plain,(leq(multiplication(star(X1),star(X1)),star(X1))|~leq(star(X1),star(X1))),inference(rw,[status(thm)],[16923,36,theory(equality)])).
% cnf(16974,plain,(leq(multiplication(star(X1),star(X1)),star(X1))|$false),inference(rw,[status(thm)],[16973,85,theory(equality)])).
% cnf(16975,plain,(leq(multiplication(star(X1),star(X1)),star(X1))),inference(cn,[status(thm)],[16974,theory(equality)])).
% cnf(19243,negated_conjecture,(leq(multiplication(star(esk2_0),esk1_0),star(esk2_0))),inference(spm,[status(thm)],[3555,16960,theory(equality)])).
% cnf(19323,negated_conjecture,(addition(multiplication(star(esk2_0),esk1_0),star(esk2_0))=star(esk2_0)),inference(spm,[status(thm)],[28,19243,theory(equality)])).
% cnf(19482,negated_conjecture,(multiplication(star(esk2_0),addition(one,esk1_0))=star(esk2_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[19323,42,theory(equality)]),1565,theory(equality)]),42,theory(equality)])).
% cnf(19641,plain,(multiplication(star(X1),star(star(X1)))=star(star(X1))),inference(spm,[status(thm)],[16939,15250,theory(equality)])).
% cnf(19884,plain,(leq(one,multiplication(star(X1),addition(one,X2)))),inference(spm,[status(thm)],[15423,42,theory(equality)])).
% cnf(23356,plain,(leq(multiplication(star(X1),multiplication(star(X1),star(star(X1)))),star(X1))),inference(spm,[status(thm)],[113,16975,theory(equality)])).
% cnf(23364,plain,(leq(star(star(X1)),star(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[23356,19641,theory(equality)]),19641,theory(equality)])).
% cnf(23371,plain,(addition(star(star(X1)),star(X1))=star(X1)),inference(spm,[status(thm)],[28,23364,theory(equality)])).
% cnf(23380,plain,(star(star(X1))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[23371,42,theory(equality)]),16949,theory(equality)])).
% cnf(27400,plain,(leq(one,multiplication(star(X1),star(X2)))),inference(spm,[status(thm)],[19884,15250,theory(equality)])).
% cnf(27428,plain,(addition(one,multiplication(star(X1),star(X2)))=multiplication(star(X1),star(X2))),inference(spm,[status(thm)],[28,27400,theory(equality)])).
% cnf(43289,plain,(leq(multiplication(one,star(star(X1))),star(X2))|~leq(multiplication(star(X2),star(X1)),star(X2))),inference(spm,[status(thm)],[110,27428,theory(equality)])).
% cnf(43433,plain,(leq(star(X1),star(X2))|~leq(multiplication(star(X2),star(X1)),star(X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[43289,36,theory(equality)]),23380,theory(equality)])).
% cnf(68777,plain,(leq(multiplication(X1,star(X2)),X1)|~leq(multiplication(X1,addition(one,X2)),X1)),inference(spm,[status(thm)],[3963,42,theory(equality)])).
% cnf(152168,negated_conjecture,(leq(multiplication(star(esk2_0),star(esk1_0)),star(esk2_0))|~leq(star(esk2_0),star(esk2_0))),inference(spm,[status(thm)],[68777,19482,theory(equality)])).
% cnf(152232,negated_conjecture,(leq(multiplication(star(esk2_0),star(esk1_0)),star(esk2_0))|$false),inference(rw,[status(thm)],[152168,85,theory(equality)])).
% cnf(152233,negated_conjecture,(leq(multiplication(star(esk2_0),star(esk1_0)),star(esk2_0))),inference(cn,[status(thm)],[152232,theory(equality)])).
% cnf(152359,negated_conjecture,(leq(star(esk1_0),star(esk2_0))),inference(spm,[status(thm)],[43433,152233,theory(equality)])).
% cnf(152361,negated_conjecture,($false),inference(sr,[status(thm)],[152359,58,theory(equality)])).
% cnf(152362,negated_conjecture,($false),152361,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 5403
% # ...of these trivial : 1930
% # ...subsumed : 2294
% # ...remaining for further processing: 1179
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 11
% # Backward-rewritten : 151
% # Generated clauses : 89619
% # ...of the previous two non-trivial : 54843
% # Contextual simplify-reflections : 0
% # Paramodulations : 89618
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 1017
% # Positive orientable unit clauses: 773
% # Positive unorientable unit clauses: 7
% # Negative unit clauses : 2
% # Non-unit-clauses : 235
% # Current number of unprocessed clauses: 45388
% # ...number of literals in the above : 66085
% # Clause-clause subsumption calls (NU) : 20300
% # Rec. Clause-clause subsumption calls : 20300
% # Unit Clause-clause subsumption calls : 414
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5517
% # Indexed BW rewrite successes : 287
% # Backwards rewriting index: 688 leaves, 2.36+/-2.585 terms/leaf
% # Paramod-from index: 337 leaves, 2.33+/-2.744 terms/leaf
% # Paramod-into index: 614 leaves, 2.40+/-2.635 terms/leaf
% # -------------------------------------------------
% # User time : 2.047 s
% # System time : 0.086 s
% # Total time : 2.133 s
% # Maximum resident set size: 0 pages
% PrfWatch: 3.89 CPU 4.01 WC
% FINAL PrfWatch: 3.89 CPU 4.01 WC
% SZS output end Solution for /tmp/SystemOnTPTP30244/KLE041+1.tptp
%
%------------------------------------------------------------------------------