%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : LCL666+1.001 : TPTP v5.0.0. Released v4.0.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 : Wed Dec 29 15:08:50 EST 2010

% Result   : Theorem 0.85s
% Output   : Solution 0.85s
% 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/SystemOnTPTP22251/LCL666+1.001.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP22251/LCL666+1.001.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22251/LCL666+1.001.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 22347
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.009 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:r1(X1,X1),file('/tmp/SRASS.s.p', reflexivity)).
% fof(2, conjecture,~(?[X1]:~((~(![X2]:(~(r1(X1,X2))|~((p201(X2)&p101(X2)))))|~((p201(X1)&p101(X1)))))),file('/tmp/SRASS.s.p', main)).
% fof(3, negated_conjecture,~(~(?[X1]:~((~(![X2]:(~(r1(X1,X2))|~((p201(X2)&p101(X2)))))|~((p201(X1)&p101(X1))))))),inference(assume_negation,[status(cth)],[2])).
% fof(4, negated_conjecture,~(~(?[X1]:~((~(![X2]:(~(r1(X1,X2))|~((p201(X2)&p101(X2)))))|~((p201(X1)&p101(X1))))))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(5, plain,![X2]:r1(X2,X2),inference(variable_rename,[status(thm)],[1])).
% cnf(6,plain,(r1(X1,X1)),inference(split_conjunct,[status(thm)],[5])).
% fof(7, negated_conjecture,?[X1]:(![X2]:(~(r1(X1,X2))|(~(p201(X2))|~(p101(X2))))&(p201(X1)&p101(X1))),inference(fof_nnf,[status(thm)],[4])).
% fof(8, negated_conjecture,?[X3]:(![X4]:(~(r1(X3,X4))|(~(p201(X4))|~(p101(X4))))&(p201(X3)&p101(X3))),inference(variable_rename,[status(thm)],[7])).
% fof(9, negated_conjecture,(![X4]:(~(r1(esk1_0,X4))|(~(p201(X4))|~(p101(X4))))&(p201(esk1_0)&p101(esk1_0))),inference(skolemize,[status(esa)],[8])).
% fof(10, negated_conjecture,![X4]:((~(r1(esk1_0,X4))|(~(p201(X4))|~(p101(X4))))&(p201(esk1_0)&p101(esk1_0))),inference(shift_quantors,[status(thm)],[9])).
% cnf(11,negated_conjecture,(p101(esk1_0)),inference(split_conjunct,[status(thm)],[10])).
% cnf(12,negated_conjecture,(p201(esk1_0)),inference(split_conjunct,[status(thm)],[10])).
% cnf(13,negated_conjecture,(~p101(X1)|~p201(X1)|~r1(esk1_0,X1)),inference(split_conjunct,[status(thm)],[10])).
% cnf(14,negated_conjecture,(~p101(esk1_0)|~p201(esk1_0)),inference(spm,[status(thm)],[13,6,theory(equality)])).
% cnf(15,negated_conjecture,($false|~p201(esk1_0)),inference(rw,[status(thm)],[14,11,theory(equality)])).
% cnf(16,negated_conjecture,($false|$false),inference(rw,[status(thm)],[15,12,theory(equality)])).
% cnf(17,negated_conjecture,($false),inference(cn,[status(thm)],[16,theory(equality)])).
% cnf(18,negated_conjecture,($false),17,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 8
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 8
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 1
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 1
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 4
% #    Positive orientable unit clauses: 3
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 0
% #    Non-unit-clauses                : 1
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # 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:     8 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-from index:            3 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:            5 leaves,   1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time              : 0.006 s
% # System time            : 0.003 s
% # Total time             : 0.009 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.08 CPU 0.16 WC
% FINAL PrfWatch: 0.08 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP22251/LCL666+1.001.tptp
% 
%------------------------------------------------------------------------------