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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SEU243+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 02:25:39 EST 2010

% Result   : Theorem 1.11s
% Output   : Solution 1.11s
% 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/SystemOnTPTP1214/SEU243+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP1214/SEU243+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1214/SEU243+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 1311
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(6, axiom,![X1]:(relation(X1)=>(well_founded_relation(X1)<=>![X2]:~(((subset(X2,relation_field(X1))&~(X2=empty_set))&![X3]:~((in(X3,X2)&disjoint(fiber(X1,X3),X2))))))),file('/tmp/SRASS.s.p', d2_wellord1)).
% fof(16, axiom,![X1]:(relation(X1)=>![X2]:(is_well_founded_in(X1,X2)<=>![X3]:~(((subset(X3,X2)&~(X3=empty_set))&![X4]:~((in(X4,X3)&disjoint(fiber(X1,X4),X3))))))),file('/tmp/SRASS.s.p', d3_wellord1)).
% fof(37, conjecture,![X1]:(relation(X1)=>(well_founded_relation(X1)<=>is_well_founded_in(X1,relation_field(X1)))),file('/tmp/SRASS.s.p', t5_wellord1)).
% fof(38, negated_conjecture,~(![X1]:(relation(X1)=>(well_founded_relation(X1)<=>is_well_founded_in(X1,relation_field(X1))))),inference(assume_negation,[status(cth)],[37])).
% fof(58, plain,![X1]:(~(relation(X1))|((~(well_founded_relation(X1))|![X2]:((~(subset(X2,relation_field(X1)))|X2=empty_set)|?[X3]:(in(X3,X2)&disjoint(fiber(X1,X3),X2))))&(?[X2]:((subset(X2,relation_field(X1))&~(X2=empty_set))&![X3]:(~(in(X3,X2))|~(disjoint(fiber(X1,X3),X2))))|well_founded_relation(X1)))),inference(fof_nnf,[status(thm)],[6])).
% fof(59, plain,![X4]:(~(relation(X4))|((~(well_founded_relation(X4))|![X5]:((~(subset(X5,relation_field(X4)))|X5=empty_set)|?[X6]:(in(X6,X5)&disjoint(fiber(X4,X6),X5))))&(?[X7]:((subset(X7,relation_field(X4))&~(X7=empty_set))&![X8]:(~(in(X8,X7))|~(disjoint(fiber(X4,X8),X7))))|well_founded_relation(X4)))),inference(variable_rename,[status(thm)],[58])).
% fof(60, plain,![X4]:(~(relation(X4))|((~(well_founded_relation(X4))|![X5]:((~(subset(X5,relation_field(X4)))|X5=empty_set)|(in(esk2_2(X4,X5),X5)&disjoint(fiber(X4,esk2_2(X4,X5)),X5))))&(((subset(esk3_1(X4),relation_field(X4))&~(esk3_1(X4)=empty_set))&![X8]:(~(in(X8,esk3_1(X4)))|~(disjoint(fiber(X4,X8),esk3_1(X4)))))|well_founded_relation(X4)))),inference(skolemize,[status(esa)],[59])).
% fof(61, plain,![X4]:![X5]:![X8]:(((((~(in(X8,esk3_1(X4)))|~(disjoint(fiber(X4,X8),esk3_1(X4))))&(subset(esk3_1(X4),relation_field(X4))&~(esk3_1(X4)=empty_set)))|well_founded_relation(X4))&(((~(subset(X5,relation_field(X4)))|X5=empty_set)|(in(esk2_2(X4,X5),X5)&disjoint(fiber(X4,esk2_2(X4,X5)),X5)))|~(well_founded_relation(X4))))|~(relation(X4))),inference(shift_quantors,[status(thm)],[60])).
% fof(62, plain,![X4]:![X5]:![X8]:(((((~(in(X8,esk3_1(X4)))|~(disjoint(fiber(X4,X8),esk3_1(X4))))|well_founded_relation(X4))|~(relation(X4)))&(((subset(esk3_1(X4),relation_field(X4))|well_founded_relation(X4))|~(relation(X4)))&((~(esk3_1(X4)=empty_set)|well_founded_relation(X4))|~(relation(X4)))))&((((in(esk2_2(X4,X5),X5)|(~(subset(X5,relation_field(X4)))|X5=empty_set))|~(well_founded_relation(X4)))|~(relation(X4)))&(((disjoint(fiber(X4,esk2_2(X4,X5)),X5)|(~(subset(X5,relation_field(X4)))|X5=empty_set))|~(well_founded_relation(X4)))|~(relation(X4))))),inference(distribute,[status(thm)],[61])).
% cnf(63,plain,(X2=empty_set|disjoint(fiber(X1,esk2_2(X1,X2)),X2)|~relation(X1)|~well_founded_relation(X1)|~subset(X2,relation_field(X1))),inference(split_conjunct,[status(thm)],[62])).
% cnf(64,plain,(X2=empty_set|in(esk2_2(X1,X2),X2)|~relation(X1)|~well_founded_relation(X1)|~subset(X2,relation_field(X1))),inference(split_conjunct,[status(thm)],[62])).
% cnf(65,plain,(well_founded_relation(X1)|~relation(X1)|esk3_1(X1)!=empty_set),inference(split_conjunct,[status(thm)],[62])).
% cnf(66,plain,(well_founded_relation(X1)|subset(esk3_1(X1),relation_field(X1))|~relation(X1)),inference(split_conjunct,[status(thm)],[62])).
% cnf(67,plain,(well_founded_relation(X1)|~relation(X1)|~disjoint(fiber(X1,X2),esk3_1(X1))|~in(X2,esk3_1(X1))),inference(split_conjunct,[status(thm)],[62])).
% fof(101, plain,![X1]:(~(relation(X1))|![X2]:((~(is_well_founded_in(X1,X2))|![X3]:((~(subset(X3,X2))|X3=empty_set)|?[X4]:(in(X4,X3)&disjoint(fiber(X1,X4),X3))))&(?[X3]:((subset(X3,X2)&~(X3=empty_set))&![X4]:(~(in(X4,X3))|~(disjoint(fiber(X1,X4),X3))))|is_well_founded_in(X1,X2)))),inference(fof_nnf,[status(thm)],[16])).
% fof(102, plain,![X5]:(~(relation(X5))|![X6]:((~(is_well_founded_in(X5,X6))|![X7]:((~(subset(X7,X6))|X7=empty_set)|?[X8]:(in(X8,X7)&disjoint(fiber(X5,X8),X7))))&(?[X9]:((subset(X9,X6)&~(X9=empty_set))&![X10]:(~(in(X10,X9))|~(disjoint(fiber(X5,X10),X9))))|is_well_founded_in(X5,X6)))),inference(variable_rename,[status(thm)],[101])).
% fof(103, plain,![X5]:(~(relation(X5))|![X6]:((~(is_well_founded_in(X5,X6))|![X7]:((~(subset(X7,X6))|X7=empty_set)|(in(esk9_3(X5,X6,X7),X7)&disjoint(fiber(X5,esk9_3(X5,X6,X7)),X7))))&(((subset(esk10_2(X5,X6),X6)&~(esk10_2(X5,X6)=empty_set))&![X10]:(~(in(X10,esk10_2(X5,X6)))|~(disjoint(fiber(X5,X10),esk10_2(X5,X6)))))|is_well_founded_in(X5,X6)))),inference(skolemize,[status(esa)],[102])).
% fof(104, plain,![X5]:![X6]:![X7]:![X10]:(((((~(in(X10,esk10_2(X5,X6)))|~(disjoint(fiber(X5,X10),esk10_2(X5,X6))))&(subset(esk10_2(X5,X6),X6)&~(esk10_2(X5,X6)=empty_set)))|is_well_founded_in(X5,X6))&(((~(subset(X7,X6))|X7=empty_set)|(in(esk9_3(X5,X6,X7),X7)&disjoint(fiber(X5,esk9_3(X5,X6,X7)),X7)))|~(is_well_founded_in(X5,X6))))|~(relation(X5))),inference(shift_quantors,[status(thm)],[103])).
% fof(105, plain,![X5]:![X6]:![X7]:![X10]:(((((~(in(X10,esk10_2(X5,X6)))|~(disjoint(fiber(X5,X10),esk10_2(X5,X6))))|is_well_founded_in(X5,X6))|~(relation(X5)))&(((subset(esk10_2(X5,X6),X6)|is_well_founded_in(X5,X6))|~(relation(X5)))&((~(esk10_2(X5,X6)=empty_set)|is_well_founded_in(X5,X6))|~(relation(X5)))))&((((in(esk9_3(X5,X6,X7),X7)|(~(subset(X7,X6))|X7=empty_set))|~(is_well_founded_in(X5,X6)))|~(relation(X5)))&(((disjoint(fiber(X5,esk9_3(X5,X6,X7)),X7)|(~(subset(X7,X6))|X7=empty_set))|~(is_well_founded_in(X5,X6)))|~(relation(X5))))),inference(distribute,[status(thm)],[104])).
% cnf(106,plain,(X3=empty_set|disjoint(fiber(X1,esk9_3(X1,X2,X3)),X3)|~relation(X1)|~is_well_founded_in(X1,X2)|~subset(X3,X2)),inference(split_conjunct,[status(thm)],[105])).
% cnf(107,plain,(X3=empty_set|in(esk9_3(X1,X2,X3),X3)|~relation(X1)|~is_well_founded_in(X1,X2)|~subset(X3,X2)),inference(split_conjunct,[status(thm)],[105])).
% cnf(108,plain,(is_well_founded_in(X1,X2)|~relation(X1)|esk10_2(X1,X2)!=empty_set),inference(split_conjunct,[status(thm)],[105])).
% cnf(109,plain,(is_well_founded_in(X1,X2)|subset(esk10_2(X1,X2),X2)|~relation(X1)),inference(split_conjunct,[status(thm)],[105])).
% cnf(110,plain,(is_well_founded_in(X1,X2)|~relation(X1)|~disjoint(fiber(X1,X3),esk10_2(X1,X2))|~in(X3,esk10_2(X1,X2))),inference(split_conjunct,[status(thm)],[105])).
% fof(152, negated_conjecture,?[X1]:(relation(X1)&((~(well_founded_relation(X1))|~(is_well_founded_in(X1,relation_field(X1))))&(well_founded_relation(X1)|is_well_founded_in(X1,relation_field(X1))))),inference(fof_nnf,[status(thm)],[38])).
% fof(153, negated_conjecture,?[X2]:(relation(X2)&((~(well_founded_relation(X2))|~(is_well_founded_in(X2,relation_field(X2))))&(well_founded_relation(X2)|is_well_founded_in(X2,relation_field(X2))))),inference(variable_rename,[status(thm)],[152])).
% fof(154, negated_conjecture,(relation(esk11_0)&((~(well_founded_relation(esk11_0))|~(is_well_founded_in(esk11_0,relation_field(esk11_0))))&(well_founded_relation(esk11_0)|is_well_founded_in(esk11_0,relation_field(esk11_0))))),inference(skolemize,[status(esa)],[153])).
% cnf(155,negated_conjecture,(is_well_founded_in(esk11_0,relation_field(esk11_0))|well_founded_relation(esk11_0)),inference(split_conjunct,[status(thm)],[154])).
% cnf(156,negated_conjecture,(~is_well_founded_in(esk11_0,relation_field(esk11_0))|~well_founded_relation(esk11_0)),inference(split_conjunct,[status(thm)],[154])).
% cnf(157,negated_conjecture,(relation(esk11_0)),inference(split_conjunct,[status(thm)],[154])).
% cnf(199,plain,(is_well_founded_in(X1,X2)|empty_set=esk10_2(X1,X2)|~relation(X1)|~in(esk2_2(X1,esk10_2(X1,X2)),esk10_2(X1,X2))|~well_founded_relation(X1)|~subset(esk10_2(X1,X2),relation_field(X1))),inference(spm,[status(thm)],[110,63,theory(equality)])).
% cnf(203,plain,(well_founded_relation(X1)|empty_set=esk3_1(X1)|~relation(X1)|~in(esk9_3(X1,X2,esk3_1(X1)),esk3_1(X1))|~is_well_founded_in(X1,X2)|~subset(esk3_1(X1),X2)),inference(spm,[status(thm)],[67,106,theory(equality)])).
% cnf(460,plain,(esk10_2(X1,X2)=empty_set|is_well_founded_in(X1,X2)|~well_founded_relation(X1)|~relation(X1)|~subset(esk10_2(X1,X2),relation_field(X1))),inference(csr,[status(thm)],[199,64])).
% cnf(461,plain,(is_well_founded_in(X1,X2)|~well_founded_relation(X1)|~relation(X1)|~subset(esk10_2(X1,X2),relation_field(X1))),inference(csr,[status(thm)],[460,108])).
% cnf(462,plain,(is_well_founded_in(X1,relation_field(X1))|~well_founded_relation(X1)|~relation(X1)),inference(spm,[status(thm)],[461,109,theory(equality)])).
% cnf(463,negated_conjecture,(~well_founded_relation(esk11_0)|~relation(esk11_0)),inference(spm,[status(thm)],[156,462,theory(equality)])).
% cnf(464,negated_conjecture,(~well_founded_relation(esk11_0)|$false),inference(rw,[status(thm)],[463,157,theory(equality)])).
% cnf(465,negated_conjecture,(~well_founded_relation(esk11_0)),inference(cn,[status(thm)],[464,theory(equality)])).
% cnf(466,negated_conjecture,(is_well_founded_in(esk11_0,relation_field(esk11_0))),inference(sr,[status(thm)],[155,465,theory(equality)])).
% cnf(534,plain,(esk3_1(X1)=empty_set|well_founded_relation(X1)|~is_well_founded_in(X1,X2)|~relation(X1)|~subset(esk3_1(X1),X2)),inference(csr,[status(thm)],[203,107])).
% cnf(535,plain,(well_founded_relation(X1)|~is_well_founded_in(X1,X2)|~relation(X1)|~subset(esk3_1(X1),X2)),inference(csr,[status(thm)],[534,65])).
% cnf(537,plain,(well_founded_relation(X1)|~is_well_founded_in(X1,relation_field(X1))|~relation(X1)),inference(spm,[status(thm)],[535,66,theory(equality)])).
% cnf(538,negated_conjecture,(well_founded_relation(esk11_0)|~relation(esk11_0)),inference(spm,[status(thm)],[537,466,theory(equality)])).
% cnf(541,negated_conjecture,(well_founded_relation(esk11_0)|$false),inference(rw,[status(thm)],[538,157,theory(equality)])).
% cnf(542,negated_conjecture,(well_founded_relation(esk11_0)),inference(cn,[status(thm)],[541,theory(equality)])).
% cnf(543,negated_conjecture,($false),inference(sr,[status(thm)],[542,465,theory(equality)])).
% cnf(544,negated_conjecture,($false),543,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 232
% # ...of these trivial                : 1
% # ...subsumed                        : 63
% # ...remaining for further processing: 168
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 4
% # Backward-rewritten                 : 9
% # Generated clauses                  : 275
% # ...of the previous two non-trivial : 244
% # Contextual simplify-reflections    : 64
% # Paramodulations                    : 265
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 106
% #    Positive orientable unit clauses: 20
% #    Positive unorientable unit clauses: 1
% #    Negative unit clauses           : 5
% #    Non-unit-clauses                : 80
% # Current number of unprocessed clauses: 85
% # ...number of literals in the above : 447
% # Clause-clause subsumption calls (NU) : 842
% # Rec. Clause-clause subsumption calls : 595
% # Unit Clause-clause subsumption calls : 184
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 23
% # Indexed BW rewrite successes       : 21
% # Backwards rewriting index:   102 leaves,   1.32+/-0.730 terms/leaf
% # Paramod-from index:           52 leaves,   1.08+/-0.331 terms/leaf
% # Paramod-into index:           95 leaves,   1.20+/-0.472 terms/leaf
% # -------------------------------------------------
% # User time              : 0.030 s
% # System time            : 0.006 s
% # Total time             : 0.036 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.21 WC
% FINAL PrfWatch: 0.14 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP1214/SEU243+1.tptp
% 
%------------------------------------------------------------------------------