%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM520+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 19:56:40 EST 2010
% Result : Theorem 1.22s
% Output : Solution 1.22s
% 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/SystemOnTPTP4366/NUM520+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP4366/NUM520+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4366/NUM520+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 4498
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(43, axiom,~((xk=sz00|xk=sz10)),file('/tmp/SRASS.s.p', m__2315)).
% fof(44, axiom,~((~(xk=sz00)&~(xk=sz10))),file('/tmp/SRASS.s.p', m__2327)).
% fof(380, plain,(~(xk=sz00)&~(xk=sz10)),inference(fof_nnf,[status(thm)],[43])).
% cnf(381,plain,(xk!=sz10),inference(split_conjunct,[status(thm)],[380])).
% cnf(382,plain,(xk!=sz00),inference(split_conjunct,[status(thm)],[380])).
% fof(383, plain,(xk=sz00|xk=sz10),inference(fof_nnf,[status(thm)],[44])).
% cnf(384,plain,(xk=sz10|xk=sz00),inference(split_conjunct,[status(thm)],[383])).
% cnf(405,plain,(xk=sz10),inference(sr,[status(thm)],[384,382,theory(equality)])).
% cnf(406,plain,($false),inference(sr,[status(thm)],[405,381,theory(equality)])).
% cnf(407,plain,($false),406,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 25
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 25
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 0
% # ...of the previous two non-trivial : 1
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 23
% # Positive orientable unit clauses: 14
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 202
% # ...number of literals in the above : 1605
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 27 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 14 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 25 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.028 s
% # System time : 0.003 s
% # Total time : 0.031 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.21 WC
% FINAL PrfWatch: 0.14 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP4366/NUM520+3.tptp
%
%------------------------------------------------------------------------------