TSTP Solution File: NUM410+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM410+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:25 EST 2010
% Result : Theorem 0.97s
% Output : Solution 0.97s
% 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/SystemOnTPTP29832/NUM410+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29832/NUM410+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29832/NUM410+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 29928
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:((relation(X1)&function(X1))=>(transfinite_sequence(X1)<=>ordinal(relation_dom(X1)))),file('/tmp/SRASS.s.p', d7_ordinal1)).
% fof(10, 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(23, axiom,![X1]:![X2]:subset(X1,X1),file('/tmp/SRASS.s.p', reflexivity_r1_tarski)).
% fof(45, conjecture,![X1]:((relation(X1)&function(X1))=>(ordinal(relation_dom(X1))=>transfinite_sequence_of(X1,relation_rng(X1)))),file('/tmp/SRASS.s.p', t46_ordinal1)).
% fof(46, negated_conjecture,~(![X1]:((relation(X1)&function(X1))=>(ordinal(relation_dom(X1))=>transfinite_sequence_of(X1,relation_rng(X1))))),inference(assume_negation,[status(cth)],[45])).
% fof(60, plain,![X1]:((~(relation(X1))|~(function(X1)))|((~(transfinite_sequence(X1))|ordinal(relation_dom(X1)))&(~(ordinal(relation_dom(X1)))|transfinite_sequence(X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(61, plain,![X2]:((~(relation(X2))|~(function(X2)))|((~(transfinite_sequence(X2))|ordinal(relation_dom(X2)))&(~(ordinal(relation_dom(X2)))|transfinite_sequence(X2)))),inference(variable_rename,[status(thm)],[60])).
% fof(62, plain,![X2]:(((~(transfinite_sequence(X2))|ordinal(relation_dom(X2)))|(~(relation(X2))|~(function(X2))))&((~(ordinal(relation_dom(X2)))|transfinite_sequence(X2))|(~(relation(X2))|~(function(X2))))),inference(distribute,[status(thm)],[61])).
% cnf(63,plain,(transfinite_sequence(X1)|~function(X1)|~relation(X1)|~ordinal(relation_dom(X1))),inference(split_conjunct,[status(thm)],[62])).
% fof(92, 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)],[10])).
% fof(93, 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)],[92])).
% fof(94, 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)],[93])).
% cnf(95,plain,(transfinite_sequence_of(X1,X2)|~transfinite_sequence(X1)|~function(X1)|~relation(X1)|~subset(relation_rng(X1),X2)),inference(split_conjunct,[status(thm)],[94])).
% fof(144, plain,![X3]:![X4]:subset(X3,X3),inference(variable_rename,[status(thm)],[23])).
% cnf(145,plain,(subset(X1,X1)),inference(split_conjunct,[status(thm)],[144])).
% fof(231, negated_conjecture,?[X1]:((relation(X1)&function(X1))&(ordinal(relation_dom(X1))&~(transfinite_sequence_of(X1,relation_rng(X1))))),inference(fof_nnf,[status(thm)],[46])).
% fof(232, negated_conjecture,?[X2]:((relation(X2)&function(X2))&(ordinal(relation_dom(X2))&~(transfinite_sequence_of(X2,relation_rng(X2))))),inference(variable_rename,[status(thm)],[231])).
% fof(233, negated_conjecture,((relation(esk17_0)&function(esk17_0))&(ordinal(relation_dom(esk17_0))&~(transfinite_sequence_of(esk17_0,relation_rng(esk17_0))))),inference(skolemize,[status(esa)],[232])).
% cnf(234,negated_conjecture,(~transfinite_sequence_of(esk17_0,relation_rng(esk17_0))),inference(split_conjunct,[status(thm)],[233])).
% cnf(235,negated_conjecture,(ordinal(relation_dom(esk17_0))),inference(split_conjunct,[status(thm)],[233])).
% cnf(236,negated_conjecture,(function(esk17_0)),inference(split_conjunct,[status(thm)],[233])).
% cnf(237,negated_conjecture,(relation(esk17_0)),inference(split_conjunct,[status(thm)],[233])).
% cnf(257,negated_conjecture,(transfinite_sequence(esk17_0)|~function(esk17_0)|~relation(esk17_0)),inference(spm,[status(thm)],[63,235,theory(equality)])).
% cnf(259,negated_conjecture,(transfinite_sequence(esk17_0)|$false|~relation(esk17_0)),inference(rw,[status(thm)],[257,236,theory(equality)])).
% cnf(260,negated_conjecture,(transfinite_sequence(esk17_0)|$false|$false),inference(rw,[status(thm)],[259,237,theory(equality)])).
% cnf(261,negated_conjecture,(transfinite_sequence(esk17_0)),inference(cn,[status(thm)],[260,theory(equality)])).
% cnf(296,plain,(transfinite_sequence_of(X1,relation_rng(X1))|~transfinite_sequence(X1)|~function(X1)|~relation(X1)),inference(spm,[status(thm)],[95,145,theory(equality)])).
% cnf(432,negated_conjecture,(~transfinite_sequence(esk17_0)|~function(esk17_0)|~relation(esk17_0)),inference(spm,[status(thm)],[234,296,theory(equality)])).
% cnf(440,negated_conjecture,($false|~function(esk17_0)|~relation(esk17_0)),inference(rw,[status(thm)],[432,261,theory(equality)])).
% cnf(441,negated_conjecture,($false|$false|~relation(esk17_0)),inference(rw,[status(thm)],[440,236,theory(equality)])).
% cnf(442,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[441,237,theory(equality)])).
% cnf(443,negated_conjecture,($false),inference(cn,[status(thm)],[442,theory(equality)])).
% cnf(444,negated_conjecture,($false),443,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 214
% # ...of these trivial : 7
% # ...subsumed : 3
% # ...remaining for further processing: 204
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 15
% # Generated clauses : 110
% # ...of the previous two non-trivial : 68
% # Contextual simplify-reflections : 6
% # Paramodulations : 110
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 101
% # Positive orientable unit clauses: 48
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 49
% # Current number of unprocessed clauses: 21
% # ...number of literals in the above : 70
% # Clause-clause subsumption calls (NU) : 70
% # Rec. Clause-clause subsumption calls : 66
% # Unit Clause-clause subsumption calls : 11
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 103 leaves, 1.10+/-0.430 terms/leaf
% # Paramod-from index: 73 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 97 leaves, 1.04+/-0.199 terms/leaf
% # -------------------------------------------------
% # User time : 0.024 s
% # System time : 0.002 s
% # Total time : 0.026 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.20 WC
% FINAL PrfWatch: 0.11 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP29832/NUM410+1.tptp
%
%------------------------------------------------------------------------------