TSTP Solution File: SEU198+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU198+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 : art09.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 01:41:08 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% 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/SystemOnTPTP17783/SEU198+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17783/SEU198+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17783/SEU198+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 17879
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X1]:![X2]:![X3]:(relation(X3)=>(in(X1,relation_rng(relation_rng_restriction(X2,X3)))<=>(in(X1,X2)&in(X1,relation_rng(X3))))),file('/tmp/SRASS.s.p', t115_relat_1)).
% fof(9, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(31, conjecture,![X1]:![X2]:(relation(X2)=>subset(relation_rng(relation_rng_restriction(X1,X2)),X1)),file('/tmp/SRASS.s.p', t116_relat_1)).
% fof(32, negated_conjecture,~(![X1]:![X2]:(relation(X2)=>subset(relation_rng(relation_rng_restriction(X1,X2)),X1))),inference(assume_negation,[status(cth)],[31])).
% fof(52, plain,![X1]:![X2]:![X3]:(~(relation(X3))|((~(in(X1,relation_rng(relation_rng_restriction(X2,X3))))|(in(X1,X2)&in(X1,relation_rng(X3))))&((~(in(X1,X2))|~(in(X1,relation_rng(X3))))|in(X1,relation_rng(relation_rng_restriction(X2,X3)))))),inference(fof_nnf,[status(thm)],[5])).
% fof(53, plain,![X4]:![X5]:![X6]:(~(relation(X6))|((~(in(X4,relation_rng(relation_rng_restriction(X5,X6))))|(in(X4,X5)&in(X4,relation_rng(X6))))&((~(in(X4,X5))|~(in(X4,relation_rng(X6))))|in(X4,relation_rng(relation_rng_restriction(X5,X6)))))),inference(variable_rename,[status(thm)],[52])).
% fof(54, plain,![X4]:![X5]:![X6]:((((in(X4,X5)|~(in(X4,relation_rng(relation_rng_restriction(X5,X6)))))|~(relation(X6)))&((in(X4,relation_rng(X6))|~(in(X4,relation_rng(relation_rng_restriction(X5,X6)))))|~(relation(X6))))&(((~(in(X4,X5))|~(in(X4,relation_rng(X6))))|in(X4,relation_rng(relation_rng_restriction(X5,X6))))|~(relation(X6)))),inference(distribute,[status(thm)],[53])).
% cnf(57,plain,(in(X2,X3)|~relation(X1)|~in(X2,relation_rng(relation_rng_restriction(X3,X1)))),inference(split_conjunct,[status(thm)],[54])).
% fof(69, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(in(X3,X1))|in(X3,X2)))&(?[X3]:(in(X3,X1)&~(in(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[9])).
% fof(70, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&(?[X7]:(in(X7,X4)&~(in(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[69])).
% fof(71, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk3_2(X4,X5),X4)&~(in(esk3_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[70])).
% fof(72, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk3_2(X4,X5),X4)&~(in(esk3_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[71])).
% fof(73, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk3_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk3_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[72])).
% cnf(74,plain,(subset(X1,X2)|~in(esk3_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[73])).
% cnf(75,plain,(subset(X1,X2)|in(esk3_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[73])).
% fof(133, negated_conjecture,?[X1]:?[X2]:(relation(X2)&~(subset(relation_rng(relation_rng_restriction(X1,X2)),X1))),inference(fof_nnf,[status(thm)],[32])).
% fof(134, negated_conjecture,?[X3]:?[X4]:(relation(X4)&~(subset(relation_rng(relation_rng_restriction(X3,X4)),X3))),inference(variable_rename,[status(thm)],[133])).
% fof(135, negated_conjecture,(relation(esk10_0)&~(subset(relation_rng(relation_rng_restriction(esk9_0,esk10_0)),esk9_0))),inference(skolemize,[status(esa)],[134])).
% cnf(136,negated_conjecture,(~subset(relation_rng(relation_rng_restriction(esk9_0,esk10_0)),esk9_0)),inference(split_conjunct,[status(thm)],[135])).
% cnf(137,negated_conjecture,(relation(esk10_0)),inference(split_conjunct,[status(thm)],[135])).
% cnf(176,plain,(in(esk3_2(relation_rng(relation_rng_restriction(X1,X2)),X3),X1)|subset(relation_rng(relation_rng_restriction(X1,X2)),X3)|~relation(X2)),inference(pm,[status(thm)],[57,75,theory(equality)])).
% cnf(326,negated_conjecture,(in(esk3_2(relation_rng(relation_rng_restriction(X1,esk10_0)),X2),X1)|subset(relation_rng(relation_rng_restriction(X1,esk10_0)),X2)),inference(pm,[status(thm)],[176,137,theory(equality)])).
% cnf(758,negated_conjecture,(subset(relation_rng(relation_rng_restriction(X1,esk10_0)),X1)),inference(pm,[status(thm)],[74,326,theory(equality)])).
% cnf(778,negated_conjecture,($false),inference(rw,[status(thm)],[136,758,theory(equality)])).
% cnf(779,negated_conjecture,($false),inference(cn,[status(thm)],[778,theory(equality)])).
% cnf(780,negated_conjecture,($false),779,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 195
% # ...of these trivial : 3
% # ...subsumed : 38
% # ...remaining for further processing: 154
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 27
% # Generated clauses : 476
% # ...of the previous two non-trivial : 404
% # Contextual simplify-reflections : 0
% # Paramodulations : 464
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 127
% # Positive orientable unit clauses: 33
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 84
% # Current number of unprocessed clauses: 190
% # ...number of literals in the above : 485
% # Clause-clause subsumption calls (NU) : 178
% # Rec. Clause-clause subsumption calls : 165
% # Unit Clause-clause subsumption calls : 289
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 40
% # Indexed BW rewrite successes : 14
% # Backwards rewriting index: 138 leaves, 1.46+/-0.861 terms/leaf
% # Paramod-from index: 54 leaves, 1.07+/-0.424 terms/leaf
% # Paramod-into index: 120 leaves, 1.27+/-0.605 terms/leaf
% # -------------------------------------------------
% # User time : 0.031 s
% # System time : 0.002 s
% # Total time : 0.033 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.20 WC
% FINAL PrfWatch: 0.13 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP17783/SEU198+1.tptp
%
%------------------------------------------------------------------------------