%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM617+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:38:52 EST 2010
% Result : Theorem 5.60s
% Output : Solution 5.60s
% 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/SystemOnTPTP17609/NUM617+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17609/NUM617+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17609/NUM617+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 17705
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.95 CPU 2.02 WC
% # Preprocessing time : 0.620 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.93 CPU 4.02 WC
% # SZS output start CNFRefutation.
% fof(85, axiom,(![X1]:(aElementOf0(X1,xQ)=>aElementOf0(X1,szNzAzT0))&aSubsetOf0(xQ,szNzAzT0)),file('/tmp/SRASS.s.p', m__5106)).
% fof(97, axiom,(((aElement0(xx)&aElementOf0(xx,xQ))&~(xx=szmzizndt0(xQ)))&aElementOf0(xx,xP)),file('/tmp/SRASS.s.p', m__5348)).
% fof(114, conjecture,aElementOf0(xx,szNzAzT0),file('/tmp/SRASS.s.p', m__)).
% fof(115, negated_conjecture,~(aElementOf0(xx,szNzAzT0)),inference(assume_negation,[status(cth)],[114])).
% fof(128, negated_conjecture,~(aElementOf0(xx,szNzAzT0)),inference(fof_simplification,[status(thm)],[115,theory(equality)])).
% fof(4607, plain,(![X1]:(~(aElementOf0(X1,xQ))|aElementOf0(X1,szNzAzT0))&aSubsetOf0(xQ,szNzAzT0)),inference(fof_nnf,[status(thm)],[85])).
% fof(4608, plain,(![X2]:(~(aElementOf0(X2,xQ))|aElementOf0(X2,szNzAzT0))&aSubsetOf0(xQ,szNzAzT0)),inference(variable_rename,[status(thm)],[4607])).
% fof(4609, plain,![X2]:((~(aElementOf0(X2,xQ))|aElementOf0(X2,szNzAzT0))&aSubsetOf0(xQ,szNzAzT0)),inference(shift_quantors,[status(thm)],[4608])).
% cnf(4611,plain,(aElementOf0(X1,szNzAzT0)|~aElementOf0(X1,xQ)),inference(split_conjunct,[status(thm)],[4609])).
% cnf(4662,plain,(aElementOf0(xx,xQ)),inference(split_conjunct,[status(thm)],[97])).
% cnf(4733,negated_conjecture,(~aElementOf0(xx,szNzAzT0)),inference(split_conjunct,[status(thm)],[128])).
% cnf(8524,negated_conjecture,(~aElementOf0(xx,xQ)),inference(spm,[status(thm)],[4733,4611,theory(equality)])).
% cnf(8525,negated_conjecture,($false),inference(rw,[status(thm)],[8524,4662,theory(equality)])).
% cnf(8526,negated_conjecture,($false),inference(cn,[status(thm)],[8525,theory(equality)])).
% cnf(8527,negated_conjecture,($false),8526,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 3625
% # ...of these trivial : 6
% # ...subsumed : 531
% # ...remaining for further processing: 3088
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 2
% # Generated clauses : 10
% # ...of the previous two non-trivial : 11
% # Contextual simplify-reflections : 3069
% # Paramodulations : 2
% # Factorizations : 0
% # Equation resolutions : 3
% # Current number of processed clauses: 24
% # Positive orientable unit clauses: 16
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 4
% # Current number of unprocessed clauses: 3030
% # ...number of literals in the above : 33681
% # Clause-clause subsumption calls (NU) : 965475
% # Rec. Clause-clause subsumption calls : 25677
% # Unit Clause-clause subsumption calls : 1913
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 40 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 17 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 34 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 3.210 s
% # System time : 0.044 s
% # Total time : 3.254 s
% # Maximum resident set size: 0 pages
% PrfWatch: 4.54 CPU 4.64 WC
% FINAL PrfWatch: 4.54 CPU 4.64 WC
% SZS output end Solution for /tmp/SystemOnTPTP17609/NUM617+3.tptp
%
%------------------------------------------------------------------------------