TSTP Solution File: SET060+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET060+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 : chickamauga.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:17 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/SystemOnTPTP8881/SET060+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP8881/SET060+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8881/SET060+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 8979
% 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 : 90
% # Removed in clause preprocessing : 8
% # Initial clauses in saturation : 82
% # Processed clauses : 87
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 87
% # Other redundant clauses eliminated : 5
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 211
% # ...of the previous two non-trivial : 193
% # Contextual simplify-reflections : 0
% # Paramodulations : 204
% # Factorizations : 0
% # Equation resolutions : 7
% # Current number of processed clauses: 83
% # Positive orientable unit clauses: 16
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 66
% # Current number of unprocessed clauses: 188
% # ...number of literals in the above : 504
% # Clause-clause subsumption calls (NU) : 791
% # Rec. Clause-clause subsumption calls : 709
% # Non-unit clause-clause subsumptions: 0
% # Unit Clause-clause subsumption calls : 16
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 0
% # BW rewrite match successes : 0
% # Backwards rewriting index : 694 nodes, 121 leaves, 1.75+/-1.560 terms/leaf
% # Paramod-from index : 239 nodes, 40 leaves, 1.02+/-0.156 terms/leaf
% # Paramod-into index : 546 nodes, 92 leaves, 1.61+/-1.489 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]:![X3]:(member(X3,intersection(X1,X2))<=>(member(X3,X1)&member(X3,X2))),file('/tmp/SRASS.s.p', intersection)).
% fof(2, axiom,![X1]:![X3]:(member(X3,complement(X1))<=>(member(X3,universal_class)&~(member(X3,X1)))),file('/tmp/SRASS.s.p', complement)).
% fof(44, conjecture,![X1]:![X2]:~(member(X2,intersection(complement(X1),X1))),file('/tmp/SRASS.s.p', special_classes_lemma)).
% fof(45, negated_conjecture,~(![X1]:![X2]:~(member(X2,intersection(complement(X1),X1)))),inference(assume_negation,[status(cth)],[44])).
% fof(46, plain,![X1]:![X3]:(member(X3,complement(X1))<=>(member(X3,universal_class)&~(member(X3,X1)))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(48, negated_conjecture,~(![X1]:![X2]:~(member(X2,intersection(complement(X1),X1)))),inference(fof_simplification,[status(thm)],[45,theory(equality)])).
% fof(49, plain,![X1]:![X2]:![X3]:((~(member(X3,intersection(X1,X2)))|(member(X3,X1)&member(X3,X2)))&((~(member(X3,X1))|~(member(X3,X2)))|member(X3,intersection(X1,X2)))),inference(fof_nnf,[status(thm)],[1])).
% fof(50, plain,(![X1]:![X2]:![X3]:(~(member(X3,intersection(X1,X2)))|(member(X3,X1)&member(X3,X2)))&![X1]:![X2]:![X3]:((~(member(X3,X1))|~(member(X3,X2)))|member(X3,intersection(X1,X2)))),inference(shift_quantors,[status(thm)],[49])).
% fof(51, plain,(![X4]:![X5]:![X6]:(~(member(X6,intersection(X4,X5)))|(member(X6,X4)&member(X6,X5)))&![X7]:![X8]:![X9]:((~(member(X9,X7))|~(member(X9,X8)))|member(X9,intersection(X7,X8)))),inference(variable_rename,[status(thm)],[50])).
% fof(52, plain,![X4]:![X5]:![X6]:![X7]:![X8]:![X9]:((~(member(X6,intersection(X4,X5)))|(member(X6,X4)&member(X6,X5)))&((~(member(X9,X7))|~(member(X9,X8)))|member(X9,intersection(X7,X8)))),inference(shift_quantors,[status(thm)],[51])).
% fof(53, plain,![X4]:![X5]:![X6]:![X7]:![X8]:![X9]:(((member(X6,X4)|~(member(X6,intersection(X4,X5))))&(member(X6,X5)|~(member(X6,intersection(X4,X5)))))&((~(member(X9,X7))|~(member(X9,X8)))|member(X9,intersection(X7,X8)))),inference(distribute,[status(thm)],[52])).
% cnf(55,plain,(member(X1,X3)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[53])).
% cnf(56,plain,(member(X1,X2)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[53])).
% fof(57, plain,![X1]:![X3]:((~(member(X3,complement(X1)))|(member(X3,universal_class)&~(member(X3,X1))))&((~(member(X3,universal_class))|member(X3,X1))|member(X3,complement(X1)))),inference(fof_nnf,[status(thm)],[46])).
% fof(58, plain,(![X1]:![X3]:(~(member(X3,complement(X1)))|(member(X3,universal_class)&~(member(X3,X1))))&![X1]:![X3]:((~(member(X3,universal_class))|member(X3,X1))|member(X3,complement(X1)))),inference(shift_quantors,[status(thm)],[57])).
% fof(59, plain,(![X4]:![X5]:(~(member(X5,complement(X4)))|(member(X5,universal_class)&~(member(X5,X4))))&![X6]:![X7]:((~(member(X7,universal_class))|member(X7,X6))|member(X7,complement(X6)))),inference(variable_rename,[status(thm)],[58])).
% fof(60, plain,![X4]:![X5]:![X6]:![X7]:((~(member(X5,complement(X4)))|(member(X5,universal_class)&~(member(X5,X4))))&((~(member(X7,universal_class))|member(X7,X6))|member(X7,complement(X6)))),inference(shift_quantors,[status(thm)],[59])).
% fof(61, plain,![X4]:![X5]:![X6]:![X7]:(((member(X5,universal_class)|~(member(X5,complement(X4))))&(~(member(X5,X4))|~(member(X5,complement(X4)))))&((~(member(X7,universal_class))|member(X7,X6))|member(X7,complement(X6)))),inference(distribute,[status(thm)],[60])).
% cnf(63,plain,(~member(X1,complement(X2))|~member(X1,X2)),inference(split_conjunct,[status(thm)],[61])).
% fof(274, negated_conjecture,?[X1]:?[X2]:member(X2,intersection(complement(X1),X1)),inference(fof_nnf,[status(thm)],[48])).
% fof(275, negated_conjecture,?[X3]:?[X4]:member(X4,intersection(complement(X3),X3)),inference(variable_rename,[status(thm)],[274])).
% fof(276, negated_conjecture,member(esk9_0,intersection(complement(esk8_0),esk8_0)),inference(skolemize,[status(esa)],[275])).
% cnf(277,negated_conjecture,(member(esk9_0,intersection(complement(esk8_0),esk8_0))),inference(split_conjunct,[status(thm)],[276])).
% cnf(334,negated_conjecture,(member(esk9_0,esk8_0)),inference(spm,[status(thm)],[55,277,theory(equality)])).
% cnf(335,negated_conjecture,(member(esk9_0,complement(esk8_0))),inference(spm,[status(thm)],[56,277,theory(equality)])).
% cnf(551,negated_conjecture,(~member(esk9_0,esk8_0)),inference(spm,[status(thm)],[63,335,theory(equality)])).
% cnf(552,negated_conjecture,($false),inference(rw,[status(thm)],[551,334,theory(equality)])).
% cnf(553,negated_conjecture,($false),inference(cn,[status(thm)],[552,theory(equality)])).
% cnf(554,negated_conjecture,($false),553,['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/SystemOnTPTP8881/SET060+1.tptp
%
%------------------------------------------------------------------------------