%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG090+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 : art04.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:29:54 EST 2010
% Result : Theorem 1.02s
% Output : Solution 1.02s
% 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/SystemOnTPTP32393/RNG090+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP32393/RNG090+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32393/RNG090+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 32489
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>aElement0(sdtpldt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB)).
% fof(3, axiom,![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>sdtpldt0(X1,X2)=sdtpldt0(X2,X1)),file('/tmp/SRASS.s.p', mAddComm)).
% fof(4, 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(8, axiom,![X1]:(aSet0(X1)=>![X2]:(aElementOf0(X2,X1)=>aElement0(X2))),file('/tmp/SRASS.s.p', mEOfElem)).
% fof(12, 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__870)).
% fof(14, axiom,((aElementOf0(xk,xI)&aElementOf0(xl,xJ))&xx=sdtpldt0(xk,xl)),file('/tmp/SRASS.s.p', m__934)).
% fof(15, axiom,((aElementOf0(xm,xI)&aElementOf0(xn,xJ))&xy=sdtpldt0(xm,xn)),file('/tmp/SRASS.s.p', m__967)).
% fof(16, axiom,(aElementOf0(sdtpldt0(xk,xm),xI)&aElementOf0(sdtpldt0(xl,xn),xJ)),file('/tmp/SRASS.s.p', m__994)).
% fof(31, conjecture,sdtpldt0(xx,xy)=sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)),file('/tmp/SRASS.s.p', m__)).
% fof(32, negated_conjecture,~(sdtpldt0(xx,xy)=sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn))),inference(assume_negation,[status(cth)],[31])).
% fof(35, negated_conjecture,~(sdtpldt0(xx,xy)=sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn))),inference(fof_simplification,[status(thm)],[32,theory(equality)])).
% fof(36, plain,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|aElement0(sdtpldt0(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(37, plain,![X3]:![X4]:((~(aElement0(X3))|~(aElement0(X4)))|aElement0(sdtpldt0(X3,X4))),inference(variable_rename,[status(thm)],[36])).
% cnf(38,plain,(aElement0(sdtpldt0(X1,X2))|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[37])).
% fof(42, plain,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|sdtpldt0(X1,X2)=sdtpldt0(X2,X1)),inference(fof_nnf,[status(thm)],[3])).
% fof(43, plain,![X3]:![X4]:((~(aElement0(X3))|~(aElement0(X4)))|sdtpldt0(X3,X4)=sdtpldt0(X4,X3)),inference(variable_rename,[status(thm)],[42])).
% cnf(44,plain,(sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[43])).
% fof(45, 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)],[4])).
% fof(46, 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)],[45])).
% cnf(47,plain,(sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aElement0(X3)|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[46])).
% fof(59, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|aElement0(X2))),inference(fof_nnf,[status(thm)],[8])).
% fof(60, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|aElement0(X4))),inference(variable_rename,[status(thm)],[59])).
% fof(61, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|aElement0(X4))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[60])).
% cnf(62,plain,(aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[61])).
% fof(98, 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)],[12])).
% fof(99, 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)],[98])).
% fof(100, 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)],[99])).
% fof(101, 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)],[100])).
% cnf(103,plain,(aSet0(xJ)),inference(split_conjunct,[status(thm)],[101])).
% cnf(105,plain,(aSet0(xI)),inference(split_conjunct,[status(thm)],[101])).
% cnf(121,plain,(xx=sdtpldt0(xk,xl)),inference(split_conjunct,[status(thm)],[14])).
% cnf(122,plain,(aElementOf0(xl,xJ)),inference(split_conjunct,[status(thm)],[14])).
% cnf(123,plain,(aElementOf0(xk,xI)),inference(split_conjunct,[status(thm)],[14])).
% cnf(124,plain,(xy=sdtpldt0(xm,xn)),inference(split_conjunct,[status(thm)],[15])).
% cnf(125,plain,(aElementOf0(xn,xJ)),inference(split_conjunct,[status(thm)],[15])).
% cnf(126,plain,(aElementOf0(xm,xI)),inference(split_conjunct,[status(thm)],[15])).
% cnf(128,plain,(aElementOf0(sdtpldt0(xk,xm),xI)),inference(split_conjunct,[status(thm)],[16])).
% cnf(181,negated_conjecture,(sdtpldt0(xx,xy)!=sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn))),inference(split_conjunct,[status(thm)],[35])).
% cnf(210,plain,(aElement0(xn)|~aSet0(xJ)),inference(spm,[status(thm)],[62,125,theory(equality)])).
% cnf(211,plain,(aElement0(xm)|~aSet0(xI)),inference(spm,[status(thm)],[62,126,theory(equality)])).
% cnf(212,plain,(aElement0(xl)|~aSet0(xJ)),inference(spm,[status(thm)],[62,122,theory(equality)])).
% cnf(213,plain,(aElement0(xk)|~aSet0(xI)),inference(spm,[status(thm)],[62,123,theory(equality)])).
% cnf(215,plain,(aElement0(sdtpldt0(xk,xm))|~aSet0(xI)),inference(spm,[status(thm)],[62,128,theory(equality)])).
% cnf(224,plain,(aElement0(xn)|$false),inference(rw,[status(thm)],[210,103,theory(equality)])).
% cnf(225,plain,(aElement0(xn)),inference(cn,[status(thm)],[224,theory(equality)])).
% cnf(226,plain,(aElement0(xm)|$false),inference(rw,[status(thm)],[211,105,theory(equality)])).
% cnf(227,plain,(aElement0(xm)),inference(cn,[status(thm)],[226,theory(equality)])).
% cnf(228,plain,(aElement0(xl)|$false),inference(rw,[status(thm)],[212,103,theory(equality)])).
% cnf(229,plain,(aElement0(xl)),inference(cn,[status(thm)],[228,theory(equality)])).
% cnf(230,plain,(aElement0(xk)|$false),inference(rw,[status(thm)],[213,105,theory(equality)])).
% cnf(231,plain,(aElement0(xk)),inference(cn,[status(thm)],[230,theory(equality)])).
% cnf(234,plain,(aElement0(sdtpldt0(xk,xm))|$false),inference(rw,[status(thm)],[215,105,theory(equality)])).
% cnf(235,plain,(aElement0(sdtpldt0(xk,xm))),inference(cn,[status(thm)],[234,theory(equality)])).
% cnf(240,plain,(aElement0(xy)|~aElement0(xn)|~aElement0(xm)),inference(spm,[status(thm)],[38,124,theory(equality)])).
% cnf(331,plain,(sdtpldt0(X1,sdtpldt0(X2,X3))=sdtpldt0(X3,sdtpldt0(X1,X2))|~aElement0(X3)|~aElement0(sdtpldt0(X1,X2))|~aElement0(X2)|~aElement0(X1)),inference(spm,[status(thm)],[44,47,theory(equality)])).
% cnf(341,plain,(sdtpldt0(xx,X1)=sdtpldt0(xk,sdtpldt0(xl,X1))|~aElement0(X1)|~aElement0(xl)|~aElement0(xk)),inference(spm,[status(thm)],[47,121,theory(equality)])).
% cnf(640,plain,(aElement0(xy)|$false|~aElement0(xm)),inference(rw,[status(thm)],[240,225,theory(equality)])).
% cnf(641,plain,(aElement0(xy)|$false|$false),inference(rw,[status(thm)],[640,227,theory(equality)])).
% cnf(642,plain,(aElement0(xy)),inference(cn,[status(thm)],[641,theory(equality)])).
% cnf(2111,plain,(sdtpldt0(X1,sdtpldt0(X2,X3))=sdtpldt0(X3,sdtpldt0(X1,X2))|~aElement0(X2)|~aElement0(X1)|~aElement0(X3)),inference(csr,[status(thm)],[331,38])).
% cnf(2130,negated_conjecture,(sdtpldt0(xl,sdtpldt0(xn,sdtpldt0(xk,xm)))!=sdtpldt0(xx,xy)|~aElement0(sdtpldt0(xk,xm))|~aElement0(xn)|~aElement0(xl)),inference(spm,[status(thm)],[181,2111,theory(equality)])).
% cnf(2303,negated_conjecture,(sdtpldt0(xl,sdtpldt0(xn,sdtpldt0(xk,xm)))!=sdtpldt0(xx,xy)|$false|~aElement0(xn)|~aElement0(xl)),inference(rw,[status(thm)],[2130,235,theory(equality)])).
% cnf(2304,negated_conjecture,(sdtpldt0(xl,sdtpldt0(xn,sdtpldt0(xk,xm)))!=sdtpldt0(xx,xy)|$false|$false|~aElement0(xl)),inference(rw,[status(thm)],[2303,225,theory(equality)])).
% cnf(2305,negated_conjecture,(sdtpldt0(xl,sdtpldt0(xn,sdtpldt0(xk,xm)))!=sdtpldt0(xx,xy)|$false|$false|$false),inference(rw,[status(thm)],[2304,229,theory(equality)])).
% cnf(2306,negated_conjecture,(sdtpldt0(xl,sdtpldt0(xn,sdtpldt0(xk,xm)))!=sdtpldt0(xx,xy)),inference(cn,[status(thm)],[2305,theory(equality)])).
% cnf(2486,negated_conjecture,(sdtpldt0(xl,sdtpldt0(xk,sdtpldt0(xm,xn)))!=sdtpldt0(xx,xy)|~aElement0(xn)|~aElement0(xm)|~aElement0(xk)),inference(spm,[status(thm)],[2306,2111,theory(equality)])).
% cnf(2491,negated_conjecture,(sdtpldt0(xl,sdtpldt0(xk,xy))!=sdtpldt0(xx,xy)|~aElement0(xn)|~aElement0(xm)|~aElement0(xk)),inference(rw,[status(thm)],[2486,124,theory(equality)])).
% cnf(2492,negated_conjecture,(sdtpldt0(xl,sdtpldt0(xk,xy))!=sdtpldt0(xx,xy)|$false|~aElement0(xm)|~aElement0(xk)),inference(rw,[status(thm)],[2491,225,theory(equality)])).
% cnf(2493,negated_conjecture,(sdtpldt0(xl,sdtpldt0(xk,xy))!=sdtpldt0(xx,xy)|$false|$false|~aElement0(xk)),inference(rw,[status(thm)],[2492,227,theory(equality)])).
% cnf(2494,negated_conjecture,(sdtpldt0(xl,sdtpldt0(xk,xy))!=sdtpldt0(xx,xy)|$false|$false|$false),inference(rw,[status(thm)],[2493,231,theory(equality)])).
% cnf(2495,negated_conjecture,(sdtpldt0(xl,sdtpldt0(xk,xy))!=sdtpldt0(xx,xy)),inference(cn,[status(thm)],[2494,theory(equality)])).
% cnf(2496,negated_conjecture,(sdtpldt0(xk,sdtpldt0(xy,xl))!=sdtpldt0(xx,xy)|~aElement0(xl)|~aElement0(xy)|~aElement0(xk)),inference(spm,[status(thm)],[2495,2111,theory(equality)])).
% cnf(2497,negated_conjecture,(sdtpldt0(xk,sdtpldt0(xy,xl))!=sdtpldt0(xx,xy)|$false|~aElement0(xy)|~aElement0(xk)),inference(rw,[status(thm)],[2496,229,theory(equality)])).
% cnf(2498,negated_conjecture,(sdtpldt0(xk,sdtpldt0(xy,xl))!=sdtpldt0(xx,xy)|$false|$false|~aElement0(xk)),inference(rw,[status(thm)],[2497,642,theory(equality)])).
% cnf(2499,negated_conjecture,(sdtpldt0(xk,sdtpldt0(xy,xl))!=sdtpldt0(xx,xy)|$false|$false|$false),inference(rw,[status(thm)],[2498,231,theory(equality)])).
% cnf(2500,negated_conjecture,(sdtpldt0(xk,sdtpldt0(xy,xl))!=sdtpldt0(xx,xy)),inference(cn,[status(thm)],[2499,theory(equality)])).
% cnf(2501,negated_conjecture,(sdtpldt0(xk,sdtpldt0(xl,xy))!=sdtpldt0(xx,xy)|~aElement0(xl)|~aElement0(xy)),inference(spm,[status(thm)],[2500,44,theory(equality)])).
% cnf(2503,negated_conjecture,(sdtpldt0(xk,sdtpldt0(xl,xy))!=sdtpldt0(xx,xy)|$false|~aElement0(xy)),inference(rw,[status(thm)],[2501,229,theory(equality)])).
% cnf(2504,negated_conjecture,(sdtpldt0(xk,sdtpldt0(xl,xy))!=sdtpldt0(xx,xy)|$false|$false),inference(rw,[status(thm)],[2503,642,theory(equality)])).
% cnf(2505,negated_conjecture,(sdtpldt0(xk,sdtpldt0(xl,xy))!=sdtpldt0(xx,xy)),inference(cn,[status(thm)],[2504,theory(equality)])).
% cnf(3813,plain,(sdtpldt0(xk,sdtpldt0(xl,X1))=sdtpldt0(xx,X1)|~aElement0(X1)|$false|~aElement0(xk)),inference(rw,[status(thm)],[341,229,theory(equality)])).
% cnf(3814,plain,(sdtpldt0(xk,sdtpldt0(xl,X1))=sdtpldt0(xx,X1)|~aElement0(X1)|$false|$false),inference(rw,[status(thm)],[3813,231,theory(equality)])).
% cnf(3815,plain,(sdtpldt0(xk,sdtpldt0(xl,X1))=sdtpldt0(xx,X1)|~aElement0(X1)),inference(cn,[status(thm)],[3814,theory(equality)])).
% cnf(3837,negated_conjecture,(~aElement0(xy)),inference(spm,[status(thm)],[2505,3815,theory(equality)])).
% cnf(3895,negated_conjecture,($false),inference(rw,[status(thm)],[3837,642,theory(equality)])).
% cnf(3896,negated_conjecture,($false),inference(cn,[status(thm)],[3895,theory(equality)])).
% cnf(3897,negated_conjecture,($false),3896,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 294
% # ...of these trivial : 16
% # ...subsumed : 103
% # ...remaining for further processing: 175
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 1445
% # ...of the previous two non-trivial : 1159
% # Contextual simplify-reflections : 26
% # Paramodulations : 1436
% # Factorizations : 0
% # Equation resolutions : 9
% # Current number of processed clauses: 172
% # Positive orientable unit clauses: 57
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 17
% # Non-unit-clauses : 98
% # Current number of unprocessed clauses: 891
% # ...number of literals in the above : 3789
% # Clause-clause subsumption calls (NU) : 736
% # Rec. Clause-clause subsumption calls : 624
% # Unit Clause-clause subsumption calls : 118
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 243 leaves, 1.18+/-0.810 terms/leaf
% # Paramod-from index: 124 leaves, 1.03+/-0.177 terms/leaf
% # Paramod-into index: 223 leaves, 1.09+/-0.414 terms/leaf
% # -------------------------------------------------
% # User time : 0.065 s
% # System time : 0.005 s
% # Total time : 0.070 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.29 WC
% FINAL PrfWatch: 0.20 CPU 0.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP32393/RNG090+2.tptp
%
%------------------------------------------------------------------------------