TSTP Solution File: SET093+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET093+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 : helena.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:07:50 EDT 2012
% Result : Theorem 0.32s
% Output : Solution 0.32s
% 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/SystemOnTPTP12398/SET093+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP12398/SET093+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12398/SET093+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 12496
% 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 : 10
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 10
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 3
% # ...of the previous two non-trivial : 2
% # Contextual simplify-reflections : 0
% # Paramodulations : 2
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 9
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 75
% # ...number of literals in the above : 169
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Non-unit clause-clause subsumptions: 0
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 0
% # BW rewrite match successes : 0
% # Backwards rewriting index : 121 nodes, 18 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index : 42 nodes, 6 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index : 90 nodes, 13 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-neg-atom index : 21 nodes, 3 leaves, 1.00+/-0.000 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:singleton(X1)=unordered_pair(X1,X1),file('/tmp/SRASS.s.p', singleton_set_defn)).
% fof(8, axiom,![X1]:![X3]:member(unordered_pair(X1,X3),universal_class),file('/tmp/SRASS.s.p', unordered_pair)).
% fof(44, conjecture,![X1]:(singleton(member_of(X1))=X1=>member(X1,universal_class)),file('/tmp/SRASS.s.p', corollary_2_to_singletons_are_sets)).
% fof(45, negated_conjecture,~(![X1]:(singleton(member_of(X1))=X1=>member(X1,universal_class))),inference(assume_negation,[status(cth)],[44])).
% fof(48, plain,![X2]:singleton(X2)=unordered_pair(X2,X2),inference(variable_rename,[status(thm)],[1])).
% cnf(49,plain,(singleton(X1)=unordered_pair(X1,X1)),inference(split_conjunct,[status(thm)],[48])).
% fof(89, plain,![X4]:![X5]:member(unordered_pair(X4,X5),universal_class),inference(variable_rename,[status(thm)],[8])).
% cnf(90,plain,(member(unordered_pair(X1,X2),universal_class)),inference(split_conjunct,[status(thm)],[89])).
% fof(273, negated_conjecture,?[X1]:(singleton(member_of(X1))=X1&~(member(X1,universal_class))),inference(fof_nnf,[status(thm)],[45])).
% fof(274, negated_conjecture,?[X2]:(singleton(member_of(X2))=X2&~(member(X2,universal_class))),inference(variable_rename,[status(thm)],[273])).
% fof(275, negated_conjecture,(singleton(member_of(esk8_0))=esk8_0&~(member(esk8_0,universal_class))),inference(skolemize,[status(esa)],[274])).
% cnf(276,negated_conjecture,(~member(esk8_0,universal_class)),inference(split_conjunct,[status(thm)],[275])).
% cnf(277,negated_conjecture,(singleton(member_of(esk8_0))=esk8_0),inference(split_conjunct,[status(thm)],[275])).
% cnf(278,negated_conjecture,(unordered_pair(member_of(esk8_0),member_of(esk8_0))=esk8_0),inference(rw,[status(thm)],[277,49,theory(equality)]),['unfolding']).
% cnf(333,negated_conjecture,(member(esk8_0,universal_class)),inference(spm,[status(thm)],[90,278,theory(equality)])).
% cnf(334,negated_conjecture,($false),inference(sr,[status(thm)],[333,276,theory(equality)])).
% cnf(335,negated_conjecture,($false),334,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.02 CPU 0.06 WC
% FINAL PrfWatch: 0.02 CPU 0.06 WC
% SZS output end Solution for /tmp/SystemOnTPTP12398/SET093+1.tptp
%
%------------------------------------------------------------------------------