TSTP Solution File: SET071+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET071+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 : chickamauga.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:10 EDT 2012
% Result : Theorem 0.42s
% Output : Solution 0.42s
% 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/SystemOnTPTP9124/SET071+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP9124/SET071+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9124/SET071+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 9222
% 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 : 92
% # Removed in clause preprocessing : 8
% # Initial clauses in saturation : 84
% # Processed clauses : 490
% # ...of these trivial : 3
% # ...subsumed : 223
% # ...remaining for further processing: 264
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 6
% # Backward-rewritten : 2
% # Generated clauses : 3152
% # ...of the previous two non-trivial : 2700
% # Contextual simplify-reflections : 31
% # Paramodulations : 3119
% # Factorizations : 18
% # Equation resolutions : 15
% # Current number of processed clauses: 252
% # Positive orientable unit clauses: 41
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 22
% # Non-unit-clauses : 189
% # Current number of unprocessed clauses: 2206
% # ...number of literals in the above : 6996
% # Clause-clause subsumption calls (NU) : 6079
% # Rec. Clause-clause subsumption calls : 4760
% # Non-unit clause-clause subsumptions: 106
% # Unit Clause-clause subsumption calls : 647
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 24
% # BW rewrite match successes : 2
% # Backwards rewriting index : 1575 nodes, 310 leaves, 1.60+/-1.591 terms/leaf
% # Paramod-from index : 514 nodes, 92 leaves, 1.20+/-0.472 terms/leaf
% # Paramod-into index : 1029 nodes, 192 leaves, 1.49+/-1.388 terms/leaf
% # Paramod-neg-atom index : 347 nodes, 70 leaves, 1.57+/-1.460 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(4, axiom,![X2]:(~(X2=null_class)=>?[X1]:((member(X1,universal_class)&member(X1,X2))&disjoint(X1,X2))),file('/tmp/SRASS.s.p', regularity)).
% fof(44, conjecture,![X2]:![X3]:((~(member(X2,universal_class))&~(member(X3,universal_class)))=>unordered_pair(X2,X3)=null_class),file('/tmp/SRASS.s.p', null_unordered_pair)).
% fof(45, negated_conjecture,~(![X2]:![X3]:((~(member(X2,universal_class))&~(member(X3,universal_class)))=>unordered_pair(X2,X3)=null_class)),inference(assume_negation,[status(cth)],[44])).
% fof(48, negated_conjecture,~(![X2]:![X3]:((~(member(X2,universal_class))&~(member(X3,universal_class)))=>unordered_pair(X2,X3)=null_class)),inference(fof_simplification,[status(thm)],[45,theory(equality)])).
% fof(49, 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(50, 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)],[49])).
% fof(51, 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)],[50])).
% fof(52, 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)],[51])).
% fof(53, 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)],[52])).
% cnf(56,plain,(X1=X3|X1=X2|~member(X1,unordered_pair(X2,X3))),inference(split_conjunct,[status(thm)],[53])).
% fof(62, plain,![X2]:(X2=null_class|?[X1]:((member(X1,universal_class)&member(X1,X2))&disjoint(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(63, plain,![X3]:(X3=null_class|?[X4]:((member(X4,universal_class)&member(X4,X3))&disjoint(X4,X3))),inference(variable_rename,[status(thm)],[62])).
% fof(64, plain,![X3]:(X3=null_class|((member(esk1_1(X3),universal_class)&member(esk1_1(X3),X3))&disjoint(esk1_1(X3),X3))),inference(skolemize,[status(esa)],[63])).
% fof(65, plain,![X3]:(((member(esk1_1(X3),universal_class)|X3=null_class)&(member(esk1_1(X3),X3)|X3=null_class))&(disjoint(esk1_1(X3),X3)|X3=null_class)),inference(distribute,[status(thm)],[64])).
% cnf(67,plain,(X1=null_class|member(esk1_1(X1),X1)),inference(split_conjunct,[status(thm)],[65])).
% cnf(68,plain,(X1=null_class|member(esk1_1(X1),universal_class)),inference(split_conjunct,[status(thm)],[65])).
% fof(274, negated_conjecture,?[X2]:?[X3]:((~(member(X2,universal_class))&~(member(X3,universal_class)))&~(unordered_pair(X2,X3)=null_class)),inference(fof_nnf,[status(thm)],[48])).
% fof(275, negated_conjecture,?[X4]:?[X5]:((~(member(X4,universal_class))&~(member(X5,universal_class)))&~(unordered_pair(X4,X5)=null_class)),inference(variable_rename,[status(thm)],[274])).
% fof(276, negated_conjecture,((~(member(esk8_0,universal_class))&~(member(esk9_0,universal_class)))&~(unordered_pair(esk8_0,esk9_0)=null_class)),inference(skolemize,[status(esa)],[275])).
% cnf(277,negated_conjecture,(unordered_pair(esk8_0,esk9_0)!=null_class),inference(split_conjunct,[status(thm)],[276])).
% cnf(278,negated_conjecture,(~member(esk9_0,universal_class)),inference(split_conjunct,[status(thm)],[276])).
% cnf(279,negated_conjecture,(~member(esk8_0,universal_class)),inference(split_conjunct,[status(thm)],[276])).
% cnf(344,plain,(esk1_1(unordered_pair(X1,X2))=X1|esk1_1(unordered_pair(X1,X2))=X2|null_class=unordered_pair(X1,X2)),inference(spm,[status(thm)],[56,67,theory(equality)])).
% cnf(692,plain,(null_class=unordered_pair(X1,X2)|member(X1,universal_class)|esk1_1(unordered_pair(X1,X2))=X2),inference(spm,[status(thm)],[68,344,theory(equality)])).
% cnf(2758,plain,(null_class=unordered_pair(X1,X2)|member(X2,universal_class)|member(X1,universal_class)),inference(spm,[status(thm)],[68,692,theory(equality)])).
% cnf(3814,negated_conjecture,(unordered_pair(X1,esk9_0)=null_class|member(X1,universal_class)),inference(spm,[status(thm)],[278,2758,theory(equality)])).
% cnf(4195,negated_conjecture,(unordered_pair(esk8_0,esk9_0)=null_class),inference(spm,[status(thm)],[279,3814,theory(equality)])).
% cnf(4228,negated_conjecture,($false),inference(sr,[status(thm)],[4195,277,theory(equality)])).
% cnf(4229,negated_conjecture,($false),4228,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.11 CPU 0.11 WC
% FINAL PrfWatch: 0.11 CPU 0.11 WC
% SZS output end Solution for /tmp/SystemOnTPTP9124/SET071+1.tptp
%
%------------------------------------------------------------------------------