TSTP Solution File: SET079+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET079+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 : richmond.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:06:42 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/SystemOnTPTP20245/SET079+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP20245/SET079+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20245/SET079+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 20343
% 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 : 117
% # ...of these trivial : 3
% # ...subsumed : 11
% # ...remaining for further processing: 103
% # Other redundant clauses eliminated : 5
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 5
% # Backward-rewritten : 1
% # Generated clauses : 354
% # ...of the previous two non-trivial : 313
% # Contextual simplify-reflections : 2
% # Paramodulations : 347
% # Factorizations : 0
% # Equation resolutions : 7
% # Current number of processed clauses: 93
% # Positive orientable unit clauses: 22
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 70
% # Current number of unprocessed clauses: 248
% # ...number of literals in the above : 666
% # Clause-clause subsumption calls (NU) : 669
% # Rec. Clause-clause subsumption calls : 567
% # Non-unit clause-clause subsumptions: 10
% # Unit Clause-clause subsumption calls : 106
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 14
% # BW rewrite match successes : 1
% # Backwards rewriting index : 754 nodes, 133 leaves, 1.71+/-1.555 terms/leaf
% # Paramod-from index : 289 nodes, 48 leaves, 1.02+/-0.143 terms/leaf
% # Paramod-into index : 588 nodes, 100 leaves, 1.58+/-1.471 terms/leaf
% # Paramod-neg-atom index : 152 nodes, 28 leaves, 1.32+/-0.467 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:~(member(X1,null_class)),file('/tmp/SRASS.s.p', null_class_defn)).
% 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', corollary_to_set_in_its_singleton)).
% fof(45, negated_conjecture,~(![X1]:(member(X1,universal_class)=>~(singleton(X1)=null_class))),inference(assume_negation,[status(cth)],[44])).
% fof(46, plain,![X1]:~(member(X1,null_class)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(48, plain,![X2]:~(member(X2,null_class)),inference(variable_rename,[status(thm)],[46])).
% cnf(49,plain,(~member(X1,null_class)),inference(split_conjunct,[status(thm)],[48])).
% fof(57, plain,![X2]:singleton(X2)=unordered_pair(X2,X2),inference(variable_rename,[status(thm)],[3])).
% cnf(58,plain,(singleton(X1)=unordered_pair(X1,X1)),inference(split_conjunct,[status(thm)],[57])).
% fof(67, 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(68, 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)],[67])).
% fof(69, 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)],[68])).
% fof(70, 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)],[69])).
% fof(71, 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)],[70])).
% cnf(72,plain,(member(X1,unordered_pair(X2,X3))|~member(X1,universal_class)|X1!=X3),inference(split_conjunct,[status(thm)],[71])).
% fof(273, negated_conjecture,?[X1]:(member(X1,universal_class)&singleton(X1)=null_class),inference(fof_nnf,[status(thm)],[45])).
% fof(274, negated_conjecture,?[X2]:(member(X2,universal_class)&singleton(X2)=null_class),inference(variable_rename,[status(thm)],[273])).
% fof(275, negated_conjecture,(member(esk8_0,universal_class)&singleton(esk8_0)=null_class),inference(skolemize,[status(esa)],[274])).
% cnf(276,negated_conjecture,(singleton(esk8_0)=null_class),inference(split_conjunct,[status(thm)],[275])).
% cnf(277,negated_conjecture,(member(esk8_0,universal_class)),inference(split_conjunct,[status(thm)],[275])).
% cnf(278,negated_conjecture,(unordered_pair(esk8_0,esk8_0)=null_class),inference(rw,[status(thm)],[276,58,theory(equality)]),['unfolding']).
% cnf(342,plain,(member(X1,unordered_pair(X2,X1))|~member(X1,universal_class)),inference(er,[status(thm)],[72,theory(equality)])).
% cnf(744,negated_conjecture,(member(esk8_0,null_class)|~member(esk8_0,universal_class)),inference(spm,[status(thm)],[342,278,theory(equality)])).
% cnf(748,negated_conjecture,(member(esk8_0,null_class)|$false),inference(rw,[status(thm)],[744,277,theory(equality)])).
% cnf(749,negated_conjecture,(member(esk8_0,null_class)),inference(cn,[status(thm)],[748,theory(equality)])).
% cnf(750,negated_conjecture,($false),inference(sr,[status(thm)],[749,49,theory(equality)])).
% cnf(751,negated_conjecture,($false),750,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.03 CPU 0.07 WC
% FINAL PrfWatch: 0.03 CPU 0.07 WC
% SZS output end Solution for /tmp/SystemOnTPTP20245/SET079+1.tptp
%
%------------------------------------------------------------------------------