%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM476+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:26:39 EST 2010
% Result : Theorem 1.15s
% Output : Solution 1.15s
% 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/SystemOnTPTP28095/NUM476+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28095/NUM476+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28095/NUM476+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 28191
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.020 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,aNaturalNumber0(sz00),file('/tmp/SRASS.s.p', mSortsC)).
% fof(9, axiom,![X1]:(aNaturalNumber0(X1)=>(sdtasdt0(X1,sz00)=sz00&sz00=sdtasdt0(sz00,X1))),file('/tmp/SRASS.s.p', m_MulZero)).
% fof(13, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>(sdtpldt0(X1,X2)=sz00=>(X1=sz00&X2=sz00))),file('/tmp/SRASS.s.p', mZeroAdd)).
% fof(24, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>(doDivides0(X1,X2)<=>?[X3]:(aNaturalNumber0(X3)&X2=sdtasdt0(X1,X3)))),file('/tmp/SRASS.s.p', mDefDiv)).
% fof(28, axiom,((aNaturalNumber0(xl)&aNaturalNumber0(xm))&aNaturalNumber0(xn)),file('/tmp/SRASS.s.p', m__1324)).
% fof(29, axiom,(((?[X1]:(aNaturalNumber0(X1)&xm=sdtasdt0(xl,X1))&doDivides0(xl,xm))&?[X1]:(aNaturalNumber0(X1)&sdtpldt0(xm,xn)=sdtasdt0(xl,X1)))&doDivides0(xl,sdtpldt0(xm,xn))),file('/tmp/SRASS.s.p', m__1324_04)).
% fof(36, conjecture,((~(xl=sz00)=>?[X1]:(((aNaturalNumber0(X1)&xm=sdtasdt0(xl,X1))&X1=sdtsldt0(xm,xl))&?[X2]:(((((aNaturalNumber0(X2)&sdtpldt0(xm,xn)=sdtasdt0(xl,X2))&X2=sdtsldt0(sdtpldt0(xm,xn),xl))&?[X3]:(aNaturalNumber0(X3)&sdtpldt0(X1,X3)=X2))&sdtlseqdt0(X1,X2))&?[X3]:((((aNaturalNumber0(X3)&sdtpldt0(X1,X3)=X2)&X3=sdtmndt0(X2,X1))&sdtpldt0(sdtasdt0(xl,X1),sdtasdt0(xl,X3))=sdtpldt0(sdtasdt0(xl,X1),xn))&xn=sdtasdt0(xl,X3)))))=>(?[X1]:(aNaturalNumber0(X1)&xn=sdtasdt0(xl,X1))|doDivides0(xl,xn))),file('/tmp/SRASS.s.p', m__)).
% fof(37, negated_conjecture,~(((~(xl=sz00)=>?[X1]:(((aNaturalNumber0(X1)&xm=sdtasdt0(xl,X1))&X1=sdtsldt0(xm,xl))&?[X2]:(((((aNaturalNumber0(X2)&sdtpldt0(xm,xn)=sdtasdt0(xl,X2))&X2=sdtsldt0(sdtpldt0(xm,xn),xl))&?[X3]:(aNaturalNumber0(X3)&sdtpldt0(X1,X3)=X2))&sdtlseqdt0(X1,X2))&?[X3]:((((aNaturalNumber0(X3)&sdtpldt0(X1,X3)=X2)&X3=sdtmndt0(X2,X1))&sdtpldt0(sdtasdt0(xl,X1),sdtasdt0(xl,X3))=sdtpldt0(sdtasdt0(xl,X1),xn))&xn=sdtasdt0(xl,X3)))))=>(?[X1]:(aNaturalNumber0(X1)&xn=sdtasdt0(xl,X1))|doDivides0(xl,xn)))),inference(assume_negation,[status(cth)],[36])).
% cnf(40,plain,(aNaturalNumber0(sz00)),inference(split_conjunct,[status(thm)],[1])).
% fof(64, plain,![X1]:(~(aNaturalNumber0(X1))|(sdtasdt0(X1,sz00)=sz00&sz00=sdtasdt0(sz00,X1))),inference(fof_nnf,[status(thm)],[9])).
% fof(65, plain,![X2]:(~(aNaturalNumber0(X2))|(sdtasdt0(X2,sz00)=sz00&sz00=sdtasdt0(sz00,X2))),inference(variable_rename,[status(thm)],[64])).
% fof(66, plain,![X2]:((sdtasdt0(X2,sz00)=sz00|~(aNaturalNumber0(X2)))&(sz00=sdtasdt0(sz00,X2)|~(aNaturalNumber0(X2)))),inference(distribute,[status(thm)],[65])).
% cnf(67,plain,(sz00=sdtasdt0(sz00,X1)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[66])).
% cnf(68,plain,(sdtasdt0(X1,sz00)=sz00|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[66])).
% fof(85, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|(~(sdtpldt0(X1,X2)=sz00)|(X1=sz00&X2=sz00))),inference(fof_nnf,[status(thm)],[13])).
% fof(86, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|(~(sdtpldt0(X3,X4)=sz00)|(X3=sz00&X4=sz00))),inference(variable_rename,[status(thm)],[85])).
% fof(87, plain,![X3]:![X4]:(((X3=sz00|~(sdtpldt0(X3,X4)=sz00))|(~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4))))&((X4=sz00|~(sdtpldt0(X3,X4)=sz00))|(~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4))))),inference(distribute,[status(thm)],[86])).
% cnf(88,plain,(X1=sz00|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|sdtpldt0(X2,X1)!=sz00),inference(split_conjunct,[status(thm)],[87])).
% fof(140, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|((~(doDivides0(X1,X2))|?[X3]:(aNaturalNumber0(X3)&X2=sdtasdt0(X1,X3)))&(![X3]:(~(aNaturalNumber0(X3))|~(X2=sdtasdt0(X1,X3)))|doDivides0(X1,X2)))),inference(fof_nnf,[status(thm)],[24])).
% fof(141, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|((~(doDivides0(X4,X5))|?[X6]:(aNaturalNumber0(X6)&X5=sdtasdt0(X4,X6)))&(![X7]:(~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5)))),inference(variable_rename,[status(thm)],[140])).
% fof(142, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|((~(doDivides0(X4,X5))|(aNaturalNumber0(esk2_2(X4,X5))&X5=sdtasdt0(X4,esk2_2(X4,X5))))&(![X7]:(~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5)))),inference(skolemize,[status(esa)],[141])).
% fof(143, plain,![X4]:![X5]:![X7]:((((~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5))&(~(doDivides0(X4,X5))|(aNaturalNumber0(esk2_2(X4,X5))&X5=sdtasdt0(X4,esk2_2(X4,X5)))))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))),inference(shift_quantors,[status(thm)],[142])).
% fof(144, plain,![X4]:![X5]:![X7]:((((~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&(((aNaturalNumber0(esk2_2(X4,X5))|~(doDivides0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&((X5=sdtasdt0(X4,esk2_2(X4,X5))|~(doDivides0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))))),inference(distribute,[status(thm)],[143])).
% cnf(145,plain,(X1=sdtasdt0(X2,esk2_2(X2,X1))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~doDivides0(X2,X1)),inference(split_conjunct,[status(thm)],[144])).
% cnf(146,plain,(aNaturalNumber0(esk2_2(X2,X1))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~doDivides0(X2,X1)),inference(split_conjunct,[status(thm)],[144])).
% cnf(161,plain,(aNaturalNumber0(xn)),inference(split_conjunct,[status(thm)],[28])).
% cnf(162,plain,(aNaturalNumber0(xm)),inference(split_conjunct,[status(thm)],[28])).
% cnf(163,plain,(aNaturalNumber0(xl)),inference(split_conjunct,[status(thm)],[28])).
% fof(164, plain,(((?[X2]:(aNaturalNumber0(X2)&xm=sdtasdt0(xl,X2))&doDivides0(xl,xm))&?[X3]:(aNaturalNumber0(X3)&sdtpldt0(xm,xn)=sdtasdt0(xl,X3)))&doDivides0(xl,sdtpldt0(xm,xn))),inference(variable_rename,[status(thm)],[29])).
% fof(165, plain,((((aNaturalNumber0(esk3_0)&xm=sdtasdt0(xl,esk3_0))&doDivides0(xl,xm))&(aNaturalNumber0(esk4_0)&sdtpldt0(xm,xn)=sdtasdt0(xl,esk4_0)))&doDivides0(xl,sdtpldt0(xm,xn))),inference(skolemize,[status(esa)],[164])).
% cnf(167,plain,(sdtpldt0(xm,xn)=sdtasdt0(xl,esk4_0)),inference(split_conjunct,[status(thm)],[165])).
% cnf(168,plain,(aNaturalNumber0(esk4_0)),inference(split_conjunct,[status(thm)],[165])).
% cnf(169,plain,(doDivides0(xl,xm)),inference(split_conjunct,[status(thm)],[165])).
% fof(191, negated_conjecture,((xl=sz00|?[X1]:(((aNaturalNumber0(X1)&xm=sdtasdt0(xl,X1))&X1=sdtsldt0(xm,xl))&?[X2]:(((((aNaturalNumber0(X2)&sdtpldt0(xm,xn)=sdtasdt0(xl,X2))&X2=sdtsldt0(sdtpldt0(xm,xn),xl))&?[X3]:(aNaturalNumber0(X3)&sdtpldt0(X1,X3)=X2))&sdtlseqdt0(X1,X2))&?[X3]:((((aNaturalNumber0(X3)&sdtpldt0(X1,X3)=X2)&X3=sdtmndt0(X2,X1))&sdtpldt0(sdtasdt0(xl,X1),sdtasdt0(xl,X3))=sdtpldt0(sdtasdt0(xl,X1),xn))&xn=sdtasdt0(xl,X3)))))&(![X1]:(~(aNaturalNumber0(X1))|~(xn=sdtasdt0(xl,X1)))&~(doDivides0(xl,xn)))),inference(fof_nnf,[status(thm)],[37])).
% fof(192, negated_conjecture,((xl=sz00|?[X4]:(((aNaturalNumber0(X4)&xm=sdtasdt0(xl,X4))&X4=sdtsldt0(xm,xl))&?[X5]:(((((aNaturalNumber0(X5)&sdtpldt0(xm,xn)=sdtasdt0(xl,X5))&X5=sdtsldt0(sdtpldt0(xm,xn),xl))&?[X6]:(aNaturalNumber0(X6)&sdtpldt0(X4,X6)=X5))&sdtlseqdt0(X4,X5))&?[X7]:((((aNaturalNumber0(X7)&sdtpldt0(X4,X7)=X5)&X7=sdtmndt0(X5,X4))&sdtpldt0(sdtasdt0(xl,X4),sdtasdt0(xl,X7))=sdtpldt0(sdtasdt0(xl,X4),xn))&xn=sdtasdt0(xl,X7)))))&(![X8]:(~(aNaturalNumber0(X8))|~(xn=sdtasdt0(xl,X8)))&~(doDivides0(xl,xn)))),inference(variable_rename,[status(thm)],[191])).
% fof(193, negated_conjecture,((xl=sz00|(((aNaturalNumber0(esk5_0)&xm=sdtasdt0(xl,esk5_0))&esk5_0=sdtsldt0(xm,xl))&(((((aNaturalNumber0(esk6_0)&sdtpldt0(xm,xn)=sdtasdt0(xl,esk6_0))&esk6_0=sdtsldt0(sdtpldt0(xm,xn),xl))&(aNaturalNumber0(esk7_0)&sdtpldt0(esk5_0,esk7_0)=esk6_0))&sdtlseqdt0(esk5_0,esk6_0))&((((aNaturalNumber0(esk8_0)&sdtpldt0(esk5_0,esk8_0)=esk6_0)&esk8_0=sdtmndt0(esk6_0,esk5_0))&sdtpldt0(sdtasdt0(xl,esk5_0),sdtasdt0(xl,esk8_0))=sdtpldt0(sdtasdt0(xl,esk5_0),xn))&xn=sdtasdt0(xl,esk8_0)))))&(![X8]:(~(aNaturalNumber0(X8))|~(xn=sdtasdt0(xl,X8)))&~(doDivides0(xl,xn)))),inference(skolemize,[status(esa)],[192])).
% fof(194, negated_conjecture,![X8]:(((~(aNaturalNumber0(X8))|~(xn=sdtasdt0(xl,X8)))&~(doDivides0(xl,xn)))&(xl=sz00|(((aNaturalNumber0(esk5_0)&xm=sdtasdt0(xl,esk5_0))&esk5_0=sdtsldt0(xm,xl))&(((((aNaturalNumber0(esk6_0)&sdtpldt0(xm,xn)=sdtasdt0(xl,esk6_0))&esk6_0=sdtsldt0(sdtpldt0(xm,xn),xl))&(aNaturalNumber0(esk7_0)&sdtpldt0(esk5_0,esk7_0)=esk6_0))&sdtlseqdt0(esk5_0,esk6_0))&((((aNaturalNumber0(esk8_0)&sdtpldt0(esk5_0,esk8_0)=esk6_0)&esk8_0=sdtmndt0(esk6_0,esk5_0))&sdtpldt0(sdtasdt0(xl,esk5_0),sdtasdt0(xl,esk8_0))=sdtpldt0(sdtasdt0(xl,esk5_0),xn))&xn=sdtasdt0(xl,esk8_0)))))),inference(shift_quantors,[status(thm)],[193])).
% fof(195, negated_conjecture,![X8]:(((~(aNaturalNumber0(X8))|~(xn=sdtasdt0(xl,X8)))&~(doDivides0(xl,xn)))&((((aNaturalNumber0(esk5_0)|xl=sz00)&(xm=sdtasdt0(xl,esk5_0)|xl=sz00))&(esk5_0=sdtsldt0(xm,xl)|xl=sz00))&((((((aNaturalNumber0(esk6_0)|xl=sz00)&(sdtpldt0(xm,xn)=sdtasdt0(xl,esk6_0)|xl=sz00))&(esk6_0=sdtsldt0(sdtpldt0(xm,xn),xl)|xl=sz00))&((aNaturalNumber0(esk7_0)|xl=sz00)&(sdtpldt0(esk5_0,esk7_0)=esk6_0|xl=sz00)))&(sdtlseqdt0(esk5_0,esk6_0)|xl=sz00))&(((((aNaturalNumber0(esk8_0)|xl=sz00)&(sdtpldt0(esk5_0,esk8_0)=esk6_0|xl=sz00))&(esk8_0=sdtmndt0(esk6_0,esk5_0)|xl=sz00))&(sdtpldt0(sdtasdt0(xl,esk5_0),sdtasdt0(xl,esk8_0))=sdtpldt0(sdtasdt0(xl,esk5_0),xn)|xl=sz00))&(xn=sdtasdt0(xl,esk8_0)|xl=sz00))))),inference(distribute,[status(thm)],[194])).
% cnf(196,negated_conjecture,(xl=sz00|xn=sdtasdt0(xl,esk8_0)),inference(split_conjunct,[status(thm)],[195])).
% cnf(200,negated_conjecture,(xl=sz00|aNaturalNumber0(esk8_0)),inference(split_conjunct,[status(thm)],[195])).
% cnf(211,negated_conjecture,(xn!=sdtasdt0(xl,X1)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[195])).
% cnf(218,negated_conjecture,(xl=sz00|~aNaturalNumber0(esk8_0)),inference(spm,[status(thm)],[211,196,theory(equality)])).
% cnf(223,negated_conjecture,(sz00!=xn|~aNaturalNumber0(sz00)|~aNaturalNumber0(xl)),inference(spm,[status(thm)],[211,68,theory(equality)])).
% cnf(224,negated_conjecture,(sz00!=xn|$false|~aNaturalNumber0(xl)),inference(rw,[status(thm)],[223,40,theory(equality)])).
% cnf(225,negated_conjecture,(sz00!=xn|$false|$false),inference(rw,[status(thm)],[224,163,theory(equality)])).
% cnf(226,negated_conjecture,(sz00!=xn),inference(cn,[status(thm)],[225,theory(equality)])).
% cnf(968,negated_conjecture,(xl=sz00),inference(csr,[status(thm)],[218,200])).
% cnf(976,plain,(sdtpldt0(xm,xn)=sdtasdt0(sz00,esk4_0)),inference(rw,[status(thm)],[167,968,theory(equality)])).
% cnf(988,plain,(doDivides0(sz00,xm)),inference(rw,[status(thm)],[169,968,theory(equality)])).
% cnf(995,plain,(aNaturalNumber0(esk2_2(sz00,xm))|~aNaturalNumber0(sz00)|~aNaturalNumber0(xm)),inference(spm,[status(thm)],[146,988,theory(equality)])).
% cnf(996,plain,(sdtasdt0(sz00,esk2_2(sz00,xm))=xm|~aNaturalNumber0(sz00)|~aNaturalNumber0(xm)),inference(spm,[status(thm)],[145,988,theory(equality)])).
% cnf(999,plain,(aNaturalNumber0(esk2_2(sz00,xm))|$false|~aNaturalNumber0(xm)),inference(rw,[status(thm)],[995,40,theory(equality)])).
% cnf(1000,plain,(aNaturalNumber0(esk2_2(sz00,xm))|$false|$false),inference(rw,[status(thm)],[999,162,theory(equality)])).
% cnf(1001,plain,(aNaturalNumber0(esk2_2(sz00,xm))),inference(cn,[status(thm)],[1000,theory(equality)])).
% cnf(1002,plain,(sdtasdt0(sz00,esk2_2(sz00,xm))=xm|$false|~aNaturalNumber0(xm)),inference(rw,[status(thm)],[996,40,theory(equality)])).
% cnf(1003,plain,(sdtasdt0(sz00,esk2_2(sz00,xm))=xm|$false|$false),inference(rw,[status(thm)],[1002,162,theory(equality)])).
% cnf(1004,plain,(sdtasdt0(sz00,esk2_2(sz00,xm))=xm),inference(cn,[status(thm)],[1003,theory(equality)])).
% cnf(1023,plain,(xm=sz00|~aNaturalNumber0(esk2_2(sz00,xm))),inference(spm,[status(thm)],[67,1004,theory(equality)])).
% cnf(1055,plain,(xm=sz00|$false),inference(rw,[status(thm)],[1023,1001,theory(equality)])).
% cnf(1056,plain,(xm=sz00),inference(cn,[status(thm)],[1055,theory(equality)])).
% cnf(1116,plain,(sdtpldt0(sz00,xn)=sdtasdt0(sz00,esk4_0)),inference(rw,[status(thm)],[976,1056,theory(equality)])).
% cnf(1117,plain,(sz00=xn|sdtasdt0(sz00,esk4_0)!=sz00|~aNaturalNumber0(sz00)|~aNaturalNumber0(xn)),inference(spm,[status(thm)],[88,1116,theory(equality)])).
% cnf(1127,plain,(sz00=xn|sdtasdt0(sz00,esk4_0)!=sz00|$false|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[1117,40,theory(equality)])).
% cnf(1128,plain,(sz00=xn|sdtasdt0(sz00,esk4_0)!=sz00|$false|$false),inference(rw,[status(thm)],[1127,161,theory(equality)])).
% cnf(1129,plain,(sz00=xn|sdtasdt0(sz00,esk4_0)!=sz00),inference(cn,[status(thm)],[1128,theory(equality)])).
% cnf(1130,plain,(sdtasdt0(sz00,esk4_0)!=sz00),inference(sr,[status(thm)],[1129,226,theory(equality)])).
% cnf(1157,plain,(~aNaturalNumber0(esk4_0)),inference(spm,[status(thm)],[1130,67,theory(equality)])).
% cnf(1158,plain,($false),inference(rw,[status(thm)],[1157,168,theory(equality)])).
% cnf(1159,plain,($false),inference(cn,[status(thm)],[1158,theory(equality)])).
% cnf(1160,plain,($false),1159,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 96
% # ...of these trivial : 1
% # ...subsumed : 6
% # ...remaining for further processing: 89
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 27
% # Generated clauses : 405
% # ...of the previous two non-trivial : 385
% # Contextual simplify-reflections : 7
% # Paramodulations : 382
% # Factorizations : 2
% # Equation resolutions : 21
% # Current number of processed clauses: 61
% # Positive orientable unit clauses: 11
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 46
% # Current number of unprocessed clauses: 243
% # ...number of literals in the above : 1101
% # Clause-clause subsumption calls (NU) : 233
% # Rec. Clause-clause subsumption calls : 82
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 54 leaves, 1.44+/-1.149 terms/leaf
% # Paramod-from index: 27 leaves, 1.19+/-0.474 terms/leaf
% # Paramod-into index: 38 leaves, 1.45+/-1.229 terms/leaf
% # -------------------------------------------------
% # User time : 0.031 s
% # System time : 0.008 s
% # Total time : 0.039 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.24 WC
% FINAL PrfWatch: 0.16 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP28095/NUM476+2.tptp
%
%------------------------------------------------------------------------------