TSTP Solution File: SEU180+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SEU180+1 : 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:07 EST 2010

% Result   : Theorem 0.95s
% Output   : Solution 0.95s
% 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/SystemOnTPTP12316/SEU180+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP12316/SEU180+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12316/SEU180+1.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 12412
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time     : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, 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(3, 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(12, axiom,![X1]:(relation(X1)=>relation_field(X1)=set_union2(relation_dom(X1),relation_rng(X1))),file('/tmp/SRASS.s.p', d6_relat_1)).
% fof(13, 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(20, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(21, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(36, 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(37, 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)],[36])).
% fof(48, 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)],[2])).
% fof(49, 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)],[48])).
% fof(50, plain,![X5]:(~(relation(X5))|![X6]:((~(X6=relation_dom(X5))|![X7]:((~(in(X7,X6))|in(ordered_pair(X7,esk1_3(X5,X6,X7)),X5))&(![X9]:~(in(ordered_pair(X7,X9),X5))|in(X7,X6))))&(((~(in(esk2_2(X5,X6),X6))|![X11]:~(in(ordered_pair(esk2_2(X5,X6),X11),X5)))&(in(esk2_2(X5,X6),X6)|in(ordered_pair(esk2_2(X5,X6),esk3_2(X5,X6)),X5)))|X6=relation_dom(X5)))),inference(skolemize,[status(esa)],[49])).
% fof(51, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(esk2_2(X5,X6),X11),X5))|~(in(esk2_2(X5,X6),X6)))&(in(esk2_2(X5,X6),X6)|in(ordered_pair(esk2_2(X5,X6),esk3_2(X5,X6)),X5)))|X6=relation_dom(X5))&(((~(in(ordered_pair(X7,X9),X5))|in(X7,X6))&(~(in(X7,X6))|in(ordered_pair(X7,esk1_3(X5,X6,X7)),X5)))|~(X6=relation_dom(X5))))|~(relation(X5))),inference(shift_quantors,[status(thm)],[50])).
% fof(52, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(esk2_2(X5,X6),X11),X5))|~(in(esk2_2(X5,X6),X6)))|X6=relation_dom(X5))|~(relation(X5)))&(((in(esk2_2(X5,X6),X6)|in(ordered_pair(esk2_2(X5,X6),esk3_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,esk1_3(X5,X6,X7)),X5))|~(X6=relation_dom(X5)))|~(relation(X5))))),inference(distribute,[status(thm)],[51])).
% cnf(54,plain,(in(X3,X2)|~relation(X1)|X2!=relation_dom(X1)|~in(ordered_pair(X3,X4),X1)),inference(split_conjunct,[status(thm)],[52])).
% fof(57, 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)],[3])).
% fof(58, 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)],[57])).
% fof(59, plain,![X5]:(~(relation(X5))|![X6]:((~(X6=relation_rng(X5))|![X7]:((~(in(X7,X6))|in(ordered_pair(esk4_3(X5,X6,X7),X7),X5))&(![X9]:~(in(ordered_pair(X9,X7),X5))|in(X7,X6))))&(((~(in(esk5_2(X5,X6),X6))|![X11]:~(in(ordered_pair(X11,esk5_2(X5,X6)),X5)))&(in(esk5_2(X5,X6),X6)|in(ordered_pair(esk6_2(X5,X6),esk5_2(X5,X6)),X5)))|X6=relation_rng(X5)))),inference(skolemize,[status(esa)],[58])).
% fof(60, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(X11,esk5_2(X5,X6)),X5))|~(in(esk5_2(X5,X6),X6)))&(in(esk5_2(X5,X6),X6)|in(ordered_pair(esk6_2(X5,X6),esk5_2(X5,X6)),X5)))|X6=relation_rng(X5))&(((~(in(ordered_pair(X9,X7),X5))|in(X7,X6))&(~(in(X7,X6))|in(ordered_pair(esk4_3(X5,X6,X7),X7),X5)))|~(X6=relation_rng(X5))))|~(relation(X5))),inference(shift_quantors,[status(thm)],[59])).
% fof(61, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(X11,esk5_2(X5,X6)),X5))|~(in(esk5_2(X5,X6),X6)))|X6=relation_rng(X5))|~(relation(X5)))&(((in(esk5_2(X5,X6),X6)|in(ordered_pair(esk6_2(X5,X6),esk5_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(esk4_3(X5,X6,X7),X7),X5))|~(X6=relation_rng(X5)))|~(relation(X5))))),inference(distribute,[status(thm)],[60])).
% cnf(63,plain,(in(X3,X2)|~relation(X1)|X2!=relation_rng(X1)|~in(ordered_pair(X4,X3),X1)),inference(split_conjunct,[status(thm)],[61])).
% fof(90, plain,![X1]:(~(relation(X1))|relation_field(X1)=set_union2(relation_dom(X1),relation_rng(X1))),inference(fof_nnf,[status(thm)],[12])).
% fof(91, plain,![X2]:(~(relation(X2))|relation_field(X2)=set_union2(relation_dom(X2),relation_rng(X2))),inference(variable_rename,[status(thm)],[90])).
% cnf(92,plain,(relation_field(X1)=set_union2(relation_dom(X1),relation_rng(X1))|~relation(X1)),inference(split_conjunct,[status(thm)],[91])).
% fof(93, 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)],[13])).
% fof(94, 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)],[93])).
% fof(95, 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(esk11_3(X5,X6,X7),X7))|(~(in(esk11_3(X5,X6,X7),X5))&~(in(esk11_3(X5,X6,X7),X6))))&(in(esk11_3(X5,X6,X7),X7)|(in(esk11_3(X5,X6,X7),X5)|in(esk11_3(X5,X6,X7),X6))))|X7=set_union2(X5,X6))),inference(skolemize,[status(esa)],[94])).
% fof(96, 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(esk11_3(X5,X6,X7),X7))|(~(in(esk11_3(X5,X6,X7),X5))&~(in(esk11_3(X5,X6,X7),X6))))&(in(esk11_3(X5,X6,X7),X7)|(in(esk11_3(X5,X6,X7),X5)|in(esk11_3(X5,X6,X7),X6))))|X7=set_union2(X5,X6))),inference(shift_quantors,[status(thm)],[95])).
% fof(97, 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(esk11_3(X5,X6,X7),X5))|~(in(esk11_3(X5,X6,X7),X7)))|X7=set_union2(X5,X6))&((~(in(esk11_3(X5,X6,X7),X6))|~(in(esk11_3(X5,X6,X7),X7)))|X7=set_union2(X5,X6)))&((in(esk11_3(X5,X6,X7),X7)|(in(esk11_3(X5,X6,X7),X5)|in(esk11_3(X5,X6,X7),X6)))|X7=set_union2(X5,X6)))),inference(distribute,[status(thm)],[96])).
% cnf(101,plain,(in(X4,X1)|X1!=set_union2(X2,X3)|~in(X4,X3)),inference(split_conjunct,[status(thm)],[97])).
% cnf(102,plain,(in(X4,X1)|X1!=set_union2(X2,X3)|~in(X4,X2)),inference(split_conjunct,[status(thm)],[97])).
% fof(120, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[20])).
% cnf(121,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[120])).
% fof(122, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[21])).
% cnf(123,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[122])).
% fof(143, 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)],[37])).
% fof(144, 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)],[143])).
% fof(145, negated_conjecture,(relation(esk14_0)&(in(ordered_pair(esk12_0,esk13_0),esk14_0)&(~(in(esk12_0,relation_field(esk14_0)))|~(in(esk13_0,relation_field(esk14_0)))))),inference(skolemize,[status(esa)],[144])).
% cnf(146,negated_conjecture,(~in(esk13_0,relation_field(esk14_0))|~in(esk12_0,relation_field(esk14_0))),inference(split_conjunct,[status(thm)],[145])).
% cnf(147,negated_conjecture,(in(ordered_pair(esk12_0,esk13_0),esk14_0)),inference(split_conjunct,[status(thm)],[145])).
% cnf(148,negated_conjecture,(relation(esk14_0)),inference(split_conjunct,[status(thm)],[145])).
% cnf(149,negated_conjecture,(in(unordered_pair(unordered_pair(esk12_0,esk13_0),singleton(esk12_0)),esk14_0)),inference(rw,[status(thm)],[147,121,theory(equality)]),['unfolding']).
% cnf(152,plain,(in(X3,X2)|relation_dom(X1)!=X2|~relation(X1)|~in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),X1)),inference(rw,[status(thm)],[54,121,theory(equality)]),['unfolding']).
% cnf(153,plain,(in(X3,X2)|relation_rng(X1)!=X2|~relation(X1)|~in(unordered_pair(unordered_pair(X4,X3),singleton(X4)),X1)),inference(rw,[status(thm)],[63,121,theory(equality)]),['unfolding']).
% cnf(159,negated_conjecture,(in(unordered_pair(singleton(esk12_0),unordered_pair(esk12_0,esk13_0)),esk14_0)),inference(rw,[status(thm)],[149,123,theory(equality)])).
% cnf(161,plain,(in(X3,X2)|relation_dom(X1)!=X2|~relation(X1)|~in(unordered_pair(singleton(X3),unordered_pair(X3,X4)),X1)),inference(rw,[status(thm)],[152,123,theory(equality)])).
% cnf(162,plain,(in(X3,X2)|relation_rng(X1)!=X2|~relation(X1)|~in(unordered_pair(singleton(X4),unordered_pair(X4,X3)),X1)),inference(rw,[status(thm)],[153,123,theory(equality)])).
% cnf(205,plain,(in(X1,set_union2(X2,X3))|~in(X1,X3)),inference(er,[status(thm)],[101,theory(equality)])).
% cnf(213,plain,(in(X1,set_union2(X2,X3))|~in(X1,X2)),inference(er,[status(thm)],[102,theory(equality)])).
% cnf(232,negated_conjecture,(in(esk12_0,X1)|relation_dom(esk14_0)!=X1|~relation(esk14_0)),inference(spm,[status(thm)],[161,159,theory(equality)])).
% cnf(233,negated_conjecture,(in(esk12_0,X1)|relation_dom(esk14_0)!=X1|$false),inference(rw,[status(thm)],[232,148,theory(equality)])).
% cnf(234,negated_conjecture,(in(esk12_0,X1)|relation_dom(esk14_0)!=X1),inference(cn,[status(thm)],[233,theory(equality)])).
% cnf(238,negated_conjecture,(in(esk13_0,X1)|relation_rng(esk14_0)!=X1|~relation(esk14_0)),inference(spm,[status(thm)],[162,159,theory(equality)])).
% cnf(239,negated_conjecture,(in(esk13_0,X1)|relation_rng(esk14_0)!=X1|$false),inference(rw,[status(thm)],[238,148,theory(equality)])).
% cnf(240,negated_conjecture,(in(esk13_0,X1)|relation_rng(esk14_0)!=X1),inference(cn,[status(thm)],[239,theory(equality)])).
% cnf(430,plain,(in(X1,relation_field(X2))|~in(X1,relation_rng(X2))|~relation(X2)),inference(spm,[status(thm)],[205,92,theory(equality)])).
% cnf(436,negated_conjecture,(~in(esk12_0,relation_field(esk14_0))|~relation(esk14_0)|~in(esk13_0,relation_rng(esk14_0))),inference(spm,[status(thm)],[146,430,theory(equality)])).
% cnf(449,negated_conjecture,(~in(esk12_0,relation_field(esk14_0))|$false|~in(esk13_0,relation_rng(esk14_0))),inference(rw,[status(thm)],[436,148,theory(equality)])).
% cnf(450,negated_conjecture,(~in(esk12_0,relation_field(esk14_0))|~in(esk13_0,relation_rng(esk14_0))),inference(cn,[status(thm)],[449,theory(equality)])).
% cnf(466,plain,(in(X1,relation_field(X2))|~in(X1,relation_dom(X2))|~relation(X2)),inference(spm,[status(thm)],[213,92,theory(equality)])).
% cnf(512,negated_conjecture,(~in(esk12_0,relation_field(esk14_0))),inference(spm,[status(thm)],[450,240,theory(equality)])).
% cnf(517,negated_conjecture,(~relation(esk14_0)|~in(esk12_0,relation_dom(esk14_0))),inference(spm,[status(thm)],[512,466,theory(equality)])).
% cnf(522,negated_conjecture,($false|~in(esk12_0,relation_dom(esk14_0))),inference(rw,[status(thm)],[517,148,theory(equality)])).
% cnf(523,negated_conjecture,(~in(esk12_0,relation_dom(esk14_0))),inference(cn,[status(thm)],[522,theory(equality)])).
% cnf(533,negated_conjecture,($false),inference(spm,[status(thm)],[523,234,theory(equality)])).
% cnf(536,negated_conjecture,($false),533,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 170
% # ...of these trivial                : 1
% # ...subsumed                        : 38
% # ...remaining for further processing: 131
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 1
% # Backward-rewritten                 : 4
% # Generated clauses                  : 308
% # ...of the previous two non-trivial : 269
% # Contextual simplify-reflections    : 4
% # Paramodulations                    : 288
% # Factorizations                     : 6
% # Equation resolutions               : 14
% # Current number of processed clauses: 87
% #    Positive orientable unit clauses: 11
% #    Positive unorientable unit clauses: 2
% #    Negative unit clauses           : 17
% #    Non-unit-clauses                : 57
% # Current number of unprocessed clauses: 175
% # ...number of literals in the above : 649
% # Clause-clause subsumption calls (NU) : 164
% # Rec. Clause-clause subsumption calls : 155
% # Unit Clause-clause subsumption calls : 42
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 20
% # Indexed BW rewrite successes       : 20
% # Backwards rewriting index:    96 leaves,   1.38+/-1.092 terms/leaf
% # Paramod-from index:           24 leaves,   1.33+/-0.799 terms/leaf
% # Paramod-into index:           85 leaves,   1.29+/-1.027 terms/leaf
% # -------------------------------------------------
% # User time              : 0.029 s
% # System time            : 0.002 s
% # Total time             : 0.031 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.20 WC
% FINAL PrfWatch: 0.11 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP12316/SEU180+1.tptp
% 
%------------------------------------------------------------------------------