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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SET063+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 : bull-run.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:36 EDT 2012

% Result   : Theorem 0.34s
% Output   : Solution 0.34s
% 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/SystemOnTPTP3575/SET063+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP3575/SET063+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3575/SET063+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 3673
% 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                  : 85
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 85
% # Other redundant clauses eliminated : 5
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 1
% # Generated clauses                  : 204
% # ...of the previous two non-trivial : 185
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 197
% # Factorizations                     : 0
% # Equation resolutions               : 7
% # Current number of processed clauses: 80
% #    Positive orientable unit clauses: 12
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 2
% #    Non-unit-clauses                : 66
% # Current number of unprocessed clauses: 183
% # ...number of literals in the above : 492
% # Clause-clause subsumption calls (NU) : 681
% # Rec. Clause-clause subsumption calls : 633
% # Non-unit clause-clause subsumptions: 0
% # Unit Clause-clause subsumption calls : 10
% # Rewrite failures with RHS unbound  : 0
% # BW rewrite match attempts          : 1
% # BW rewrite match successes         : 1
% # Backwards rewriting index :   654 nodes,   114 leaves,   1.80+/-1.596 terms/leaf
% # Paramod-from index      :   217 nodes,    36 leaves,   1.03+/-0.164 terms/leaf
% # Paramod-into index      :   505 nodes,    85 leaves,   1.66+/-1.538 terms/leaf
% # Paramod-neg-atom index  :   134 nodes,    25 leaves,   1.32+/-0.466 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(X1=X2<=>(subclass(X1,X2)&subclass(X2,X1))),file('/tmp/SRASS.s.p', extensionality)).
% fof(2, axiom,![X1]:~(member(X1,null_class)),file('/tmp/SRASS.s.p', null_class_defn)).
% fof(3, axiom,![X1]:![X2]:(subclass(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subclass_defn)).
% fof(44, conjecture,![X1]:(subclass(X1,null_class)=>X1=null_class),file('/tmp/SRASS.s.p', corollary_of_null_class_is_subclass)).
% fof(45, negated_conjecture,~(![X1]:(subclass(X1,null_class)=>X1=null_class)),inference(assume_negation,[status(cth)],[44])).
% fof(46, plain,![X1]:~(member(X1,null_class)),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(48, plain,![X1]:![X2]:((~(X1=X2)|(subclass(X1,X2)&subclass(X2,X1)))&((~(subclass(X1,X2))|~(subclass(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[1])).
% fof(49, plain,(![X1]:![X2]:(~(X1=X2)|(subclass(X1,X2)&subclass(X2,X1)))&![X1]:![X2]:((~(subclass(X1,X2))|~(subclass(X2,X1)))|X1=X2)),inference(shift_quantors,[status(thm)],[48])).
% fof(50, plain,(![X3]:![X4]:(~(X3=X4)|(subclass(X3,X4)&subclass(X4,X3)))&![X5]:![X6]:((~(subclass(X5,X6))|~(subclass(X6,X5)))|X5=X6)),inference(variable_rename,[status(thm)],[49])).
% fof(51, plain,![X3]:![X4]:![X5]:![X6]:((~(X3=X4)|(subclass(X3,X4)&subclass(X4,X3)))&((~(subclass(X5,X6))|~(subclass(X6,X5)))|X5=X6)),inference(shift_quantors,[status(thm)],[50])).
% fof(52, plain,![X3]:![X4]:![X5]:![X6]:(((subclass(X3,X4)|~(X3=X4))&(subclass(X4,X3)|~(X3=X4)))&((~(subclass(X5,X6))|~(subclass(X6,X5)))|X5=X6)),inference(distribute,[status(thm)],[51])).
% cnf(53,plain,(X1=X2|~subclass(X2,X1)|~subclass(X1,X2)),inference(split_conjunct,[status(thm)],[52])).
% fof(56, plain,![X2]:~(member(X2,null_class)),inference(variable_rename,[status(thm)],[46])).
% cnf(57,plain,(~member(X1,null_class)),inference(split_conjunct,[status(thm)],[56])).
% fof(58, 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)],[3])).
% fof(59, 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)],[58])).
% fof(60, 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)],[59])).
% fof(61, 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)],[60])).
% fof(62, 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)],[61])).
% fof(63, 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)],[62])).
% cnf(65,plain,(subclass(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[63])).
% fof(273, negated_conjecture,?[X1]:(subclass(X1,null_class)&~(X1=null_class)),inference(fof_nnf,[status(thm)],[45])).
% fof(274, negated_conjecture,?[X2]:(subclass(X2,null_class)&~(X2=null_class)),inference(variable_rename,[status(thm)],[273])).
% fof(275, negated_conjecture,(subclass(esk8_0,null_class)&~(esk8_0=null_class)),inference(skolemize,[status(esa)],[274])).
% cnf(276,negated_conjecture,(esk8_0!=null_class),inference(split_conjunct,[status(thm)],[275])).
% cnf(277,negated_conjecture,(subclass(esk8_0,null_class)),inference(split_conjunct,[status(thm)],[275])).
% cnf(334,negated_conjecture,(null_class=esk8_0|~subclass(null_class,esk8_0)),inference(spm,[status(thm)],[53,277,theory(equality)])).
% cnf(338,negated_conjecture,(~subclass(null_class,esk8_0)),inference(sr,[status(thm)],[334,276,theory(equality)])).
% cnf(342,plain,(subclass(null_class,X1)),inference(spm,[status(thm)],[57,65,theory(equality)])).
% cnf(547,negated_conjecture,($false),inference(rw,[status(thm)],[338,342,theory(equality)])).
% cnf(548,negated_conjecture,($false),inference(cn,[status(thm)],[547,theory(equality)])).
% cnf(549,negated_conjecture,($false),548,['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/SystemOnTPTP3575/SET063+1.tptp
% 
%------------------------------------------------------------------------------