TSTP Solution File: SET095+1 by SRASS---0.1

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SET095+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 : sharpsburg.cs.miami.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Core(TM)2 CPU          6600  @ 2.40GHz @ 2400MHz
% Memory   : 1003MB
% OS       : Linux 2.6.32.26-175.fc12.x86_64
% CPULimit : 300s
% DateTime : Fri Jun 15 11:08:01 EDT 2012

% Result   : Theorem 0.98s
% Output   : Solution 0.98s
% 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/SystemOnTPTP32116/SET095+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP32116/SET095+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32116/SET095+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 32214
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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                    : 91
% # Removed in clause preprocessing    : 8
% # Initial clauses in saturation      : 83
% # Processed clauses                  : 1877
% # ...of these trivial                : 10
% # ...subsumed                        : 1055
% # ...remaining for further processing: 812
% # Other redundant clauses eliminated : 15
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 47
% # Backward-rewritten                 : 100
% # Generated clauses                  : 18637
% # ...of the previous two non-trivial : 16472
% # Contextual simplify-reflections    : 363
% # Paramodulations                    : 18597
% # Factorizations                     : 23
% # Equation resolutions               : 17
% # Current number of processed clauses: 661
% #    Positive orientable unit clauses: 100
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 13
% #    Non-unit-clauses                : 548
% # Current number of unprocessed clauses: 11591
% # ...number of literals in the above : 39286
% # Clause-clause subsumption calls (NU) : 67740
% # Rec. Clause-clause subsumption calls : 48781
% # Non-unit clause-clause subsumptions: 986
% # Unit Clause-clause subsumption calls : 4241
% # Rewrite failures with RHS unbound  : 0
% # BW rewrite match attempts          : 73
% # BW rewrite match successes         : 22
% # Backwards rewriting index :  3385 nodes,   742 leaves,   1.68+/-2.248 terms/leaf
% # Paramod-from index      :  1201 nodes,   249 leaves,   1.25+/-0.702 terms/leaf
% # Paramod-into index      :  2351 nodes,   490 leaves,   1.61+/-2.368 terms/leaf
% # Paramod-neg-atom index  :   681 nodes,   152 leaves,   1.56+/-1.239 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(subclass(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subclass_defn)).
% fof(7, axiom,![X1]:singleton(X1)=unordered_pair(X1,X1),file('/tmp/SRASS.s.p', singleton_set_defn)).
% fof(8, 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]:(member(X1,X2)=>subclass(singleton(X1),X2)),file('/tmp/SRASS.s.p', property_of_singletons2)).
% fof(45, negated_conjecture,~(![X1]:![X2]:(member(X1,X2)=>subclass(singleton(X1),X2))),inference(assume_negation,[status(cth)],[44])).
% fof(48, plain,![X1]:![X2]:((~(subclass(X1,X2))|![X3]:(~(member(X3,X1))|member(X3,X2)))&(?[X3]:(member(X3,X1)&~(member(X3,X2)))|subclass(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(49, plain,(![X1]:![X2]:(~(subclass(X1,X2))|![X3]:(~(member(X3,X1))|member(X3,X2)))&![X1]:![X2]:(?[X3]:(member(X3,X1)&~(member(X3,X2)))|subclass(X1,X2))),inference(shift_quantors,[status(thm)],[48])).
% fof(50, plain,(![X4]:![X5]:(~(subclass(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&![X7]:![X8]:(?[X9]:(member(X9,X7)&~(member(X9,X8)))|subclass(X7,X8))),inference(variable_rename,[status(thm)],[49])).
% fof(51, plain,(![X4]:![X5]:(~(subclass(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&![X7]:![X8]:((member(esk1_2(X7,X8),X7)&~(member(esk1_2(X7,X8),X8)))|subclass(X7,X8))),inference(skolemize,[status(esa)],[50])).
% fof(52, plain,![X4]:![X5]:![X6]:![X7]:![X8]:((~(subclass(X4,X5))|(~(member(X6,X4))|member(X6,X5)))&((member(esk1_2(X7,X8),X7)&~(member(esk1_2(X7,X8),X8)))|subclass(X7,X8))),inference(shift_quantors,[status(thm)],[51])).
% fof(53, plain,![X4]:![X5]:![X6]:![X7]:![X8]:((~(subclass(X4,X5))|(~(member(X6,X4))|member(X6,X5)))&((member(esk1_2(X7,X8),X7)|subclass(X7,X8))&(~(member(esk1_2(X7,X8),X8))|subclass(X7,X8)))),inference(distribute,[status(thm)],[52])).
% cnf(54,plain,(subclass(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,plain,(subclass(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[53])).
% fof(85, plain,![X2]:singleton(X2)=unordered_pair(X2,X2),inference(variable_rename,[status(thm)],[7])).
% cnf(86,plain,(singleton(X1)=unordered_pair(X1,X1)),inference(split_conjunct,[status(thm)],[85])).
% fof(87, 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)],[8])).
% fof(88, 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)],[87])).
% fof(89, 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)],[88])).
% fof(90, 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)],[89])).
% fof(91, 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)],[90])).
% cnf(94,plain,(X1=X3|X1=X2|~member(X1,unordered_pair(X2,X3))),inference(split_conjunct,[status(thm)],[91])).
% fof(273, negated_conjecture,?[X1]:?[X2]:(member(X1,X2)&~(subclass(singleton(X1),X2))),inference(fof_nnf,[status(thm)],[45])).
% fof(274, negated_conjecture,?[X3]:?[X4]:(member(X3,X4)&~(subclass(singleton(X3),X4))),inference(variable_rename,[status(thm)],[273])).
% fof(275, negated_conjecture,(member(esk8_0,esk9_0)&~(subclass(singleton(esk8_0),esk9_0))),inference(skolemize,[status(esa)],[274])).
% cnf(276,negated_conjecture,(~subclass(singleton(esk8_0),esk9_0)),inference(split_conjunct,[status(thm)],[275])).
% cnf(277,negated_conjecture,(member(esk8_0,esk9_0)),inference(split_conjunct,[status(thm)],[275])).
% cnf(284,negated_conjecture,(~subclass(unordered_pair(esk8_0,esk8_0),esk9_0)),inference(rw,[status(thm)],[276,86,theory(equality)]),['unfolding']).
% cnf(350,plain,(esk1_2(unordered_pair(X1,X2),X3)=X1|esk1_2(unordered_pair(X1,X2),X3)=X2|subclass(unordered_pair(X1,X2),X3)),inference(spm,[status(thm)],[94,55,theory(equality)])).
% cnf(746,plain,(esk1_2(unordered_pair(X4,X5),X6)=X4|subclass(unordered_pair(X4,X5),X6)|X5!=X4),inference(ef,[status(thm)],[350,theory(equality)])).
% cnf(753,plain,(esk1_2(unordered_pair(X1,X1),X2)=X1|subclass(unordered_pair(X1,X1),X2)),inference(er,[status(thm)],[746,theory(equality)])).
% cnf(23191,plain,(subclass(unordered_pair(X1,X1),X2)|~member(X1,X2)),inference(spm,[status(thm)],[54,753,theory(equality)])).
% cnf(23343,negated_conjecture,(~member(esk8_0,esk9_0)),inference(spm,[status(thm)],[284,23191,theory(equality)])).
% cnf(23355,negated_conjecture,($false),inference(rw,[status(thm)],[23343,277,theory(equality)])).
% cnf(23356,negated_conjecture,($false),inference(cn,[status(thm)],[23355,theory(equality)])).
% cnf(23357,negated_conjecture,($false),23356,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.67 CPU 0.48 WC
% FINAL PrfWatch: 0.67 CPU 0.48 WC
% SZS output end Solution for /tmp/SystemOnTPTP32116/SET095+1.tptp
% 
%------------------------------------------------------------------------------