TSTP Solution File: SET101+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET101+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 : franklin.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:08:22 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/SystemOnTPTP25054/SET101+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP25054/SET101+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25054/SET101+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 25152
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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 : 90
% # Removed in clause preprocessing : 8
% # Initial clauses in saturation : 82
% # Processed clauses : 103
% # ...of these trivial : 3
% # ...subsumed : 7
% # ...remaining for further processing: 93
% # Other redundant clauses eliminated : 5
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 0
% # Generated clauses : 244
% # ...of the previous two non-trivial : 215
% # Contextual simplify-reflections : 1
% # Paramodulations : 237
% # Factorizations : 0
% # Equation resolutions : 7
% # Current number of processed clauses: 85
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 67
% # Current number of unprocessed clauses: 169
% # ...number of literals in the above : 466
% # Clause-clause subsumption calls (NU) : 656
% # Rec. Clause-clause subsumption calls : 626
% # Non-unit clause-clause subsumptions: 9
% # Unit Clause-clause subsumption calls : 191
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 13
% # BW rewrite match successes : 0
% # Backwards rewriting index : 716 nodes, 126 leaves, 1.74+/-1.574 terms/leaf
% # Paramod-from index : 239 nodes, 40 leaves, 1.05+/-0.218 terms/leaf
% # Paramod-into index : 555 nodes, 94 leaves, 1.62+/-1.510 terms/leaf
% # Paramod-neg-atom index : 153 nodes, 28 leaves, 1.32+/-0.467 terms/leaf
% # SZS output start CNFRefutation.
% fof(2, axiom,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(singleton(X3),unordered_pair(X3,singleton(X4))),file('/tmp/SRASS.s.p', ordered_pair_defn)).
% fof(6, axiom,![X3]:singleton(X3)=unordered_pair(X3,X3),file('/tmp/SRASS.s.p', singleton_set_defn)).
% fof(8, axiom,![X1]:![X3]:![X4]:(member(X1,unordered_pair(X3,X4))<=>(member(X1,universal_class)&(X1=X3|X1=X4))),file('/tmp/SRASS.s.p', unordered_pair_defn)).
% fof(20, axiom,![X3]:![X4]:member(unordered_pair(X3,X4),universal_class),file('/tmp/SRASS.s.p', unordered_pair)).
% fof(44, conjecture,![X3]:![X4]:member(singleton(X3),ordered_pair(X3,X4)),file('/tmp/SRASS.s.p', singleton_member_of_ordered_pair)).
% fof(45, negated_conjecture,~(![X3]:![X4]:member(singleton(X3),ordered_pair(X3,X4))),inference(assume_negation,[status(cth)],[44])).
% fof(56, plain,![X5]:![X6]:ordered_pair(X5,X6)=unordered_pair(singleton(X5),unordered_pair(X5,singleton(X6))),inference(variable_rename,[status(thm)],[2])).
% cnf(57,plain,(ordered_pair(X1,X2)=unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2)))),inference(split_conjunct,[status(thm)],[56])).
% fof(83, plain,![X4]:singleton(X4)=unordered_pair(X4,X4),inference(variable_rename,[status(thm)],[6])).
% cnf(84,plain,(singleton(X1)=unordered_pair(X1,X1)),inference(split_conjunct,[status(thm)],[83])).
% fof(94, plain,![X1]:![X3]:![X4]:((~(member(X1,unordered_pair(X3,X4)))|(member(X1,universal_class)&(X1=X3|X1=X4)))&((~(member(X1,universal_class))|(~(X1=X3)&~(X1=X4)))|member(X1,unordered_pair(X3,X4)))),inference(fof_nnf,[status(thm)],[8])).
% fof(95, plain,(![X1]:![X3]:![X4]:(~(member(X1,unordered_pair(X3,X4)))|(member(X1,universal_class)&(X1=X3|X1=X4)))&![X1]:![X3]:![X4]:((~(member(X1,universal_class))|(~(X1=X3)&~(X1=X4)))|member(X1,unordered_pair(X3,X4)))),inference(shift_quantors,[status(thm)],[94])).
% fof(96, 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)],[95])).
% fof(97, 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)],[96])).
% fof(98, 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)],[97])).
% cnf(100,plain,(member(X1,unordered_pair(X2,X3))|~member(X1,universal_class)|X1!=X2),inference(split_conjunct,[status(thm)],[98])).
% fof(174, plain,![X5]:![X6]:member(unordered_pair(X5,X6),universal_class),inference(variable_rename,[status(thm)],[20])).
% cnf(175,plain,(member(unordered_pair(X1,X2),universal_class)),inference(split_conjunct,[status(thm)],[174])).
% fof(273, negated_conjecture,?[X3]:?[X4]:~(member(singleton(X3),ordered_pair(X3,X4))),inference(fof_nnf,[status(thm)],[45])).
% fof(274, negated_conjecture,?[X5]:?[X6]:~(member(singleton(X5),ordered_pair(X5,X6))),inference(variable_rename,[status(thm)],[273])).
% fof(275, negated_conjecture,~(member(singleton(esk8_0),ordered_pair(esk8_0,esk9_0))),inference(skolemize,[status(esa)],[274])).
% cnf(276,negated_conjecture,(~member(singleton(esk8_0),ordered_pair(esk8_0,esk9_0))),inference(split_conjunct,[status(thm)],[275])).
% cnf(279,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)],[57,84,theory(equality)]),84,theory(equality)]),['unfolding']).
% cnf(283,negated_conjecture,(~member(unordered_pair(esk8_0,esk8_0),ordered_pair(esk8_0,esk9_0))),inference(rw,[status(thm)],[276,84,theory(equality)]),['unfolding']).
% cnf(330,negated_conjecture,(~member(unordered_pair(esk8_0,esk8_0),unordered_pair(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0))))),inference(rw,[status(thm)],[283,279,theory(equality)]),['unfolding']).
% cnf(337,plain,(member(X1,unordered_pair(X1,X2))|~member(X1,universal_class)),inference(er,[status(thm)],[100,theory(equality)])).
% cnf(594,negated_conjecture,(~member(unordered_pair(esk8_0,esk8_0),universal_class)),inference(spm,[status(thm)],[330,337,theory(equality)])).
% cnf(600,negated_conjecture,($false),inference(rw,[status(thm)],[594,175,theory(equality)])).
% cnf(601,negated_conjecture,($false),inference(cn,[status(thm)],[600,theory(equality)])).
% cnf(602,negated_conjecture,($false),601,['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/SystemOnTPTP25054/SET101+1.tptp
%
%------------------------------------------------------------------------------