TSTP Solution File: KLE060+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : KLE060+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 : art09.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:51:37 EST 2010

% Result   : Theorem 36.03s
% Output   : Solution 36.03s
% 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/SystemOnTPTP5838/KLE060+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP5838/KLE060+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5838/KLE060+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 5934
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.92 CPU 2.01 WC
% PrfWatch: 3.90 CPU 4.02 WC
% PrfWatch: 5.90 CPU 6.02 WC
% PrfWatch: 7.89 CPU 8.03 WC
% PrfWatch: 9.87 CPU 10.03 WC
% PrfWatch: 11.54 CPU 12.04 WC
% PrfWatch: 13.11 CPU 14.04 WC
% PrfWatch: 15.10 CPU 16.05 WC
% PrfWatch: 17.09 CPU 18.05 WC
% PrfWatch: 19.07 CPU 20.06 WC
% # Preprocessing time     : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 21.06 CPU 22.06 WC
% PrfWatch: 23.05 CPU 24.07 WC
% PrfWatch: 25.04 CPU 26.07 WC
% PrfWatch: 27.04 CPU 28.08 WC
% PrfWatch: 29.03 CPU 30.08 WC
% PrfWatch: 31.01 CPU 32.09 WC
% PrfWatch: 33.00 CPU 34.09 WC
% PrfWatch: 34.62 CPU 36.10 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(2, axiom,![X4]:![X5]:domain(multiplication(X4,X5))=domain(multiplication(X4,domain(X5))),file('/tmp/SRASS.s.p', domain2)).
% fof(3, axiom,![X4]:addition(X4,multiplication(domain(X4),X4))=multiplication(domain(X4),X4),file('/tmp/SRASS.s.p', domain1)).
% fof(4, axiom,![X4]:![X5]:domain(addition(X4,X5))=addition(domain(X4),domain(X5)),file('/tmp/SRASS.s.p', domain5)).
% fof(5, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', right_distributivity)).
% fof(6, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', left_distributivity)).
% 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,X1)=X1,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(13, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(14, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(16, axiom,![X4]:addition(domain(X4),one)=one,file('/tmp/SRASS.s.p', domain3)).
% fof(17, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(18, conjecture,![X4]:![X5]:domain(multiplication(domain(X4),X5))=multiplication(domain(X4),domain(X5)),file('/tmp/SRASS.s.p', goals)).
% fof(19, negated_conjecture,~(![X4]:![X5]:domain(multiplication(domain(X4),X5))=multiplication(domain(X4),domain(X5))),inference(assume_negation,[status(cth)],[18])).
% fof(20, plain,![X4]:![X5]:![X6]:multiplication(X4,multiplication(X5,X6))=multiplication(multiplication(X4,X5),X6),inference(variable_rename,[status(thm)],[1])).
% cnf(21,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X6]:![X7]:domain(multiplication(X6,X7))=domain(multiplication(X6,domain(X7))),inference(variable_rename,[status(thm)],[2])).
% cnf(23,plain,(domain(multiplication(X1,X2))=domain(multiplication(X1,domain(X2)))),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X5]:addition(X5,multiplication(domain(X5),X5))=multiplication(domain(X5),X5),inference(variable_rename,[status(thm)],[3])).
% cnf(25,plain,(addition(X1,multiplication(domain(X1),X1))=multiplication(domain(X1),X1)),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X6]:![X7]:domain(addition(X6,X7))=addition(domain(X6),domain(X7)),inference(variable_rename,[status(thm)],[4])).
% cnf(27,plain,(domain(addition(X1,X2))=addition(domain(X1),domain(X2))),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[5])).
% cnf(29,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[6])).
% cnf(31,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[7])).
% cnf(33,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[8])).
% cnf(35,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[9])).
% cnf(37,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[36])).
% fof(43, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[13])).
% cnf(44,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[14])).
% cnf(46,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[45])).
% fof(49, plain,![X5]:addition(domain(X5),one)=one,inference(variable_rename,[status(thm)],[16])).
% cnf(50,plain,(addition(domain(X1),one)=one),inference(split_conjunct,[status(thm)],[49])).
% fof(51, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[17])).
% fof(52, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[51])).
% cnf(53,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[52])).
% cnf(54,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[52])).
% fof(55, negated_conjecture,?[X4]:?[X5]:~(domain(multiplication(domain(X4),X5))=multiplication(domain(X4),domain(X5))),inference(fof_nnf,[status(thm)],[19])).
% fof(56, negated_conjecture,?[X6]:?[X7]:~(domain(multiplication(domain(X6),X7))=multiplication(domain(X6),domain(X7))),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,~(domain(multiplication(domain(esk1_0),esk2_0))=multiplication(domain(esk1_0),domain(esk2_0))),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(domain(multiplication(domain(esk1_0),esk2_0))!=multiplication(domain(esk1_0),domain(esk2_0))),inference(split_conjunct,[status(thm)],[57])).
% cnf(64,plain,(addition(one,domain(X1))=one),inference(rw,[status(thm)],[50,33,theory(equality)])).
% cnf(95,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[35,37,theory(equality)])).
% cnf(118,plain,(domain(domain(X1))=domain(multiplication(one,X1))),inference(spm,[status(thm)],[23,46,theory(equality)])).
% cnf(124,plain,(domain(domain(X1))=domain(X1)),inference(rw,[status(thm)],[118,46,theory(equality)])).
% cnf(133,plain,(addition(one,domain(one))=domain(one)),inference(spm,[status(thm)],[25,44,theory(equality)])).
% cnf(146,plain,(addition(multiplication(X1,X2),X1)=multiplication(X1,addition(X2,one))),inference(spm,[status(thm)],[29,44,theory(equality)])).
% cnf(176,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[31,46,theory(equality)])).
% cnf(183,plain,(addition(multiplication(X1,multiplication(X2,X3)),multiplication(X4,X3))=multiplication(addition(multiplication(X1,X2),X4),X3)),inference(spm,[status(thm)],[31,21,theory(equality)])).
% cnf(230,plain,(one=domain(one)),inference(rw,[status(thm)],[133,64,theory(equality)])).
% cnf(243,plain,(addition(domain(X1),one)=domain(addition(X1,one))),inference(spm,[status(thm)],[27,230,theory(equality)])).
% cnf(249,plain,(one=domain(addition(X1,one))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[243,33,theory(equality)]),64,theory(equality)])).
% cnf(279,plain,(domain(multiplication(X1,one))=domain(multiplication(X1,addition(X2,one)))),inference(spm,[status(thm)],[23,249,theory(equality)])).
% cnf(292,plain,(domain(X1)=domain(multiplication(X1,addition(X2,one)))),inference(rw,[status(thm)],[279,44,theory(equality)])).
% cnf(523,plain,(leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[53,95,theory(equality)])).
% cnf(542,plain,(addition(X1,addition(X2,X1))=addition(X2,X1)),inference(spm,[status(thm)],[95,33,theory(equality)])).
% cnf(579,plain,(leq(X1,addition(X2,X1))),inference(spm,[status(thm)],[523,33,theory(equality)])).
% cnf(593,plain,(leq(domain(X1),domain(addition(X2,X1)))),inference(spm,[status(thm)],[579,27,theory(equality)])).
% cnf(753,plain,(addition(X1,multiplication(X1,X2))=multiplication(X1,addition(X2,one))),inference(rw,[status(thm)],[146,33,theory(equality)])).
% cnf(946,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[176,33,theory(equality)])).
% cnf(972,plain,(X1=multiplication(domain(X1),X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[25,946,theory(equality)]),33,theory(equality)]),64,theory(equality)]),46,theory(equality)])).
% cnf(991,plain,(addition(X1,multiplication(domain(X1),X2))=multiplication(domain(X1),addition(X1,X2))),inference(spm,[status(thm)],[29,972,theory(equality)])).
% cnf(992,plain,(addition(X1,multiplication(X2,X1))=multiplication(addition(domain(X1),X2),X1)),inference(spm,[status(thm)],[31,972,theory(equality)])).
% cnf(993,plain,(addition(domain(X1),X1)=multiplication(domain(X1),addition(X1,one))),inference(spm,[status(thm)],[753,972,theory(equality)])).
% cnf(1005,plain,(multiplication(domain(X1),domain(X1))=domain(X1)),inference(spm,[status(thm)],[972,124,theory(equality)])).
% cnf(1011,plain,(multiplication(addition(X2,one),X1)=multiplication(addition(domain(X1),X2),X1)),inference(rw,[status(thm)],[992,946,theory(equality)])).
% cnf(1051,plain,(addition(multiplication(domain(X1),X2),domain(X1))=multiplication(domain(X1),addition(X2,domain(X1)))),inference(spm,[status(thm)],[29,1005,theory(equality)])).
% cnf(1763,plain,(leq(domain(multiplication(X1,X2)),domain(multiplication(X1,addition(X2,one))))),inference(spm,[status(thm)],[593,753,theory(equality)])).
% cnf(1794,plain,(leq(domain(multiplication(X1,X2)),domain(X1))),inference(rw,[status(thm)],[1763,292,theory(equality)])).
% cnf(1880,plain,(multiplication(domain(X1),addition(X1,one))=addition(X1,domain(X1))),inference(rw,[status(thm)],[993,33,theory(equality)])).
% cnf(1881,plain,(multiplication(addition(X1,domain(X1)),X2)=multiplication(domain(X1),multiplication(addition(X1,one),X2))),inference(spm,[status(thm)],[21,1880,theory(equality)])).
% cnf(2380,plain,(leq(domain(multiplication(domain(X1),X2)),domain(X1))),inference(spm,[status(thm)],[1794,124,theory(equality)])).
% cnf(3088,plain,(addition(domain(multiplication(domain(X1),X2)),domain(X1))=domain(X1)),inference(spm,[status(thm)],[54,2380,theory(equality)])).
% cnf(3123,plain,(domain(addition(multiplication(domain(X1),X2),X1))=domain(X1)),inference(rw,[status(thm)],[3088,27,theory(equality)])).
% cnf(3430,plain,(multiplication(domain(addition(X1,X2)),X1)=multiplication(addition(domain(X2),one),X1)),inference(spm,[status(thm)],[1011,27,theory(equality)])).
% cnf(3474,plain,(multiplication(domain(addition(X1,X2)),X1)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[3430,33,theory(equality)]),64,theory(equality)]),46,theory(equality)])).
% cnf(3508,plain,(multiplication(domain(addition(X2,X1)),X1)=X1),inference(spm,[status(thm)],[3474,542,theory(equality)])).
% cnf(3581,plain,(multiplication(domain(multiplication(addition(X1,X3),X2)),multiplication(X3,X2))=multiplication(X3,X2)),inference(spm,[status(thm)],[3508,31,theory(equality)])).
% cnf(4780,plain,(domain(multiplication(domain(X1),addition(X1,X2)))=domain(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[3123,33,theory(equality)]),991,theory(equality)])).
% cnf(10645,plain,(multiplication(domain(X1),addition(X2,one))=multiplication(domain(X1),addition(X2,domain(X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1051,33,theory(equality)]),753,theory(equality)])).
% cnf(10697,plain,(multiplication(domain(X1),domain(addition(X2,X1)))=multiplication(domain(X1),addition(domain(X2),one))),inference(spm,[status(thm)],[10645,27,theory(equality)])).
% cnf(10774,plain,(multiplication(domain(X1),domain(addition(X2,X1)))=domain(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[10697,33,theory(equality)]),64,theory(equality)]),44,theory(equality)])).
% cnf(11369,plain,(multiplication(domain(multiplication(domain(X1),X2)),domain(multiplication(domain(X1),addition(X1,X2))))=domain(multiplication(domain(X1),X2))),inference(spm,[status(thm)],[10774,991,theory(equality)])).
% cnf(11370,plain,(multiplication(domain(multiplication(X1,X2)),domain(multiplication(X1,addition(X2,one))))=domain(multiplication(X1,X2))),inference(spm,[status(thm)],[10774,753,theory(equality)])).
% cnf(11449,plain,(multiplication(domain(multiplication(domain(X1),X2)),domain(X1))=domain(multiplication(domain(X1),X2))),inference(rw,[status(thm)],[11369,4780,theory(equality)])).
% cnf(11450,plain,(multiplication(domain(multiplication(X1,X2)),domain(X1))=domain(multiplication(X1,X2))),inference(rw,[status(thm)],[11370,292,theory(equality)])).
% cnf(15298,plain,(domain(domain(multiplication(X1,X2)))=domain(multiplication(domain(multiplication(X1,X2)),X1))),inference(spm,[status(thm)],[23,11450,theory(equality)])).
% cnf(15386,plain,(domain(multiplication(X1,X2))=domain(multiplication(domain(multiplication(X1,X2)),X1))),inference(rw,[status(thm)],[15298,124,theory(equality)])).
% cnf(17476,plain,(domain(multiplication(domain(X1),X2))=domain(multiplication(domain(multiplication(domain(X1),X2)),X1))),inference(spm,[status(thm)],[23,15386,theory(equality)])).
% cnf(514763,plain,(multiplication(domain(multiplication(one,X2)),multiplication(domain(X1),X2))=multiplication(domain(X1),X2)),inference(spm,[status(thm)],[3581,64,theory(equality)])).
% cnf(515262,plain,(multiplication(domain(X2),multiplication(domain(X1),X2))=multiplication(domain(X1),X2)),inference(rw,[status(thm)],[514763,46,theory(equality)])).
% cnf(515665,plain,(addition(multiplication(domain(X2),X1),multiplication(X3,X1))=multiplication(addition(multiplication(domain(X1),domain(X2)),X3),X1)),inference(spm,[status(thm)],[183,515262,theory(equality)])).
% cnf(516157,plain,(multiplication(addition(domain(X2),X3),X1)=multiplication(addition(multiplication(domain(X1),domain(X2)),X3),X1)),inference(rw,[status(thm)],[515665,31,theory(equality)])).
% cnf(1139636,plain,(multiplication(domain(multiplication(domain(X1),domain(X2))),multiplication(addition(domain(X2),one),X1))=multiplication(addition(multiplication(domain(X1),domain(X2)),domain(multiplication(domain(X1),domain(X2)))),X1)),inference(spm,[status(thm)],[1881,516157,theory(equality)])).
% cnf(1141039,plain,(multiplication(domain(multiplication(domain(X1),X2)),X1)=multiplication(addition(multiplication(domain(X1),domain(X2)),domain(multiplication(domain(X1),domain(X2)))),X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1139636,23,theory(equality)]),33,theory(equality)]),64,theory(equality)]),46,theory(equality)])).
% cnf(1141040,plain,(multiplication(domain(multiplication(domain(X1),X2)),X1)=multiplication(domain(X2),X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1141039,23,theory(equality)]),516157,theory(equality)]),27,theory(equality)]),946,theory(equality)]),33,theory(equality)]),64,theory(equality)]),46,theory(equality)])).
% cnf(1144536,plain,(multiplication(domain(multiplication(domain(X1),X2)),domain(X1))=multiplication(domain(X2),domain(X1))),inference(spm,[status(thm)],[1141040,124,theory(equality)])).
% cnf(1144729,plain,(domain(multiplication(domain(X2),X1))=domain(multiplication(domain(X1),X2))),inference(rw,[status(thm)],[17476,1141040,theory(equality)])).
% cnf(1145612,plain,(domain(multiplication(domain(X1),X2))=multiplication(domain(X2),domain(X1))),inference(rw,[status(thm)],[1144536,11449,theory(equality)])).
% cnf(1147000,negated_conjecture,(multiplication(domain(esk2_0),domain(esk1_0))!=multiplication(domain(esk1_0),domain(esk2_0))),inference(rw,[status(thm)],[58,1145612,theory(equality)])).
% cnf(1177953,plain,(multiplication(domain(X1),domain(X2))=domain(multiplication(domain(X1),X2))),inference(rw,[status(thm)],[1144729,1145612,theory(equality)])).
% cnf(1177954,plain,(multiplication(domain(X1),domain(X2))=multiplication(domain(X2),domain(X1))),inference(rw,[status(thm)],[1177953,1145612,theory(equality)])).
% cnf(1179415,negated_conjecture,($false),inference(rw,[status(thm)],[1147000,1177954,theory(equality)])).
% cnf(1179416,negated_conjecture,($false),inference(cn,[status(thm)],[1179415,theory(equality)])).
% cnf(1179417,negated_conjecture,($false),1179416,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 18724
% # ...of these trivial                : 6962
% # ...subsumed                        : 10190
% # ...remaining for further processing: 1572
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 2
% # Backward-rewritten                 : 213
% # Generated clauses                  : 617268
% # ...of the previous two non-trivial : 367681
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 617267
% # Factorizations                     : 0
% # Equation resolutions               : 1
% # Current number of processed clauses: 1357
% #    Positive orientable unit clauses: 1082
% #    Positive unorientable unit clauses: 13
% #    Negative unit clauses           : 0
% #    Non-unit-clauses                : 262
% # Current number of unprocessed clauses: 291371
% # ...number of literals in the above : 346047
% # Clause-clause subsumption calls (NU) : 93318
% # Rec. Clause-clause subsumption calls : 93318
% # Unit Clause-clause subsumption calls : 267
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 11855
% # Indexed BW rewrite successes       : 450
% # Backwards rewriting index:   498 leaves,   4.67+/-5.891 terms/leaf
% # Paramod-from index:          320 leaves,   3.45+/-4.077 terms/leaf
% # Paramod-into index:          425 leaves,   4.75+/-5.789 terms/leaf
% # -------------------------------------------------
% # User time              : 18.680 s
% # System time            : 0.754 s
% # Total time             : 19.434 s
% # Maximum resident set size: 0 pages
% PrfWatch: 35.13 CPU 36.83 WC
% FINAL PrfWatch: 35.13 CPU 36.83 WC
% SZS output end Solution for /tmp/SystemOnTPTP5838/KLE060+1.tptp
% 
%------------------------------------------------------------------------------