TSTP Solution File: NUM409+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM409+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 : art04.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 : Wed Dec 29 18:54:14 EST 2010
% Result : Theorem 0.98s
% Output : Solution 0.98s
% 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/SystemOnTPTP15745/NUM409+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15745/NUM409+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15745/NUM409+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 15841
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:?[X2]:transfinite_sequence_of(X2,X1),file('/tmp/SRASS.s.p', existence_m1_ordinal1)).
% fof(6, axiom,![X1]:subset(empty_set,X1),file('/tmp/SRASS.s.p', t2_xboole_1)).
% fof(9, axiom,![X1]:?[X2]:element(X2,X1),file('/tmp/SRASS.s.p', existence_m1_subset_1)).
% fof(12, axiom,![X1]:![X2]:(((relation(X2)&function(X2))&transfinite_sequence(X2))=>(transfinite_sequence_of(X2,X1)<=>subset(relation_rng(X2),X1))),file('/tmp/SRASS.s.p', d8_ordinal1)).
% fof(13, axiom,![X1]:![X2]:(transfinite_sequence_of(X2,X1)=>((relation(X2)&function(X2))&transfinite_sequence(X2))),file('/tmp/SRASS.s.p', dt_m1_ordinal1)).
% fof(14, axiom,![X1]:(empty(X1)=>X1=empty_set),file('/tmp/SRASS.s.p', t6_boole)).
% fof(18, axiom,![X1]:((~(empty(X1))&relation(X1))=>~(empty(relation_rng(X1)))),file('/tmp/SRASS.s.p', fc6_relat_1)).
% fof(34, axiom,![X1]:![X2]:(element(X1,X2)=>(empty(X2)|in(X1,X2))),file('/tmp/SRASS.s.p', t2_subset)).
% fof(41, axiom,?[X1]:((((((relation(X1)&function(X1))&one_to_one(X1))&empty(X1))&epsilon_transitive(X1))&epsilon_connected(X1))&ordinal(X1)),file('/tmp/SRASS.s.p', rc2_ordinal1)).
% fof(42, axiom,![X1]:![X2]:(element(X1,powerset(X2))<=>subset(X1,X2)),file('/tmp/SRASS.s.p', t3_subset)).
% fof(47, axiom,![X1]:![X2]:![X3]:~(((in(X1,X2)&element(X2,powerset(X3)))&empty(X3))),file('/tmp/SRASS.s.p', t5_subset)).
% fof(51, conjecture,![X1]:transfinite_sequence_of(empty_set,X1),file('/tmp/SRASS.s.p', t45_ordinal1)).
% fof(52, negated_conjecture,~(![X1]:transfinite_sequence_of(empty_set,X1)),inference(assume_negation,[status(cth)],[51])).
% fof(56, plain,![X1]:((~(empty(X1))&relation(X1))=>~(empty(relation_rng(X1)))),inference(fof_simplification,[status(thm)],[18,theory(equality)])).
% fof(60, plain,![X3]:?[X4]:transfinite_sequence_of(X4,X3),inference(variable_rename,[status(thm)],[1])).
% fof(61, plain,![X3]:transfinite_sequence_of(esk1_1(X3),X3),inference(skolemize,[status(esa)],[60])).
% cnf(62,plain,(transfinite_sequence_of(esk1_1(X1),X1)),inference(split_conjunct,[status(thm)],[61])).
% fof(72, plain,![X2]:subset(empty_set,X2),inference(variable_rename,[status(thm)],[6])).
% cnf(73,plain,(subset(empty_set,X1)),inference(split_conjunct,[status(thm)],[72])).
% fof(79, plain,![X3]:?[X4]:element(X4,X3),inference(variable_rename,[status(thm)],[9])).
% fof(80, plain,![X3]:element(esk4_1(X3),X3),inference(skolemize,[status(esa)],[79])).
% cnf(81,plain,(element(esk4_1(X1),X1)),inference(split_conjunct,[status(thm)],[80])).
% fof(89, plain,![X1]:![X2]:(((~(relation(X2))|~(function(X2)))|~(transfinite_sequence(X2)))|((~(transfinite_sequence_of(X2,X1))|subset(relation_rng(X2),X1))&(~(subset(relation_rng(X2),X1))|transfinite_sequence_of(X2,X1)))),inference(fof_nnf,[status(thm)],[12])).
% fof(90, plain,![X3]:![X4]:(((~(relation(X4))|~(function(X4)))|~(transfinite_sequence(X4)))|((~(transfinite_sequence_of(X4,X3))|subset(relation_rng(X4),X3))&(~(subset(relation_rng(X4),X3))|transfinite_sequence_of(X4,X3)))),inference(variable_rename,[status(thm)],[89])).
% fof(91, plain,![X3]:![X4]:(((~(transfinite_sequence_of(X4,X3))|subset(relation_rng(X4),X3))|((~(relation(X4))|~(function(X4)))|~(transfinite_sequence(X4))))&((~(subset(relation_rng(X4),X3))|transfinite_sequence_of(X4,X3))|((~(relation(X4))|~(function(X4)))|~(transfinite_sequence(X4))))),inference(distribute,[status(thm)],[90])).
% cnf(92,plain,(transfinite_sequence_of(X1,X2)|~transfinite_sequence(X1)|~function(X1)|~relation(X1)|~subset(relation_rng(X1),X2)),inference(split_conjunct,[status(thm)],[91])).
% cnf(93,plain,(subset(relation_rng(X1),X2)|~transfinite_sequence(X1)|~function(X1)|~relation(X1)|~transfinite_sequence_of(X1,X2)),inference(split_conjunct,[status(thm)],[91])).
% fof(94, plain,![X1]:![X2]:(~(transfinite_sequence_of(X2,X1))|((relation(X2)&function(X2))&transfinite_sequence(X2))),inference(fof_nnf,[status(thm)],[13])).
% fof(95, plain,![X3]:![X4]:(~(transfinite_sequence_of(X4,X3))|((relation(X4)&function(X4))&transfinite_sequence(X4))),inference(variable_rename,[status(thm)],[94])).
% fof(96, plain,![X3]:![X4]:(((relation(X4)|~(transfinite_sequence_of(X4,X3)))&(function(X4)|~(transfinite_sequence_of(X4,X3))))&(transfinite_sequence(X4)|~(transfinite_sequence_of(X4,X3)))),inference(distribute,[status(thm)],[95])).
% cnf(97,plain,(transfinite_sequence(X1)|~transfinite_sequence_of(X1,X2)),inference(split_conjunct,[status(thm)],[96])).
% cnf(98,plain,(function(X1)|~transfinite_sequence_of(X1,X2)),inference(split_conjunct,[status(thm)],[96])).
% cnf(99,plain,(relation(X1)|~transfinite_sequence_of(X1,X2)),inference(split_conjunct,[status(thm)],[96])).
% fof(100, plain,![X1]:(~(empty(X1))|X1=empty_set),inference(fof_nnf,[status(thm)],[14])).
% fof(101, plain,![X2]:(~(empty(X2))|X2=empty_set),inference(variable_rename,[status(thm)],[100])).
% cnf(102,plain,(X1=empty_set|~empty(X1)),inference(split_conjunct,[status(thm)],[101])).
% fof(116, plain,![X1]:((empty(X1)|~(relation(X1)))|~(empty(relation_rng(X1)))),inference(fof_nnf,[status(thm)],[56])).
% fof(117, plain,![X2]:((empty(X2)|~(relation(X2)))|~(empty(relation_rng(X2)))),inference(variable_rename,[status(thm)],[116])).
% cnf(118,plain,(empty(X1)|~empty(relation_rng(X1))|~relation(X1)),inference(split_conjunct,[status(thm)],[117])).
% fof(183, plain,![X1]:![X2]:(~(element(X1,X2))|(empty(X2)|in(X1,X2))),inference(fof_nnf,[status(thm)],[34])).
% fof(184, plain,![X3]:![X4]:(~(element(X3,X4))|(empty(X4)|in(X3,X4))),inference(variable_rename,[status(thm)],[183])).
% cnf(185,plain,(in(X1,X2)|empty(X2)|~element(X1,X2)),inference(split_conjunct,[status(thm)],[184])).
% fof(212, plain,?[X2]:((((((relation(X2)&function(X2))&one_to_one(X2))&empty(X2))&epsilon_transitive(X2))&epsilon_connected(X2))&ordinal(X2)),inference(variable_rename,[status(thm)],[41])).
% fof(213, plain,((((((relation(esk16_0)&function(esk16_0))&one_to_one(esk16_0))&empty(esk16_0))&epsilon_transitive(esk16_0))&epsilon_connected(esk16_0))&ordinal(esk16_0)),inference(skolemize,[status(esa)],[212])).
% cnf(217,plain,(empty(esk16_0)),inference(split_conjunct,[status(thm)],[213])).
% cnf(219,plain,(function(esk16_0)),inference(split_conjunct,[status(thm)],[213])).
% cnf(220,plain,(relation(esk16_0)),inference(split_conjunct,[status(thm)],[213])).
% fof(221, plain,![X1]:![X2]:((~(element(X1,powerset(X2)))|subset(X1,X2))&(~(subset(X1,X2))|element(X1,powerset(X2)))),inference(fof_nnf,[status(thm)],[42])).
% fof(222, plain,![X3]:![X4]:((~(element(X3,powerset(X4)))|subset(X3,X4))&(~(subset(X3,X4))|element(X3,powerset(X4)))),inference(variable_rename,[status(thm)],[221])).
% cnf(223,plain,(element(X1,powerset(X2))|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[222])).
% fof(238, plain,![X1]:![X2]:![X3]:((~(in(X1,X2))|~(element(X2,powerset(X3))))|~(empty(X3))),inference(fof_nnf,[status(thm)],[47])).
% fof(239, plain,![X4]:![X5]:![X6]:((~(in(X4,X5))|~(element(X5,powerset(X6))))|~(empty(X6))),inference(variable_rename,[status(thm)],[238])).
% cnf(240,plain,(~empty(X1)|~element(X2,powerset(X1))|~in(X3,X2)),inference(split_conjunct,[status(thm)],[239])).
% fof(260, negated_conjecture,?[X1]:~(transfinite_sequence_of(empty_set,X1)),inference(fof_nnf,[status(thm)],[52])).
% fof(261, negated_conjecture,?[X2]:~(transfinite_sequence_of(empty_set,X2)),inference(variable_rename,[status(thm)],[260])).
% fof(262, negated_conjecture,~(transfinite_sequence_of(empty_set,esk20_0)),inference(skolemize,[status(esa)],[261])).
% cnf(263,negated_conjecture,(~transfinite_sequence_of(empty_set,esk20_0)),inference(split_conjunct,[status(thm)],[262])).
% cnf(278,plain,(subset(relation_rng(X1),X2)|~function(X1)|~relation(X1)|~transfinite_sequence_of(X1,X2)),inference(csr,[status(thm)],[93,97])).
% cnf(279,plain,(subset(relation_rng(X1),X2)|~relation(X1)|~transfinite_sequence_of(X1,X2)),inference(csr,[status(thm)],[278,98])).
% cnf(280,plain,(subset(relation_rng(X1),X2)|~transfinite_sequence_of(X1,X2)),inference(csr,[status(thm)],[279,99])).
% cnf(285,plain,(empty_set=esk16_0),inference(spm,[status(thm)],[102,217,theory(equality)])).
% cnf(289,plain,(relation(esk1_1(X1))),inference(spm,[status(thm)],[99,62,theory(equality)])).
% cnf(291,plain,(transfinite_sequence(esk1_1(X1))),inference(spm,[status(thm)],[97,62,theory(equality)])).
% cnf(338,plain,(in(esk4_1(X1),X1)|empty(X1)),inference(spm,[status(thm)],[185,81,theory(equality)])).
% cnf(352,plain,(~in(X3,X1)|~empty(X2)|~subset(X1,X2)),inference(spm,[status(thm)],[240,223,theory(equality)])).
% cnf(371,negated_conjecture,(~transfinite_sequence_of(esk16_0,esk20_0)),inference(rw,[status(thm)],[263,285,theory(equality)])).
% cnf(372,plain,(subset(esk16_0,X1)),inference(rw,[status(thm)],[73,285,theory(equality)])).
% cnf(373,plain,(esk16_0=X1|~empty(X1)),inference(rw,[status(thm)],[102,285,theory(equality)])).
% cnf(493,plain,(empty(X1)|~subset(X1,X2)|~empty(X2)),inference(spm,[status(thm)],[352,338,theory(equality)])).
% cnf(497,plain,(empty(relation_rng(X1))|~empty(X2)|~transfinite_sequence_of(X1,X2)),inference(spm,[status(thm)],[493,280,theory(equality)])).
% cnf(500,plain,(empty(relation_rng(esk1_1(X1)))|~empty(X1)),inference(spm,[status(thm)],[497,62,theory(equality)])).
% cnf(532,plain,(empty(esk1_1(X1))|~relation(esk1_1(X1))|~empty(X1)),inference(spm,[status(thm)],[118,500,theory(equality)])).
% cnf(536,plain,(empty(esk1_1(X1))|$false|~empty(X1)),inference(rw,[status(thm)],[532,289,theory(equality)])).
% cnf(537,plain,(empty(esk1_1(X1))|~empty(X1)),inference(cn,[status(thm)],[536,theory(equality)])).
% cnf(542,plain,(esk16_0=esk1_1(X1)|~empty(X1)),inference(spm,[status(thm)],[373,537,theory(equality)])).
% cnf(550,plain,(transfinite_sequence(esk16_0)|~empty(X1)),inference(spm,[status(thm)],[291,542,theory(equality)])).
% cnf(551,plain,(empty(relation_rng(esk16_0))|~empty(X1)),inference(spm,[status(thm)],[500,542,theory(equality)])).
% cnf(569,plain,(transfinite_sequence(esk16_0)),inference(spm,[status(thm)],[550,217,theory(equality)])).
% cnf(612,plain,(empty(relation_rng(esk16_0))),inference(spm,[status(thm)],[551,217,theory(equality)])).
% cnf(626,plain,(esk16_0=relation_rng(esk16_0)),inference(spm,[status(thm)],[373,612,theory(equality)])).
% cnf(653,plain,(transfinite_sequence_of(esk16_0,X1)|~transfinite_sequence(esk16_0)|~function(esk16_0)|~relation(esk16_0)|~subset(esk16_0,X1)),inference(spm,[status(thm)],[92,626,theory(equality)])).
% cnf(672,plain,(transfinite_sequence_of(esk16_0,X1)|$false|~function(esk16_0)|~relation(esk16_0)|~subset(esk16_0,X1)),inference(rw,[status(thm)],[653,569,theory(equality)])).
% cnf(673,plain,(transfinite_sequence_of(esk16_0,X1)|$false|$false|~relation(esk16_0)|~subset(esk16_0,X1)),inference(rw,[status(thm)],[672,219,theory(equality)])).
% cnf(674,plain,(transfinite_sequence_of(esk16_0,X1)|$false|$false|$false|~subset(esk16_0,X1)),inference(rw,[status(thm)],[673,220,theory(equality)])).
% cnf(675,plain,(transfinite_sequence_of(esk16_0,X1)|$false|$false|$false|$false),inference(rw,[status(thm)],[674,372,theory(equality)])).
% cnf(676,plain,(transfinite_sequence_of(esk16_0,X1)),inference(cn,[status(thm)],[675,theory(equality)])).
% cnf(683,negated_conjecture,($false),inference(rw,[status(thm)],[371,676,theory(equality)])).
% cnf(684,negated_conjecture,($false),inference(cn,[status(thm)],[683,theory(equality)])).
% cnf(685,negated_conjecture,($false),684,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 255
% # ...of these trivial : 8
% # ...subsumed : 9
% # ...remaining for further processing: 238
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 23
% # Generated clauses : 259
% # ...of the previous two non-trivial : 202
% # Contextual simplify-reflections : 10
% # Paramodulations : 258
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 120
% # Positive orientable unit clauses: 46
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 10
% # Non-unit-clauses : 63
% # Current number of unprocessed clauses: 106
% # ...number of literals in the above : 392
% # Clause-clause subsumption calls (NU) : 127
% # Rec. Clause-clause subsumption calls : 120
% # Unit Clause-clause subsumption calls : 57
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 11
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 111 leaves, 1.23+/-0.667 terms/leaf
% # Paramod-from index: 73 leaves, 1.07+/-0.253 terms/leaf
% # Paramod-into index: 109 leaves, 1.16+/-0.473 terms/leaf
% # -------------------------------------------------
% # User time : 0.029 s
% # System time : 0.006 s
% # Total time : 0.035 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.21 WC
% FINAL PrfWatch: 0.11 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP15745/NUM409+1.tptp
%
%------------------------------------------------------------------------------