%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU257+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 : art06.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 02:33:54 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/SystemOnTPTP15978/SEU257+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP15978/SEU257+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15978/SEU257+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 16074
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(relation(X1)=>relation(relation_restriction(X1,X2))),file('/tmp/SRASS.s.p', dt_k2_wellord1)).
% fof(4, axiom,![X1]:![X2]:(relation(X2)=>(reflexive(X2)=>reflexive(relation_restriction(X2,X1)))),file('/tmp/SRASS.s.p', t22_wellord1)).
% fof(5, axiom,![X1]:![X2]:(relation(X2)=>(connected(X2)=>connected(relation_restriction(X2,X1)))),file('/tmp/SRASS.s.p', t23_wellord1)).
% fof(6, axiom,![X1]:![X2]:(relation(X2)=>(transitive(X2)=>transitive(relation_restriction(X2,X1)))),file('/tmp/SRASS.s.p', t24_wellord1)).
% fof(7, axiom,![X1]:![X2]:(relation(X2)=>(antisymmetric(X2)=>antisymmetric(relation_restriction(X2,X1)))),file('/tmp/SRASS.s.p', t25_wellord1)).
% fof(8, axiom,![X1]:![X2]:(relation(X2)=>(well_founded_relation(X2)=>well_founded_relation(relation_restriction(X2,X1)))),file('/tmp/SRASS.s.p', t31_wellord1)).
% fof(10, axiom,![X1]:(relation(X1)=>(well_ordering(X1)<=>((((reflexive(X1)&transitive(X1))&antisymmetric(X1))&connected(X1))&well_founded_relation(X1)))),file('/tmp/SRASS.s.p', d4_wellord1)).
% fof(13, conjecture,![X1]:![X2]:(relation(X2)=>(well_ordering(X2)=>well_ordering(relation_restriction(X2,X1)))),file('/tmp/SRASS.s.p', t32_wellord1)).
% fof(14, negated_conjecture,~(![X1]:![X2]:(relation(X2)=>(well_ordering(X2)=>well_ordering(relation_restriction(X2,X1))))),inference(assume_negation,[status(cth)],[13])).
% fof(15, plain,![X1]:![X2]:(~(relation(X1))|relation(relation_restriction(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(16, plain,![X3]:![X4]:(~(relation(X3))|relation(relation_restriction(X3,X4))),inference(variable_rename,[status(thm)],[15])).
% cnf(17,plain,(relation(relation_restriction(X1,X2))|~relation(X1)),inference(split_conjunct,[status(thm)],[16])).
% fof(22, plain,![X1]:![X2]:(~(relation(X2))|(~(reflexive(X2))|reflexive(relation_restriction(X2,X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(23, plain,![X3]:![X4]:(~(relation(X4))|(~(reflexive(X4))|reflexive(relation_restriction(X4,X3)))),inference(variable_rename,[status(thm)],[22])).
% cnf(24,plain,(reflexive(relation_restriction(X1,X2))|~reflexive(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X1]:![X2]:(~(relation(X2))|(~(connected(X2))|connected(relation_restriction(X2,X1)))),inference(fof_nnf,[status(thm)],[5])).
% fof(26, plain,![X3]:![X4]:(~(relation(X4))|(~(connected(X4))|connected(relation_restriction(X4,X3)))),inference(variable_rename,[status(thm)],[25])).
% cnf(27,plain,(connected(relation_restriction(X1,X2))|~connected(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X1]:![X2]:(~(relation(X2))|(~(transitive(X2))|transitive(relation_restriction(X2,X1)))),inference(fof_nnf,[status(thm)],[6])).
% fof(29, plain,![X3]:![X4]:(~(relation(X4))|(~(transitive(X4))|transitive(relation_restriction(X4,X3)))),inference(variable_rename,[status(thm)],[28])).
% cnf(30,plain,(transitive(relation_restriction(X1,X2))|~transitive(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X1]:![X2]:(~(relation(X2))|(~(antisymmetric(X2))|antisymmetric(relation_restriction(X2,X1)))),inference(fof_nnf,[status(thm)],[7])).
% fof(32, plain,![X3]:![X4]:(~(relation(X4))|(~(antisymmetric(X4))|antisymmetric(relation_restriction(X4,X3)))),inference(variable_rename,[status(thm)],[31])).
% cnf(33,plain,(antisymmetric(relation_restriction(X1,X2))|~antisymmetric(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X1]:![X2]:(~(relation(X2))|(~(well_founded_relation(X2))|well_founded_relation(relation_restriction(X2,X1)))),inference(fof_nnf,[status(thm)],[8])).
% fof(35, plain,![X3]:![X4]:(~(relation(X4))|(~(well_founded_relation(X4))|well_founded_relation(relation_restriction(X4,X3)))),inference(variable_rename,[status(thm)],[34])).
% cnf(36,plain,(well_founded_relation(relation_restriction(X1,X2))|~well_founded_relation(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[35])).
% fof(41, plain,![X1]:(~(relation(X1))|((~(well_ordering(X1))|((((reflexive(X1)&transitive(X1))&antisymmetric(X1))&connected(X1))&well_founded_relation(X1)))&(((((~(reflexive(X1))|~(transitive(X1)))|~(antisymmetric(X1)))|~(connected(X1)))|~(well_founded_relation(X1)))|well_ordering(X1)))),inference(fof_nnf,[status(thm)],[10])).
% fof(42, plain,![X2]:(~(relation(X2))|((~(well_ordering(X2))|((((reflexive(X2)&transitive(X2))&antisymmetric(X2))&connected(X2))&well_founded_relation(X2)))&(((((~(reflexive(X2))|~(transitive(X2)))|~(antisymmetric(X2)))|~(connected(X2)))|~(well_founded_relation(X2)))|well_ordering(X2)))),inference(variable_rename,[status(thm)],[41])).
% fof(43, plain,![X2]:(((((((reflexive(X2)|~(well_ordering(X2)))|~(relation(X2)))&((transitive(X2)|~(well_ordering(X2)))|~(relation(X2))))&((antisymmetric(X2)|~(well_ordering(X2)))|~(relation(X2))))&((connected(X2)|~(well_ordering(X2)))|~(relation(X2))))&((well_founded_relation(X2)|~(well_ordering(X2)))|~(relation(X2))))&((((((~(reflexive(X2))|~(transitive(X2)))|~(antisymmetric(X2)))|~(connected(X2)))|~(well_founded_relation(X2)))|well_ordering(X2))|~(relation(X2)))),inference(distribute,[status(thm)],[42])).
% cnf(44,plain,(well_ordering(X1)|~relation(X1)|~well_founded_relation(X1)|~connected(X1)|~antisymmetric(X1)|~transitive(X1)|~reflexive(X1)),inference(split_conjunct,[status(thm)],[43])).
% cnf(45,plain,(well_founded_relation(X1)|~relation(X1)|~well_ordering(X1)),inference(split_conjunct,[status(thm)],[43])).
% cnf(46,plain,(connected(X1)|~relation(X1)|~well_ordering(X1)),inference(split_conjunct,[status(thm)],[43])).
% cnf(47,plain,(antisymmetric(X1)|~relation(X1)|~well_ordering(X1)),inference(split_conjunct,[status(thm)],[43])).
% cnf(48,plain,(transitive(X1)|~relation(X1)|~well_ordering(X1)),inference(split_conjunct,[status(thm)],[43])).
% cnf(49,plain,(reflexive(X1)|~relation(X1)|~well_ordering(X1)),inference(split_conjunct,[status(thm)],[43])).
% fof(52, negated_conjecture,?[X1]:?[X2]:(relation(X2)&(well_ordering(X2)&~(well_ordering(relation_restriction(X2,X1))))),inference(fof_nnf,[status(thm)],[14])).
% fof(53, negated_conjecture,?[X3]:?[X4]:(relation(X4)&(well_ordering(X4)&~(well_ordering(relation_restriction(X4,X3))))),inference(variable_rename,[status(thm)],[52])).
% fof(54, negated_conjecture,(relation(esk2_0)&(well_ordering(esk2_0)&~(well_ordering(relation_restriction(esk2_0,esk1_0))))),inference(skolemize,[status(esa)],[53])).
% cnf(55,negated_conjecture,(~well_ordering(relation_restriction(esk2_0,esk1_0))),inference(split_conjunct,[status(thm)],[54])).
% cnf(56,negated_conjecture,(well_ordering(esk2_0)),inference(split_conjunct,[status(thm)],[54])).
% cnf(57,negated_conjecture,(relation(esk2_0)),inference(split_conjunct,[status(thm)],[54])).
% cnf(65,plain,(well_ordering(relation_restriction(X1,X2))|~antisymmetric(relation_restriction(X1,X2))|~transitive(relation_restriction(X1,X2))|~connected(relation_restriction(X1,X2))|~reflexive(relation_restriction(X1,X2))|~relation(relation_restriction(X1,X2))|~well_founded_relation(X1)|~relation(X1)),inference(spm,[status(thm)],[44,36,theory(equality)])).
% cnf(91,plain,(well_ordering(relation_restriction(X1,X2))|~well_founded_relation(X1)|~antisymmetric(relation_restriction(X1,X2))|~transitive(relation_restriction(X1,X2))|~connected(relation_restriction(X1,X2))|~reflexive(relation_restriction(X1,X2))|~relation(X1)),inference(csr,[status(thm)],[65,17])).
% cnf(96,plain,(well_ordering(relation_restriction(X1,X2))|~well_founded_relation(X1)|~transitive(relation_restriction(X1,X2))|~connected(relation_restriction(X1,X2))|~reflexive(relation_restriction(X1,X2))|~relation(X1)|~antisymmetric(X1)),inference(spm,[status(thm)],[91,33,theory(equality)])).
% cnf(103,plain,(well_ordering(relation_restriction(X1,X2))|~well_founded_relation(X1)|~antisymmetric(X1)|~connected(relation_restriction(X1,X2))|~reflexive(relation_restriction(X1,X2))|~relation(X1)|~transitive(X1)),inference(spm,[status(thm)],[96,30,theory(equality)])).
% cnf(108,plain,(well_ordering(relation_restriction(X1,X2))|~well_founded_relation(X1)|~antisymmetric(X1)|~transitive(X1)|~reflexive(relation_restriction(X1,X2))|~relation(X1)|~connected(X1)),inference(spm,[status(thm)],[103,27,theory(equality)])).
% cnf(113,plain,(well_ordering(relation_restriction(X1,X2))|~well_founded_relation(X1)|~antisymmetric(X1)|~transitive(X1)|~connected(X1)|~relation(X1)|~reflexive(X1)),inference(spm,[status(thm)],[108,24,theory(equality)])).
% cnf(114,negated_conjecture,(~well_founded_relation(esk2_0)|~antisymmetric(esk2_0)|~transitive(esk2_0)|~connected(esk2_0)|~reflexive(esk2_0)|~relation(esk2_0)),inference(spm,[status(thm)],[55,113,theory(equality)])).
% cnf(118,negated_conjecture,(~well_founded_relation(esk2_0)|~antisymmetric(esk2_0)|~transitive(esk2_0)|~connected(esk2_0)|~reflexive(esk2_0)|$false),inference(rw,[status(thm)],[114,57,theory(equality)])).
% cnf(119,negated_conjecture,(~well_founded_relation(esk2_0)|~antisymmetric(esk2_0)|~transitive(esk2_0)|~connected(esk2_0)|~reflexive(esk2_0)),inference(cn,[status(thm)],[118,theory(equality)])).
% cnf(120,negated_conjecture,(~antisymmetric(esk2_0)|~transitive(esk2_0)|~connected(esk2_0)|~reflexive(esk2_0)|~well_ordering(esk2_0)|~relation(esk2_0)),inference(spm,[status(thm)],[119,45,theory(equality)])).
% cnf(121,negated_conjecture,(~antisymmetric(esk2_0)|~transitive(esk2_0)|~connected(esk2_0)|~reflexive(esk2_0)|$false|~relation(esk2_0)),inference(rw,[status(thm)],[120,56,theory(equality)])).
% cnf(122,negated_conjecture,(~antisymmetric(esk2_0)|~transitive(esk2_0)|~connected(esk2_0)|~reflexive(esk2_0)|$false|$false),inference(rw,[status(thm)],[121,57,theory(equality)])).
% cnf(123,negated_conjecture,(~antisymmetric(esk2_0)|~transitive(esk2_0)|~connected(esk2_0)|~reflexive(esk2_0)),inference(cn,[status(thm)],[122,theory(equality)])).
% cnf(125,negated_conjecture,(~transitive(esk2_0)|~connected(esk2_0)|~reflexive(esk2_0)|~well_ordering(esk2_0)|~relation(esk2_0)),inference(spm,[status(thm)],[123,47,theory(equality)])).
% cnf(126,negated_conjecture,(~transitive(esk2_0)|~connected(esk2_0)|~reflexive(esk2_0)|$false|~relation(esk2_0)),inference(rw,[status(thm)],[125,56,theory(equality)])).
% cnf(127,negated_conjecture,(~transitive(esk2_0)|~connected(esk2_0)|~reflexive(esk2_0)|$false|$false),inference(rw,[status(thm)],[126,57,theory(equality)])).
% cnf(128,negated_conjecture,(~transitive(esk2_0)|~connected(esk2_0)|~reflexive(esk2_0)),inference(cn,[status(thm)],[127,theory(equality)])).
% cnf(129,negated_conjecture,(~connected(esk2_0)|~reflexive(esk2_0)|~well_ordering(esk2_0)|~relation(esk2_0)),inference(spm,[status(thm)],[128,48,theory(equality)])).
% cnf(130,negated_conjecture,(~connected(esk2_0)|~reflexive(esk2_0)|$false|~relation(esk2_0)),inference(rw,[status(thm)],[129,56,theory(equality)])).
% cnf(131,negated_conjecture,(~connected(esk2_0)|~reflexive(esk2_0)|$false|$false),inference(rw,[status(thm)],[130,57,theory(equality)])).
% cnf(132,negated_conjecture,(~connected(esk2_0)|~reflexive(esk2_0)),inference(cn,[status(thm)],[131,theory(equality)])).
% cnf(133,negated_conjecture,(~reflexive(esk2_0)|~well_ordering(esk2_0)|~relation(esk2_0)),inference(spm,[status(thm)],[132,46,theory(equality)])).
% cnf(134,negated_conjecture,(~reflexive(esk2_0)|$false|~relation(esk2_0)),inference(rw,[status(thm)],[133,56,theory(equality)])).
% cnf(135,negated_conjecture,(~reflexive(esk2_0)|$false|$false),inference(rw,[status(thm)],[134,57,theory(equality)])).
% cnf(136,negated_conjecture,(~reflexive(esk2_0)),inference(cn,[status(thm)],[135,theory(equality)])).
% cnf(137,negated_conjecture,(~well_ordering(esk2_0)|~relation(esk2_0)),inference(spm,[status(thm)],[136,49,theory(equality)])).
% cnf(138,negated_conjecture,($false|~relation(esk2_0)),inference(rw,[status(thm)],[137,56,theory(equality)])).
% cnf(139,negated_conjecture,($false|$false),inference(rw,[status(thm)],[138,57,theory(equality)])).
% cnf(140,negated_conjecture,($false),inference(cn,[status(thm)],[139,theory(equality)])).
% cnf(141,negated_conjecture,($false),140,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 58
% # ...of these trivial : 0
% # ...subsumed : 8
% # ...remaining for further processing: 50
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 0
% # Generated clauses : 61
% # ...of the previous two non-trivial : 47
% # Contextual simplify-reflections : 3
% # Paramodulations : 61
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 29
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 23
% # Current number of unprocessed clauses: 25
% # ...number of literals in the above : 155
% # Clause-clause subsumption calls (NU) : 52
% # Rec. Clause-clause subsumption calls : 51
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 32 leaves, 1.25+/-0.559 terms/leaf
% # Paramod-from index: 18 leaves, 1.22+/-0.629 terms/leaf
% # Paramod-into index: 27 leaves, 1.19+/-0.547 terms/leaf
% # -------------------------------------------------
% # User time : 0.016 s
% # System time : 0.002 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/SystemOnTPTP15978/SEU257+1.tptp
%
%------------------------------------------------------------------------------