%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG101+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:36:35 EST 2010
% Result : Theorem 1.64s
% Output : Solution 1.64s
% 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/SystemOnTPTP13256/RNG101+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13256/RNG101+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13256/RNG101+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 13352
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.021 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,aElement0(xc),file('/tmp/SRASS.s.p', m__1905)).
% fof(5, axiom,((aElementOf0(xx,slsdtgt0(xc))&aElementOf0(xy,slsdtgt0(xc)))&aElement0(xz)),file('/tmp/SRASS.s.p', m__1933)).
% fof(6, 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(40, conjecture,?[X1]:(aElement0(X1)&sdtasdt0(xc,X1)=xx),file('/tmp/SRASS.s.p', m__)).
% fof(41, negated_conjecture,~(?[X1]:(aElement0(X1)&sdtasdt0(xc,X1)=xx)),inference(assume_negation,[status(cth)],[40])).
% cnf(55,plain,(aElement0(xc)),inference(split_conjunct,[status(thm)],[4])).
% cnf(58,plain,(aElementOf0(xx,slsdtgt0(xc))),inference(split_conjunct,[status(thm)],[5])).
% fof(59, 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)],[6])).
% fof(60, 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)],[59])).
% fof(61, plain,![X5]:(~(aElement0(X5))|![X6]:((~(X6=slsdtgt0(X5))|(aSet0(X6)&![X7]:((~(aElementOf0(X7,X6))|(aElement0(esk1_3(X5,X6,X7))&sdtasdt0(X5,esk1_3(X5,X6,X7))=X7))&(![X9]:(~(aElement0(X9))|~(sdtasdt0(X5,X9)=X7))|aElementOf0(X7,X6)))))&((~(aSet0(X6))|((~(aElementOf0(esk2_2(X5,X6),X6))|![X11]:(~(aElement0(X11))|~(sdtasdt0(X5,X11)=esk2_2(X5,X6))))&(aElementOf0(esk2_2(X5,X6),X6)|(aElement0(esk3_2(X5,X6))&sdtasdt0(X5,esk3_2(X5,X6))=esk2_2(X5,X6)))))|X6=slsdtgt0(X5)))),inference(skolemize,[status(esa)],[60])).
% fof(62, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((((~(aElement0(X11))|~(sdtasdt0(X5,X11)=esk2_2(X5,X6)))|~(aElementOf0(esk2_2(X5,X6),X6)))&(aElementOf0(esk2_2(X5,X6),X6)|(aElement0(esk3_2(X5,X6))&sdtasdt0(X5,esk3_2(X5,X6))=esk2_2(X5,X6))))|~(aSet0(X6)))|X6=slsdtgt0(X5))&(((((~(aElement0(X9))|~(sdtasdt0(X5,X9)=X7))|aElementOf0(X7,X6))&(~(aElementOf0(X7,X6))|(aElement0(esk1_3(X5,X6,X7))&sdtasdt0(X5,esk1_3(X5,X6,X7))=X7)))&aSet0(X6))|~(X6=slsdtgt0(X5))))|~(aElement0(X5))),inference(shift_quantors,[status(thm)],[61])).
% fof(63, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((((~(aElement0(X11))|~(sdtasdt0(X5,X11)=esk2_2(X5,X6)))|~(aElementOf0(esk2_2(X5,X6),X6)))|~(aSet0(X6)))|X6=slsdtgt0(X5))|~(aElement0(X5)))&(((((aElement0(esk3_2(X5,X6))|aElementOf0(esk2_2(X5,X6),X6))|~(aSet0(X6)))|X6=slsdtgt0(X5))|~(aElement0(X5)))&((((sdtasdt0(X5,esk3_2(X5,X6))=esk2_2(X5,X6)|aElementOf0(esk2_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(esk1_3(X5,X6,X7))|~(aElementOf0(X7,X6)))|~(X6=slsdtgt0(X5)))|~(aElement0(X5)))&(((sdtasdt0(X5,esk1_3(X5,X6,X7))=X7|~(aElementOf0(X7,X6)))|~(X6=slsdtgt0(X5)))|~(aElement0(X5)))))&((aSet0(X6)|~(X6=slsdtgt0(X5)))|~(aElement0(X5))))),inference(distribute,[status(thm)],[62])).
% cnf(65,plain,(sdtasdt0(X1,esk1_3(X1,X2,X3))=X3|~aElement0(X1)|X2!=slsdtgt0(X1)|~aElementOf0(X3,X2)),inference(split_conjunct,[status(thm)],[63])).
% cnf(66,plain,(aElement0(esk1_3(X1,X2,X3))|~aElement0(X1)|X2!=slsdtgt0(X1)|~aElementOf0(X3,X2)),inference(split_conjunct,[status(thm)],[63])).
% fof(242, negated_conjecture,![X1]:(~(aElement0(X1))|~(sdtasdt0(xc,X1)=xx)),inference(fof_nnf,[status(thm)],[41])).
% fof(243, negated_conjecture,![X2]:(~(aElement0(X2))|~(sdtasdt0(xc,X2)=xx)),inference(variable_rename,[status(thm)],[242])).
% cnf(244,negated_conjecture,(sdtasdt0(xc,X1)!=xx|~aElement0(X1)),inference(split_conjunct,[status(thm)],[243])).
% cnf(550,negated_conjecture,(X2!=xx|~aElement0(esk1_3(xc,X1,X2))|slsdtgt0(xc)!=X1|~aElementOf0(X2,X1)|~aElement0(xc)),inference(spm,[status(thm)],[244,65,theory(equality)])).
% cnf(564,negated_conjecture,(X2!=xx|~aElement0(esk1_3(xc,X1,X2))|slsdtgt0(xc)!=X1|~aElementOf0(X2,X1)|$false),inference(rw,[status(thm)],[550,55,theory(equality)])).
% cnf(565,negated_conjecture,(X2!=xx|~aElement0(esk1_3(xc,X1,X2))|slsdtgt0(xc)!=X1|~aElementOf0(X2,X1)),inference(cn,[status(thm)],[564,theory(equality)])).
% cnf(20699,negated_conjecture,(slsdtgt0(xc)!=X1|X2!=xx|~aElementOf0(X2,X1)|~aElement0(xc)),inference(spm,[status(thm)],[565,66,theory(equality)])).
% cnf(20700,negated_conjecture,(slsdtgt0(xc)!=X1|X2!=xx|~aElementOf0(X2,X1)|$false),inference(rw,[status(thm)],[20699,55,theory(equality)])).
% cnf(20701,negated_conjecture,(slsdtgt0(xc)!=X1|X2!=xx|~aElementOf0(X2,X1)),inference(cn,[status(thm)],[20700,theory(equality)])).
% cnf(20708,negated_conjecture,($false),inference(spm,[status(thm)],[20701,58,theory(equality)])).
% cnf(20713,negated_conjecture,($false),20708,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1585
% # ...of these trivial : 10
% # ...subsumed : 772
% # ...remaining for further processing: 803
% # Other redundant clauses eliminated : 24
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 13
% # Backward-rewritten : 21
% # Generated clauses : 10350
% # ...of the previous two non-trivial : 9527
% # Contextual simplify-reflections : 155
% # Paramodulations : 10312
% # Factorizations : 0
% # Equation resolutions : 38
% # Current number of processed clauses: 676
% # Positive orientable unit clauses: 263
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 19
% # Non-unit-clauses : 394
% # Current number of unprocessed clauses: 7842
% # ...number of literals in the above : 33531
% # Clause-clause subsumption calls (NU) : 15280
% # Rec. Clause-clause subsumption calls : 8218
% # Unit Clause-clause subsumption calls : 1011
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 398
% # Indexed BW rewrite successes : 12
% # Backwards rewriting index: 677 leaves, 1.26+/-1.343 terms/leaf
% # Paramod-from index: 370 leaves, 1.17+/-1.345 terms/leaf
% # Paramod-into index: 579 leaves, 1.22+/-1.240 terms/leaf
% # -------------------------------------------------
% # User time : 0.415 s
% # System time : 0.017 s
% # Total time : 0.432 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.80 CPU 0.88 WC
% FINAL PrfWatch: 0.80 CPU 0.88 WC
% SZS output end Solution for /tmp/SystemOnTPTP13256/RNG101+1.tptp
%
%------------------------------------------------------------------------------