%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU189+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 : 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 : Thu Dec 30 01:36:22 EST 2010
% Result : Theorem 0.90s
% Output : Solution 0.90s
% 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/SystemOnTPTP28240/SEU189+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP28240/SEU189+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28240/SEU189+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 28336
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(empty(X1)=>X1=empty_set),file('/tmp/SRASS.s.p', t6_boole)).
% fof(4, axiom,![X1]:((~(empty(X1))&relation(X1))=>~(empty(relation_dom(X1)))),file('/tmp/SRASS.s.p', fc5_relat_1)).
% fof(5, axiom,![X1]:((~(empty(X1))&relation(X1))=>~(empty(relation_rng(X1)))),file('/tmp/SRASS.s.p', fc6_relat_1)).
% fof(6, axiom,![X1]:(empty(X1)=>(empty(relation_dom(X1))&relation(relation_dom(X1)))),file('/tmp/SRASS.s.p', fc7_relat_1)).
% fof(7, axiom,![X1]:(empty(X1)=>(empty(relation_rng(X1))&relation(relation_rng(X1)))),file('/tmp/SRASS.s.p', fc8_relat_1)).
% fof(9, axiom,![X1]:![X2]:~(((empty(X1)&~(X1=X2))&empty(X2))),file('/tmp/SRASS.s.p', t8_boole)).
% fof(11, axiom,?[X1]:(empty(X1)&relation(X1)),file('/tmp/SRASS.s.p', rc1_relat_1)).
% fof(14, axiom,?[X1]:empty(X1),file('/tmp/SRASS.s.p', rc1_xboole_0)).
% fof(25, conjecture,![X1]:(relation(X1)=>(relation_dom(X1)=empty_set<=>relation_rng(X1)=empty_set)),file('/tmp/SRASS.s.p', t65_relat_1)).
% fof(26, negated_conjecture,~(![X1]:(relation(X1)=>(relation_dom(X1)=empty_set<=>relation_rng(X1)=empty_set))),inference(assume_negation,[status(cth)],[25])).
% fof(27, plain,![X1]:((~(empty(X1))&relation(X1))=>~(empty(relation_dom(X1)))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(28, plain,![X1]:((~(empty(X1))&relation(X1))=>~(empty(relation_rng(X1)))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(39, plain,![X1]:(~(empty(X1))|X1=empty_set),inference(fof_nnf,[status(thm)],[3])).
% fof(40, plain,![X2]:(~(empty(X2))|X2=empty_set),inference(variable_rename,[status(thm)],[39])).
% cnf(41,plain,(X1=empty_set|~empty(X1)),inference(split_conjunct,[status(thm)],[40])).
% fof(42, plain,![X1]:((empty(X1)|~(relation(X1)))|~(empty(relation_dom(X1)))),inference(fof_nnf,[status(thm)],[27])).
% fof(43, plain,![X2]:((empty(X2)|~(relation(X2)))|~(empty(relation_dom(X2)))),inference(variable_rename,[status(thm)],[42])).
% cnf(44,plain,(empty(X1)|~empty(relation_dom(X1))|~relation(X1)),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X1]:((empty(X1)|~(relation(X1)))|~(empty(relation_rng(X1)))),inference(fof_nnf,[status(thm)],[28])).
% fof(46, plain,![X2]:((empty(X2)|~(relation(X2)))|~(empty(relation_rng(X2)))),inference(variable_rename,[status(thm)],[45])).
% cnf(47,plain,(empty(X1)|~empty(relation_rng(X1))|~relation(X1)),inference(split_conjunct,[status(thm)],[46])).
% fof(48, plain,![X1]:(~(empty(X1))|(empty(relation_dom(X1))&relation(relation_dom(X1)))),inference(fof_nnf,[status(thm)],[6])).
% fof(49, plain,![X2]:(~(empty(X2))|(empty(relation_dom(X2))&relation(relation_dom(X2)))),inference(variable_rename,[status(thm)],[48])).
% fof(50, plain,![X2]:((empty(relation_dom(X2))|~(empty(X2)))&(relation(relation_dom(X2))|~(empty(X2)))),inference(distribute,[status(thm)],[49])).
% cnf(52,plain,(empty(relation_dom(X1))|~empty(X1)),inference(split_conjunct,[status(thm)],[50])).
% fof(53, plain,![X1]:(~(empty(X1))|(empty(relation_rng(X1))&relation(relation_rng(X1)))),inference(fof_nnf,[status(thm)],[7])).
% fof(54, plain,![X2]:(~(empty(X2))|(empty(relation_rng(X2))&relation(relation_rng(X2)))),inference(variable_rename,[status(thm)],[53])).
% fof(55, plain,![X2]:((empty(relation_rng(X2))|~(empty(X2)))&(relation(relation_rng(X2))|~(empty(X2)))),inference(distribute,[status(thm)],[54])).
% cnf(57,plain,(empty(relation_rng(X1))|~empty(X1)),inference(split_conjunct,[status(thm)],[55])).
% fof(60, plain,![X1]:![X2]:((~(empty(X1))|X1=X2)|~(empty(X2))),inference(fof_nnf,[status(thm)],[9])).
% fof(61, plain,![X3]:![X4]:((~(empty(X3))|X3=X4)|~(empty(X4))),inference(variable_rename,[status(thm)],[60])).
% cnf(62,plain,(X2=X1|~empty(X1)|~empty(X2)),inference(split_conjunct,[status(thm)],[61])).
% fof(64, plain,?[X2]:(empty(X2)&relation(X2)),inference(variable_rename,[status(thm)],[11])).
% fof(65, plain,(empty(esk1_0)&relation(esk1_0)),inference(skolemize,[status(esa)],[64])).
% cnf(67,plain,(empty(esk1_0)),inference(split_conjunct,[status(thm)],[65])).
% fof(75, plain,?[X2]:empty(X2),inference(variable_rename,[status(thm)],[14])).
% fof(76, plain,empty(esk3_0),inference(skolemize,[status(esa)],[75])).
% cnf(77,plain,(empty(esk3_0)),inference(split_conjunct,[status(thm)],[76])).
% fof(100, negated_conjecture,?[X1]:(relation(X1)&((~(relation_dom(X1)=empty_set)|~(relation_rng(X1)=empty_set))&(relation_dom(X1)=empty_set|relation_rng(X1)=empty_set))),inference(fof_nnf,[status(thm)],[26])).
% fof(101, negated_conjecture,?[X2]:(relation(X2)&((~(relation_dom(X2)=empty_set)|~(relation_rng(X2)=empty_set))&(relation_dom(X2)=empty_set|relation_rng(X2)=empty_set))),inference(variable_rename,[status(thm)],[100])).
% fof(102, negated_conjecture,(relation(esk6_0)&((~(relation_dom(esk6_0)=empty_set)|~(relation_rng(esk6_0)=empty_set))&(relation_dom(esk6_0)=empty_set|relation_rng(esk6_0)=empty_set))),inference(skolemize,[status(esa)],[101])).
% cnf(103,negated_conjecture,(relation_rng(esk6_0)=empty_set|relation_dom(esk6_0)=empty_set),inference(split_conjunct,[status(thm)],[102])).
% cnf(104,negated_conjecture,(relation_rng(esk6_0)!=empty_set|relation_dom(esk6_0)!=empty_set),inference(split_conjunct,[status(thm)],[102])).
% cnf(105,negated_conjecture,(relation(esk6_0)),inference(split_conjunct,[status(thm)],[102])).
% cnf(108,plain,(empty_set=esk3_0),inference(spm,[status(thm)],[41,77,theory(equality)])).
% cnf(152,plain,(X1=esk1_0|~empty(X1)),inference(spm,[status(thm)],[62,67,theory(equality)])).
% cnf(162,negated_conjecture,(relation_dom(esk6_0)!=esk3_0|relation_rng(esk6_0)!=empty_set),inference(rw,[status(thm)],[104,108,theory(equality)])).
% cnf(163,negated_conjecture,(relation_dom(esk6_0)!=esk3_0|relation_rng(esk6_0)!=esk3_0),inference(rw,[status(thm)],[162,108,theory(equality)])).
% cnf(165,negated_conjecture,(relation_dom(esk6_0)=esk3_0|relation_rng(esk6_0)=empty_set),inference(rw,[status(thm)],[103,108,theory(equality)])).
% cnf(166,negated_conjecture,(relation_dom(esk6_0)=esk3_0|relation_rng(esk6_0)=esk3_0),inference(rw,[status(thm)],[165,108,theory(equality)])).
% cnf(186,plain,(esk3_0=esk1_0),inference(spm,[status(thm)],[152,77,theory(equality)])).
% cnf(187,plain,(relation_rng(X1)=esk1_0|~empty(X1)),inference(spm,[status(thm)],[152,57,theory(equality)])).
% cnf(188,plain,(relation_dom(X1)=esk1_0|~empty(X1)),inference(spm,[status(thm)],[152,52,theory(equality)])).
% cnf(191,negated_conjecture,(relation_dom(esk6_0)!=esk1_0|relation_rng(esk6_0)!=esk3_0),inference(rw,[status(thm)],[163,186,theory(equality)])).
% cnf(192,negated_conjecture,(relation_dom(esk6_0)!=esk1_0|relation_rng(esk6_0)!=esk1_0),inference(rw,[status(thm)],[191,186,theory(equality)])).
% cnf(229,negated_conjecture,(relation_dom(esk6_0)!=esk1_0|~empty(esk6_0)),inference(spm,[status(thm)],[192,187,theory(equality)])).
% cnf(237,negated_conjecture,(~empty(esk6_0)),inference(spm,[status(thm)],[229,188,theory(equality)])).
% cnf(246,negated_conjecture,(relation_dom(esk6_0)=esk1_0|relation_rng(esk6_0)=esk3_0),inference(rw,[status(thm)],[166,186,theory(equality)])).
% cnf(247,negated_conjecture,(relation_dom(esk6_0)=esk1_0|relation_rng(esk6_0)=esk1_0),inference(rw,[status(thm)],[246,186,theory(equality)])).
% cnf(250,negated_conjecture,(empty(esk6_0)|relation_dom(esk6_0)=esk1_0|~empty(esk1_0)|~relation(esk6_0)),inference(spm,[status(thm)],[47,247,theory(equality)])).
% cnf(254,negated_conjecture,(empty(esk6_0)|relation_dom(esk6_0)=esk1_0|$false|~relation(esk6_0)),inference(rw,[status(thm)],[250,67,theory(equality)])).
% cnf(255,negated_conjecture,(empty(esk6_0)|relation_dom(esk6_0)=esk1_0|$false|$false),inference(rw,[status(thm)],[254,105,theory(equality)])).
% cnf(256,negated_conjecture,(empty(esk6_0)|relation_dom(esk6_0)=esk1_0),inference(cn,[status(thm)],[255,theory(equality)])).
% cnf(257,negated_conjecture,(relation_dom(esk6_0)=esk1_0),inference(sr,[status(thm)],[256,237,theory(equality)])).
% cnf(261,negated_conjecture,(empty(esk6_0)|~empty(esk1_0)|~relation(esk6_0)),inference(spm,[status(thm)],[44,257,theory(equality)])).
% cnf(271,negated_conjecture,(empty(esk6_0)|$false|~relation(esk6_0)),inference(rw,[status(thm)],[261,67,theory(equality)])).
% cnf(272,negated_conjecture,(empty(esk6_0)|$false|$false),inference(rw,[status(thm)],[271,105,theory(equality)])).
% cnf(273,negated_conjecture,(empty(esk6_0)),inference(cn,[status(thm)],[272,theory(equality)])).
% cnf(274,negated_conjecture,($false),inference(sr,[status(thm)],[273,237,theory(equality)])).
% cnf(275,negated_conjecture,($false),274,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 78
% # ...of these trivial : 1
% # ...subsumed : 1
% # ...remaining for further processing: 76
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 18
% # Generated clauses : 53
% # ...of the previous two non-trivial : 34
% # Contextual simplify-reflections : 0
% # Paramodulations : 53
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 29
% # Positive orientable unit clauses: 10
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 16
% # Current number of unprocessed clauses: 8
% # ...number of literals in the above : 17
% # Clause-clause subsumption calls (NU) : 12
% # Rec. Clause-clause subsumption calls : 12
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 29 leaves, 1.07+/-0.253 terms/leaf
% # Paramod-from index: 18 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 28 leaves, 1.04+/-0.186 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.004 s
% # Total time : 0.018 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP28240/SEU189+1.tptp
%
%------------------------------------------------------------------------------