TSTP Solution File: RNG122+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : RNG122+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 : art03.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:48:10 EST 2010

% Result   : Theorem 21.18s
% Output   : Solution 21.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/SystemOnTPTP21077/RNG122+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP21077/RNG122+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21077/RNG122+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 21173
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.92 CPU 2.01 WC
% PrfWatch: 3.91 CPU 4.01 WC
% PrfWatch: 5.90 CPU 6.02 WC
% PrfWatch: 7.89 CPU 8.02 WC
% PrfWatch: 9.87 CPU 10.03 WC
% # Preprocessing time     : 0.022 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 11.87 CPU 12.03 WC
% PrfWatch: 13.86 CPU 14.04 WC
% PrfWatch: 15.86 CPU 16.04 WC
% PrfWatch: 17.85 CPU 18.05 WC
% PrfWatch: 19.85 CPU 20.05 WC
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(aElement0(X1)=>aElement0(smndt0(X1))),file('/tmp/SRASS.s.p', mSortsU)).
% fof(4, axiom,![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>aElement0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB_02)).
% fof(6, axiom,![X1]:![X2]:![X3]:(((aElement0(X1)&aElement0(X2))&aElement0(X3))=>sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))),file('/tmp/SRASS.s.p', mAddAsso)).
% fof(7, axiom,![X1]:(aElement0(X1)=>(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),file('/tmp/SRASS.s.p', mAddZero)).
% fof(8, axiom,![X1]:(aElement0(X1)=>(sdtpldt0(X1,smndt0(X1))=sz00&sz00=sdtpldt0(smndt0(X1),X1))),file('/tmp/SRASS.s.p', mAddInvr)).
% fof(23, axiom,(aIdeal0(xI)&xI=sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),file('/tmp/SRASS.s.p', m__2174)).
% fof(26, axiom,((aElementOf0(xu,xI)&~(xu=sz00))&![X1]:((aElementOf0(X1,xI)&~(X1=sz00))=>~(iLess0(sbrdtbr0(X1),sbrdtbr0(xu))))),file('/tmp/SRASS.s.p', m__2273)).
% fof(31, axiom,(((aElement0(xq)&aElement0(xr))&xb=sdtpldt0(sdtasdt0(xq,xu),xr))&(xr=sz00|iLess0(sbrdtbr0(xr),sbrdtbr0(xu)))),file('/tmp/SRASS.s.p', m__2666)).
% fof(35, 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(45, axiom,![X1]:(aSet0(X1)=>![X2]:(aElementOf0(X2,X1)=>aElement0(X2))),file('/tmp/SRASS.s.p', mEOfElem)).
% fof(54, conjecture,xr=sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),file('/tmp/SRASS.s.p', m__)).
% fof(55, negated_conjecture,~(xr=sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb)),inference(assume_negation,[status(cth)],[54])).
% fof(56, plain,((aElementOf0(xu,xI)&~(xu=sz00))&![X1]:((aElementOf0(X1,xI)&~(X1=sz00))=>~(iLess0(sbrdtbr0(X1),sbrdtbr0(xu))))),inference(fof_simplification,[status(thm)],[26,theory(equality)])).
% fof(63, negated_conjecture,~(xr=sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb)),inference(fof_simplification,[status(thm)],[55,theory(equality)])).
% fof(65, plain,![X1]:(~(aElement0(X1))|aElement0(smndt0(X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(66, plain,![X2]:(~(aElement0(X2))|aElement0(smndt0(X2))),inference(variable_rename,[status(thm)],[65])).
% cnf(67,plain,(aElement0(smndt0(X1))|~aElement0(X1)),inference(split_conjunct,[status(thm)],[66])).
% fof(71, plain,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|aElement0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(72, plain,![X3]:![X4]:((~(aElement0(X3))|~(aElement0(X4)))|aElement0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[71])).
% cnf(73,plain,(aElement0(sdtasdt0(X1,X2))|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[72])).
% fof(77, plain,![X1]:![X2]:![X3]:(((~(aElement0(X1))|~(aElement0(X2)))|~(aElement0(X3)))|sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))),inference(fof_nnf,[status(thm)],[6])).
% fof(78, plain,![X4]:![X5]:![X6]:(((~(aElement0(X4))|~(aElement0(X5)))|~(aElement0(X6)))|sdtpldt0(sdtpldt0(X4,X5),X6)=sdtpldt0(X4,sdtpldt0(X5,X6))),inference(variable_rename,[status(thm)],[77])).
% cnf(79,plain,(sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aElement0(X3)|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[78])).
% fof(80, plain,![X1]:(~(aElement0(X1))|(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),inference(fof_nnf,[status(thm)],[7])).
% fof(81, plain,![X2]:(~(aElement0(X2))|(sdtpldt0(X2,sz00)=X2&X2=sdtpldt0(sz00,X2))),inference(variable_rename,[status(thm)],[80])).
% fof(82, plain,![X2]:((sdtpldt0(X2,sz00)=X2|~(aElement0(X2)))&(X2=sdtpldt0(sz00,X2)|~(aElement0(X2)))),inference(distribute,[status(thm)],[81])).
% cnf(83,plain,(X1=sdtpldt0(sz00,X1)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[82])).
% fof(85, plain,![X1]:(~(aElement0(X1))|(sdtpldt0(X1,smndt0(X1))=sz00&sz00=sdtpldt0(smndt0(X1),X1))),inference(fof_nnf,[status(thm)],[8])).
% fof(86, plain,![X2]:(~(aElement0(X2))|(sdtpldt0(X2,smndt0(X2))=sz00&sz00=sdtpldt0(smndt0(X2),X2))),inference(variable_rename,[status(thm)],[85])).
% fof(87, plain,![X2]:((sdtpldt0(X2,smndt0(X2))=sz00|~(aElement0(X2)))&(sz00=sdtpldt0(smndt0(X2),X2)|~(aElement0(X2)))),inference(distribute,[status(thm)],[86])).
% cnf(88,plain,(sz00=sdtpldt0(smndt0(X1),X1)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[87])).
% cnf(154,plain,(aIdeal0(xI)),inference(split_conjunct,[status(thm)],[23])).
% fof(163, plain,((aElementOf0(xu,xI)&~(xu=sz00))&![X1]:((~(aElementOf0(X1,xI))|X1=sz00)|~(iLess0(sbrdtbr0(X1),sbrdtbr0(xu))))),inference(fof_nnf,[status(thm)],[56])).
% fof(164, plain,((aElementOf0(xu,xI)&~(xu=sz00))&![X2]:((~(aElementOf0(X2,xI))|X2=sz00)|~(iLess0(sbrdtbr0(X2),sbrdtbr0(xu))))),inference(variable_rename,[status(thm)],[163])).
% fof(165, plain,![X2]:(((~(aElementOf0(X2,xI))|X2=sz00)|~(iLess0(sbrdtbr0(X2),sbrdtbr0(xu))))&(aElementOf0(xu,xI)&~(xu=sz00))),inference(shift_quantors,[status(thm)],[164])).
% cnf(167,plain,(aElementOf0(xu,xI)),inference(split_conjunct,[status(thm)],[165])).
% cnf(179,plain,(xb=sdtpldt0(sdtasdt0(xq,xu),xr)),inference(split_conjunct,[status(thm)],[31])).
% cnf(180,plain,(aElement0(xr)),inference(split_conjunct,[status(thm)],[31])).
% cnf(181,plain,(aElement0(xq)),inference(split_conjunct,[status(thm)],[31])).
% fof(185, 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)],[35])).
% fof(186, 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)],[185])).
% fof(187, 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)],[186])).
% fof(188, 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)],[187])).
% fof(189, 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)],[188])).
% cnf(195,plain,(aSet0(X1)|~aIdeal0(X1)),inference(split_conjunct,[status(thm)],[189])).
% fof(262, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|aElement0(X2))),inference(fof_nnf,[status(thm)],[45])).
% fof(263, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|aElement0(X4))),inference(variable_rename,[status(thm)],[262])).
% fof(264, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|aElement0(X4))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[263])).
% cnf(265,plain,(aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[264])).
% cnf(295,negated_conjecture,(xr!=sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb)),inference(split_conjunct,[status(thm)],[63])).
% cnf(296,plain,(aSet0(xI)),inference(spm,[status(thm)],[195,154,theory(equality)])).
% cnf(377,plain,(aElement0(xu)|~aSet0(xI)),inference(spm,[status(thm)],[265,167,theory(equality)])).
% cnf(566,plain,(sdtpldt0(sz00,X2)=sdtpldt0(smndt0(X1),sdtpldt0(X1,X2))|~aElement0(X2)|~aElement0(X1)|~aElement0(smndt0(X1))),inference(spm,[status(thm)],[79,88,theory(equality)])).
% cnf(838,plain,(aElement0(xu)|$false),inference(rw,[status(thm)],[377,296,theory(equality)])).
% cnf(839,plain,(aElement0(xu)),inference(cn,[status(thm)],[838,theory(equality)])).
% cnf(5090,plain,(sdtpldt0(smndt0(X1),sdtpldt0(X1,X2))=sdtpldt0(sz00,X2)|~aElement0(X2)|~aElement0(X1)),inference(csr,[status(thm)],[566,67])).
% cnf(5122,plain,(sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb)=sdtpldt0(sz00,xr)|~aElement0(xr)|~aElement0(sdtasdt0(xq,xu))),inference(spm,[status(thm)],[5090,179,theory(equality)])).
% cnf(5182,plain,(sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb)=sdtpldt0(sz00,xr)|$false|~aElement0(sdtasdt0(xq,xu))),inference(rw,[status(thm)],[5122,180,theory(equality)])).
% cnf(5183,plain,(sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb)=sdtpldt0(sz00,xr)|~aElement0(sdtasdt0(xq,xu))),inference(cn,[status(thm)],[5182,theory(equality)])).
% cnf(555268,negated_conjecture,(sdtpldt0(sz00,xr)!=xr|~aElement0(sdtasdt0(xq,xu))),inference(spm,[status(thm)],[295,5183,theory(equality)])).
% cnf(556051,negated_conjecture,(~aElement0(sdtasdt0(xq,xu))|~aElement0(xr)),inference(spm,[status(thm)],[555268,83,theory(equality)])).
% cnf(556052,negated_conjecture,(~aElement0(sdtasdt0(xq,xu))|$false),inference(rw,[status(thm)],[556051,180,theory(equality)])).
% cnf(556053,negated_conjecture,(~aElement0(sdtasdt0(xq,xu))),inference(cn,[status(thm)],[556052,theory(equality)])).
% cnf(556059,negated_conjecture,(~aElement0(xu)|~aElement0(xq)),inference(spm,[status(thm)],[556053,73,theory(equality)])).
% cnf(556069,negated_conjecture,($false|~aElement0(xq)),inference(rw,[status(thm)],[556059,839,theory(equality)])).
% cnf(556070,negated_conjecture,($false|$false),inference(rw,[status(thm)],[556069,181,theory(equality)])).
% cnf(556071,negated_conjecture,($false),inference(cn,[status(thm)],[556070,theory(equality)])).
% cnf(556072,negated_conjecture,($false),556071,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 8066
% # ...of these trivial                : 244
% # ...subsumed                        : 5834
% # ...remaining for further processing: 1988
% # Other redundant clauses eliminated : 119
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 70
% # Backward-rewritten                 : 79
% # Generated clauses                  : 261251
% # ...of the previous two non-trivial : 248250
% # Contextual simplify-reflections    : 1415
% # Paramodulations                    : 261023
% # Factorizations                     : 0
% # Equation resolutions               : 228
% # Current number of processed clauses: 1839
% #    Positive orientable unit clauses: 285
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 84
% #    Non-unit-clauses                : 1470
% # Current number of unprocessed clauses: 236071
% # ...number of literals in the above : 1508048
% # Clause-clause subsumption calls (NU) : 100213
% # Rec. Clause-clause subsumption calls : 48825
% # Unit Clause-clause subsumption calls : 966
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 175
% # Indexed BW rewrite successes       : 49
% # Backwards rewriting index:  1424 leaves,   1.60+/-1.914 terms/leaf
% # Paramod-from index:          784 leaves,   1.28+/-1.110 terms/leaf
% # Paramod-into index:         1233 leaves,   1.47+/-1.451 terms/leaf
% # -------------------------------------------------
% # User time              : 11.065 s
% # System time            : 0.402 s
% # Total time             : 11.467 s
% # Maximum resident set size: 0 pages
% PrfWatch: 20.29 CPU 20.75 WC
% FINAL PrfWatch: 20.29 CPU 20.75 WC
% SZS output end Solution for /tmp/SystemOnTPTP21077/RNG122+1.tptp
% 
%------------------------------------------------------------------------------