%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU219+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:59:33 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP4469/SEU219+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP4469/SEU219+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4469/SEU219+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 4565
% 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(4, axiom,![X1]:((relation(X1)&function(X1))=>(one_to_one(X1)=>function_inverse(X1)=relation_inverse(X1))),file('/tmp/SRASS.s.p', d9_funct_1)).
% fof(5, axiom,![X1]:(relation(X1)=>(relation_rng(X1)=relation_dom(relation_inverse(X1))&relation_dom(X1)=relation_rng(relation_inverse(X1)))),file('/tmp/SRASS.s.p', t37_relat_1)).
% fof(11, conjecture,![X1]:((relation(X1)&function(X1))=>(one_to_one(X1)=>(relation_rng(X1)=relation_dom(function_inverse(X1))&relation_dom(X1)=relation_rng(function_inverse(X1))))),file('/tmp/SRASS.s.p', t55_funct_1)).
% fof(12, negated_conjecture,~(![X1]:((relation(X1)&function(X1))=>(one_to_one(X1)=>(relation_rng(X1)=relation_dom(function_inverse(X1))&relation_dom(X1)=relation_rng(function_inverse(X1)))))),inference(assume_negation,[status(cth)],[11])).
% fof(27, plain,![X1]:((~(relation(X1))|~(function(X1)))|(~(one_to_one(X1))|function_inverse(X1)=relation_inverse(X1))),inference(fof_nnf,[status(thm)],[4])).
% fof(28, plain,![X2]:((~(relation(X2))|~(function(X2)))|(~(one_to_one(X2))|function_inverse(X2)=relation_inverse(X2))),inference(variable_rename,[status(thm)],[27])).
% cnf(29,plain,(function_inverse(X1)=relation_inverse(X1)|~one_to_one(X1)|~function(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X1]:(~(relation(X1))|(relation_rng(X1)=relation_dom(relation_inverse(X1))&relation_dom(X1)=relation_rng(relation_inverse(X1)))),inference(fof_nnf,[status(thm)],[5])).
% fof(31, plain,![X2]:(~(relation(X2))|(relation_rng(X2)=relation_dom(relation_inverse(X2))&relation_dom(X2)=relation_rng(relation_inverse(X2)))),inference(variable_rename,[status(thm)],[30])).
% fof(32, plain,![X2]:((relation_rng(X2)=relation_dom(relation_inverse(X2))|~(relation(X2)))&(relation_dom(X2)=relation_rng(relation_inverse(X2))|~(relation(X2)))),inference(distribute,[status(thm)],[31])).
% cnf(33,plain,(relation_dom(X1)=relation_rng(relation_inverse(X1))|~relation(X1)),inference(split_conjunct,[status(thm)],[32])).
% cnf(34,plain,(relation_rng(X1)=relation_dom(relation_inverse(X1))|~relation(X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(48, negated_conjecture,?[X1]:((relation(X1)&function(X1))&(one_to_one(X1)&(~(relation_rng(X1)=relation_dom(function_inverse(X1)))|~(relation_dom(X1)=relation_rng(function_inverse(X1)))))),inference(fof_nnf,[status(thm)],[12])).
% fof(49, negated_conjecture,?[X2]:((relation(X2)&function(X2))&(one_to_one(X2)&(~(relation_rng(X2)=relation_dom(function_inverse(X2)))|~(relation_dom(X2)=relation_rng(function_inverse(X2)))))),inference(variable_rename,[status(thm)],[48])).
% fof(50, negated_conjecture,((relation(esk3_0)&function(esk3_0))&(one_to_one(esk3_0)&(~(relation_rng(esk3_0)=relation_dom(function_inverse(esk3_0)))|~(relation_dom(esk3_0)=relation_rng(function_inverse(esk3_0)))))),inference(skolemize,[status(esa)],[49])).
% cnf(51,negated_conjecture,(relation_dom(esk3_0)!=relation_rng(function_inverse(esk3_0))|relation_rng(esk3_0)!=relation_dom(function_inverse(esk3_0))),inference(split_conjunct,[status(thm)],[50])).
% cnf(52,negated_conjecture,(one_to_one(esk3_0)),inference(split_conjunct,[status(thm)],[50])).
% cnf(53,negated_conjecture,(function(esk3_0)),inference(split_conjunct,[status(thm)],[50])).
% cnf(54,negated_conjecture,(relation(esk3_0)),inference(split_conjunct,[status(thm)],[50])).
% cnf(65,negated_conjecture,(relation_rng(relation_inverse(esk3_0))!=relation_dom(esk3_0)|relation_dom(relation_inverse(esk3_0))!=relation_rng(esk3_0)|~one_to_one(esk3_0)|~function(esk3_0)|~relation(esk3_0)),inference(spm,[status(thm)],[51,29,theory(equality)])).
% cnf(68,negated_conjecture,(relation_rng(relation_inverse(esk3_0))!=relation_dom(esk3_0)|relation_dom(relation_inverse(esk3_0))!=relation_rng(esk3_0)|$false|~function(esk3_0)|~relation(esk3_0)),inference(rw,[status(thm)],[65,52,theory(equality)])).
% cnf(69,negated_conjecture,(relation_rng(relation_inverse(esk3_0))!=relation_dom(esk3_0)|relation_dom(relation_inverse(esk3_0))!=relation_rng(esk3_0)|$false|$false|~relation(esk3_0)),inference(rw,[status(thm)],[68,53,theory(equality)])).
% cnf(70,negated_conjecture,(relation_rng(relation_inverse(esk3_0))!=relation_dom(esk3_0)|relation_dom(relation_inverse(esk3_0))!=relation_rng(esk3_0)|$false|$false|$false),inference(rw,[status(thm)],[69,54,theory(equality)])).
% cnf(71,negated_conjecture,(relation_rng(relation_inverse(esk3_0))!=relation_dom(esk3_0)|relation_dom(relation_inverse(esk3_0))!=relation_rng(esk3_0)),inference(cn,[status(thm)],[70,theory(equality)])).
% cnf(75,negated_conjecture,(relation_rng(relation_inverse(esk3_0))!=relation_dom(esk3_0)|~relation(esk3_0)),inference(spm,[status(thm)],[71,34,theory(equality)])).
% cnf(76,negated_conjecture,(relation_rng(relation_inverse(esk3_0))!=relation_dom(esk3_0)|$false),inference(rw,[status(thm)],[75,54,theory(equality)])).
% cnf(77,negated_conjecture,(relation_rng(relation_inverse(esk3_0))!=relation_dom(esk3_0)),inference(cn,[status(thm)],[76,theory(equality)])).
% cnf(78,negated_conjecture,(~relation(esk3_0)),inference(spm,[status(thm)],[77,33,theory(equality)])).
% cnf(79,negated_conjecture,($false),inference(rw,[status(thm)],[78,54,theory(equality)])).
% cnf(80,negated_conjecture,($false),inference(cn,[status(thm)],[79,theory(equality)])).
% cnf(81,negated_conjecture,($false),80,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 38
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 37
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 10
% # ...of the previous two non-trivial : 8
% # Contextual simplify-reflections : 2
% # Paramodulations : 10
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 20
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 10
% # Current number of unprocessed clauses: 5
% # ...number of literals in the above : 15
% # Clause-clause subsumption calls (NU) : 7
% # Rec. Clause-clause subsumption calls : 7
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 35 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 16 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 26 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.004 s
% # Total time : 0.013 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.08 CPU 0.16 WC
% FINAL PrfWatch: 0.08 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP4469/SEU219+1.tptp
%
%------------------------------------------------------------------------------