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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SEU234+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 : art02.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:16:08 EST 2010

% Result   : Theorem 1.01s
% Output   : Solution 1.01s
% 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/SystemOnTPTP29717/SEU234+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP29717/SEU234+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29717/SEU234+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 29813
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(epsilon_transitive(X1)<=>![X2]:(in(X2,X1)=>subset(X2,X1))),file('/tmp/SRASS.s.p', d2_ordinal1)).
% fof(4, axiom,![X1]:(ordinal(X1)=>![X2]:(ordinal(X2)=>~(((~(in(X1,X2))&~(X1=X2))&~(in(X2,X1)))))),file('/tmp/SRASS.s.p', t24_ordinal1)).
% fof(10, axiom,![X1]:(epsilon_connected(X1)<=>![X2]:![X3]:~(((((in(X2,X1)&in(X3,X1))&~(in(X2,X3)))&~(X2=X3))&~(in(X3,X2))))),file('/tmp/SRASS.s.p', d3_ordinal1)).
% fof(13, axiom,![X1]:((epsilon_transitive(X1)&epsilon_connected(X1))=>ordinal(X1)),file('/tmp/SRASS.s.p', cc2_ordinal1)).
% fof(41, conjecture,![X1]:(![X2]:(in(X2,X1)=>(ordinal(X2)&subset(X2,X1)))=>ordinal(X1)),file('/tmp/SRASS.s.p', t31_ordinal1)).
% fof(42, negated_conjecture,~(![X1]:(![X2]:(in(X2,X1)=>(ordinal(X2)&subset(X2,X1)))=>ordinal(X1))),inference(assume_negation,[status(cth)],[41])).
% fof(44, plain,![X1]:(ordinal(X1)=>![X2]:(ordinal(X2)=>~(((~(in(X1,X2))&~(X1=X2))&~(in(X2,X1)))))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(46, plain,![X1]:(epsilon_connected(X1)<=>![X2]:![X3]:~(((((in(X2,X1)&in(X3,X1))&~(in(X2,X3)))&~(X2=X3))&~(in(X3,X2))))),inference(fof_simplification,[status(thm)],[10,theory(equality)])).
% fof(54, plain,![X1]:((~(epsilon_transitive(X1))|![X2]:(~(in(X2,X1))|subset(X2,X1)))&(?[X2]:(in(X2,X1)&~(subset(X2,X1)))|epsilon_transitive(X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(55, plain,![X3]:((~(epsilon_transitive(X3))|![X4]:(~(in(X4,X3))|subset(X4,X3)))&(?[X5]:(in(X5,X3)&~(subset(X5,X3)))|epsilon_transitive(X3))),inference(variable_rename,[status(thm)],[54])).
% fof(56, plain,![X3]:((~(epsilon_transitive(X3))|![X4]:(~(in(X4,X3))|subset(X4,X3)))&((in(esk1_1(X3),X3)&~(subset(esk1_1(X3),X3)))|epsilon_transitive(X3))),inference(skolemize,[status(esa)],[55])).
% fof(57, plain,![X3]:![X4]:(((~(in(X4,X3))|subset(X4,X3))|~(epsilon_transitive(X3)))&((in(esk1_1(X3),X3)&~(subset(esk1_1(X3),X3)))|epsilon_transitive(X3))),inference(shift_quantors,[status(thm)],[56])).
% fof(58, plain,![X3]:![X4]:(((~(in(X4,X3))|subset(X4,X3))|~(epsilon_transitive(X3)))&((in(esk1_1(X3),X3)|epsilon_transitive(X3))&(~(subset(esk1_1(X3),X3))|epsilon_transitive(X3)))),inference(distribute,[status(thm)],[57])).
% cnf(59,plain,(epsilon_transitive(X1)|~subset(esk1_1(X1),X1)),inference(split_conjunct,[status(thm)],[58])).
% cnf(60,plain,(epsilon_transitive(X1)|in(esk1_1(X1),X1)),inference(split_conjunct,[status(thm)],[58])).
% fof(62, plain,![X1]:(~(ordinal(X1))|![X2]:(~(ordinal(X2))|((in(X1,X2)|X1=X2)|in(X2,X1)))),inference(fof_nnf,[status(thm)],[44])).
% fof(63, plain,![X3]:(~(ordinal(X3))|![X4]:(~(ordinal(X4))|((in(X3,X4)|X3=X4)|in(X4,X3)))),inference(variable_rename,[status(thm)],[62])).
% fof(64, plain,![X3]:![X4]:((~(ordinal(X4))|((in(X3,X4)|X3=X4)|in(X4,X3)))|~(ordinal(X3))),inference(shift_quantors,[status(thm)],[63])).
% cnf(65,plain,(in(X2,X1)|X1=X2|in(X1,X2)|~ordinal(X1)|~ordinal(X2)),inference(split_conjunct,[status(thm)],[64])).
% fof(81, plain,![X1]:((~(epsilon_connected(X1))|![X2]:![X3]:((((~(in(X2,X1))|~(in(X3,X1)))|in(X2,X3))|X2=X3)|in(X3,X2)))&(?[X2]:?[X3]:((((in(X2,X1)&in(X3,X1))&~(in(X2,X3)))&~(X2=X3))&~(in(X3,X2)))|epsilon_connected(X1))),inference(fof_nnf,[status(thm)],[46])).
% fof(82, plain,![X4]:((~(epsilon_connected(X4))|![X5]:![X6]:((((~(in(X5,X4))|~(in(X6,X4)))|in(X5,X6))|X5=X6)|in(X6,X5)))&(?[X7]:?[X8]:((((in(X7,X4)&in(X8,X4))&~(in(X7,X8)))&~(X7=X8))&~(in(X8,X7)))|epsilon_connected(X4))),inference(variable_rename,[status(thm)],[81])).
% fof(83, plain,![X4]:((~(epsilon_connected(X4))|![X5]:![X6]:((((~(in(X5,X4))|~(in(X6,X4)))|in(X5,X6))|X5=X6)|in(X6,X5)))&(((((in(esk5_1(X4),X4)&in(esk6_1(X4),X4))&~(in(esk5_1(X4),esk6_1(X4))))&~(esk5_1(X4)=esk6_1(X4)))&~(in(esk6_1(X4),esk5_1(X4))))|epsilon_connected(X4))),inference(skolemize,[status(esa)],[82])).
% fof(84, plain,![X4]:![X5]:![X6]:((((((~(in(X5,X4))|~(in(X6,X4)))|in(X5,X6))|X5=X6)|in(X6,X5))|~(epsilon_connected(X4)))&(((((in(esk5_1(X4),X4)&in(esk6_1(X4),X4))&~(in(esk5_1(X4),esk6_1(X4))))&~(esk5_1(X4)=esk6_1(X4)))&~(in(esk6_1(X4),esk5_1(X4))))|epsilon_connected(X4))),inference(shift_quantors,[status(thm)],[83])).
% fof(85, plain,![X4]:![X5]:![X6]:((((((~(in(X5,X4))|~(in(X6,X4)))|in(X5,X6))|X5=X6)|in(X6,X5))|~(epsilon_connected(X4)))&(((((in(esk5_1(X4),X4)|epsilon_connected(X4))&(in(esk6_1(X4),X4)|epsilon_connected(X4)))&(~(in(esk5_1(X4),esk6_1(X4)))|epsilon_connected(X4)))&(~(esk5_1(X4)=esk6_1(X4))|epsilon_connected(X4)))&(~(in(esk6_1(X4),esk5_1(X4)))|epsilon_connected(X4)))),inference(distribute,[status(thm)],[84])).
% cnf(86,plain,(epsilon_connected(X1)|~in(esk6_1(X1),esk5_1(X1))),inference(split_conjunct,[status(thm)],[85])).
% cnf(87,plain,(epsilon_connected(X1)|esk5_1(X1)!=esk6_1(X1)),inference(split_conjunct,[status(thm)],[85])).
% cnf(88,plain,(epsilon_connected(X1)|~in(esk5_1(X1),esk6_1(X1))),inference(split_conjunct,[status(thm)],[85])).
% cnf(89,plain,(epsilon_connected(X1)|in(esk6_1(X1),X1)),inference(split_conjunct,[status(thm)],[85])).
% cnf(90,plain,(epsilon_connected(X1)|in(esk5_1(X1),X1)),inference(split_conjunct,[status(thm)],[85])).
% fof(101, plain,![X1]:((~(epsilon_transitive(X1))|~(epsilon_connected(X1)))|ordinal(X1)),inference(fof_nnf,[status(thm)],[13])).
% fof(102, plain,![X2]:((~(epsilon_transitive(X2))|~(epsilon_connected(X2)))|ordinal(X2)),inference(variable_rename,[status(thm)],[101])).
% cnf(103,plain,(ordinal(X1)|~epsilon_connected(X1)|~epsilon_transitive(X1)),inference(split_conjunct,[status(thm)],[102])).
% fof(211, negated_conjecture,?[X1]:(![X2]:(~(in(X2,X1))|(ordinal(X2)&subset(X2,X1)))&~(ordinal(X1))),inference(fof_nnf,[status(thm)],[42])).
% fof(212, negated_conjecture,?[X3]:(![X4]:(~(in(X4,X3))|(ordinal(X4)&subset(X4,X3)))&~(ordinal(X3))),inference(variable_rename,[status(thm)],[211])).
% fof(213, negated_conjecture,(![X4]:(~(in(X4,esk17_0))|(ordinal(X4)&subset(X4,esk17_0)))&~(ordinal(esk17_0))),inference(skolemize,[status(esa)],[212])).
% fof(214, negated_conjecture,![X4]:((~(in(X4,esk17_0))|(ordinal(X4)&subset(X4,esk17_0)))&~(ordinal(esk17_0))),inference(shift_quantors,[status(thm)],[213])).
% fof(215, negated_conjecture,![X4]:(((ordinal(X4)|~(in(X4,esk17_0)))&(subset(X4,esk17_0)|~(in(X4,esk17_0))))&~(ordinal(esk17_0))),inference(distribute,[status(thm)],[214])).
% cnf(216,negated_conjecture,(~ordinal(esk17_0)),inference(split_conjunct,[status(thm)],[215])).
% cnf(217,negated_conjecture,(subset(X1,esk17_0)|~in(X1,esk17_0)),inference(split_conjunct,[status(thm)],[215])).
% cnf(218,negated_conjecture,(ordinal(X1)|~in(X1,esk17_0)),inference(split_conjunct,[status(thm)],[215])).
% cnf(267,negated_conjecture,(epsilon_transitive(esk17_0)|~in(esk1_1(esk17_0),esk17_0)),inference(spm,[status(thm)],[59,217,theory(equality)])).
% cnf(282,negated_conjecture,(X1=X2|in(X2,X1)|in(X1,X2)|~ordinal(X1)|~in(X2,esk17_0)),inference(spm,[status(thm)],[65,218,theory(equality)])).
% cnf(330,negated_conjecture,(epsilon_transitive(esk17_0)),inference(csr,[status(thm)],[267,60])).
% cnf(331,negated_conjecture,(ordinal(esk17_0)|~epsilon_connected(esk17_0)),inference(spm,[status(thm)],[103,330,theory(equality)])).
% cnf(333,negated_conjecture,(~epsilon_connected(esk17_0)),inference(sr,[status(thm)],[331,216,theory(equality)])).
% cnf(442,negated_conjecture,(X1=esk6_1(esk17_0)|in(X1,esk6_1(esk17_0))|in(esk6_1(esk17_0),X1)|epsilon_connected(esk17_0)|~ordinal(X1)),inference(spm,[status(thm)],[282,89,theory(equality)])).
% cnf(446,negated_conjecture,(X1=esk6_1(esk17_0)|in(X1,esk6_1(esk17_0))|in(esk6_1(esk17_0),X1)|~ordinal(X1)),inference(sr,[status(thm)],[442,333,theory(equality)])).
% cnf(1220,negated_conjecture,(X1=esk6_1(esk17_0)|in(esk6_1(esk17_0),X1)|in(X1,esk6_1(esk17_0))|~in(X1,esk17_0)),inference(spm,[status(thm)],[446,218,theory(equality)])).
% cnf(1525,negated_conjecture,(esk5_1(esk17_0)=esk6_1(esk17_0)|in(esk5_1(esk17_0),esk6_1(esk17_0))|in(esk6_1(esk17_0),esk5_1(esk17_0))|epsilon_connected(esk17_0)),inference(spm,[status(thm)],[1220,90,theory(equality)])).
% cnf(1536,negated_conjecture,(esk6_1(esk17_0)=esk5_1(esk17_0)|in(esk5_1(esk17_0),esk6_1(esk17_0))|in(esk6_1(esk17_0),esk5_1(esk17_0))),inference(sr,[status(thm)],[1525,333,theory(equality)])).
% cnf(1547,negated_conjecture,(epsilon_connected(esk17_0)|esk6_1(esk17_0)=esk5_1(esk17_0)|in(esk5_1(esk17_0),esk6_1(esk17_0))),inference(spm,[status(thm)],[86,1536,theory(equality)])).
% cnf(1554,negated_conjecture,(esk6_1(esk17_0)=esk5_1(esk17_0)|in(esk5_1(esk17_0),esk6_1(esk17_0))),inference(sr,[status(thm)],[1547,333,theory(equality)])).
% cnf(1562,negated_conjecture,(epsilon_connected(esk17_0)|esk6_1(esk17_0)=esk5_1(esk17_0)),inference(spm,[status(thm)],[88,1554,theory(equality)])).
% cnf(1569,negated_conjecture,(esk6_1(esk17_0)=esk5_1(esk17_0)),inference(sr,[status(thm)],[1562,333,theory(equality)])).
% cnf(1570,negated_conjecture,(epsilon_connected(esk17_0)),inference(spm,[status(thm)],[87,1569,theory(equality)])).
% cnf(1626,negated_conjecture,($false),inference(sr,[status(thm)],[1570,333,theory(equality)])).
% cnf(1627,negated_conjecture,($false),1626,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 485
% # ...of these trivial                : 6
% # ...subsumed                        : 126
% # ...remaining for further processing: 353
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 23
% # Backward-rewritten                 : 44
% # Generated clauses                  : 838
% # ...of the previous two non-trivial : 659
% # Contextual simplify-reflections    : 94
% # Paramodulations                    : 827
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 206
% #    Positive orientable unit clauses: 41
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 11
% #    Non-unit-clauses                : 154
% # Current number of unprocessed clauses: 180
% # ...number of literals in the above : 852
% # Clause-clause subsumption calls (NU) : 2160
% # Rec. Clause-clause subsumption calls : 1573
% # Unit Clause-clause subsumption calls : 378
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 10
% # Indexed BW rewrite successes       : 10
% # Backwards rewriting index:   188 leaves,   1.19+/-0.612 terms/leaf
% # Paramod-from index:          106 leaves,   1.01+/-0.097 terms/leaf
% # Paramod-into index:          170 leaves,   1.12+/-0.445 terms/leaf
% # -------------------------------------------------
% # User time              : 0.064 s
% # System time            : 0.005 s
% # Total time             : 0.069 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.17 CPU 0.26 WC
% FINAL PrfWatch: 0.17 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP29717/SEU234+1.tptp
% 
%------------------------------------------------------------------------------