TSTP Solution File: SEU212+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU212+3 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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:53:40 EST 2010
% Result : Theorem 1.10s
% Output : Solution 1.10s
% 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/SystemOnTPTP6905/SEU212+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6905/SEU212+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6905/SEU212+3.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 7001
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.017 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(4, axiom,![X1]:((relation(X1)&function(X1))=>![X2]:![X3]:((in(X2,relation_dom(X1))=>(X3=apply(X1,X2)<=>in(ordered_pair(X2,X3),X1)))&(~(in(X2,relation_dom(X1)))=>(X3=apply(X1,X2)<=>X3=empty_set)))),file('/tmp/SRASS.s.p', d4_funct_1)).
% fof(18, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(19, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(35, conjecture,![X1]:![X2]:![X3]:((relation(X3)&function(X3))=>(in(ordered_pair(X1,X2),X3)<=>(in(X1,relation_dom(X3))&X2=apply(X3,X1)))),file('/tmp/SRASS.s.p', t8_funct_1)).
% fof(36, negated_conjecture,~(![X1]:![X2]:![X3]:((relation(X3)&function(X3))=>(in(ordered_pair(X1,X2),X3)<=>(in(X1,relation_dom(X3))&X2=apply(X3,X1))))),inference(assume_negation,[status(cth)],[35])).
% fof(38, plain,![X1]:((relation(X1)&function(X1))=>![X2]:![X3]:((in(X2,relation_dom(X1))=>(X3=apply(X1,X2)<=>in(ordered_pair(X2,X3),X1)))&(~(in(X2,relation_dom(X1)))=>(X3=apply(X1,X2)<=>X3=empty_set)))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(50, 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(51, 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)],[50])).
% fof(52, 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)],[51])).
% fof(53, 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)],[52])).
% fof(54, 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)],[53])).
% cnf(56,plain,(in(X3,X2)|~relation(X1)|X2!=relation_dom(X1)|~in(ordered_pair(X3,X4),X1)),inference(split_conjunct,[status(thm)],[54])).
% fof(63, plain,![X1]:((~(relation(X1))|~(function(X1)))|![X2]:![X3]:((~(in(X2,relation_dom(X1)))|((~(X3=apply(X1,X2))|in(ordered_pair(X2,X3),X1))&(~(in(ordered_pair(X2,X3),X1))|X3=apply(X1,X2))))&(in(X2,relation_dom(X1))|((~(X3=apply(X1,X2))|X3=empty_set)&(~(X3=empty_set)|X3=apply(X1,X2)))))),inference(fof_nnf,[status(thm)],[38])).
% fof(64, plain,![X4]:((~(relation(X4))|~(function(X4)))|![X5]:![X6]:((~(in(X5,relation_dom(X4)))|((~(X6=apply(X4,X5))|in(ordered_pair(X5,X6),X4))&(~(in(ordered_pair(X5,X6),X4))|X6=apply(X4,X5))))&(in(X5,relation_dom(X4))|((~(X6=apply(X4,X5))|X6=empty_set)&(~(X6=empty_set)|X6=apply(X4,X5)))))),inference(variable_rename,[status(thm)],[63])).
% fof(65, plain,![X4]:![X5]:![X6]:(((~(in(X5,relation_dom(X4)))|((~(X6=apply(X4,X5))|in(ordered_pair(X5,X6),X4))&(~(in(ordered_pair(X5,X6),X4))|X6=apply(X4,X5))))&(in(X5,relation_dom(X4))|((~(X6=apply(X4,X5))|X6=empty_set)&(~(X6=empty_set)|X6=apply(X4,X5)))))|(~(relation(X4))|~(function(X4)))),inference(shift_quantors,[status(thm)],[64])).
% fof(66, plain,![X4]:![X5]:![X6]:(((((~(X6=apply(X4,X5))|in(ordered_pair(X5,X6),X4))|~(in(X5,relation_dom(X4))))|(~(relation(X4))|~(function(X4))))&(((~(in(ordered_pair(X5,X6),X4))|X6=apply(X4,X5))|~(in(X5,relation_dom(X4))))|(~(relation(X4))|~(function(X4)))))&((((~(X6=apply(X4,X5))|X6=empty_set)|in(X5,relation_dom(X4)))|(~(relation(X4))|~(function(X4))))&(((~(X6=empty_set)|X6=apply(X4,X5))|in(X5,relation_dom(X4)))|(~(relation(X4))|~(function(X4)))))),inference(distribute,[status(thm)],[65])).
% cnf(69,plain,(X3=apply(X1,X2)|~function(X1)|~relation(X1)|~in(X2,relation_dom(X1))|~in(ordered_pair(X2,X3),X1)),inference(split_conjunct,[status(thm)],[66])).
% cnf(70,plain,(in(ordered_pair(X2,X3),X1)|~function(X1)|~relation(X1)|~in(X2,relation_dom(X1))|X3!=apply(X1,X2)),inference(split_conjunct,[status(thm)],[66])).
% fof(113, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[18])).
% cnf(114,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[113])).
% fof(115, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[19])).
% cnf(116,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[115])).
% fof(161, negated_conjecture,?[X1]:?[X2]:?[X3]:((relation(X3)&function(X3))&((~(in(ordered_pair(X1,X2),X3))|(~(in(X1,relation_dom(X3)))|~(X2=apply(X3,X1))))&(in(ordered_pair(X1,X2),X3)|(in(X1,relation_dom(X3))&X2=apply(X3,X1))))),inference(fof_nnf,[status(thm)],[36])).
% fof(162, negated_conjecture,?[X4]:?[X5]:?[X6]:((relation(X6)&function(X6))&((~(in(ordered_pair(X4,X5),X6))|(~(in(X4,relation_dom(X6)))|~(X5=apply(X6,X4))))&(in(ordered_pair(X4,X5),X6)|(in(X4,relation_dom(X6))&X5=apply(X6,X4))))),inference(variable_rename,[status(thm)],[161])).
% fof(163, negated_conjecture,((relation(esk15_0)&function(esk15_0))&((~(in(ordered_pair(esk13_0,esk14_0),esk15_0))|(~(in(esk13_0,relation_dom(esk15_0)))|~(esk14_0=apply(esk15_0,esk13_0))))&(in(ordered_pair(esk13_0,esk14_0),esk15_0)|(in(esk13_0,relation_dom(esk15_0))&esk14_0=apply(esk15_0,esk13_0))))),inference(skolemize,[status(esa)],[162])).
% fof(164, negated_conjecture,((relation(esk15_0)&function(esk15_0))&((~(in(ordered_pair(esk13_0,esk14_0),esk15_0))|(~(in(esk13_0,relation_dom(esk15_0)))|~(esk14_0=apply(esk15_0,esk13_0))))&((in(esk13_0,relation_dom(esk15_0))|in(ordered_pair(esk13_0,esk14_0),esk15_0))&(esk14_0=apply(esk15_0,esk13_0)|in(ordered_pair(esk13_0,esk14_0),esk15_0))))),inference(distribute,[status(thm)],[163])).
% cnf(165,negated_conjecture,(in(ordered_pair(esk13_0,esk14_0),esk15_0)|esk14_0=apply(esk15_0,esk13_0)),inference(split_conjunct,[status(thm)],[164])).
% cnf(166,negated_conjecture,(in(ordered_pair(esk13_0,esk14_0),esk15_0)|in(esk13_0,relation_dom(esk15_0))),inference(split_conjunct,[status(thm)],[164])).
% cnf(167,negated_conjecture,(esk14_0!=apply(esk15_0,esk13_0)|~in(esk13_0,relation_dom(esk15_0))|~in(ordered_pair(esk13_0,esk14_0),esk15_0)),inference(split_conjunct,[status(thm)],[164])).
% cnf(168,negated_conjecture,(function(esk15_0)),inference(split_conjunct,[status(thm)],[164])).
% cnf(169,negated_conjecture,(relation(esk15_0)),inference(split_conjunct,[status(thm)],[164])).
% cnf(170,negated_conjecture,(apply(esk15_0,esk13_0)=esk14_0|in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk15_0)),inference(rw,[status(thm)],[165,114,theory(equality)]),['unfolding']).
% cnf(171,negated_conjecture,(in(esk13_0,relation_dom(esk15_0))|in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk15_0)),inference(rw,[status(thm)],[166,114,theory(equality)]),['unfolding']).
% cnf(173,plain,(in(X3,X2)|relation_dom(X1)!=X2|~relation(X1)|~in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),X1)),inference(rw,[status(thm)],[56,114,theory(equality)]),['unfolding']).
% cnf(176,plain,(apply(X1,X2)=X3|~relation(X1)|~function(X1)|~in(X2,relation_dom(X1))|~in(unordered_pair(unordered_pair(X2,X3),singleton(X2)),X1)),inference(rw,[status(thm)],[69,114,theory(equality)]),['unfolding']).
% cnf(177,plain,(in(unordered_pair(unordered_pair(X2,X3),singleton(X2)),X1)|apply(X1,X2)!=X3|~relation(X1)|~function(X1)|~in(X2,relation_dom(X1))),inference(rw,[status(thm)],[70,114,theory(equality)]),['unfolding']).
% cnf(179,negated_conjecture,(apply(esk15_0,esk13_0)!=esk14_0|~in(esk13_0,relation_dom(esk15_0))|~in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk15_0)),inference(rw,[status(thm)],[167,114,theory(equality)]),['unfolding']).
% cnf(184,negated_conjecture,(in(esk13_0,relation_dom(esk15_0))|in(unordered_pair(singleton(esk13_0),unordered_pair(esk13_0,esk14_0)),esk15_0)),inference(rw,[status(thm)],[171,116,theory(equality)])).
% cnf(185,negated_conjecture,(apply(esk15_0,esk13_0)=esk14_0|in(unordered_pair(singleton(esk13_0),unordered_pair(esk13_0,esk14_0)),esk15_0)),inference(rw,[status(thm)],[170,116,theory(equality)])).
% cnf(186,negated_conjecture,(apply(esk15_0,esk13_0)!=esk14_0|~in(esk13_0,relation_dom(esk15_0))|~in(unordered_pair(singleton(esk13_0),unordered_pair(esk13_0,esk14_0)),esk15_0)),inference(rw,[status(thm)],[179,116,theory(equality)])).
% cnf(187,plain,(in(X3,X2)|relation_dom(X1)!=X2|~relation(X1)|~in(unordered_pair(singleton(X3),unordered_pair(X3,X4)),X1)),inference(rw,[status(thm)],[173,116,theory(equality)])).
% cnf(188,plain,(in(unordered_pair(singleton(X2),unordered_pair(X2,X3)),X1)|apply(X1,X2)!=X3|~relation(X1)|~function(X1)|~in(X2,relation_dom(X1))),inference(rw,[status(thm)],[177,116,theory(equality)])).
% cnf(189,plain,(apply(X1,X2)=X3|~relation(X1)|~function(X1)|~in(X2,relation_dom(X1))|~in(unordered_pair(singleton(X2),unordered_pair(X2,X3)),X1)),inference(rw,[status(thm)],[176,116,theory(equality)])).
% cnf(243,negated_conjecture,(apply(esk15_0,esk13_0)!=esk14_0|~in(esk13_0,relation_dom(esk15_0))|~function(esk15_0)|~relation(esk15_0)),inference(spm,[status(thm)],[186,188,theory(equality)])).
% cnf(247,negated_conjecture,(apply(esk15_0,esk13_0)!=esk14_0|~in(esk13_0,relation_dom(esk15_0))|$false|~relation(esk15_0)),inference(rw,[status(thm)],[243,168,theory(equality)])).
% cnf(248,negated_conjecture,(apply(esk15_0,esk13_0)!=esk14_0|~in(esk13_0,relation_dom(esk15_0))|$false|$false),inference(rw,[status(thm)],[247,169,theory(equality)])).
% cnf(249,negated_conjecture,(apply(esk15_0,esk13_0)!=esk14_0|~in(esk13_0,relation_dom(esk15_0))),inference(cn,[status(thm)],[248,theory(equality)])).
% cnf(253,negated_conjecture,(apply(esk15_0,esk13_0)=esk14_0|~function(esk15_0)|~relation(esk15_0)|~in(esk13_0,relation_dom(esk15_0))),inference(spm,[status(thm)],[189,185,theory(equality)])).
% cnf(256,negated_conjecture,(apply(esk15_0,esk13_0)=esk14_0|$false|~relation(esk15_0)|~in(esk13_0,relation_dom(esk15_0))),inference(rw,[status(thm)],[253,168,theory(equality)])).
% cnf(257,negated_conjecture,(apply(esk15_0,esk13_0)=esk14_0|$false|$false|~in(esk13_0,relation_dom(esk15_0))),inference(rw,[status(thm)],[256,169,theory(equality)])).
% cnf(258,negated_conjecture,(apply(esk15_0,esk13_0)=esk14_0|~in(esk13_0,relation_dom(esk15_0))),inference(cn,[status(thm)],[257,theory(equality)])).
% cnf(288,negated_conjecture,(~in(esk13_0,relation_dom(esk15_0))),inference(csr,[status(thm)],[258,249])).
% cnf(290,negated_conjecture,(in(unordered_pair(singleton(esk13_0),unordered_pair(esk13_0,esk14_0)),esk15_0)),inference(sr,[status(thm)],[184,288,theory(equality)])).
% cnf(294,negated_conjecture,(in(esk13_0,X1)|relation_dom(esk15_0)!=X1|~relation(esk15_0)),inference(spm,[status(thm)],[187,290,theory(equality)])).
% cnf(296,negated_conjecture,(in(esk13_0,X1)|relation_dom(esk15_0)!=X1|$false),inference(rw,[status(thm)],[294,169,theory(equality)])).
% cnf(297,negated_conjecture,(in(esk13_0,X1)|relation_dom(esk15_0)!=X1),inference(cn,[status(thm)],[296,theory(equality)])).
% cnf(317,negated_conjecture,($false),inference(spm,[status(thm)],[288,297,theory(equality)])).
% cnf(318,negated_conjecture,($false),317,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 119
% # ...of these trivial : 3
% # ...subsumed : 3
% # ...remaining for further processing: 113
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 5
% # Generated clauses : 94
% # ...of the previous two non-trivial : 81
% # Contextual simplify-reflections : 1
% # Paramodulations : 91
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 54
% # Positive orientable unit clauses: 17
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 7
% # Non-unit-clauses : 29
% # Current number of unprocessed clauses: 54
% # ...number of literals in the above : 192
% # Clause-clause subsumption calls (NU) : 41
% # Rec. Clause-clause subsumption calls : 41
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 10
% # Indexed BW rewrite successes : 10
% # Backwards rewriting index: 70 leaves, 1.40+/-0.917 terms/leaf
% # Paramod-from index: 29 leaves, 1.10+/-0.402 terms/leaf
% # Paramod-into index: 66 leaves, 1.23+/-0.775 terms/leaf
% # -------------------------------------------------
% # User time : 0.019 s
% # System time : 0.006 s
% # Total time : 0.025 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.22 WC
% FINAL PrfWatch: 0.14 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP6905/SEU212+3.tptp
%
%------------------------------------------------------------------------------