%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SYN732+1 : TPTP v5.0.0. Released v2.5.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art02.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 : Thu Dec 30 10:00:27 EST 2010

% Result   : Theorem 0.86s
% Output   : Solution 0.86s
% 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/SystemOnTPTP21178/SYN732+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP21178/SYN732+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21178/SYN732+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 21274
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time   : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,(![X1]:(![X2]:p(X2,X1)=>![X3]:q(X3,X1))=>?[X4]:(?[X5]:p(X5,X4)=>?[X6]:(p(X4,X6)|q(X6,X4)))),file('/tmp/SRASS.s.p', x3411)).
% fof(2, negated_conjecture,~((![X1]:(![X2]:p(X2,X1)=>![X3]:q(X3,X1))=>?[X4]:(?[X5]:p(X5,X4)=>?[X6]:(p(X4,X6)|q(X6,X4))))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,(![X1]:(?[X2]:~(p(X2,X1))|![X3]:q(X3,X1))&![X4]:(?[X5]:p(X5,X4)&![X6]:(~(p(X4,X6))&~(q(X6,X4))))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,(![X7]:(?[X8]:~(p(X8,X7))|![X9]:q(X9,X7))&![X10]:(?[X11]:p(X11,X10)&![X12]:(~(p(X10,X12))&~(q(X12,X10))))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,(![X7]:(~(p(esk1_1(X7),X7))|![X9]:q(X9,X7))&![X10]:(p(esk2_1(X10),X10)&![X12]:(~(p(X10,X12))&~(q(X12,X10))))),inference(skolemize,[status(esa)],[4])).
% fof(6, negated_conjecture,![X7]:![X9]:![X10]:![X12]:(((~(p(X10,X12))&~(q(X12,X10)))&p(esk2_1(X10),X10))&(q(X9,X7)|~(p(esk1_1(X7),X7)))),inference(shift_quantors,[status(thm)],[5])).
% cnf(8,negated_conjecture,(p(esk2_1(X1),X1)),inference(split_conjunct,[status(thm)],[6])).
% cnf(10,negated_conjecture,(~p(X1,X2)),inference(split_conjunct,[status(thm)],[6])).
% cnf(11,negated_conjecture,($false),inference(sr,[status(thm)],[8,10,theory(equality)])).
% cnf(12,negated_conjecture,($false),11,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                : 3
% # ...of these trivial              : 0
% # ...subsumed                      : 0
% # ...remaining for further processing: 3
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                : 0
% # Backward-rewritten               : 0
% # Generated clauses                : 0
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections  : 0
% # Paramodulations                  : 0
% # Factorizations                   : 0
% # Equation resolutions             : 0
% # Current number of processed clauses: 2
% #    Positive orientable unit clauses: 0
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses         : 2
% #    Non-unit-clauses              : 0
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 2
% # 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      : 0
% # Indexed BW rewrite successes     : 0
% # Backwards rewriting index:     3 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-from index:            0 leaves,   0.00+/-0.000 terms/leaf
% # Paramod-into index:            2 leaves,   1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time            : 0.006 s
% # System time          : 0.004 s
% # Total time           : 0.010 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.16 WC
% FINAL PrfWatch: 0.09 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP21178/SYN732+1.tptp
% 
%------------------------------------------------------------------------------