TSTP Solution File: RNG098+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG098+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 : 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 22:34:03 EST 2010
% Result : Theorem 1.65s
% Output : Solution 1.65s
% 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/SystemOnTPTP4171/RNG098+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP4171/RNG098+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4171/RNG098+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 4267
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,aElement0(sz10),file('/tmp/SRASS.s.p', mSortsC_01)).
% fof(2, axiom,![X1]:(aElement0(X1)=>aElement0(smndt0(X1))),file('/tmp/SRASS.s.p', mSortsU)).
% fof(10, axiom,![X1]:![X2]:![X3]:(((aElement0(X1)&aElement0(X2))&aElement0(X3))=>(sdtasdt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))&sdtasdt0(sdtpldt0(X2,X3),X1)=sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)))),file('/tmp/SRASS.s.p', mAMDistr)).
% fof(11, axiom,![X1]:(aElement0(X1)=>(sdtasdt0(smndt0(sz10),X1)=smndt0(X1)&smndt0(X1)=sdtasdt0(X1,smndt0(sz10)))),file('/tmp/SRASS.s.p', mMulMnOne)).
% fof(12, axiom,![X1]:(aSet0(X1)=>![X2]:(aElementOf0(X2,X1)=>aElement0(X2))),file('/tmp/SRASS.s.p', mEOfElem)).
% fof(15, axiom,![X1]:(aIdeal0(X1)<=>(aSet0(X1)&![X2]:(aElementOf0(X2,X1)=>(![X3]:(aElementOf0(X3,X1)=>aElementOf0(sdtpldt0(X2,X3),X1))&![X3]:(aElement0(X3)=>aElementOf0(sdtasdt0(X3,X2),X1)))))),file('/tmp/SRASS.s.p', mDefIdeal)).
% fof(17, axiom,(((((aSet0(xI)&![X1]:(aElementOf0(X1,xI)=>(![X2]:(aElementOf0(X2,xI)=>aElementOf0(sdtpldt0(X1,X2),xI))&![X2]:(aElement0(X2)=>aElementOf0(sdtasdt0(X2,X1),xI)))))&aIdeal0(xI))&aSet0(xJ))&![X1]:(aElementOf0(X1,xJ)=>(![X2]:(aElementOf0(X2,xJ)=>aElementOf0(sdtpldt0(X1,X2),xJ))&![X2]:(aElement0(X2)=>aElementOf0(sdtasdt0(X2,X1),xJ)))))&aIdeal0(xJ)),file('/tmp/SRASS.s.p', m__1205)).
% fof(19, axiom,(aElement0(xx)&aElement0(xy)),file('/tmp/SRASS.s.p', m__1217)).
% fof(20, axiom,((aElementOf0(xa,xI)&aElementOf0(xb,xJ))&sdtpldt0(xa,xb)=sz10),file('/tmp/SRASS.s.p', m__1294)).
% fof(22, axiom,sdtpldt0(xw,smndt0(xx))=sdtpldt0(sdtasdt0(xy,xa),sdtpldt0(sdtasdt0(xx,xb),smndt0(xx))),file('/tmp/SRASS.s.p', m__1374)).
% fof(23, axiom,aElementOf0(sdtasdt0(xx,sdtpldt0(xb,smndt0(sz10))),xI),file('/tmp/SRASS.s.p', m__1393)).
% fof(35, conjecture,aElementOf0(sdtpldt0(xw,smndt0(xx)),xI),file('/tmp/SRASS.s.p', m__)).
% fof(36, negated_conjecture,~(aElementOf0(sdtpldt0(xw,smndt0(xx)),xI)),inference(assume_negation,[status(cth)],[35])).
% fof(39, negated_conjecture,~(aElementOf0(sdtpldt0(xw,smndt0(xx)),xI)),inference(fof_simplification,[status(thm)],[36,theory(equality)])).
% cnf(40,plain,(aElement0(sz10)),inference(split_conjunct,[status(thm)],[1])).
% fof(41, plain,![X1]:(~(aElement0(X1))|aElement0(smndt0(X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(42, plain,![X2]:(~(aElement0(X2))|aElement0(smndt0(X2))),inference(variable_rename,[status(thm)],[41])).
% cnf(43,plain,(aElement0(smndt0(X1))|~aElement0(X1)),inference(split_conjunct,[status(thm)],[42])).
% fof(67, plain,![X1]:![X2]:![X3]:(((~(aElement0(X1))|~(aElement0(X2)))|~(aElement0(X3)))|(sdtasdt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))&sdtasdt0(sdtpldt0(X2,X3),X1)=sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)))),inference(fof_nnf,[status(thm)],[10])).
% fof(68, plain,![X4]:![X5]:![X6]:(((~(aElement0(X4))|~(aElement0(X5)))|~(aElement0(X6)))|(sdtasdt0(X4,sdtpldt0(X5,X6))=sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))&sdtasdt0(sdtpldt0(X5,X6),X4)=sdtpldt0(sdtasdt0(X5,X4),sdtasdt0(X6,X4)))),inference(variable_rename,[status(thm)],[67])).
% fof(69, plain,![X4]:![X5]:![X6]:((sdtasdt0(X4,sdtpldt0(X5,X6))=sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))|((~(aElement0(X4))|~(aElement0(X5)))|~(aElement0(X6))))&(sdtasdt0(sdtpldt0(X5,X6),X4)=sdtpldt0(sdtasdt0(X5,X4),sdtasdt0(X6,X4))|((~(aElement0(X4))|~(aElement0(X5)))|~(aElement0(X6))))),inference(distribute,[status(thm)],[68])).
% cnf(71,plain,(sdtasdt0(X3,sdtpldt0(X2,X1))=sdtpldt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))|~aElement0(X1)|~aElement0(X2)|~aElement0(X3)),inference(split_conjunct,[status(thm)],[69])).
% fof(72, plain,![X1]:(~(aElement0(X1))|(sdtasdt0(smndt0(sz10),X1)=smndt0(X1)&smndt0(X1)=sdtasdt0(X1,smndt0(sz10)))),inference(fof_nnf,[status(thm)],[11])).
% fof(73, plain,![X2]:(~(aElement0(X2))|(sdtasdt0(smndt0(sz10),X2)=smndt0(X2)&smndt0(X2)=sdtasdt0(X2,smndt0(sz10)))),inference(variable_rename,[status(thm)],[72])).
% fof(74, plain,![X2]:((sdtasdt0(smndt0(sz10),X2)=smndt0(X2)|~(aElement0(X2)))&(smndt0(X2)=sdtasdt0(X2,smndt0(sz10))|~(aElement0(X2)))),inference(distribute,[status(thm)],[73])).
% cnf(75,plain,(smndt0(X1)=sdtasdt0(X1,smndt0(sz10))|~aElement0(X1)),inference(split_conjunct,[status(thm)],[74])).
% fof(77, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|aElement0(X2))),inference(fof_nnf,[status(thm)],[12])).
% fof(78, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|aElement0(X4))),inference(variable_rename,[status(thm)],[77])).
% fof(79, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|aElement0(X4))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[78])).
% cnf(80,plain,(aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[79])).
% fof(103, plain,![X1]:((~(aIdeal0(X1))|(aSet0(X1)&![X2]:(~(aElementOf0(X2,X1))|(![X3]:(~(aElementOf0(X3,X1))|aElementOf0(sdtpldt0(X2,X3),X1))&![X3]:(~(aElement0(X3))|aElementOf0(sdtasdt0(X3,X2),X1))))))&((~(aSet0(X1))|?[X2]:(aElementOf0(X2,X1)&(?[X3]:(aElementOf0(X3,X1)&~(aElementOf0(sdtpldt0(X2,X3),X1)))|?[X3]:(aElement0(X3)&~(aElementOf0(sdtasdt0(X3,X2),X1))))))|aIdeal0(X1))),inference(fof_nnf,[status(thm)],[15])).
% fof(104, plain,![X4]:((~(aIdeal0(X4))|(aSet0(X4)&![X5]:(~(aElementOf0(X5,X4))|(![X6]:(~(aElementOf0(X6,X4))|aElementOf0(sdtpldt0(X5,X6),X4))&![X7]:(~(aElement0(X7))|aElementOf0(sdtasdt0(X7,X5),X4))))))&((~(aSet0(X4))|?[X8]:(aElementOf0(X8,X4)&(?[X9]:(aElementOf0(X9,X4)&~(aElementOf0(sdtpldt0(X8,X9),X4)))|?[X10]:(aElement0(X10)&~(aElementOf0(sdtasdt0(X10,X8),X4))))))|aIdeal0(X4))),inference(variable_rename,[status(thm)],[103])).
% fof(105, plain,![X4]:((~(aIdeal0(X4))|(aSet0(X4)&![X5]:(~(aElementOf0(X5,X4))|(![X6]:(~(aElementOf0(X6,X4))|aElementOf0(sdtpldt0(X5,X6),X4))&![X7]:(~(aElement0(X7))|aElementOf0(sdtasdt0(X7,X5),X4))))))&((~(aSet0(X4))|(aElementOf0(esk8_1(X4),X4)&((aElementOf0(esk9_1(X4),X4)&~(aElementOf0(sdtpldt0(esk8_1(X4),esk9_1(X4)),X4)))|(aElement0(esk10_1(X4))&~(aElementOf0(sdtasdt0(esk10_1(X4),esk8_1(X4)),X4))))))|aIdeal0(X4))),inference(skolemize,[status(esa)],[104])).
% fof(106, plain,![X4]:![X5]:![X6]:![X7]:((((((~(aElement0(X7))|aElementOf0(sdtasdt0(X7,X5),X4))&(~(aElementOf0(X6,X4))|aElementOf0(sdtpldt0(X5,X6),X4)))|~(aElementOf0(X5,X4)))&aSet0(X4))|~(aIdeal0(X4)))&((~(aSet0(X4))|(aElementOf0(esk8_1(X4),X4)&((aElementOf0(esk9_1(X4),X4)&~(aElementOf0(sdtpldt0(esk8_1(X4),esk9_1(X4)),X4)))|(aElement0(esk10_1(X4))&~(aElementOf0(sdtasdt0(esk10_1(X4),esk8_1(X4)),X4))))))|aIdeal0(X4))),inference(shift_quantors,[status(thm)],[105])).
% fof(107, plain,![X4]:![X5]:![X6]:![X7]:((((((~(aElement0(X7))|aElementOf0(sdtasdt0(X7,X5),X4))|~(aElementOf0(X5,X4)))|~(aIdeal0(X4)))&(((~(aElementOf0(X6,X4))|aElementOf0(sdtpldt0(X5,X6),X4))|~(aElementOf0(X5,X4)))|~(aIdeal0(X4))))&(aSet0(X4)|~(aIdeal0(X4))))&(((aElementOf0(esk8_1(X4),X4)|~(aSet0(X4)))|aIdeal0(X4))&(((((aElement0(esk10_1(X4))|aElementOf0(esk9_1(X4),X4))|~(aSet0(X4)))|aIdeal0(X4))&(((~(aElementOf0(sdtasdt0(esk10_1(X4),esk8_1(X4)),X4))|aElementOf0(esk9_1(X4),X4))|~(aSet0(X4)))|aIdeal0(X4)))&((((aElement0(esk10_1(X4))|~(aElementOf0(sdtpldt0(esk8_1(X4),esk9_1(X4)),X4)))|~(aSet0(X4)))|aIdeal0(X4))&(((~(aElementOf0(sdtasdt0(esk10_1(X4),esk8_1(X4)),X4))|~(aElementOf0(sdtpldt0(esk8_1(X4),esk9_1(X4)),X4)))|~(aSet0(X4)))|aIdeal0(X4)))))),inference(distribute,[status(thm)],[106])).
% cnf(115,plain,(aElementOf0(sdtasdt0(X3,X2),X1)|~aIdeal0(X1)|~aElementOf0(X2,X1)|~aElement0(X3)),inference(split_conjunct,[status(thm)],[107])).
% fof(119, plain,(((((aSet0(xI)&![X1]:(~(aElementOf0(X1,xI))|(![X2]:(~(aElementOf0(X2,xI))|aElementOf0(sdtpldt0(X1,X2),xI))&![X2]:(~(aElement0(X2))|aElementOf0(sdtasdt0(X2,X1),xI)))))&aIdeal0(xI))&aSet0(xJ))&![X1]:(~(aElementOf0(X1,xJ))|(![X2]:(~(aElementOf0(X2,xJ))|aElementOf0(sdtpldt0(X1,X2),xJ))&![X2]:(~(aElement0(X2))|aElementOf0(sdtasdt0(X2,X1),xJ)))))&aIdeal0(xJ)),inference(fof_nnf,[status(thm)],[17])).
% fof(120, plain,(((((aSet0(xI)&![X3]:(~(aElementOf0(X3,xI))|(![X4]:(~(aElementOf0(X4,xI))|aElementOf0(sdtpldt0(X3,X4),xI))&![X5]:(~(aElement0(X5))|aElementOf0(sdtasdt0(X5,X3),xI)))))&aIdeal0(xI))&aSet0(xJ))&![X6]:(~(aElementOf0(X6,xJ))|(![X7]:(~(aElementOf0(X7,xJ))|aElementOf0(sdtpldt0(X6,X7),xJ))&![X8]:(~(aElement0(X8))|aElementOf0(sdtasdt0(X8,X6),xJ)))))&aIdeal0(xJ)),inference(variable_rename,[status(thm)],[119])).
% fof(121, plain,![X3]:![X4]:![X5]:![X6]:![X7]:![X8]:(((((~(aElement0(X8))|aElementOf0(sdtasdt0(X8,X6),xJ))&(~(aElementOf0(X7,xJ))|aElementOf0(sdtpldt0(X6,X7),xJ)))|~(aElementOf0(X6,xJ)))&((((((~(aElement0(X5))|aElementOf0(sdtasdt0(X5,X3),xI))&(~(aElementOf0(X4,xI))|aElementOf0(sdtpldt0(X3,X4),xI)))|~(aElementOf0(X3,xI)))&aSet0(xI))&aIdeal0(xI))&aSet0(xJ)))&aIdeal0(xJ)),inference(shift_quantors,[status(thm)],[120])).
% fof(122, plain,![X3]:![X4]:![X5]:![X6]:![X7]:![X8]:(((((~(aElement0(X8))|aElementOf0(sdtasdt0(X8,X6),xJ))|~(aElementOf0(X6,xJ)))&((~(aElementOf0(X7,xJ))|aElementOf0(sdtpldt0(X6,X7),xJ))|~(aElementOf0(X6,xJ))))&((((((~(aElement0(X5))|aElementOf0(sdtasdt0(X5,X3),xI))|~(aElementOf0(X3,xI)))&((~(aElementOf0(X4,xI))|aElementOf0(sdtpldt0(X3,X4),xI))|~(aElementOf0(X3,xI))))&aSet0(xI))&aIdeal0(xI))&aSet0(xJ)))&aIdeal0(xJ)),inference(distribute,[status(thm)],[121])).
% cnf(124,plain,(aSet0(xJ)),inference(split_conjunct,[status(thm)],[122])).
% cnf(125,plain,(aIdeal0(xI)),inference(split_conjunct,[status(thm)],[122])).
% cnf(127,plain,(aElementOf0(sdtpldt0(X1,X2),xI)|~aElementOf0(X1,xI)|~aElementOf0(X2,xI)),inference(split_conjunct,[status(thm)],[122])).
% cnf(139,plain,(aElement0(xy)),inference(split_conjunct,[status(thm)],[19])).
% cnf(140,plain,(aElement0(xx)),inference(split_conjunct,[status(thm)],[19])).
% cnf(142,plain,(aElementOf0(xb,xJ)),inference(split_conjunct,[status(thm)],[20])).
% cnf(143,plain,(aElementOf0(xa,xI)),inference(split_conjunct,[status(thm)],[20])).
% cnf(145,plain,(sdtpldt0(xw,smndt0(xx))=sdtpldt0(sdtasdt0(xy,xa),sdtpldt0(sdtasdt0(xx,xb),smndt0(xx)))),inference(split_conjunct,[status(thm)],[22])).
% cnf(146,plain,(aElementOf0(sdtasdt0(xx,sdtpldt0(xb,smndt0(sz10))),xI)),inference(split_conjunct,[status(thm)],[23])).
% cnf(191,negated_conjecture,(~aElementOf0(sdtpldt0(xw,smndt0(xx)),xI)),inference(split_conjunct,[status(thm)],[39])).
% cnf(212,plain,(aElement0(xb)|~aSet0(xJ)),inference(spm,[status(thm)],[80,142,theory(equality)])).
% cnf(220,plain,(aElement0(xb)|$false),inference(rw,[status(thm)],[212,124,theory(equality)])).
% cnf(221,plain,(aElement0(xb)),inference(cn,[status(thm)],[220,theory(equality)])).
% cnf(302,plain,(aElementOf0(sdtpldt0(xw,smndt0(xx)),xI)|~aElementOf0(sdtpldt0(sdtasdt0(xx,xb),smndt0(xx)),xI)|~aElementOf0(sdtasdt0(xy,xa),xI)),inference(spm,[status(thm)],[127,145,theory(equality)])).
% cnf(305,plain,(~aElementOf0(sdtpldt0(sdtasdt0(xx,xb),smndt0(xx)),xI)|~aElementOf0(sdtasdt0(xy,xa),xI)),inference(sr,[status(thm)],[302,191,theory(equality)])).
% cnf(572,plain,(sdtpldt0(sdtasdt0(X1,X2),smndt0(X1))=sdtasdt0(X1,sdtpldt0(X2,smndt0(sz10)))|~aElement0(X1)|~aElement0(X2)|~aElement0(smndt0(sz10))),inference(spm,[status(thm)],[71,75,theory(equality)])).
% cnf(28309,plain,(~aElementOf0(sdtasdt0(xx,sdtpldt0(xb,smndt0(sz10))),xI)|~aElementOf0(sdtasdt0(xy,xa),xI)|~aElement0(smndt0(sz10))|~aElement0(xx)|~aElement0(xb)),inference(spm,[status(thm)],[305,572,theory(equality)])).
% cnf(28358,plain,($false|~aElementOf0(sdtasdt0(xy,xa),xI)|~aElement0(smndt0(sz10))|~aElement0(xx)|~aElement0(xb)),inference(rw,[status(thm)],[28309,146,theory(equality)])).
% cnf(28359,plain,($false|~aElementOf0(sdtasdt0(xy,xa),xI)|~aElement0(smndt0(sz10))|$false|~aElement0(xb)),inference(rw,[status(thm)],[28358,140,theory(equality)])).
% cnf(28360,plain,($false|~aElementOf0(sdtasdt0(xy,xa),xI)|~aElement0(smndt0(sz10))|$false|$false),inference(rw,[status(thm)],[28359,221,theory(equality)])).
% cnf(28361,plain,(~aElementOf0(sdtasdt0(xy,xa),xI)|~aElement0(smndt0(sz10))),inference(cn,[status(thm)],[28360,theory(equality)])).
% cnf(28427,plain,(~aElement0(smndt0(sz10))|~aIdeal0(xI)|~aElementOf0(xa,xI)|~aElement0(xy)),inference(spm,[status(thm)],[28361,115,theory(equality)])).
% cnf(28437,plain,(~aElement0(smndt0(sz10))|$false|~aElementOf0(xa,xI)|~aElement0(xy)),inference(rw,[status(thm)],[28427,125,theory(equality)])).
% cnf(28438,plain,(~aElement0(smndt0(sz10))|$false|$false|~aElement0(xy)),inference(rw,[status(thm)],[28437,143,theory(equality)])).
% cnf(28439,plain,(~aElement0(smndt0(sz10))|$false|$false|$false),inference(rw,[status(thm)],[28438,139,theory(equality)])).
% cnf(28440,plain,(~aElement0(smndt0(sz10))),inference(cn,[status(thm)],[28439,theory(equality)])).
% cnf(28451,plain,(~aElement0(sz10)),inference(spm,[status(thm)],[28440,43,theory(equality)])).
% cnf(28452,plain,($false),inference(rw,[status(thm)],[28451,40,theory(equality)])).
% cnf(28453,plain,($false),inference(cn,[status(thm)],[28452,theory(equality)])).
% cnf(28454,plain,($false),28453,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1399
% # ...of these trivial : 48
% # ...subsumed : 715
% # ...remaining for further processing: 636
% # Other redundant clauses eliminated : 4
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 39
% # Backward-rewritten : 42
% # Generated clauses : 10254
% # ...of the previous two non-trivial : 7862
% # Contextual simplify-reflections : 238
% # Paramodulations : 10244
% # Factorizations : 0
% # Equation resolutions : 10
% # Current number of processed clauses: 478
% # Positive orientable unit clauses: 105
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 368
% # Current number of unprocessed clauses: 6090
% # ...number of literals in the above : 28224
% # Clause-clause subsumption calls (NU) : 9680
% # Rec. Clause-clause subsumption calls : 7145
% # Unit Clause-clause subsumption calls : 126
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 45
% # Indexed BW rewrite successes : 19
% # Backwards rewriting index: 506 leaves, 1.24+/-0.949 terms/leaf
% # Paramod-from index: 287 leaves, 1.09+/-0.615 terms/leaf
% # Paramod-into index: 450 leaves, 1.17+/-0.675 terms/leaf
% # -------------------------------------------------
% # User time : 0.420 s
% # System time : 0.012 s
% # Total time : 0.432 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.83 CPU 0.91 WC
% FINAL PrfWatch: 0.83 CPU 0.91 WC
% SZS output end Solution for /tmp/SystemOnTPTP4171/RNG098+2.tptp
%
%------------------------------------------------------------------------------