TSTP Solution File: NUM607+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM607+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 20:40:57 EST 2010
% Result : Theorem 2.55s
% Output : Solution 2.55s
% 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/SystemOnTPTP12537/NUM607+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12537/NUM607+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12537/NUM607+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 12669
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X1]:(aSet0(X1)=>![X2]:(aSubsetOf0(X2,X1)<=>(aSet0(X2)&![X3]:(aElementOf0(X3,X2)=>aElementOf0(X3,X1))))),file('/tmp/SRASS.s.p', mDefSub)).
% fof(7, axiom,![X1]:(aSet0(X1)=>aSubsetOf0(X1,X1)),file('/tmp/SRASS.s.p', mSubRefl)).
% fof(9, axiom,![X1]:![X2]:![X3]:(((aSet0(X1)&aSet0(X2))&aSet0(X3))=>((aSubsetOf0(X1,X2)&aSubsetOf0(X2,X3))=>aSubsetOf0(X1,X3))),file('/tmp/SRASS.s.p', mSubTrans)).
% fof(11, axiom,(aSet0(szNzAzT0)&isCountable0(szNzAzT0)),file('/tmp/SRASS.s.p', mNATSet)).
% fof(38, axiom,aElementOf0(xK,szNzAzT0),file('/tmp/SRASS.s.p', m__3418)).
% fof(39, axiom,(aSubsetOf0(xS,szNzAzT0)&isCountable0(xS)),file('/tmp/SRASS.s.p', m__3435)).
% fof(40, axiom,((aFunction0(xc)&szDzozmdt0(xc)=slbdtsldtrb0(xS,xK))&aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT)),file('/tmp/SRASS.s.p', m__3453)).
% fof(59, axiom,(aSet0(xO)&xO=sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd)))),file('/tmp/SRASS.s.p', m__4891)).
% fof(62, axiom,aSubsetOf0(xO,xS),file('/tmp/SRASS.s.p', m__4998)).
% fof(63, axiom,aElementOf0(xQ,slbdtsldtrb0(xO,xK)),file('/tmp/SRASS.s.p', m__5078)).
% fof(64, axiom,(aSubsetOf0(xQ,xO)&~(xQ=slcrc0)),file('/tmp/SRASS.s.p', m__5093)).
% fof(75, axiom,![X1]:![X2]:((aSet0(X1)&aElementOf0(X2,szNzAzT0))=>![X3]:(X3=slbdtsldtrb0(X1,X2)<=>(aSet0(X3)&![X4]:(aElementOf0(X4,X3)<=>(aSubsetOf0(X4,X1)&sbrdtbr0(X4)=X2))))),file('/tmp/SRASS.s.p', mDefSel)).
% fof(102, conjecture,aElementOf0(xQ,szDzozmdt0(xc)),file('/tmp/SRASS.s.p', m__)).
% fof(103, negated_conjecture,~(aElementOf0(xQ,szDzozmdt0(xc))),inference(assume_negation,[status(cth)],[102])).
% fof(116, negated_conjecture,~(aElementOf0(xQ,szDzozmdt0(xc))),inference(fof_simplification,[status(thm)],[103,theory(equality)])).
% fof(132, plain,![X1]:(~(aSet0(X1))|![X2]:((~(aSubsetOf0(X2,X1))|(aSet0(X2)&![X3]:(~(aElementOf0(X3,X2))|aElementOf0(X3,X1))))&((~(aSet0(X2))|?[X3]:(aElementOf0(X3,X2)&~(aElementOf0(X3,X1))))|aSubsetOf0(X2,X1)))),inference(fof_nnf,[status(thm)],[5])).
% fof(133, plain,![X4]:(~(aSet0(X4))|![X5]:((~(aSubsetOf0(X5,X4))|(aSet0(X5)&![X6]:(~(aElementOf0(X6,X5))|aElementOf0(X6,X4))))&((~(aSet0(X5))|?[X7]:(aElementOf0(X7,X5)&~(aElementOf0(X7,X4))))|aSubsetOf0(X5,X4)))),inference(variable_rename,[status(thm)],[132])).
% fof(134, plain,![X4]:(~(aSet0(X4))|![X5]:((~(aSubsetOf0(X5,X4))|(aSet0(X5)&![X6]:(~(aElementOf0(X6,X5))|aElementOf0(X6,X4))))&((~(aSet0(X5))|(aElementOf0(esk2_2(X4,X5),X5)&~(aElementOf0(esk2_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))),inference(skolemize,[status(esa)],[133])).
% fof(135, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))&aSet0(X5))|~(aSubsetOf0(X5,X4)))&((~(aSet0(X5))|(aElementOf0(esk2_2(X4,X5),X5)&~(aElementOf0(esk2_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))|~(aSet0(X4))),inference(shift_quantors,[status(thm)],[134])).
% fof(136, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))|~(aSubsetOf0(X5,X4)))|~(aSet0(X4)))&((aSet0(X5)|~(aSubsetOf0(X5,X4)))|~(aSet0(X4))))&((((aElementOf0(esk2_2(X4,X5),X5)|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4)))&(((~(aElementOf0(esk2_2(X4,X5),X4))|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4))))),inference(distribute,[status(thm)],[135])).
% cnf(139,plain,(aSet0(X2)|~aSet0(X1)|~aSubsetOf0(X2,X1)),inference(split_conjunct,[status(thm)],[136])).
% fof(145, plain,![X1]:(~(aSet0(X1))|aSubsetOf0(X1,X1)),inference(fof_nnf,[status(thm)],[7])).
% fof(146, plain,![X2]:(~(aSet0(X2))|aSubsetOf0(X2,X2)),inference(variable_rename,[status(thm)],[145])).
% cnf(147,plain,(aSubsetOf0(X1,X1)|~aSet0(X1)),inference(split_conjunct,[status(thm)],[146])).
% fof(151, plain,![X1]:![X2]:![X3]:(((~(aSet0(X1))|~(aSet0(X2)))|~(aSet0(X3)))|((~(aSubsetOf0(X1,X2))|~(aSubsetOf0(X2,X3)))|aSubsetOf0(X1,X3))),inference(fof_nnf,[status(thm)],[9])).
% fof(152, plain,![X4]:![X5]:![X6]:(((~(aSet0(X4))|~(aSet0(X5)))|~(aSet0(X6)))|((~(aSubsetOf0(X4,X5))|~(aSubsetOf0(X5,X6)))|aSubsetOf0(X4,X6))),inference(variable_rename,[status(thm)],[151])).
% cnf(153,plain,(aSubsetOf0(X1,X2)|~aSubsetOf0(X3,X2)|~aSubsetOf0(X1,X3)|~aSet0(X2)|~aSet0(X3)|~aSet0(X1)),inference(split_conjunct,[status(thm)],[152])).
% cnf(159,plain,(aSet0(szNzAzT0)),inference(split_conjunct,[status(thm)],[11])).
% cnf(273,plain,(aElementOf0(xK,szNzAzT0)),inference(split_conjunct,[status(thm)],[38])).
% cnf(275,plain,(aSubsetOf0(xS,szNzAzT0)),inference(split_conjunct,[status(thm)],[39])).
% cnf(277,plain,(szDzozmdt0(xc)=slbdtsldtrb0(xS,xK)),inference(split_conjunct,[status(thm)],[40])).
% cnf(364,plain,(aSet0(xO)),inference(split_conjunct,[status(thm)],[59])).
% cnf(374,plain,(aSubsetOf0(xO,xS)),inference(split_conjunct,[status(thm)],[62])).
% cnf(375,plain,(aElementOf0(xQ,slbdtsldtrb0(xO,xK))),inference(split_conjunct,[status(thm)],[63])).
% cnf(377,plain,(aSubsetOf0(xQ,xO)),inference(split_conjunct,[status(thm)],[64])).
% fof(443, plain,![X1]:![X2]:((~(aSet0(X1))|~(aElementOf0(X2,szNzAzT0)))|![X3]:((~(X3=slbdtsldtrb0(X1,X2))|(aSet0(X3)&![X4]:((~(aElementOf0(X4,X3))|(aSubsetOf0(X4,X1)&sbrdtbr0(X4)=X2))&((~(aSubsetOf0(X4,X1))|~(sbrdtbr0(X4)=X2))|aElementOf0(X4,X3)))))&((~(aSet0(X3))|?[X4]:((~(aElementOf0(X4,X3))|(~(aSubsetOf0(X4,X1))|~(sbrdtbr0(X4)=X2)))&(aElementOf0(X4,X3)|(aSubsetOf0(X4,X1)&sbrdtbr0(X4)=X2))))|X3=slbdtsldtrb0(X1,X2)))),inference(fof_nnf,[status(thm)],[75])).
% fof(444, plain,![X5]:![X6]:((~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))|![X7]:((~(X7=slbdtsldtrb0(X5,X6))|(aSet0(X7)&![X8]:((~(aElementOf0(X8,X7))|(aSubsetOf0(X8,X5)&sbrdtbr0(X8)=X6))&((~(aSubsetOf0(X8,X5))|~(sbrdtbr0(X8)=X6))|aElementOf0(X8,X7)))))&((~(aSet0(X7))|?[X9]:((~(aElementOf0(X9,X7))|(~(aSubsetOf0(X9,X5))|~(sbrdtbr0(X9)=X6)))&(aElementOf0(X9,X7)|(aSubsetOf0(X9,X5)&sbrdtbr0(X9)=X6))))|X7=slbdtsldtrb0(X5,X6)))),inference(variable_rename,[status(thm)],[443])).
% fof(445, plain,![X5]:![X6]:((~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))|![X7]:((~(X7=slbdtsldtrb0(X5,X6))|(aSet0(X7)&![X8]:((~(aElementOf0(X8,X7))|(aSubsetOf0(X8,X5)&sbrdtbr0(X8)=X6))&((~(aSubsetOf0(X8,X5))|~(sbrdtbr0(X8)=X6))|aElementOf0(X8,X7)))))&((~(aSet0(X7))|((~(aElementOf0(esk22_3(X5,X6,X7),X7))|(~(aSubsetOf0(esk22_3(X5,X6,X7),X5))|~(sbrdtbr0(esk22_3(X5,X6,X7))=X6)))&(aElementOf0(esk22_3(X5,X6,X7),X7)|(aSubsetOf0(esk22_3(X5,X6,X7),X5)&sbrdtbr0(esk22_3(X5,X6,X7))=X6))))|X7=slbdtsldtrb0(X5,X6)))),inference(skolemize,[status(esa)],[444])).
% fof(446, plain,![X5]:![X6]:![X7]:![X8]:((((((~(aElementOf0(X8,X7))|(aSubsetOf0(X8,X5)&sbrdtbr0(X8)=X6))&((~(aSubsetOf0(X8,X5))|~(sbrdtbr0(X8)=X6))|aElementOf0(X8,X7)))&aSet0(X7))|~(X7=slbdtsldtrb0(X5,X6)))&((~(aSet0(X7))|((~(aElementOf0(esk22_3(X5,X6,X7),X7))|(~(aSubsetOf0(esk22_3(X5,X6,X7),X5))|~(sbrdtbr0(esk22_3(X5,X6,X7))=X6)))&(aElementOf0(esk22_3(X5,X6,X7),X7)|(aSubsetOf0(esk22_3(X5,X6,X7),X5)&sbrdtbr0(esk22_3(X5,X6,X7))=X6))))|X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))),inference(shift_quantors,[status(thm)],[445])).
% fof(447, plain,![X5]:![X6]:![X7]:![X8]:(((((((aSubsetOf0(X8,X5)|~(aElementOf0(X8,X7)))|~(X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))&(((sbrdtbr0(X8)=X6|~(aElementOf0(X8,X7)))|~(X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))))&((((~(aSubsetOf0(X8,X5))|~(sbrdtbr0(X8)=X6))|aElementOf0(X8,X7))|~(X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))))&((aSet0(X7)|~(X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))))&(((((~(aElementOf0(esk22_3(X5,X6,X7),X7))|(~(aSubsetOf0(esk22_3(X5,X6,X7),X5))|~(sbrdtbr0(esk22_3(X5,X6,X7))=X6)))|~(aSet0(X7)))|X7=slbdtsldtrb0(X5,X6))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))&(((((aSubsetOf0(esk22_3(X5,X6,X7),X5)|aElementOf0(esk22_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=slbdtsldtrb0(X5,X6))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))&((((sbrdtbr0(esk22_3(X5,X6,X7))=X6|aElementOf0(esk22_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=slbdtsldtrb0(X5,X6))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))))),inference(distribute,[status(thm)],[446])).
% cnf(452,plain,(aElementOf0(X4,X3)|~aElementOf0(X1,szNzAzT0)|~aSet0(X2)|X3!=slbdtsldtrb0(X2,X1)|sbrdtbr0(X4)!=X1|~aSubsetOf0(X4,X2)),inference(split_conjunct,[status(thm)],[447])).
% cnf(453,plain,(sbrdtbr0(X4)=X1|~aElementOf0(X1,szNzAzT0)|~aSet0(X2)|X3!=slbdtsldtrb0(X2,X1)|~aElementOf0(X4,X3)),inference(split_conjunct,[status(thm)],[447])).
% cnf(566,negated_conjecture,(~aElementOf0(xQ,szDzozmdt0(xc))),inference(split_conjunct,[status(thm)],[116])).
% cnf(580,plain,(aSubsetOf0(X1,X2)|~aSubsetOf0(X3,X2)|~aSubsetOf0(X1,X3)|~aSet0(X3)|~aSet0(X2)),inference(csr,[status(thm)],[153,139])).
% cnf(581,plain,(aSubsetOf0(X1,X2)|~aSubsetOf0(X3,X2)|~aSubsetOf0(X1,X3)|~aSet0(X2)),inference(csr,[status(thm)],[580,139])).
% cnf(647,plain,(aSet0(xQ)|~aSet0(xO)),inference(spm,[status(thm)],[139,377,theory(equality)])).
% cnf(650,plain,(aSet0(xS)|~aSet0(szNzAzT0)),inference(spm,[status(thm)],[139,275,theory(equality)])).
% cnf(653,plain,(aSet0(xQ)|$false),inference(rw,[status(thm)],[647,364,theory(equality)])).
% cnf(654,plain,(aSet0(xQ)),inference(cn,[status(thm)],[653,theory(equality)])).
% cnf(658,plain,(aSet0(xS)|$false),inference(rw,[status(thm)],[650,159,theory(equality)])).
% cnf(659,plain,(aSet0(xS)),inference(cn,[status(thm)],[658,theory(equality)])).
% cnf(970,plain,(aSubsetOf0(X1,xS)|~aSubsetOf0(X1,xO)|~aSet0(xS)),inference(spm,[status(thm)],[581,374,theory(equality)])).
% cnf(1099,plain,(sbrdtbr0(X1)=X2|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,slbdtsldtrb0(X3,X2))|~aSet0(X3)),inference(er,[status(thm)],[453,theory(equality)])).
% cnf(1432,plain,(aElementOf0(X1,X2)|szDzozmdt0(xc)!=X2|sbrdtbr0(X1)!=xK|~aSubsetOf0(X1,xS)|~aElementOf0(xK,szNzAzT0)|~aSet0(xS)),inference(spm,[status(thm)],[452,277,theory(equality)])).
% cnf(1433,plain,(aElementOf0(X1,X2)|szDzozmdt0(xc)!=X2|sbrdtbr0(X1)!=xK|~aSubsetOf0(X1,xS)|$false|~aSet0(xS)),inference(rw,[status(thm)],[1432,273,theory(equality)])).
% cnf(1434,plain,(aElementOf0(X1,X2)|szDzozmdt0(xc)!=X2|sbrdtbr0(X1)!=xK|~aSubsetOf0(X1,xS)|~aSet0(xS)),inference(cn,[status(thm)],[1433,theory(equality)])).
% cnf(3898,plain,(aSubsetOf0(X1,xS)|~aSubsetOf0(X1,xO)|$false),inference(rw,[status(thm)],[970,659,theory(equality)])).
% cnf(3899,plain,(aSubsetOf0(X1,xS)|~aSubsetOf0(X1,xO)),inference(cn,[status(thm)],[3898,theory(equality)])).
% cnf(3908,plain,(aSubsetOf0(X1,xS)|~aSubsetOf0(X1,X2)|~aSet0(xS)|~aSubsetOf0(X2,xO)),inference(spm,[status(thm)],[581,3899,theory(equality)])).
% cnf(3918,plain,(aSubsetOf0(X1,xS)|~aSubsetOf0(X1,X2)|$false|~aSubsetOf0(X2,xO)),inference(rw,[status(thm)],[3908,659,theory(equality)])).
% cnf(3919,plain,(aSubsetOf0(X1,xS)|~aSubsetOf0(X1,X2)|~aSubsetOf0(X2,xO)),inference(cn,[status(thm)],[3918,theory(equality)])).
% cnf(6193,plain,(aSubsetOf0(X1,xS)|~aSubsetOf0(X1,xQ)),inference(spm,[status(thm)],[3919,377,theory(equality)])).
% cnf(6250,plain,(aSubsetOf0(xQ,xS)|~aSet0(xQ)),inference(spm,[status(thm)],[6193,147,theory(equality)])).
% cnf(6258,plain,(aSubsetOf0(xQ,xS)|$false),inference(rw,[status(thm)],[6250,654,theory(equality)])).
% cnf(6259,plain,(aSubsetOf0(xQ,xS)),inference(cn,[status(thm)],[6258,theory(equality)])).
% cnf(8738,plain,(sbrdtbr0(xQ)=xK|~aElementOf0(xK,szNzAzT0)|~aSet0(xO)),inference(spm,[status(thm)],[1099,375,theory(equality)])).
% cnf(8745,plain,(sbrdtbr0(xQ)=xK|$false|~aSet0(xO)),inference(rw,[status(thm)],[8738,273,theory(equality)])).
% cnf(8746,plain,(sbrdtbr0(xQ)=xK|$false|$false),inference(rw,[status(thm)],[8745,364,theory(equality)])).
% cnf(8747,plain,(sbrdtbr0(xQ)=xK),inference(cn,[status(thm)],[8746,theory(equality)])).
% cnf(21073,plain,(aElementOf0(X1,X2)|szDzozmdt0(xc)!=X2|sbrdtbr0(X1)!=xK|~aSubsetOf0(X1,xS)|$false),inference(rw,[status(thm)],[1434,659,theory(equality)])).
% cnf(21074,plain,(aElementOf0(X1,X2)|szDzozmdt0(xc)!=X2|sbrdtbr0(X1)!=xK|~aSubsetOf0(X1,xS)),inference(cn,[status(thm)],[21073,theory(equality)])).
% cnf(21075,plain,(aElementOf0(X1,szDzozmdt0(xc))|sbrdtbr0(X1)!=xK|~aSubsetOf0(X1,xS)),inference(er,[status(thm)],[21074,theory(equality)])).
% cnf(21083,plain,(aElementOf0(xQ,szDzozmdt0(xc))|~aSubsetOf0(xQ,xS)),inference(spm,[status(thm)],[21075,8747,theory(equality)])).
% cnf(21090,plain,(aElementOf0(xQ,szDzozmdt0(xc))|$false),inference(rw,[status(thm)],[21083,6259,theory(equality)])).
% cnf(21091,plain,(aElementOf0(xQ,szDzozmdt0(xc))),inference(cn,[status(thm)],[21090,theory(equality)])).
% cnf(21092,plain,($false),inference(sr,[status(thm)],[21091,566,theory(equality)])).
% cnf(21093,plain,($false),21092,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 3677
% # ...of these trivial : 41
% # ...subsumed : 1937
% # ...remaining for further processing: 1699
% # Other redundant clauses eliminated : 30
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 135
% # Backward-rewritten : 13
% # Generated clauses : 10806
% # ...of the previous two non-trivial : 10053
% # Contextual simplify-reflections : 1121
% # Paramodulations : 10676
% # Factorizations : 0
% # Equation resolutions : 130
% # Current number of processed clauses: 1352
% # Positive orientable unit clauses: 120
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 63
% # Non-unit-clauses : 1169
% # Current number of unprocessed clauses: 6189
% # ...number of literals in the above : 36662
% # Clause-clause subsumption calls (NU) : 82191
% # Rec. Clause-clause subsumption calls : 26467
% # Unit Clause-clause subsumption calls : 5214
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 1148 leaves, 1.23+/-0.813 terms/leaf
% # Paramod-from index: 491 leaves, 1.02+/-0.141 terms/leaf
% # Paramod-into index: 917 leaves, 1.16+/-0.602 terms/leaf
% # -------------------------------------------------
% # User time : 0.909 s
% # System time : 0.036 s
% # Total time : 0.945 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.32 CPU 1.40 WC
% FINAL PrfWatch: 1.32 CPU 1.40 WC
% SZS output end Solution for /tmp/SystemOnTPTP12537/NUM607+1.tptp
%
%------------------------------------------------------------------------------