TSTP Solution File: SET108+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET108+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 : appomattox.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:36 EDT 2012
% Result : Theorem 0.36s
% Output : Solution 0.36s
% 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/SystemOnTPTP18415/SET108+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP18415/SET108+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18415/SET108+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 18513
% 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 : 93
% # Removed in clause preprocessing : 8
% # Initial clauses in saturation : 85
% # Processed clauses : 249
% # ...of these trivial : 3
% # ...subsumed : 65
% # ...remaining for further processing: 181
% # Other redundant clauses eliminated : 7
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 7
% # Backward-rewritten : 7
% # Generated clauses : 1266
% # ...of the previous two non-trivial : 1094
% # Contextual simplify-reflections : 10
% # Paramodulations : 1245
% # Factorizations : 6
% # Equation resolutions : 15
% # Current number of processed clauses: 163
% # Positive orientable unit clauses: 31
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 130
% # Current number of unprocessed clauses: 877
% # ...number of literals in the above : 2530
% # Clause-clause subsumption calls (NU) : 3942
% # Rec. Clause-clause subsumption calls : 3406
% # Non-unit clause-clause subsumptions: 55
% # Unit Clause-clause subsumption calls : 404
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 21
% # BW rewrite match successes : 5
% # Backwards rewriting index : 1168 nodes, 219 leaves, 1.55+/-1.388 terms/leaf
% # Paramod-from index : 411 nodes, 72 leaves, 1.14+/-0.384 terms/leaf
% # Paramod-into index : 831 nodes, 146 leaves, 1.49+/-1.278 terms/leaf
% # Paramod-neg-atom index : 237 nodes, 46 leaves, 1.35+/-0.698 terms/leaf
% # SZS output start CNFRefutation.
% 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,![X2]:?[X3]:?[X4]:(((member(X3,universal_class)&member(X4,universal_class))&X2=ordered_pair(X3,X4))|((~(?[X5]:?[X1]:((member(X5,universal_class)&member(X1,universal_class))&X2=ordered_pair(X5,X1)))&X3=X2)&X4=X2)),file('/tmp/SRASS.s.p', existence_of_first_and_second)).
% fof(45, negated_conjecture,~(![X2]:?[X3]:?[X4]:(((member(X3,universal_class)&member(X4,universal_class))&X2=ordered_pair(X3,X4))|((~(?[X5]:?[X1]:((member(X5,universal_class)&member(X1,universal_class))&X2=ordered_pair(X5,X1)))&X3=X2)&X4=X2))),inference(assume_negation,[status(cth)],[44])).
% 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,?[X2]:![X3]:![X4]:(((~(member(X3,universal_class))|~(member(X4,universal_class)))|~(X2=ordered_pair(X3,X4)))&((?[X5]:?[X1]:((member(X5,universal_class)&member(X1,universal_class))&X2=ordered_pair(X5,X1))|~(X3=X2))|~(X4=X2))),inference(fof_nnf,[status(thm)],[45])).
% fof(274, negated_conjecture,?[X2]:(![X3]:![X4]:((~(member(X3,universal_class))|~(member(X4,universal_class)))|~(X2=ordered_pair(X3,X4)))&((?[X5]:?[X1]:((member(X5,universal_class)&member(X1,universal_class))&X2=ordered_pair(X5,X1))|![X3]:~(X3=X2))|![X4]:~(X4=X2))),inference(shift_quantors,[status(thm)],[273])).
% fof(275, negated_conjecture,?[X6]:(![X7]:![X8]:((~(member(X7,universal_class))|~(member(X8,universal_class)))|~(X6=ordered_pair(X7,X8)))&((?[X9]:?[X10]:((member(X9,universal_class)&member(X10,universal_class))&X6=ordered_pair(X9,X10))|![X11]:~(X11=X6))|![X12]:~(X12=X6))),inference(variable_rename,[status(thm)],[274])).
% fof(276, negated_conjecture,(![X7]:![X8]:((~(member(X7,universal_class))|~(member(X8,universal_class)))|~(esk8_0=ordered_pair(X7,X8)))&((((member(esk9_0,universal_class)&member(esk10_0,universal_class))&esk8_0=ordered_pair(esk9_0,esk10_0))|![X11]:~(X11=esk8_0))|![X12]:~(X12=esk8_0))),inference(skolemize,[status(esa)],[275])).
% fof(277, negated_conjecture,![X7]:![X8]:![X11]:![X12]:(((~(member(X7,universal_class))|~(member(X8,universal_class)))|~(esk8_0=ordered_pair(X7,X8)))&((((member(esk9_0,universal_class)&member(esk10_0,universal_class))&esk8_0=ordered_pair(esk9_0,esk10_0))|~(X11=esk8_0))|~(X12=esk8_0))),inference(shift_quantors,[status(thm)],[276])).
% fof(278, negated_conjecture,![X7]:![X8]:![X11]:![X12]:(((~(member(X7,universal_class))|~(member(X8,universal_class)))|~(esk8_0=ordered_pair(X7,X8)))&((((member(esk9_0,universal_class)|~(X11=esk8_0))|~(X12=esk8_0))&((member(esk10_0,universal_class)|~(X11=esk8_0))|~(X12=esk8_0)))&((esk8_0=ordered_pair(esk9_0,esk10_0)|~(X11=esk8_0))|~(X12=esk8_0)))),inference(distribute,[status(thm)],[277])).
% cnf(279,negated_conjecture,(esk8_0=ordered_pair(esk9_0,esk10_0)|X1!=esk8_0|X2!=esk8_0),inference(split_conjunct,[status(thm)],[278])).
% cnf(280,negated_conjecture,(member(esk10_0,universal_class)|X1!=esk8_0|X2!=esk8_0),inference(split_conjunct,[status(thm)],[278])).
% cnf(281,negated_conjecture,(member(esk9_0,universal_class)|X1!=esk8_0|X2!=esk8_0),inference(split_conjunct,[status(thm)],[278])).
% cnf(282,negated_conjecture,(esk8_0!=ordered_pair(X1,X2)|~member(X2,universal_class)|~member(X1,universal_class)),inference(split_conjunct,[status(thm)],[278])).
% cnf(285,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(326,negated_conjecture,(unordered_pair(unordered_pair(esk9_0,esk9_0),unordered_pair(esk9_0,unordered_pair(esk10_0,esk10_0)))=esk8_0|esk8_0!=X2|esk8_0!=X1),inference(rw,[status(thm)],[279,285,theory(equality)]),['unfolding']).
% cnf(336,negated_conjecture,(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2)))!=esk8_0|~member(X2,universal_class)|~member(X1,universal_class)),inference(rw,[status(thm)],[282,285,theory(equality)]),['unfolding']).
% cnf(339,negated_conjecture,(member(esk9_0,universal_class)|esk8_0!=X1),inference(er,[status(thm)],[281,theory(equality)])).
% cnf(340,negated_conjecture,(member(esk10_0,universal_class)|esk8_0!=X1),inference(er,[status(thm)],[280,theory(equality)])).
% cnf(443,negated_conjecture,(unordered_pair(unordered_pair(esk9_0,esk9_0),unordered_pair(esk9_0,unordered_pair(esk10_0,esk10_0)))=esk8_0|esk8_0!=X1),inference(er,[status(thm)],[326,theory(equality)])).
% cnf(552,negated_conjecture,(member(esk9_0,universal_class)),inference(er,[status(thm)],[339,theory(equality)])).
% cnf(553,negated_conjecture,(member(esk10_0,universal_class)),inference(er,[status(thm)],[340,theory(equality)])).
% cnf(740,negated_conjecture,(unordered_pair(unordered_pair(esk9_0,esk9_0),unordered_pair(esk9_0,unordered_pair(esk10_0,esk10_0)))=esk8_0),inference(er,[status(thm)],[443,theory(equality)])).
% cnf(1793,negated_conjecture,(~member(esk10_0,universal_class)|~member(esk9_0,universal_class)),inference(spm,[status(thm)],[336,740,theory(equality)])).
% cnf(1818,negated_conjecture,($false|~member(esk9_0,universal_class)),inference(rw,[status(thm)],[1793,553,theory(equality)])).
% cnf(1819,negated_conjecture,($false|$false),inference(rw,[status(thm)],[1818,552,theory(equality)])).
% cnf(1820,negated_conjecture,($false),inference(cn,[status(thm)],[1819,theory(equality)])).
% cnf(1821,negated_conjecture,($false),1820,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.06 CPU 0.08 WC
% FINAL PrfWatch: 0.06 CPU 0.08 WC
% SZS output end Solution for /tmp/SystemOnTPTP18415/SET108+1.tptp
%
%------------------------------------------------------------------------------