TSTP Solution File: SET067+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET067+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 : richmond.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:05:58 EDT 2012
% Result : Theorem 0.35s
% Output : Solution 0.35s
% 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/SystemOnTPTP19759/SET067+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP19759/SET067+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19759/SET067+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 19857
% 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 : 201
% # ...of these trivial : 5
% # ...subsumed : 39
% # ...remaining for further processing: 157
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 3
% # Generated clauses : 976
% # ...of the previous two non-trivial : 738
% # Contextual simplify-reflections : 9
% # Paramodulations : 957
% # Factorizations : 8
% # Equation resolutions : 11
% # Current number of processed clauses: 146
% # Positive orientable unit clauses: 35
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 107
% # Current number of unprocessed clauses: 583
% # ...number of literals in the above : 1624
% # Clause-clause subsumption calls (NU) : 1665
% # Rec. Clause-clause subsumption calls : 1388
% # Non-unit clause-clause subsumptions: 39
% # Unit Clause-clause subsumption calls : 182
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 31
% # BW rewrite match successes : 3
% # Backwards rewriting index : 981 nodes, 176 leaves, 1.74+/-1.598 terms/leaf
% # Paramod-from index : 398 nodes, 68 leaves, 1.21+/-0.530 terms/leaf
% # Paramod-into index : 737 nodes, 127 leaves, 1.63+/-1.484 terms/leaf
% # Paramod-neg-atom index : 210 nodes, 39 leaves, 1.49+/-0.930 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(subclass(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subclass_defn)).
% fof(5, axiom,![X3]:![X1]:![X2]:(member(X3,unordered_pair(X1,X2))<=>(member(X3,universal_class)&(X3=X1|X3=X2))),file('/tmp/SRASS.s.p', unordered_pair_defn)).
% fof(7, axiom,![X1]:~(member(X1,null_class)),file('/tmp/SRASS.s.p', null_class_defn)).
% fof(19, axiom,![X1]:(~(X1=null_class)=>?[X3]:((member(X3,universal_class)&member(X3,X1))&disjoint(X3,X1))),file('/tmp/SRASS.s.p', regularity)).
% fof(44, conjecture,![X1]:![X2]:subclass(unordered_pair(X1,X1),unordered_pair(X1,X2)),file('/tmp/SRASS.s.p', pair_contains_other)).
% fof(45, negated_conjecture,~(![X1]:![X2]:subclass(unordered_pair(X1,X1),unordered_pair(X1,X2))),inference(assume_negation,[status(cth)],[44])).
% fof(46, plain,![X1]:~(member(X1,null_class)),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(48, plain,![X1]:![X2]:((~(subclass(X1,X2))|![X3]:(~(member(X3,X1))|member(X3,X2)))&(?[X3]:(member(X3,X1)&~(member(X3,X2)))|subclass(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(49, plain,(![X1]:![X2]:(~(subclass(X1,X2))|![X3]:(~(member(X3,X1))|member(X3,X2)))&![X1]:![X2]:(?[X3]:(member(X3,X1)&~(member(X3,X2)))|subclass(X1,X2))),inference(shift_quantors,[status(thm)],[48])).
% fof(50, plain,(![X4]:![X5]:(~(subclass(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&![X7]:![X8]:(?[X9]:(member(X9,X7)&~(member(X9,X8)))|subclass(X7,X8))),inference(variable_rename,[status(thm)],[49])).
% fof(51, plain,(![X4]:![X5]:(~(subclass(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&![X7]:![X8]:((member(esk1_2(X7,X8),X7)&~(member(esk1_2(X7,X8),X8)))|subclass(X7,X8))),inference(skolemize,[status(esa)],[50])).
% fof(52, plain,![X4]:![X5]:![X6]:![X7]:![X8]:((~(subclass(X4,X5))|(~(member(X6,X4))|member(X6,X5)))&((member(esk1_2(X7,X8),X7)&~(member(esk1_2(X7,X8),X8)))|subclass(X7,X8))),inference(shift_quantors,[status(thm)],[51])).
% fof(53, plain,![X4]:![X5]:![X6]:![X7]:![X8]:((~(subclass(X4,X5))|(~(member(X6,X4))|member(X6,X5)))&((member(esk1_2(X7,X8),X7)|subclass(X7,X8))&(~(member(esk1_2(X7,X8),X8))|subclass(X7,X8)))),inference(distribute,[status(thm)],[52])).
% cnf(54,plain,(subclass(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,plain,(subclass(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[53])).
% fof(69, plain,![X3]:![X1]:![X2]:((~(member(X3,unordered_pair(X1,X2)))|(member(X3,universal_class)&(X3=X1|X3=X2)))&((~(member(X3,universal_class))|(~(X3=X1)&~(X3=X2)))|member(X3,unordered_pair(X1,X2)))),inference(fof_nnf,[status(thm)],[5])).
% fof(70, plain,(![X3]:![X1]:![X2]:(~(member(X3,unordered_pair(X1,X2)))|(member(X3,universal_class)&(X3=X1|X3=X2)))&![X3]:![X1]:![X2]:((~(member(X3,universal_class))|(~(X3=X1)&~(X3=X2)))|member(X3,unordered_pair(X1,X2)))),inference(shift_quantors,[status(thm)],[69])).
% fof(71, 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)],[70])).
% fof(72, 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)],[71])).
% fof(73, 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)],[72])).
% cnf(75,plain,(member(X1,unordered_pair(X2,X3))|~member(X1,universal_class)|X1!=X2),inference(split_conjunct,[status(thm)],[73])).
% cnf(76,plain,(X1=X3|X1=X2|~member(X1,unordered_pair(X2,X3))),inference(split_conjunct,[status(thm)],[73])).
% fof(80, plain,![X2]:~(member(X2,null_class)),inference(variable_rename,[status(thm)],[46])).
% cnf(81,plain,(~member(X1,null_class)),inference(split_conjunct,[status(thm)],[80])).
% fof(150, plain,![X1]:(X1=null_class|?[X3]:((member(X3,universal_class)&member(X3,X1))&disjoint(X3,X1))),inference(fof_nnf,[status(thm)],[19])).
% fof(151, plain,![X4]:(X4=null_class|?[X5]:((member(X5,universal_class)&member(X5,X4))&disjoint(X5,X4))),inference(variable_rename,[status(thm)],[150])).
% fof(152, plain,![X4]:(X4=null_class|((member(esk6_1(X4),universal_class)&member(esk6_1(X4),X4))&disjoint(esk6_1(X4),X4))),inference(skolemize,[status(esa)],[151])).
% fof(153, plain,![X4]:(((member(esk6_1(X4),universal_class)|X4=null_class)&(member(esk6_1(X4),X4)|X4=null_class))&(disjoint(esk6_1(X4),X4)|X4=null_class)),inference(distribute,[status(thm)],[152])).
% cnf(155,plain,(X1=null_class|member(esk6_1(X1),X1)),inference(split_conjunct,[status(thm)],[153])).
% cnf(156,plain,(X1=null_class|member(esk6_1(X1),universal_class)),inference(split_conjunct,[status(thm)],[153])).
% fof(273, negated_conjecture,?[X1]:?[X2]:~(subclass(unordered_pair(X1,X1),unordered_pair(X1,X2))),inference(fof_nnf,[status(thm)],[45])).
% fof(274, negated_conjecture,?[X3]:?[X4]:~(subclass(unordered_pair(X3,X3),unordered_pair(X3,X4))),inference(variable_rename,[status(thm)],[273])).
% fof(275, negated_conjecture,~(subclass(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,esk9_0))),inference(skolemize,[status(esa)],[274])).
% cnf(276,negated_conjecture,(~subclass(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,esk9_0))),inference(split_conjunct,[status(thm)],[275])).
% cnf(341,plain,(esk6_1(unordered_pair(X1,X2))=X1|esk6_1(unordered_pair(X1,X2))=X2|null_class=unordered_pair(X1,X2)),inference(spm,[status(thm)],[76,155,theory(equality)])).
% cnf(345,plain,(member(X1,unordered_pair(X1,X2))|~member(X1,universal_class)),inference(er,[status(thm)],[75,theory(equality)])).
% cnf(352,plain,(subclass(null_class,X1)),inference(spm,[status(thm)],[81,55,theory(equality)])).
% cnf(353,plain,(esk1_2(unordered_pair(X1,X2),X3)=X1|esk1_2(unordered_pair(X1,X2),X3)=X2|subclass(unordered_pair(X1,X2),X3)),inference(spm,[status(thm)],[76,55,theory(equality)])).
% cnf(703,plain,(esk6_1(unordered_pair(X3,X4))=X3|unordered_pair(X3,X4)=null_class|X4!=X3),inference(ef,[status(thm)],[341,theory(equality)])).
% cnf(714,plain,(esk6_1(unordered_pair(X1,X1))=X1|unordered_pair(X1,X1)=null_class),inference(er,[status(thm)],[703,theory(equality)])).
% cnf(716,plain,(null_class=unordered_pair(X1,X1)|member(X1,universal_class)),inference(spm,[status(thm)],[156,714,theory(equality)])).
% cnf(928,plain,(esk1_2(unordered_pair(X4,X5),X6)=X4|subclass(unordered_pair(X4,X5),X6)|X5!=X4),inference(ef,[status(thm)],[353,theory(equality)])).
% cnf(937,plain,(esk1_2(unordered_pair(X1,X1),X2)=X1|subclass(unordered_pair(X1,X1),X2)),inference(er,[status(thm)],[928,theory(equality)])).
% cnf(941,plain,(subclass(unordered_pair(X1,X1),X2)|~member(X1,X2)),inference(spm,[status(thm)],[54,937,theory(equality)])).
% cnf(949,negated_conjecture,(~member(esk8_0,unordered_pair(esk8_0,esk9_0))),inference(spm,[status(thm)],[276,941,theory(equality)])).
% cnf(952,negated_conjecture,(~member(esk8_0,universal_class)),inference(spm,[status(thm)],[949,345,theory(equality)])).
% cnf(1231,negated_conjecture,(unordered_pair(esk8_0,esk8_0)=null_class),inference(spm,[status(thm)],[952,716,theory(equality)])).
% cnf(1492,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[276,1231,theory(equality)]),352,theory(equality)])).
% cnf(1493,negated_conjecture,($false),inference(cn,[status(thm)],[1492,theory(equality)])).
% cnf(1494,negated_conjecture,($false),1493,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.04 CPU 0.07 WC
% FINAL PrfWatch: 0.04 CPU 0.07 WC
% SZS output end Solution for /tmp/SystemOnTPTP19759/SET067+1.tptp
%
%------------------------------------------------------------------------------