%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM411+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 : art05.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:31 EST 2010
% Result : Theorem 1.03s
% Output : Solution 1.03s
% 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/SystemOnTPTP30091/NUM411+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30091/NUM411+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30091/NUM411+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 30187
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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]:![X3]:((subset(X1,X2)&subset(X2,X3))=>subset(X1,X3)),file('/tmp/SRASS.s.p', t1_xboole_1)).
% fof(7, 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(17, axiom,![X1]:![X2]:(transfinite_sequence_of(X2,X1)=>((relation(X2)&function(X2))&transfinite_sequence(X2))),file('/tmp/SRASS.s.p', dt_m1_ordinal1)).
% fof(43, conjecture,![X1]:![X2]:(subset(X1,X2)=>![X3]:(transfinite_sequence_of(X3,X1)=>transfinite_sequence_of(X3,X2))),file('/tmp/SRASS.s.p', t47_ordinal1)).
% fof(44, negated_conjecture,~(![X1]:![X2]:(subset(X1,X2)=>![X3]:(transfinite_sequence_of(X3,X1)=>transfinite_sequence_of(X3,X2)))),inference(assume_negation,[status(cth)],[43])).
% fof(55, plain,![X1]:![X2]:![X3]:((~(subset(X1,X2))|~(subset(X2,X3)))|subset(X1,X3)),inference(fof_nnf,[status(thm)],[3])).
% fof(56, plain,![X4]:![X5]:![X6]:((~(subset(X4,X5))|~(subset(X5,X6)))|subset(X4,X6)),inference(variable_rename,[status(thm)],[55])).
% cnf(57,plain,(subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3)),inference(split_conjunct,[status(thm)],[56])).
% fof(70, 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)],[7])).
% fof(71, 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)],[70])).
% fof(72, 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)],[71])).
% cnf(73,plain,(transfinite_sequence_of(X1,X2)|~transfinite_sequence(X1)|~function(X1)|~relation(X1)|~subset(relation_rng(X1),X2)),inference(split_conjunct,[status(thm)],[72])).
% cnf(74,plain,(subset(relation_rng(X1),X2)|~transfinite_sequence(X1)|~function(X1)|~relation(X1)|~transfinite_sequence_of(X1,X2)),inference(split_conjunct,[status(thm)],[72])).
% fof(107, plain,![X1]:![X2]:(~(transfinite_sequence_of(X2,X1))|((relation(X2)&function(X2))&transfinite_sequence(X2))),inference(fof_nnf,[status(thm)],[17])).
% fof(108, plain,![X3]:![X4]:(~(transfinite_sequence_of(X4,X3))|((relation(X4)&function(X4))&transfinite_sequence(X4))),inference(variable_rename,[status(thm)],[107])).
% fof(109, 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)],[108])).
% cnf(110,plain,(transfinite_sequence(X1)|~transfinite_sequence_of(X1,X2)),inference(split_conjunct,[status(thm)],[109])).
% cnf(111,plain,(function(X1)|~transfinite_sequence_of(X1,X2)),inference(split_conjunct,[status(thm)],[109])).
% cnf(112,plain,(relation(X1)|~transfinite_sequence_of(X1,X2)),inference(split_conjunct,[status(thm)],[109])).
% fof(218, negated_conjecture,?[X1]:?[X2]:(subset(X1,X2)&?[X3]:(transfinite_sequence_of(X3,X1)&~(transfinite_sequence_of(X3,X2)))),inference(fof_nnf,[status(thm)],[44])).
% fof(219, negated_conjecture,?[X4]:?[X5]:(subset(X4,X5)&?[X6]:(transfinite_sequence_of(X6,X4)&~(transfinite_sequence_of(X6,X5)))),inference(variable_rename,[status(thm)],[218])).
% fof(220, negated_conjecture,(subset(esk17_0,esk18_0)&(transfinite_sequence_of(esk19_0,esk17_0)&~(transfinite_sequence_of(esk19_0,esk18_0)))),inference(skolemize,[status(esa)],[219])).
% cnf(221,negated_conjecture,(~transfinite_sequence_of(esk19_0,esk18_0)),inference(split_conjunct,[status(thm)],[220])).
% cnf(222,negated_conjecture,(transfinite_sequence_of(esk19_0,esk17_0)),inference(split_conjunct,[status(thm)],[220])).
% cnf(223,negated_conjecture,(subset(esk17_0,esk18_0)),inference(split_conjunct,[status(thm)],[220])).
% cnf(232,plain,(subset(relation_rng(X1),X2)|~function(X1)|~relation(X1)|~transfinite_sequence_of(X1,X2)),inference(csr,[status(thm)],[74,110])).
% cnf(233,plain,(subset(relation_rng(X1),X2)|~relation(X1)|~transfinite_sequence_of(X1,X2)),inference(csr,[status(thm)],[232,111])).
% cnf(234,plain,(subset(relation_rng(X1),X2)|~transfinite_sequence_of(X1,X2)),inference(csr,[status(thm)],[233,112])).
% cnf(247,negated_conjecture,(subset(X1,esk18_0)|~subset(X1,esk17_0)),inference(spm,[status(thm)],[57,223,theory(equality)])).
% cnf(312,negated_conjecture,(transfinite_sequence_of(X1,esk18_0)|~transfinite_sequence(X1)|~function(X1)|~relation(X1)|~subset(relation_rng(X1),esk17_0)),inference(spm,[status(thm)],[73,247,theory(equality)])).
% cnf(703,negated_conjecture,(transfinite_sequence_of(X1,esk18_0)|~transfinite_sequence(X1)|~function(X1)|~relation(X1)|~transfinite_sequence_of(X1,esk17_0)),inference(spm,[status(thm)],[312,234,theory(equality)])).
% cnf(2408,negated_conjecture,(transfinite_sequence_of(X1,esk18_0)|~transfinite_sequence(X1)|~function(X1)|~transfinite_sequence_of(X1,esk17_0)),inference(csr,[status(thm)],[703,112])).
% cnf(2409,negated_conjecture,(transfinite_sequence_of(X1,esk18_0)|~transfinite_sequence(X1)|~transfinite_sequence_of(X1,esk17_0)),inference(csr,[status(thm)],[2408,111])).
% cnf(2410,negated_conjecture,(transfinite_sequence_of(X1,esk18_0)|~transfinite_sequence_of(X1,esk17_0)),inference(csr,[status(thm)],[2409,110])).
% cnf(2412,negated_conjecture,(~transfinite_sequence_of(esk19_0,esk17_0)),inference(spm,[status(thm)],[221,2410,theory(equality)])).
% cnf(2424,negated_conjecture,($false),inference(rw,[status(thm)],[2412,222,theory(equality)])).
% cnf(2425,negated_conjecture,($false),inference(cn,[status(thm)],[2424,theory(equality)])).
% cnf(2426,negated_conjecture,($false),2425,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 630
% # ...of these trivial : 14
% # ...subsumed : 281
% # ...remaining for further processing: 335
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 7
% # Backward-rewritten : 22
% # Generated clauses : 1372
% # ...of the previous two non-trivial : 1117
% # Contextual simplify-reflections : 159
% # Paramodulations : 1369
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 223
% # Positive orientable unit clauses: 59
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 154
% # Current number of unprocessed clauses: 583
% # ...number of literals in the above : 2334
% # Clause-clause subsumption calls (NU) : 3880
% # Rec. Clause-clause subsumption calls : 3386
% # Unit Clause-clause subsumption calls : 146
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 19
% # Indexed BW rewrite successes : 11
% # Backwards rewriting index: 174 leaves, 1.24+/-0.669 terms/leaf
% # Paramod-from index: 109 leaves, 1.06+/-0.265 terms/leaf
% # Paramod-into index: 166 leaves, 1.20+/-0.551 terms/leaf
% # -------------------------------------------------
% # User time : 0.069 s
% # System time : 0.007 s
% # Total time : 0.076 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.26 WC
% FINAL PrfWatch: 0.18 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP30091/NUM411+1.tptp
%
%------------------------------------------------------------------------------