%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU261+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 02:40:56 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP17315/SEU261+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP17315/SEU261+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17315/SEU261+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 17411
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(relation(X1)=>![X2]:(relation(X2)=>![X3]:((relation(X3)&function(X3))=>(relation_isomorphism(X1,X2,X3)=>(((((reflexive(X1)=>reflexive(X2))&(transitive(X1)=>transitive(X2)))&(connected(X1)=>connected(X2)))&(antisymmetric(X1)=>antisymmetric(X2)))&(well_founded_relation(X1)=>well_founded_relation(X2))))))),file('/tmp/SRASS.s.p', t53_wellord1)).
% fof(3, 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(4, conjecture,![X1]:(relation(X1)=>![X2]:(relation(X2)=>![X3]:((relation(X3)&function(X3))=>((well_ordering(X1)&relation_isomorphism(X1,X2,X3))=>well_ordering(X2))))),file('/tmp/SRASS.s.p', t54_wellord1)).
% fof(5, negated_conjecture,~(![X1]:(relation(X1)=>![X2]:(relation(X2)=>![X3]:((relation(X3)&function(X3))=>((well_ordering(X1)&relation_isomorphism(X1,X2,X3))=>well_ordering(X2)))))),inference(assume_negation,[status(cth)],[4])).
% fof(6, plain,![X1]:![X2]:(epred1_2(X2,X1)=>(((((reflexive(X1)=>reflexive(X2))&(transitive(X1)=>transitive(X2)))&(connected(X1)=>connected(X2)))&(antisymmetric(X1)=>antisymmetric(X2)))&(well_founded_relation(X1)=>well_founded_relation(X2)))),introduced(definition)).
% fof(7, plain,![X1]:(relation(X1)=>![X2]:(relation(X2)=>![X3]:((relation(X3)&function(X3))=>(relation_isomorphism(X1,X2,X3)=>epred1_2(X2,X1))))),inference(apply_def,[status(esa)],[2,6,theory(equality)])).
% fof(12, plain,![X1]:(~(relation(X1))|![X2]:(~(relation(X2))|![X3]:((~(relation(X3))|~(function(X3)))|(~(relation_isomorphism(X1,X2,X3))|epred1_2(X2,X1))))),inference(fof_nnf,[status(thm)],[7])).
% fof(13, plain,![X4]:(~(relation(X4))|![X5]:(~(relation(X5))|![X6]:((~(relation(X6))|~(function(X6)))|(~(relation_isomorphism(X4,X5,X6))|epred1_2(X5,X4))))),inference(variable_rename,[status(thm)],[12])).
% fof(14, plain,![X4]:![X5]:![X6]:((((~(relation(X6))|~(function(X6)))|(~(relation_isomorphism(X4,X5,X6))|epred1_2(X5,X4)))|~(relation(X5)))|~(relation(X4))),inference(shift_quantors,[status(thm)],[13])).
% cnf(15,plain,(epred1_2(X2,X1)|~relation(X1)|~relation(X2)|~relation_isomorphism(X1,X2,X3)|~function(X3)|~relation(X3)),inference(split_conjunct,[status(thm)],[14])).
% fof(16, 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)],[3])).
% fof(17, 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)],[16])).
% fof(18, 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)],[17])).
% cnf(19,plain,(well_ordering(X1)|~relation(X1)|~well_founded_relation(X1)|~connected(X1)|~antisymmetric(X1)|~transitive(X1)|~reflexive(X1)),inference(split_conjunct,[status(thm)],[18])).
% cnf(20,plain,(well_founded_relation(X1)|~relation(X1)|~well_ordering(X1)),inference(split_conjunct,[status(thm)],[18])).
% cnf(21,plain,(connected(X1)|~relation(X1)|~well_ordering(X1)),inference(split_conjunct,[status(thm)],[18])).
% cnf(22,plain,(antisymmetric(X1)|~relation(X1)|~well_ordering(X1)),inference(split_conjunct,[status(thm)],[18])).
% cnf(23,plain,(transitive(X1)|~relation(X1)|~well_ordering(X1)),inference(split_conjunct,[status(thm)],[18])).
% cnf(24,plain,(reflexive(X1)|~relation(X1)|~well_ordering(X1)),inference(split_conjunct,[status(thm)],[18])).
% fof(25, negated_conjecture,?[X1]:(relation(X1)&?[X2]:(relation(X2)&?[X3]:((relation(X3)&function(X3))&((well_ordering(X1)&relation_isomorphism(X1,X2,X3))&~(well_ordering(X2)))))),inference(fof_nnf,[status(thm)],[5])).
% fof(26, negated_conjecture,?[X4]:(relation(X4)&?[X5]:(relation(X5)&?[X6]:((relation(X6)&function(X6))&((well_ordering(X4)&relation_isomorphism(X4,X5,X6))&~(well_ordering(X5)))))),inference(variable_rename,[status(thm)],[25])).
% fof(27, negated_conjecture,(relation(esk2_0)&(relation(esk3_0)&((relation(esk4_0)&function(esk4_0))&((well_ordering(esk2_0)&relation_isomorphism(esk2_0,esk3_0,esk4_0))&~(well_ordering(esk3_0)))))),inference(skolemize,[status(esa)],[26])).
% cnf(28,negated_conjecture,(~well_ordering(esk3_0)),inference(split_conjunct,[status(thm)],[27])).
% cnf(29,negated_conjecture,(relation_isomorphism(esk2_0,esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[27])).
% cnf(30,negated_conjecture,(well_ordering(esk2_0)),inference(split_conjunct,[status(thm)],[27])).
% cnf(31,negated_conjecture,(function(esk4_0)),inference(split_conjunct,[status(thm)],[27])).
% cnf(32,negated_conjecture,(relation(esk4_0)),inference(split_conjunct,[status(thm)],[27])).
% cnf(33,negated_conjecture,(relation(esk3_0)),inference(split_conjunct,[status(thm)],[27])).
% cnf(34,negated_conjecture,(relation(esk2_0)),inference(split_conjunct,[status(thm)],[27])).
% fof(35, plain,![X1]:![X2]:(~(epred1_2(X2,X1))|(((((~(reflexive(X1))|reflexive(X2))&(~(transitive(X1))|transitive(X2)))&(~(connected(X1))|connected(X2)))&(~(antisymmetric(X1))|antisymmetric(X2)))&(~(well_founded_relation(X1))|well_founded_relation(X2)))),inference(fof_nnf,[status(thm)],[6])).
% fof(36, plain,![X3]:![X4]:(~(epred1_2(X4,X3))|(((((~(reflexive(X3))|reflexive(X4))&(~(transitive(X3))|transitive(X4)))&(~(connected(X3))|connected(X4)))&(~(antisymmetric(X3))|antisymmetric(X4)))&(~(well_founded_relation(X3))|well_founded_relation(X4)))),inference(variable_rename,[status(thm)],[35])).
% fof(37, plain,![X3]:![X4]:((((((~(reflexive(X3))|reflexive(X4))|~(epred1_2(X4,X3)))&((~(transitive(X3))|transitive(X4))|~(epred1_2(X4,X3))))&((~(connected(X3))|connected(X4))|~(epred1_2(X4,X3))))&((~(antisymmetric(X3))|antisymmetric(X4))|~(epred1_2(X4,X3))))&((~(well_founded_relation(X3))|well_founded_relation(X4))|~(epred1_2(X4,X3)))),inference(distribute,[status(thm)],[36])).
% cnf(38,plain,(well_founded_relation(X1)|~epred1_2(X1,X2)|~well_founded_relation(X2)),inference(split_conjunct,[status(thm)],[37])).
% cnf(39,plain,(antisymmetric(X1)|~epred1_2(X1,X2)|~antisymmetric(X2)),inference(split_conjunct,[status(thm)],[37])).
% cnf(40,plain,(connected(X1)|~epred1_2(X1,X2)|~connected(X2)),inference(split_conjunct,[status(thm)],[37])).
% cnf(41,plain,(transitive(X1)|~epred1_2(X1,X2)|~transitive(X2)),inference(split_conjunct,[status(thm)],[37])).
% cnf(42,plain,(reflexive(X1)|~epred1_2(X1,X2)|~reflexive(X2)),inference(split_conjunct,[status(thm)],[37])).
% cnf(43,negated_conjecture,(epred1_2(esk3_0,esk2_0)|~function(esk4_0)|~relation(esk4_0)|~relation(esk3_0)|~relation(esk2_0)),inference(spm,[status(thm)],[15,29,theory(equality)])).
% cnf(44,negated_conjecture,(epred1_2(esk3_0,esk2_0)|$false|~relation(esk4_0)|~relation(esk3_0)|~relation(esk2_0)),inference(rw,[status(thm)],[43,31,theory(equality)])).
% cnf(45,negated_conjecture,(epred1_2(esk3_0,esk2_0)|$false|$false|~relation(esk3_0)|~relation(esk2_0)),inference(rw,[status(thm)],[44,32,theory(equality)])).
% cnf(46,negated_conjecture,(epred1_2(esk3_0,esk2_0)|$false|$false|$false|~relation(esk2_0)),inference(rw,[status(thm)],[45,33,theory(equality)])).
% cnf(47,negated_conjecture,(epred1_2(esk3_0,esk2_0)|$false|$false|$false|$false),inference(rw,[status(thm)],[46,34,theory(equality)])).
% cnf(48,negated_conjecture,(epred1_2(esk3_0,esk2_0)),inference(cn,[status(thm)],[47,theory(equality)])).
% cnf(50,plain,(reflexive(esk3_0)|~reflexive(esk2_0)),inference(spm,[status(thm)],[42,48,theory(equality)])).
% cnf(51,plain,(transitive(esk3_0)|~transitive(esk2_0)),inference(spm,[status(thm)],[41,48,theory(equality)])).
% cnf(52,plain,(connected(esk3_0)|~connected(esk2_0)),inference(spm,[status(thm)],[40,48,theory(equality)])).
% cnf(53,plain,(antisymmetric(esk3_0)|~antisymmetric(esk2_0)),inference(spm,[status(thm)],[39,48,theory(equality)])).
% cnf(54,plain,(well_founded_relation(esk3_0)|~well_founded_relation(esk2_0)),inference(spm,[status(thm)],[38,48,theory(equality)])).
% cnf(55,plain,(well_ordering(esk3_0)|~antisymmetric(esk3_0)|~connected(esk3_0)|~transitive(esk3_0)|~reflexive(esk3_0)|~relation(esk3_0)|~well_founded_relation(esk2_0)),inference(spm,[status(thm)],[19,54,theory(equality)])).
% cnf(56,plain,(well_ordering(esk3_0)|~antisymmetric(esk3_0)|~connected(esk3_0)|~transitive(esk3_0)|~reflexive(esk3_0)|$false|~well_founded_relation(esk2_0)),inference(rw,[status(thm)],[55,33,theory(equality)])).
% cnf(57,plain,(well_ordering(esk3_0)|~antisymmetric(esk3_0)|~connected(esk3_0)|~transitive(esk3_0)|~reflexive(esk3_0)|~well_founded_relation(esk2_0)),inference(cn,[status(thm)],[56,theory(equality)])).
% cnf(58,plain,(~antisymmetric(esk3_0)|~connected(esk3_0)|~transitive(esk3_0)|~reflexive(esk3_0)|~well_founded_relation(esk2_0)),inference(sr,[status(thm)],[57,28,theory(equality)])).
% cnf(59,plain,(~antisymmetric(esk3_0)|~connected(esk3_0)|~transitive(esk3_0)|~reflexive(esk3_0)|~well_ordering(esk2_0)|~relation(esk2_0)),inference(spm,[status(thm)],[58,20,theory(equality)])).
% cnf(60,plain,(~antisymmetric(esk3_0)|~connected(esk3_0)|~transitive(esk3_0)|~reflexive(esk3_0)|$false|~relation(esk2_0)),inference(rw,[status(thm)],[59,30,theory(equality)])).
% cnf(61,plain,(~antisymmetric(esk3_0)|~connected(esk3_0)|~transitive(esk3_0)|~reflexive(esk3_0)|$false|$false),inference(rw,[status(thm)],[60,34,theory(equality)])).
% cnf(62,plain,(~antisymmetric(esk3_0)|~connected(esk3_0)|~transitive(esk3_0)|~reflexive(esk3_0)),inference(cn,[status(thm)],[61,theory(equality)])).
% cnf(64,plain,(~connected(esk3_0)|~transitive(esk3_0)|~reflexive(esk3_0)|~antisymmetric(esk2_0)),inference(spm,[status(thm)],[62,53,theory(equality)])).
% cnf(67,plain,(~connected(esk3_0)|~transitive(esk3_0)|~reflexive(esk3_0)|~well_ordering(esk2_0)|~relation(esk2_0)),inference(spm,[status(thm)],[64,22,theory(equality)])).
% cnf(68,plain,(~connected(esk3_0)|~transitive(esk3_0)|~reflexive(esk3_0)|$false|~relation(esk2_0)),inference(rw,[status(thm)],[67,30,theory(equality)])).
% cnf(69,plain,(~connected(esk3_0)|~transitive(esk3_0)|~reflexive(esk3_0)|$false|$false),inference(rw,[status(thm)],[68,34,theory(equality)])).
% cnf(70,plain,(~connected(esk3_0)|~transitive(esk3_0)|~reflexive(esk3_0)),inference(cn,[status(thm)],[69,theory(equality)])).
% cnf(72,plain,(~transitive(esk3_0)|~reflexive(esk3_0)|~connected(esk2_0)),inference(spm,[status(thm)],[70,52,theory(equality)])).
% cnf(75,plain,(~transitive(esk3_0)|~reflexive(esk3_0)|~well_ordering(esk2_0)|~relation(esk2_0)),inference(spm,[status(thm)],[72,21,theory(equality)])).
% cnf(76,plain,(~transitive(esk3_0)|~reflexive(esk3_0)|$false|~relation(esk2_0)),inference(rw,[status(thm)],[75,30,theory(equality)])).
% cnf(77,plain,(~transitive(esk3_0)|~reflexive(esk3_0)|$false|$false),inference(rw,[status(thm)],[76,34,theory(equality)])).
% cnf(78,plain,(~transitive(esk3_0)|~reflexive(esk3_0)),inference(cn,[status(thm)],[77,theory(equality)])).
% cnf(80,plain,(~reflexive(esk3_0)|~transitive(esk2_0)),inference(spm,[status(thm)],[78,51,theory(equality)])).
% cnf(83,plain,(~reflexive(esk3_0)|~well_ordering(esk2_0)|~relation(esk2_0)),inference(spm,[status(thm)],[80,23,theory(equality)])).
% cnf(84,plain,(~reflexive(esk3_0)|$false|~relation(esk2_0)),inference(rw,[status(thm)],[83,30,theory(equality)])).
% cnf(85,plain,(~reflexive(esk3_0)|$false|$false),inference(rw,[status(thm)],[84,34,theory(equality)])).
% cnf(86,plain,(~reflexive(esk3_0)),inference(cn,[status(thm)],[85,theory(equality)])).
% cnf(88,plain,(~reflexive(esk2_0)),inference(spm,[status(thm)],[86,50,theory(equality)])).
% cnf(91,plain,(~well_ordering(esk2_0)|~relation(esk2_0)),inference(spm,[status(thm)],[88,24,theory(equality)])).
% cnf(92,plain,($false|~relation(esk2_0)),inference(rw,[status(thm)],[91,30,theory(equality)])).
% cnf(93,plain,($false|$false),inference(rw,[status(thm)],[92,34,theory(equality)])).
% cnf(94,plain,($false),inference(cn,[status(thm)],[93,theory(equality)])).
% cnf(95,plain,($false),94,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 61
% # ...of these trivial : 0
% # ...subsumed : 4
% # ...remaining for further processing: 57
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 5
% # Backward-rewritten : 0
% # Generated clauses : 21
% # ...of the previous two non-trivial : 19
% # Contextual simplify-reflections : 0
% # Paramodulations : 21
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 31
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 19
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 5
% # Rec. Clause-clause subsumption calls : 5
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 35 leaves, 1.20+/-0.466 terms/leaf
% # Paramod-from index: 19 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 28 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.002 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.18 WC
% FINAL PrfWatch: 0.09 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP17315/SEU261+1.tptp
%
%------------------------------------------------------------------------------