TSTP Solution File: SEU212+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU212+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 : art03.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:33 EST 2010
% Result : Theorem 5.75s
% Output : Solution 5.75s
% 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/SystemOnTPTP19562/SEU212+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19562/SEU212+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19562/SEU212+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 19658
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.92 CPU 2.01 WC
% # Preprocessing time : 0.047 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(8, 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(9, 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(46, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(71, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(131, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(215, 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(216, 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)],[215])).
% fof(218, 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)],[8,theory(equality)])).
% fof(288, 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)],[218])).
% fof(289, 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)],[288])).
% fof(290, 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)],[289])).
% fof(291, 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)],[290])).
% cnf(294,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)],[291])).
% cnf(295,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)],[291])).
% fof(296, 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)],[9])).
% fof(297, 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)],[296])).
% fof(298, 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)],[297])).
% cnf(300,plain,(in(X2,relation_dom(X1))|~relation(X1)|~in(ordered_pair(X2,X3),X1)),inference(split_conjunct,[status(thm)],[298])).
% fof(567, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[46])).
% cnf(568,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[567])).
% fof(649, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[71])).
% cnf(650,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[649])).
% fof(866, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[131])).
% cnf(867,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[866])).
% fof(1113, 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)],[216])).
% fof(1114, 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)],[1113])).
% fof(1115, negated_conjecture,((relation(esk74_0)&function(esk74_0))&((~(in(ordered_pair(esk72_0,esk73_0),esk74_0))|(~(in(esk72_0,relation_dom(esk74_0)))|~(esk73_0=apply(esk74_0,esk72_0))))&(in(ordered_pair(esk72_0,esk73_0),esk74_0)|(in(esk72_0,relation_dom(esk74_0))&esk73_0=apply(esk74_0,esk72_0))))),inference(skolemize,[status(esa)],[1114])).
% fof(1116, negated_conjecture,((relation(esk74_0)&function(esk74_0))&((~(in(ordered_pair(esk72_0,esk73_0),esk74_0))|(~(in(esk72_0,relation_dom(esk74_0)))|~(esk73_0=apply(esk74_0,esk72_0))))&((in(esk72_0,relation_dom(esk74_0))|in(ordered_pair(esk72_0,esk73_0),esk74_0))&(esk73_0=apply(esk74_0,esk72_0)|in(ordered_pair(esk72_0,esk73_0),esk74_0))))),inference(distribute,[status(thm)],[1115])).
% cnf(1117,negated_conjecture,(in(ordered_pair(esk72_0,esk73_0),esk74_0)|esk73_0=apply(esk74_0,esk72_0)),inference(split_conjunct,[status(thm)],[1116])).
% cnf(1118,negated_conjecture,(in(ordered_pair(esk72_0,esk73_0),esk74_0)|in(esk72_0,relation_dom(esk74_0))),inference(split_conjunct,[status(thm)],[1116])).
% cnf(1119,negated_conjecture,(esk73_0!=apply(esk74_0,esk72_0)|~in(esk72_0,relation_dom(esk74_0))|~in(ordered_pair(esk72_0,esk73_0),esk74_0)),inference(split_conjunct,[status(thm)],[1116])).
% cnf(1120,negated_conjecture,(function(esk74_0)),inference(split_conjunct,[status(thm)],[1116])).
% cnf(1121,negated_conjecture,(relation(esk74_0)),inference(split_conjunct,[status(thm)],[1116])).
% cnf(1126,plain,(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1))=ordered_pair(X1,X2)),inference(rw,[status(thm)],[650,867,theory(equality)]),['unfolding']).
% cnf(1174,negated_conjecture,(apply(esk74_0,esk72_0)=esk73_0|in(unordered_pair(unordered_pair(esk72_0,esk73_0),unordered_pair(esk72_0,esk72_0)),esk74_0)),inference(rw,[status(thm)],[1117,1126,theory(equality)]),['unfolding']).
% cnf(1175,negated_conjecture,(in(esk72_0,relation_dom(esk74_0))|in(unordered_pair(unordered_pair(esk72_0,esk73_0),unordered_pair(esk72_0,esk72_0)),esk74_0)),inference(rw,[status(thm)],[1118,1126,theory(equality)]),['unfolding']).
% cnf(1194,plain,(in(X2,relation_dom(X1))|~relation(X1)|~in(unordered_pair(unordered_pair(X2,X3),unordered_pair(X2,X2)),X1)),inference(rw,[status(thm)],[300,1126,theory(equality)]),['unfolding']).
% cnf(1230,plain,(apply(X1,X2)=X3|~relation(X1)|~function(X1)|~in(X2,relation_dom(X1))|~in(unordered_pair(unordered_pair(X2,X3),unordered_pair(X2,X2)),X1)),inference(rw,[status(thm)],[294,1126,theory(equality)]),['unfolding']).
% cnf(1233,plain,(in(unordered_pair(unordered_pair(X2,X3),unordered_pair(X2,X2)),X1)|apply(X1,X2)!=X3|~relation(X1)|~function(X1)|~in(X2,relation_dom(X1))),inference(rw,[status(thm)],[295,1126,theory(equality)]),['unfolding']).
% cnf(1254,negated_conjecture,(apply(esk74_0,esk72_0)!=esk73_0|~in(esk72_0,relation_dom(esk74_0))|~in(unordered_pair(unordered_pair(esk72_0,esk73_0),unordered_pair(esk72_0,esk72_0)),esk74_0)),inference(rw,[status(thm)],[1119,1126,theory(equality)]),['unfolding']).
% cnf(1259,negated_conjecture,(apply(esk74_0,esk72_0)!=esk73_0|~in(unordered_pair(unordered_pair(esk72_0,esk72_0),unordered_pair(esk72_0,esk73_0)),esk74_0)|~in(esk72_0,relation_dom(esk74_0))),inference(rw,[status(thm)],[1254,568,theory(equality)])).
% cnf(1260,negated_conjecture,(in(unordered_pair(unordered_pair(esk72_0,esk72_0),unordered_pair(esk72_0,esk73_0)),esk74_0)|in(esk72_0,relation_dom(esk74_0))),inference(rw,[status(thm)],[1175,568,theory(equality)])).
% cnf(1261,negated_conjecture,(apply(esk74_0,esk72_0)=esk73_0|in(unordered_pair(unordered_pair(esk72_0,esk72_0),unordered_pair(esk72_0,esk73_0)),esk74_0)),inference(rw,[status(thm)],[1174,568,theory(equality)])).
% cnf(1275,plain,(apply(X1,X2)=X3|~function(X1)|~relation(X1)|~in(unordered_pair(unordered_pair(X2,X3),unordered_pair(X2,X2)),X1)),inference(csr,[status(thm)],[1230,1194])).
% cnf(2045,plain,(in(X1,relation_dom(X2))|~relation(X2)|~in(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,X3)),X2)),inference(spm,[status(thm)],[1194,568,theory(equality)])).
% cnf(2562,plain,(apply(X1,X2)=X3|~function(X1)|~relation(X1)|~in(unordered_pair(unordered_pair(X2,X2),unordered_pair(X2,X3)),X1)),inference(spm,[status(thm)],[1275,568,theory(equality)])).
% cnf(3518,negated_conjecture,(in(unordered_pair(unordered_pair(esk72_0,X1),unordered_pair(esk72_0,esk72_0)),esk74_0)|in(unordered_pair(unordered_pair(esk72_0,esk72_0),unordered_pair(esk72_0,esk73_0)),esk74_0)|esk73_0!=X1|~function(esk74_0)|~relation(esk74_0)|~in(esk72_0,relation_dom(esk74_0))),inference(spm,[status(thm)],[1233,1261,theory(equality)])).
% cnf(3519,negated_conjecture,(in(unordered_pair(unordered_pair(esk72_0,X1),unordered_pair(esk72_0,esk72_0)),esk74_0)|in(unordered_pair(unordered_pair(esk72_0,esk72_0),unordered_pair(esk72_0,esk73_0)),esk74_0)|esk73_0!=X1|$false|~relation(esk74_0)|~in(esk72_0,relation_dom(esk74_0))),inference(rw,[status(thm)],[3518,1120,theory(equality)])).
% cnf(3520,negated_conjecture,(in(unordered_pair(unordered_pair(esk72_0,X1),unordered_pair(esk72_0,esk72_0)),esk74_0)|in(unordered_pair(unordered_pair(esk72_0,esk72_0),unordered_pair(esk72_0,esk73_0)),esk74_0)|esk73_0!=X1|$false|$false|~in(esk72_0,relation_dom(esk74_0))),inference(rw,[status(thm)],[3519,1121,theory(equality)])).
% cnf(3521,negated_conjecture,(in(unordered_pair(unordered_pair(esk72_0,X1),unordered_pair(esk72_0,esk72_0)),esk74_0)|in(unordered_pair(unordered_pair(esk72_0,esk72_0),unordered_pair(esk72_0,esk73_0)),esk74_0)|esk73_0!=X1|~in(esk72_0,relation_dom(esk74_0))),inference(cn,[status(thm)],[3520,theory(equality)])).
% cnf(7290,negated_conjecture,(in(unordered_pair(unordered_pair(esk72_0,esk72_0),unordered_pair(esk72_0,esk73_0)),esk74_0)|in(unordered_pair(unordered_pair(esk72_0,X1),unordered_pair(esk72_0,esk72_0)),esk74_0)|esk73_0!=X1),inference(csr,[status(thm)],[3521,1260])).
% cnf(7291,negated_conjecture,(in(unordered_pair(unordered_pair(esk72_0,esk72_0),unordered_pair(esk72_0,esk73_0)),esk74_0)|in(unordered_pair(unordered_pair(esk72_0,esk73_0),unordered_pair(esk72_0,esk72_0)),esk74_0)),inference(er,[status(thm)],[7290,theory(equality)])).
% cnf(7292,negated_conjecture,(in(unordered_pair(unordered_pair(esk72_0,esk72_0),unordered_pair(esk72_0,esk73_0)),esk74_0)|in(unordered_pair(unordered_pair(esk72_0,esk72_0),unordered_pair(esk72_0,esk73_0)),esk74_0)),inference(rw,[status(thm)],[7291,568,theory(equality)])).
% cnf(7293,negated_conjecture,(in(unordered_pair(unordered_pair(esk72_0,esk72_0),unordered_pair(esk72_0,esk73_0)),esk74_0)),inference(cn,[status(thm)],[7292,theory(equality)])).
% cnf(7311,negated_conjecture,(apply(esk74_0,esk72_0)!=esk73_0|$false|~in(esk72_0,relation_dom(esk74_0))),inference(rw,[status(thm)],[1259,7293,theory(equality)])).
% cnf(7312,negated_conjecture,(apply(esk74_0,esk72_0)!=esk73_0|~in(esk72_0,relation_dom(esk74_0))),inference(cn,[status(thm)],[7311,theory(equality)])).
% cnf(28705,negated_conjecture,(in(esk72_0,relation_dom(esk74_0))|~relation(esk74_0)),inference(spm,[status(thm)],[2045,7293,theory(equality)])).
% cnf(28722,negated_conjecture,(in(esk72_0,relation_dom(esk74_0))|$false),inference(rw,[status(thm)],[28705,1121,theory(equality)])).
% cnf(28723,negated_conjecture,(in(esk72_0,relation_dom(esk74_0))),inference(cn,[status(thm)],[28722,theory(equality)])).
% cnf(28750,negated_conjecture,(apply(esk74_0,esk72_0)!=esk73_0|$false),inference(rw,[status(thm)],[7312,28723,theory(equality)])).
% cnf(28751,negated_conjecture,(apply(esk74_0,esk72_0)!=esk73_0),inference(cn,[status(thm)],[28750,theory(equality)])).
% cnf(59757,negated_conjecture,(apply(esk74_0,esk72_0)=esk73_0|~function(esk74_0)|~relation(esk74_0)),inference(spm,[status(thm)],[2562,7293,theory(equality)])).
% cnf(59774,negated_conjecture,(apply(esk74_0,esk72_0)=esk73_0|$false|~relation(esk74_0)),inference(rw,[status(thm)],[59757,1120,theory(equality)])).
% cnf(59775,negated_conjecture,(apply(esk74_0,esk72_0)=esk73_0|$false|$false),inference(rw,[status(thm)],[59774,1121,theory(equality)])).
% cnf(59776,negated_conjecture,(apply(esk74_0,esk72_0)=esk73_0),inference(cn,[status(thm)],[59775,theory(equality)])).
% cnf(59777,negated_conjecture,($false),inference(sr,[status(thm)],[59776,28751,theory(equality)])).
% cnf(59778,negated_conjecture,($false),59777,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 8393
% # ...of these trivial : 45
% # ...subsumed : 5912
% # ...remaining for further processing: 2436
% # Other redundant clauses eliminated : 122
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 7
% # Backward-rewritten : 42
% # Generated clauses : 47717
% # ...of the previous two non-trivial : 45800
% # Contextual simplify-reflections : 883
% # Paramodulations : 47505
% # Factorizations : 18
% # Equation resolutions : 194
% # Current number of processed clauses: 2040
% # Positive orientable unit clauses: 140
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 353
% # Non-unit-clauses : 1543
% # Current number of unprocessed clauses: 37501
% # ...number of literals in the above : 151024
% # Clause-clause subsumption calls (NU) : 107935
% # Rec. Clause-clause subsumption calls : 73861
% # Unit Clause-clause subsumption calls : 9642
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 128
% # Indexed BW rewrite successes : 80
% # Backwards rewriting index: 1538 leaves, 1.44+/-2.152 terms/leaf
% # Paramod-from index: 410 leaves, 1.18+/-0.987 terms/leaf
% # Paramod-into index: 1391 leaves, 1.38+/-1.844 terms/leaf
% # -------------------------------------------------
% # User time : 2.336 s
% # System time : 0.078 s
% # Total time : 2.414 s
% # Maximum resident set size: 0 pages
% PrfWatch: 3.50 CPU 3.60 WC
% FINAL PrfWatch: 3.50 CPU 3.60 WC
% SZS output end Solution for /tmp/SystemOnTPTP19562/SEU212+2.tptp
%
%------------------------------------------------------------------------------