TSTP Solution File: SET016+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET016+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 : newtonia.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:09 EDT 2012
% Result : Theorem 0.35s
% Output : Solution 0.35s
% 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/SystemOnTPTP13995/SET016+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP13995/SET016+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13995/SET016+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 14093
% 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 : 92
% # Removed in clause preprocessing : 8
% # Initial clauses in saturation : 84
% # Processed clauses : 190
% # ...of these trivial : 3
% # ...subsumed : 35
% # ...remaining for further processing: 152
% # Other redundant clauses eliminated : 7
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 5
% # Backward-rewritten : 7
% # Generated clauses : 722
% # ...of the previous two non-trivial : 649
% # Contextual simplify-reflections : 9
% # Paramodulations : 711
% # Factorizations : 2
% # Equation resolutions : 9
% # Current number of processed clauses: 136
% # Positive orientable unit clauses: 29
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 105
% # Current number of unprocessed clauses: 431
% # ...number of literals in the above : 1200
% # Clause-clause subsumption calls (NU) : 2446
% # Rec. Clause-clause subsumption calls : 2021
% # Non-unit clause-clause subsumptions: 36
% # Unit Clause-clause subsumption calls : 313
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 18
% # BW rewrite match successes : 3
% # Backwards rewriting index : 1032 nodes, 188 leaves, 1.55+/-1.392 terms/leaf
% # Paramod-from index : 389 nodes, 67 leaves, 1.06+/-0.293 terms/leaf
% # Paramod-into index : 768 nodes, 133 leaves, 1.47+/-1.312 terms/leaf
% # Paramod-neg-atom index : 206 nodes, 39 leaves, 1.31+/-0.606 terms/leaf
% # SZS output start CNFRefutation.
% fof(4, axiom,![X3]:![X2]:![X5]:(member(X3,unordered_pair(X2,X5))<=>(member(X3,universal_class)&(X3=X2|X3=X5))),file('/tmp/SRASS.s.p', unordered_pair_defn)).
% fof(12, axiom,![X2]:![X5]:member(unordered_pair(X2,X5),universal_class),file('/tmp/SRASS.s.p', unordered_pair)).
% fof(13, axiom,![X2]:![X5]:ordered_pair(X2,X5)=unordered_pair(singleton(X2),unordered_pair(X2,singleton(X5))),file('/tmp/SRASS.s.p', ordered_pair_defn)).
% fof(25, axiom,![X2]:singleton(X2)=unordered_pair(X2,X2),file('/tmp/SRASS.s.p', singleton_set_defn)).
% fof(44, conjecture,![X6]:![X2]:![X5]:![X1]:((ordered_pair(X6,X2)=ordered_pair(X5,X1)&member(X6,universal_class))=>X6=X5),file('/tmp/SRASS.s.p', ordered_pair_determines_components1)).
% fof(45, negated_conjecture,~(![X6]:![X2]:![X5]:![X1]:((ordered_pair(X6,X2)=ordered_pair(X5,X1)&member(X6,universal_class))=>X6=X5)),inference(assume_negation,[status(cth)],[44])).
% fof(73, plain,![X3]:![X2]:![X5]:((~(member(X3,unordered_pair(X2,X5)))|(member(X3,universal_class)&(X3=X2|X3=X5)))&((~(member(X3,universal_class))|(~(X3=X2)&~(X3=X5)))|member(X3,unordered_pair(X2,X5)))),inference(fof_nnf,[status(thm)],[4])).
% fof(74, plain,(![X3]:![X2]:![X5]:(~(member(X3,unordered_pair(X2,X5)))|(member(X3,universal_class)&(X3=X2|X3=X5)))&![X3]:![X2]:![X5]:((~(member(X3,universal_class))|(~(X3=X2)&~(X3=X5)))|member(X3,unordered_pair(X2,X5)))),inference(shift_quantors,[status(thm)],[73])).
% fof(75, plain,(![X6]:![X7]:![X8]:(~(member(X6,unordered_pair(X7,X8)))|(member(X6,universal_class)&(X6=X7|X6=X8)))&![X9]:![X10]:![X11]:((~(member(X9,universal_class))|(~(X9=X10)&~(X9=X11)))|member(X9,unordered_pair(X10,X11)))),inference(variable_rename,[status(thm)],[74])).
% fof(76, plain,![X6]:![X7]:![X8]:![X9]:![X10]:![X11]:((~(member(X6,unordered_pair(X7,X8)))|(member(X6,universal_class)&(X6=X7|X6=X8)))&((~(member(X9,universal_class))|(~(X9=X10)&~(X9=X11)))|member(X9,unordered_pair(X10,X11)))),inference(shift_quantors,[status(thm)],[75])).
% fof(77, plain,![X6]:![X7]:![X8]:![X9]:![X10]:![X11]:(((member(X6,universal_class)|~(member(X6,unordered_pair(X7,X8))))&((X6=X7|X6=X8)|~(member(X6,unordered_pair(X7,X8)))))&(((~(X9=X10)|~(member(X9,universal_class)))|member(X9,unordered_pair(X10,X11)))&((~(X9=X11)|~(member(X9,universal_class)))|member(X9,unordered_pair(X10,X11))))),inference(distribute,[status(thm)],[76])).
% cnf(78,plain,(member(X1,unordered_pair(X2,X3))|~member(X1,universal_class)|X1!=X3),inference(split_conjunct,[status(thm)],[77])).
% cnf(79,plain,(member(X1,unordered_pair(X2,X3))|~member(X1,universal_class)|X1!=X2),inference(split_conjunct,[status(thm)],[77])).
% cnf(80,plain,(X1=X3|X1=X2|~member(X1,unordered_pair(X2,X3))),inference(split_conjunct,[status(thm)],[77])).
% fof(138, plain,![X6]:![X7]:member(unordered_pair(X6,X7),universal_class),inference(variable_rename,[status(thm)],[12])).
% cnf(139,plain,(member(unordered_pair(X1,X2),universal_class)),inference(split_conjunct,[status(thm)],[138])).
% fof(140, plain,![X6]:![X7]:ordered_pair(X6,X7)=unordered_pair(singleton(X6),unordered_pair(X6,singleton(X7))),inference(variable_rename,[status(thm)],[13])).
% cnf(141,plain,(ordered_pair(X1,X2)=unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2)))),inference(split_conjunct,[status(thm)],[140])).
% fof(195, plain,![X3]:singleton(X3)=unordered_pair(X3,X3),inference(variable_rename,[status(thm)],[25])).
% cnf(196,plain,(singleton(X1)=unordered_pair(X1,X1)),inference(split_conjunct,[status(thm)],[195])).
% fof(273, negated_conjecture,?[X6]:?[X2]:?[X5]:?[X1]:((ordered_pair(X6,X2)=ordered_pair(X5,X1)&member(X6,universal_class))&~(X6=X5)),inference(fof_nnf,[status(thm)],[45])).
% fof(274, negated_conjecture,?[X6]:?[X2]:?[X5]:((?[X1]:ordered_pair(X6,X2)=ordered_pair(X5,X1)&member(X6,universal_class))&~(X6=X5)),inference(shift_quantors,[status(thm)],[273])).
% fof(275, negated_conjecture,?[X7]:?[X8]:?[X9]:((?[X10]:ordered_pair(X7,X8)=ordered_pair(X9,X10)&member(X7,universal_class))&~(X7=X9)),inference(variable_rename,[status(thm)],[274])).
% fof(276, negated_conjecture,((ordered_pair(esk8_0,esk9_0)=ordered_pair(esk10_0,esk11_0)&member(esk8_0,universal_class))&~(esk8_0=esk10_0)),inference(skolemize,[status(esa)],[275])).
% cnf(277,negated_conjecture,(esk8_0!=esk10_0),inference(split_conjunct,[status(thm)],[276])).
% cnf(278,negated_conjecture,(member(esk8_0,universal_class)),inference(split_conjunct,[status(thm)],[276])).
% cnf(279,negated_conjecture,(ordered_pair(esk8_0,esk9_0)=ordered_pair(esk10_0,esk11_0)),inference(split_conjunct,[status(thm)],[276])).
% cnf(282,plain,(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2)))=ordered_pair(X1,X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[141,196,theory(equality)]),196,theory(equality)]),['unfolding']).
% cnf(308,negated_conjecture,(unordered_pair(unordered_pair(esk10_0,esk10_0),unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0)))=unordered_pair(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[279,282,theory(equality)]),282,theory(equality)]),['unfolding']).
% cnf(342,plain,(member(X1,unordered_pair(X2,X1))|~member(X1,universal_class)),inference(er,[status(thm)],[78,theory(equality)])).
% cnf(343,plain,(member(X1,unordered_pair(X1,X2))|~member(X1,universal_class)),inference(er,[status(thm)],[79,theory(equality)])).
% cnf(712,negated_conjecture,(member(unordered_pair(esk10_0,esk10_0),unordered_pair(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0))))|~member(unordered_pair(esk10_0,esk10_0),universal_class)),inference(spm,[status(thm)],[343,308,theory(equality)])).
% cnf(716,negated_conjecture,(member(unordered_pair(esk10_0,esk10_0),unordered_pair(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0))))|$false),inference(rw,[status(thm)],[712,139,theory(equality)])).
% cnf(717,negated_conjecture,(member(unordered_pair(esk10_0,esk10_0),unordered_pair(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0))))),inference(cn,[status(thm)],[716,theory(equality)])).
% cnf(1002,negated_conjecture,(unordered_pair(esk10_0,esk10_0)=unordered_pair(esk8_0,esk8_0)|unordered_pair(esk10_0,esk10_0)=unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0))),inference(spm,[status(thm)],[80,717,theory(equality)])).
% cnf(1021,negated_conjecture,(member(esk8_0,unordered_pair(esk10_0,esk10_0))|unordered_pair(esk10_0,esk10_0)=unordered_pair(esk8_0,esk8_0)|~member(esk8_0,universal_class)),inference(spm,[status(thm)],[343,1002,theory(equality)])).
% cnf(1051,negated_conjecture,(member(esk8_0,unordered_pair(esk10_0,esk10_0))|unordered_pair(esk10_0,esk10_0)=unordered_pair(esk8_0,esk8_0)|$false),inference(rw,[status(thm)],[1021,278,theory(equality)])).
% cnf(1052,negated_conjecture,(member(esk8_0,unordered_pair(esk10_0,esk10_0))|unordered_pair(esk10_0,esk10_0)=unordered_pair(esk8_0,esk8_0)),inference(cn,[status(thm)],[1051,theory(equality)])).
% cnf(1065,negated_conjecture,(esk8_0=esk10_0|unordered_pair(esk10_0,esk10_0)=unordered_pair(esk8_0,esk8_0)),inference(spm,[status(thm)],[80,1052,theory(equality)])).
% cnf(1069,negated_conjecture,(unordered_pair(esk10_0,esk10_0)=unordered_pair(esk8_0,esk8_0)),inference(sr,[status(thm)],[1065,277,theory(equality)])).
% cnf(1076,negated_conjecture,(X1=esk10_0|~member(X1,unordered_pair(esk8_0,esk8_0))),inference(spm,[status(thm)],[80,1069,theory(equality)])).
% cnf(1158,negated_conjecture,(esk8_0=esk10_0|~member(esk8_0,universal_class)),inference(spm,[status(thm)],[1076,342,theory(equality)])).
% cnf(1163,negated_conjecture,(esk8_0=esk10_0|$false),inference(rw,[status(thm)],[1158,278,theory(equality)])).
% cnf(1164,negated_conjecture,(esk8_0=esk10_0),inference(cn,[status(thm)],[1163,theory(equality)])).
% cnf(1165,negated_conjecture,($false),inference(sr,[status(thm)],[1164,277,theory(equality)])).
% cnf(1166,negated_conjecture,($false),1165,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.05 CPU 0.07 WC
% FINAL PrfWatch: 0.05 CPU 0.07 WC
% SZS output end Solution for /tmp/SystemOnTPTP13995/SET016+1.tptp
%
%------------------------------------------------------------------------------