TSTP Solution File: SEU303+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU303+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 : art01.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 03:20:38 EST 2010
% Result : Theorem 1.05s
% Output : Solution 1.05s
% 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/SystemOnTPTP760/SEU303+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP760/SEU303+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP760/SEU303+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 856
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(((relation(X1)&function(X1))&finite(X2))=>finite(relation_image(X1,X2))),file('/tmp/SRASS.s.p', fc13_finset_1)).
% fof(4, axiom,![X1]:(relation(X1)=>relation_image(X1,relation_dom(X1))=relation_rng(X1)),file('/tmp/SRASS.s.p', t146_relat_1)).
% fof(8, conjecture,![X1]:((relation(X1)&function(X1))=>(finite(relation_dom(X1))=>finite(relation_rng(X1)))),file('/tmp/SRASS.s.p', t26_finset_1)).
% fof(9, negated_conjecture,~(![X1]:((relation(X1)&function(X1))=>(finite(relation_dom(X1))=>finite(relation_rng(X1))))),inference(assume_negation,[status(cth)],[8])).
% fof(14, plain,![X1]:![X2]:(((~(relation(X1))|~(function(X1)))|~(finite(X2)))|finite(relation_image(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(15, plain,![X3]:![X4]:(((~(relation(X3))|~(function(X3)))|~(finite(X4)))|finite(relation_image(X3,X4))),inference(variable_rename,[status(thm)],[14])).
% cnf(16,plain,(finite(relation_image(X1,X2))|~finite(X2)|~function(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[15])).
% fof(20, plain,![X1]:(~(relation(X1))|relation_image(X1,relation_dom(X1))=relation_rng(X1)),inference(fof_nnf,[status(thm)],[4])).
% fof(21, plain,![X2]:(~(relation(X2))|relation_image(X2,relation_dom(X2))=relation_rng(X2)),inference(variable_rename,[status(thm)],[20])).
% cnf(22,plain,(relation_image(X1,relation_dom(X1))=relation_rng(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[21])).
% fof(26, negated_conjecture,?[X1]:((relation(X1)&function(X1))&(finite(relation_dom(X1))&~(finite(relation_rng(X1))))),inference(fof_nnf,[status(thm)],[9])).
% fof(27, negated_conjecture,?[X2]:((relation(X2)&function(X2))&(finite(relation_dom(X2))&~(finite(relation_rng(X2))))),inference(variable_rename,[status(thm)],[26])).
% fof(28, negated_conjecture,((relation(esk2_0)&function(esk2_0))&(finite(relation_dom(esk2_0))&~(finite(relation_rng(esk2_0))))),inference(skolemize,[status(esa)],[27])).
% cnf(29,negated_conjecture,(~finite(relation_rng(esk2_0))),inference(split_conjunct,[status(thm)],[28])).
% cnf(30,negated_conjecture,(finite(relation_dom(esk2_0))),inference(split_conjunct,[status(thm)],[28])).
% cnf(31,negated_conjecture,(function(esk2_0)),inference(split_conjunct,[status(thm)],[28])).
% cnf(32,negated_conjecture,(relation(esk2_0)),inference(split_conjunct,[status(thm)],[28])).
% cnf(33,negated_conjecture,(relation_image(esk2_0,relation_dom(esk2_0))=relation_rng(esk2_0)),inference(spm,[status(thm)],[22,32,theory(equality)])).
% cnf(35,negated_conjecture,(finite(relation_image(esk2_0,X1))|~finite(X1)|~relation(esk2_0)),inference(spm,[status(thm)],[16,31,theory(equality)])).
% cnf(37,negated_conjecture,(finite(relation_image(esk2_0,X1))|~finite(X1)|$false),inference(rw,[status(thm)],[35,32,theory(equality)])).
% cnf(38,negated_conjecture,(finite(relation_image(esk2_0,X1))|~finite(X1)),inference(cn,[status(thm)],[37,theory(equality)])).
% cnf(41,negated_conjecture,(finite(relation_image(esk2_0,relation_dom(esk2_0)))),inference(spm,[status(thm)],[38,30,theory(equality)])).
% cnf(42,negated_conjecture,(finite(relation_rng(esk2_0))),inference(rw,[status(thm)],[41,33,theory(equality)])).
% cnf(43,negated_conjecture,($false),inference(sr,[status(thm)],[42,29,theory(equality)])).
% cnf(44,negated_conjecture,($false),43,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 11
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 10
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 5
% # ...of the previous two non-trivial : 4
% # Contextual simplify-reflections : 0
% # Paramodulations : 5
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 10
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 3
% # Current number of unprocessed clauses: 2
% # ...number of literals in the above : 3
% # Clause-clause subsumption calls (NU) : 1
% # Rec. Clause-clause subsumption calls : 1
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 22 leaves, 1.05+/-0.208 terms/leaf
% # Paramod-from index: 6 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 14 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.003 s
% # Total time : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP760/SEU303+1.tptp
%
%------------------------------------------------------------------------------