TSTP Solution File: SEU212+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU212+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 : art04.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:25 EST 2010
% Result : Theorem 0.92s
% Output : Solution 0.92s
% 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/SystemOnTPTP14139/SEU212+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14139/SEU212+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14139/SEU212+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 14235
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.015 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(17, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_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(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(61, 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(62, 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)],[61])).
% fof(63, 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)],[62])).
% fof(64, 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)],[63])).
% cnf(67,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)],[64])).
% cnf(68,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)],[64])).
% fof(108, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[17])).
% cnf(109,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[108])).
% fof(142, 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(143, 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)],[142])).
% fof(144, negated_conjecture,((relation(esk13_0)&function(esk13_0))&((~(in(ordered_pair(esk11_0,esk12_0),esk13_0))|(~(in(esk11_0,relation_dom(esk13_0)))|~(esk12_0=apply(esk13_0,esk11_0))))&(in(ordered_pair(esk11_0,esk12_0),esk13_0)|(in(esk11_0,relation_dom(esk13_0))&esk12_0=apply(esk13_0,esk11_0))))),inference(skolemize,[status(esa)],[143])).
% fof(145, negated_conjecture,((relation(esk13_0)&function(esk13_0))&((~(in(ordered_pair(esk11_0,esk12_0),esk13_0))|(~(in(esk11_0,relation_dom(esk13_0)))|~(esk12_0=apply(esk13_0,esk11_0))))&((in(esk11_0,relation_dom(esk13_0))|in(ordered_pair(esk11_0,esk12_0),esk13_0))&(esk12_0=apply(esk13_0,esk11_0)|in(ordered_pair(esk11_0,esk12_0),esk13_0))))),inference(distribute,[status(thm)],[144])).
% cnf(146,negated_conjecture,(in(ordered_pair(esk11_0,esk12_0),esk13_0)|esk12_0=apply(esk13_0,esk11_0)),inference(split_conjunct,[status(thm)],[145])).
% cnf(147,negated_conjecture,(in(ordered_pair(esk11_0,esk12_0),esk13_0)|in(esk11_0,relation_dom(esk13_0))),inference(split_conjunct,[status(thm)],[145])).
% cnf(148,negated_conjecture,(esk12_0!=apply(esk13_0,esk11_0)|~in(esk11_0,relation_dom(esk13_0))|~in(ordered_pair(esk11_0,esk12_0),esk13_0)),inference(split_conjunct,[status(thm)],[145])).
% cnf(149,negated_conjecture,(function(esk13_0)),inference(split_conjunct,[status(thm)],[145])).
% cnf(150,negated_conjecture,(relation(esk13_0)),inference(split_conjunct,[status(thm)],[145])).
% cnf(151,negated_conjecture,(apply(esk13_0,esk11_0)=esk12_0|in(unordered_pair(unordered_pair(esk11_0,esk12_0),singleton(esk11_0)),esk13_0)),inference(rw,[status(thm)],[146,109,theory(equality)]),['unfolding']).
% cnf(152,negated_conjecture,(in(esk11_0,relation_dom(esk13_0))|in(unordered_pair(unordered_pair(esk11_0,esk12_0),singleton(esk11_0)),esk13_0)),inference(rw,[status(thm)],[147,109,theory(equality)]),['unfolding']).
% cnf(154,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,109,theory(equality)]),['unfolding']).
% cnf(157,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)],[67,109,theory(equality)]),['unfolding']).
% cnf(158,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)],[68,109,theory(equality)]),['unfolding']).
% cnf(160,negated_conjecture,(apply(esk13_0,esk11_0)!=esk12_0|~in(esk11_0,relation_dom(esk13_0))|~in(unordered_pair(unordered_pair(esk11_0,esk12_0),singleton(esk11_0)),esk13_0)),inference(rw,[status(thm)],[148,109,theory(equality)]),['unfolding']).
% cnf(197,negated_conjecture,(apply(esk13_0,esk11_0)=esk12_0|~function(esk13_0)|~relation(esk13_0)|~in(esk11_0,relation_dom(esk13_0))),inference(spm,[status(thm)],[157,151,theory(equality)])).
% cnf(199,negated_conjecture,(apply(esk13_0,esk11_0)=esk12_0|$false|~relation(esk13_0)|~in(esk11_0,relation_dom(esk13_0))),inference(rw,[status(thm)],[197,149,theory(equality)])).
% cnf(200,negated_conjecture,(apply(esk13_0,esk11_0)=esk12_0|$false|$false|~in(esk11_0,relation_dom(esk13_0))),inference(rw,[status(thm)],[199,150,theory(equality)])).
% cnf(201,negated_conjecture,(apply(esk13_0,esk11_0)=esk12_0|~in(esk11_0,relation_dom(esk13_0))),inference(cn,[status(thm)],[200,theory(equality)])).
% cnf(216,negated_conjecture,(in(esk11_0,X1)|in(esk11_0,relation_dom(esk13_0))|relation_dom(esk13_0)!=X1|~relation(esk13_0)),inference(spm,[status(thm)],[154,152,theory(equality)])).
% cnf(219,negated_conjecture,(in(esk11_0,X1)|in(esk11_0,relation_dom(esk13_0))|relation_dom(esk13_0)!=X1|$false),inference(rw,[status(thm)],[216,150,theory(equality)])).
% cnf(220,negated_conjecture,(in(esk11_0,X1)|in(esk11_0,relation_dom(esk13_0))|relation_dom(esk13_0)!=X1),inference(cn,[status(thm)],[219,theory(equality)])).
% cnf(287,negated_conjecture,(in(esk11_0,relation_dom(esk13_0))),inference(er,[status(thm)],[220,theory(equality)])).
% cnf(292,negated_conjecture,(in(unordered_pair(unordered_pair(esk11_0,X1),singleton(esk11_0)),esk13_0)|apply(esk13_0,esk11_0)!=X1|~function(esk13_0)|~relation(esk13_0)),inference(spm,[status(thm)],[158,287,theory(equality)])).
% cnf(294,negated_conjecture,(apply(esk13_0,esk11_0)=esk12_0|$false),inference(rw,[status(thm)],[201,287,theory(equality)])).
% cnf(295,negated_conjecture,(apply(esk13_0,esk11_0)=esk12_0),inference(cn,[status(thm)],[294,theory(equality)])).
% cnf(298,negated_conjecture,(apply(esk13_0,esk11_0)!=esk12_0|~in(unordered_pair(unordered_pair(esk11_0,esk12_0),singleton(esk11_0)),esk13_0)|$false),inference(rw,[status(thm)],[160,287,theory(equality)])).
% cnf(299,negated_conjecture,(apply(esk13_0,esk11_0)!=esk12_0|~in(unordered_pair(unordered_pair(esk11_0,esk12_0),singleton(esk11_0)),esk13_0)),inference(cn,[status(thm)],[298,theory(equality)])).
% cnf(301,negated_conjecture,(in(unordered_pair(unordered_pair(esk11_0,X1),singleton(esk11_0)),esk13_0)|apply(esk13_0,esk11_0)!=X1|$false|~relation(esk13_0)),inference(rw,[status(thm)],[292,149,theory(equality)])).
% cnf(302,negated_conjecture,(in(unordered_pair(unordered_pair(esk11_0,X1),singleton(esk11_0)),esk13_0)|apply(esk13_0,esk11_0)!=X1|$false|$false),inference(rw,[status(thm)],[301,150,theory(equality)])).
% cnf(303,negated_conjecture,(in(unordered_pair(unordered_pair(esk11_0,X1),singleton(esk11_0)),esk13_0)|apply(esk13_0,esk11_0)!=X1),inference(cn,[status(thm)],[302,theory(equality)])).
% cnf(330,negated_conjecture,($false|~in(unordered_pair(unordered_pair(esk11_0,esk12_0),singleton(esk11_0)),esk13_0)),inference(rw,[status(thm)],[299,295,theory(equality)])).
% cnf(331,negated_conjecture,(~in(unordered_pair(unordered_pair(esk11_0,esk12_0),singleton(esk11_0)),esk13_0)),inference(cn,[status(thm)],[330,theory(equality)])).
% cnf(332,negated_conjecture,(in(unordered_pair(unordered_pair(esk11_0,X1),singleton(esk11_0)),esk13_0)|esk12_0!=X1),inference(rw,[status(thm)],[303,295,theory(equality)])).
% cnf(333,negated_conjecture,(in(unordered_pair(unordered_pair(esk11_0,esk12_0),singleton(esk11_0)),esk13_0)),inference(er,[status(thm)],[332,theory(equality)])).
% cnf(334,negated_conjecture,($false),inference(sr,[status(thm)],[333,331,theory(equality)])).
% cnf(335,negated_conjecture,($false),334,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 80
% # ...of these trivial : 3
% # ...subsumed : 7
% # ...remaining for further processing: 70
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 15
% # Generated clauses : 91
% # ...of the previous two non-trivial : 78
% # Contextual simplify-reflections : 0
% # Paramodulations : 84
% # Factorizations : 0
% # Equation resolutions : 7
% # Current number of processed clauses: 55
% # Positive orientable unit clauses: 18
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 7
% # Non-unit-clauses : 29
% # Current number of unprocessed clauses: 21
% # ...number of literals in the above : 82
% # Clause-clause subsumption calls (NU) : 23
% # Rec. Clause-clause subsumption calls : 23
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 11
% # Indexed BW rewrite successes : 11
% # Backwards rewriting index: 76 leaves, 1.32+/-0.729 terms/leaf
% # Paramod-from index: 23 leaves, 1.04+/-0.204 terms/leaf
% # Paramod-into index: 60 leaves, 1.18+/-0.562 terms/leaf
% # -------------------------------------------------
% # User time : 0.018 s
% # System time : 0.003 s
% # Total time : 0.021 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.19 WC
% FINAL PrfWatch: 0.09 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP14139/SEU212+1.tptp
%
%------------------------------------------------------------------------------