TSTP Solution File: NUM412+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM412+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:39 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/SystemOnTPTP16004/NUM412+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16004/NUM412+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16004/NUM412+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 16100
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(transfinite_sequence_of(X2,X1)=>((relation(X2)&function(X2))&transfinite_sequence(X2))),file('/tmp/SRASS.s.p', dt_m1_ordinal1)).
% fof(6, axiom,![X1]:![X2]:(subset(X1,X2)=>![X3]:(transfinite_sequence_of(X3,X1)=>transfinite_sequence_of(X3,X2))),file('/tmp/SRASS.s.p', t47_ordinal1)).
% fof(7, axiom,![X1]:![X2]:((((relation(X1)&function(X1))&transfinite_sequence(X1))&ordinal(X2))=>transfinite_sequence_of(tseq_dom_restriction(X1,X2),relation_rng(X1))),file('/tmp/SRASS.s.p', dt_k2_ordinal1)).
% fof(8, 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(48, conjecture,![X1]:![X2]:(transfinite_sequence_of(X2,X1)=>![X3]:(ordinal(X3)=>transfinite_sequence_of(tseq_dom_restriction(X2,X3),X1))),file('/tmp/SRASS.s.p', t48_ordinal1)).
% fof(49, negated_conjecture,~(![X1]:![X2]:(transfinite_sequence_of(X2,X1)=>![X3]:(ordinal(X3)=>transfinite_sequence_of(tseq_dom_restriction(X2,X3),X1)))),inference(assume_negation,[status(cth)],[48])).
% fof(58, plain,![X1]:![X2]:(~(transfinite_sequence_of(X2,X1))|((relation(X2)&function(X2))&transfinite_sequence(X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(59, plain,![X3]:![X4]:(~(transfinite_sequence_of(X4,X3))|((relation(X4)&function(X4))&transfinite_sequence(X4))),inference(variable_rename,[status(thm)],[58])).
% fof(60, 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)],[59])).
% cnf(61,plain,(transfinite_sequence(X1)|~transfinite_sequence_of(X1,X2)),inference(split_conjunct,[status(thm)],[60])).
% cnf(62,plain,(function(X1)|~transfinite_sequence_of(X1,X2)),inference(split_conjunct,[status(thm)],[60])).
% cnf(63,plain,(relation(X1)|~transfinite_sequence_of(X1,X2)),inference(split_conjunct,[status(thm)],[60])).
% fof(75, plain,![X1]:![X2]:(~(subset(X1,X2))|![X3]:(~(transfinite_sequence_of(X3,X1))|transfinite_sequence_of(X3,X2))),inference(fof_nnf,[status(thm)],[6])).
% fof(76, plain,![X4]:![X5]:(~(subset(X4,X5))|![X6]:(~(transfinite_sequence_of(X6,X4))|transfinite_sequence_of(X6,X5))),inference(variable_rename,[status(thm)],[75])).
% fof(77, plain,![X4]:![X5]:![X6]:((~(transfinite_sequence_of(X6,X4))|transfinite_sequence_of(X6,X5))|~(subset(X4,X5))),inference(shift_quantors,[status(thm)],[76])).
% cnf(78,plain,(transfinite_sequence_of(X3,X2)|~subset(X1,X2)|~transfinite_sequence_of(X3,X1)),inference(split_conjunct,[status(thm)],[77])).
% fof(79, plain,![X1]:![X2]:((((~(relation(X1))|~(function(X1)))|~(transfinite_sequence(X1)))|~(ordinal(X2)))|transfinite_sequence_of(tseq_dom_restriction(X1,X2),relation_rng(X1))),inference(fof_nnf,[status(thm)],[7])).
% fof(80, plain,![X3]:![X4]:((((~(relation(X3))|~(function(X3)))|~(transfinite_sequence(X3)))|~(ordinal(X4)))|transfinite_sequence_of(tseq_dom_restriction(X3,X4),relation_rng(X3))),inference(variable_rename,[status(thm)],[79])).
% cnf(81,plain,(transfinite_sequence_of(tseq_dom_restriction(X1,X2),relation_rng(X1))|~ordinal(X2)|~transfinite_sequence(X1)|~function(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[80])).
% fof(82, 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)],[8])).
% fof(83, 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)],[82])).
% fof(84, 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)],[83])).
% cnf(86,plain,(subset(relation_rng(X1),X2)|~transfinite_sequence(X1)|~function(X1)|~relation(X1)|~transfinite_sequence_of(X1,X2)),inference(split_conjunct,[status(thm)],[84])).
% fof(243, negated_conjecture,?[X1]:?[X2]:(transfinite_sequence_of(X2,X1)&?[X3]:(ordinal(X3)&~(transfinite_sequence_of(tseq_dom_restriction(X2,X3),X1)))),inference(fof_nnf,[status(thm)],[49])).
% fof(244, negated_conjecture,?[X4]:?[X5]:(transfinite_sequence_of(X5,X4)&?[X6]:(ordinal(X6)&~(transfinite_sequence_of(tseq_dom_restriction(X5,X6),X4)))),inference(variable_rename,[status(thm)],[243])).
% fof(245, negated_conjecture,(transfinite_sequence_of(esk18_0,esk17_0)&(ordinal(esk19_0)&~(transfinite_sequence_of(tseq_dom_restriction(esk18_0,esk19_0),esk17_0)))),inference(skolemize,[status(esa)],[244])).
% cnf(246,negated_conjecture,(~transfinite_sequence_of(tseq_dom_restriction(esk18_0,esk19_0),esk17_0)),inference(split_conjunct,[status(thm)],[245])).
% cnf(247,negated_conjecture,(ordinal(esk19_0)),inference(split_conjunct,[status(thm)],[245])).
% cnf(248,negated_conjecture,(transfinite_sequence_of(esk18_0,esk17_0)),inference(split_conjunct,[status(thm)],[245])).
% cnf(259,plain,(subset(relation_rng(X1),X2)|~function(X1)|~relation(X1)|~transfinite_sequence_of(X1,X2)),inference(csr,[status(thm)],[86,61])).
% cnf(260,plain,(subset(relation_rng(X1),X2)|~relation(X1)|~transfinite_sequence_of(X1,X2)),inference(csr,[status(thm)],[259,62])).
% cnf(261,plain,(subset(relation_rng(X1),X2)|~transfinite_sequence_of(X1,X2)),inference(csr,[status(thm)],[260,63])).
% cnf(307,plain,(transfinite_sequence_of(X1,X2)|~transfinite_sequence_of(X1,relation_rng(X3))|~transfinite_sequence_of(X3,X2)),inference(spm,[status(thm)],[78,261,theory(equality)])).
% cnf(470,plain,(transfinite_sequence_of(tseq_dom_restriction(X1,X2),X3)|~transfinite_sequence_of(X1,X3)|~ordinal(X2)|~transfinite_sequence(X1)|~function(X1)|~relation(X1)),inference(spm,[status(thm)],[307,81,theory(equality)])).
% cnf(1774,plain,(transfinite_sequence_of(tseq_dom_restriction(X1,X2),X3)|~ordinal(X2)|~transfinite_sequence(X1)|~function(X1)|~transfinite_sequence_of(X1,X3)),inference(csr,[status(thm)],[470,63])).
% cnf(1775,plain,(transfinite_sequence_of(tseq_dom_restriction(X1,X2),X3)|~ordinal(X2)|~transfinite_sequence(X1)|~transfinite_sequence_of(X1,X3)),inference(csr,[status(thm)],[1774,62])).
% cnf(1776,plain,(transfinite_sequence_of(tseq_dom_restriction(X1,X2),X3)|~ordinal(X2)|~transfinite_sequence_of(X1,X3)),inference(csr,[status(thm)],[1775,61])).
% cnf(1788,negated_conjecture,(~ordinal(esk19_0)|~transfinite_sequence_of(esk18_0,esk17_0)),inference(spm,[status(thm)],[246,1776,theory(equality)])).
% cnf(1793,negated_conjecture,($false|~transfinite_sequence_of(esk18_0,esk17_0)),inference(rw,[status(thm)],[1788,247,theory(equality)])).
% cnf(1794,negated_conjecture,($false|$false),inference(rw,[status(thm)],[1793,248,theory(equality)])).
% cnf(1795,negated_conjecture,($false),inference(cn,[status(thm)],[1794,theory(equality)])).
% cnf(1796,negated_conjecture,($false),1795,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 450
% # ...of these trivial : 8
% # ...subsumed : 130
% # ...remaining for further processing: 312
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 25
% # Generated clauses : 899
% # ...of the previous two non-trivial : 707
% # Contextual simplify-reflections : 43
% # Paramodulations : 896
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 197
% # Positive orientable unit clauses: 53
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 135
% # Current number of unprocessed clauses: 383
% # ...number of literals in the above : 1556
% # Clause-clause subsumption calls (NU) : 1548
% # Rec. Clause-clause subsumption calls : 1438
% # Unit Clause-clause subsumption calls : 148
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 13
% # Indexed BW rewrite successes : 12
% # Backwards rewriting index: 176 leaves, 1.16+/-0.512 terms/leaf
% # Paramod-from index: 124 leaves, 1.02+/-0.154 terms/leaf
% # Paramod-into index: 169 leaves, 1.11+/-0.384 terms/leaf
% # -------------------------------------------------
% # User time : 0.053 s
% # System time : 0.003 s
% # Total time : 0.056 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.24 WC
% FINAL PrfWatch: 0.16 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP16004/NUM412+1.tptp
%
%------------------------------------------------------------------------------