%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG108+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 : 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 22:38:48 EST 2010
% Result : Theorem 1.20s
% Output : Solution 1.20s
% 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/SystemOnTPTP30951/RNG108+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30951/RNG108+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30951/RNG108+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 31047
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.021 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,aElement0(sz00),file('/tmp/SRASS.s.p', mSortsC)).
% fof(4, axiom,(aElement0(xa)&aElement0(xb)),file('/tmp/SRASS.s.p', m__2091)).
% fof(9, axiom,![X1]:(aElement0(X1)=>(sdtasdt0(X1,sz00)=sz00&sz00=sdtasdt0(sz00,X1))),file('/tmp/SRASS.s.p', mMulZero)).
% fof(12, axiom,![X1]:(aElement0(X1)=>![X2]:(X2=slsdtgt0(X1)<=>(aSet0(X2)&![X3]:(aElementOf0(X3,X2)<=>?[X4]:(aElement0(X4)&sdtasdt0(X1,X4)=X3))))),file('/tmp/SRASS.s.p', mDefPrIdeal)).
% fof(29, axiom,aElement0(sz10),file('/tmp/SRASS.s.p', mSortsC_01)).
% fof(35, axiom,![X1]:(aElement0(X1)=>(sdtasdt0(X1,sz10)=X1&X1=sdtasdt0(sz10,X1))),file('/tmp/SRASS.s.p', mMulUnit)).
% fof(43, conjecture,(((aElementOf0(sz00,slsdtgt0(xa))&aElementOf0(xa,slsdtgt0(xa)))&aElementOf0(sz00,slsdtgt0(xb)))&aElementOf0(xb,slsdtgt0(xb))),file('/tmp/SRASS.s.p', m__)).
% fof(44, negated_conjecture,~((((aElementOf0(sz00,slsdtgt0(xa))&aElementOf0(xa,slsdtgt0(xa)))&aElementOf0(sz00,slsdtgt0(xb)))&aElementOf0(xb,slsdtgt0(xb)))),inference(assume_negation,[status(cth)],[43])).
% cnf(49,plain,(aElement0(sz00)),inference(split_conjunct,[status(thm)],[1])).
% cnf(56,plain,(aElement0(xb)),inference(split_conjunct,[status(thm)],[4])).
% cnf(57,plain,(aElement0(xa)),inference(split_conjunct,[status(thm)],[4])).
% fof(73, plain,![X1]:(~(aElement0(X1))|(sdtasdt0(X1,sz00)=sz00&sz00=sdtasdt0(sz00,X1))),inference(fof_nnf,[status(thm)],[9])).
% fof(74, plain,![X2]:(~(aElement0(X2))|(sdtasdt0(X2,sz00)=sz00&sz00=sdtasdt0(sz00,X2))),inference(variable_rename,[status(thm)],[73])).
% fof(75, plain,![X2]:((sdtasdt0(X2,sz00)=sz00|~(aElement0(X2)))&(sz00=sdtasdt0(sz00,X2)|~(aElement0(X2)))),inference(distribute,[status(thm)],[74])).
% cnf(77,plain,(sdtasdt0(X1,sz00)=sz00|~aElement0(X1)),inference(split_conjunct,[status(thm)],[75])).
% fof(86, plain,![X1]:(~(aElement0(X1))|![X2]:((~(X2=slsdtgt0(X1))|(aSet0(X2)&![X3]:((~(aElementOf0(X3,X2))|?[X4]:(aElement0(X4)&sdtasdt0(X1,X4)=X3))&(![X4]:(~(aElement0(X4))|~(sdtasdt0(X1,X4)=X3))|aElementOf0(X3,X2)))))&((~(aSet0(X2))|?[X3]:((~(aElementOf0(X3,X2))|![X4]:(~(aElement0(X4))|~(sdtasdt0(X1,X4)=X3)))&(aElementOf0(X3,X2)|?[X4]:(aElement0(X4)&sdtasdt0(X1,X4)=X3))))|X2=slsdtgt0(X1)))),inference(fof_nnf,[status(thm)],[12])).
% fof(87, plain,![X5]:(~(aElement0(X5))|![X6]:((~(X6=slsdtgt0(X5))|(aSet0(X6)&![X7]:((~(aElementOf0(X7,X6))|?[X8]:(aElement0(X8)&sdtasdt0(X5,X8)=X7))&(![X9]:(~(aElement0(X9))|~(sdtasdt0(X5,X9)=X7))|aElementOf0(X7,X6)))))&((~(aSet0(X6))|?[X10]:((~(aElementOf0(X10,X6))|![X11]:(~(aElement0(X11))|~(sdtasdt0(X5,X11)=X10)))&(aElementOf0(X10,X6)|?[X12]:(aElement0(X12)&sdtasdt0(X5,X12)=X10))))|X6=slsdtgt0(X5)))),inference(variable_rename,[status(thm)],[86])).
% fof(88, plain,![X5]:(~(aElement0(X5))|![X6]:((~(X6=slsdtgt0(X5))|(aSet0(X6)&![X7]:((~(aElementOf0(X7,X6))|(aElement0(esk3_3(X5,X6,X7))&sdtasdt0(X5,esk3_3(X5,X6,X7))=X7))&(![X9]:(~(aElement0(X9))|~(sdtasdt0(X5,X9)=X7))|aElementOf0(X7,X6)))))&((~(aSet0(X6))|((~(aElementOf0(esk4_2(X5,X6),X6))|![X11]:(~(aElement0(X11))|~(sdtasdt0(X5,X11)=esk4_2(X5,X6))))&(aElementOf0(esk4_2(X5,X6),X6)|(aElement0(esk5_2(X5,X6))&sdtasdt0(X5,esk5_2(X5,X6))=esk4_2(X5,X6)))))|X6=slsdtgt0(X5)))),inference(skolemize,[status(esa)],[87])).
% fof(89, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((((~(aElement0(X11))|~(sdtasdt0(X5,X11)=esk4_2(X5,X6)))|~(aElementOf0(esk4_2(X5,X6),X6)))&(aElementOf0(esk4_2(X5,X6),X6)|(aElement0(esk5_2(X5,X6))&sdtasdt0(X5,esk5_2(X5,X6))=esk4_2(X5,X6))))|~(aSet0(X6)))|X6=slsdtgt0(X5))&(((((~(aElement0(X9))|~(sdtasdt0(X5,X9)=X7))|aElementOf0(X7,X6))&(~(aElementOf0(X7,X6))|(aElement0(esk3_3(X5,X6,X7))&sdtasdt0(X5,esk3_3(X5,X6,X7))=X7)))&aSet0(X6))|~(X6=slsdtgt0(X5))))|~(aElement0(X5))),inference(shift_quantors,[status(thm)],[88])).
% fof(90, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((((~(aElement0(X11))|~(sdtasdt0(X5,X11)=esk4_2(X5,X6)))|~(aElementOf0(esk4_2(X5,X6),X6)))|~(aSet0(X6)))|X6=slsdtgt0(X5))|~(aElement0(X5)))&(((((aElement0(esk5_2(X5,X6))|aElementOf0(esk4_2(X5,X6),X6))|~(aSet0(X6)))|X6=slsdtgt0(X5))|~(aElement0(X5)))&((((sdtasdt0(X5,esk5_2(X5,X6))=esk4_2(X5,X6)|aElementOf0(esk4_2(X5,X6),X6))|~(aSet0(X6)))|X6=slsdtgt0(X5))|~(aElement0(X5)))))&((((((~(aElement0(X9))|~(sdtasdt0(X5,X9)=X7))|aElementOf0(X7,X6))|~(X6=slsdtgt0(X5)))|~(aElement0(X5)))&((((aElement0(esk3_3(X5,X6,X7))|~(aElementOf0(X7,X6)))|~(X6=slsdtgt0(X5)))|~(aElement0(X5)))&(((sdtasdt0(X5,esk3_3(X5,X6,X7))=X7|~(aElementOf0(X7,X6)))|~(X6=slsdtgt0(X5)))|~(aElement0(X5)))))&((aSet0(X6)|~(X6=slsdtgt0(X5)))|~(aElement0(X5))))),inference(distribute,[status(thm)],[89])).
% cnf(94,plain,(aElementOf0(X3,X2)|~aElement0(X1)|X2!=slsdtgt0(X1)|sdtasdt0(X1,X4)!=X3|~aElement0(X4)),inference(split_conjunct,[status(thm)],[90])).
% cnf(182,plain,(aElement0(sz10)),inference(split_conjunct,[status(thm)],[29])).
% fof(217, plain,![X1]:(~(aElement0(X1))|(sdtasdt0(X1,sz10)=X1&X1=sdtasdt0(sz10,X1))),inference(fof_nnf,[status(thm)],[35])).
% fof(218, plain,![X2]:(~(aElement0(X2))|(sdtasdt0(X2,sz10)=X2&X2=sdtasdt0(sz10,X2))),inference(variable_rename,[status(thm)],[217])).
% fof(219, plain,![X2]:((sdtasdt0(X2,sz10)=X2|~(aElement0(X2)))&(X2=sdtasdt0(sz10,X2)|~(aElement0(X2)))),inference(distribute,[status(thm)],[218])).
% cnf(221,plain,(sdtasdt0(X1,sz10)=X1|~aElement0(X1)),inference(split_conjunct,[status(thm)],[219])).
% fof(250, negated_conjecture,(((~(aElementOf0(sz00,slsdtgt0(xa)))|~(aElementOf0(xa,slsdtgt0(xa))))|~(aElementOf0(sz00,slsdtgt0(xb))))|~(aElementOf0(xb,slsdtgt0(xb)))),inference(fof_nnf,[status(thm)],[44])).
% cnf(251,negated_conjecture,(~aElementOf0(xb,slsdtgt0(xb))|~aElementOf0(sz00,slsdtgt0(xb))|~aElementOf0(xa,slsdtgt0(xa))|~aElementOf0(sz00,slsdtgt0(xa))),inference(split_conjunct,[status(thm)],[250])).
% cnf(429,plain,(aElementOf0(X1,X2)|X3!=X1|slsdtgt0(X3)!=X2|~aElement0(sz10)|~aElement0(X3)),inference(spm,[status(thm)],[94,221,theory(equality)])).
% cnf(430,plain,(aElementOf0(X1,X2)|sz00!=X1|slsdtgt0(X3)!=X2|~aElement0(sz00)|~aElement0(X3)),inference(spm,[status(thm)],[94,77,theory(equality)])).
% cnf(439,plain,(aElementOf0(X1,X2)|X3!=X1|slsdtgt0(X3)!=X2|$false|~aElement0(X3)),inference(rw,[status(thm)],[429,182,theory(equality)])).
% cnf(440,plain,(aElementOf0(X1,X2)|X3!=X1|slsdtgt0(X3)!=X2|~aElement0(X3)),inference(cn,[status(thm)],[439,theory(equality)])).
% cnf(441,plain,(aElementOf0(X1,X2)|slsdtgt0(X1)!=X2|~aElement0(X1)),inference(er,[status(thm)],[440,theory(equality)])).
% cnf(442,plain,(aElementOf0(X1,X2)|sz00!=X1|slsdtgt0(X3)!=X2|$false|~aElement0(X3)),inference(rw,[status(thm)],[430,49,theory(equality)])).
% cnf(443,plain,(aElementOf0(X1,X2)|sz00!=X1|slsdtgt0(X3)!=X2|~aElement0(X3)),inference(cn,[status(thm)],[442,theory(equality)])).
% cnf(725,negated_conjecture,(~aElementOf0(sz00,slsdtgt0(xa))|~aElementOf0(sz00,slsdtgt0(xb))|~aElementOf0(xa,slsdtgt0(xa))|~aElement0(xb)),inference(spm,[status(thm)],[251,441,theory(equality)])).
% cnf(728,negated_conjecture,(~aElementOf0(sz00,slsdtgt0(xa))|~aElementOf0(sz00,slsdtgt0(xb))|~aElementOf0(xa,slsdtgt0(xa))|$false),inference(rw,[status(thm)],[725,56,theory(equality)])).
% cnf(729,negated_conjecture,(~aElementOf0(sz00,slsdtgt0(xa))|~aElementOf0(sz00,slsdtgt0(xb))|~aElementOf0(xa,slsdtgt0(xa))),inference(cn,[status(thm)],[728,theory(equality)])).
% cnf(737,negated_conjecture,(~aElementOf0(sz00,slsdtgt0(xa))|~aElementOf0(sz00,slsdtgt0(xb))|~aElement0(xa)),inference(spm,[status(thm)],[729,441,theory(equality)])).
% cnf(740,negated_conjecture,(~aElementOf0(sz00,slsdtgt0(xa))|~aElementOf0(sz00,slsdtgt0(xb))|$false),inference(rw,[status(thm)],[737,57,theory(equality)])).
% cnf(741,negated_conjecture,(~aElementOf0(sz00,slsdtgt0(xa))|~aElementOf0(sz00,slsdtgt0(xb))),inference(cn,[status(thm)],[740,theory(equality)])).
% cnf(980,plain,(aElementOf0(X1,slsdtgt0(X2))|sz00!=X1|~aElement0(X2)),inference(er,[status(thm)],[443,theory(equality)])).
% cnf(993,negated_conjecture,(~aElementOf0(sz00,slsdtgt0(xa))|~aElement0(xb)),inference(spm,[status(thm)],[741,980,theory(equality)])).
% cnf(999,negated_conjecture,(~aElementOf0(sz00,slsdtgt0(xa))|$false),inference(rw,[status(thm)],[993,56,theory(equality)])).
% cnf(1000,negated_conjecture,(~aElementOf0(sz00,slsdtgt0(xa))),inference(cn,[status(thm)],[999,theory(equality)])).
% cnf(1008,negated_conjecture,(~aElement0(xa)),inference(spm,[status(thm)],[1000,980,theory(equality)])).
% cnf(1013,negated_conjecture,($false),inference(rw,[status(thm)],[1008,57,theory(equality)])).
% cnf(1014,negated_conjecture,($false),inference(cn,[status(thm)],[1013,theory(equality)])).
% cnf(1015,negated_conjecture,($false),1014,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 269
% # ...of these trivial : 4
% # ...subsumed : 30
% # ...remaining for further processing: 235
% # Other redundant clauses eliminated : 8
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 5
% # Backward-rewritten : 1
% # Generated clauses : 470
% # ...of the previous two non-trivial : 411
% # Contextual simplify-reflections : 15
% # Paramodulations : 451
% # Factorizations : 0
% # Equation resolutions : 19
% # Current number of processed clauses: 133
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 118
% # Current number of unprocessed clauses: 317
% # ...number of literals in the above : 1660
% # Clause-clause subsumption calls (NU) : 619
% # Rec. Clause-clause subsumption calls : 426
% # Unit Clause-clause subsumption calls : 23
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 151 leaves, 1.38+/-1.201 terms/leaf
% # Paramod-from index: 72 leaves, 1.08+/-0.276 terms/leaf
% # Paramod-into index: 129 leaves, 1.23+/-0.616 terms/leaf
% # -------------------------------------------------
% # User time : 0.054 s
% # System time : 0.004 s
% # Total time : 0.058 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.24 WC
% FINAL PrfWatch: 0.18 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP30951/RNG108+1.tptp
%
%------------------------------------------------------------------------------