TSTP Solution File: KLE144+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE144+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Wed Dec 29 08:12:54 EST 2010
% Result : Theorem 1.50s
% Output : Solution 1.50s
% 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/SystemOnTPTP17290/KLE144+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17290/KLE144+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17290/KLE144+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 17386
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(3, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(4, axiom,![X1]:addition(one,multiplication(X1,star(X1)))=star(X1),file('/tmp/SRASS.s.p', star_unfold1)).
% fof(5, axiom,![X1]:addition(one,multiplication(star(X1),X1))=star(X1),file('/tmp/SRASS.s.p', star_unfold2)).
% fof(6, axiom,![X1]:strong_iteration(X1)=addition(star(X1),multiplication(strong_iteration(X1),zero)),file('/tmp/SRASS.s.p', isolation)).
% fof(7, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(8, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(9, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(10, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', 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', distributivity1)).
% fof(13, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', distributivity2)).
% fof(14, axiom,![X1]:multiplication(zero,X1)=zero,file('/tmp/SRASS.s.p', left_annihilation)).
% fof(15, axiom,![X1]:![X2]:![X3]:(leq(X3,addition(multiplication(X1,X3),X2))=>leq(X3,multiplication(strong_iteration(X1),X2))),file('/tmp/SRASS.s.p', infty_coinduction)).
% fof(17, axiom,![X1]:![X2]:![X3]:(leq(addition(multiplication(X3,X1),X2),X3)=>leq(multiplication(X2,star(X1)),X3)),file('/tmp/SRASS.s.p', star_induction2)).
% fof(18, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(19, conjecture,![X4]:strong_iteration(star(X4))=strong_iteration(one),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X4]:strong_iteration(star(X4))=strong_iteration(one)),inference(assume_negation,[status(cth)],[19])).
% fof(23, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[2])).
% cnf(24,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(26,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X2]:addition(one,multiplication(X2,star(X2)))=star(X2),inference(variable_rename,[status(thm)],[4])).
% cnf(28,plain,(addition(one,multiplication(X1,star(X1)))=star(X1)),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X2]:addition(one,multiplication(star(X2),X2))=star(X2),inference(variable_rename,[status(thm)],[5])).
% cnf(30,plain,(addition(one,multiplication(star(X1),X1))=star(X1)),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X2]:strong_iteration(X2)=addition(star(X2),multiplication(strong_iteration(X2),zero)),inference(variable_rename,[status(thm)],[6])).
% cnf(32,plain,(strong_iteration(X1)=addition(star(X1),multiplication(strong_iteration(X1),zero))),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[7])).
% cnf(34,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[8])).
% cnf(36,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[9])).
% cnf(38,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[37])).
% fof(39, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[10])).
% cnf(40,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X4]:![X5]:![X6]:multiplication(X4,multiplication(X5,X6))=multiplication(multiplication(X4,X5),X6),inference(variable_rename,[status(thm)],[11])).
% cnf(42,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[41])).
% fof(43, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[12])).
% cnf(44,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[13])).
% cnf(46,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X2]:multiplication(zero,X2)=zero,inference(variable_rename,[status(thm)],[14])).
% cnf(48,plain,(multiplication(zero,X1)=zero),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X1]:![X2]:![X3]:(~(leq(X3,addition(multiplication(X1,X3),X2)))|leq(X3,multiplication(strong_iteration(X1),X2))),inference(fof_nnf,[status(thm)],[15])).
% fof(50, plain,![X4]:![X5]:![X6]:(~(leq(X6,addition(multiplication(X4,X6),X5)))|leq(X6,multiplication(strong_iteration(X4),X5))),inference(variable_rename,[status(thm)],[49])).
% cnf(51,plain,(leq(X1,multiplication(strong_iteration(X2),X3))|~leq(X1,addition(multiplication(X2,X1),X3))),inference(split_conjunct,[status(thm)],[50])).
% fof(55, plain,![X1]:![X2]:![X3]:(~(leq(addition(multiplication(X3,X1),X2),X3))|leq(multiplication(X2,star(X1)),X3)),inference(fof_nnf,[status(thm)],[17])).
% fof(56, plain,![X4]:![X5]:![X6]:(~(leq(addition(multiplication(X6,X4),X5),X6))|leq(multiplication(X5,star(X4)),X6)),inference(variable_rename,[status(thm)],[55])).
% cnf(57,plain,(leq(multiplication(X1,star(X2)),X3)|~leq(addition(multiplication(X3,X2),X1),X3)),inference(split_conjunct,[status(thm)],[56])).
% fof(58, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[18])).
% fof(59, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[58])).
% cnf(60,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[59])).
% cnf(61,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[59])).
% fof(62, negated_conjecture,?[X4]:~(strong_iteration(star(X4))=strong_iteration(one)),inference(fof_nnf,[status(thm)],[20])).
% fof(63, negated_conjecture,?[X5]:~(strong_iteration(star(X5))=strong_iteration(one)),inference(variable_rename,[status(thm)],[62])).
% fof(64, negated_conjecture,~(strong_iteration(star(esk1_0))=strong_iteration(one)),inference(skolemize,[status(esa)],[63])).
% cnf(65,negated_conjecture,(strong_iteration(star(esk1_0))!=strong_iteration(one)),inference(split_conjunct,[status(thm)],[64])).
% cnf(66,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[38,34,theory(equality)])).
% cnf(84,plain,(leq(X1,X1)),inference(spm,[status(thm)],[60,40,theory(equality)])).
% cnf(89,plain,(leq(multiplication(X1,star(one)),X2)|~leq(addition(X2,X1),X2)),inference(spm,[status(thm)],[57,24,theory(equality)])).
% cnf(91,plain,(leq(multiplication(multiplication(X1,X2),star(X2)),X1)|~leq(multiplication(X1,X2),X1)),inference(spm,[status(thm)],[57,40,theory(equality)])).
% cnf(128,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[36,40,theory(equality)])).
% cnf(137,plain,(leq(X1,multiplication(strong_iteration(one),X2))|~leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[51,26,theory(equality)])).
% cnf(142,plain,(leq(X1,multiplication(strong_iteration(X2),X3))|~leq(X1,addition(X3,multiplication(X2,X1)))),inference(spm,[status(thm)],[51,34,theory(equality)])).
% cnf(157,plain,(addition(multiplication(X1,X2),X1)=multiplication(X1,addition(X2,one))),inference(spm,[status(thm)],[44,24,theory(equality)])).
% cnf(188,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[46,26,theory(equality)])).
% cnf(244,plain,(leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[60,128,theory(equality)])).
% cnf(251,plain,(addition(one,star(X1))=star(X1)),inference(spm,[status(thm)],[128,30,theory(equality)])).
% cnf(288,plain,(leq(X1,addition(X2,X1))),inference(spm,[status(thm)],[244,34,theory(equality)])).
% cnf(384,plain,(leq(X1,addition(X2,addition(X3,X1)))),inference(spm,[status(thm)],[288,36,theory(equality)])).
% cnf(506,plain,(addition(X1,multiplication(X1,X2))=multiplication(X1,addition(X2,one))),inference(rw,[status(thm)],[157,34,theory(equality)])).
% cnf(518,plain,(leq(X1,multiplication(X1,addition(X2,one)))),inference(spm,[status(thm)],[244,506,theory(equality)])).
% cnf(584,plain,(leq(X1,addition(X2,addition(X1,X3)))),inference(spm,[status(thm)],[384,34,theory(equality)])).
% cnf(671,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[188,34,theory(equality)])).
% cnf(682,plain,(leq(X1,multiplication(addition(X2,one),X1))),inference(spm,[status(thm)],[244,671,theory(equality)])).
% cnf(690,plain,(multiplication(addition(X1,one),X1)=multiplication(X1,addition(X1,one))),inference(spm,[status(thm)],[506,671,theory(equality)])).
% cnf(793,plain,(leq(X1,multiplication(X1,addition(one,X2)))),inference(spm,[status(thm)],[518,34,theory(equality)])).
% cnf(809,plain,(leq(one,addition(X1,star(X2)))),inference(spm,[status(thm)],[584,251,theory(equality)])).
% cnf(845,plain,(leq(one,multiplication(strong_iteration(X1),star(X2)))),inference(spm,[status(thm)],[51,809,theory(equality)])).
% cnf(851,plain,(leq(one,addition(star(X2),X1))),inference(spm,[status(thm)],[809,34,theory(equality)])).
% cnf(919,plain,(multiplication(addition(one,X1),X1)=multiplication(X1,addition(one,X1))),inference(spm,[status(thm)],[690,34,theory(equality)])).
% cnf(1031,plain,(leq(one,multiplication(star(X1),addition(X2,one)))),inference(spm,[status(thm)],[851,506,theory(equality)])).
% cnf(1076,plain,(leq(X1,multiplication(addition(one,X2),X1))),inference(spm,[status(thm)],[682,34,theory(equality)])).
% cnf(1310,plain,(leq(X1,multiplication(X1,star(X2)))),inference(spm,[status(thm)],[793,251,theory(equality)])).
% cnf(1382,plain,(addition(one,multiplication(strong_iteration(X1),star(X2)))=multiplication(strong_iteration(X1),star(X2))),inference(spm,[status(thm)],[61,845,theory(equality)])).
% cnf(1575,plain,(leq(multiplication(X1,star(one)),X1)|~leq(X1,X1)),inference(spm,[status(thm)],[89,40,theory(equality)])).
% cnf(1589,plain,(leq(multiplication(X1,star(one)),X1)|$false),inference(rw,[status(thm)],[1575,84,theory(equality)])).
% cnf(1590,plain,(leq(multiplication(X1,star(one)),X1)),inference(cn,[status(thm)],[1589,theory(equality)])).
% cnf(1596,plain,(leq(star(one),one)),inference(spm,[status(thm)],[1590,26,theory(equality)])).
% cnf(1602,plain,(addition(star(one),one)=one),inference(spm,[status(thm)],[61,1596,theory(equality)])).
% cnf(1603,plain,(star(one)=one),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1602,34,theory(equality)]),251,theory(equality)])).
% cnf(1606,plain,(addition(one,multiplication(strong_iteration(one),zero))=strong_iteration(one)),inference(spm,[status(thm)],[32,1603,theory(equality)])).
% cnf(1758,plain,(leq(X1,multiplication(star(X2),X1))),inference(spm,[status(thm)],[1076,251,theory(equality)])).
% cnf(1931,plain,(addition(strong_iteration(one),X1)=addition(one,addition(multiplication(strong_iteration(one),zero),X1))),inference(spm,[status(thm)],[36,1606,theory(equality)])).
% cnf(1954,plain,(multiplication(strong_iteration(one),multiplication(strong_iteration(one),zero))=multiplication(multiplication(strong_iteration(one),zero),strong_iteration(one))),inference(spm,[status(thm)],[919,1606,theory(equality)])).
% cnf(1963,plain,(multiplication(strong_iteration(one),multiplication(strong_iteration(one),zero))=multiplication(strong_iteration(one),zero)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1954,42,theory(equality)]),48,theory(equality)])).
% cnf(1988,plain,(leq(multiplication(X1,multiplication(X2,star(X2))),X1)|~leq(multiplication(X1,X2),X1)),inference(rw,[status(thm)],[91,42,theory(equality)])).
% cnf(2408,plain,(leq(one,multiplication(star(X1),addition(one,X2)))),inference(spm,[status(thm)],[1031,34,theory(equality)])).
% cnf(3314,plain,(multiplication(strong_iteration(X1),star(strong_iteration(X1)))=star(strong_iteration(X1))),inference(spm,[status(thm)],[28,1382,theory(equality)])).
% cnf(3360,plain,(leq(one,multiplication(star(X1),star(X2)))),inference(spm,[status(thm)],[2408,251,theory(equality)])).
% cnf(3454,plain,(leq(strong_iteration(X1),star(strong_iteration(X1)))),inference(spm,[status(thm)],[1310,3314,theory(equality)])).
% cnf(3480,plain,(addition(strong_iteration(X1),star(strong_iteration(X1)))=star(strong_iteration(X1))),inference(spm,[status(thm)],[61,3454,theory(equality)])).
% cnf(3614,plain,(addition(one,multiplication(star(X1),star(X2)))=multiplication(star(X1),star(X2))),inference(spm,[status(thm)],[61,3360,theory(equality)])).
% cnf(4472,plain,(addition(one,multiplication(strong_iteration(one),addition(zero,X1)))=addition(strong_iteration(one),multiplication(strong_iteration(one),X1))),inference(spm,[status(thm)],[1931,44,theory(equality)])).
% cnf(4507,plain,(addition(one,multiplication(strong_iteration(one),X1))=addition(strong_iteration(one),multiplication(strong_iteration(one),X1))),inference(rw,[status(thm)],[4472,66,theory(equality)])).
% cnf(4508,plain,(addition(one,multiplication(strong_iteration(one),X1))=multiplication(strong_iteration(one),addition(X1,one))),inference(rw,[status(thm)],[4507,506,theory(equality)])).
% cnf(4560,plain,(addition(one,multiplication(strong_iteration(one),zero))=multiplication(strong_iteration(one),addition(multiplication(strong_iteration(one),zero),one))),inference(spm,[status(thm)],[4508,1963,theory(equality)])).
% cnf(4592,plain,(strong_iteration(one)=multiplication(strong_iteration(one),addition(multiplication(strong_iteration(one),zero),one))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[4560,4508,theory(equality)]),66,theory(equality)]),24,theory(equality)])).
% cnf(4593,plain,(strong_iteration(one)=multiplication(strong_iteration(one),strong_iteration(one))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[4592,34,theory(equality)]),4508,theory(equality)]),66,theory(equality)]),24,theory(equality)])).
% cnf(4598,plain,(leq(multiplication(strong_iteration(one),multiplication(strong_iteration(one),star(strong_iteration(one)))),strong_iteration(one))|~leq(strong_iteration(one),strong_iteration(one))),inference(spm,[status(thm)],[1988,4593,theory(equality)])).
% cnf(4617,plain,(leq(star(strong_iteration(one)),strong_iteration(one))|~leq(strong_iteration(one),strong_iteration(one))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[4598,3314,theory(equality)]),3314,theory(equality)])).
% cnf(4618,plain,(leq(star(strong_iteration(one)),strong_iteration(one))|$false),inference(rw,[status(thm)],[4617,84,theory(equality)])).
% cnf(4619,plain,(leq(star(strong_iteration(one)),strong_iteration(one))),inference(cn,[status(thm)],[4618,theory(equality)])).
% cnf(4638,plain,(addition(star(strong_iteration(one)),strong_iteration(one))=strong_iteration(one)),inference(spm,[status(thm)],[61,4619,theory(equality)])).
% cnf(4694,plain,(star(strong_iteration(one))=strong_iteration(one)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[4638,34,theory(equality)]),3480,theory(equality)])).
% cnf(13394,plain,(leq(X1,multiplication(strong_iteration(one),X2))|$false),inference(rw,[status(thm)],[137,244,theory(equality)])).
% cnf(13395,plain,(leq(X1,multiplication(strong_iteration(one),X2))),inference(cn,[status(thm)],[13394,theory(equality)])).
% cnf(13414,plain,(leq(X1,strong_iteration(one))),inference(spm,[status(thm)],[13395,24,theory(equality)])).
% cnf(13461,plain,(addition(X1,strong_iteration(one))=strong_iteration(one)),inference(spm,[status(thm)],[61,13414,theory(equality)])).
% cnf(13562,plain,(strong_iteration(one)=addition(strong_iteration(one),X1)),inference(spm,[status(thm)],[34,13461,theory(equality)])).
% cnf(18181,plain,(leq(star(X1),multiplication(strong_iteration(star(X2)),one))|~leq(star(X1),multiplication(star(X2),star(X1)))),inference(spm,[status(thm)],[142,3614,theory(equality)])).
% cnf(18284,plain,(leq(star(X1),strong_iteration(star(X2)))|~leq(star(X1),multiplication(star(X2),star(X1)))),inference(rw,[status(thm)],[18181,24,theory(equality)])).
% cnf(18285,plain,(leq(star(X1),strong_iteration(star(X2)))|$false),inference(rw,[status(thm)],[18284,1758,theory(equality)])).
% cnf(18286,plain,(leq(star(X1),strong_iteration(star(X2)))),inference(cn,[status(thm)],[18285,theory(equality)])).
% cnf(18580,plain,(addition(star(X1),strong_iteration(star(X2)))=strong_iteration(star(X2))),inference(spm,[status(thm)],[61,18286,theory(equality)])).
% cnf(19651,plain,(addition(strong_iteration(one),strong_iteration(star(X1)))=strong_iteration(star(X1))),inference(spm,[status(thm)],[18580,4694,theory(equality)])).
% cnf(19693,plain,(strong_iteration(one)=strong_iteration(star(X1))),inference(rw,[status(thm)],[19651,13562,theory(equality)])).
% cnf(19867,negated_conjecture,($false),inference(rw,[status(thm)],[65,19693,theory(equality)])).
% cnf(19868,negated_conjecture,($false),inference(cn,[status(thm)],[19867,theory(equality)])).
% cnf(19869,negated_conjecture,($false),19868,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 984
% # ...of these trivial : 226
% # ...subsumed : 341
% # ...remaining for further processing: 417
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 115
% # Generated clauses : 10955
% # ...of the previous two non-trivial : 5592
% # Contextual simplify-reflections : 0
% # Paramodulations : 10953
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 300
% # Positive orientable unit clauses: 212
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 0
% # Non-unit-clauses : 85
% # Current number of unprocessed clauses: 3331
% # ...number of literals in the above : 4885
% # Clause-clause subsumption calls (NU) : 1504
% # Rec. Clause-clause subsumption calls : 1504
% # Unit Clause-clause subsumption calls : 80
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 905
% # Indexed BW rewrite successes : 157
% # Backwards rewriting index: 270 leaves, 1.73+/-1.368 terms/leaf
% # Paramod-from index: 143 leaves, 1.52+/-1.267 terms/leaf
% # Paramod-into index: 231 leaves, 1.75+/-1.397 terms/leaf
% # -------------------------------------------------
% # User time : 0.239 s
% # System time : 0.012 s
% # Total time : 0.251 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.56 CPU 0.85 WC
% FINAL PrfWatch: 0.56 CPU 0.85 WC
% SZS output end Solution for /tmp/SystemOnTPTP17290/KLE144+1.tptp
%
%------------------------------------------------------------------------------