TSTP Solution File: SEU223+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU223+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 : art07.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 02:01:37 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% 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/SystemOnTPTP19679/SEU223+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19679/SEU223+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19679/SEU223+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 19775
% 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]:![X2]:(relation(X1)=>relation(relation_dom_restriction(X1,X2))),file('/tmp/SRASS.s.p', dt_k7_relat_1)).
% fof(3, 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(39, 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(40, 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)],[39])).
% fof(50, plain,![X1]:![X2]:(~(relation(X1))|relation(relation_dom_restriction(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(51, plain,![X3]:![X4]:(~(relation(X3))|relation(relation_dom_restriction(X3,X4))),inference(variable_rename,[status(thm)],[50])).
% cnf(52,plain,(relation(relation_dom_restriction(X1,X2))|~relation(X1)),inference(split_conjunct,[status(thm)],[51])).
% 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)],[3])).
% 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(62, 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(63, 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)],[62])).
% fof(64, 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)],[63])).
% fof(65, 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)],[64])).
% fof(66, 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)],[65])).
% cnf(70,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)],[66])).
% fof(181, 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)],[40])).
% fof(182, 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)],[181])).
% fof(183, negated_conjecture,((relation(esk15_0)&function(esk15_0))&(in(esk14_0,relation_dom(relation_dom_restriction(esk15_0,esk13_0)))&~(apply(relation_dom_restriction(esk15_0,esk13_0),esk14_0)=apply(esk15_0,esk14_0)))),inference(skolemize,[status(esa)],[182])).
% cnf(184,negated_conjecture,(apply(relation_dom_restriction(esk15_0,esk13_0),esk14_0)!=apply(esk15_0,esk14_0)),inference(split_conjunct,[status(thm)],[183])).
% cnf(185,negated_conjecture,(in(esk14_0,relation_dom(relation_dom_restriction(esk15_0,esk13_0)))),inference(split_conjunct,[status(thm)],[183])).
% cnf(186,negated_conjecture,(function(esk15_0)),inference(split_conjunct,[status(thm)],[183])).
% cnf(187,negated_conjecture,(relation(esk15_0)),inference(split_conjunct,[status(thm)],[183])).
% cnf(248,plain,(apply(relation_dom_restriction(X1,X2),X3)=apply(X1,X3)|~function(X1)|~function(relation_dom_restriction(X1,X2))|~relation(X1)|~relation(relation_dom_restriction(X1,X2))|~in(X3,relation_dom(relation_dom_restriction(X1,X2)))),inference(er,[status(thm)],[70,theory(equality)])).
% cnf(504,plain,(apply(relation_dom_restriction(X1,X2),X3)=apply(X1,X3)|~function(relation_dom_restriction(X1,X2))|~function(X1)|~relation(X1)|~in(X3,relation_dom(relation_dom_restriction(X1,X2)))),inference(csr,[status(thm)],[248,52])).
% cnf(505,plain,(apply(relation_dom_restriction(X1,X2),X3)=apply(X1,X3)|~function(X1)|~relation(X1)|~in(X3,relation_dom(relation_dom_restriction(X1,X2)))),inference(csr,[status(thm)],[504,56])).
% cnf(508,negated_conjecture,(~function(esk15_0)|~relation(esk15_0)|~in(esk14_0,relation_dom(relation_dom_restriction(esk15_0,esk13_0)))),inference(spm,[status(thm)],[184,505,theory(equality)])).
% cnf(509,negated_conjecture,($false|~relation(esk15_0)|~in(esk14_0,relation_dom(relation_dom_restriction(esk15_0,esk13_0)))),inference(rw,[status(thm)],[508,186,theory(equality)])).
% cnf(510,negated_conjecture,($false|$false|~in(esk14_0,relation_dom(relation_dom_restriction(esk15_0,esk13_0)))),inference(rw,[status(thm)],[509,187,theory(equality)])).
% cnf(511,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[510,185,theory(equality)])).
% cnf(512,negated_conjecture,($false),inference(cn,[status(thm)],[511,theory(equality)])).
% cnf(513,negated_conjecture,($false),512,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 220
% # ...of these trivial : 4
% # ...subsumed : 57
% # ...remaining for further processing: 159
% # Other redundant clauses eliminated : 6
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 12
% # Generated clauses : 219
% # ...of the previous two non-trivial : 168
% # Contextual simplify-reflections : 37
% # Paramodulations : 207
% # Factorizations : 0
% # Equation resolutions : 9
% # Current number of processed clauses: 89
% # Positive orientable unit clauses: 29
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 10
% # Non-unit-clauses : 49
% # Current number of unprocessed clauses: 59
% # ...number of literals in the above : 330
% # Clause-clause subsumption calls (NU) : 322
% # Rec. Clause-clause subsumption calls : 280
% # Unit Clause-clause subsumption calls : 71
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 19
% # Indexed BW rewrite successes : 17
% # Backwards rewriting index: 95 leaves, 1.24+/-0.593 terms/leaf
% # Paramod-from index: 51 leaves, 1.06+/-0.308 terms/leaf
% # Paramod-into index: 86 leaves, 1.17+/-0.462 terms/leaf
% # -------------------------------------------------
% # User time : 0.025 s
% # System time : 0.005 s
% # Total time : 0.030 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP19679/SEU223+3.tptp
%
%------------------------------------------------------------------------------