%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET065+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 : appomattox.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:05:47 EDT 2012
% Result : Theorem 0.33s
% Output : Solution 0.33s
% 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/SystemOnTPTP17683/SET065+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP17683/SET065+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17683/SET065+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 17782
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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 : 96
% # ...of these trivial : 2
% # ...subsumed : 4
% # ...remaining for further processing: 90
% # Other redundant clauses eliminated : 5
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 1
% # Generated clauses : 233
% # ...of the previous two non-trivial : 207
% # Contextual simplify-reflections : 0
% # Paramodulations : 226
% # Factorizations : 0
% # Equation resolutions : 7
% # Current number of processed clauses: 81
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 64
% # Current number of unprocessed clauses: 163
% # ...number of literals in the above : 458
% # Clause-clause subsumption calls (NU) : 626
% # Rec. Clause-clause subsumption calls : 542
% # Non-unit clause-clause subsumptions: 6
% # Unit Clause-clause subsumption calls : 73
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 14
% # BW rewrite match successes : 1
% # Backwards rewriting index : 668 nodes, 117 leaves, 1.77+/-1.593 terms/leaf
% # Paramod-from index : 235 nodes, 39 leaves, 1.03+/-0.158 terms/leaf
% # Paramod-into index : 509 nodes, 86 leaves, 1.65+/-1.531 terms/leaf
% # Paramod-neg-atom index : 144 nodes, 26 leaves, 1.35+/-0.476 terms/leaf
% # SZS output start CNFRefutation.
% fof(10, axiom,![X1]:![X3]:(subclass(X1,X3)<=>![X2]:(member(X2,X1)=>member(X2,X3))),file('/tmp/SRASS.s.p', subclass_defn)).
% fof(11, axiom,![X1]:subclass(X1,universal_class),file('/tmp/SRASS.s.p', class_elements_are_sets)).
% fof(13, axiom,?[X1]:((member(X1,universal_class)&inductive(X1))&![X3]:(inductive(X3)=>subclass(X1,X3))),file('/tmp/SRASS.s.p', infinity)).
% fof(20, axiom,![X1]:(inductive(X1)<=>(member(null_class,X1)&subclass(image(successor_relation,X1),X1))),file('/tmp/SRASS.s.p', inductive_defn)).
% fof(44, conjecture,member(null_class,universal_class),file('/tmp/SRASS.s.p', null_class_is_a_set)).
% fof(45, negated_conjecture,~(member(null_class,universal_class)),inference(assume_negation,[status(cth)],[44])).
% fof(48, negated_conjecture,~(member(null_class,universal_class)),inference(fof_simplification,[status(thm)],[45,theory(equality)])).
% fof(98, plain,![X1]:![X3]:((~(subclass(X1,X3))|![X2]:(~(member(X2,X1))|member(X2,X3)))&(?[X2]:(member(X2,X1)&~(member(X2,X3)))|subclass(X1,X3))),inference(fof_nnf,[status(thm)],[10])).
% fof(99, plain,(![X1]:![X3]:(~(subclass(X1,X3))|![X2]:(~(member(X2,X1))|member(X2,X3)))&![X1]:![X3]:(?[X2]:(member(X2,X1)&~(member(X2,X3)))|subclass(X1,X3))),inference(shift_quantors,[status(thm)],[98])).
% fof(100, 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)],[99])).
% fof(101, plain,(![X4]:![X5]:(~(subclass(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&![X7]:![X8]:((member(esk5_2(X7,X8),X7)&~(member(esk5_2(X7,X8),X8)))|subclass(X7,X8))),inference(skolemize,[status(esa)],[100])).
% fof(102, plain,![X4]:![X5]:![X6]:![X7]:![X8]:((~(subclass(X4,X5))|(~(member(X6,X4))|member(X6,X5)))&((member(esk5_2(X7,X8),X7)&~(member(esk5_2(X7,X8),X8)))|subclass(X7,X8))),inference(shift_quantors,[status(thm)],[101])).
% fof(103, plain,![X4]:![X5]:![X6]:![X7]:![X8]:((~(subclass(X4,X5))|(~(member(X6,X4))|member(X6,X5)))&((member(esk5_2(X7,X8),X7)|subclass(X7,X8))&(~(member(esk5_2(X7,X8),X8))|subclass(X7,X8)))),inference(distribute,[status(thm)],[102])).
% cnf(106,plain,(member(X1,X2)|~member(X1,X3)|~subclass(X3,X2)),inference(split_conjunct,[status(thm)],[103])).
% fof(107, plain,![X2]:subclass(X2,universal_class),inference(variable_rename,[status(thm)],[11])).
% cnf(108,plain,(subclass(X1,universal_class)),inference(split_conjunct,[status(thm)],[107])).
% fof(117, plain,?[X1]:((member(X1,universal_class)&inductive(X1))&![X3]:(~(inductive(X3))|subclass(X1,X3))),inference(fof_nnf,[status(thm)],[13])).
% fof(118, plain,?[X4]:((member(X4,universal_class)&inductive(X4))&![X5]:(~(inductive(X5))|subclass(X4,X5))),inference(variable_rename,[status(thm)],[117])).
% fof(119, plain,((member(esk6_0,universal_class)&inductive(esk6_0))&![X5]:(~(inductive(X5))|subclass(esk6_0,X5))),inference(skolemize,[status(esa)],[118])).
% fof(120, plain,![X5]:((member(esk6_0,universal_class)&inductive(esk6_0))&(~(inductive(X5))|subclass(esk6_0,X5))),inference(shift_quantors,[status(thm)],[119])).
% cnf(122,plain,(inductive(esk6_0)),inference(split_conjunct,[status(thm)],[120])).
% fof(168, plain,![X1]:((~(inductive(X1))|(member(null_class,X1)&subclass(image(successor_relation,X1),X1)))&((~(member(null_class,X1))|~(subclass(image(successor_relation,X1),X1)))|inductive(X1))),inference(fof_nnf,[status(thm)],[20])).
% fof(169, plain,(![X1]:(~(inductive(X1))|(member(null_class,X1)&subclass(image(successor_relation,X1),X1)))&![X1]:((~(member(null_class,X1))|~(subclass(image(successor_relation,X1),X1)))|inductive(X1))),inference(shift_quantors,[status(thm)],[168])).
% fof(170, plain,(![X2]:(~(inductive(X2))|(member(null_class,X2)&subclass(image(successor_relation,X2),X2)))&![X3]:((~(member(null_class,X3))|~(subclass(image(successor_relation,X3),X3)))|inductive(X3))),inference(variable_rename,[status(thm)],[169])).
% fof(171, plain,![X2]:![X3]:((~(inductive(X2))|(member(null_class,X2)&subclass(image(successor_relation,X2),X2)))&((~(member(null_class,X3))|~(subclass(image(successor_relation,X3),X3)))|inductive(X3))),inference(shift_quantors,[status(thm)],[170])).
% fof(172, plain,![X2]:![X3]:(((member(null_class,X2)|~(inductive(X2)))&(subclass(image(successor_relation,X2),X2)|~(inductive(X2))))&((~(member(null_class,X3))|~(subclass(image(successor_relation,X3),X3)))|inductive(X3))),inference(distribute,[status(thm)],[171])).
% cnf(175,plain,(member(null_class,X1)|~inductive(X1)),inference(split_conjunct,[status(thm)],[172])).
% cnf(274,negated_conjecture,(~member(null_class,universal_class)),inference(split_conjunct,[status(thm)],[48])).
% cnf(329,plain,(member(null_class,esk6_0)),inference(spm,[status(thm)],[175,122,theory(equality)])).
% cnf(344,plain,(member(X1,universal_class)|~member(X1,X2)),inference(spm,[status(thm)],[106,108,theory(equality)])).
% cnf(576,plain,(member(null_class,universal_class)),inference(spm,[status(thm)],[344,329,theory(equality)])).
% cnf(578,plain,($false),inference(sr,[status(thm)],[576,274,theory(equality)])).
% cnf(579,plain,($false),578,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.03 CPU 0.06 WC
% FINAL PrfWatch: 0.03 CPU 0.06 WC
% SZS output end Solution for /tmp/SystemOnTPTP17683/SET065+1.tptp
%
%------------------------------------------------------------------------------