TSTP Solution File: SET072+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET072+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 : monitor.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:06:14 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/SystemOnTPTP12984/SET072+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP12984/SET072+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12984/SET072+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 13082
% 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 : 93
% # Removed in clause preprocessing : 8
% # Initial clauses in saturation : 85
% # Processed clauses : 118
% # ...of these trivial : 3
% # ...subsumed : 7
% # ...remaining for further processing: 108
% # Other redundant clauses eliminated : 7
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 5
% # Backward-rewritten : 3
% # Generated clauses : 353
% # ...of the previous two non-trivial : 309
% # Contextual simplify-reflections : 0
% # Paramodulations : 342
% # Factorizations : 2
% # Equation resolutions : 9
% # Current number of processed clauses: 96
% # Positive orientable unit clauses: 24
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 70
% # Current number of unprocessed clauses: 241
% # ...number of literals in the above : 648
% # Clause-clause subsumption calls (NU) : 987
% # Rec. Clause-clause subsumption calls : 874
% # Non-unit clause-clause subsumptions: 8
% # Unit Clause-clause subsumption calls : 126
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 15
% # BW rewrite match successes : 2
% # Backwards rewriting index : 758 nodes, 133 leaves, 1.71+/-1.559 terms/leaf
% # Paramod-from index : 301 nodes, 50 leaves, 1.04+/-0.196 terms/leaf
% # Paramod-into index : 599 nodes, 101 leaves, 1.58+/-1.464 terms/leaf
% # Paramod-neg-atom index : 150 nodes, 28 leaves, 1.32+/-0.467 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, 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]:![X3]:![X4]:(((member(X2,universal_class)&member(X3,universal_class))&unordered_pair(X2,X4)=unordered_pair(X3,X4))=>X2=X3),file('/tmp/SRASS.s.p', right_cancellation)).
% fof(45, negated_conjecture,~(![X2]:![X3]:![X4]:(((member(X2,universal_class)&member(X3,universal_class))&unordered_pair(X2,X4)=unordered_pair(X3,X4))=>X2=X3)),inference(assume_negation,[status(cth)],[44])).
% fof(48, 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)],[1])).
% fof(49, 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)],[48])).
% fof(50, 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)],[49])).
% fof(51, 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)],[50])).
% fof(52, 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)],[51])).
% cnf(54,plain,(member(X1,unordered_pair(X2,X3))|~member(X1,universal_class)|X1!=X2),inference(split_conjunct,[status(thm)],[52])).
% cnf(55,plain,(X1=X3|X1=X2|~member(X1,unordered_pair(X2,X3))),inference(split_conjunct,[status(thm)],[52])).
% fof(273, negated_conjecture,?[X2]:?[X3]:?[X4]:(((member(X2,universal_class)&member(X3,universal_class))&unordered_pair(X2,X4)=unordered_pair(X3,X4))&~(X2=X3)),inference(fof_nnf,[status(thm)],[45])).
% fof(274, negated_conjecture,?[X2]:?[X3]:(((member(X2,universal_class)&member(X3,universal_class))&?[X4]:unordered_pair(X2,X4)=unordered_pair(X3,X4))&~(X2=X3)),inference(shift_quantors,[status(thm)],[273])).
% fof(275, negated_conjecture,?[X5]:?[X6]:(((member(X5,universal_class)&member(X6,universal_class))&?[X7]:unordered_pair(X5,X7)=unordered_pair(X6,X7))&~(X5=X6)),inference(variable_rename,[status(thm)],[274])).
% fof(276, negated_conjecture,(((member(esk8_0,universal_class)&member(esk9_0,universal_class))&unordered_pair(esk8_0,esk10_0)=unordered_pair(esk9_0,esk10_0))&~(esk8_0=esk9_0)),inference(skolemize,[status(esa)],[275])).
% cnf(277,negated_conjecture,(esk8_0!=esk9_0),inference(split_conjunct,[status(thm)],[276])).
% cnf(278,negated_conjecture,(unordered_pair(esk8_0,esk10_0)=unordered_pair(esk9_0,esk10_0)),inference(split_conjunct,[status(thm)],[276])).
% cnf(279,negated_conjecture,(member(esk9_0,universal_class)),inference(split_conjunct,[status(thm)],[276])).
% cnf(280,negated_conjecture,(member(esk8_0,universal_class)),inference(split_conjunct,[status(thm)],[276])).
% cnf(345,plain,(member(X1,unordered_pair(X1,X2))|~member(X1,universal_class)),inference(er,[status(thm)],[54,theory(equality)])).
% cnf(625,negated_conjecture,(member(esk9_0,unordered_pair(esk8_0,esk10_0))|~member(esk9_0,universal_class)),inference(spm,[status(thm)],[345,278,theory(equality)])).
% cnf(629,negated_conjecture,(member(esk9_0,unordered_pair(esk8_0,esk10_0))|$false),inference(rw,[status(thm)],[625,279,theory(equality)])).
% cnf(630,negated_conjecture,(member(esk9_0,unordered_pair(esk8_0,esk10_0))),inference(cn,[status(thm)],[629,theory(equality)])).
% cnf(650,negated_conjecture,(esk9_0=esk8_0|esk9_0=esk10_0),inference(spm,[status(thm)],[55,630,theory(equality)])).
% cnf(652,negated_conjecture,(esk10_0=esk9_0),inference(sr,[status(thm)],[650,277,theory(equality)])).
% cnf(654,negated_conjecture,(unordered_pair(esk9_0,esk9_0)=unordered_pair(esk8_0,esk10_0)),inference(rw,[status(thm)],[278,652,theory(equality)])).
% cnf(655,negated_conjecture,(unordered_pair(esk9_0,esk9_0)=unordered_pair(esk8_0,esk9_0)),inference(rw,[status(thm)],[654,652,theory(equality)])).
% cnf(661,negated_conjecture,(X1=esk9_0|~member(X1,unordered_pair(esk8_0,esk9_0))),inference(spm,[status(thm)],[55,655,theory(equality)])).
% cnf(763,negated_conjecture,(esk8_0=esk9_0|~member(esk8_0,universal_class)),inference(spm,[status(thm)],[661,345,theory(equality)])).
% cnf(766,negated_conjecture,(esk8_0=esk9_0|$false),inference(rw,[status(thm)],[763,280,theory(equality)])).
% cnf(767,negated_conjecture,(esk8_0=esk9_0),inference(cn,[status(thm)],[766,theory(equality)])).
% cnf(768,negated_conjecture,($false),inference(sr,[status(thm)],[767,277,theory(equality)])).
% cnf(769,negated_conjecture,($false),768,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.03 CPU 0.07 WC
% FINAL PrfWatch: 0.03 CPU 0.07 WC
% SZS output end Solution for /tmp/SystemOnTPTP12984/SET072+1.tptp
%
%------------------------------------------------------------------------------