%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SET077+1 : TPTP v5.3.0. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art01.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2800MHz
% Memory   : 2005MB
% OS       : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Fri Jun 15 11:06:36 EDT 2012

% Result   : Theorem 0.79s
% Output   : Solution 0.79s
% 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/SystemOnTPTP21341/SET077+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP21341/SET077+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21341/SET077+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.5/eproof_ram --print-statistics -xAuto -tAuto --cpu-limit=60 --memory-limit=Auto --tstp-format /tmp/SRASS.s.p 
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC  time limit is 120s
% TreeLimitedRun: PID is 21455
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.04 WC
% # Auto-Ordering is analysing problem.
% # Problem is type GHSMNFFMS21MD
% # Auto-mode selected ordering type KBO6
% # Auto-mode selected ordering precedence scheme <invfreq>
% # Auto-mode selected weight ordering scheme <invfreqrank>
% #
% # Auto-Heuristic is analysing problem.
% # Problem is type GHSMNFFMS21MD
% # Auto-Mode selected heuristic G_E___103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% # and selection function SelectMaxLComplexAvoidPosPred.
% #
% # Initializing proof state
% # Scanning for AC axioms
% # Proof found!
% # SZS status Theorem
% # Parsed axioms                      : 44
% # Removed by relevancy pruning       : 0
% # Initial clauses                    : 90
% # Removed in clause preprocessing    : 8
% # Initial clauses in saturation      : 82
% # Processed clauses                  : 5
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 5
% # 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 : 0
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 0
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 4
% #    Positive orientable unit clauses: 2
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 1
% #    Non-unit-clauses                : 1
% # Current number of unprocessed clauses: 77
% # ...number of literals in the above : 171
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Non-unit clause-clause subsumptions: 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound  : 0
% # BW rewrite match attempts          : 1
% # BW rewrite match successes         : 1
% # Backwards rewriting index :    54 nodes,     8 leaves,   1.12+/-0.331 terms/leaf
% # Paramod-from index      :    15 nodes,     2 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index      :    36 nodes,     5 leaves,   1.20+/-0.400 terms/leaf
% # Paramod-neg-atom index  :    13 nodes,     2 leaves,   1.00+/-0.000 terms/leaf
% # SZS output start CNFRefutation.
% fof(2, axiom,![X2]:![X3]:member(unordered_pair(X2,X3),universal_class),file('/tmp/SRASS.s.p', unordered_pair)).
% fof(7, axiom,![X2]:singleton(X2)=unordered_pair(X2,X2),file('/tmp/SRASS.s.p', singleton_set_defn)).
% fof(44, conjecture,![X2]:member(singleton(X2),universal_class),file('/tmp/SRASS.s.p', singletons_are_sets)).
% fof(45, negated_conjecture,~(![X2]:member(singleton(X2),universal_class)),inference(assume_negation,[status(cth)],[44])).
% fof(57, plain,![X4]:![X5]:member(unordered_pair(X4,X5),universal_class),inference(variable_rename,[status(thm)],[2])).
% cnf(58,plain,(member(unordered_pair(X1,X2),universal_class)),inference(split_conjunct,[status(thm)],[57])).
% fof(81, plain,![X3]:singleton(X3)=unordered_pair(X3,X3),inference(variable_rename,[status(thm)],[7])).
% cnf(82,plain,(singleton(X1)=unordered_pair(X1,X1)),inference(split_conjunct,[status(thm)],[81])).
% fof(273, negated_conjecture,?[X2]:~(member(singleton(X2),universal_class)),inference(fof_nnf,[status(thm)],[45])).
% fof(274, negated_conjecture,?[X3]:~(member(singleton(X3),universal_class)),inference(variable_rename,[status(thm)],[273])).
% fof(275, negated_conjecture,~(member(singleton(esk8_0),universal_class)),inference(skolemize,[status(esa)],[274])).
% cnf(276,negated_conjecture,(~member(singleton(esk8_0),universal_class)),inference(split_conjunct,[status(thm)],[275])).
% cnf(283,negated_conjecture,(~member(unordered_pair(esk8_0,esk8_0),universal_class)),inference(rw,[status(thm)],[276,82,theory(equality)]),['unfolding']).
% cnf(330,negated_conjecture,($false),inference(rw,[status(thm)],[283,58,theory(equality)])).
% cnf(331,negated_conjecture,($false),inference(cn,[status(thm)],[330,theory(equality)])).
% cnf(332,negated_conjecture,($false),331,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.06 CPU 0.18 WC
% FINAL PrfWatch: 0.06 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP21341/SET077+1.tptp
% WARNING: TreeLimitedRun lost 0.10s, total lost is 0.10s
% 
%------------------------------------------------------------------------------