TSTP Solution File: NUM478+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM478+2 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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 19:27:29 EST 2010
% Result : Theorem 7.18s
% Output : Solution 7.18s
% 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/SystemOnTPTP28616/NUM478+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28616/NUM478+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28616/NUM478+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 28712
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.93 CPU 2.03 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.91 CPU 4.04 WC
% PrfWatch: 5.52 CPU 6.04 WC
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>aNaturalNumber0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB_02)).
% fof(3, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),file('/tmp/SRASS.s.p', mMulComm)).
% fof(4, axiom,![X1]:![X2]:![X3]:(((aNaturalNumber0(X1)&aNaturalNumber0(X2))&aNaturalNumber0(X3))=>sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))),file('/tmp/SRASS.s.p', mMulAsso)).
% fof(6, axiom,![X1]:(aNaturalNumber0(X1)=>(~(X1=sz00)=>![X2]:![X3]:((aNaturalNumber0(X2)&aNaturalNumber0(X3))=>((sdtasdt0(X1,X2)=sdtasdt0(X1,X3)|sdtasdt0(X2,X1)=sdtasdt0(X3,X1))=>X2=X3)))),file('/tmp/SRASS.s.p', mMulCanc)).
% fof(9, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>((~(X1=sz00)&doDivides0(X1,X2))=>![X3]:(X3=sdtsldt0(X2,X1)<=>(aNaturalNumber0(X3)&X2=sdtasdt0(X1,X3))))),file('/tmp/SRASS.s.p', mDefQuot)).
% fof(11, axiom,(aNaturalNumber0(xl)&aNaturalNumber0(xm)),file('/tmp/SRASS.s.p', m__1524)).
% fof(12, axiom,((~(xl=sz00)&?[X1]:(aNaturalNumber0(X1)&xm=sdtasdt0(xl,X1)))&doDivides0(xl,xm)),file('/tmp/SRASS.s.p', m__1524_04)).
% fof(13, axiom,aNaturalNumber0(xn),file('/tmp/SRASS.s.p', m__1553)).
% fof(39, conjecture,((aNaturalNumber0(sdtsldt0(xm,xl))&xm=sdtasdt0(xl,sdtsldt0(xm,xl)))=>(sdtasdt0(xn,xm)=sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl)))|sdtasdt0(xn,sdtsldt0(xm,xl))=sdtsldt0(sdtasdt0(xn,xm),xl))),file('/tmp/SRASS.s.p', m__)).
% fof(40, negated_conjecture,~(((aNaturalNumber0(sdtsldt0(xm,xl))&xm=sdtasdt0(xl,sdtsldt0(xm,xl)))=>(sdtasdt0(xn,xm)=sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl)))|sdtasdt0(xn,sdtsldt0(xm,xl))=sdtsldt0(sdtasdt0(xn,xm),xl)))),inference(assume_negation,[status(cth)],[39])).
% fof(44, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|aNaturalNumber0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(45, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|aNaturalNumber0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[44])).
% cnf(46,plain,(aNaturalNumber0(sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),inference(fof_nnf,[status(thm)],[3])).
% fof(48, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|sdtasdt0(X3,X4)=sdtasdt0(X4,X3)),inference(variable_rename,[status(thm)],[47])).
% cnf(49,plain,(sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[48])).
% fof(50, plain,![X1]:![X2]:![X3]:(((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|~(aNaturalNumber0(X3)))|sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))),inference(fof_nnf,[status(thm)],[4])).
% fof(51, plain,![X4]:![X5]:![X6]:(((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6)))|sdtasdt0(sdtasdt0(X4,X5),X6)=sdtasdt0(X4,sdtasdt0(X5,X6))),inference(variable_rename,[status(thm)],[50])).
% cnf(52,plain,(sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[51])).
% fof(58, plain,![X1]:(~(aNaturalNumber0(X1))|(X1=sz00|![X2]:![X3]:((~(aNaturalNumber0(X2))|~(aNaturalNumber0(X3)))|((~(sdtasdt0(X1,X2)=sdtasdt0(X1,X3))&~(sdtasdt0(X2,X1)=sdtasdt0(X3,X1)))|X2=X3)))),inference(fof_nnf,[status(thm)],[6])).
% fof(59, plain,![X4]:(~(aNaturalNumber0(X4))|(X4=sz00|![X5]:![X6]:((~(aNaturalNumber0(X5))|~(aNaturalNumber0(X6)))|((~(sdtasdt0(X4,X5)=sdtasdt0(X4,X6))&~(sdtasdt0(X5,X4)=sdtasdt0(X6,X4)))|X5=X6)))),inference(variable_rename,[status(thm)],[58])).
% fof(60, plain,![X4]:![X5]:![X6]:((((~(aNaturalNumber0(X5))|~(aNaturalNumber0(X6)))|((~(sdtasdt0(X4,X5)=sdtasdt0(X4,X6))&~(sdtasdt0(X5,X4)=sdtasdt0(X6,X4)))|X5=X6))|X4=sz00)|~(aNaturalNumber0(X4))),inference(shift_quantors,[status(thm)],[59])).
% fof(61, plain,![X4]:![X5]:![X6]:(((((~(sdtasdt0(X4,X5)=sdtasdt0(X4,X6))|X5=X6)|(~(aNaturalNumber0(X5))|~(aNaturalNumber0(X6))))|X4=sz00)|~(aNaturalNumber0(X4)))&((((~(sdtasdt0(X5,X4)=sdtasdt0(X6,X4))|X5=X6)|(~(aNaturalNumber0(X5))|~(aNaturalNumber0(X6))))|X4=sz00)|~(aNaturalNumber0(X4)))),inference(distribute,[status(thm)],[60])).
% cnf(63,plain,(X1=sz00|X3=X2|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|sdtasdt0(X1,X3)!=sdtasdt0(X1,X2)),inference(split_conjunct,[status(thm)],[61])).
% fof(75, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|((X1=sz00|~(doDivides0(X1,X2)))|![X3]:((~(X3=sdtsldt0(X2,X1))|(aNaturalNumber0(X3)&X2=sdtasdt0(X1,X3)))&((~(aNaturalNumber0(X3))|~(X2=sdtasdt0(X1,X3)))|X3=sdtsldt0(X2,X1))))),inference(fof_nnf,[status(thm)],[9])).
% fof(76, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|((X4=sz00|~(doDivides0(X4,X5)))|![X6]:((~(X6=sdtsldt0(X5,X4))|(aNaturalNumber0(X6)&X5=sdtasdt0(X4,X6)))&((~(aNaturalNumber0(X6))|~(X5=sdtasdt0(X4,X6)))|X6=sdtsldt0(X5,X4))))),inference(variable_rename,[status(thm)],[75])).
% fof(77, plain,![X4]:![X5]:![X6]:((((~(X6=sdtsldt0(X5,X4))|(aNaturalNumber0(X6)&X5=sdtasdt0(X4,X6)))&((~(aNaturalNumber0(X6))|~(X5=sdtasdt0(X4,X6)))|X6=sdtsldt0(X5,X4)))|(X4=sz00|~(doDivides0(X4,X5))))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))),inference(shift_quantors,[status(thm)],[76])).
% fof(78, plain,![X4]:![X5]:![X6]:(((((aNaturalNumber0(X6)|~(X6=sdtsldt0(X5,X4)))|(X4=sz00|~(doDivides0(X4,X5))))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&(((X5=sdtasdt0(X4,X6)|~(X6=sdtsldt0(X5,X4)))|(X4=sz00|~(doDivides0(X4,X5))))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))))&((((~(aNaturalNumber0(X6))|~(X5=sdtasdt0(X4,X6)))|X6=sdtsldt0(X5,X4))|(X4=sz00|~(doDivides0(X4,X5))))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))),inference(distribute,[status(thm)],[77])).
% cnf(80,plain,(X2=sz00|X1=sdtasdt0(X2,X3)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~doDivides0(X2,X1)|X3!=sdtsldt0(X1,X2)),inference(split_conjunct,[status(thm)],[78])).
% cnf(81,plain,(X2=sz00|aNaturalNumber0(X3)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~doDivides0(X2,X1)|X3!=sdtsldt0(X1,X2)),inference(split_conjunct,[status(thm)],[78])).
% cnf(85,plain,(aNaturalNumber0(xm)),inference(split_conjunct,[status(thm)],[11])).
% cnf(86,plain,(aNaturalNumber0(xl)),inference(split_conjunct,[status(thm)],[11])).
% fof(87, plain,((~(xl=sz00)&?[X2]:(aNaturalNumber0(X2)&xm=sdtasdt0(xl,X2)))&doDivides0(xl,xm)),inference(variable_rename,[status(thm)],[12])).
% fof(88, plain,((~(xl=sz00)&(aNaturalNumber0(esk2_0)&xm=sdtasdt0(xl,esk2_0)))&doDivides0(xl,xm)),inference(skolemize,[status(esa)],[87])).
% cnf(89,plain,(doDivides0(xl,xm)),inference(split_conjunct,[status(thm)],[88])).
% cnf(90,plain,(xm=sdtasdt0(xl,esk2_0)),inference(split_conjunct,[status(thm)],[88])).
% cnf(91,plain,(aNaturalNumber0(esk2_0)),inference(split_conjunct,[status(thm)],[88])).
% cnf(92,plain,(xl!=sz00),inference(split_conjunct,[status(thm)],[88])).
% cnf(93,plain,(aNaturalNumber0(xn)),inference(split_conjunct,[status(thm)],[13])).
% fof(198, negated_conjecture,((aNaturalNumber0(sdtsldt0(xm,xl))&xm=sdtasdt0(xl,sdtsldt0(xm,xl)))&(~(sdtasdt0(xn,xm)=sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl))))&~(sdtasdt0(xn,sdtsldt0(xm,xl))=sdtsldt0(sdtasdt0(xn,xm),xl)))),inference(fof_nnf,[status(thm)],[40])).
% cnf(200,negated_conjecture,(sdtasdt0(xn,xm)!=sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl)))),inference(split_conjunct,[status(thm)],[198])).
% cnf(201,negated_conjecture,(xm=sdtasdt0(xl,sdtsldt0(xm,xl))),inference(split_conjunct,[status(thm)],[198])).
% cnf(202,negated_conjecture,(aNaturalNumber0(sdtsldt0(xm,xl))),inference(split_conjunct,[status(thm)],[198])).
% cnf(349,plain,(sdtasdt0(X1,sdtasdt0(X2,X3))=sdtasdt0(X2,sdtasdt0(X3,X1))|~aNaturalNumber0(sdtasdt0(X2,X3))|~aNaturalNumber0(X1)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)),inference(spm,[status(thm)],[49,52,theory(equality)])).
% cnf(487,plain,(sz00=xl|X1=esk2_0|sdtasdt0(xl,X1)!=xm|~aNaturalNumber0(esk2_0)|~aNaturalNumber0(X1)|~aNaturalNumber0(xl)),inference(spm,[status(thm)],[63,90,theory(equality)])).
% cnf(507,plain,(sz00=xl|X1=esk2_0|sdtasdt0(xl,X1)!=xm|$false|~aNaturalNumber0(X1)|~aNaturalNumber0(xl)),inference(rw,[status(thm)],[487,91,theory(equality)])).
% cnf(508,plain,(sz00=xl|X1=esk2_0|sdtasdt0(xl,X1)!=xm|$false|~aNaturalNumber0(X1)|$false),inference(rw,[status(thm)],[507,86,theory(equality)])).
% cnf(509,plain,(sz00=xl|X1=esk2_0|sdtasdt0(xl,X1)!=xm|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[508,theory(equality)])).
% cnf(510,plain,(X1=esk2_0|sdtasdt0(xl,X1)!=xm|~aNaturalNumber0(X1)),inference(sr,[status(thm)],[509,92,theory(equality)])).
% cnf(1277,negated_conjecture,(sdtsldt0(xm,xl)=esk2_0|~aNaturalNumber0(sdtsldt0(xm,xl))),inference(spm,[status(thm)],[510,201,theory(equality)])).
% cnf(1292,negated_conjecture,(sdtsldt0(xm,xl)=esk2_0|$false),inference(rw,[status(thm)],[1277,202,theory(equality)])).
% cnf(1293,negated_conjecture,(sdtsldt0(xm,xl)=esk2_0),inference(cn,[status(thm)],[1292,theory(equality)])).
% cnf(1296,negated_conjecture,(sz00=xl|aNaturalNumber0(X1)|esk2_0!=X1|~doDivides0(xl,xm)|~aNaturalNumber0(xl)|~aNaturalNumber0(xm)),inference(spm,[status(thm)],[81,1293,theory(equality)])).
% cnf(1297,negated_conjecture,(sdtasdt0(xl,X1)=xm|sz00=xl|esk2_0!=X1|~doDivides0(xl,xm)|~aNaturalNumber0(xl)|~aNaturalNumber0(xm)),inference(spm,[status(thm)],[80,1293,theory(equality)])).
% cnf(1301,negated_conjecture,(sdtasdt0(xl,sdtasdt0(xn,esk2_0))!=sdtasdt0(xn,xm)),inference(rw,[status(thm)],[200,1293,theory(equality)])).
% cnf(1305,negated_conjecture,(sz00=xl|aNaturalNumber0(X1)|esk2_0!=X1|$false|~aNaturalNumber0(xl)|~aNaturalNumber0(xm)),inference(rw,[status(thm)],[1296,89,theory(equality)])).
% cnf(1306,negated_conjecture,(sz00=xl|aNaturalNumber0(X1)|esk2_0!=X1|$false|$false|~aNaturalNumber0(xm)),inference(rw,[status(thm)],[1305,86,theory(equality)])).
% cnf(1307,negated_conjecture,(sz00=xl|aNaturalNumber0(X1)|esk2_0!=X1|$false|$false|$false),inference(rw,[status(thm)],[1306,85,theory(equality)])).
% cnf(1308,negated_conjecture,(sz00=xl|aNaturalNumber0(X1)|esk2_0!=X1),inference(cn,[status(thm)],[1307,theory(equality)])).
% cnf(1309,negated_conjecture,(aNaturalNumber0(X1)|esk2_0!=X1),inference(sr,[status(thm)],[1308,92,theory(equality)])).
% cnf(1310,negated_conjecture,(sdtasdt0(xl,X1)=xm|sz00=xl|esk2_0!=X1|$false|~aNaturalNumber0(xl)|~aNaturalNumber0(xm)),inference(rw,[status(thm)],[1297,89,theory(equality)])).
% cnf(1311,negated_conjecture,(sdtasdt0(xl,X1)=xm|sz00=xl|esk2_0!=X1|$false|$false|~aNaturalNumber0(xm)),inference(rw,[status(thm)],[1310,86,theory(equality)])).
% cnf(1312,negated_conjecture,(sdtasdt0(xl,X1)=xm|sz00=xl|esk2_0!=X1|$false|$false|$false),inference(rw,[status(thm)],[1311,85,theory(equality)])).
% cnf(1313,negated_conjecture,(sdtasdt0(xl,X1)=xm|sz00=xl|esk2_0!=X1),inference(cn,[status(thm)],[1312,theory(equality)])).
% cnf(1314,negated_conjecture,(sdtasdt0(xl,X1)=xm|esk2_0!=X1),inference(sr,[status(thm)],[1313,92,theory(equality)])).
% cnf(1466,negated_conjecture,(sdtasdt0(X1,xl)=xm|~aNaturalNumber0(xl)|~aNaturalNumber0(X1)|esk2_0!=X1),inference(spm,[status(thm)],[49,1314,theory(equality)])).
% cnf(1498,negated_conjecture,(sdtasdt0(X1,xl)=xm|$false|~aNaturalNumber0(X1)|esk2_0!=X1),inference(rw,[status(thm)],[1466,86,theory(equality)])).
% cnf(1499,negated_conjecture,(sdtasdt0(X1,xl)=xm|~aNaturalNumber0(X1)|esk2_0!=X1),inference(cn,[status(thm)],[1498,theory(equality)])).
% cnf(1657,negated_conjecture,(sdtasdt0(X1,xl)=xm|esk2_0!=X1),inference(csr,[status(thm)],[1499,1309])).
% cnf(2830,plain,(sdtasdt0(X1,sdtasdt0(X2,X3))=sdtasdt0(X2,sdtasdt0(X3,X1))|~aNaturalNumber0(X1)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)),inference(csr,[status(thm)],[349,46])).
% cnf(2915,negated_conjecture,(sdtasdt0(xl,sdtasdt0(X1,X2))=sdtasdt0(X1,xm)|~aNaturalNumber0(xl)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|esk2_0!=X2),inference(spm,[status(thm)],[2830,1657,theory(equality)])).
% cnf(3011,negated_conjecture,(sdtasdt0(xl,sdtasdt0(X1,X2))=sdtasdt0(X1,xm)|$false|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|esk2_0!=X2),inference(rw,[status(thm)],[2915,86,theory(equality)])).
% cnf(3012,negated_conjecture,(sdtasdt0(xl,sdtasdt0(X1,X2))=sdtasdt0(X1,xm)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|esk2_0!=X2),inference(cn,[status(thm)],[3011,theory(equality)])).
% cnf(170088,negated_conjecture,(sdtasdt0(xl,sdtasdt0(X1,X2))=sdtasdt0(X1,xm)|esk2_0!=X2|~aNaturalNumber0(X1)),inference(csr,[status(thm)],[3012,1309])).
% cnf(170448,negated_conjecture,(~aNaturalNumber0(xn)),inference(spm,[status(thm)],[1301,170088,theory(equality)])).
% cnf(171318,negated_conjecture,($false),inference(rw,[status(thm)],[170448,93,theory(equality)])).
% cnf(171319,negated_conjecture,($false),inference(cn,[status(thm)],[171318,theory(equality)])).
% cnf(171320,negated_conjecture,($false),171319,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 6039
% # ...of these trivial : 179
% # ...subsumed : 4664
% # ...remaining for further processing: 1196
% # Other redundant clauses eliminated : 111
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 127
% # Backward-rewritten : 34
% # Generated clauses : 71600
% # ...of the previous two non-trivial : 66130
% # Contextual simplify-reflections : 2030
% # Paramodulations : 71413
% # Factorizations : 0
% # Equation resolutions : 184
% # Current number of processed clauses: 969
% # Positive orientable unit clauses: 114
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 51
% # Non-unit-clauses : 804
% # Current number of unprocessed clauses: 58211
% # ...number of literals in the above : 365108
% # Clause-clause subsumption calls (NU) : 47103
% # Rec. Clause-clause subsumption calls : 21683
% # Unit Clause-clause subsumption calls : 959
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 34
% # Indexed BW rewrite successes : 23
% # Backwards rewriting index: 592 leaves, 1.49+/-1.616 terms/leaf
% # Paramod-from index: 366 leaves, 1.20+/-0.742 terms/leaf
% # Paramod-into index: 446 leaves, 1.46+/-1.488 terms/leaf
% # -------------------------------------------------
% # User time : 3.267 s
% # System time : 0.132 s
% # Total time : 3.398 s
% # Maximum resident set size: 0 pages
% PrfWatch: 6.17 CPU 6.71 WC
% FINAL PrfWatch: 6.17 CPU 6.71 WC
% SZS output end Solution for /tmp/SystemOnTPTP28616/NUM478+2.tptp
%
%------------------------------------------------------------------------------