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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SEU223+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 : art11.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory   : 2006MB
% OS       : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 02:05:54 EST 2010

% Result   : Theorem 1.17s
% Output   : Solution 1.17s
% 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/SystemOnTPTP1468/SEU223+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP1468/SEU223+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1468/SEU223+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 1600
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 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]:![X2]:(relation(X1)=>relation(relation_dom_restriction(X1,X2))),file('/tmp/SRASS.s.p', dt_k7_relat_1)).
% fof(4, axiom,![X1]:![X2]:((relation(X1)&function(X1))=>(relation(relation_dom_restriction(X1,X2))&function(relation_dom_restriction(X1,X2)))),file('/tmp/SRASS.s.p', fc4_funct_1)).
% fof(5, axiom,![X1]:![X2]:((relation(X2)&function(X2))=>![X3]:((relation(X3)&function(X3))=>(X2=relation_dom_restriction(X3,X1)<=>(relation_dom(X2)=set_intersection2(relation_dom(X3),X1)&![X4]:(in(X4,relation_dom(X2))=>apply(X2,X4)=apply(X3,X4)))))),file('/tmp/SRASS.s.p', t68_funct_1)).
% fof(37, conjecture,![X1]:![X2]:![X3]:((relation(X3)&function(X3))=>(in(X2,relation_dom(relation_dom_restriction(X3,X1)))=>apply(relation_dom_restriction(X3,X1),X2)=apply(X3,X2))),file('/tmp/SRASS.s.p', t70_funct_1)).
% fof(38, negated_conjecture,~(![X1]:![X2]:![X3]:((relation(X3)&function(X3))=>(in(X2,relation_dom(relation_dom_restriction(X3,X1)))=>apply(relation_dom_restriction(X3,X1),X2)=apply(X3,X2)))),inference(assume_negation,[status(cth)],[37])).
% fof(46, plain,![X1]:![X2]:(~(relation(X1))|relation(relation_dom_restriction(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(47, plain,![X3]:![X4]:(~(relation(X3))|relation(relation_dom_restriction(X3,X4))),inference(variable_rename,[status(thm)],[46])).
% cnf(48,plain,(relation(relation_dom_restriction(X1,X2))|~relation(X1)),inference(split_conjunct,[status(thm)],[47])).
% fof(53, plain,![X1]:![X2]:((~(relation(X1))|~(function(X1)))|(relation(relation_dom_restriction(X1,X2))&function(relation_dom_restriction(X1,X2)))),inference(fof_nnf,[status(thm)],[4])).
% fof(54, plain,![X3]:![X4]:((~(relation(X3))|~(function(X3)))|(relation(relation_dom_restriction(X3,X4))&function(relation_dom_restriction(X3,X4)))),inference(variable_rename,[status(thm)],[53])).
% fof(55, plain,![X3]:![X4]:((relation(relation_dom_restriction(X3,X4))|(~(relation(X3))|~(function(X3))))&(function(relation_dom_restriction(X3,X4))|(~(relation(X3))|~(function(X3))))),inference(distribute,[status(thm)],[54])).
% cnf(56,plain,(function(relation_dom_restriction(X1,X2))|~function(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[55])).
% fof(58, plain,![X1]:![X2]:((~(relation(X2))|~(function(X2)))|![X3]:((~(relation(X3))|~(function(X3)))|((~(X2=relation_dom_restriction(X3,X1))|(relation_dom(X2)=set_intersection2(relation_dom(X3),X1)&![X4]:(~(in(X4,relation_dom(X2)))|apply(X2,X4)=apply(X3,X4))))&((~(relation_dom(X2)=set_intersection2(relation_dom(X3),X1))|?[X4]:(in(X4,relation_dom(X2))&~(apply(X2,X4)=apply(X3,X4))))|X2=relation_dom_restriction(X3,X1))))),inference(fof_nnf,[status(thm)],[5])).
% fof(59, plain,![X5]:![X6]:((~(relation(X6))|~(function(X6)))|![X7]:((~(relation(X7))|~(function(X7)))|((~(X6=relation_dom_restriction(X7,X5))|(relation_dom(X6)=set_intersection2(relation_dom(X7),X5)&![X8]:(~(in(X8,relation_dom(X6)))|apply(X6,X8)=apply(X7,X8))))&((~(relation_dom(X6)=set_intersection2(relation_dom(X7),X5))|?[X9]:(in(X9,relation_dom(X6))&~(apply(X6,X9)=apply(X7,X9))))|X6=relation_dom_restriction(X7,X5))))),inference(variable_rename,[status(thm)],[58])).
% fof(60, plain,![X5]:![X6]:((~(relation(X6))|~(function(X6)))|![X7]:((~(relation(X7))|~(function(X7)))|((~(X6=relation_dom_restriction(X7,X5))|(relation_dom(X6)=set_intersection2(relation_dom(X7),X5)&![X8]:(~(in(X8,relation_dom(X6)))|apply(X6,X8)=apply(X7,X8))))&((~(relation_dom(X6)=set_intersection2(relation_dom(X7),X5))|(in(esk2_3(X5,X6,X7),relation_dom(X6))&~(apply(X6,esk2_3(X5,X6,X7))=apply(X7,esk2_3(X5,X6,X7)))))|X6=relation_dom_restriction(X7,X5))))),inference(skolemize,[status(esa)],[59])).
% fof(61, plain,![X5]:![X6]:![X7]:![X8]:((((((~(in(X8,relation_dom(X6)))|apply(X6,X8)=apply(X7,X8))&relation_dom(X6)=set_intersection2(relation_dom(X7),X5))|~(X6=relation_dom_restriction(X7,X5)))&((~(relation_dom(X6)=set_intersection2(relation_dom(X7),X5))|(in(esk2_3(X5,X6,X7),relation_dom(X6))&~(apply(X6,esk2_3(X5,X6,X7))=apply(X7,esk2_3(X5,X6,X7)))))|X6=relation_dom_restriction(X7,X5)))|(~(relation(X7))|~(function(X7))))|(~(relation(X6))|~(function(X6)))),inference(shift_quantors,[status(thm)],[60])).
% fof(62, plain,![X5]:![X6]:![X7]:![X8]:((((((~(in(X8,relation_dom(X6)))|apply(X6,X8)=apply(X7,X8))|~(X6=relation_dom_restriction(X7,X5)))|(~(relation(X7))|~(function(X7))))|(~(relation(X6))|~(function(X6))))&(((relation_dom(X6)=set_intersection2(relation_dom(X7),X5)|~(X6=relation_dom_restriction(X7,X5)))|(~(relation(X7))|~(function(X7))))|(~(relation(X6))|~(function(X6)))))&(((((in(esk2_3(X5,X6,X7),relation_dom(X6))|~(relation_dom(X6)=set_intersection2(relation_dom(X7),X5)))|X6=relation_dom_restriction(X7,X5))|(~(relation(X7))|~(function(X7))))|(~(relation(X6))|~(function(X6))))&((((~(apply(X6,esk2_3(X5,X6,X7))=apply(X7,esk2_3(X5,X6,X7)))|~(relation_dom(X6)=set_intersection2(relation_dom(X7),X5)))|X6=relation_dom_restriction(X7,X5))|(~(relation(X7))|~(function(X7))))|(~(relation(X6))|~(function(X6)))))),inference(distribute,[status(thm)],[61])).
% cnf(66,plain,(apply(X1,X4)=apply(X2,X4)|~function(X1)|~relation(X1)|~function(X2)|~relation(X2)|X1!=relation_dom_restriction(X2,X3)|~in(X4,relation_dom(X1))),inference(split_conjunct,[status(thm)],[62])).
% fof(158, negated_conjecture,?[X1]:?[X2]:?[X3]:((relation(X3)&function(X3))&(in(X2,relation_dom(relation_dom_restriction(X3,X1)))&~(apply(relation_dom_restriction(X3,X1),X2)=apply(X3,X2)))),inference(fof_nnf,[status(thm)],[38])).
% fof(159, negated_conjecture,?[X4]:?[X5]:?[X6]:((relation(X6)&function(X6))&(in(X5,relation_dom(relation_dom_restriction(X6,X4)))&~(apply(relation_dom_restriction(X6,X4),X5)=apply(X6,X5)))),inference(variable_rename,[status(thm)],[158])).
% fof(160, negated_conjecture,((relation(esk13_0)&function(esk13_0))&(in(esk12_0,relation_dom(relation_dom_restriction(esk13_0,esk11_0)))&~(apply(relation_dom_restriction(esk13_0,esk11_0),esk12_0)=apply(esk13_0,esk12_0)))),inference(skolemize,[status(esa)],[159])).
% cnf(161,negated_conjecture,(apply(relation_dom_restriction(esk13_0,esk11_0),esk12_0)!=apply(esk13_0,esk12_0)),inference(split_conjunct,[status(thm)],[160])).
% cnf(162,negated_conjecture,(in(esk12_0,relation_dom(relation_dom_restriction(esk13_0,esk11_0)))),inference(split_conjunct,[status(thm)],[160])).
% cnf(163,negated_conjecture,(function(esk13_0)),inference(split_conjunct,[status(thm)],[160])).
% cnf(164,negated_conjecture,(relation(esk13_0)),inference(split_conjunct,[status(thm)],[160])).
% cnf(208,negated_conjecture,(apply(relation_dom_restriction(esk13_0,esk11_0),esk12_0)=apply(X1,esk12_0)|relation_dom_restriction(X1,X2)!=relation_dom_restriction(esk13_0,esk11_0)|~function(X1)|~function(relation_dom_restriction(esk13_0,esk11_0))|~relation(X1)|~relation(relation_dom_restriction(esk13_0,esk11_0))),inference(spm,[status(thm)],[66,162,theory(equality)])).
% cnf(298,negated_conjecture,(apply(relation_dom_restriction(esk13_0,esk11_0),esk12_0)=apply(esk13_0,esk12_0)|~function(relation_dom_restriction(esk13_0,esk11_0))|~function(esk13_0)|~relation(relation_dom_restriction(esk13_0,esk11_0))|~relation(esk13_0)),inference(er,[status(thm)],[208,theory(equality)])).
% cnf(299,negated_conjecture,(apply(relation_dom_restriction(esk13_0,esk11_0),esk12_0)=apply(esk13_0,esk12_0)|~function(relation_dom_restriction(esk13_0,esk11_0))|$false|~relation(relation_dom_restriction(esk13_0,esk11_0))|~relation(esk13_0)),inference(rw,[status(thm)],[298,163,theory(equality)])).
% cnf(300,negated_conjecture,(apply(relation_dom_restriction(esk13_0,esk11_0),esk12_0)=apply(esk13_0,esk12_0)|~function(relation_dom_restriction(esk13_0,esk11_0))|$false|~relation(relation_dom_restriction(esk13_0,esk11_0))|$false),inference(rw,[status(thm)],[299,164,theory(equality)])).
% cnf(301,negated_conjecture,(apply(relation_dom_restriction(esk13_0,esk11_0),esk12_0)=apply(esk13_0,esk12_0)|~function(relation_dom_restriction(esk13_0,esk11_0))|~relation(relation_dom_restriction(esk13_0,esk11_0))),inference(cn,[status(thm)],[300,theory(equality)])).
% cnf(302,negated_conjecture,(~function(relation_dom_restriction(esk13_0,esk11_0))|~relation(relation_dom_restriction(esk13_0,esk11_0))),inference(sr,[status(thm)],[301,161,theory(equality)])).
% cnf(304,negated_conjecture,(~relation(relation_dom_restriction(esk13_0,esk11_0))|~function(esk13_0)|~relation(esk13_0)),inference(spm,[status(thm)],[302,56,theory(equality)])).
% cnf(305,negated_conjecture,(~relation(relation_dom_restriction(esk13_0,esk11_0))|$false|~relation(esk13_0)),inference(rw,[status(thm)],[304,163,theory(equality)])).
% cnf(306,negated_conjecture,(~relation(relation_dom_restriction(esk13_0,esk11_0))|$false|$false),inference(rw,[status(thm)],[305,164,theory(equality)])).
% cnf(307,negated_conjecture,(~relation(relation_dom_restriction(esk13_0,esk11_0))),inference(cn,[status(thm)],[306,theory(equality)])).
% cnf(308,negated_conjecture,(~relation(esk13_0)),inference(spm,[status(thm)],[307,48,theory(equality)])).
% cnf(309,negated_conjecture,($false),inference(rw,[status(thm)],[308,164,theory(equality)])).
% cnf(310,negated_conjecture,($false),inference(cn,[status(thm)],[309,theory(equality)])).
% cnf(311,negated_conjecture,($false),310,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 134
% # ...of these trivial                : 4
% # ...subsumed                        : 17
% # ...remaining for further processing: 113
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 1
% # Backward-rewritten                 : 7
% # Generated clauses                  : 92
% # ...of the previous two non-trivial : 72
% # Contextual simplify-reflections    : 9
% # Paramodulations                    : 89
% # Factorizations                     : 0
% # Equation resolutions               : 3
% # Current number of processed clauses: 58
% #    Positive orientable unit clauses: 22
% #    Positive unorientable unit clauses: 1
% #    Negative unit clauses           : 7
% #    Non-unit-clauses                : 28
% # Current number of unprocessed clauses: 34
% # ...number of literals in the above : 185
% # Clause-clause subsumption calls (NU) : 87
% # Rec. Clause-clause subsumption calls : 69
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 17
% # Indexed BW rewrite successes       : 15
% # Backwards rewriting index:    70 leaves,   1.19+/-0.487 terms/leaf
% # Paramod-from index:           36 leaves,   1.08+/-0.363 terms/leaf
% # Paramod-into index:           64 leaves,   1.12+/-0.415 terms/leaf
% # -------------------------------------------------
% # User time              : 0.015 s
% # System time            : 0.006 s
% # Total time             : 0.021 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.18 WC
% FINAL PrfWatch: 0.12 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP1468/SEU223+1.tptp
% 
%------------------------------------------------------------------------------