%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU198+2 : 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:17 EST 2010
% Result : Theorem 3.73s
% Output : Solution 3.73s
% 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/SystemOnTPTP18042/SEU198+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18042/SEU198+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18042/SEU198+2.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 18138
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.043 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, 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(13, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(191, conjecture,![X1]:![X2]:(relation(X2)=>subset(relation_rng(relation_rng_restriction(X1,X2)),X1)),file('/tmp/SRASS.s.p', t116_relat_1)).
% fof(192, negated_conjecture,~(![X1]:![X2]:(relation(X2)=>subset(relation_rng(relation_rng_restriction(X1,X2)),X1))),inference(assume_negation,[status(cth)],[191])).
% fof(227, 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)],[4])).
% fof(228, 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)],[227])).
% fof(229, 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)],[228])).
% cnf(232,plain,(in(X2,X3)|~relation(X1)|~in(X2,relation_rng(relation_rng_restriction(X3,X1)))),inference(split_conjunct,[status(thm)],[229])).
% fof(266, 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)],[13])).
% fof(267, 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)],[266])).
% fof(268, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[267])).
% fof(269, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[268])).
% fof(270, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[269])).
% cnf(271,plain,(subset(X1,X2)|~in(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[270])).
% cnf(272,plain,(subset(X1,X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[270])).
% fof(986, negated_conjecture,?[X1]:?[X2]:(relation(X2)&~(subset(relation_rng(relation_rng_restriction(X1,X2)),X1))),inference(fof_nnf,[status(thm)],[192])).
% fof(987, negated_conjecture,?[X3]:?[X4]:(relation(X4)&~(subset(relation_rng(relation_rng_restriction(X3,X4)),X3))),inference(variable_rename,[status(thm)],[986])).
% fof(988, negated_conjecture,(relation(esk63_0)&~(subset(relation_rng(relation_rng_restriction(esk62_0,esk63_0)),esk62_0))),inference(skolemize,[status(esa)],[987])).
% cnf(989,negated_conjecture,(~subset(relation_rng(relation_rng_restriction(esk62_0,esk63_0)),esk62_0)),inference(split_conjunct,[status(thm)],[988])).
% cnf(990,negated_conjecture,(relation(esk63_0)),inference(split_conjunct,[status(thm)],[988])).
% cnf(1729,plain,(in(esk1_2(relation_rng(relation_rng_restriction(X1,X2)),X3),X1)|subset(relation_rng(relation_rng_restriction(X1,X2)),X3)|~relation(X2)),inference(spm,[status(thm)],[232,272,theory(equality)])).
% cnf(37324,plain,(subset(relation_rng(relation_rng_restriction(X1,X2)),X1)|~relation(X2)),inference(spm,[status(thm)],[271,1729,theory(equality)])).
% cnf(42625,negated_conjecture,(~relation(esk63_0)),inference(spm,[status(thm)],[989,37324,theory(equality)])).
% cnf(42647,negated_conjecture,($false),inference(rw,[status(thm)],[42625,990,theory(equality)])).
% cnf(42648,negated_conjecture,($false),inference(cn,[status(thm)],[42647,theory(equality)])).
% cnf(42649,negated_conjecture,($false),42648,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 3660
% # ...of these trivial : 29
% # ...subsumed : 2283
% # ...remaining for further processing: 1348
% # Other redundant clauses eliminated : 78
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 47
% # Backward-rewritten : 20
% # Generated clauses : 30922
% # ...of the previous two non-trivial : 25912
% # Contextual simplify-reflections : 761
% # Paramodulations : 30775
% # Factorizations : 14
% # Equation resolutions : 124
% # Current number of processed clauses: 975
% # Positive orientable unit clauses: 71
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 77
% # Non-unit-clauses : 823
% # Current number of unprocessed clauses: 21497
% # ...number of literals in the above : 85365
% # Clause-clause subsumption calls (NU) : 20767
% # Rec. Clause-clause subsumption calls : 17266
% # Unit Clause-clause subsumption calls : 901
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 91
% # Indexed BW rewrite successes : 66
% # Backwards rewriting index: 623 leaves, 1.59+/-2.166 terms/leaf
% # Paramod-from index: 252 leaves, 1.27+/-0.943 terms/leaf
% # Paramod-into index: 584 leaves, 1.48+/-1.697 terms/leaf
% # -------------------------------------------------
% # User time : 1.125 s
% # System time : 0.037 s
% # Total time : 1.162 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.82 CPU 2.03 WC
% FINAL PrfWatch: 1.82 CPU 2.03 WC
% SZS output end Solution for /tmp/SystemOnTPTP18042/SEU198+2.tptp
%
%------------------------------------------------------------------------------