TSTP Solution File: SET082+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET082+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 : art08.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2005MB
% OS : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Fri Jun 15 11:07:09 EDT 2012
% Result : Theorem 0.65s
% Output : Solution 0.65s
% 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/SystemOnTPTP29013/SET082+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29013/SET082+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29013/SET082+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 29129
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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 : 91
% # Removed in clause preprocessing : 8
% # Initial clauses in saturation : 83
% # Processed clauses : 135
% # ...of these trivial : 3
% # ...subsumed : 20
% # ...remaining for further processing: 112
% # Other redundant clauses eliminated : 7
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 2
% # Generated clauses : 456
% # ...of the previous two non-trivial : 305
% # Contextual simplify-reflections : 2
% # Paramodulations : 445
% # Factorizations : 2
% # Equation resolutions : 9
% # Current number of processed clauses: 102
% # Positive orientable unit clauses: 22
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 77
% # Current number of unprocessed clauses: 217
% # ...number of literals in the above : 607
% # Clause-clause subsumption calls (NU) : 1236
% # Rec. Clause-clause subsumption calls : 1078
% # Non-unit clause-clause subsumptions: 17
% # Unit Clause-clause subsumption calls : 242
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 15
% # BW rewrite match successes : 2
% # Backwards rewriting index : 771 nodes, 136 leaves, 1.72+/-1.547 terms/leaf
% # Paramod-from index : 309 nodes, 52 leaves, 1.08+/-0.266 terms/leaf
% # Paramod-into index : 605 nodes, 103 leaves, 1.60+/-1.457 terms/leaf
% # Paramod-neg-atom index : 160 nodes, 29 leaves, 1.31+/-0.463 terms/leaf
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(~(X1=null_class)=>?[X2]:((member(X2,universal_class)&member(X2,X1))&disjoint(X2,X1))),file('/tmp/SRASS.s.p', regularity)).
% fof(3, axiom,![X1]:singleton(X1)=unordered_pair(X1,X1),file('/tmp/SRASS.s.p', singleton_set_defn)).
% fof(5, axiom,![X2]:![X1]:![X4]:(member(X2,unordered_pair(X1,X4))<=>(member(X2,universal_class)&(X2=X1|X2=X4))),file('/tmp/SRASS.s.p', unordered_pair_defn)).
% fof(44, conjecture,![X1]:(~(member(X1,universal_class))=>singleton(X1)=null_class),file('/tmp/SRASS.s.p', singleton_is_null_class)).
% fof(45, negated_conjecture,~(![X1]:(~(member(X1,universal_class))=>singleton(X1)=null_class)),inference(assume_negation,[status(cth)],[44])).
% fof(48, negated_conjecture,~(![X1]:(~(member(X1,universal_class))=>singleton(X1)=null_class)),inference(fof_simplification,[status(thm)],[45,theory(equality)])).
% fof(51, plain,![X1]:(X1=null_class|?[X2]:((member(X2,universal_class)&member(X2,X1))&disjoint(X2,X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(52, plain,![X3]:(X3=null_class|?[X4]:((member(X4,universal_class)&member(X4,X3))&disjoint(X4,X3))),inference(variable_rename,[status(thm)],[51])).
% fof(53, plain,![X3]:(X3=null_class|((member(esk1_1(X3),universal_class)&member(esk1_1(X3),X3))&disjoint(esk1_1(X3),X3))),inference(skolemize,[status(esa)],[52])).
% fof(54, plain,![X3]:(((member(esk1_1(X3),universal_class)|X3=null_class)&(member(esk1_1(X3),X3)|X3=null_class))&(disjoint(esk1_1(X3),X3)|X3=null_class)),inference(distribute,[status(thm)],[53])).
% cnf(56,plain,(X1=null_class|member(esk1_1(X1),X1)),inference(split_conjunct,[status(thm)],[54])).
% cnf(57,plain,(X1=null_class|member(esk1_1(X1),universal_class)),inference(split_conjunct,[status(thm)],[54])).
% fof(58, plain,![X2]:singleton(X2)=unordered_pair(X2,X2),inference(variable_rename,[status(thm)],[3])).
% cnf(59,plain,(singleton(X1)=unordered_pair(X1,X1)),inference(split_conjunct,[status(thm)],[58])).
% fof(68, plain,![X2]:![X1]:![X4]:((~(member(X2,unordered_pair(X1,X4)))|(member(X2,universal_class)&(X2=X1|X2=X4)))&((~(member(X2,universal_class))|(~(X2=X1)&~(X2=X4)))|member(X2,unordered_pair(X1,X4)))),inference(fof_nnf,[status(thm)],[5])).
% fof(69, plain,(![X2]:![X1]:![X4]:(~(member(X2,unordered_pair(X1,X4)))|(member(X2,universal_class)&(X2=X1|X2=X4)))&![X2]:![X1]:![X4]:((~(member(X2,universal_class))|(~(X2=X1)&~(X2=X4)))|member(X2,unordered_pair(X1,X4)))),inference(shift_quantors,[status(thm)],[68])).
% fof(70, plain,(![X5]:![X6]:![X7]:(~(member(X5,unordered_pair(X6,X7)))|(member(X5,universal_class)&(X5=X6|X5=X7)))&![X8]:![X9]:![X10]:((~(member(X8,universal_class))|(~(X8=X9)&~(X8=X10)))|member(X8,unordered_pair(X9,X10)))),inference(variable_rename,[status(thm)],[69])).
% fof(71, plain,![X5]:![X6]:![X7]:![X8]:![X9]:![X10]:((~(member(X5,unordered_pair(X6,X7)))|(member(X5,universal_class)&(X5=X6|X5=X7)))&((~(member(X8,universal_class))|(~(X8=X9)&~(X8=X10)))|member(X8,unordered_pair(X9,X10)))),inference(shift_quantors,[status(thm)],[70])).
% fof(72, plain,![X5]:![X6]:![X7]:![X8]:![X9]:![X10]:(((member(X5,universal_class)|~(member(X5,unordered_pair(X6,X7))))&((X5=X6|X5=X7)|~(member(X5,unordered_pair(X6,X7)))))&(((~(X8=X9)|~(member(X8,universal_class)))|member(X8,unordered_pair(X9,X10)))&((~(X8=X10)|~(member(X8,universal_class)))|member(X8,unordered_pair(X9,X10))))),inference(distribute,[status(thm)],[71])).
% cnf(75,plain,(X1=X3|X1=X2|~member(X1,unordered_pair(X2,X3))),inference(split_conjunct,[status(thm)],[72])).
% fof(274, negated_conjecture,?[X1]:(~(member(X1,universal_class))&~(singleton(X1)=null_class)),inference(fof_nnf,[status(thm)],[48])).
% fof(275, negated_conjecture,?[X2]:(~(member(X2,universal_class))&~(singleton(X2)=null_class)),inference(variable_rename,[status(thm)],[274])).
% fof(276, negated_conjecture,(~(member(esk8_0,universal_class))&~(singleton(esk8_0)=null_class)),inference(skolemize,[status(esa)],[275])).
% cnf(277,negated_conjecture,(singleton(esk8_0)!=null_class),inference(split_conjunct,[status(thm)],[276])).
% cnf(278,negated_conjecture,(~member(esk8_0,universal_class)),inference(split_conjunct,[status(thm)],[276])).
% cnf(285,negated_conjecture,(unordered_pair(esk8_0,esk8_0)!=null_class),inference(rw,[status(thm)],[277,59,theory(equality)]),['unfolding']).
% cnf(344,plain,(esk1_1(unordered_pair(X1,X2))=X1|esk1_1(unordered_pair(X1,X2))=X2|null_class=unordered_pair(X1,X2)),inference(spm,[status(thm)],[75,56,theory(equality)])).
% cnf(695,plain,(esk1_1(unordered_pair(X3,X4))=X3|unordered_pair(X3,X4)=null_class|X4!=X3),inference(ef,[status(thm)],[344,theory(equality)])).
% cnf(706,plain,(esk1_1(unordered_pair(X1,X1))=X1|unordered_pair(X1,X1)=null_class),inference(er,[status(thm)],[695,theory(equality)])).
% cnf(708,plain,(null_class=unordered_pair(X1,X1)|member(X1,universal_class)),inference(spm,[status(thm)],[57,706,theory(equality)])).
% cnf(712,negated_conjecture,(unordered_pair(esk8_0,esk8_0)=null_class),inference(spm,[status(thm)],[278,708,theory(equality)])).
% cnf(827,negated_conjecture,($false),inference(sr,[status(thm)],[712,285,theory(equality)])).
% cnf(828,negated_conjecture,($false),827,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.08 CPU 0.19 WC
% FINAL PrfWatch: 0.08 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP29013/SET082+1.tptp
%
%------------------------------------------------------------------------------