TSTP Solution File: KLE018+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE018+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 : art05.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:33:39 EST 2010
% Result : Theorem 7.20s
% Output : Solution 7.20s
% 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/SystemOnTPTP7531/KLE018+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7531/KLE018+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7531/KLE018+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 7627
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.91 CPU 2.01 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.90 CPU 4.01 WC
% PrfWatch: 5.90 CPU 6.02 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(2, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', right_distributivity)).
% fof(3, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(4, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(5, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(6, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(9, axiom,![X4]:![X5]:(test(X4)=>(c(X4)=X5<=>complement(X4,X5))),file('/tmp/SRASS.s.p', test_3)).
% fof(10, axiom,![X4]:(test(X4)<=>?[X5]:complement(X5,X4)),file('/tmp/SRASS.s.p', test_1)).
% fof(11, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(14, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(15, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(16, axiom,![X4]:![X5]:(complement(X5,X4)<=>((multiplication(X4,X5)=zero&multiplication(X5,X4)=zero)&addition(X4,X5)=one)),file('/tmp/SRASS.s.p', test_2)).
% fof(17, conjecture,![X4]:![X5]:![X6]:(((test(X4)&test(X5))&test(X6))=>(leq(multiplication(X4,c(X5)),X6)=>leq(X4,addition(X5,X6)))),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X4]:![X5]:![X6]:(((test(X4)&test(X5))&test(X6))=>(leq(multiplication(X4,c(X5)),X6)=>leq(X4,addition(X5,X6))))),inference(assume_negation,[status(cth)],[17])).
% fof(20, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(21, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[20])).
% cnf(22,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[21])).
% cnf(23,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[21])).
% fof(24, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[2])).
% cnf(25,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[3])).
% cnf(27,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[4])).
% cnf(29,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[5])).
% cnf(31,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[6])).
% cnf(33,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[32])).
% fof(39, plain,![X4]:![X5]:(~(test(X4))|((~(c(X4)=X5)|complement(X4,X5))&(~(complement(X4,X5))|c(X4)=X5))),inference(fof_nnf,[status(thm)],[9])).
% fof(40, plain,![X6]:![X7]:(~(test(X6))|((~(c(X6)=X7)|complement(X6,X7))&(~(complement(X6,X7))|c(X6)=X7))),inference(variable_rename,[status(thm)],[39])).
% fof(41, plain,![X6]:![X7]:(((~(c(X6)=X7)|complement(X6,X7))|~(test(X6)))&((~(complement(X6,X7))|c(X6)=X7)|~(test(X6)))),inference(distribute,[status(thm)],[40])).
% cnf(43,plain,(complement(X1,X2)|~test(X1)|c(X1)!=X2),inference(split_conjunct,[status(thm)],[41])).
% fof(44, plain,![X4]:((~(test(X4))|?[X5]:complement(X5,X4))&(![X5]:~(complement(X5,X4))|test(X4))),inference(fof_nnf,[status(thm)],[10])).
% fof(45, plain,![X6]:((~(test(X6))|?[X7]:complement(X7,X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(variable_rename,[status(thm)],[44])).
% fof(46, plain,![X6]:((~(test(X6))|complement(esk1_1(X6),X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(skolemize,[status(esa)],[45])).
% fof(47, plain,![X6]:![X8]:((~(complement(X8,X6))|test(X6))&(~(test(X6))|complement(esk1_1(X6),X6))),inference(shift_quantors,[status(thm)],[46])).
% cnf(48,plain,(complement(esk1_1(X1),X1)|~test(X1)),inference(split_conjunct,[status(thm)],[47])).
% cnf(49,plain,(test(X1)|~complement(X2,X1)),inference(split_conjunct,[status(thm)],[47])).
% fof(50, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[11])).
% cnf(51,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[50])).
% fof(56, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[14])).
% cnf(57,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[56])).
% fof(58, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[15])).
% cnf(59,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[58])).
% fof(60, plain,![X4]:![X5]:((~(complement(X5,X4))|((multiplication(X4,X5)=zero&multiplication(X5,X4)=zero)&addition(X4,X5)=one))&(((~(multiplication(X4,X5)=zero)|~(multiplication(X5,X4)=zero))|~(addition(X4,X5)=one))|complement(X5,X4))),inference(fof_nnf,[status(thm)],[16])).
% fof(61, plain,![X6]:![X7]:((~(complement(X7,X6))|((multiplication(X6,X7)=zero&multiplication(X7,X6)=zero)&addition(X6,X7)=one))&(((~(multiplication(X6,X7)=zero)|~(multiplication(X7,X6)=zero))|~(addition(X6,X7)=one))|complement(X7,X6))),inference(variable_rename,[status(thm)],[60])).
% fof(62, plain,![X6]:![X7]:((((multiplication(X6,X7)=zero|~(complement(X7,X6)))&(multiplication(X7,X6)=zero|~(complement(X7,X6))))&(addition(X6,X7)=one|~(complement(X7,X6))))&(((~(multiplication(X6,X7)=zero)|~(multiplication(X7,X6)=zero))|~(addition(X6,X7)=one))|complement(X7,X6))),inference(distribute,[status(thm)],[61])).
% cnf(64,plain,(addition(X2,X1)=one|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[62])).
% cnf(66,plain,(multiplication(X2,X1)=zero|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[62])).
% fof(67, negated_conjecture,?[X4]:?[X5]:?[X6]:(((test(X4)&test(X5))&test(X6))&(leq(multiplication(X4,c(X5)),X6)&~(leq(X4,addition(X5,X6))))),inference(fof_nnf,[status(thm)],[18])).
% fof(68, negated_conjecture,?[X7]:?[X8]:?[X9]:(((test(X7)&test(X8))&test(X9))&(leq(multiplication(X7,c(X8)),X9)&~(leq(X7,addition(X8,X9))))),inference(variable_rename,[status(thm)],[67])).
% fof(69, negated_conjecture,(((test(esk2_0)&test(esk3_0))&test(esk4_0))&(leq(multiplication(esk2_0,c(esk3_0)),esk4_0)&~(leq(esk2_0,addition(esk3_0,esk4_0))))),inference(skolemize,[status(esa)],[68])).
% cnf(70,negated_conjecture,(~leq(esk2_0,addition(esk3_0,esk4_0))),inference(split_conjunct,[status(thm)],[69])).
% cnf(71,negated_conjecture,(leq(multiplication(esk2_0,c(esk3_0)),esk4_0)),inference(split_conjunct,[status(thm)],[69])).
% cnf(73,negated_conjecture,(test(esk3_0)),inference(split_conjunct,[status(thm)],[69])).
% cnf(74,negated_conjecture,(test(esk2_0)),inference(split_conjunct,[status(thm)],[69])).
% cnf(78,negated_conjecture,(complement(esk1_1(esk3_0),esk3_0)),inference(spm,[status(thm)],[48,73,theory(equality)])).
% cnf(79,negated_conjecture,(complement(esk1_1(esk2_0),esk2_0)),inference(spm,[status(thm)],[48,74,theory(equality)])).
% cnf(80,plain,(complement(X1,c(X1))|~test(X1)),inference(er,[status(thm)],[43,theory(equality)])).
% cnf(82,negated_conjecture,(addition(multiplication(esk2_0,c(esk3_0)),esk4_0)=esk4_0),inference(spm,[status(thm)],[23,71,theory(equality)])).
% cnf(91,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[31,33,theory(equality)])).
% cnf(134,plain,(addition(multiplication(X1,X2),X1)=multiplication(X1,addition(X2,one))),inference(spm,[status(thm)],[25,57,theory(equality)])).
% cnf(164,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[27,59,theory(equality)])).
% cnf(210,negated_conjecture,(addition(esk3_0,esk1_1(esk3_0))=one),inference(spm,[status(thm)],[64,78,theory(equality)])).
% cnf(216,negated_conjecture,(addition(esk2_0,esk1_1(esk2_0))=one),inference(spm,[status(thm)],[64,79,theory(equality)])).
% cnf(250,negated_conjecture,(complement(esk3_0,c(esk3_0))),inference(spm,[status(thm)],[80,73,theory(equality)])).
% cnf(293,negated_conjecture,(addition(esk4_0,multiplication(esk2_0,c(esk3_0)))=esk4_0),inference(rw,[status(thm)],[82,29,theory(equality)])).
% cnf(295,negated_conjecture,(addition(esk4_0,X1)=addition(esk4_0,addition(multiplication(esk2_0,c(esk3_0)),X1))),inference(spm,[status(thm)],[31,293,theory(equality)])).
% cnf(313,negated_conjecture,(test(c(esk3_0))),inference(spm,[status(thm)],[49,250,theory(equality)])).
% cnf(314,negated_conjecture,(addition(c(esk3_0),esk3_0)=one),inference(spm,[status(thm)],[64,250,theory(equality)])).
% cnf(315,negated_conjecture,(multiplication(c(esk3_0),esk3_0)=zero),inference(spm,[status(thm)],[66,250,theory(equality)])).
% cnf(319,negated_conjecture,(complement(esk1_1(c(esk3_0)),c(esk3_0))),inference(spm,[status(thm)],[48,313,theory(equality)])).
% cnf(472,negated_conjecture,(addition(esk3_0,c(esk3_0))=one),inference(rw,[status(thm)],[314,29,theory(equality)])).
% cnf(487,negated_conjecture,(addition(multiplication(X1,esk3_0),zero)=multiplication(addition(X1,c(esk3_0)),esk3_0)),inference(spm,[status(thm)],[27,315,theory(equality)])).
% cnf(493,negated_conjecture,(multiplication(X1,esk3_0)=multiplication(addition(X1,c(esk3_0)),esk3_0)),inference(rw,[status(thm)],[487,51,theory(equality)])).
% cnf(527,negated_conjecture,(addition(esk3_0,one)=one),inference(spm,[status(thm)],[91,210,theory(equality)])).
% cnf(529,negated_conjecture,(addition(esk2_0,one)=one),inference(spm,[status(thm)],[91,216,theory(equality)])).
% cnf(564,negated_conjecture,(addition(one,esk3_0)=one),inference(rw,[status(thm)],[527,29,theory(equality)])).
% cnf(577,negated_conjecture,(addition(one,esk2_0)=one),inference(rw,[status(thm)],[529,29,theory(equality)])).
% cnf(579,negated_conjecture,(addition(one,X1)=addition(one,addition(esk2_0,X1))),inference(spm,[status(thm)],[31,577,theory(equality)])).
% cnf(847,negated_conjecture,(addition(c(esk3_0),esk1_1(c(esk3_0)))=one),inference(spm,[status(thm)],[64,319,theory(equality)])).
% cnf(1361,negated_conjecture,(addition(c(esk3_0),one)=one),inference(spm,[status(thm)],[91,847,theory(equality)])).
% cnf(1373,negated_conjecture,(addition(one,c(esk3_0))=one),inference(rw,[status(thm)],[1361,29,theory(equality)])).
% cnf(1863,plain,(addition(X1,multiplication(X1,X2))=multiplication(X1,addition(X2,one))),inference(rw,[status(thm)],[134,29,theory(equality)])).
% cnf(2187,negated_conjecture,(addition(one,multiplication(esk2_0,addition(X1,one)))=addition(one,multiplication(esk2_0,X1))),inference(spm,[status(thm)],[579,1863,theory(equality)])).
% cnf(2820,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[164,29,theory(equality)])).
% cnf(6934,negated_conjecture,(addition(esk4_0,multiplication(esk2_0,addition(c(esk3_0),X1)))=addition(esk4_0,multiplication(esk2_0,X1))),inference(spm,[status(thm)],[295,25,theory(equality)])).
% cnf(8966,negated_conjecture,(multiplication(one,esk3_0)=multiplication(esk3_0,esk3_0)),inference(spm,[status(thm)],[493,472,theory(equality)])).
% cnf(8992,negated_conjecture,(esk3_0=multiplication(esk3_0,esk3_0)),inference(rw,[status(thm)],[8966,59,theory(equality)])).
% cnf(9190,negated_conjecture,(addition(multiplication(esk3_0,X1),esk3_0)=multiplication(esk3_0,addition(X1,esk3_0))),inference(spm,[status(thm)],[25,8992,theory(equality)])).
% cnf(9495,negated_conjecture,(multiplication(esk3_0,addition(X1,one))=multiplication(esk3_0,addition(X1,esk3_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[9190,29,theory(equality)]),1863,theory(equality)])).
% cnf(9496,negated_conjecture,(addition(addition(X1,esk3_0),multiplication(esk3_0,addition(X1,one)))=multiplication(addition(esk3_0,one),addition(X1,esk3_0))),inference(spm,[status(thm)],[2820,9495,theory(equality)])).
% cnf(9525,negated_conjecture,(addition(X1,multiplication(esk3_0,addition(X1,one)))=multiplication(addition(esk3_0,one),addition(X1,esk3_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[9496,31,theory(equality)]),1863,theory(equality)]),31,theory(equality)]),33,theory(equality)])).
% cnf(9526,negated_conjecture,(addition(X1,multiplication(esk3_0,addition(X1,one)))=addition(X1,esk3_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[9525,29,theory(equality)]),564,theory(equality)]),59,theory(equality)])).
% cnf(18064,negated_conjecture,(addition(one,multiplication(esk2_0,addition(one,X1)))=addition(one,multiplication(esk2_0,X1))),inference(spm,[status(thm)],[2187,29,theory(equality)])).
% cnf(29680,negated_conjecture,(addition(one,multiplication(esk2_0,one))=addition(one,multiplication(esk2_0,esk3_0))),inference(spm,[status(thm)],[18064,564,theory(equality)])).
% cnf(29790,negated_conjecture,(one=addition(one,multiplication(esk2_0,esk3_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[29680,57,theory(equality)]),577,theory(equality)])).
% cnf(209954,negated_conjecture,(addition(esk4_0,multiplication(esk2_0,addition(c(esk3_0),esk3_0)))=addition(esk4_0,multiplication(esk2_0,multiplication(esk3_0,addition(c(esk3_0),one))))),inference(spm,[status(thm)],[6934,9526,theory(equality)])).
% cnf(210536,negated_conjecture,(addition(esk2_0,esk4_0)=addition(esk4_0,multiplication(esk2_0,multiplication(esk3_0,addition(c(esk3_0),one))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[209954,29,theory(equality)]),472,theory(equality)]),57,theory(equality)]),29,theory(equality)])).
% cnf(210537,negated_conjecture,(addition(esk2_0,esk4_0)=addition(esk4_0,multiplication(esk2_0,esk3_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[210536,29,theory(equality)]),1373,theory(equality)]),57,theory(equality)])).
% cnf(212959,negated_conjecture,(addition(addition(esk2_0,esk4_0),X1)=addition(esk4_0,addition(multiplication(esk2_0,esk3_0),X1))),inference(spm,[status(thm)],[31,210537,theory(equality)])).
% cnf(213146,negated_conjecture,(addition(esk2_0,addition(esk4_0,X1))=addition(esk4_0,addition(multiplication(esk2_0,esk3_0),X1))),inference(rw,[status(thm)],[212959,31,theory(equality)])).
% cnf(215851,negated_conjecture,(addition(esk4_0,addition(multiplication(esk2_0,esk3_0),esk3_0))=addition(esk2_0,addition(esk4_0,multiplication(esk3_0,addition(multiplication(esk2_0,esk3_0),one))))),inference(spm,[status(thm)],[213146,9526,theory(equality)])).
% cnf(216113,negated_conjecture,(addition(esk3_0,esk4_0)=addition(esk2_0,addition(esk4_0,multiplication(esk3_0,addition(multiplication(esk2_0,esk3_0),one))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[215851,29,theory(equality)]),2820,theory(equality)]),29,theory(equality)]),577,theory(equality)]),59,theory(equality)]),29,theory(equality)])).
% cnf(216114,negated_conjecture,(addition(esk3_0,esk4_0)=addition(esk2_0,addition(esk3_0,esk4_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[216113,29,theory(equality)]),29790,theory(equality)]),57,theory(equality)]),29,theory(equality)])).
% cnf(217224,negated_conjecture,(leq(esk2_0,addition(esk3_0,esk4_0))),inference(spm,[status(thm)],[22,216114,theory(equality)])).
% cnf(217446,negated_conjecture,($false),inference(sr,[status(thm)],[217224,70,theory(equality)])).
% cnf(217447,negated_conjecture,($false),217446,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 9053
% # ...of these trivial : 1929
% # ...subsumed : 5641
% # ...remaining for further processing: 1483
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 174
% # Generated clauses : 114208
% # ...of the previous two non-trivial : 86263
% # Contextual simplify-reflections : 54
% # Paramodulations : 114200
% # Factorizations : 0
% # Equation resolutions : 8
% # Current number of processed clauses: 1307
% # Positive orientable unit clauses: 947
% # Positive unorientable unit clauses: 17
% # Negative unit clauses : 1
% # Non-unit-clauses : 342
% # Current number of unprocessed clauses: 73484
% # ...number of literals in the above : 118403
% # Clause-clause subsumption calls (NU) : 27180
% # Rec. Clause-clause subsumption calls : 27120
% # Unit Clause-clause subsumption calls : 223
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6907
% # Indexed BW rewrite successes : 174
% # Backwards rewriting index: 1004 leaves, 1.99+/-3.377 terms/leaf
% # Paramod-from index: 466 leaves, 2.10+/-4.289 terms/leaf
% # Paramod-into index: 796 leaves, 2.05+/-3.600 terms/leaf
% # -------------------------------------------------
% # User time : 3.387 s
% # System time : 0.130 s
% # Total time : 3.517 s
% # Maximum resident set size: 0 pages
% PrfWatch: 6.37 CPU 6.51 WC
% FINAL PrfWatch: 6.37 CPU 6.51 WC
% SZS output end Solution for /tmp/SystemOnTPTP7531/KLE018+1.tptp
%
%------------------------------------------------------------------------------