%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU200+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 : art02.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:42:11 EST 2010
% Result : Theorem 2.37s
% Output : Solution 2.37s
% 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/SystemOnTPTP4480/SEU200+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP4480/SEU200+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4480/SEU200+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 4576
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.042 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(relation(X2)=>relation(relation_rng_restriction(X1,X2))),file('/tmp/SRASS.s.p', dt_k8_relat_1)).
% fof(4, axiom,![X1]:![X2]:(relation(X2)=>subset(relation_rng_restriction(X1,X2),X2)),file('/tmp/SRASS.s.p', t117_relat_1)).
% fof(7, axiom,![X1]:(relation(X1)=>![X2]:(relation(X2)=>(subset(X1,X2)=>(subset(relation_dom(X1),relation_dom(X2))&subset(relation_rng(X1),relation_rng(X2)))))),file('/tmp/SRASS.s.p', t25_relat_1)).
% fof(193, conjecture,![X1]:![X2]:(relation(X2)=>subset(relation_rng(relation_rng_restriction(X1,X2)),relation_rng(X2))),file('/tmp/SRASS.s.p', t118_relat_1)).
% fof(194, negated_conjecture,~(![X1]:![X2]:(relation(X2)=>subset(relation_rng(relation_rng_restriction(X1,X2)),relation_rng(X2)))),inference(assume_negation,[status(cth)],[193])).
% fof(221, plain,![X1]:![X2]:(~(relation(X2))|relation(relation_rng_restriction(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(222, plain,![X3]:![X4]:(~(relation(X4))|relation(relation_rng_restriction(X3,X4))),inference(variable_rename,[status(thm)],[221])).
% cnf(223,plain,(relation(relation_rng_restriction(X1,X2))|~relation(X2)),inference(split_conjunct,[status(thm)],[222])).
% fof(229, plain,![X1]:![X2]:(~(relation(X2))|subset(relation_rng_restriction(X1,X2),X2)),inference(fof_nnf,[status(thm)],[4])).
% fof(230, plain,![X3]:![X4]:(~(relation(X4))|subset(relation_rng_restriction(X3,X4),X4)),inference(variable_rename,[status(thm)],[229])).
% cnf(231,plain,(subset(relation_rng_restriction(X1,X2),X2)|~relation(X2)),inference(split_conjunct,[status(thm)],[230])).
% fof(241, plain,![X1]:(~(relation(X1))|![X2]:(~(relation(X2))|(~(subset(X1,X2))|(subset(relation_dom(X1),relation_dom(X2))&subset(relation_rng(X1),relation_rng(X2)))))),inference(fof_nnf,[status(thm)],[7])).
% fof(242, plain,![X3]:(~(relation(X3))|![X4]:(~(relation(X4))|(~(subset(X3,X4))|(subset(relation_dom(X3),relation_dom(X4))&subset(relation_rng(X3),relation_rng(X4)))))),inference(variable_rename,[status(thm)],[241])).
% fof(243, plain,![X3]:![X4]:((~(relation(X4))|(~(subset(X3,X4))|(subset(relation_dom(X3),relation_dom(X4))&subset(relation_rng(X3),relation_rng(X4)))))|~(relation(X3))),inference(shift_quantors,[status(thm)],[242])).
% fof(244, plain,![X3]:![X4]:((((subset(relation_dom(X3),relation_dom(X4))|~(subset(X3,X4)))|~(relation(X4)))|~(relation(X3)))&(((subset(relation_rng(X3),relation_rng(X4))|~(subset(X3,X4)))|~(relation(X4)))|~(relation(X3)))),inference(distribute,[status(thm)],[243])).
% cnf(245,plain,(subset(relation_rng(X1),relation_rng(X2))|~relation(X1)|~relation(X2)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[244])).
% fof(994, negated_conjecture,?[X1]:?[X2]:(relation(X2)&~(subset(relation_rng(relation_rng_restriction(X1,X2)),relation_rng(X2)))),inference(fof_nnf,[status(thm)],[194])).
% fof(995, negated_conjecture,?[X3]:?[X4]:(relation(X4)&~(subset(relation_rng(relation_rng_restriction(X3,X4)),relation_rng(X4)))),inference(variable_rename,[status(thm)],[994])).
% fof(996, negated_conjecture,(relation(esk63_0)&~(subset(relation_rng(relation_rng_restriction(esk62_0,esk63_0)),relation_rng(esk63_0)))),inference(skolemize,[status(esa)],[995])).
% cnf(997,negated_conjecture,(~subset(relation_rng(relation_rng_restriction(esk62_0,esk63_0)),relation_rng(esk63_0))),inference(split_conjunct,[status(thm)],[996])).
% cnf(998,negated_conjecture,(relation(esk63_0)),inference(split_conjunct,[status(thm)],[996])).
% cnf(1314,negated_conjecture,(~subset(relation_rng_restriction(esk62_0,esk63_0),esk63_0)|~relation(esk63_0)|~relation(relation_rng_restriction(esk62_0,esk63_0))),inference(spm,[status(thm)],[997,245,theory(equality)])).
% cnf(1321,negated_conjecture,(~subset(relation_rng_restriction(esk62_0,esk63_0),esk63_0)|$false|~relation(relation_rng_restriction(esk62_0,esk63_0))),inference(rw,[status(thm)],[1314,998,theory(equality)])).
% cnf(1322,negated_conjecture,(~subset(relation_rng_restriction(esk62_0,esk63_0),esk63_0)|~relation(relation_rng_restriction(esk62_0,esk63_0))),inference(cn,[status(thm)],[1321,theory(equality)])).
% cnf(5382,negated_conjecture,(~relation(relation_rng_restriction(esk62_0,esk63_0))|~relation(esk63_0)),inference(spm,[status(thm)],[1322,231,theory(equality)])).
% cnf(5383,negated_conjecture,(~relation(relation_rng_restriction(esk62_0,esk63_0))|$false),inference(rw,[status(thm)],[5382,998,theory(equality)])).
% cnf(5384,negated_conjecture,(~relation(relation_rng_restriction(esk62_0,esk63_0))),inference(cn,[status(thm)],[5383,theory(equality)])).
% cnf(5387,negated_conjecture,(~relation(esk63_0)),inference(spm,[status(thm)],[5384,223,theory(equality)])).
% cnf(5388,negated_conjecture,($false),inference(rw,[status(thm)],[5387,998,theory(equality)])).
% cnf(5389,negated_conjecture,($false),inference(cn,[status(thm)],[5388,theory(equality)])).
% cnf(5390,negated_conjecture,($false),5389,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 629
% # ...of these trivial : 3
% # ...subsumed : 21
% # ...remaining for further processing: 605
% # Other redundant clauses eliminated : 54
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 3810
% # ...of the previous two non-trivial : 3578
% # Contextual simplify-reflections : 6
% # Paramodulations : 3722
% # Factorizations : 14
% # Equation resolutions : 74
% # Current number of processed clauses: 300
% # Positive orientable unit clauses: 31
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 8
% # Non-unit-clauses : 258
% # Current number of unprocessed clauses: 3571
% # ...number of literals in the above : 15970
% # Clause-clause subsumption calls (NU) : 4708
% # Rec. Clause-clause subsumption calls : 1649
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 64
% # Indexed BW rewrite successes : 53
% # Backwards rewriting index: 317 leaves, 1.70+/-2.799 terms/leaf
% # Paramod-from index: 130 leaves, 1.23+/-0.981 terms/leaf
% # Paramod-into index: 286 leaves, 1.54+/-2.152 terms/leaf
% # -------------------------------------------------
% # User time : 0.225 s
% # System time : 0.008 s
% # Total time : 0.233 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.42 CPU 0.51 WC
% FINAL PrfWatch: 0.42 CPU 0.51 WC
% SZS output end Solution for /tmp/SystemOnTPTP4480/SEU200+2.tptp
%
%------------------------------------------------------------------------------