TSTP Solution File: SEU180+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU180+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 : art09.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:31:18 EST 2010
% Result : Theorem 2.80s
% Output : Solution 2.80s
% 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/SystemOnTPTP12575/SEU180+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12575/SEU180+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12575/SEU180+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 12671
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.033 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(8, axiom,![X1]:![X2]:![X3]:(relation(X3)=>(in(ordered_pair(X1,X2),X3)=>(in(X1,relation_dom(X3))&in(X2,relation_rng(X3))))),file('/tmp/SRASS.s.p', t20_relat_1)).
% fof(25, axiom,![X1]:(relation(X1)=>relation_field(X1)=set_union2(relation_dom(X1),relation_rng(X1))),file('/tmp/SRASS.s.p', d6_relat_1)).
% fof(27, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(50, axiom,![X1]:![X2]:![X3]:(X3=set_union2(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)|in(X4,X2)))),file('/tmp/SRASS.s.p', d2_xboole_0)).
% fof(69, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(112, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(150, conjecture,![X1]:![X2]:![X3]:(relation(X3)=>(in(ordered_pair(X1,X2),X3)=>(in(X1,relation_field(X3))&in(X2,relation_field(X3))))),file('/tmp/SRASS.s.p', t30_relat_1)).
% fof(151, negated_conjecture,~(![X1]:![X2]:![X3]:(relation(X3)=>(in(ordered_pair(X1,X2),X3)=>(in(X1,relation_field(X3))&in(X2,relation_field(X3)))))),inference(assume_negation,[status(cth)],[150])).
% fof(220, plain,![X1]:![X2]:![X3]:(~(relation(X3))|(~(in(ordered_pair(X1,X2),X3))|(in(X1,relation_dom(X3))&in(X2,relation_rng(X3))))),inference(fof_nnf,[status(thm)],[8])).
% fof(221, plain,![X4]:![X5]:![X6]:(~(relation(X6))|(~(in(ordered_pair(X4,X5),X6))|(in(X4,relation_dom(X6))&in(X5,relation_rng(X6))))),inference(variable_rename,[status(thm)],[220])).
% fof(222, plain,![X4]:![X5]:![X6]:(((in(X4,relation_dom(X6))|~(in(ordered_pair(X4,X5),X6)))|~(relation(X6)))&((in(X5,relation_rng(X6))|~(in(ordered_pair(X4,X5),X6)))|~(relation(X6)))),inference(distribute,[status(thm)],[221])).
% cnf(223,plain,(in(X3,relation_rng(X1))|~relation(X1)|~in(ordered_pair(X2,X3),X1)),inference(split_conjunct,[status(thm)],[222])).
% cnf(224,plain,(in(X2,relation_dom(X1))|~relation(X1)|~in(ordered_pair(X2,X3),X1)),inference(split_conjunct,[status(thm)],[222])).
% fof(298, plain,![X1]:(~(relation(X1))|relation_field(X1)=set_union2(relation_dom(X1),relation_rng(X1))),inference(fof_nnf,[status(thm)],[25])).
% fof(299, plain,![X2]:(~(relation(X2))|relation_field(X2)=set_union2(relation_dom(X2),relation_rng(X2))),inference(variable_rename,[status(thm)],[298])).
% cnf(300,plain,(relation_field(X1)=set_union2(relation_dom(X1),relation_rng(X1))|~relation(X1)),inference(split_conjunct,[status(thm)],[299])).
% fof(304, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[27])).
% cnf(305,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[304])).
% fof(404, plain,![X1]:![X2]:![X3]:((~(X3=set_union2(X1,X2))|![X4]:((~(in(X4,X3))|(in(X4,X1)|in(X4,X2)))&((~(in(X4,X1))&~(in(X4,X2)))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(~(in(X4,X1))&~(in(X4,X2))))&(in(X4,X3)|(in(X4,X1)|in(X4,X2))))|X3=set_union2(X1,X2))),inference(fof_nnf,[status(thm)],[50])).
% fof(405, plain,![X5]:![X6]:![X7]:((~(X7=set_union2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)|in(X8,X6)))&((~(in(X8,X5))&~(in(X8,X6)))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(~(in(X9,X5))&~(in(X9,X6))))&(in(X9,X7)|(in(X9,X5)|in(X9,X6))))|X7=set_union2(X5,X6))),inference(variable_rename,[status(thm)],[404])).
% fof(406, plain,![X5]:![X6]:![X7]:((~(X7=set_union2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)|in(X8,X6)))&((~(in(X8,X5))&~(in(X8,X6)))|in(X8,X7))))&(((~(in(esk28_3(X5,X6,X7),X7))|(~(in(esk28_3(X5,X6,X7),X5))&~(in(esk28_3(X5,X6,X7),X6))))&(in(esk28_3(X5,X6,X7),X7)|(in(esk28_3(X5,X6,X7),X5)|in(esk28_3(X5,X6,X7),X6))))|X7=set_union2(X5,X6))),inference(skolemize,[status(esa)],[405])).
% fof(407, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(in(X8,X5)|in(X8,X6)))&((~(in(X8,X5))&~(in(X8,X6)))|in(X8,X7)))|~(X7=set_union2(X5,X6)))&(((~(in(esk28_3(X5,X6,X7),X7))|(~(in(esk28_3(X5,X6,X7),X5))&~(in(esk28_3(X5,X6,X7),X6))))&(in(esk28_3(X5,X6,X7),X7)|(in(esk28_3(X5,X6,X7),X5)|in(esk28_3(X5,X6,X7),X6))))|X7=set_union2(X5,X6))),inference(shift_quantors,[status(thm)],[406])).
% fof(408, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(in(X8,X5)|in(X8,X6)))|~(X7=set_union2(X5,X6)))&(((~(in(X8,X5))|in(X8,X7))|~(X7=set_union2(X5,X6)))&((~(in(X8,X6))|in(X8,X7))|~(X7=set_union2(X5,X6)))))&((((~(in(esk28_3(X5,X6,X7),X5))|~(in(esk28_3(X5,X6,X7),X7)))|X7=set_union2(X5,X6))&((~(in(esk28_3(X5,X6,X7),X6))|~(in(esk28_3(X5,X6,X7),X7)))|X7=set_union2(X5,X6)))&((in(esk28_3(X5,X6,X7),X7)|(in(esk28_3(X5,X6,X7),X5)|in(esk28_3(X5,X6,X7),X6)))|X7=set_union2(X5,X6)))),inference(distribute,[status(thm)],[407])).
% cnf(412,plain,(in(X4,X1)|X1!=set_union2(X2,X3)|~in(X4,X3)),inference(split_conjunct,[status(thm)],[408])).
% cnf(413,plain,(in(X4,X1)|X1!=set_union2(X2,X3)|~in(X4,X2)),inference(split_conjunct,[status(thm)],[408])).
% fof(508, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[69])).
% cnf(509,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[508])).
% fof(640, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[112])).
% cnf(641,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[640])).
% fof(741, negated_conjecture,?[X1]:?[X2]:?[X3]:(relation(X3)&(in(ordered_pair(X1,X2),X3)&(~(in(X1,relation_field(X3)))|~(in(X2,relation_field(X3)))))),inference(fof_nnf,[status(thm)],[151])).
% fof(742, negated_conjecture,?[X4]:?[X5]:?[X6]:(relation(X6)&(in(ordered_pair(X4,X5),X6)&(~(in(X4,relation_field(X6)))|~(in(X5,relation_field(X6)))))),inference(variable_rename,[status(thm)],[741])).
% fof(743, negated_conjecture,(relation(esk45_0)&(in(ordered_pair(esk43_0,esk44_0),esk45_0)&(~(in(esk43_0,relation_field(esk45_0)))|~(in(esk44_0,relation_field(esk45_0)))))),inference(skolemize,[status(esa)],[742])).
% cnf(744,negated_conjecture,(~in(esk44_0,relation_field(esk45_0))|~in(esk43_0,relation_field(esk45_0))),inference(split_conjunct,[status(thm)],[743])).
% cnf(745,negated_conjecture,(in(ordered_pair(esk43_0,esk44_0),esk45_0)),inference(split_conjunct,[status(thm)],[743])).
% cnf(746,negated_conjecture,(relation(esk45_0)),inference(split_conjunct,[status(thm)],[743])).
% cnf(751,plain,(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1))=ordered_pair(X1,X2)),inference(rw,[status(thm)],[509,641,theory(equality)]),['unfolding']).
% cnf(795,negated_conjecture,(in(unordered_pair(unordered_pair(esk43_0,esk44_0),unordered_pair(esk43_0,esk43_0)),esk45_0)),inference(rw,[status(thm)],[745,751,theory(equality)]),['unfolding']).
% cnf(807,plain,(in(X3,relation_rng(X1))|~relation(X1)|~in(unordered_pair(unordered_pair(X2,X3),unordered_pair(X2,X2)),X1)),inference(rw,[status(thm)],[223,751,theory(equality)]),['unfolding']).
% cnf(808,plain,(in(X2,relation_dom(X1))|~relation(X1)|~in(unordered_pair(unordered_pair(X2,X3),unordered_pair(X2,X2)),X1)),inference(rw,[status(thm)],[224,751,theory(equality)]),['unfolding']).
% cnf(822,negated_conjecture,(in(unordered_pair(unordered_pair(esk43_0,esk43_0),unordered_pair(esk43_0,esk44_0)),esk45_0)),inference(rw,[status(thm)],[795,305,theory(equality)])).
% cnf(1247,plain,(in(X1,X2)|relation_field(X3)!=X2|~in(X1,relation_rng(X3))|~relation(X3)),inference(spm,[status(thm)],[412,300,theory(equality)])).
% cnf(1260,plain,(in(X1,X2)|relation_field(X3)!=X2|~in(X1,relation_dom(X3))|~relation(X3)),inference(spm,[status(thm)],[413,300,theory(equality)])).
% cnf(1477,plain,(in(X1,relation_rng(X2))|~relation(X2)|~in(unordered_pair(unordered_pair(X3,X3),unordered_pair(X3,X1)),X2)),inference(spm,[status(thm)],[807,305,theory(equality)])).
% cnf(1486,plain,(in(X1,relation_dom(X2))|~relation(X2)|~in(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,X3)),X2)),inference(spm,[status(thm)],[808,305,theory(equality)])).
% cnf(22932,negated_conjecture,(in(esk44_0,relation_rng(esk45_0))|~relation(esk45_0)),inference(spm,[status(thm)],[1477,822,theory(equality)])).
% cnf(22938,negated_conjecture,(in(esk44_0,relation_rng(esk45_0))|$false),inference(rw,[status(thm)],[22932,746,theory(equality)])).
% cnf(22939,negated_conjecture,(in(esk44_0,relation_rng(esk45_0))),inference(cn,[status(thm)],[22938,theory(equality)])).
% cnf(22962,negated_conjecture,(in(esk44_0,X1)|relation_field(esk45_0)!=X1|~relation(esk45_0)),inference(spm,[status(thm)],[1247,22939,theory(equality)])).
% cnf(22965,negated_conjecture,(in(esk44_0,X1)|relation_field(esk45_0)!=X1|$false),inference(rw,[status(thm)],[22962,746,theory(equality)])).
% cnf(22966,negated_conjecture,(in(esk44_0,X1)|relation_field(esk45_0)!=X1),inference(cn,[status(thm)],[22965,theory(equality)])).
% cnf(22989,negated_conjecture,(in(esk44_0,relation_field(esk45_0))),inference(er,[status(thm)],[22966,theory(equality)])).
% cnf(23016,negated_conjecture,(~in(esk43_0,relation_field(esk45_0))|$false),inference(rw,[status(thm)],[744,22989,theory(equality)])).
% cnf(23017,negated_conjecture,(~in(esk43_0,relation_field(esk45_0))),inference(cn,[status(thm)],[23016,theory(equality)])).
% cnf(23500,negated_conjecture,(in(esk43_0,relation_dom(esk45_0))|~relation(esk45_0)),inference(spm,[status(thm)],[1486,822,theory(equality)])).
% cnf(23506,negated_conjecture,(in(esk43_0,relation_dom(esk45_0))|$false),inference(rw,[status(thm)],[23500,746,theory(equality)])).
% cnf(23507,negated_conjecture,(in(esk43_0,relation_dom(esk45_0))),inference(cn,[status(thm)],[23506,theory(equality)])).
% cnf(23530,negated_conjecture,(in(esk43_0,X1)|relation_field(esk45_0)!=X1|~relation(esk45_0)),inference(spm,[status(thm)],[1260,23507,theory(equality)])).
% cnf(23533,negated_conjecture,(in(esk43_0,X1)|relation_field(esk45_0)!=X1|$false),inference(rw,[status(thm)],[23530,746,theory(equality)])).
% cnf(23534,negated_conjecture,(in(esk43_0,X1)|relation_field(esk45_0)!=X1),inference(cn,[status(thm)],[23533,theory(equality)])).
% cnf(23650,negated_conjecture,(in(esk43_0,relation_field(esk45_0))),inference(er,[status(thm)],[23534,theory(equality)])).
% cnf(23653,negated_conjecture,($false),inference(sr,[status(thm)],[23650,23017,theory(equality)])).
% cnf(23654,negated_conjecture,($false),23653,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 4628
% # ...of these trivial : 27
% # ...subsumed : 3096
% # ...remaining for further processing: 1505
% # Other redundant clauses eliminated : 94
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 22
% # Generated clauses : 20209
% # ...of the previous two non-trivial : 19294
% # Contextual simplify-reflections : 110
% # Paramodulations : 20047
% # Factorizations : 15
% # Equation resolutions : 147
% # Current number of processed clauses: 1261
% # Positive orientable unit clauses: 101
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 341
% # Non-unit-clauses : 815
% # Current number of unprocessed clauses: 14862
% # ...number of literals in the above : 49831
% # Clause-clause subsumption calls (NU) : 21115
% # Rec. Clause-clause subsumption calls : 19190
% # Unit Clause-clause subsumption calls : 4618
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 111
% # Indexed BW rewrite successes : 69
% # Backwards rewriting index: 911 leaves, 1.50+/-1.467 terms/leaf
% # Paramod-from index: 203 leaves, 1.25+/-0.652 terms/leaf
% # Paramod-into index: 848 leaves, 1.46+/-1.325 terms/leaf
% # -------------------------------------------------
% # User time : 0.882 s
% # System time : 0.026 s
% # Total time : 0.908 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.32 CPU 1.40 WC
% FINAL PrfWatch: 1.32 CPU 1.40 WC
% SZS output end Solution for /tmp/SystemOnTPTP12575/SEU180+2.tptp
%
%------------------------------------------------------------------------------