TSTP Solution File: SET017+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET017+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 : art05.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2800MHz
% Memory : 2005MB
% OS : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Fri Jun 15 11:04:15 EDT 2012
% Result : Theorem 0.77s
% Output : Solution 0.77s
% 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/SystemOnTPTP31618/SET017+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31618/SET017+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31618/SET017+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 31733
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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 : 109
% # ...of these trivial : 2
% # ...subsumed : 5
% # ...remaining for further processing: 102
% # Other redundant clauses eliminated : 5
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 5
% # Backward-rewritten : 3
% # Generated clauses : 322
% # ...of the previous two non-trivial : 283
% # Contextual simplify-reflections : 0
% # Paramodulations : 315
% # Factorizations : 0
% # Equation resolutions : 7
% # Current number of processed clauses: 90
% # Positive orientable unit clauses: 22
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 66
% # Current number of unprocessed clauses: 224
% # ...number of literals in the above : 593
% # Clause-clause subsumption calls (NU) : 966
% # Rec. Clause-clause subsumption calls : 854
% # Non-unit clause-clause subsumptions: 7
% # Unit Clause-clause subsumption calls : 168
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 15
% # BW rewrite match successes : 2
% # Backwards rewriting index : 719 nodes, 126 leaves, 1.74+/-1.574 terms/leaf
% # Paramod-from index : 281 nodes, 47 leaves, 1.04+/-0.202 terms/leaf
% # Paramod-into index : 574 nodes, 97 leaves, 1.60+/-1.490 terms/leaf
% # Paramod-neg-atom index : 134 nodes, 25 leaves, 1.36+/-0.480 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(X3,universal_class)&member(X4,universal_class))&unordered_pair(X2,X3)=unordered_pair(X2,X4))=>X3=X4),file('/tmp/SRASS.s.p', left_cancellation)).
% fof(45, negated_conjecture,~(![X2]:![X3]:![X4]:(((member(X3,universal_class)&member(X4,universal_class))&unordered_pair(X2,X3)=unordered_pair(X2,X4))=>X3=X4)),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(53,plain,(member(X1,unordered_pair(X2,X3))|~member(X1,universal_class)|X1!=X3),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(X3,universal_class)&member(X4,universal_class))&unordered_pair(X2,X3)=unordered_pair(X2,X4))&~(X3=X4)),inference(fof_nnf,[status(thm)],[45])).
% fof(274, negated_conjecture,?[X5]:?[X6]:?[X7]:(((member(X6,universal_class)&member(X7,universal_class))&unordered_pair(X5,X6)=unordered_pair(X5,X7))&~(X6=X7)),inference(variable_rename,[status(thm)],[273])).
% fof(275, negated_conjecture,(((member(esk9_0,universal_class)&member(esk10_0,universal_class))&unordered_pair(esk8_0,esk9_0)=unordered_pair(esk8_0,esk10_0))&~(esk9_0=esk10_0)),inference(skolemize,[status(esa)],[274])).
% cnf(276,negated_conjecture,(esk9_0!=esk10_0),inference(split_conjunct,[status(thm)],[275])).
% cnf(277,negated_conjecture,(unordered_pair(esk8_0,esk9_0)=unordered_pair(esk8_0,esk10_0)),inference(split_conjunct,[status(thm)],[275])).
% cnf(278,negated_conjecture,(member(esk10_0,universal_class)),inference(split_conjunct,[status(thm)],[275])).
% cnf(279,negated_conjecture,(member(esk9_0,universal_class)),inference(split_conjunct,[status(thm)],[275])).
% cnf(343,plain,(member(X1,unordered_pair(X2,X1))|~member(X1,universal_class)),inference(er,[status(thm)],[53,theory(equality)])).
% cnf(603,negated_conjecture,(member(esk10_0,unordered_pair(esk8_0,esk9_0))|~member(esk10_0,universal_class)),inference(spm,[status(thm)],[343,277,theory(equality)])).
% cnf(607,negated_conjecture,(member(esk10_0,unordered_pair(esk8_0,esk9_0))|$false),inference(rw,[status(thm)],[603,278,theory(equality)])).
% cnf(608,negated_conjecture,(member(esk10_0,unordered_pair(esk8_0,esk9_0))),inference(cn,[status(thm)],[607,theory(equality)])).
% cnf(618,negated_conjecture,(esk10_0=esk8_0|esk10_0=esk9_0),inference(spm,[status(thm)],[55,608,theory(equality)])).
% cnf(620,negated_conjecture,(esk8_0=esk10_0),inference(sr,[status(thm)],[618,276,theory(equality)])).
% cnf(622,negated_conjecture,(unordered_pair(esk10_0,esk10_0)=unordered_pair(esk8_0,esk9_0)),inference(rw,[status(thm)],[277,620,theory(equality)])).
% cnf(623,negated_conjecture,(unordered_pair(esk10_0,esk10_0)=unordered_pair(esk10_0,esk9_0)),inference(rw,[status(thm)],[622,620,theory(equality)])).
% cnf(628,negated_conjecture,(X1=esk10_0|~member(X1,unordered_pair(esk10_0,esk9_0))),inference(spm,[status(thm)],[55,623,theory(equality)])).
% cnf(726,negated_conjecture,(esk9_0=esk10_0|~member(esk9_0,universal_class)),inference(spm,[status(thm)],[628,343,theory(equality)])).
% cnf(729,negated_conjecture,(esk9_0=esk10_0|$false),inference(rw,[status(thm)],[726,279,theory(equality)])).
% cnf(730,negated_conjecture,(esk9_0=esk10_0),inference(cn,[status(thm)],[729,theory(equality)])).
% cnf(731,negated_conjecture,($false),inference(sr,[status(thm)],[730,276,theory(equality)])).
% cnf(732,negated_conjecture,($false),731,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.08 CPU 0.19 WC
% FINAL PrfWatch: 0.08 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP31618/SET017+1.tptp
% WARNING: TreeLimitedRun lost 0.08s, total lost is 0.08s
%
%------------------------------------------------------------------------------