%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM576+3 : 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 20:15:53 EST 2010
% Result : Theorem 10.83s
% Output : Solution 10.83s
% 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/SystemOnTPTP813/NUM576+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP813/NUM576+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP813/NUM576+3.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 909
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.92 CPU 2.01 WC
% PrfWatch: 3.91 CPU 4.01 WC
% PrfWatch: 5.91 CPU 6.02 WC
% # Preprocessing time : 0.546 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 7.89 CPU 8.02 WC
% # SZS output start CNFRefutation.
% fof(22, axiom,![X1]:![X2]:((aElementOf0(X1,szNzAzT0)&aElementOf0(X2,szNzAzT0))=>((sdtlseqdt0(X1,X2)&sdtlseqdt0(X2,X1))=>X1=X2)),file('/tmp/SRASS.s.p', mLessASymm)).
% fof(24, axiom,![X1]:![X2]:((aElementOf0(X1,szNzAzT0)&aElementOf0(X2,szNzAzT0))=>(sdtlseqdt0(X1,X2)|sdtlseqdt0(szszuzczcdt0(X2),X1))),file('/tmp/SRASS.s.p', mLessTotal)).
% fof(51, axiom,(aElementOf0(xi,szNzAzT0)&aElementOf0(xj,szNzAzT0)),file('/tmp/SRASS.s.p', m__3856)).
% fof(85, conjecture,(~(xi=xj)=>(sdtlseqdt0(szszuzczcdt0(xj),xi)|sdtlseqdt0(szszuzczcdt0(xi),xj))),file('/tmp/SRASS.s.p', m__)).
% fof(86, negated_conjecture,~((~(xi=xj)=>(sdtlseqdt0(szszuzczcdt0(xj),xi)|sdtlseqdt0(szszuzczcdt0(xi),xj)))),inference(assume_negation,[status(cth)],[85])).
% fof(187, plain,![X1]:![X2]:((~(aElementOf0(X1,szNzAzT0))|~(aElementOf0(X2,szNzAzT0)))|((~(sdtlseqdt0(X1,X2))|~(sdtlseqdt0(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[22])).
% fof(188, plain,![X3]:![X4]:((~(aElementOf0(X3,szNzAzT0))|~(aElementOf0(X4,szNzAzT0)))|((~(sdtlseqdt0(X3,X4))|~(sdtlseqdt0(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[187])).
% cnf(189,plain,(X1=X2|~sdtlseqdt0(X2,X1)|~sdtlseqdt0(X1,X2)|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[188])).
% fof(193, plain,![X1]:![X2]:((~(aElementOf0(X1,szNzAzT0))|~(aElementOf0(X2,szNzAzT0)))|(sdtlseqdt0(X1,X2)|sdtlseqdt0(szszuzczcdt0(X2),X1))),inference(fof_nnf,[status(thm)],[24])).
% fof(194, plain,![X3]:![X4]:((~(aElementOf0(X3,szNzAzT0))|~(aElementOf0(X4,szNzAzT0)))|(sdtlseqdt0(X3,X4)|sdtlseqdt0(szszuzczcdt0(X4),X3))),inference(variable_rename,[status(thm)],[193])).
% cnf(195,plain,(sdtlseqdt0(szszuzczcdt0(X1),X2)|sdtlseqdt0(X2,X1)|~aElementOf0(X1,szNzAzT0)|~aElementOf0(X2,szNzAzT0)),inference(split_conjunct,[status(thm)],[194])).
% cnf(4344,plain,(aElementOf0(xj,szNzAzT0)),inference(split_conjunct,[status(thm)],[51])).
% cnf(4345,plain,(aElementOf0(xi,szNzAzT0)),inference(split_conjunct,[status(thm)],[51])).
% fof(4505, negated_conjecture,(~(xi=xj)&(~(sdtlseqdt0(szszuzczcdt0(xj),xi))&~(sdtlseqdt0(szszuzczcdt0(xi),xj)))),inference(fof_nnf,[status(thm)],[86])).
% cnf(4506,negated_conjecture,(~sdtlseqdt0(szszuzczcdt0(xi),xj)),inference(split_conjunct,[status(thm)],[4505])).
% cnf(4507,negated_conjecture,(~sdtlseqdt0(szszuzczcdt0(xj),xi)),inference(split_conjunct,[status(thm)],[4505])).
% cnf(4508,negated_conjecture,(xi!=xj),inference(split_conjunct,[status(thm)],[4505])).
% cnf(7218,negated_conjecture,(sdtlseqdt0(xj,xi)|~aElementOf0(xj,szNzAzT0)|~aElementOf0(xi,szNzAzT0)),inference(spm,[status(thm)],[4506,195,theory(equality)])).
% cnf(7219,negated_conjecture,(sdtlseqdt0(xi,xj)|~aElementOf0(xi,szNzAzT0)|~aElementOf0(xj,szNzAzT0)),inference(spm,[status(thm)],[4507,195,theory(equality)])).
% cnf(7223,negated_conjecture,(sdtlseqdt0(xj,xi)|$false|~aElementOf0(xi,szNzAzT0)),inference(rw,[status(thm)],[7218,4344,theory(equality)])).
% cnf(7224,negated_conjecture,(sdtlseqdt0(xj,xi)|$false|$false),inference(rw,[status(thm)],[7223,4345,theory(equality)])).
% cnf(7225,negated_conjecture,(sdtlseqdt0(xj,xi)),inference(cn,[status(thm)],[7224,theory(equality)])).
% cnf(7226,negated_conjecture,(sdtlseqdt0(xi,xj)|$false|~aElementOf0(xj,szNzAzT0)),inference(rw,[status(thm)],[7219,4345,theory(equality)])).
% cnf(7227,negated_conjecture,(sdtlseqdt0(xi,xj)|$false|$false),inference(rw,[status(thm)],[7226,4344,theory(equality)])).
% cnf(7228,negated_conjecture,(sdtlseqdt0(xi,xj)),inference(cn,[status(thm)],[7227,theory(equality)])).
% cnf(60223,negated_conjecture,(xj=xi|~sdtlseqdt0(xj,xi)|~aElementOf0(xi,szNzAzT0)|~aElementOf0(xj,szNzAzT0)),inference(spm,[status(thm)],[189,7228,theory(equality)])).
% cnf(60227,negated_conjecture,(xj=xi|$false|~aElementOf0(xi,szNzAzT0)|~aElementOf0(xj,szNzAzT0)),inference(rw,[status(thm)],[60223,7225,theory(equality)])).
% cnf(60228,negated_conjecture,(xj=xi|$false|$false|~aElementOf0(xj,szNzAzT0)),inference(rw,[status(thm)],[60227,4345,theory(equality)])).
% cnf(60229,negated_conjecture,(xj=xi|$false|$false|$false),inference(rw,[status(thm)],[60228,4344,theory(equality)])).
% cnf(60230,negated_conjecture,(xj=xi),inference(cn,[status(thm)],[60229,theory(equality)])).
% cnf(60231,negated_conjecture,($false),inference(sr,[status(thm)],[60230,4508,theory(equality)])).
% cnf(60232,negated_conjecture,($false),60231,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 5442
% # ...of these trivial : 0
% # ...subsumed : 275
% # ...remaining for further processing: 5167
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 48351
% # ...of the previous two non-trivial : 35058
% # Contextual simplify-reflections : 2548
% # Paramodulations : 48313
% # Factorizations : 0
% # Equation resolutions : 38
% # Current number of processed clauses: 2583
% # Positive orientable unit clauses: 24
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 2555
% # Current number of unprocessed clauses: 35053
% # ...number of literals in the above : 573875
% # Clause-clause subsumption calls (NU) : 399547
% # Rec. Clause-clause subsumption calls : 39019
% # Unit Clause-clause subsumption calls : 30
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 236 leaves, 2.23+/-2.692 terms/leaf
% # Paramod-from index: 102 leaves, 1.02+/-0.139 terms/leaf
% # Paramod-into index: 204 leaves, 1.58+/-1.465 terms/leaf
% # -------------------------------------------------
% # User time : 7.082 s
% # System time : 0.115 s
% # Total time : 7.197 s
% # Maximum resident set size: 0 pages
% PrfWatch: 9.83 CPU 9.97 WC
% FINAL PrfWatch: 9.83 CPU 9.97 WC
% SZS output end Solution for /tmp/SystemOnTPTP813/NUM576+3.tptp
%
%------------------------------------------------------------------------------