TSTP Solution File: KRS140+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS140+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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:36:57 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP17057/KRS140+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP17057/KRS140+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17057/KRS140+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 17153
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(cowlThing(X1)&~(cowlNothing(X1))),file('/tmp/SRASS.s.p', axiom_0)).
% fof(2, axiom,![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))),file('/tmp/SRASS.s.p', axiom_1)).
% fof(3, axiom,![X1]:![X2]:(rsymProp(X1,X2)=>rsymProp(X2,X1)),file('/tmp/SRASS.s.p', axiom_3)).
% fof(5, axiom,rsymProp(ia,ia),file('/tmp/SRASS.s.p', axiom_5)).
% fof(12, axiom,![X1]:![X2]:(rsymProp(X1,X2)=>(X2=ia|X2=ib)),file('/tmp/SRASS.s.p', axiom_2)).
% fof(14, axiom,rsymProp(ib,ib),file('/tmp/SRASS.s.p', axiom_7)).
% fof(15, conjecture,(((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&![X1]:![X2]:![X6]:((rsymProp(X1,X2)&rsymProp(X2,X6))=>rsymProp(X1,X6)))&?[X1]:(rsymProp(ia,X1)&cowlThing(X1))),file('/tmp/SRASS.s.p', the_axiom)).
% fof(16, negated_conjecture,~((((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&![X1]:![X2]:![X6]:((rsymProp(X1,X2)&rsymProp(X2,X6))=>rsymProp(X1,X6)))&?[X1]:(rsymProp(ia,X1)&cowlThing(X1)))),inference(assume_negation,[status(cth)],[15])).
% fof(17, plain,![X1]:(cowlThing(X1)&~(cowlNothing(X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(18, plain,![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(19, negated_conjecture,~((((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&![X1]:![X2]:![X6]:((rsymProp(X1,X2)&rsymProp(X2,X6))=>rsymProp(X1,X6)))&?[X1]:(rsymProp(ia,X1)&cowlThing(X1)))),inference(fof_simplification,[status(thm)],[16,theory(equality)])).
% fof(20, plain,![X2]:(cowlThing(X2)&~(cowlNothing(X2))),inference(variable_rename,[status(thm)],[17])).
% cnf(21,plain,(~cowlNothing(X1)),inference(split_conjunct,[status(thm)],[20])).
% cnf(22,plain,(cowlThing(X1)),inference(split_conjunct,[status(thm)],[20])).
% fof(23, plain,![X1]:((~(xsd_string(X1))|~(xsd_integer(X1)))&(xsd_integer(X1)|xsd_string(X1))),inference(fof_nnf,[status(thm)],[18])).
% fof(24, plain,![X2]:((~(xsd_string(X2))|~(xsd_integer(X2)))&(xsd_integer(X2)|xsd_string(X2))),inference(variable_rename,[status(thm)],[23])).
% cnf(25,plain,(xsd_string(X1)|xsd_integer(X1)),inference(split_conjunct,[status(thm)],[24])).
% cnf(26,plain,(~xsd_integer(X1)|~xsd_string(X1)),inference(split_conjunct,[status(thm)],[24])).
% fof(27, plain,![X1]:![X2]:(~(rsymProp(X1,X2))|rsymProp(X2,X1)),inference(fof_nnf,[status(thm)],[3])).
% fof(28, plain,![X3]:![X4]:(~(rsymProp(X3,X4))|rsymProp(X4,X3)),inference(variable_rename,[status(thm)],[27])).
% cnf(29,plain,(rsymProp(X1,X2)|~rsymProp(X2,X1)),inference(split_conjunct,[status(thm)],[28])).
% cnf(31,plain,(rsymProp(ia,ia)),inference(split_conjunct,[status(thm)],[5])).
% fof(50, plain,![X1]:![X2]:(~(rsymProp(X1,X2))|(X2=ia|X2=ib)),inference(fof_nnf,[status(thm)],[12])).
% fof(51, plain,![X3]:![X4]:(~(rsymProp(X3,X4))|(X4=ia|X4=ib)),inference(variable_rename,[status(thm)],[50])).
% cnf(52,plain,(X1=ib|X1=ia|~rsymProp(X2,X1)),inference(split_conjunct,[status(thm)],[51])).
% cnf(54,plain,(rsymProp(ib,ib)),inference(split_conjunct,[status(thm)],[14])).
% fof(55, negated_conjecture,(((?[X1]:(~(cowlThing(X1))|cowlNothing(X1))|?[X1]:((~(xsd_string(X1))|xsd_integer(X1))&(xsd_string(X1)|~(xsd_integer(X1)))))|?[X1]:?[X2]:?[X6]:((rsymProp(X1,X2)&rsymProp(X2,X6))&~(rsymProp(X1,X6))))|![X1]:(~(rsymProp(ia,X1))|~(cowlThing(X1)))),inference(fof_nnf,[status(thm)],[19])).
% fof(56, negated_conjecture,(((?[X7]:(~(cowlThing(X7))|cowlNothing(X7))|?[X8]:((~(xsd_string(X8))|xsd_integer(X8))&(xsd_string(X8)|~(xsd_integer(X8)))))|?[X9]:?[X10]:?[X11]:((rsymProp(X9,X10)&rsymProp(X10,X11))&~(rsymProp(X9,X11))))|![X12]:(~(rsymProp(ia,X12))|~(cowlThing(X12)))),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,((((~(cowlThing(esk1_0))|cowlNothing(esk1_0))|((~(xsd_string(esk2_0))|xsd_integer(esk2_0))&(xsd_string(esk2_0)|~(xsd_integer(esk2_0)))))|((rsymProp(esk3_0,esk4_0)&rsymProp(esk4_0,esk5_0))&~(rsymProp(esk3_0,esk5_0))))|![X12]:(~(rsymProp(ia,X12))|~(cowlThing(X12)))),inference(skolemize,[status(esa)],[56])).
% fof(58, negated_conjecture,![X12]:((~(rsymProp(ia,X12))|~(cowlThing(X12)))|(((~(cowlThing(esk1_0))|cowlNothing(esk1_0))|((~(xsd_string(esk2_0))|xsd_integer(esk2_0))&(xsd_string(esk2_0)|~(xsd_integer(esk2_0)))))|((rsymProp(esk3_0,esk4_0)&rsymProp(esk4_0,esk5_0))&~(rsymProp(esk3_0,esk5_0))))),inference(shift_quantors,[status(thm)],[57])).
% fof(59, negated_conjecture,![X12]:(((((rsymProp(esk3_0,esk4_0)|((~(xsd_string(esk2_0))|xsd_integer(esk2_0))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0))))|(~(rsymProp(ia,X12))|~(cowlThing(X12))))&((rsymProp(esk4_0,esk5_0)|((~(xsd_string(esk2_0))|xsd_integer(esk2_0))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0))))|(~(rsymProp(ia,X12))|~(cowlThing(X12)))))&((~(rsymProp(esk3_0,esk5_0))|((~(xsd_string(esk2_0))|xsd_integer(esk2_0))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0))))|(~(rsymProp(ia,X12))|~(cowlThing(X12)))))&((((rsymProp(esk3_0,esk4_0)|((xsd_string(esk2_0)|~(xsd_integer(esk2_0)))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0))))|(~(rsymProp(ia,X12))|~(cowlThing(X12))))&((rsymProp(esk4_0,esk5_0)|((xsd_string(esk2_0)|~(xsd_integer(esk2_0)))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0))))|(~(rsymProp(ia,X12))|~(cowlThing(X12)))))&((~(rsymProp(esk3_0,esk5_0))|((xsd_string(esk2_0)|~(xsd_integer(esk2_0)))|(~(cowlThing(esk1_0))|cowlNothing(esk1_0))))|(~(rsymProp(ia,X12))|~(cowlThing(X12)))))),inference(distribute,[status(thm)],[58])).
% cnf(60,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|~cowlThing(X1)|~rsymProp(ia,X1)|~cowlThing(esk1_0)|~xsd_integer(esk2_0)|~rsymProp(esk3_0,esk5_0)),inference(split_conjunct,[status(thm)],[59])).
% cnf(61,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|rsymProp(esk4_0,esk5_0)|~cowlThing(X1)|~rsymProp(ia,X1)|~cowlThing(esk1_0)|~xsd_integer(esk2_0)),inference(split_conjunct,[status(thm)],[59])).
% cnf(62,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|rsymProp(esk3_0,esk4_0)|~cowlThing(X1)|~rsymProp(ia,X1)|~cowlThing(esk1_0)|~xsd_integer(esk2_0)),inference(split_conjunct,[status(thm)],[59])).
% cnf(63,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|~cowlThing(X1)|~rsymProp(ia,X1)|~cowlThing(esk1_0)|~xsd_string(esk2_0)|~rsymProp(esk3_0,esk5_0)),inference(split_conjunct,[status(thm)],[59])).
% cnf(64,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|rsymProp(esk4_0,esk5_0)|~cowlThing(X1)|~rsymProp(ia,X1)|~cowlThing(esk1_0)|~xsd_string(esk2_0)),inference(split_conjunct,[status(thm)],[59])).
% cnf(65,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|rsymProp(esk3_0,esk4_0)|~cowlThing(X1)|~rsymProp(ia,X1)|~cowlThing(esk1_0)|~xsd_string(esk2_0)),inference(split_conjunct,[status(thm)],[59])).
% cnf(68,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|rsymProp(esk3_0,esk4_0)|$false|$false|~xsd_integer(esk2_0)|~rsymProp(ia,X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[62,22,theory(equality)]),22,theory(equality)]),['unfolding']).
% cnf(69,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|rsymProp(esk4_0,esk5_0)|$false|$false|~xsd_integer(esk2_0)|~rsymProp(ia,X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[61,22,theory(equality)]),22,theory(equality)]),['unfolding']).
% cnf(70,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|rsymProp(esk3_0,esk4_0)|$false|$false|~xsd_string(esk2_0)|~rsymProp(ia,X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[65,22,theory(equality)]),22,theory(equality)]),['unfolding']).
% cnf(71,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|rsymProp(esk4_0,esk5_0)|$false|$false|~xsd_string(esk2_0)|~rsymProp(ia,X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[64,22,theory(equality)]),22,theory(equality)]),['unfolding']).
% cnf(72,negated_conjecture,(cowlNothing(esk1_0)|xsd_string(esk2_0)|$false|$false|~xsd_integer(esk2_0)|~rsymProp(ia,X1)|~rsymProp(esk3_0,esk5_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[60,22,theory(equality)]),22,theory(equality)]),['unfolding']).
% cnf(73,negated_conjecture,(cowlNothing(esk1_0)|xsd_integer(esk2_0)|$false|$false|~xsd_string(esk2_0)|~rsymProp(ia,X1)|~rsymProp(esk3_0,esk5_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[63,22,theory(equality)]),22,theory(equality)]),['unfolding']).
% cnf(74,negated_conjecture,(xsd_string(esk2_0)|rsymProp(esk3_0,esk4_0)|~xsd_integer(esk2_0)|~rsymProp(ia,X1)),inference(sr,[status(thm)],[68,21,theory(equality)])).
% cnf(75,negated_conjecture,(rsymProp(esk3_0,esk4_0)|xsd_string(esk2_0)|~rsymProp(ia,X1)),inference(csr,[status(thm)],[74,25])).
% cnf(76,negated_conjecture,(xsd_string(esk2_0)|rsymProp(esk4_0,esk5_0)|~xsd_integer(esk2_0)|~rsymProp(ia,X1)),inference(sr,[status(thm)],[69,21,theory(equality)])).
% cnf(77,negated_conjecture,(rsymProp(esk4_0,esk5_0)|xsd_string(esk2_0)|~rsymProp(ia,X1)),inference(csr,[status(thm)],[76,25])).
% cnf(78,negated_conjecture,(xsd_integer(esk2_0)|rsymProp(esk3_0,esk4_0)|~xsd_string(esk2_0)|~rsymProp(ia,X1)),inference(sr,[status(thm)],[70,21,theory(equality)])).
% cnf(79,negated_conjecture,(rsymProp(esk3_0,esk4_0)|xsd_integer(esk2_0)|~rsymProp(ia,X1)),inference(csr,[status(thm)],[78,25])).
% cnf(80,negated_conjecture,(xsd_integer(esk2_0)|rsymProp(esk4_0,esk5_0)|~xsd_string(esk2_0)|~rsymProp(ia,X1)),inference(sr,[status(thm)],[71,21,theory(equality)])).
% cnf(81,negated_conjecture,(rsymProp(esk4_0,esk5_0)|xsd_integer(esk2_0)|~rsymProp(ia,X1)),inference(csr,[status(thm)],[80,25])).
% cnf(82,negated_conjecture,(xsd_string(esk2_0)|~xsd_integer(esk2_0)|~rsymProp(ia,X1)|~rsymProp(esk3_0,esk5_0)),inference(sr,[status(thm)],[72,21,theory(equality)])).
% cnf(83,negated_conjecture,(xsd_string(esk2_0)|~rsymProp(esk3_0,esk5_0)|~rsymProp(ia,X1)),inference(csr,[status(thm)],[82,25])).
% cnf(84,negated_conjecture,(xsd_integer(esk2_0)|~xsd_string(esk2_0)|~rsymProp(ia,X1)|~rsymProp(esk3_0,esk5_0)),inference(sr,[status(thm)],[73,21,theory(equality)])).
% cnf(85,negated_conjecture,(xsd_integer(esk2_0)|~rsymProp(esk3_0,esk5_0)|~rsymProp(ia,X1)),inference(csr,[status(thm)],[84,25])).
% cnf(91,negated_conjecture,(rsymProp(esk3_0,esk4_0)|xsd_string(esk2_0)),inference(spm,[status(thm)],[75,31,theory(equality)])).
% cnf(92,negated_conjecture,(rsymProp(esk4_0,esk5_0)|xsd_string(esk2_0)),inference(spm,[status(thm)],[77,31,theory(equality)])).
% cnf(93,negated_conjecture,(rsymProp(esk3_0,esk4_0)|xsd_integer(esk2_0)),inference(spm,[status(thm)],[79,31,theory(equality)])).
% cnf(94,negated_conjecture,(rsymProp(esk4_0,esk5_0)|xsd_integer(esk2_0)),inference(spm,[status(thm)],[81,31,theory(equality)])).
% cnf(95,negated_conjecture,(xsd_string(esk2_0)|~rsymProp(esk3_0,esk5_0)),inference(spm,[status(thm)],[83,31,theory(equality)])).
% cnf(96,negated_conjecture,(xsd_integer(esk2_0)|~rsymProp(esk3_0,esk5_0)),inference(spm,[status(thm)],[85,31,theory(equality)])).
% cnf(97,negated_conjecture,(rsymProp(esk3_0,esk4_0)|~xsd_string(esk2_0)),inference(spm,[status(thm)],[26,93,theory(equality)])).
% cnf(98,negated_conjecture,(rsymProp(esk4_0,esk5_0)|~xsd_string(esk2_0)),inference(spm,[status(thm)],[26,94,theory(equality)])).
% cnf(99,negated_conjecture,(~xsd_string(esk2_0)|~rsymProp(esk3_0,esk5_0)),inference(spm,[status(thm)],[26,96,theory(equality)])).
% cnf(100,negated_conjecture,(rsymProp(esk3_0,esk4_0)),inference(csr,[status(thm)],[97,91])).
% cnf(101,negated_conjecture,(rsymProp(esk4_0,esk3_0)),inference(spm,[status(thm)],[29,100,theory(equality)])).
% cnf(102,negated_conjecture,(ia=esk4_0|ib=esk4_0),inference(spm,[status(thm)],[52,100,theory(equality)])).
% cnf(106,negated_conjecture,(ia=esk3_0|ib=esk3_0),inference(spm,[status(thm)],[52,101,theory(equality)])).
% cnf(108,negated_conjecture,(rsymProp(esk4_0,esk5_0)),inference(csr,[status(thm)],[98,92])).
% cnf(110,negated_conjecture,(ia=esk5_0|ib=esk5_0),inference(spm,[status(thm)],[52,108,theory(equality)])).
% cnf(113,negated_conjecture,(~rsymProp(esk3_0,esk5_0)),inference(csr,[status(thm)],[99,95])).
% cnf(118,negated_conjecture,(rsymProp(esk3_0,ia)|esk4_0=ib),inference(spm,[status(thm)],[100,102,theory(equality)])).
% cnf(119,negated_conjecture,(rsymProp(ia,esk5_0)|esk4_0=ib),inference(spm,[status(thm)],[108,102,theory(equality)])).
% cnf(125,negated_conjecture,(esk3_0=ib|~rsymProp(ia,esk5_0)),inference(spm,[status(thm)],[113,106,theory(equality)])).
% cnf(129,negated_conjecture,(esk5_0=ib|~rsymProp(esk3_0,ia)),inference(spm,[status(thm)],[113,110,theory(equality)])).
% cnf(162,negated_conjecture,(esk3_0=ib|esk5_0=ib|~rsymProp(ia,ia)),inference(spm,[status(thm)],[125,110,theory(equality)])).
% cnf(163,negated_conjecture,(esk3_0=ib|esk4_0=ib),inference(spm,[status(thm)],[125,119,theory(equality)])).
% cnf(164,negated_conjecture,(esk3_0=ib|esk5_0=ib|$false),inference(rw,[status(thm)],[162,31,theory(equality)])).
% cnf(165,negated_conjecture,(esk3_0=ib|esk5_0=ib),inference(cn,[status(thm)],[164,theory(equality)])).
% cnf(168,negated_conjecture,(esk3_0=ib|~rsymProp(esk3_0,ib)),inference(spm,[status(thm)],[113,165,theory(equality)])).
% cnf(172,negated_conjecture,(rsymProp(esk3_0,ib)|esk3_0=ib),inference(spm,[status(thm)],[100,163,theory(equality)])).
% cnf(201,negated_conjecture,(esk5_0=ib|esk4_0=ib),inference(spm,[status(thm)],[129,118,theory(equality)])).
% cnf(272,negated_conjecture,(esk3_0=ib),inference(csr,[status(thm)],[172,168])).
% cnf(292,negated_conjecture,(~rsymProp(ib,esk5_0)),inference(rw,[status(thm)],[113,272,theory(equality)])).
% cnf(297,negated_conjecture,(esk4_0=ib|~rsymProp(ib,ib)),inference(spm,[status(thm)],[292,201,theory(equality)])).
% cnf(301,negated_conjecture,(esk4_0=ib|$false),inference(rw,[status(thm)],[297,54,theory(equality)])).
% cnf(302,negated_conjecture,(esk4_0=ib),inference(cn,[status(thm)],[301,theory(equality)])).
% cnf(311,negated_conjecture,(rsymProp(ib,esk5_0)),inference(rw,[status(thm)],[108,302,theory(equality)])).
% cnf(312,negated_conjecture,($false),inference(sr,[status(thm)],[311,292,theory(equality)])).
% cnf(313,negated_conjecture,($false),312,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 93
% # ...of these trivial : 0
% # ...subsumed : 23
% # ...remaining for further processing: 70
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 8
% # Backward-rewritten : 34
% # Generated clauses : 139
% # ...of the previous two non-trivial : 121
% # Contextual simplify-reflections : 21
% # Paramodulations : 136
% # Factorizations : 3
% # Equation resolutions : 0
% # Current number of processed clauses: 15
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 8
% # Current number of unprocessed clauses: 17
% # ...number of literals in the above : 31
% # Clause-clause subsumption calls (NU) : 126
% # Rec. Clause-clause subsumption calls : 126
% # Unit Clause-clause subsumption calls : 13
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 14 leaves, 1.07+/-0.258 terms/leaf
% # Paramod-from index: 8 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 12 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.016 s
% # System time : 0.002 s
% # Total time : 0.018 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP17057/KRS140+1.tptp
%
%------------------------------------------------------------------------------