TSTP Solution File: SEU193+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU193+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 : art01.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:39:04 EST 2010
% Result : Theorem 1.37s
% Output : Solution 1.37s
% 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/SystemOnTPTP28487/SEU193+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28487/SEU193+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28487/SEU193+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 28583
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(relation(X1)=>relation(relation_dom_restriction(X1,X2))),file('/tmp/SRASS.s.p', dt_k7_relat_1)).
% fof(6, axiom,![X1]:(relation(X1)=>![X2]:(relation(X2)=>(subset(X1,X2)<=>![X3]:![X4]:(in(ordered_pair(X3,X4),X1)=>in(ordered_pair(X3,X4),X2))))),file('/tmp/SRASS.s.p', d3_relat_1)).
% fof(10, axiom,![X1]:(relation(X1)=>![X2]:![X3]:(relation(X3)=>(X3=relation_dom_restriction(X1,X2)<=>![X4]:![X5]:(in(ordered_pair(X4,X5),X3)<=>(in(X4,X2)&in(ordered_pair(X4,X5),X1)))))),file('/tmp/SRASS.s.p', d11_relat_1)).
% fof(21, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(22, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(36, conjecture,![X1]:![X2]:(relation(X2)=>subset(relation_dom_restriction(X2,X1),X2)),file('/tmp/SRASS.s.p', t88_relat_1)).
% fof(37, negated_conjecture,~(![X1]:![X2]:(relation(X2)=>subset(relation_dom_restriction(X2,X1),X2))),inference(assume_negation,[status(cth)],[36])).
% fof(46, plain,![X1]:![X2]:(~(relation(X1))|relation(relation_dom_restriction(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% 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(62, plain,![X1]:(~(relation(X1))|![X2]:(~(relation(X2))|((~(subset(X1,X2))|![X3]:![X4]:(~(in(ordered_pair(X3,X4),X1))|in(ordered_pair(X3,X4),X2)))&(?[X3]:?[X4]:(in(ordered_pair(X3,X4),X1)&~(in(ordered_pair(X3,X4),X2)))|subset(X1,X2))))),inference(fof_nnf,[status(thm)],[6])).
% fof(63, plain,![X5]:(~(relation(X5))|![X6]:(~(relation(X6))|((~(subset(X5,X6))|![X7]:![X8]:(~(in(ordered_pair(X7,X8),X5))|in(ordered_pair(X7,X8),X6)))&(?[X9]:?[X10]:(in(ordered_pair(X9,X10),X5)&~(in(ordered_pair(X9,X10),X6)))|subset(X5,X6))))),inference(variable_rename,[status(thm)],[62])).
% fof(64, plain,![X5]:(~(relation(X5))|![X6]:(~(relation(X6))|((~(subset(X5,X6))|![X7]:![X8]:(~(in(ordered_pair(X7,X8),X5))|in(ordered_pair(X7,X8),X6)))&((in(ordered_pair(esk3_2(X5,X6),esk4_2(X5,X6)),X5)&~(in(ordered_pair(esk3_2(X5,X6),esk4_2(X5,X6)),X6)))|subset(X5,X6))))),inference(skolemize,[status(esa)],[63])).
% fof(65, plain,![X5]:![X6]:![X7]:![X8]:(((((~(in(ordered_pair(X7,X8),X5))|in(ordered_pair(X7,X8),X6))|~(subset(X5,X6)))&((in(ordered_pair(esk3_2(X5,X6),esk4_2(X5,X6)),X5)&~(in(ordered_pair(esk3_2(X5,X6),esk4_2(X5,X6)),X6)))|subset(X5,X6)))|~(relation(X6)))|~(relation(X5))),inference(shift_quantors,[status(thm)],[64])).
% fof(66, plain,![X5]:![X6]:![X7]:![X8]:(((((~(in(ordered_pair(X7,X8),X5))|in(ordered_pair(X7,X8),X6))|~(subset(X5,X6)))|~(relation(X6)))|~(relation(X5)))&((((in(ordered_pair(esk3_2(X5,X6),esk4_2(X5,X6)),X5)|subset(X5,X6))|~(relation(X6)))|~(relation(X5)))&(((~(in(ordered_pair(esk3_2(X5,X6),esk4_2(X5,X6)),X6))|subset(X5,X6))|~(relation(X6)))|~(relation(X5))))),inference(distribute,[status(thm)],[65])).
% cnf(67,plain,(subset(X1,X2)|~relation(X1)|~relation(X2)|~in(ordered_pair(esk3_2(X1,X2),esk4_2(X1,X2)),X2)),inference(split_conjunct,[status(thm)],[66])).
% cnf(68,plain,(subset(X1,X2)|in(ordered_pair(esk3_2(X1,X2),esk4_2(X1,X2)),X1)|~relation(X1)|~relation(X2)),inference(split_conjunct,[status(thm)],[66])).
% fof(79, plain,![X1]:(~(relation(X1))|![X2]:![X3]:(~(relation(X3))|((~(X3=relation_dom_restriction(X1,X2))|![X4]:![X5]:((~(in(ordered_pair(X4,X5),X3))|(in(X4,X2)&in(ordered_pair(X4,X5),X1)))&((~(in(X4,X2))|~(in(ordered_pair(X4,X5),X1)))|in(ordered_pair(X4,X5),X3))))&(?[X4]:?[X5]:((~(in(ordered_pair(X4,X5),X3))|(~(in(X4,X2))|~(in(ordered_pair(X4,X5),X1))))&(in(ordered_pair(X4,X5),X3)|(in(X4,X2)&in(ordered_pair(X4,X5),X1))))|X3=relation_dom_restriction(X1,X2))))),inference(fof_nnf,[status(thm)],[10])).
% fof(80, plain,![X6]:(~(relation(X6))|![X7]:![X8]:(~(relation(X8))|((~(X8=relation_dom_restriction(X6,X7))|![X9]:![X10]:((~(in(ordered_pair(X9,X10),X8))|(in(X9,X7)&in(ordered_pair(X9,X10),X6)))&((~(in(X9,X7))|~(in(ordered_pair(X9,X10),X6)))|in(ordered_pair(X9,X10),X8))))&(?[X11]:?[X12]:((~(in(ordered_pair(X11,X12),X8))|(~(in(X11,X7))|~(in(ordered_pair(X11,X12),X6))))&(in(ordered_pair(X11,X12),X8)|(in(X11,X7)&in(ordered_pair(X11,X12),X6))))|X8=relation_dom_restriction(X6,X7))))),inference(variable_rename,[status(thm)],[79])).
% fof(81, plain,![X6]:(~(relation(X6))|![X7]:![X8]:(~(relation(X8))|((~(X8=relation_dom_restriction(X6,X7))|![X9]:![X10]:((~(in(ordered_pair(X9,X10),X8))|(in(X9,X7)&in(ordered_pair(X9,X10),X6)))&((~(in(X9,X7))|~(in(ordered_pair(X9,X10),X6)))|in(ordered_pair(X9,X10),X8))))&(((~(in(ordered_pair(esk7_3(X6,X7,X8),esk8_3(X6,X7,X8)),X8))|(~(in(esk7_3(X6,X7,X8),X7))|~(in(ordered_pair(esk7_3(X6,X7,X8),esk8_3(X6,X7,X8)),X6))))&(in(ordered_pair(esk7_3(X6,X7,X8),esk8_3(X6,X7,X8)),X8)|(in(esk7_3(X6,X7,X8),X7)&in(ordered_pair(esk7_3(X6,X7,X8),esk8_3(X6,X7,X8)),X6))))|X8=relation_dom_restriction(X6,X7))))),inference(skolemize,[status(esa)],[80])).
% fof(82, plain,![X6]:![X7]:![X8]:![X9]:![X10]:((((((~(in(ordered_pair(X9,X10),X8))|(in(X9,X7)&in(ordered_pair(X9,X10),X6)))&((~(in(X9,X7))|~(in(ordered_pair(X9,X10),X6)))|in(ordered_pair(X9,X10),X8)))|~(X8=relation_dom_restriction(X6,X7)))&(((~(in(ordered_pair(esk7_3(X6,X7,X8),esk8_3(X6,X7,X8)),X8))|(~(in(esk7_3(X6,X7,X8),X7))|~(in(ordered_pair(esk7_3(X6,X7,X8),esk8_3(X6,X7,X8)),X6))))&(in(ordered_pair(esk7_3(X6,X7,X8),esk8_3(X6,X7,X8)),X8)|(in(esk7_3(X6,X7,X8),X7)&in(ordered_pair(esk7_3(X6,X7,X8),esk8_3(X6,X7,X8)),X6))))|X8=relation_dom_restriction(X6,X7)))|~(relation(X8)))|~(relation(X6))),inference(shift_quantors,[status(thm)],[81])).
% fof(83, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((((((in(X9,X7)|~(in(ordered_pair(X9,X10),X8)))|~(X8=relation_dom_restriction(X6,X7)))|~(relation(X8)))|~(relation(X6)))&((((in(ordered_pair(X9,X10),X6)|~(in(ordered_pair(X9,X10),X8)))|~(X8=relation_dom_restriction(X6,X7)))|~(relation(X8)))|~(relation(X6))))&(((((~(in(X9,X7))|~(in(ordered_pair(X9,X10),X6)))|in(ordered_pair(X9,X10),X8))|~(X8=relation_dom_restriction(X6,X7)))|~(relation(X8)))|~(relation(X6))))&(((((~(in(ordered_pair(esk7_3(X6,X7,X8),esk8_3(X6,X7,X8)),X8))|(~(in(esk7_3(X6,X7,X8),X7))|~(in(ordered_pair(esk7_3(X6,X7,X8),esk8_3(X6,X7,X8)),X6))))|X8=relation_dom_restriction(X6,X7))|~(relation(X8)))|~(relation(X6)))&(((((in(esk7_3(X6,X7,X8),X7)|in(ordered_pair(esk7_3(X6,X7,X8),esk8_3(X6,X7,X8)),X8))|X8=relation_dom_restriction(X6,X7))|~(relation(X8)))|~(relation(X6)))&((((in(ordered_pair(esk7_3(X6,X7,X8),esk8_3(X6,X7,X8)),X6)|in(ordered_pair(esk7_3(X6,X7,X8),esk8_3(X6,X7,X8)),X8))|X8=relation_dom_restriction(X6,X7))|~(relation(X8)))|~(relation(X6)))))),inference(distribute,[status(thm)],[82])).
% cnf(88,plain,(in(ordered_pair(X4,X5),X1)|~relation(X1)|~relation(X2)|X2!=relation_dom_restriction(X1,X3)|~in(ordered_pair(X4,X5),X2)),inference(split_conjunct,[status(thm)],[83])).
% fof(121, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[21])).
% cnf(122,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[121])).
% fof(123, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[22])).
% cnf(124,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[123])).
% fof(149, negated_conjecture,?[X1]:?[X2]:(relation(X2)&~(subset(relation_dom_restriction(X2,X1),X2))),inference(fof_nnf,[status(thm)],[37])).
% fof(150, negated_conjecture,?[X3]:?[X4]:(relation(X4)&~(subset(relation_dom_restriction(X4,X3),X4))),inference(variable_rename,[status(thm)],[149])).
% fof(151, negated_conjecture,(relation(esk13_0)&~(subset(relation_dom_restriction(esk13_0,esk12_0),esk13_0))),inference(skolemize,[status(esa)],[150])).
% cnf(152,negated_conjecture,(~subset(relation_dom_restriction(esk13_0,esk12_0),esk13_0)),inference(split_conjunct,[status(thm)],[151])).
% cnf(153,negated_conjecture,(relation(esk13_0)),inference(split_conjunct,[status(thm)],[151])).
% cnf(154,plain,(subset(X1,X2)|in(unordered_pair(unordered_pair(esk3_2(X1,X2),esk4_2(X1,X2)),singleton(esk3_2(X1,X2))),X1)|~relation(X2)|~relation(X1)),inference(rw,[status(thm)],[68,124,theory(equality)]),['unfolding']).
% cnf(157,plain,(subset(X1,X2)|~relation(X2)|~relation(X1)|~in(unordered_pair(unordered_pair(esk3_2(X1,X2),esk4_2(X1,X2)),singleton(esk3_2(X1,X2))),X2)),inference(rw,[status(thm)],[67,124,theory(equality)]),['unfolding']).
% cnf(159,plain,(in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),X1)|relation_dom_restriction(X1,X3)!=X2|~relation(X2)|~relation(X1)|~in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[88,124,theory(equality)]),124,theory(equality)]),['unfolding']).
% cnf(169,plain,(subset(X1,X2)|in(unordered_pair(singleton(esk3_2(X1,X2)),unordered_pair(esk3_2(X1,X2),esk4_2(X1,X2))),X1)|~relation(X2)|~relation(X1)),inference(rw,[status(thm)],[154,122,theory(equality)])).
% cnf(170,plain,(subset(X1,X2)|~relation(X2)|~relation(X1)|~in(unordered_pair(singleton(esk3_2(X1,X2)),unordered_pair(esk3_2(X1,X2),esk4_2(X1,X2))),X2)),inference(rw,[status(thm)],[157,122,theory(equality)])).
% cnf(171,plain,(in(unordered_pair(singleton(X4),unordered_pair(X4,X5)),X1)|relation_dom_restriction(X1,X3)!=X2|~relation(X2)|~relation(X1)|~in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),X2)),inference(rw,[status(thm)],[159,122,theory(equality)])).
% cnf(172,plain,(in(unordered_pair(singleton(X4),unordered_pair(X4,X5)),X1)|relation_dom_restriction(X1,X3)!=X2|~relation(X2)|~relation(X1)|~in(unordered_pair(singleton(X4),unordered_pair(X4,X5)),X2)),inference(rw,[status(thm)],[171,122,theory(equality)])).
% cnf(224,plain,(in(unordered_pair(singleton(esk3_2(X1,X2)),unordered_pair(esk3_2(X1,X2),esk4_2(X1,X2))),X3)|subset(X1,X2)|relation_dom_restriction(X3,X4)!=X1|~relation(X1)|~relation(X3)|~relation(X2)),inference(spm,[status(thm)],[172,169,theory(equality)])).
% cnf(662,plain,(in(unordered_pair(singleton(esk3_2(relation_dom_restriction(X1,X2),X3)),unordered_pair(esk3_2(relation_dom_restriction(X1,X2),X3),esk4_2(relation_dom_restriction(X1,X2),X3))),X1)|subset(relation_dom_restriction(X1,X2),X3)|~relation(relation_dom_restriction(X1,X2))|~relation(X1)|~relation(X3)),inference(er,[status(thm)],[224,theory(equality)])).
% cnf(5966,plain,(in(unordered_pair(singleton(esk3_2(relation_dom_restriction(X1,X2),X3)),unordered_pair(esk3_2(relation_dom_restriction(X1,X2),X3),esk4_2(relation_dom_restriction(X1,X2),X3))),X1)|subset(relation_dom_restriction(X1,X2),X3)|~relation(X1)|~relation(X3)),inference(csr,[status(thm)],[662,48])).
% cnf(5996,plain,(subset(relation_dom_restriction(X1,X2),X1)|~relation(X1)|~relation(relation_dom_restriction(X1,X2))),inference(spm,[status(thm)],[170,5966,theory(equality)])).
% cnf(6156,plain,(subset(relation_dom_restriction(X1,X2),X1)|~relation(X1)),inference(csr,[status(thm)],[5996,48])).
% cnf(6181,negated_conjecture,(~relation(esk13_0)),inference(spm,[status(thm)],[152,6156,theory(equality)])).
% cnf(6221,negated_conjecture,($false),inference(rw,[status(thm)],[6181,153,theory(equality)])).
% cnf(6222,negated_conjecture,($false),inference(cn,[status(thm)],[6221,theory(equality)])).
% cnf(6223,negated_conjecture,($false),6222,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1067
% # ...of these trivial : 4
% # ...subsumed : 680
% # ...remaining for further processing: 383
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 17
% # Backward-rewritten : 21
% # Generated clauses : 3796
% # ...of the previous two non-trivial : 3214
% # Contextual simplify-reflections : 605
% # Paramodulations : 3769
% # Factorizations : 0
% # Equation resolutions : 6
% # Current number of processed clauses: 297
% # Positive orientable unit clauses: 28
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 23
% # Non-unit-clauses : 245
% # Current number of unprocessed clauses: 2079
% # ...number of literals in the above : 11536
% # Clause-clause subsumption calls (NU) : 7206
% # Rec. Clause-clause subsumption calls : 5337
% # Unit Clause-clause subsumption calls : 1198
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 28
% # Indexed BW rewrite successes : 17
% # Backwards rewriting index: 214 leaves, 1.94+/-2.226 terms/leaf
% # Paramod-from index: 79 leaves, 1.52+/-1.124 terms/leaf
% # Paramod-into index: 195 leaves, 1.75+/-1.737 terms/leaf
% # -------------------------------------------------
% # User time : 0.201 s
% # System time : 0.009 s
% # Total time : 0.210 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.39 CPU 0.46 WC
% FINAL PrfWatch: 0.39 CPU 0.46 WC
% SZS output end Solution for /tmp/SystemOnTPTP28487/SEU193+1.tptp
%
%------------------------------------------------------------------------------