TSTP Solution File: SEU053+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU053+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 : 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 00:50:34 EST 2010
% Result : Theorem 1.22s
% Output : Solution 1.22s
% 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/SystemOnTPTP25576/SEU053+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP25576/SEU053+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25576/SEU053+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 25708
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:set_intersection2(X1,X1)=X1,file('/tmp/SRASS.s.p', idempotence_k3_xboole_0)).
% fof(8, axiom,![X1]:(relation(X1)=>relation_image(X1,empty_set)=empty_set),file('/tmp/SRASS.s.p', t149_relat_1)).
% fof(15, axiom,![X1]:((relation(X1)&function(X1))=>(one_to_one(X1)<=>![X2]:![X3]:(((in(X2,relation_dom(X1))&in(X3,relation_dom(X1)))&apply(X1,X2)=apply(X1,X3))=>X2=X3))),file('/tmp/SRASS.s.p', d8_funct_1)).
% fof(20, axiom,![X1]:![X2]:(disjoint(X1,X2)<=>set_intersection2(X1,X2)=empty_set),file('/tmp/SRASS.s.p', d7_xboole_0)).
% fof(21, axiom,![X1]:![X2]:((relation(X2)&function(X2))=>(in(X1,relation_dom(X2))=>relation_image(X2,singleton(X1))=singleton(apply(X2,X1)))),file('/tmp/SRASS.s.p', t117_funct_1)).
% fof(23, axiom,(empty(empty_set)&relation(empty_set)),file('/tmp/SRASS.s.p', fc4_relat_1)).
% fof(25, axiom,![X1]:~(empty(singleton(X1))),file('/tmp/SRASS.s.p', fc2_subset_1)).
% fof(29, axiom,![X1]:![X2]:(~(X1=X2)=>disjoint(singleton(X1),singleton(X2))),file('/tmp/SRASS.s.p', t17_zfmisc_1)).
% fof(46, conjecture,![X1]:((relation(X1)&function(X1))=>(![X2]:![X3]:relation_image(X1,set_intersection2(X2,X3))=set_intersection2(relation_image(X1,X2),relation_image(X1,X3))=>one_to_one(X1))),file('/tmp/SRASS.s.p', t122_funct_1)).
% fof(47, negated_conjecture,~(![X1]:((relation(X1)&function(X1))=>(![X2]:![X3]:relation_image(X1,set_intersection2(X2,X3))=set_intersection2(relation_image(X1,X2),relation_image(X1,X3))=>one_to_one(X1)))),inference(assume_negation,[status(cth)],[46])).
% fof(51, plain,![X1]:~(empty(singleton(X1))),inference(fof_simplification,[status(thm)],[25,theory(equality)])).
% fof(63, plain,![X3]:![X4]:set_intersection2(X3,X3)=X3,inference(variable_rename,[status(thm)],[3])).
% cnf(64,plain,(set_intersection2(X1,X1)=X1),inference(split_conjunct,[status(thm)],[63])).
% fof(85, plain,![X1]:(~(relation(X1))|relation_image(X1,empty_set)=empty_set),inference(fof_nnf,[status(thm)],[8])).
% fof(86, plain,![X2]:(~(relation(X2))|relation_image(X2,empty_set)=empty_set),inference(variable_rename,[status(thm)],[85])).
% cnf(87,plain,(relation_image(X1,empty_set)=empty_set|~relation(X1)),inference(split_conjunct,[status(thm)],[86])).
% fof(107, plain,![X1]:((~(relation(X1))|~(function(X1)))|((~(one_to_one(X1))|![X2]:![X3]:(((~(in(X2,relation_dom(X1)))|~(in(X3,relation_dom(X1))))|~(apply(X1,X2)=apply(X1,X3)))|X2=X3))&(?[X2]:?[X3]:(((in(X2,relation_dom(X1))&in(X3,relation_dom(X1)))&apply(X1,X2)=apply(X1,X3))&~(X2=X3))|one_to_one(X1)))),inference(fof_nnf,[status(thm)],[15])).
% fof(108, plain,![X4]:((~(relation(X4))|~(function(X4)))|((~(one_to_one(X4))|![X5]:![X6]:(((~(in(X5,relation_dom(X4)))|~(in(X6,relation_dom(X4))))|~(apply(X4,X5)=apply(X4,X6)))|X5=X6))&(?[X7]:?[X8]:(((in(X7,relation_dom(X4))&in(X8,relation_dom(X4)))&apply(X4,X7)=apply(X4,X8))&~(X7=X8))|one_to_one(X4)))),inference(variable_rename,[status(thm)],[107])).
% fof(109, plain,![X4]:((~(relation(X4))|~(function(X4)))|((~(one_to_one(X4))|![X5]:![X6]:(((~(in(X5,relation_dom(X4)))|~(in(X6,relation_dom(X4))))|~(apply(X4,X5)=apply(X4,X6)))|X5=X6))&((((in(esk6_1(X4),relation_dom(X4))&in(esk7_1(X4),relation_dom(X4)))&apply(X4,esk6_1(X4))=apply(X4,esk7_1(X4)))&~(esk6_1(X4)=esk7_1(X4)))|one_to_one(X4)))),inference(skolemize,[status(esa)],[108])).
% fof(110, plain,![X4]:![X5]:![X6]:((((((~(in(X5,relation_dom(X4)))|~(in(X6,relation_dom(X4))))|~(apply(X4,X5)=apply(X4,X6)))|X5=X6)|~(one_to_one(X4)))&((((in(esk6_1(X4),relation_dom(X4))&in(esk7_1(X4),relation_dom(X4)))&apply(X4,esk6_1(X4))=apply(X4,esk7_1(X4)))&~(esk6_1(X4)=esk7_1(X4)))|one_to_one(X4)))|(~(relation(X4))|~(function(X4)))),inference(shift_quantors,[status(thm)],[109])).
% fof(111, plain,![X4]:![X5]:![X6]:((((((~(in(X5,relation_dom(X4)))|~(in(X6,relation_dom(X4))))|~(apply(X4,X5)=apply(X4,X6)))|X5=X6)|~(one_to_one(X4)))|(~(relation(X4))|~(function(X4))))&(((((in(esk6_1(X4),relation_dom(X4))|one_to_one(X4))|(~(relation(X4))|~(function(X4))))&((in(esk7_1(X4),relation_dom(X4))|one_to_one(X4))|(~(relation(X4))|~(function(X4)))))&((apply(X4,esk6_1(X4))=apply(X4,esk7_1(X4))|one_to_one(X4))|(~(relation(X4))|~(function(X4)))))&((~(esk6_1(X4)=esk7_1(X4))|one_to_one(X4))|(~(relation(X4))|~(function(X4)))))),inference(distribute,[status(thm)],[110])).
% cnf(112,plain,(one_to_one(X1)|~function(X1)|~relation(X1)|esk6_1(X1)!=esk7_1(X1)),inference(split_conjunct,[status(thm)],[111])).
% cnf(113,plain,(one_to_one(X1)|apply(X1,esk6_1(X1))=apply(X1,esk7_1(X1))|~function(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[111])).
% cnf(114,plain,(one_to_one(X1)|in(esk7_1(X1),relation_dom(X1))|~function(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[111])).
% cnf(115,plain,(one_to_one(X1)|in(esk6_1(X1),relation_dom(X1))|~function(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[111])).
% fof(129, plain,![X1]:![X2]:((~(disjoint(X1,X2))|set_intersection2(X1,X2)=empty_set)&(~(set_intersection2(X1,X2)=empty_set)|disjoint(X1,X2))),inference(fof_nnf,[status(thm)],[20])).
% fof(130, plain,![X3]:![X4]:((~(disjoint(X3,X4))|set_intersection2(X3,X4)=empty_set)&(~(set_intersection2(X3,X4)=empty_set)|disjoint(X3,X4))),inference(variable_rename,[status(thm)],[129])).
% cnf(132,plain,(set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2)),inference(split_conjunct,[status(thm)],[130])).
% fof(133, plain,![X1]:![X2]:((~(relation(X2))|~(function(X2)))|(~(in(X1,relation_dom(X2)))|relation_image(X2,singleton(X1))=singleton(apply(X2,X1)))),inference(fof_nnf,[status(thm)],[21])).
% fof(134, plain,![X3]:![X4]:((~(relation(X4))|~(function(X4)))|(~(in(X3,relation_dom(X4)))|relation_image(X4,singleton(X3))=singleton(apply(X4,X3)))),inference(variable_rename,[status(thm)],[133])).
% cnf(135,plain,(relation_image(X1,singleton(X2))=singleton(apply(X1,X2))|~in(X2,relation_dom(X1))|~function(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[134])).
% cnf(141,plain,(empty(empty_set)),inference(split_conjunct,[status(thm)],[23])).
% fof(145, plain,![X2]:~(empty(singleton(X2))),inference(variable_rename,[status(thm)],[51])).
% cnf(146,plain,(~empty(singleton(X1))),inference(split_conjunct,[status(thm)],[145])).
% fof(160, plain,![X1]:![X2]:(X1=X2|disjoint(singleton(X1),singleton(X2))),inference(fof_nnf,[status(thm)],[29])).
% fof(161, plain,![X3]:![X4]:(X3=X4|disjoint(singleton(X3),singleton(X4))),inference(variable_rename,[status(thm)],[160])).
% cnf(162,plain,(disjoint(singleton(X1),singleton(X2))|X1=X2),inference(split_conjunct,[status(thm)],[161])).
% fof(218, negated_conjecture,?[X1]:((relation(X1)&function(X1))&(![X2]:![X3]:relation_image(X1,set_intersection2(X2,X3))=set_intersection2(relation_image(X1,X2),relation_image(X1,X3))&~(one_to_one(X1)))),inference(fof_nnf,[status(thm)],[47])).
% fof(219, negated_conjecture,?[X4]:((relation(X4)&function(X4))&(![X5]:![X6]:relation_image(X4,set_intersection2(X5,X6))=set_intersection2(relation_image(X4,X5),relation_image(X4,X6))&~(one_to_one(X4)))),inference(variable_rename,[status(thm)],[218])).
% fof(220, negated_conjecture,((relation(esk15_0)&function(esk15_0))&(![X5]:![X6]:relation_image(esk15_0,set_intersection2(X5,X6))=set_intersection2(relation_image(esk15_0,X5),relation_image(esk15_0,X6))&~(one_to_one(esk15_0)))),inference(skolemize,[status(esa)],[219])).
% fof(221, negated_conjecture,![X5]:![X6]:((relation_image(esk15_0,set_intersection2(X5,X6))=set_intersection2(relation_image(esk15_0,X5),relation_image(esk15_0,X6))&~(one_to_one(esk15_0)))&(relation(esk15_0)&function(esk15_0))),inference(shift_quantors,[status(thm)],[220])).
% cnf(222,negated_conjecture,(function(esk15_0)),inference(split_conjunct,[status(thm)],[221])).
% cnf(223,negated_conjecture,(relation(esk15_0)),inference(split_conjunct,[status(thm)],[221])).
% cnf(224,negated_conjecture,(~one_to_one(esk15_0)),inference(split_conjunct,[status(thm)],[221])).
% cnf(225,negated_conjecture,(relation_image(esk15_0,set_intersection2(X1,X2))=set_intersection2(relation_image(esk15_0,X1),relation_image(esk15_0,X2))),inference(split_conjunct,[status(thm)],[221])).
% cnf(278,negated_conjecture,(relation_image(esk15_0,empty_set)=empty_set),inference(pm,[status(thm)],[87,223,theory(equality)])).
% cnf(288,negated_conjecture,(one_to_one(esk15_0)|esk7_1(esk15_0)!=esk6_1(esk15_0)|~relation(esk15_0)),inference(pm,[status(thm)],[112,222,theory(equality)])).
% cnf(292,negated_conjecture,(one_to_one(esk15_0)|esk7_1(esk15_0)!=esk6_1(esk15_0)|$false),inference(rw,[status(thm)],[288,223,theory(equality)])).
% cnf(293,negated_conjecture,(one_to_one(esk15_0)|esk7_1(esk15_0)!=esk6_1(esk15_0)),inference(cn,[status(thm)],[292,theory(equality)])).
% cnf(294,negated_conjecture,(esk7_1(esk15_0)!=esk6_1(esk15_0)),inference(sr,[status(thm)],[293,224,theory(equality)])).
% cnf(327,plain,(set_intersection2(singleton(X1),singleton(X2))=empty_set|X1=X2),inference(pm,[status(thm)],[132,162,theory(equality)])).
% cnf(336,negated_conjecture,(in(esk6_1(esk15_0),relation_dom(esk15_0))|one_to_one(esk15_0)|~relation(esk15_0)),inference(pm,[status(thm)],[115,222,theory(equality)])).
% cnf(340,negated_conjecture,(in(esk6_1(esk15_0),relation_dom(esk15_0))|one_to_one(esk15_0)|$false),inference(rw,[status(thm)],[336,223,theory(equality)])).
% cnf(341,negated_conjecture,(in(esk6_1(esk15_0),relation_dom(esk15_0))|one_to_one(esk15_0)),inference(cn,[status(thm)],[340,theory(equality)])).
% cnf(342,negated_conjecture,(in(esk6_1(esk15_0),relation_dom(esk15_0))),inference(sr,[status(thm)],[341,224,theory(equality)])).
% cnf(350,negated_conjecture,(in(esk7_1(esk15_0),relation_dom(esk15_0))|one_to_one(esk15_0)|~relation(esk15_0)),inference(pm,[status(thm)],[114,222,theory(equality)])).
% cnf(354,negated_conjecture,(in(esk7_1(esk15_0),relation_dom(esk15_0))|one_to_one(esk15_0)|$false),inference(rw,[status(thm)],[350,223,theory(equality)])).
% cnf(355,negated_conjecture,(in(esk7_1(esk15_0),relation_dom(esk15_0))|one_to_one(esk15_0)),inference(cn,[status(thm)],[354,theory(equality)])).
% cnf(356,negated_conjecture,(in(esk7_1(esk15_0),relation_dom(esk15_0))),inference(sr,[status(thm)],[355,224,theory(equality)])).
% cnf(371,negated_conjecture,(apply(esk15_0,esk7_1(esk15_0))=apply(esk15_0,esk6_1(esk15_0))|one_to_one(esk15_0)|~relation(esk15_0)),inference(pm,[status(thm)],[113,222,theory(equality)])).
% cnf(375,negated_conjecture,(apply(esk15_0,esk7_1(esk15_0))=apply(esk15_0,esk6_1(esk15_0))|one_to_one(esk15_0)|$false),inference(rw,[status(thm)],[371,223,theory(equality)])).
% cnf(376,negated_conjecture,(apply(esk15_0,esk7_1(esk15_0))=apply(esk15_0,esk6_1(esk15_0))|one_to_one(esk15_0)),inference(cn,[status(thm)],[375,theory(equality)])).
% cnf(377,negated_conjecture,(apply(esk15_0,esk7_1(esk15_0))=apply(esk15_0,esk6_1(esk15_0))),inference(sr,[status(thm)],[376,224,theory(equality)])).
% cnf(418,negated_conjecture,(relation_image(esk15_0,singleton(esk6_1(esk15_0)))=singleton(apply(esk15_0,esk6_1(esk15_0)))|~function(esk15_0)|~relation(esk15_0)),inference(pm,[status(thm)],[135,342,theory(equality)])).
% cnf(420,negated_conjecture,(relation_image(esk15_0,singleton(esk6_1(esk15_0)))=singleton(apply(esk15_0,esk6_1(esk15_0)))|$false|~relation(esk15_0)),inference(rw,[status(thm)],[418,222,theory(equality)])).
% cnf(421,negated_conjecture,(relation_image(esk15_0,singleton(esk6_1(esk15_0)))=singleton(apply(esk15_0,esk6_1(esk15_0)))|$false|$false),inference(rw,[status(thm)],[420,223,theory(equality)])).
% cnf(422,negated_conjecture,(relation_image(esk15_0,singleton(esk6_1(esk15_0)))=singleton(apply(esk15_0,esk6_1(esk15_0)))),inference(cn,[status(thm)],[421,theory(equality)])).
% cnf(578,negated_conjecture,(relation_image(esk15_0,singleton(esk7_1(esk15_0)))=singleton(apply(esk15_0,esk7_1(esk15_0)))|~function(esk15_0)|~relation(esk15_0)),inference(pm,[status(thm)],[135,356,theory(equality)])).
% cnf(580,negated_conjecture,(relation_image(esk15_0,singleton(esk7_1(esk15_0)))=singleton(apply(esk15_0,esk7_1(esk15_0)))|$false|~relation(esk15_0)),inference(rw,[status(thm)],[578,222,theory(equality)])).
% cnf(581,negated_conjecture,(relation_image(esk15_0,singleton(esk7_1(esk15_0)))=singleton(apply(esk15_0,esk7_1(esk15_0)))|$false|$false),inference(rw,[status(thm)],[580,223,theory(equality)])).
% cnf(582,negated_conjecture,(relation_image(esk15_0,singleton(esk7_1(esk15_0)))=singleton(apply(esk15_0,esk7_1(esk15_0)))),inference(cn,[status(thm)],[581,theory(equality)])).
% cnf(710,negated_conjecture,(set_intersection2(singleton(apply(esk15_0,esk6_1(esk15_0))),relation_image(esk15_0,X1))=relation_image(esk15_0,set_intersection2(singleton(esk6_1(esk15_0)),X1))),inference(pm,[status(thm)],[225,422,theory(equality)])).
% cnf(724,negated_conjecture,(relation_image(esk15_0,singleton(esk7_1(esk15_0)))=singleton(apply(esk15_0,esk6_1(esk15_0)))),inference(rw,[status(thm)],[582,377,theory(equality)])).
% cnf(734,negated_conjecture,(set_intersection2(singleton(apply(esk15_0,esk6_1(esk15_0))),singleton(apply(esk15_0,esk6_1(esk15_0))))=relation_image(esk15_0,set_intersection2(singleton(esk6_1(esk15_0)),singleton(esk7_1(esk15_0))))),inference(pm,[status(thm)],[710,724,theory(equality)])).
% cnf(737,negated_conjecture,(singleton(apply(esk15_0,esk6_1(esk15_0)))=relation_image(esk15_0,set_intersection2(singleton(esk6_1(esk15_0)),singleton(esk7_1(esk15_0))))),inference(rw,[status(thm)],[734,64,theory(equality)])).
% cnf(1185,negated_conjecture,(relation_image(esk15_0,empty_set)=singleton(apply(esk15_0,esk6_1(esk15_0)))|esk6_1(esk15_0)=esk7_1(esk15_0)),inference(pm,[status(thm)],[737,327,theory(equality)])).
% cnf(1191,negated_conjecture,(empty_set=singleton(apply(esk15_0,esk6_1(esk15_0)))|esk6_1(esk15_0)=esk7_1(esk15_0)),inference(rw,[status(thm)],[1185,278,theory(equality)])).
% cnf(1192,negated_conjecture,(singleton(apply(esk15_0,esk6_1(esk15_0)))=empty_set),inference(sr,[status(thm)],[1191,294,theory(equality)])).
% cnf(1194,negated_conjecture,(~empty(empty_set)),inference(pm,[status(thm)],[146,1192,theory(equality)])).
% cnf(1221,negated_conjecture,($false),inference(rw,[status(thm)],[1194,141,theory(equality)])).
% cnf(1222,negated_conjecture,($false),inference(cn,[status(thm)],[1221,theory(equality)])).
% cnf(1223,negated_conjecture,($false),1222,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 252
% # ...of these trivial : 23
% # ...subsumed : 40
% # ...remaining for further processing: 189
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 21
% # Generated clauses : 704
% # ...of the previous two non-trivial : 609
% # Contextual simplify-reflections : 0
% # Paramodulations : 696
% # Factorizations : 0
% # Equation resolutions : 5
% # Current number of processed clauses: 167
% # Positive orientable unit clauses: 69
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 13
% # Non-unit-clauses : 84
% # Current number of unprocessed clauses: 366
% # ...number of literals in the above : 435
% # Clause-clause subsumption calls (NU) : 177
% # Rec. Clause-clause subsumption calls : 168
% # Unit Clause-clause subsumption calls : 105
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 24
% # Indexed BW rewrite successes : 14
% # Backwards rewriting index: 188 leaves, 1.22+/-0.832 terms/leaf
% # Paramod-from index: 77 leaves, 1.06+/-0.294 terms/leaf
% # Paramod-into index: 149 leaves, 1.14+/-0.402 terms/leaf
% # -------------------------------------------------
% # User time : 0.032 s
% # System time : 0.005 s
% # Total time : 0.037 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.21 WC
% FINAL PrfWatch: 0.15 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP25576/SEU053+1.tptp
%
%------------------------------------------------------------------------------