%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU008+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art05.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 00:35:14 EST 2010
% Result : Theorem 0.97s
% Output : Solution 0.97s
% 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/SystemOnTPTP11011/SEU008+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11011/SEU008+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11011/SEU008+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 11107
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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]:set_intersection2(X1,X2)=set_intersection2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k3_xboole_0)).
% fof(3, axiom,![X1]:![X2]:![X3]:(X3=set_intersection2(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)&in(X4,X2)))),file('/tmp/SRASS.s.p', d3_xboole_0)).
% fof(5, axiom,![X1]:relation(identity_relation(X1)),file('/tmp/SRASS.s.p', dt_k6_relat_1)).
% fof(8, axiom,![X1]:(relation(identity_relation(X1))&function(identity_relation(X1))),file('/tmp/SRASS.s.p', fc2_funct_1)).
% fof(11, axiom,![X1]:![X2]:((relation(X2)&function(X2))=>![X3]:((relation(X3)&function(X3))=>(in(X1,relation_dom(X2))=>apply(relation_composition(X2,X3),X1)=apply(X3,apply(X2,X1))))),file('/tmp/SRASS.s.p', t23_funct_1)).
% fof(12, axiom,![X1]:![X2]:((relation(X2)&function(X2))=>(X2=identity_relation(X1)<=>(relation_dom(X2)=X1&![X3]:(in(X3,X1)=>apply(X2,X3)=X3)))),file('/tmp/SRASS.s.p', t34_funct_1)).
% fof(41, conjecture,![X1]:![X2]:![X3]:((relation(X3)&function(X3))=>(in(X2,set_intersection2(relation_dom(X3),X1))=>apply(X3,X2)=apply(relation_composition(identity_relation(X1),X3),X2))),file('/tmp/SRASS.s.p', t38_funct_1)).
% fof(42, negated_conjecture,~(![X1]:![X2]:![X3]:((relation(X3)&function(X3))=>(in(X2,set_intersection2(relation_dom(X3),X1))=>apply(X3,X2)=apply(relation_composition(identity_relation(X1),X3),X2)))),inference(assume_negation,[status(cth)],[41])).
% fof(52, plain,![X3]:![X4]:set_intersection2(X3,X4)=set_intersection2(X4,X3),inference(variable_rename,[status(thm)],[2])).
% cnf(53,plain,(set_intersection2(X1,X2)=set_intersection2(X2,X1)),inference(split_conjunct,[status(thm)],[52])).
% fof(54, plain,![X1]:![X2]:![X3]:((~(X3=set_intersection2(X1,X2))|![X4]:((~(in(X4,X3))|(in(X4,X1)&in(X4,X2)))&((~(in(X4,X1))|~(in(X4,X2)))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(~(in(X4,X1))|~(in(X4,X2))))&(in(X4,X3)|(in(X4,X1)&in(X4,X2))))|X3=set_intersection2(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(55, plain,![X5]:![X6]:![X7]:((~(X7=set_intersection2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&in(X8,X6)))&((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(~(in(X9,X5))|~(in(X9,X6))))&(in(X9,X7)|(in(X9,X5)&in(X9,X6))))|X7=set_intersection2(X5,X6))),inference(variable_rename,[status(thm)],[54])).
% fof(56, plain,![X5]:![X6]:![X7]:((~(X7=set_intersection2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&in(X8,X6)))&((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7))))&(((~(in(esk1_3(X5,X6,X7),X7))|(~(in(esk1_3(X5,X6,X7),X5))|~(in(esk1_3(X5,X6,X7),X6))))&(in(esk1_3(X5,X6,X7),X7)|(in(esk1_3(X5,X6,X7),X5)&in(esk1_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))),inference(skolemize,[status(esa)],[55])).
% fof(57, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(in(X8,X5)&in(X8,X6)))&((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7)))|~(X7=set_intersection2(X5,X6)))&(((~(in(esk1_3(X5,X6,X7),X7))|(~(in(esk1_3(X5,X6,X7),X5))|~(in(esk1_3(X5,X6,X7),X6))))&(in(esk1_3(X5,X6,X7),X7)|(in(esk1_3(X5,X6,X7),X5)&in(esk1_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))),inference(shift_quantors,[status(thm)],[56])).
% fof(58, plain,![X5]:![X6]:![X7]:![X8]:(((((in(X8,X5)|~(in(X8,X7)))|~(X7=set_intersection2(X5,X6)))&((in(X8,X6)|~(in(X8,X7)))|~(X7=set_intersection2(X5,X6))))&(((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7))|~(X7=set_intersection2(X5,X6))))&(((~(in(esk1_3(X5,X6,X7),X7))|(~(in(esk1_3(X5,X6,X7),X5))|~(in(esk1_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))&(((in(esk1_3(X5,X6,X7),X5)|in(esk1_3(X5,X6,X7),X7))|X7=set_intersection2(X5,X6))&((in(esk1_3(X5,X6,X7),X6)|in(esk1_3(X5,X6,X7),X7))|X7=set_intersection2(X5,X6))))),inference(distribute,[status(thm)],[57])).
% cnf(64,plain,(in(X4,X2)|X1!=set_intersection2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[58])).
% fof(68, plain,![X2]:relation(identity_relation(X2)),inference(variable_rename,[status(thm)],[5])).
% cnf(69,plain,(relation(identity_relation(X1))),inference(split_conjunct,[status(thm)],[68])).
% fof(78, plain,![X2]:(relation(identity_relation(X2))&function(identity_relation(X2))),inference(variable_rename,[status(thm)],[8])).
% cnf(79,plain,(function(identity_relation(X1))),inference(split_conjunct,[status(thm)],[78])).
% fof(87, plain,![X1]:![X2]:((~(relation(X2))|~(function(X2)))|![X3]:((~(relation(X3))|~(function(X3)))|(~(in(X1,relation_dom(X2)))|apply(relation_composition(X2,X3),X1)=apply(X3,apply(X2,X1))))),inference(fof_nnf,[status(thm)],[11])).
% fof(88, plain,![X4]:![X5]:((~(relation(X5))|~(function(X5)))|![X6]:((~(relation(X6))|~(function(X6)))|(~(in(X4,relation_dom(X5)))|apply(relation_composition(X5,X6),X4)=apply(X6,apply(X5,X4))))),inference(variable_rename,[status(thm)],[87])).
% fof(89, plain,![X4]:![X5]:![X6]:(((~(relation(X6))|~(function(X6)))|(~(in(X4,relation_dom(X5)))|apply(relation_composition(X5,X6),X4)=apply(X6,apply(X5,X4))))|(~(relation(X5))|~(function(X5)))),inference(shift_quantors,[status(thm)],[88])).
% cnf(90,plain,(apply(relation_composition(X1,X2),X3)=apply(X2,apply(X1,X3))|~function(X1)|~relation(X1)|~in(X3,relation_dom(X1))|~function(X2)|~relation(X2)),inference(split_conjunct,[status(thm)],[89])).
% fof(91, plain,![X1]:![X2]:((~(relation(X2))|~(function(X2)))|((~(X2=identity_relation(X1))|(relation_dom(X2)=X1&![X3]:(~(in(X3,X1))|apply(X2,X3)=X3)))&((~(relation_dom(X2)=X1)|?[X3]:(in(X3,X1)&~(apply(X2,X3)=X3)))|X2=identity_relation(X1)))),inference(fof_nnf,[status(thm)],[12])).
% fof(92, plain,![X4]:![X5]:((~(relation(X5))|~(function(X5)))|((~(X5=identity_relation(X4))|(relation_dom(X5)=X4&![X6]:(~(in(X6,X4))|apply(X5,X6)=X6)))&((~(relation_dom(X5)=X4)|?[X7]:(in(X7,X4)&~(apply(X5,X7)=X7)))|X5=identity_relation(X4)))),inference(variable_rename,[status(thm)],[91])).
% fof(93, plain,![X4]:![X5]:((~(relation(X5))|~(function(X5)))|((~(X5=identity_relation(X4))|(relation_dom(X5)=X4&![X6]:(~(in(X6,X4))|apply(X5,X6)=X6)))&((~(relation_dom(X5)=X4)|(in(esk3_2(X4,X5),X4)&~(apply(X5,esk3_2(X4,X5))=esk3_2(X4,X5))))|X5=identity_relation(X4)))),inference(skolemize,[status(esa)],[92])).
% fof(94, plain,![X4]:![X5]:![X6]:(((((~(in(X6,X4))|apply(X5,X6)=X6)&relation_dom(X5)=X4)|~(X5=identity_relation(X4)))&((~(relation_dom(X5)=X4)|(in(esk3_2(X4,X5),X4)&~(apply(X5,esk3_2(X4,X5))=esk3_2(X4,X5))))|X5=identity_relation(X4)))|(~(relation(X5))|~(function(X5)))),inference(shift_quantors,[status(thm)],[93])).
% fof(95, plain,![X4]:![X5]:![X6]:(((((~(in(X6,X4))|apply(X5,X6)=X6)|~(X5=identity_relation(X4)))|(~(relation(X5))|~(function(X5))))&((relation_dom(X5)=X4|~(X5=identity_relation(X4)))|(~(relation(X5))|~(function(X5)))))&((((in(esk3_2(X4,X5),X4)|~(relation_dom(X5)=X4))|X5=identity_relation(X4))|(~(relation(X5))|~(function(X5))))&(((~(apply(X5,esk3_2(X4,X5))=esk3_2(X4,X5))|~(relation_dom(X5)=X4))|X5=identity_relation(X4))|(~(relation(X5))|~(function(X5)))))),inference(distribute,[status(thm)],[94])).
% cnf(98,plain,(relation_dom(X1)=X2|~function(X1)|~relation(X1)|X1!=identity_relation(X2)),inference(split_conjunct,[status(thm)],[95])).
% cnf(99,plain,(apply(X1,X3)=X3|~function(X1)|~relation(X1)|X1!=identity_relation(X2)|~in(X3,X2)),inference(split_conjunct,[status(thm)],[95])).
% fof(192, negated_conjecture,?[X1]:?[X2]:?[X3]:((relation(X3)&function(X3))&(in(X2,set_intersection2(relation_dom(X3),X1))&~(apply(X3,X2)=apply(relation_composition(identity_relation(X1),X3),X2)))),inference(fof_nnf,[status(thm)],[42])).
% fof(193, negated_conjecture,?[X4]:?[X5]:?[X6]:((relation(X6)&function(X6))&(in(X5,set_intersection2(relation_dom(X6),X4))&~(apply(X6,X5)=apply(relation_composition(identity_relation(X4),X6),X5)))),inference(variable_rename,[status(thm)],[192])).
% fof(194, negated_conjecture,((relation(esk14_0)&function(esk14_0))&(in(esk13_0,set_intersection2(relation_dom(esk14_0),esk12_0))&~(apply(esk14_0,esk13_0)=apply(relation_composition(identity_relation(esk12_0),esk14_0),esk13_0)))),inference(skolemize,[status(esa)],[193])).
% cnf(195,negated_conjecture,(apply(esk14_0,esk13_0)!=apply(relation_composition(identity_relation(esk12_0),esk14_0),esk13_0)),inference(split_conjunct,[status(thm)],[194])).
% cnf(196,negated_conjecture,(in(esk13_0,set_intersection2(relation_dom(esk14_0),esk12_0))),inference(split_conjunct,[status(thm)],[194])).
% cnf(197,negated_conjecture,(function(esk14_0)),inference(split_conjunct,[status(thm)],[194])).
% cnf(198,negated_conjecture,(relation(esk14_0)),inference(split_conjunct,[status(thm)],[194])).
% cnf(203,negated_conjecture,(in(esk13_0,set_intersection2(esk12_0,relation_dom(esk14_0)))),inference(rw,[status(thm)],[196,53,theory(equality)])).
% cnf(232,plain,(relation_dom(identity_relation(X1))=X1|~function(identity_relation(X1))|~relation(identity_relation(X1))),inference(er,[status(thm)],[98,theory(equality)])).
% cnf(233,plain,(relation_dom(identity_relation(X1))=X1|$false|~relation(identity_relation(X1))),inference(rw,[status(thm)],[232,79,theory(equality)])).
% cnf(234,plain,(relation_dom(identity_relation(X1))=X1|$false|$false),inference(rw,[status(thm)],[233,69,theory(equality)])).
% cnf(235,plain,(relation_dom(identity_relation(X1))=X1),inference(cn,[status(thm)],[234,theory(equality)])).
% cnf(249,plain,(in(X1,X2)|~in(X1,set_intersection2(X2,X3))),inference(er,[status(thm)],[64,theory(equality)])).
% cnf(280,negated_conjecture,(apply(esk14_0,apply(identity_relation(esk12_0),esk13_0))!=apply(esk14_0,esk13_0)|~function(esk14_0)|~function(identity_relation(esk12_0))|~relation(esk14_0)|~relation(identity_relation(esk12_0))|~in(esk13_0,relation_dom(identity_relation(esk12_0)))),inference(spm,[status(thm)],[195,90,theory(equality)])).
% cnf(281,negated_conjecture,(apply(esk14_0,apply(identity_relation(esk12_0),esk13_0))!=apply(esk14_0,esk13_0)|$false|~function(identity_relation(esk12_0))|~relation(esk14_0)|~relation(identity_relation(esk12_0))|~in(esk13_0,relation_dom(identity_relation(esk12_0)))),inference(rw,[status(thm)],[280,197,theory(equality)])).
% cnf(282,negated_conjecture,(apply(esk14_0,apply(identity_relation(esk12_0),esk13_0))!=apply(esk14_0,esk13_0)|$false|$false|~relation(esk14_0)|~relation(identity_relation(esk12_0))|~in(esk13_0,relation_dom(identity_relation(esk12_0)))),inference(rw,[status(thm)],[281,79,theory(equality)])).
% cnf(283,negated_conjecture,(apply(esk14_0,apply(identity_relation(esk12_0),esk13_0))!=apply(esk14_0,esk13_0)|$false|$false|$false|~relation(identity_relation(esk12_0))|~in(esk13_0,relation_dom(identity_relation(esk12_0)))),inference(rw,[status(thm)],[282,198,theory(equality)])).
% cnf(284,negated_conjecture,(apply(esk14_0,apply(identity_relation(esk12_0),esk13_0))!=apply(esk14_0,esk13_0)|$false|$false|$false|$false|~in(esk13_0,relation_dom(identity_relation(esk12_0)))),inference(rw,[status(thm)],[283,69,theory(equality)])).
% cnf(285,negated_conjecture,(apply(esk14_0,apply(identity_relation(esk12_0),esk13_0))!=apply(esk14_0,esk13_0)|~in(esk13_0,relation_dom(identity_relation(esk12_0)))),inference(cn,[status(thm)],[284,theory(equality)])).
% cnf(437,negated_conjecture,(in(esk13_0,esk12_0)),inference(spm,[status(thm)],[249,203,theory(equality)])).
% cnf(448,negated_conjecture,(apply(X1,esk13_0)=esk13_0|identity_relation(esk12_0)!=X1|~function(X1)|~relation(X1)),inference(spm,[status(thm)],[99,437,theory(equality)])).
% cnf(474,negated_conjecture,(apply(esk14_0,apply(identity_relation(esk12_0),esk13_0))!=apply(esk14_0,esk13_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[285,235,theory(equality)]),437,theory(equality)])).
% cnf(475,negated_conjecture,(apply(esk14_0,apply(identity_relation(esk12_0),esk13_0))!=apply(esk14_0,esk13_0)),inference(cn,[status(thm)],[474,theory(equality)])).
% cnf(734,negated_conjecture,(~function(identity_relation(esk12_0))|~relation(identity_relation(esk12_0))),inference(spm,[status(thm)],[475,448,theory(equality)])).
% cnf(740,negated_conjecture,($false|~relation(identity_relation(esk12_0))),inference(rw,[status(thm)],[734,79,theory(equality)])).
% cnf(741,negated_conjecture,($false|$false),inference(rw,[status(thm)],[740,69,theory(equality)])).
% cnf(742,negated_conjecture,($false),inference(cn,[status(thm)],[741,theory(equality)])).
% cnf(743,negated_conjecture,($false),742,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 259
% # ...of these trivial : 6
% # ...subsumed : 58
% # ...remaining for further processing: 195
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 10
% # Generated clauses : 358
% # ...of the previous two non-trivial : 285
% # Contextual simplify-reflections : 6
% # Paramodulations : 344
% # Factorizations : 4
% # Equation resolutions : 7
% # Current number of processed clauses: 122
% # Positive orientable unit clauses: 34
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 21
% # Non-unit-clauses : 66
% # Current number of unprocessed clauses: 143
% # ...number of literals in the above : 520
% # Clause-clause subsumption calls (NU) : 293
% # Rec. Clause-clause subsumption calls : 269
% # Unit Clause-clause subsumption calls : 116
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 16
% # Indexed BW rewrite successes : 15
% # Backwards rewriting index: 102 leaves, 1.26+/-0.816 terms/leaf
% # Paramod-from index: 54 leaves, 1.09+/-0.398 terms/leaf
% # Paramod-into index: 94 leaves, 1.16+/-0.624 terms/leaf
% # -------------------------------------------------
% # User time : 0.031 s
% # System time : 0.004 s
% # Total time : 0.035 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.21 WC
% FINAL PrfWatch: 0.13 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP11011/SEU008+1.tptp
%
%------------------------------------------------------------------------------