TSTP Solution File: SEU187+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU187+2 : TPTP v5.0.0. Released v3.3.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 @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Thu Dec 30 01:35:48 EST 2010
% Result : Theorem 1.96s
% Output : Solution 1.96s
% 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/SystemOnTPTP27722/SEU187+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27722/SEU187+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27722/SEU187+2.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 27818
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.036 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(X1=empty_set<=>![X2]:~(in(X2,X1))),file('/tmp/SRASS.s.p', d1_xboole_0)).
% fof(7, axiom,![X1]:set_difference(empty_set,X1)=empty_set,file('/tmp/SRASS.s.p', t4_boole)).
% fof(43, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(59, axiom,(empty(empty_set)&relation(empty_set)),file('/tmp/SRASS.s.p', fc4_relat_1)).
% fof(79, axiom,![X1]:(relation(X1)=>![X2]:(X2=relation_dom(X1)<=>![X3]:(in(X3,X2)<=>?[X4]:in(ordered_pair(X3,X4),X1)))),file('/tmp/SRASS.s.p', d4_relat_1)).
% fof(80, axiom,![X1]:(relation(X1)=>![X2]:(X2=relation_rng(X1)<=>![X3]:(in(X3,X2)<=>?[X4]:in(ordered_pair(X4,X3),X1)))),file('/tmp/SRASS.s.p', d5_relat_1)).
% fof(83, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(116, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(124, axiom,![X1]:![X2]:(set_difference(X1,singleton(X2))=X1<=>~(in(X2,X1))),file('/tmp/SRASS.s.p', t65_zfmisc_1)).
% fof(167, conjecture,(relation_dom(empty_set)=empty_set&relation_rng(empty_set)=empty_set),file('/tmp/SRASS.s.p', t60_relat_1)).
% fof(168, negated_conjecture,~((relation_dom(empty_set)=empty_set&relation_rng(empty_set)=empty_set)),inference(assume_negation,[status(cth)],[167])).
% fof(169, plain,![X1]:(X1=empty_set<=>![X2]:~(in(X2,X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(188, plain,![X1]:![X2]:(set_difference(X1,singleton(X2))=X1<=>~(in(X2,X1))),inference(fof_simplification,[status(thm)],[124,theory(equality)])).
% fof(195, plain,![X1]:((~(X1=empty_set)|![X2]:~(in(X2,X1)))&(?[X2]:in(X2,X1)|X1=empty_set)),inference(fof_nnf,[status(thm)],[169])).
% fof(196, plain,![X3]:((~(X3=empty_set)|![X4]:~(in(X4,X3)))&(?[X5]:in(X5,X3)|X3=empty_set)),inference(variable_rename,[status(thm)],[195])).
% fof(197, plain,![X3]:((~(X3=empty_set)|![X4]:~(in(X4,X3)))&(in(esk1_1(X3),X3)|X3=empty_set)),inference(skolemize,[status(esa)],[196])).
% fof(198, plain,![X3]:![X4]:((~(in(X4,X3))|~(X3=empty_set))&(in(esk1_1(X3),X3)|X3=empty_set)),inference(shift_quantors,[status(thm)],[197])).
% cnf(199,plain,(X1=empty_set|in(esk1_1(X1),X1)),inference(split_conjunct,[status(thm)],[198])).
% fof(213, plain,![X2]:set_difference(empty_set,X2)=empty_set,inference(variable_rename,[status(thm)],[7])).
% cnf(214,plain,(set_difference(empty_set,X1)=empty_set),inference(split_conjunct,[status(thm)],[213])).
% fof(345, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[43])).
% cnf(346,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[345])).
% cnf(430,plain,(relation(empty_set)),inference(split_conjunct,[status(thm)],[59])).
% fof(499, plain,![X1]:(~(relation(X1))|![X2]:((~(X2=relation_dom(X1))|![X3]:((~(in(X3,X2))|?[X4]:in(ordered_pair(X3,X4),X1))&(![X4]:~(in(ordered_pair(X3,X4),X1))|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|![X4]:~(in(ordered_pair(X3,X4),X1)))&(in(X3,X2)|?[X4]:in(ordered_pair(X3,X4),X1)))|X2=relation_dom(X1)))),inference(fof_nnf,[status(thm)],[79])).
% fof(500, plain,![X5]:(~(relation(X5))|![X6]:((~(X6=relation_dom(X5))|![X7]:((~(in(X7,X6))|?[X8]:in(ordered_pair(X7,X8),X5))&(![X9]:~(in(ordered_pair(X7,X9),X5))|in(X7,X6))))&(?[X10]:((~(in(X10,X6))|![X11]:~(in(ordered_pair(X10,X11),X5)))&(in(X10,X6)|?[X12]:in(ordered_pair(X10,X12),X5)))|X6=relation_dom(X5)))),inference(variable_rename,[status(thm)],[499])).
% fof(501, plain,![X5]:(~(relation(X5))|![X6]:((~(X6=relation_dom(X5))|![X7]:((~(in(X7,X6))|in(ordered_pair(X7,esk17_3(X5,X6,X7)),X5))&(![X9]:~(in(ordered_pair(X7,X9),X5))|in(X7,X6))))&(((~(in(esk18_2(X5,X6),X6))|![X11]:~(in(ordered_pair(esk18_2(X5,X6),X11),X5)))&(in(esk18_2(X5,X6),X6)|in(ordered_pair(esk18_2(X5,X6),esk19_2(X5,X6)),X5)))|X6=relation_dom(X5)))),inference(skolemize,[status(esa)],[500])).
% fof(502, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(esk18_2(X5,X6),X11),X5))|~(in(esk18_2(X5,X6),X6)))&(in(esk18_2(X5,X6),X6)|in(ordered_pair(esk18_2(X5,X6),esk19_2(X5,X6)),X5)))|X6=relation_dom(X5))&(((~(in(ordered_pair(X7,X9),X5))|in(X7,X6))&(~(in(X7,X6))|in(ordered_pair(X7,esk17_3(X5,X6,X7)),X5)))|~(X6=relation_dom(X5))))|~(relation(X5))),inference(shift_quantors,[status(thm)],[501])).
% fof(503, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(esk18_2(X5,X6),X11),X5))|~(in(esk18_2(X5,X6),X6)))|X6=relation_dom(X5))|~(relation(X5)))&(((in(esk18_2(X5,X6),X6)|in(ordered_pair(esk18_2(X5,X6),esk19_2(X5,X6)),X5))|X6=relation_dom(X5))|~(relation(X5))))&((((~(in(ordered_pair(X7,X9),X5))|in(X7,X6))|~(X6=relation_dom(X5)))|~(relation(X5)))&(((~(in(X7,X6))|in(ordered_pair(X7,esk17_3(X5,X6,X7)),X5))|~(X6=relation_dom(X5)))|~(relation(X5))))),inference(distribute,[status(thm)],[502])).
% cnf(504,plain,(in(ordered_pair(X3,esk17_3(X1,X2,X3)),X1)|~relation(X1)|X2!=relation_dom(X1)|~in(X3,X2)),inference(split_conjunct,[status(thm)],[503])).
% fof(508, plain,![X1]:(~(relation(X1))|![X2]:((~(X2=relation_rng(X1))|![X3]:((~(in(X3,X2))|?[X4]:in(ordered_pair(X4,X3),X1))&(![X4]:~(in(ordered_pair(X4,X3),X1))|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|![X4]:~(in(ordered_pair(X4,X3),X1)))&(in(X3,X2)|?[X4]:in(ordered_pair(X4,X3),X1)))|X2=relation_rng(X1)))),inference(fof_nnf,[status(thm)],[80])).
% fof(509, plain,![X5]:(~(relation(X5))|![X6]:((~(X6=relation_rng(X5))|![X7]:((~(in(X7,X6))|?[X8]:in(ordered_pair(X8,X7),X5))&(![X9]:~(in(ordered_pair(X9,X7),X5))|in(X7,X6))))&(?[X10]:((~(in(X10,X6))|![X11]:~(in(ordered_pair(X11,X10),X5)))&(in(X10,X6)|?[X12]:in(ordered_pair(X12,X10),X5)))|X6=relation_rng(X5)))),inference(variable_rename,[status(thm)],[508])).
% fof(510, plain,![X5]:(~(relation(X5))|![X6]:((~(X6=relation_rng(X5))|![X7]:((~(in(X7,X6))|in(ordered_pair(esk20_3(X5,X6,X7),X7),X5))&(![X9]:~(in(ordered_pair(X9,X7),X5))|in(X7,X6))))&(((~(in(esk21_2(X5,X6),X6))|![X11]:~(in(ordered_pair(X11,esk21_2(X5,X6)),X5)))&(in(esk21_2(X5,X6),X6)|in(ordered_pair(esk22_2(X5,X6),esk21_2(X5,X6)),X5)))|X6=relation_rng(X5)))),inference(skolemize,[status(esa)],[509])).
% fof(511, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(X11,esk21_2(X5,X6)),X5))|~(in(esk21_2(X5,X6),X6)))&(in(esk21_2(X5,X6),X6)|in(ordered_pair(esk22_2(X5,X6),esk21_2(X5,X6)),X5)))|X6=relation_rng(X5))&(((~(in(ordered_pair(X9,X7),X5))|in(X7,X6))&(~(in(X7,X6))|in(ordered_pair(esk20_3(X5,X6,X7),X7),X5)))|~(X6=relation_rng(X5))))|~(relation(X5))),inference(shift_quantors,[status(thm)],[510])).
% fof(512, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(X11,esk21_2(X5,X6)),X5))|~(in(esk21_2(X5,X6),X6)))|X6=relation_rng(X5))|~(relation(X5)))&(((in(esk21_2(X5,X6),X6)|in(ordered_pair(esk22_2(X5,X6),esk21_2(X5,X6)),X5))|X6=relation_rng(X5))|~(relation(X5))))&((((~(in(ordered_pair(X9,X7),X5))|in(X7,X6))|~(X6=relation_rng(X5)))|~(relation(X5)))&(((~(in(X7,X6))|in(ordered_pair(esk20_3(X5,X6,X7),X7),X5))|~(X6=relation_rng(X5)))|~(relation(X5))))),inference(distribute,[status(thm)],[511])).
% cnf(513,plain,(in(ordered_pair(esk20_3(X1,X2,X3),X3),X1)|~relation(X1)|X2!=relation_rng(X1)|~in(X3,X2)),inference(split_conjunct,[status(thm)],[512])).
% fof(537, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[83])).
% cnf(538,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[537])).
% fof(673, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[116])).
% cnf(674,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[673])).
% fof(695, plain,![X1]:![X2]:((~(set_difference(X1,singleton(X2))=X1)|~(in(X2,X1)))&(in(X2,X1)|set_difference(X1,singleton(X2))=X1)),inference(fof_nnf,[status(thm)],[188])).
% fof(696, plain,![X3]:![X4]:((~(set_difference(X3,singleton(X4))=X3)|~(in(X4,X3)))&(in(X4,X3)|set_difference(X3,singleton(X4))=X3)),inference(variable_rename,[status(thm)],[695])).
% cnf(698,plain,(~in(X1,X2)|set_difference(X2,singleton(X1))!=X2),inference(split_conjunct,[status(thm)],[696])).
% fof(836, negated_conjecture,(~(relation_dom(empty_set)=empty_set)|~(relation_rng(empty_set)=empty_set)),inference(fof_nnf,[status(thm)],[168])).
% cnf(837,negated_conjecture,(relation_rng(empty_set)!=empty_set|relation_dom(empty_set)!=empty_set),inference(split_conjunct,[status(thm)],[836])).
% cnf(842,plain,(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1))=ordered_pair(X1,X2)),inference(rw,[status(thm)],[674,538,theory(equality)]),['unfolding']).
% cnf(867,plain,(set_difference(X2,unordered_pair(X1,X1))!=X2|~in(X1,X2)),inference(rw,[status(thm)],[698,538,theory(equality)]),['unfolding']).
% cnf(908,plain,(in(unordered_pair(unordered_pair(X3,esk17_3(X1,X2,X3)),unordered_pair(X3,X3)),X1)|relation_dom(X1)!=X2|~relation(X1)|~in(X3,X2)),inference(rw,[status(thm)],[504,842,theory(equality)]),['unfolding']).
% cnf(909,plain,(in(unordered_pair(unordered_pair(esk20_3(X1,X2,X3),X3),unordered_pair(esk20_3(X1,X2,X3),esk20_3(X1,X2,X3))),X1)|relation_rng(X1)!=X2|~relation(X1)|~in(X3,X2)),inference(rw,[status(thm)],[513,842,theory(equality)]),['unfolding']).
% cnf(942,plain,(in(unordered_pair(unordered_pair(X3,X3),unordered_pair(X3,esk17_3(X1,X2,X3))),X1)|relation_dom(X1)!=X2|~relation(X1)|~in(X3,X2)),inference(rw,[status(thm)],[908,346,theory(equality)])).
% cnf(945,plain,(in(unordered_pair(unordered_pair(X3,esk20_3(X1,X2,X3)),unordered_pair(esk20_3(X1,X2,X3),esk20_3(X1,X2,X3))),X1)|relation_rng(X1)!=X2|~relation(X1)|~in(X3,X2)),inference(rw,[status(thm)],[909,346,theory(equality)])).
% cnf(1009,plain,(~in(X1,empty_set)),inference(spm,[status(thm)],[867,214,theory(equality)])).
% cnf(3764,plain,(relation_dom(empty_set)!=X2|~relation(empty_set)|~in(X1,X2)),inference(spm,[status(thm)],[1009,942,theory(equality)])).
% cnf(3765,plain,(relation_rng(empty_set)!=X2|~relation(empty_set)|~in(X1,X2)),inference(spm,[status(thm)],[1009,945,theory(equality)])).
% cnf(3777,plain,(relation_dom(empty_set)!=X2|$false|~in(X1,X2)),inference(rw,[status(thm)],[3764,430,theory(equality)])).
% cnf(3778,plain,(relation_dom(empty_set)!=X2|~in(X1,X2)),inference(cn,[status(thm)],[3777,theory(equality)])).
% cnf(3779,plain,(relation_rng(empty_set)!=X2|$false|~in(X1,X2)),inference(rw,[status(thm)],[3765,430,theory(equality)])).
% cnf(3780,plain,(relation_rng(empty_set)!=X2|~in(X1,X2)),inference(cn,[status(thm)],[3779,theory(equality)])).
% cnf(3995,plain,(~in(X1,relation_dom(empty_set))),inference(er,[status(thm)],[3778,theory(equality)])).
% cnf(4027,plain,(empty_set=relation_dom(empty_set)),inference(spm,[status(thm)],[3995,199,theory(equality)])).
% cnf(4044,negated_conjecture,(relation_rng(empty_set)!=empty_set|$false),inference(rw,[status(thm)],[837,4027,theory(equality)])).
% cnf(4045,negated_conjecture,(relation_rng(empty_set)!=empty_set),inference(cn,[status(thm)],[4044,theory(equality)])).
% cnf(4065,plain,(~in(X1,relation_rng(empty_set))),inference(er,[status(thm)],[3780,theory(equality)])).
% cnf(4097,plain,(empty_set=relation_rng(empty_set)),inference(spm,[status(thm)],[4065,199,theory(equality)])).
% cnf(4107,plain,($false),inference(sr,[status(thm)],[4097,4045,theory(equality)])).
% cnf(4108,plain,($false),4107,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 581
% # ...of these trivial : 10
% # ...subsumed : 52
% # ...remaining for further processing: 519
% # Other redundant clauses eliminated : 55
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 8
% # Generated clauses : 2835
% # ...of the previous two non-trivial : 2602
% # Contextual simplify-reflections : 6
% # Paramodulations : 2744
% # Factorizations : 14
% # Equation resolutions : 77
% # Current number of processed clauses: 266
% # Positive orientable unit clauses: 35
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 18
% # Non-unit-clauses : 210
% # Current number of unprocessed clauses: 2460
% # ...number of literals in the above : 10168
% # Clause-clause subsumption calls (NU) : 2360
% # Rec. Clause-clause subsumption calls : 1120
% # Unit Clause-clause subsumption calls : 102
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 51
% # Indexed BW rewrite successes : 40
% # Backwards rewriting index: 269 leaves, 1.69+/-2.469 terms/leaf
% # Paramod-from index: 121 leaves, 1.21+/-0.718 terms/leaf
% # Paramod-into index: 241 leaves, 1.51+/-1.762 terms/leaf
% # -------------------------------------------------
% # User time : 0.167 s
% # System time : 0.009 s
% # Total time : 0.176 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.34 CPU 0.42 WC
% FINAL PrfWatch: 0.34 CPU 0.42 WC
% SZS output end Solution for /tmp/SystemOnTPTP27722/SEU187+2.tptp
%
%------------------------------------------------------------------------------