TSTP Solution File: SET056+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET056+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:05:01 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/SystemOnTPTP20766/SET056+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20766/SET056+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20766/SET056+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 20880
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 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 : 92
% # Removed in clause preprocessing : 8
% # Initial clauses in saturation : 84
% # Processed clauses : 181
% # ...of these trivial : 3
% # ...subsumed : 35
% # ...remaining for further processing: 143
% # Other redundant clauses eliminated : 7
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 4
% # Generated clauses : 628
% # ...of the previous two non-trivial : 577
% # Contextual simplify-reflections : 2
% # Paramodulations : 615
% # Factorizations : 4
% # Equation resolutions : 9
% # Current number of processed clauses: 131
% # Positive orientable unit clauses: 27
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 101
% # Current number of unprocessed clauses: 433
% # ...number of literals in the above : 1282
% # Clause-clause subsumption calls (NU) : 2112
% # Rec. Clause-clause subsumption calls : 1847
% # Non-unit clause-clause subsumptions: 28
% # Unit Clause-clause subsumption calls : 518
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 18
% # BW rewrite match successes : 2
% # Backwards rewriting index : 996 nodes, 185 leaves, 1.62+/-1.455 terms/leaf
% # Paramod-from index : 358 nodes, 61 leaves, 1.08+/-0.274 terms/leaf
% # Paramod-into index : 732 nodes, 127 leaves, 1.52+/-1.368 terms/leaf
% # Paramod-neg-atom index : 214 nodes, 41 leaves, 1.32+/-0.515 terms/leaf
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(X1=X2<=>(subclass(X1,X2)&subclass(X2,X1))),file('/tmp/SRASS.s.p', extensionality)).
% fof(4, axiom,![X1]:![X2]:(subclass(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subclass_defn)).
% fof(44, conjecture,![X1]:![X2]:((X1=X2|?[X3]:(member(X3,X1)&~(member(X3,X2))))|?[X6]:(member(X6,X2)&~(member(X6,X1)))),file('/tmp/SRASS.s.p', equality1)).
% fof(45, negated_conjecture,~(![X1]:![X2]:((X1=X2|?[X3]:(member(X3,X1)&~(member(X3,X2))))|?[X6]:(member(X6,X2)&~(member(X6,X1))))),inference(assume_negation,[status(cth)],[44])).
% fof(48, negated_conjecture,~(![X1]:![X2]:((X1=X2|?[X3]:(member(X3,X1)&~(member(X3,X2))))|?[X6]:(member(X6,X2)&~(member(X6,X1))))),inference(fof_simplification,[status(thm)],[45,theory(equality)])).
% fof(51, plain,![X1]:![X2]:((~(X1=X2)|(subclass(X1,X2)&subclass(X2,X1)))&((~(subclass(X1,X2))|~(subclass(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[2])).
% fof(52, 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)],[51])).
% fof(53, 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)],[52])).
% fof(54, 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)],[53])).
% fof(55, 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)],[54])).
% cnf(56,plain,(X1=X2|~subclass(X2,X1)|~subclass(X1,X2)),inference(split_conjunct,[status(thm)],[55])).
% fof(68, 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)],[4])).
% fof(69, 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)],[68])).
% fof(70, 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)],[69])).
% fof(71, 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)],[70])).
% fof(72, 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)],[71])).
% fof(73, 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)],[72])).
% cnf(74,plain,(subclass(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[73])).
% cnf(75,plain,(subclass(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[73])).
% fof(274, negated_conjecture,?[X1]:?[X2]:((~(X1=X2)&![X3]:(~(member(X3,X1))|member(X3,X2)))&![X6]:(~(member(X6,X2))|member(X6,X1))),inference(fof_nnf,[status(thm)],[48])).
% fof(275, negated_conjecture,?[X7]:?[X8]:((~(X7=X8)&![X9]:(~(member(X9,X7))|member(X9,X8)))&![X10]:(~(member(X10,X8))|member(X10,X7))),inference(variable_rename,[status(thm)],[274])).
% fof(276, negated_conjecture,((~(esk8_0=esk9_0)&![X9]:(~(member(X9,esk8_0))|member(X9,esk9_0)))&![X10]:(~(member(X10,esk9_0))|member(X10,esk8_0))),inference(skolemize,[status(esa)],[275])).
% fof(277, negated_conjecture,![X9]:![X10]:((~(esk8_0=esk9_0)&(~(member(X9,esk8_0))|member(X9,esk9_0)))&(~(member(X10,esk9_0))|member(X10,esk8_0))),inference(shift_quantors,[status(thm)],[276])).
% cnf(278,negated_conjecture,(member(X1,esk8_0)|~member(X1,esk9_0)),inference(split_conjunct,[status(thm)],[277])).
% cnf(279,negated_conjecture,(member(X1,esk9_0)|~member(X1,esk8_0)),inference(split_conjunct,[status(thm)],[277])).
% cnf(280,negated_conjecture,(esk8_0!=esk9_0),inference(split_conjunct,[status(thm)],[277])).
% cnf(339,negated_conjecture,(subclass(X1,esk9_0)|~member(esk1_2(X1,esk9_0),esk8_0)),inference(spm,[status(thm)],[74,279,theory(equality)])).
% cnf(376,negated_conjecture,(member(esk1_2(esk9_0,X1),esk8_0)|subclass(esk9_0,X1)),inference(spm,[status(thm)],[278,75,theory(equality)])).
% cnf(597,negated_conjecture,(subclass(esk8_0,esk9_0)),inference(spm,[status(thm)],[339,75,theory(equality)])).
% cnf(598,negated_conjecture,(esk9_0=esk8_0|~subclass(esk9_0,esk8_0)),inference(spm,[status(thm)],[56,597,theory(equality)])).
% cnf(600,negated_conjecture,(~subclass(esk9_0,esk8_0)),inference(sr,[status(thm)],[598,280,theory(equality)])).
% cnf(1015,negated_conjecture,(subclass(esk9_0,esk8_0)),inference(spm,[status(thm)],[74,376,theory(equality)])).
% cnf(1017,negated_conjecture,($false),inference(sr,[status(thm)],[1015,600,theory(equality)])).
% cnf(1018,negated_conjecture,($false),1017,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.10 CPU 0.22 WC
% FINAL PrfWatch: 0.10 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP20766/SET056+1.tptp
% WARNING: TreeLimitedRun lost 0.05s, total lost is 0.05s
%
%------------------------------------------------------------------------------