TSTP Solution File: SEU156+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU156+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art07.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 : Thu Dec 30 01:20:26 EST 2010
% Result : Theorem 1.95s
% Output : Solution 1.95s
% 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/SystemOnTPTP21270/SEU156+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21270/SEU156+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21270/SEU156+2.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 21366
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.021 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(6, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(7, axiom,![X1]:![X2]:![X3]:(singleton(X1)=unordered_pair(X2,X3)=>X1=X2),file('/tmp/SRASS.s.p', t8_zfmisc_1)).
% fof(8, axiom,![X1]:![X2]:![X3]:(singleton(X1)=unordered_pair(X2,X3)=>X2=X3),file('/tmp/SRASS.s.p', t9_zfmisc_1)).
% fof(9, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(17, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(18, axiom,![X1]:![X2]:![X3]:![X4]:~(((unordered_pair(X1,X2)=unordered_pair(X3,X4)&~(X1=X3))&~(X1=X4))),file('/tmp/SRASS.s.p', t10_zfmisc_1)).
% fof(24, axiom,![X1]:![X2]:(X2=singleton(X1)<=>![X3]:(in(X3,X2)<=>X3=X1)),file('/tmp/SRASS.s.p', d1_tarski)).
% fof(25, axiom,![X1]:![X2]:![X3]:(X3=unordered_pair(X1,X2)<=>![X4]:(in(X4,X3)<=>(X4=X1|X4=X2))),file('/tmp/SRASS.s.p', d2_tarski)).
% fof(84, conjecture,![X1]:![X2]:![X3]:![X4]:(ordered_pair(X1,X2)=ordered_pair(X3,X4)=>(X1=X3&X2=X4)),file('/tmp/SRASS.s.p', t33_zfmisc_1)).
% fof(85, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:(ordered_pair(X1,X2)=ordered_pair(X3,X4)=>(X1=X3&X2=X4))),inference(assume_negation,[status(cth)],[84])).
% fof(111, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[6])).
% cnf(112,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[111])).
% fof(113, plain,![X1]:![X2]:![X3]:(~(singleton(X1)=unordered_pair(X2,X3))|X1=X2),inference(fof_nnf,[status(thm)],[7])).
% fof(114, plain,![X4]:![X5]:![X6]:(~(singleton(X4)=unordered_pair(X5,X6))|X4=X5),inference(variable_rename,[status(thm)],[113])).
% cnf(115,plain,(X1=X2|singleton(X1)!=unordered_pair(X2,X3)),inference(split_conjunct,[status(thm)],[114])).
% fof(116, plain,![X1]:![X2]:![X3]:(~(singleton(X1)=unordered_pair(X2,X3))|X2=X3),inference(fof_nnf,[status(thm)],[8])).
% fof(117, plain,![X4]:![X5]:![X6]:(~(singleton(X4)=unordered_pair(X5,X6))|X5=X6),inference(variable_rename,[status(thm)],[116])).
% cnf(118,plain,(X1=X2|singleton(X3)!=unordered_pair(X1,X2)),inference(split_conjunct,[status(thm)],[117])).
% fof(119, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[9])).
% cnf(120,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[119])).
% fof(144, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[17])).
% cnf(145,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[144])).
% fof(146, plain,![X1]:![X2]:![X3]:![X4]:((~(unordered_pair(X1,X2)=unordered_pair(X3,X4))|X1=X3)|X1=X4),inference(fof_nnf,[status(thm)],[18])).
% fof(147, plain,![X5]:![X6]:![X7]:![X8]:((~(unordered_pair(X5,X6)=unordered_pair(X7,X8))|X5=X7)|X5=X8),inference(variable_rename,[status(thm)],[146])).
% cnf(148,plain,(X1=X2|X1=X3|unordered_pair(X1,X4)!=unordered_pair(X3,X2)),inference(split_conjunct,[status(thm)],[147])).
% fof(163, plain,![X1]:![X2]:((~(X2=singleton(X1))|![X3]:((~(in(X3,X2))|X3=X1)&(~(X3=X1)|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|~(X3=X1))&(in(X3,X2)|X3=X1))|X2=singleton(X1))),inference(fof_nnf,[status(thm)],[24])).
% fof(164, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(?[X7]:((~(in(X7,X5))|~(X7=X4))&(in(X7,X5)|X7=X4))|X5=singleton(X4))),inference(variable_rename,[status(thm)],[163])).
% fof(165, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(((~(in(esk4_2(X4,X5),X5))|~(esk4_2(X4,X5)=X4))&(in(esk4_2(X4,X5),X5)|esk4_2(X4,X5)=X4))|X5=singleton(X4))),inference(skolemize,[status(esa)],[164])).
% fof(166, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5)))|~(X5=singleton(X4)))&(((~(in(esk4_2(X4,X5),X5))|~(esk4_2(X4,X5)=X4))&(in(esk4_2(X4,X5),X5)|esk4_2(X4,X5)=X4))|X5=singleton(X4))),inference(shift_quantors,[status(thm)],[165])).
% fof(167, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)|~(X5=singleton(X4)))&((~(X6=X4)|in(X6,X5))|~(X5=singleton(X4))))&(((~(in(esk4_2(X4,X5),X5))|~(esk4_2(X4,X5)=X4))|X5=singleton(X4))&((in(esk4_2(X4,X5),X5)|esk4_2(X4,X5)=X4)|X5=singleton(X4)))),inference(distribute,[status(thm)],[166])).
% cnf(171,plain,(X3=X2|X1!=singleton(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[167])).
% fof(172, plain,![X1]:![X2]:![X3]:((~(X3=unordered_pair(X1,X2))|![X4]:((~(in(X4,X3))|(X4=X1|X4=X2))&((~(X4=X1)&~(X4=X2))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(~(X4=X1)&~(X4=X2)))&(in(X4,X3)|(X4=X1|X4=X2)))|X3=unordered_pair(X1,X2))),inference(fof_nnf,[status(thm)],[25])).
% fof(173, plain,![X5]:![X6]:![X7]:((~(X7=unordered_pair(X5,X6))|![X8]:((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(~(X9=X5)&~(X9=X6)))&(in(X9,X7)|(X9=X5|X9=X6)))|X7=unordered_pair(X5,X6))),inference(variable_rename,[status(thm)],[172])).
% fof(174, plain,![X5]:![X6]:![X7]:((~(X7=unordered_pair(X5,X6))|![X8]:((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7))))&(((~(in(esk5_3(X5,X6,X7),X7))|(~(esk5_3(X5,X6,X7)=X5)&~(esk5_3(X5,X6,X7)=X6)))&(in(esk5_3(X5,X6,X7),X7)|(esk5_3(X5,X6,X7)=X5|esk5_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(skolemize,[status(esa)],[173])).
% fof(175, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7)))|~(X7=unordered_pair(X5,X6)))&(((~(in(esk5_3(X5,X6,X7),X7))|(~(esk5_3(X5,X6,X7)=X5)&~(esk5_3(X5,X6,X7)=X6)))&(in(esk5_3(X5,X6,X7),X7)|(esk5_3(X5,X6,X7)=X5|esk5_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(shift_quantors,[status(thm)],[174])).
% fof(176, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(X8=X5|X8=X6))|~(X7=unordered_pair(X5,X6)))&(((~(X8=X5)|in(X8,X7))|~(X7=unordered_pair(X5,X6)))&((~(X8=X6)|in(X8,X7))|~(X7=unordered_pair(X5,X6)))))&((((~(esk5_3(X5,X6,X7)=X5)|~(in(esk5_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6))&((~(esk5_3(X5,X6,X7)=X6)|~(in(esk5_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6)))&((in(esk5_3(X5,X6,X7),X7)|(esk5_3(X5,X6,X7)=X5|esk5_3(X5,X6,X7)=X6))|X7=unordered_pair(X5,X6)))),inference(distribute,[status(thm)],[175])).
% cnf(180,plain,(in(X4,X1)|X1!=unordered_pair(X2,X3)|X4!=X3),inference(split_conjunct,[status(thm)],[176])).
% cnf(182,plain,(X4=X3|X4=X2|X1!=unordered_pair(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[176])).
% fof(388, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:(ordered_pair(X1,X2)=ordered_pair(X3,X4)&(~(X1=X3)|~(X2=X4))),inference(fof_nnf,[status(thm)],[85])).
% fof(389, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:(ordered_pair(X5,X6)=ordered_pair(X7,X8)&(~(X5=X7)|~(X6=X8))),inference(variable_rename,[status(thm)],[388])).
% fof(390, negated_conjecture,(ordered_pair(esk17_0,esk18_0)=ordered_pair(esk19_0,esk20_0)&(~(esk17_0=esk19_0)|~(esk18_0=esk20_0))),inference(skolemize,[status(esa)],[389])).
% cnf(391,negated_conjecture,(esk18_0!=esk20_0|esk17_0!=esk19_0),inference(split_conjunct,[status(thm)],[390])).
% cnf(392,negated_conjecture,(ordered_pair(esk17_0,esk18_0)=ordered_pair(esk19_0,esk20_0)),inference(split_conjunct,[status(thm)],[390])).
% cnf(394,plain,(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1))=ordered_pair(X1,X2)),inference(rw,[status(thm)],[120,112,theory(equality)]),['unfolding']).
% cnf(397,plain,(X1=X2|unordered_pair(X2,X3)!=unordered_pair(X1,X1)),inference(rw,[status(thm)],[115,112,theory(equality)]),['unfolding']).
% cnf(398,plain,(X1=X2|unordered_pair(X1,X2)!=unordered_pair(X3,X3)),inference(rw,[status(thm)],[118,112,theory(equality)]),['unfolding']).
% cnf(407,plain,(X2=X3|unordered_pair(X2,X2)!=X1|~in(X3,X1)),inference(rw,[status(thm)],[171,112,theory(equality)]),['unfolding']).
% cnf(429,negated_conjecture,(unordered_pair(unordered_pair(esk19_0,esk20_0),unordered_pair(esk19_0,esk19_0))=unordered_pair(unordered_pair(esk17_0,esk18_0),unordered_pair(esk17_0,esk17_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[392,394,theory(equality)]),394,theory(equality)]),['unfolding']).
% cnf(435,negated_conjecture,(unordered_pair(unordered_pair(esk19_0,esk19_0),unordered_pair(esk19_0,esk20_0))=unordered_pair(unordered_pair(esk17_0,esk18_0),unordered_pair(esk17_0,esk17_0))),inference(rw,[status(thm)],[429,145,theory(equality)])).
% cnf(436,negated_conjecture,(unordered_pair(unordered_pair(esk19_0,esk19_0),unordered_pair(esk19_0,esk20_0))=unordered_pair(unordered_pair(esk17_0,esk17_0),unordered_pair(esk17_0,esk18_0))),inference(rw,[status(thm)],[435,145,theory(equality)])).
% cnf(439,plain,(in(X1,X2)|unordered_pair(X3,X1)!=X2),inference(er,[status(thm)],[180,theory(equality)])).
% cnf(477,plain,(X1=X2|unordered_pair(X1,X1)!=unordered_pair(X3,X2)),inference(spm,[status(thm)],[397,145,theory(equality)])).
% cnf(501,negated_conjecture,(X1=unordered_pair(esk17_0,esk17_0)|X1=unordered_pair(esk17_0,esk18_0)|unordered_pair(X1,X2)!=unordered_pair(unordered_pair(esk19_0,esk19_0),unordered_pair(esk19_0,esk20_0))),inference(spm,[status(thm)],[148,436,theory(equality)])).
% cnf(532,plain,(in(X1,unordered_pair(X2,X1))),inference(er,[status(thm)],[439,theory(equality)])).
% cnf(657,plain,(X1=X2|~in(X2,unordered_pair(X1,X1))),inference(er,[status(thm)],[407,theory(equality)])).
% cnf(707,plain,(X1=X2|X3=X2|~in(X2,unordered_pair(X3,X1))),inference(er,[status(thm)],[182,theory(equality)])).
% cnf(2519,negated_conjecture,(unordered_pair(esk19_0,esk19_0)=unordered_pair(esk17_0,esk18_0)|unordered_pair(esk19_0,esk19_0)=unordered_pair(esk17_0,esk17_0)),inference(er,[status(thm)],[501,theory(equality)])).
% cnf(2558,negated_conjecture,(esk17_0=esk18_0|unordered_pair(esk17_0,esk17_0)=unordered_pair(esk19_0,esk19_0)|unordered_pair(esk19_0,esk19_0)!=unordered_pair(X1,X1)),inference(spm,[status(thm)],[398,2519,theory(equality)])).
% cnf(2885,negated_conjecture,(unordered_pair(esk17_0,esk17_0)=unordered_pair(esk19_0,esk19_0)|esk18_0=esk17_0),inference(er,[status(thm)],[2558,theory(equality)])).
% cnf(2907,negated_conjecture,(unordered_pair(esk17_0,esk17_0)=unordered_pair(esk19_0,esk19_0)),inference(spm,[status(thm)],[2519,2885,theory(equality)])).
% cnf(2931,negated_conjecture,(esk17_0=X1|unordered_pair(esk19_0,esk19_0)!=unordered_pair(X1,X2)),inference(spm,[status(thm)],[397,2907,theory(equality)])).
% cnf(2990,negated_conjecture,(unordered_pair(unordered_pair(esk19_0,esk19_0),unordered_pair(esk17_0,esk18_0))=unordered_pair(unordered_pair(esk19_0,esk19_0),unordered_pair(esk19_0,esk20_0))),inference(rw,[status(thm)],[436,2907,theory(equality)])).
% cnf(3089,negated_conjecture,(esk17_0=esk19_0),inference(er,[status(thm)],[2931,theory(equality)])).
% cnf(3114,negated_conjecture,(unordered_pair(unordered_pair(esk19_0,esk19_0),unordered_pair(esk19_0,esk18_0))=unordered_pair(unordered_pair(esk19_0,esk19_0),unordered_pair(esk19_0,esk20_0))),inference(rw,[status(thm)],[2990,3089,theory(equality)])).
% cnf(3115,negated_conjecture,($false|esk18_0!=esk20_0),inference(rw,[status(thm)],[391,3089,theory(equality)])).
% cnf(3116,negated_conjecture,(esk18_0!=esk20_0),inference(cn,[status(thm)],[3115,theory(equality)])).
% cnf(3168,negated_conjecture,(in(unordered_pair(esk19_0,esk18_0),unordered_pair(unordered_pair(esk19_0,esk19_0),unordered_pair(esk19_0,esk20_0)))),inference(spm,[status(thm)],[532,3114,theory(equality)])).
% cnf(8845,negated_conjecture,(unordered_pair(esk19_0,esk19_0)=unordered_pair(esk19_0,esk18_0)|unordered_pair(esk19_0,esk20_0)=unordered_pair(esk19_0,esk18_0)),inference(spm,[status(thm)],[707,3168,theory(equality)])).
% cnf(8877,negated_conjecture,(unordered_pair(esk19_0,esk18_0)=unordered_pair(esk19_0,esk19_0)|unordered_pair(esk19_0,esk20_0)!=unordered_pair(esk19_0,esk19_0)),inference(ef,[status(thm)],[8845,theory(equality)])).
% cnf(8890,negated_conjecture,(in(esk18_0,unordered_pair(esk19_0,esk20_0))|unordered_pair(esk19_0,esk18_0)=unordered_pair(esk19_0,esk19_0)),inference(spm,[status(thm)],[532,8845,theory(equality)])).
% cnf(8910,negated_conjecture,(esk19_0=esk18_0|unordered_pair(esk19_0,esk19_0)!=unordered_pair(X1,X1)|unordered_pair(esk19_0,esk20_0)!=unordered_pair(esk19_0,esk19_0)),inference(spm,[status(thm)],[398,8877,theory(equality)])).
% cnf(9026,negated_conjecture,(esk18_0=esk19_0|unordered_pair(esk19_0,esk20_0)!=unordered_pair(esk19_0,esk19_0)),inference(er,[status(thm)],[8910,theory(equality)])).
% cnf(9044,negated_conjecture,(esk19_0!=esk20_0|unordered_pair(esk19_0,esk20_0)!=unordered_pair(esk19_0,esk19_0)),inference(spm,[status(thm)],[3116,9026,theory(equality)])).
% cnf(9061,negated_conjecture,(in(esk18_0,unordered_pair(esk19_0,esk19_0))|in(esk18_0,unordered_pair(esk19_0,esk20_0))),inference(spm,[status(thm)],[532,8890,theory(equality)])).
% cnf(9131,negated_conjecture,(unordered_pair(esk19_0,esk20_0)!=unordered_pair(esk19_0,esk19_0)),inference(csr,[status(thm)],[9044,477])).
% cnf(23775,negated_conjecture,(esk19_0=esk18_0|esk20_0=esk18_0|in(esk18_0,unordered_pair(esk19_0,esk19_0))),inference(spm,[status(thm)],[707,9061,theory(equality)])).
% cnf(23796,negated_conjecture,(esk18_0=esk19_0|in(esk18_0,unordered_pair(esk19_0,esk19_0))),inference(sr,[status(thm)],[23775,3116,theory(equality)])).
% cnf(23902,negated_conjecture,(esk18_0=esk19_0),inference(csr,[status(thm)],[23796,657])).
% cnf(23947,negated_conjecture,(unordered_pair(unordered_pair(esk19_0,esk19_0),unordered_pair(esk19_0,esk19_0))=unordered_pair(unordered_pair(esk19_0,esk19_0),unordered_pair(esk19_0,esk20_0))),inference(rw,[status(thm)],[3114,23902,theory(equality)])).
% cnf(23967,negated_conjecture,(in(unordered_pair(esk19_0,esk20_0),unordered_pair(unordered_pair(esk19_0,esk19_0),unordered_pair(esk19_0,esk19_0)))),inference(spm,[status(thm)],[532,23947,theory(equality)])).
% cnf(24097,negated_conjecture,(unordered_pair(esk19_0,esk19_0)=unordered_pair(esk19_0,esk20_0)),inference(spm,[status(thm)],[657,23967,theory(equality)])).
% cnf(24167,negated_conjecture,($false),inference(sr,[status(thm)],[24097,9131,theory(equality)])).
% cnf(24168,negated_conjecture,($false),24167,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2176
% # ...of these trivial : 59
% # ...subsumed : 1485
% # ...remaining for further processing: 632
% # Other redundant clauses eliminated : 194
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 20
% # Backward-rewritten : 56
% # Generated clauses : 17155
% # ...of the previous two non-trivial : 13680
% # Contextual simplify-reflections : 52
% # Paramodulations : 16882
% # Factorizations : 24
% # Equation resolutions : 249
% # Current number of processed clauses: 437
% # Positive orientable unit clauses: 92
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 55
% # Non-unit-clauses : 285
% # Current number of unprocessed clauses: 9844
% # ...number of literals in the above : 34769
% # Clause-clause subsumption calls (NU) : 4808
% # Rec. Clause-clause subsumption calls : 4390
% # Unit Clause-clause subsumption calls : 529
% # Rewrite failures with RHS unbound : 24
% # Indexed BW rewrite attempts : 139
% # Indexed BW rewrite successes : 48
% # Backwards rewriting index: 244 leaves, 1.70+/-1.683 terms/leaf
% # Paramod-from index: 137 leaves, 1.46+/-0.820 terms/leaf
% # Paramod-into index: 227 leaves, 1.69+/-1.541 terms/leaf
% # -------------------------------------------------
% # User time : 0.553 s
% # System time : 0.017 s
% # Total time : 0.570 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.95 CPU 1.05 WC
% FINAL PrfWatch: 0.95 CPU 1.05 WC
% SZS output end Solution for /tmp/SystemOnTPTP21270/SEU156+2.tptp
%
%------------------------------------------------------------------------------