%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET094+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 : art08.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2005MB
% OS : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Fri Jun 15 11:07:55 EDT 2012
% Result : Theorem 0.64s
% Output : Solution 0.64s
% 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/SystemOnTPTP29588/SET094+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29588/SET094+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29588/SET094+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 29702
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Auto-Ordering is analysing problem.
% # Problem is type GHSMNFFMM21MD
% # Auto-mode selected ordering type KBO6
% # Auto-mode selected ordering precedence scheme <invfreqconjmax>
% # Auto-mode selected weight ordering scheme <invfreqrank>
% #
% # Auto-Heuristic is analysing problem.
% # Problem is type GHSMNFFMM21MD
% # Auto-Mode selected heuristic G_E___107_C45_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 : 92
% # Removed in clause preprocessing : 8
% # Initial clauses in saturation : 84
% # Processed clauses : 88
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 88
% # Other redundant clauses eliminated : 5
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 290
% # ...of the previous two non-trivial : 266
% # Contextual simplify-reflections : 0
% # Paramodulations : 283
% # Factorizations : 0
% # Equation resolutions : 7
% # Current number of processed clauses: 84
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 67
% # Current number of unprocessed clauses: 262
% # ...number of literals in the above : 681
% # Clause-clause subsumption calls (NU) : 727
% # Rec. Clause-clause subsumption calls : 667
% # Non-unit clause-clause subsumptions: 0
% # Unit Clause-clause subsumption calls : 8
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 0
% # BW rewrite match successes : 0
% # Backwards rewriting index : 690 nodes, 120 leaves, 1.76+/-1.565 terms/leaf
% # Paramod-from index : 235 nodes, 39 leaves, 1.03+/-0.158 terms/leaf
% # Paramod-into index : 537 nodes, 90 leaves, 1.62+/-1.502 terms/leaf
% # Paramod-neg-atom index : 139 nodes, 26 leaves, 1.31+/-0.462 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:singleton(X1)=unordered_pair(X1,X1),file('/tmp/SRASS.s.p', singleton_set_defn)).
% fof(4, axiom,![X3]:![X1]:![X2]:(member(X3,unordered_pair(X1,X2))<=>(member(X3,universal_class)&(X3=X1|X3=X2))),file('/tmp/SRASS.s.p', unordered_pair_defn)).
% fof(44, conjecture,![X1]:![X2]:((singleton(member_of(X1))=X1&member(X2,X1))=>member_of(X1)=X2),file('/tmp/SRASS.s.p', property_of_singletons1_1)).
% fof(45, negated_conjecture,~(![X1]:![X2]:((singleton(member_of(X1))=X1&member(X2,X1))=>member_of(X1)=X2)),inference(assume_negation,[status(cth)],[44])).
% fof(48, plain,![X2]:singleton(X2)=unordered_pair(X2,X2),inference(variable_rename,[status(thm)],[1])).
% cnf(49,plain,(singleton(X1)=unordered_pair(X1,X1)),inference(split_conjunct,[status(thm)],[48])).
% fof(60, plain,![X3]:![X1]:![X2]:((~(member(X3,unordered_pair(X1,X2)))|(member(X3,universal_class)&(X3=X1|X3=X2)))&((~(member(X3,universal_class))|(~(X3=X1)&~(X3=X2)))|member(X3,unordered_pair(X1,X2)))),inference(fof_nnf,[status(thm)],[4])).
% fof(61, plain,(![X3]:![X1]:![X2]:(~(member(X3,unordered_pair(X1,X2)))|(member(X3,universal_class)&(X3=X1|X3=X2)))&![X3]:![X1]:![X2]:((~(member(X3,universal_class))|(~(X3=X1)&~(X3=X2)))|member(X3,unordered_pair(X1,X2)))),inference(shift_quantors,[status(thm)],[60])).
% fof(62, plain,(![X4]:![X5]:![X6]:(~(member(X4,unordered_pair(X5,X6)))|(member(X4,universal_class)&(X4=X5|X4=X6)))&![X7]:![X8]:![X9]:((~(member(X7,universal_class))|(~(X7=X8)&~(X7=X9)))|member(X7,unordered_pair(X8,X9)))),inference(variable_rename,[status(thm)],[61])).
% fof(63, plain,![X4]:![X5]:![X6]:![X7]:![X8]:![X9]:((~(member(X4,unordered_pair(X5,X6)))|(member(X4,universal_class)&(X4=X5|X4=X6)))&((~(member(X7,universal_class))|(~(X7=X8)&~(X7=X9)))|member(X7,unordered_pair(X8,X9)))),inference(shift_quantors,[status(thm)],[62])).
% fof(64, plain,![X4]:![X5]:![X6]:![X7]:![X8]:![X9]:(((member(X4,universal_class)|~(member(X4,unordered_pair(X5,X6))))&((X4=X5|X4=X6)|~(member(X4,unordered_pair(X5,X6)))))&(((~(X7=X8)|~(member(X7,universal_class)))|member(X7,unordered_pair(X8,X9)))&((~(X7=X9)|~(member(X7,universal_class)))|member(X7,unordered_pair(X8,X9))))),inference(distribute,[status(thm)],[63])).
% cnf(67,plain,(X1=X3|X1=X2|~member(X1,unordered_pair(X2,X3))),inference(split_conjunct,[status(thm)],[64])).
% fof(273, negated_conjecture,?[X1]:?[X2]:((singleton(member_of(X1))=X1&member(X2,X1))&~(member_of(X1)=X2)),inference(fof_nnf,[status(thm)],[45])).
% fof(274, negated_conjecture,?[X3]:?[X4]:((singleton(member_of(X3))=X3&member(X4,X3))&~(member_of(X3)=X4)),inference(variable_rename,[status(thm)],[273])).
% fof(275, negated_conjecture,((singleton(member_of(esk8_0))=esk8_0&member(esk9_0,esk8_0))&~(member_of(esk8_0)=esk9_0)),inference(skolemize,[status(esa)],[274])).
% cnf(276,negated_conjecture,(member_of(esk8_0)!=esk9_0),inference(split_conjunct,[status(thm)],[275])).
% cnf(277,negated_conjecture,(member(esk9_0,esk8_0)),inference(split_conjunct,[status(thm)],[275])).
% cnf(278,negated_conjecture,(singleton(member_of(esk8_0))=esk8_0),inference(split_conjunct,[status(thm)],[275])).
% cnf(279,negated_conjecture,(unordered_pair(member_of(esk8_0),member_of(esk8_0))=esk8_0),inference(rw,[status(thm)],[278,49,theory(equality)]),['unfolding']).
% cnf(340,negated_conjecture,(X1=member_of(esk8_0)|~member(X1,esk8_0)),inference(spm,[status(thm)],[67,279,theory(equality)])).
% cnf(626,negated_conjecture,(esk9_0=member_of(esk8_0)),inference(spm,[status(thm)],[340,277,theory(equality)])).
% cnf(633,negated_conjecture,($false),inference(sr,[status(thm)],[626,276,theory(equality)])).
% cnf(634,negated_conjecture,($false),633,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.08 CPU 0.18 WC
% FINAL PrfWatch: 0.08 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP29588/SET094+1.tptp
%
%------------------------------------------------------------------------------