TSTP Solution File: SET024+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET024+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 : shiloh.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:04:35 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/SystemOnTPTP15515/SET024+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP15515/SET024+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15515/SET024+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 15613
% 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 : 108
% # ...of these trivial : 3
% # ...subsumed : 7
% # ...remaining for further processing: 98
% # Other redundant clauses eliminated : 5
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 5
% # Backward-rewritten : 1
% # Generated clauses : 259
% # ...of the previous two non-trivial : 224
% # Contextual simplify-reflections : 2
% # Paramodulations : 252
% # Factorizations : 0
% # Equation resolutions : 7
% # Current number of processed clauses: 88
% # Positive orientable unit clauses: 21
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 65
% # Current number of unprocessed clauses: 167
% # ...number of literals in the above : 471
% # Clause-clause subsumption calls (NU) : 799
% # Rec. Clause-clause subsumption calls : 723
% # Non-unit clause-clause subsumptions: 10
% # Unit Clause-clause subsumption calls : 284
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 15
% # BW rewrite match successes : 1
% # Backwards rewriting index : 720 nodes, 126 leaves, 1.74+/-1.569 terms/leaf
% # Paramod-from index : 276 nodes, 46 leaves, 1.02+/-0.146 terms/leaf
% # Paramod-into index : 568 nodes, 96 leaves, 1.60+/-1.496 terms/leaf
% # Paramod-neg-atom index : 144 nodes, 26 leaves, 1.35+/-0.476 terms/leaf
% # SZS output start CNFRefutation.
% fof(7, axiom,![X2]:singleton(X2)=unordered_pair(X2,X2),file('/tmp/SRASS.s.p', singleton_set_defn)).
% fof(10, axiom,![X1]:![X2]:![X3]:(member(X1,unordered_pair(X2,X3))<=>(member(X1,universal_class)&(X1=X2|X1=X3))),file('/tmp/SRASS.s.p', unordered_pair_defn)).
% fof(44, conjecture,![X2]:(member(X2,universal_class)=>member(X2,singleton(X2))),file('/tmp/SRASS.s.p', set_in_its_singleton)).
% fof(45, negated_conjecture,~(![X2]:(member(X2,universal_class)=>member(X2,singleton(X2)))),inference(assume_negation,[status(cth)],[44])).
% fof(81, plain,![X3]:singleton(X3)=unordered_pair(X3,X3),inference(variable_rename,[status(thm)],[7])).
% cnf(82,plain,(singleton(X1)=unordered_pair(X1,X1)),inference(split_conjunct,[status(thm)],[81])).
% fof(94, plain,![X1]:![X2]:![X3]:((~(member(X1,unordered_pair(X2,X3)))|(member(X1,universal_class)&(X1=X2|X1=X3)))&((~(member(X1,universal_class))|(~(X1=X2)&~(X1=X3)))|member(X1,unordered_pair(X2,X3)))),inference(fof_nnf,[status(thm)],[10])).
% fof(95, plain,(![X1]:![X2]:![X3]:(~(member(X1,unordered_pair(X2,X3)))|(member(X1,universal_class)&(X1=X2|X1=X3)))&![X1]:![X2]:![X3]:((~(member(X1,universal_class))|(~(X1=X2)&~(X1=X3)))|member(X1,unordered_pair(X2,X3)))),inference(shift_quantors,[status(thm)],[94])).
% fof(96, plain,(![X4]:![X5]:![X6]:(~(member(X4,unordered_pair(X5,X6)))|(member(X4,universal_class)&(X4=X5|X4=X6)))&![X7]:![X8]:![X9]:((~(member(X7,universal_class))|(~(X7=X8)&~(X7=X9)))|member(X7,unordered_pair(X8,X9)))),inference(variable_rename,[status(thm)],[95])).
% fof(97, plain,![X4]:![X5]:![X6]:![X7]:![X8]:![X9]:((~(member(X4,unordered_pair(X5,X6)))|(member(X4,universal_class)&(X4=X5|X4=X6)))&((~(member(X7,universal_class))|(~(X7=X8)&~(X7=X9)))|member(X7,unordered_pair(X8,X9)))),inference(shift_quantors,[status(thm)],[96])).
% fof(98, plain,![X4]:![X5]:![X6]:![X7]:![X8]:![X9]:(((member(X4,universal_class)|~(member(X4,unordered_pair(X5,X6))))&((X4=X5|X4=X6)|~(member(X4,unordered_pair(X5,X6)))))&(((~(X7=X8)|~(member(X7,universal_class)))|member(X7,unordered_pair(X8,X9)))&((~(X7=X9)|~(member(X7,universal_class)))|member(X7,unordered_pair(X8,X9))))),inference(distribute,[status(thm)],[97])).
% cnf(99,plain,(member(X1,unordered_pair(X2,X3))|~member(X1,universal_class)|X1!=X3),inference(split_conjunct,[status(thm)],[98])).
% fof(273, negated_conjecture,?[X2]:(member(X2,universal_class)&~(member(X2,singleton(X2)))),inference(fof_nnf,[status(thm)],[45])).
% fof(274, negated_conjecture,?[X3]:(member(X3,universal_class)&~(member(X3,singleton(X3)))),inference(variable_rename,[status(thm)],[273])).
% fof(275, negated_conjecture,(member(esk8_0,universal_class)&~(member(esk8_0,singleton(esk8_0)))),inference(skolemize,[status(esa)],[274])).
% cnf(276,negated_conjecture,(~member(esk8_0,singleton(esk8_0))),inference(split_conjunct,[status(thm)],[275])).
% cnf(277,negated_conjecture,(member(esk8_0,universal_class)),inference(split_conjunct,[status(thm)],[275])).
% cnf(284,negated_conjecture,(~member(esk8_0,unordered_pair(esk8_0,esk8_0))),inference(rw,[status(thm)],[276,82,theory(equality)]),['unfolding']).
% cnf(340,plain,(member(X1,unordered_pair(X2,X1))|~member(X1,universal_class)),inference(er,[status(thm)],[99,theory(equality)])).
% cnf(613,negated_conjecture,(~member(esk8_0,universal_class)),inference(spm,[status(thm)],[284,340,theory(equality)])).
% cnf(618,negated_conjecture,($false),inference(rw,[status(thm)],[613,277,theory(equality)])).
% cnf(619,negated_conjecture,($false),inference(cn,[status(thm)],[618,theory(equality)])).
% cnf(620,negated_conjecture,($false),619,['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/SystemOnTPTP15515/SET024+1.tptp
%
%------------------------------------------------------------------------------