TSTP Solution File: SEU244+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU244+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 : 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 02:26:18 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/SystemOnTPTP5082/SEU244+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP5082/SEU244+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5082/SEU244+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 5178
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(relation(X1)=>(antisymmetric(X1)<=>is_antisymmetric_in(X1,relation_field(X1)))),file('/tmp/SRASS.s.p', d12_relat_2)).
% fof(4, axiom,![X1]:(relation(X1)=>(connected(X1)<=>is_connected_in(X1,relation_field(X1)))),file('/tmp/SRASS.s.p', d14_relat_2)).
% fof(5, axiom,![X1]:(relation(X1)=>(transitive(X1)<=>is_transitive_in(X1,relation_field(X1)))),file('/tmp/SRASS.s.p', d16_relat_2)).
% fof(6, axiom,![X1]:(relation(X1)=>(reflexive(X1)<=>is_reflexive_in(X1,relation_field(X1)))),file('/tmp/SRASS.s.p', d9_relat_2)).
% fof(7, axiom,![X1]:(relation(X1)=>(well_founded_relation(X1)<=>is_well_founded_in(X1,relation_field(X1)))),file('/tmp/SRASS.s.p', t5_wellord1)).
% fof(8, 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(9, axiom,![X1]:(relation(X1)=>![X2]:(well_orders(X1,X2)<=>((((is_reflexive_in(X1,X2)&is_transitive_in(X1,X2))&is_antisymmetric_in(X1,X2))&is_connected_in(X1,X2))&is_well_founded_in(X1,X2)))),file('/tmp/SRASS.s.p', d5_wellord1)).
% fof(15, conjecture,![X1]:(relation(X1)=>(well_orders(X1,relation_field(X1))<=>well_ordering(X1))),file('/tmp/SRASS.s.p', t8_wellord1)).
% fof(16, negated_conjecture,~(![X1]:(relation(X1)=>(well_orders(X1,relation_field(X1))<=>well_ordering(X1)))),inference(assume_negation,[status(cth)],[15])).
% fof(21, plain,![X1]:(~(relation(X1))|((~(antisymmetric(X1))|is_antisymmetric_in(X1,relation_field(X1)))&(~(is_antisymmetric_in(X1,relation_field(X1)))|antisymmetric(X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(22, plain,![X2]:(~(relation(X2))|((~(antisymmetric(X2))|is_antisymmetric_in(X2,relation_field(X2)))&(~(is_antisymmetric_in(X2,relation_field(X2)))|antisymmetric(X2)))),inference(variable_rename,[status(thm)],[21])).
% fof(23, plain,![X2]:(((~(antisymmetric(X2))|is_antisymmetric_in(X2,relation_field(X2)))|~(relation(X2)))&((~(is_antisymmetric_in(X2,relation_field(X2)))|antisymmetric(X2))|~(relation(X2)))),inference(distribute,[status(thm)],[22])).
% cnf(24,plain,(antisymmetric(X1)|~relation(X1)|~is_antisymmetric_in(X1,relation_field(X1))),inference(split_conjunct,[status(thm)],[23])).
% cnf(25,plain,(is_antisymmetric_in(X1,relation_field(X1))|~relation(X1)|~antisymmetric(X1)),inference(split_conjunct,[status(thm)],[23])).
% fof(26, plain,![X1]:(~(relation(X1))|((~(connected(X1))|is_connected_in(X1,relation_field(X1)))&(~(is_connected_in(X1,relation_field(X1)))|connected(X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(27, plain,![X2]:(~(relation(X2))|((~(connected(X2))|is_connected_in(X2,relation_field(X2)))&(~(is_connected_in(X2,relation_field(X2)))|connected(X2)))),inference(variable_rename,[status(thm)],[26])).
% fof(28, plain,![X2]:(((~(connected(X2))|is_connected_in(X2,relation_field(X2)))|~(relation(X2)))&((~(is_connected_in(X2,relation_field(X2)))|connected(X2))|~(relation(X2)))),inference(distribute,[status(thm)],[27])).
% cnf(29,plain,(connected(X1)|~relation(X1)|~is_connected_in(X1,relation_field(X1))),inference(split_conjunct,[status(thm)],[28])).
% cnf(30,plain,(is_connected_in(X1,relation_field(X1))|~relation(X1)|~connected(X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(31, plain,![X1]:(~(relation(X1))|((~(transitive(X1))|is_transitive_in(X1,relation_field(X1)))&(~(is_transitive_in(X1,relation_field(X1)))|transitive(X1)))),inference(fof_nnf,[status(thm)],[5])).
% fof(32, plain,![X2]:(~(relation(X2))|((~(transitive(X2))|is_transitive_in(X2,relation_field(X2)))&(~(is_transitive_in(X2,relation_field(X2)))|transitive(X2)))),inference(variable_rename,[status(thm)],[31])).
% fof(33, plain,![X2]:(((~(transitive(X2))|is_transitive_in(X2,relation_field(X2)))|~(relation(X2)))&((~(is_transitive_in(X2,relation_field(X2)))|transitive(X2))|~(relation(X2)))),inference(distribute,[status(thm)],[32])).
% cnf(34,plain,(transitive(X1)|~relation(X1)|~is_transitive_in(X1,relation_field(X1))),inference(split_conjunct,[status(thm)],[33])).
% cnf(35,plain,(is_transitive_in(X1,relation_field(X1))|~relation(X1)|~transitive(X1)),inference(split_conjunct,[status(thm)],[33])).
% fof(36, plain,![X1]:(~(relation(X1))|((~(reflexive(X1))|is_reflexive_in(X1,relation_field(X1)))&(~(is_reflexive_in(X1,relation_field(X1)))|reflexive(X1)))),inference(fof_nnf,[status(thm)],[6])).
% fof(37, plain,![X2]:(~(relation(X2))|((~(reflexive(X2))|is_reflexive_in(X2,relation_field(X2)))&(~(is_reflexive_in(X2,relation_field(X2)))|reflexive(X2)))),inference(variable_rename,[status(thm)],[36])).
% fof(38, plain,![X2]:(((~(reflexive(X2))|is_reflexive_in(X2,relation_field(X2)))|~(relation(X2)))&((~(is_reflexive_in(X2,relation_field(X2)))|reflexive(X2))|~(relation(X2)))),inference(distribute,[status(thm)],[37])).
% cnf(39,plain,(reflexive(X1)|~relation(X1)|~is_reflexive_in(X1,relation_field(X1))),inference(split_conjunct,[status(thm)],[38])).
% cnf(40,plain,(is_reflexive_in(X1,relation_field(X1))|~relation(X1)|~reflexive(X1)),inference(split_conjunct,[status(thm)],[38])).
% fof(41, plain,![X1]:(~(relation(X1))|((~(well_founded_relation(X1))|is_well_founded_in(X1,relation_field(X1)))&(~(is_well_founded_in(X1,relation_field(X1)))|well_founded_relation(X1)))),inference(fof_nnf,[status(thm)],[7])).
% fof(42, plain,![X2]:(~(relation(X2))|((~(well_founded_relation(X2))|is_well_founded_in(X2,relation_field(X2)))&(~(is_well_founded_in(X2,relation_field(X2)))|well_founded_relation(X2)))),inference(variable_rename,[status(thm)],[41])).
% fof(43, plain,![X2]:(((~(well_founded_relation(X2))|is_well_founded_in(X2,relation_field(X2)))|~(relation(X2)))&((~(is_well_founded_in(X2,relation_field(X2)))|well_founded_relation(X2))|~(relation(X2)))),inference(distribute,[status(thm)],[42])).
% cnf(44,plain,(well_founded_relation(X1)|~relation(X1)|~is_well_founded_in(X1,relation_field(X1))),inference(split_conjunct,[status(thm)],[43])).
% cnf(45,plain,(is_well_founded_in(X1,relation_field(X1))|~relation(X1)|~well_founded_relation(X1)),inference(split_conjunct,[status(thm)],[43])).
% fof(46, 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)],[8])).
% fof(47, 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)],[46])).
% fof(48, 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)],[47])).
% cnf(49,plain,(well_ordering(X1)|~relation(X1)|~well_founded_relation(X1)|~connected(X1)|~antisymmetric(X1)|~transitive(X1)|~reflexive(X1)),inference(split_conjunct,[status(thm)],[48])).
% cnf(50,plain,(well_founded_relation(X1)|~relation(X1)|~well_ordering(X1)),inference(split_conjunct,[status(thm)],[48])).
% cnf(51,plain,(connected(X1)|~relation(X1)|~well_ordering(X1)),inference(split_conjunct,[status(thm)],[48])).
% cnf(52,plain,(antisymmetric(X1)|~relation(X1)|~well_ordering(X1)),inference(split_conjunct,[status(thm)],[48])).
% cnf(53,plain,(transitive(X1)|~relation(X1)|~well_ordering(X1)),inference(split_conjunct,[status(thm)],[48])).
% cnf(54,plain,(reflexive(X1)|~relation(X1)|~well_ordering(X1)),inference(split_conjunct,[status(thm)],[48])).
% fof(55, plain,![X1]:(~(relation(X1))|![X2]:((~(well_orders(X1,X2))|((((is_reflexive_in(X1,X2)&is_transitive_in(X1,X2))&is_antisymmetric_in(X1,X2))&is_connected_in(X1,X2))&is_well_founded_in(X1,X2)))&(((((~(is_reflexive_in(X1,X2))|~(is_transitive_in(X1,X2)))|~(is_antisymmetric_in(X1,X2)))|~(is_connected_in(X1,X2)))|~(is_well_founded_in(X1,X2)))|well_orders(X1,X2)))),inference(fof_nnf,[status(thm)],[9])).
% fof(56, plain,![X3]:(~(relation(X3))|![X4]:((~(well_orders(X3,X4))|((((is_reflexive_in(X3,X4)&is_transitive_in(X3,X4))&is_antisymmetric_in(X3,X4))&is_connected_in(X3,X4))&is_well_founded_in(X3,X4)))&(((((~(is_reflexive_in(X3,X4))|~(is_transitive_in(X3,X4)))|~(is_antisymmetric_in(X3,X4)))|~(is_connected_in(X3,X4)))|~(is_well_founded_in(X3,X4)))|well_orders(X3,X4)))),inference(variable_rename,[status(thm)],[55])).
% fof(57, plain,![X3]:![X4]:(((~(well_orders(X3,X4))|((((is_reflexive_in(X3,X4)&is_transitive_in(X3,X4))&is_antisymmetric_in(X3,X4))&is_connected_in(X3,X4))&is_well_founded_in(X3,X4)))&(((((~(is_reflexive_in(X3,X4))|~(is_transitive_in(X3,X4)))|~(is_antisymmetric_in(X3,X4)))|~(is_connected_in(X3,X4)))|~(is_well_founded_in(X3,X4)))|well_orders(X3,X4)))|~(relation(X3))),inference(shift_quantors,[status(thm)],[56])).
% fof(58, plain,![X3]:![X4]:(((((((is_reflexive_in(X3,X4)|~(well_orders(X3,X4)))|~(relation(X3)))&((is_transitive_in(X3,X4)|~(well_orders(X3,X4)))|~(relation(X3))))&((is_antisymmetric_in(X3,X4)|~(well_orders(X3,X4)))|~(relation(X3))))&((is_connected_in(X3,X4)|~(well_orders(X3,X4)))|~(relation(X3))))&((is_well_founded_in(X3,X4)|~(well_orders(X3,X4)))|~(relation(X3))))&((((((~(is_reflexive_in(X3,X4))|~(is_transitive_in(X3,X4)))|~(is_antisymmetric_in(X3,X4)))|~(is_connected_in(X3,X4)))|~(is_well_founded_in(X3,X4)))|well_orders(X3,X4))|~(relation(X3)))),inference(distribute,[status(thm)],[57])).
% cnf(59,plain,(well_orders(X1,X2)|~relation(X1)|~is_well_founded_in(X1,X2)|~is_connected_in(X1,X2)|~is_antisymmetric_in(X1,X2)|~is_transitive_in(X1,X2)|~is_reflexive_in(X1,X2)),inference(split_conjunct,[status(thm)],[58])).
% cnf(60,plain,(is_well_founded_in(X1,X2)|~relation(X1)|~well_orders(X1,X2)),inference(split_conjunct,[status(thm)],[58])).
% cnf(61,plain,(is_connected_in(X1,X2)|~relation(X1)|~well_orders(X1,X2)),inference(split_conjunct,[status(thm)],[58])).
% cnf(62,plain,(is_antisymmetric_in(X1,X2)|~relation(X1)|~well_orders(X1,X2)),inference(split_conjunct,[status(thm)],[58])).
% cnf(63,plain,(is_transitive_in(X1,X2)|~relation(X1)|~well_orders(X1,X2)),inference(split_conjunct,[status(thm)],[58])).
% cnf(64,plain,(is_reflexive_in(X1,X2)|~relation(X1)|~well_orders(X1,X2)),inference(split_conjunct,[status(thm)],[58])).
% fof(72, negated_conjecture,?[X1]:(relation(X1)&((~(well_orders(X1,relation_field(X1)))|~(well_ordering(X1)))&(well_orders(X1,relation_field(X1))|well_ordering(X1)))),inference(fof_nnf,[status(thm)],[16])).
% fof(73, negated_conjecture,?[X2]:(relation(X2)&((~(well_orders(X2,relation_field(X2)))|~(well_ordering(X2)))&(well_orders(X2,relation_field(X2))|well_ordering(X2)))),inference(variable_rename,[status(thm)],[72])).
% fof(74, negated_conjecture,(relation(esk1_0)&((~(well_orders(esk1_0,relation_field(esk1_0)))|~(well_ordering(esk1_0)))&(well_orders(esk1_0,relation_field(esk1_0))|well_ordering(esk1_0)))),inference(skolemize,[status(esa)],[73])).
% cnf(75,negated_conjecture,(well_ordering(esk1_0)|well_orders(esk1_0,relation_field(esk1_0))),inference(split_conjunct,[status(thm)],[74])).
% cnf(76,negated_conjecture,(~well_ordering(esk1_0)|~well_orders(esk1_0,relation_field(esk1_0))),inference(split_conjunct,[status(thm)],[74])).
% cnf(77,negated_conjecture,(relation(esk1_0)),inference(split_conjunct,[status(thm)],[74])).
% cnf(82,negated_conjecture,(is_antisymmetric_in(esk1_0,relation_field(esk1_0))|well_ordering(esk1_0)|~relation(esk1_0)),inference(spm,[status(thm)],[62,75,theory(equality)])).
% cnf(83,negated_conjecture,(is_antisymmetric_in(esk1_0,relation_field(esk1_0))|well_ordering(esk1_0)|$false),inference(rw,[status(thm)],[82,77,theory(equality)])).
% cnf(84,negated_conjecture,(is_antisymmetric_in(esk1_0,relation_field(esk1_0))|well_ordering(esk1_0)),inference(cn,[status(thm)],[83,theory(equality)])).
% cnf(85,negated_conjecture,(is_connected_in(esk1_0,relation_field(esk1_0))|well_ordering(esk1_0)|~relation(esk1_0)),inference(spm,[status(thm)],[61,75,theory(equality)])).
% cnf(86,negated_conjecture,(is_connected_in(esk1_0,relation_field(esk1_0))|well_ordering(esk1_0)|$false),inference(rw,[status(thm)],[85,77,theory(equality)])).
% cnf(87,negated_conjecture,(is_connected_in(esk1_0,relation_field(esk1_0))|well_ordering(esk1_0)),inference(cn,[status(thm)],[86,theory(equality)])).
% cnf(88,negated_conjecture,(is_transitive_in(esk1_0,relation_field(esk1_0))|well_ordering(esk1_0)|~relation(esk1_0)),inference(spm,[status(thm)],[63,75,theory(equality)])).
% cnf(89,negated_conjecture,(is_transitive_in(esk1_0,relation_field(esk1_0))|well_ordering(esk1_0)|$false),inference(rw,[status(thm)],[88,77,theory(equality)])).
% cnf(90,negated_conjecture,(is_transitive_in(esk1_0,relation_field(esk1_0))|well_ordering(esk1_0)),inference(cn,[status(thm)],[89,theory(equality)])).
% cnf(91,negated_conjecture,(is_reflexive_in(esk1_0,relation_field(esk1_0))|well_ordering(esk1_0)|~relation(esk1_0)),inference(spm,[status(thm)],[64,75,theory(equality)])).
% cnf(92,negated_conjecture,(is_reflexive_in(esk1_0,relation_field(esk1_0))|well_ordering(esk1_0)|$false),inference(rw,[status(thm)],[91,77,theory(equality)])).
% cnf(93,negated_conjecture,(is_reflexive_in(esk1_0,relation_field(esk1_0))|well_ordering(esk1_0)),inference(cn,[status(thm)],[92,theory(equality)])).
% cnf(94,negated_conjecture,(is_well_founded_in(esk1_0,relation_field(esk1_0))|well_ordering(esk1_0)|~relation(esk1_0)),inference(spm,[status(thm)],[60,75,theory(equality)])).
% cnf(95,negated_conjecture,(is_well_founded_in(esk1_0,relation_field(esk1_0))|well_ordering(esk1_0)|$false),inference(rw,[status(thm)],[94,77,theory(equality)])).
% cnf(96,negated_conjecture,(is_well_founded_in(esk1_0,relation_field(esk1_0))|well_ordering(esk1_0)),inference(cn,[status(thm)],[95,theory(equality)])).
% cnf(103,plain,(well_orders(X1,relation_field(X1))|~is_reflexive_in(X1,relation_field(X1))|~is_transitive_in(X1,relation_field(X1))|~is_connected_in(X1,relation_field(X1))|~is_antisymmetric_in(X1,relation_field(X1))|~relation(X1)|~well_founded_relation(X1)),inference(spm,[status(thm)],[59,45,theory(equality)])).
% cnf(104,negated_conjecture,(antisymmetric(esk1_0)|well_ordering(esk1_0)|~relation(esk1_0)),inference(spm,[status(thm)],[24,84,theory(equality)])).
% cnf(105,negated_conjecture,(antisymmetric(esk1_0)|well_ordering(esk1_0)|$false),inference(rw,[status(thm)],[104,77,theory(equality)])).
% cnf(106,negated_conjecture,(antisymmetric(esk1_0)|well_ordering(esk1_0)),inference(cn,[status(thm)],[105,theory(equality)])).
% cnf(107,negated_conjecture,(connected(esk1_0)|well_ordering(esk1_0)|~relation(esk1_0)),inference(spm,[status(thm)],[29,87,theory(equality)])).
% cnf(108,negated_conjecture,(connected(esk1_0)|well_ordering(esk1_0)|$false),inference(rw,[status(thm)],[107,77,theory(equality)])).
% cnf(109,negated_conjecture,(connected(esk1_0)|well_ordering(esk1_0)),inference(cn,[status(thm)],[108,theory(equality)])).
% cnf(110,negated_conjecture,(transitive(esk1_0)|well_ordering(esk1_0)|~relation(esk1_0)),inference(spm,[status(thm)],[34,90,theory(equality)])).
% cnf(111,negated_conjecture,(transitive(esk1_0)|well_ordering(esk1_0)|$false),inference(rw,[status(thm)],[110,77,theory(equality)])).
% cnf(112,negated_conjecture,(transitive(esk1_0)|well_ordering(esk1_0)),inference(cn,[status(thm)],[111,theory(equality)])).
% cnf(113,negated_conjecture,(reflexive(esk1_0)|well_ordering(esk1_0)|~relation(esk1_0)),inference(spm,[status(thm)],[39,93,theory(equality)])).
% cnf(114,negated_conjecture,(reflexive(esk1_0)|well_ordering(esk1_0)|$false),inference(rw,[status(thm)],[113,77,theory(equality)])).
% cnf(115,negated_conjecture,(reflexive(esk1_0)|well_ordering(esk1_0)),inference(cn,[status(thm)],[114,theory(equality)])).
% cnf(117,negated_conjecture,(well_founded_relation(esk1_0)|well_ordering(esk1_0)|~relation(esk1_0)),inference(spm,[status(thm)],[44,96,theory(equality)])).
% cnf(120,negated_conjecture,(well_founded_relation(esk1_0)|well_ordering(esk1_0)|$false),inference(rw,[status(thm)],[117,77,theory(equality)])).
% cnf(121,negated_conjecture,(well_founded_relation(esk1_0)|well_ordering(esk1_0)),inference(cn,[status(thm)],[120,theory(equality)])).
% cnf(122,negated_conjecture,(well_ordering(esk1_0)|~reflexive(esk1_0)|~transitive(esk1_0)|~connected(esk1_0)|~antisymmetric(esk1_0)|~relation(esk1_0)),inference(spm,[status(thm)],[49,121,theory(equality)])).
% cnf(123,negated_conjecture,(well_ordering(esk1_0)|~reflexive(esk1_0)|~transitive(esk1_0)|~connected(esk1_0)|~antisymmetric(esk1_0)|$false),inference(rw,[status(thm)],[122,77,theory(equality)])).
% cnf(124,negated_conjecture,(well_ordering(esk1_0)|~reflexive(esk1_0)|~transitive(esk1_0)|~connected(esk1_0)|~antisymmetric(esk1_0)),inference(cn,[status(thm)],[123,theory(equality)])).
% cnf(125,negated_conjecture,(well_ordering(esk1_0)|~reflexive(esk1_0)|~transitive(esk1_0)|~connected(esk1_0)),inference(csr,[status(thm)],[124,106])).
% cnf(126,negated_conjecture,(well_ordering(esk1_0)|~reflexive(esk1_0)|~transitive(esk1_0)),inference(csr,[status(thm)],[125,109])).
% cnf(127,negated_conjecture,(well_ordering(esk1_0)|~reflexive(esk1_0)),inference(csr,[status(thm)],[126,112])).
% cnf(128,negated_conjecture,(well_ordering(esk1_0)),inference(csr,[status(thm)],[127,115])).
% cnf(139,negated_conjecture,(~well_orders(esk1_0,relation_field(esk1_0))|$false),inference(rw,[status(thm)],[76,128,theory(equality)])).
% cnf(140,negated_conjecture,(~well_orders(esk1_0,relation_field(esk1_0))),inference(cn,[status(thm)],[139,theory(equality)])).
% cnf(142,plain,(well_orders(X1,relation_field(X1))|~well_founded_relation(X1)|~is_transitive_in(X1,relation_field(X1))|~is_connected_in(X1,relation_field(X1))|~is_antisymmetric_in(X1,relation_field(X1))|~relation(X1)|~reflexive(X1)),inference(spm,[status(thm)],[103,40,theory(equality)])).
% cnf(143,plain,(well_orders(X1,relation_field(X1))|~well_founded_relation(X1)|~reflexive(X1)|~is_connected_in(X1,relation_field(X1))|~is_antisymmetric_in(X1,relation_field(X1))|~relation(X1)|~transitive(X1)),inference(spm,[status(thm)],[142,35,theory(equality)])).
% cnf(144,plain,(well_orders(X1,relation_field(X1))|~well_founded_relation(X1)|~reflexive(X1)|~transitive(X1)|~is_antisymmetric_in(X1,relation_field(X1))|~relation(X1)|~connected(X1)),inference(spm,[status(thm)],[143,30,theory(equality)])).
% cnf(145,plain,(well_orders(X1,relation_field(X1))|~well_founded_relation(X1)|~reflexive(X1)|~transitive(X1)|~connected(X1)|~relation(X1)|~antisymmetric(X1)),inference(spm,[status(thm)],[144,25,theory(equality)])).
% cnf(146,negated_conjecture,(~well_founded_relation(esk1_0)|~reflexive(esk1_0)|~transitive(esk1_0)|~connected(esk1_0)|~antisymmetric(esk1_0)|~relation(esk1_0)),inference(spm,[status(thm)],[140,145,theory(equality)])).
% cnf(152,negated_conjecture,(~well_founded_relation(esk1_0)|~reflexive(esk1_0)|~transitive(esk1_0)|~connected(esk1_0)|~antisymmetric(esk1_0)|$false),inference(rw,[status(thm)],[146,77,theory(equality)])).
% cnf(153,negated_conjecture,(~well_founded_relation(esk1_0)|~reflexive(esk1_0)|~transitive(esk1_0)|~connected(esk1_0)|~antisymmetric(esk1_0)),inference(cn,[status(thm)],[152,theory(equality)])).
% cnf(154,negated_conjecture,(~reflexive(esk1_0)|~transitive(esk1_0)|~connected(esk1_0)|~antisymmetric(esk1_0)|~well_ordering(esk1_0)|~relation(esk1_0)),inference(spm,[status(thm)],[153,50,theory(equality)])).
% cnf(155,negated_conjecture,(~reflexive(esk1_0)|~transitive(esk1_0)|~connected(esk1_0)|~antisymmetric(esk1_0)|$false|~relation(esk1_0)),inference(rw,[status(thm)],[154,128,theory(equality)])).
% cnf(156,negated_conjecture,(~reflexive(esk1_0)|~transitive(esk1_0)|~connected(esk1_0)|~antisymmetric(esk1_0)|$false|$false),inference(rw,[status(thm)],[155,77,theory(equality)])).
% cnf(157,negated_conjecture,(~reflexive(esk1_0)|~transitive(esk1_0)|~connected(esk1_0)|~antisymmetric(esk1_0)),inference(cn,[status(thm)],[156,theory(equality)])).
% cnf(158,negated_conjecture,(~transitive(esk1_0)|~connected(esk1_0)|~antisymmetric(esk1_0)|~well_ordering(esk1_0)|~relation(esk1_0)),inference(spm,[status(thm)],[157,54,theory(equality)])).
% cnf(159,negated_conjecture,(~transitive(esk1_0)|~connected(esk1_0)|~antisymmetric(esk1_0)|$false|~relation(esk1_0)),inference(rw,[status(thm)],[158,128,theory(equality)])).
% cnf(160,negated_conjecture,(~transitive(esk1_0)|~connected(esk1_0)|~antisymmetric(esk1_0)|$false|$false),inference(rw,[status(thm)],[159,77,theory(equality)])).
% cnf(161,negated_conjecture,(~transitive(esk1_0)|~connected(esk1_0)|~antisymmetric(esk1_0)),inference(cn,[status(thm)],[160,theory(equality)])).
% cnf(162,negated_conjecture,(~connected(esk1_0)|~antisymmetric(esk1_0)|~well_ordering(esk1_0)|~relation(esk1_0)),inference(spm,[status(thm)],[161,53,theory(equality)])).
% cnf(163,negated_conjecture,(~connected(esk1_0)|~antisymmetric(esk1_0)|$false|~relation(esk1_0)),inference(rw,[status(thm)],[162,128,theory(equality)])).
% cnf(164,negated_conjecture,(~connected(esk1_0)|~antisymmetric(esk1_0)|$false|$false),inference(rw,[status(thm)],[163,77,theory(equality)])).
% cnf(165,negated_conjecture,(~connected(esk1_0)|~antisymmetric(esk1_0)),inference(cn,[status(thm)],[164,theory(equality)])).
% cnf(178,negated_conjecture,(~antisymmetric(esk1_0)|~well_ordering(esk1_0)|~relation(esk1_0)),inference(spm,[status(thm)],[165,51,theory(equality)])).
% cnf(179,negated_conjecture,(~antisymmetric(esk1_0)|$false|~relation(esk1_0)),inference(rw,[status(thm)],[178,128,theory(equality)])).
% cnf(180,negated_conjecture,(~antisymmetric(esk1_0)|$false|$false),inference(rw,[status(thm)],[179,77,theory(equality)])).
% cnf(181,negated_conjecture,(~antisymmetric(esk1_0)),inference(cn,[status(thm)],[180,theory(equality)])).
% cnf(186,negated_conjecture,(~well_ordering(esk1_0)|~relation(esk1_0)),inference(spm,[status(thm)],[181,52,theory(equality)])).
% cnf(187,negated_conjecture,($false|~relation(esk1_0)),inference(rw,[status(thm)],[186,128,theory(equality)])).
% cnf(188,negated_conjecture,($false|$false),inference(rw,[status(thm)],[187,77,theory(equality)])).
% cnf(189,negated_conjecture,($false),inference(cn,[status(thm)],[188,theory(equality)])).
% cnf(190,negated_conjecture,($false),189,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 82
% # ...of these trivial : 0
% # ...subsumed : 4
% # ...remaining for further processing: 78
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 12
% # Generated clauses : 36
% # ...of the previous two non-trivial : 28
% # Contextual simplify-reflections : 20
% # Paramodulations : 36
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 35
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 29
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 7
% # Clause-clause subsumption calls (NU) : 27
% # Rec. Clause-clause subsumption calls : 27
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 32 leaves, 1.06+/-0.348 terms/leaf
% # Paramod-from index: 15 leaves, 1.13+/-0.499 terms/leaf
% # Paramod-into index: 25 leaves, 1.08+/-0.392 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.09 CPU 0.19 WC
% FINAL PrfWatch: 0.09 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP5082/SEU244+1.tptp
%
%------------------------------------------------------------------------------