↑ Up

SRASS---0.1.THM-Sol.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SEU340+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 : art07.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 03:45:41 EST 2010

% Result   : Theorem 12.62s
% Output   : Solution 12.62s
% 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/SystemOnTPTP26418/SEU340+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP26418/SEU340+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26418/SEU340+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 26514
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.94 CPU 2.02 WC
% PrfWatch: 3.93 CPU 4.03 WC
% PrfWatch: 5.92 CPU 6.03 WC
% PrfWatch: 7.91 CPU 8.04 WC
% # Preprocessing time     : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 9.91 CPU 10.04 WC
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:?[X2]:element(X2,X1),file('/tmp/SRASS.s.p', existence_m1_subset_1)).
% fof(3, axiom,![X1]:(rel_str(X1)=>(transitive_relstr(X1)<=>is_transitive_in(the_InternalRel(X1),the_carrier(X1)))),file('/tmp/SRASS.s.p', d5_orders_2)).
% fof(4, axiom,![X1]:(rel_str(X1)=>![X2]:(element(X2,the_carrier(X1))=>![X3]:(element(X3,the_carrier(X1))=>(related(X1,X2,X3)<=>in(ordered_pair(X2,X3),the_InternalRel(X1)))))),file('/tmp/SRASS.s.p', d9_orders_2)).
% fof(6, axiom,![X1]:(rel_str(X1)=>relation_of2_as_subset(the_InternalRel(X1),the_carrier(X1),the_carrier(X1))),file('/tmp/SRASS.s.p', dt_u1_orders_2)).
% fof(10, axiom,![X1]:![X2]:(in(X1,X2)=>element(X1,X2)),file('/tmp/SRASS.s.p', t1_subset)).
% fof(12, axiom,![X1]:![X2]:(element(X1,X2)=>(empty(X2)|in(X1,X2))),file('/tmp/SRASS.s.p', t2_subset)).
% fof(18, axiom,![X1]:![X2]:![X3]:![X4]:(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))<=>(in(X1,X3)&in(X2,X4))),file('/tmp/SRASS.s.p', t106_zfmisc_1)).
% fof(19, axiom,![X1]:![X2]:![X3]:((in(X1,X2)&element(X2,powerset(X3)))=>element(X1,X3)),file('/tmp/SRASS.s.p', t4_subset)).
% fof(21, axiom,![X1]:![X2]:~((in(X1,X2)&empty(X2))),file('/tmp/SRASS.s.p', t7_boole)).
% fof(22, axiom,![X1]:![X2]:![X3]:~(((in(X1,X2)&element(X2,powerset(X3)))&empty(X3))),file('/tmp/SRASS.s.p', t5_subset)).
% fof(23, axiom,![X1]:(relation(X1)=>![X2]:(is_transitive_in(X1,X2)<=>![X3]:![X4]:![X5]:(((((in(X3,X2)&in(X4,X2))&in(X5,X2))&in(ordered_pair(X3,X4),X1))&in(ordered_pair(X4,X5),X1))=>in(ordered_pair(X3,X5),X1)))),file('/tmp/SRASS.s.p', d8_relat_2)).
% fof(25, axiom,![X1]:![X2]:~(((empty(X1)&~(X1=X2))&empty(X2))),file('/tmp/SRASS.s.p', t8_boole)).
% fof(26, axiom,empty(empty_set),file('/tmp/SRASS.s.p', fc1_xboole_0)).
% fof(32, axiom,![X1]:![X2]:![X3]:(element(X3,powerset(cartesian_product2(X1,X2)))=>relation(X3)),file('/tmp/SRASS.s.p', cc1_relset_1)).
% fof(33, axiom,![X1]:![X2]:![X3]:(relation_of2_as_subset(X3,X1,X2)=>element(X3,powerset(cartesian_product2(X1,X2)))),file('/tmp/SRASS.s.p', dt_m2_relset_1)).
% fof(35, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(46, conjecture,![X1]:((transitive_relstr(X1)&rel_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>![X3]:(element(X3,the_carrier(X1))=>![X4]:(element(X4,the_carrier(X1))=>((related(X1,X2,X3)&related(X1,X3,X4))=>related(X1,X2,X4)))))),file('/tmp/SRASS.s.p', t26_orders_2)).
% fof(47, negated_conjecture,~(![X1]:((transitive_relstr(X1)&rel_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>![X3]:(element(X3,the_carrier(X1))=>![X4]:(element(X4,the_carrier(X1))=>((related(X1,X2,X3)&related(X1,X3,X4))=>related(X1,X2,X4))))))),inference(assume_negation,[status(cth)],[46])).
% fof(58, plain,![X3]:?[X4]:element(X4,X3),inference(variable_rename,[status(thm)],[2])).
% fof(59, plain,![X3]:element(esk2_1(X3),X3),inference(skolemize,[status(esa)],[58])).
% cnf(60,plain,(element(esk2_1(X1),X1)),inference(split_conjunct,[status(thm)],[59])).
% fof(61, plain,![X1]:(~(rel_str(X1))|((~(transitive_relstr(X1))|is_transitive_in(the_InternalRel(X1),the_carrier(X1)))&(~(is_transitive_in(the_InternalRel(X1),the_carrier(X1)))|transitive_relstr(X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(62, plain,![X2]:(~(rel_str(X2))|((~(transitive_relstr(X2))|is_transitive_in(the_InternalRel(X2),the_carrier(X2)))&(~(is_transitive_in(the_InternalRel(X2),the_carrier(X2)))|transitive_relstr(X2)))),inference(variable_rename,[status(thm)],[61])).
% fof(63, plain,![X2]:(((~(transitive_relstr(X2))|is_transitive_in(the_InternalRel(X2),the_carrier(X2)))|~(rel_str(X2)))&((~(is_transitive_in(the_InternalRel(X2),the_carrier(X2)))|transitive_relstr(X2))|~(rel_str(X2)))),inference(distribute,[status(thm)],[62])).
% cnf(65,plain,(is_transitive_in(the_InternalRel(X1),the_carrier(X1))|~rel_str(X1)|~transitive_relstr(X1)),inference(split_conjunct,[status(thm)],[63])).
% fof(66, plain,![X1]:(~(rel_str(X1))|![X2]:(~(element(X2,the_carrier(X1)))|![X3]:(~(element(X3,the_carrier(X1)))|((~(related(X1,X2,X3))|in(ordered_pair(X2,X3),the_InternalRel(X1)))&(~(in(ordered_pair(X2,X3),the_InternalRel(X1)))|related(X1,X2,X3)))))),inference(fof_nnf,[status(thm)],[4])).
% fof(67, plain,![X4]:(~(rel_str(X4))|![X5]:(~(element(X5,the_carrier(X4)))|![X6]:(~(element(X6,the_carrier(X4)))|((~(related(X4,X5,X6))|in(ordered_pair(X5,X6),the_InternalRel(X4)))&(~(in(ordered_pair(X5,X6),the_InternalRel(X4)))|related(X4,X5,X6)))))),inference(variable_rename,[status(thm)],[66])).
% fof(68, plain,![X4]:![X5]:![X6]:(((~(element(X6,the_carrier(X4)))|((~(related(X4,X5,X6))|in(ordered_pair(X5,X6),the_InternalRel(X4)))&(~(in(ordered_pair(X5,X6),the_InternalRel(X4)))|related(X4,X5,X6))))|~(element(X5,the_carrier(X4))))|~(rel_str(X4))),inference(shift_quantors,[status(thm)],[67])).
% fof(69, plain,![X4]:![X5]:![X6]:(((((~(related(X4,X5,X6))|in(ordered_pair(X5,X6),the_InternalRel(X4)))|~(element(X6,the_carrier(X4))))|~(element(X5,the_carrier(X4))))|~(rel_str(X4)))&((((~(in(ordered_pair(X5,X6),the_InternalRel(X4)))|related(X4,X5,X6))|~(element(X6,the_carrier(X4))))|~(element(X5,the_carrier(X4))))|~(rel_str(X4)))),inference(distribute,[status(thm)],[68])).
% cnf(70,plain,(related(X1,X2,X3)|~rel_str(X1)|~element(X2,the_carrier(X1))|~element(X3,the_carrier(X1))|~in(ordered_pair(X2,X3),the_InternalRel(X1))),inference(split_conjunct,[status(thm)],[69])).
% cnf(71,plain,(in(ordered_pair(X2,X3),the_InternalRel(X1))|~rel_str(X1)|~element(X2,the_carrier(X1))|~element(X3,the_carrier(X1))|~related(X1,X2,X3)),inference(split_conjunct,[status(thm)],[69])).
% fof(75, plain,![X1]:(~(rel_str(X1))|relation_of2_as_subset(the_InternalRel(X1),the_carrier(X1),the_carrier(X1))),inference(fof_nnf,[status(thm)],[6])).
% fof(76, plain,![X2]:(~(rel_str(X2))|relation_of2_as_subset(the_InternalRel(X2),the_carrier(X2),the_carrier(X2))),inference(variable_rename,[status(thm)],[75])).
% cnf(77,plain,(relation_of2_as_subset(the_InternalRel(X1),the_carrier(X1),the_carrier(X1))|~rel_str(X1)),inference(split_conjunct,[status(thm)],[76])).
% fof(86, plain,![X1]:![X2]:(~(in(X1,X2))|element(X1,X2)),inference(fof_nnf,[status(thm)],[10])).
% fof(87, plain,![X3]:![X4]:(~(in(X3,X4))|element(X3,X4)),inference(variable_rename,[status(thm)],[86])).
% cnf(88,plain,(element(X1,X2)|~in(X1,X2)),inference(split_conjunct,[status(thm)],[87])).
% fof(92, plain,![X1]:![X2]:(~(element(X1,X2))|(empty(X2)|in(X1,X2))),inference(fof_nnf,[status(thm)],[12])).
% fof(93, plain,![X3]:![X4]:(~(element(X3,X4))|(empty(X4)|in(X3,X4))),inference(variable_rename,[status(thm)],[92])).
% cnf(94,plain,(in(X1,X2)|empty(X2)|~element(X1,X2)),inference(split_conjunct,[status(thm)],[93])).
% fof(114, plain,![X1]:![X2]:![X3]:![X4]:((~(in(ordered_pair(X1,X2),cartesian_product2(X3,X4)))|(in(X1,X3)&in(X2,X4)))&((~(in(X1,X3))|~(in(X2,X4)))|in(ordered_pair(X1,X2),cartesian_product2(X3,X4)))),inference(fof_nnf,[status(thm)],[18])).
% fof(115, plain,![X5]:![X6]:![X7]:![X8]:((~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))|(in(X5,X7)&in(X6,X8)))&((~(in(X5,X7))|~(in(X6,X8)))|in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))),inference(variable_rename,[status(thm)],[114])).
% fof(116, plain,![X5]:![X6]:![X7]:![X8]:(((in(X5,X7)|~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8))))&(in(X6,X8)|~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))))&((~(in(X5,X7))|~(in(X6,X8)))|in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))),inference(distribute,[status(thm)],[115])).
% cnf(118,plain,(in(X2,X4)|~in(ordered_pair(X1,X2),cartesian_product2(X3,X4))),inference(split_conjunct,[status(thm)],[116])).
% fof(120, plain,![X1]:![X2]:![X3]:((~(in(X1,X2))|~(element(X2,powerset(X3))))|element(X1,X3)),inference(fof_nnf,[status(thm)],[19])).
% fof(121, plain,![X4]:![X5]:![X6]:((~(in(X4,X5))|~(element(X5,powerset(X6))))|element(X4,X6)),inference(variable_rename,[status(thm)],[120])).
% cnf(122,plain,(element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3)),inference(split_conjunct,[status(thm)],[121])).
% fof(127, plain,![X1]:![X2]:(~(in(X1,X2))|~(empty(X2))),inference(fof_nnf,[status(thm)],[21])).
% fof(128, plain,![X3]:![X4]:(~(in(X3,X4))|~(empty(X4))),inference(variable_rename,[status(thm)],[127])).
% cnf(129,plain,(~empty(X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[128])).
% fof(130, plain,![X1]:![X2]:![X3]:((~(in(X1,X2))|~(element(X2,powerset(X3))))|~(empty(X3))),inference(fof_nnf,[status(thm)],[22])).
% fof(131, plain,![X4]:![X5]:![X6]:((~(in(X4,X5))|~(element(X5,powerset(X6))))|~(empty(X6))),inference(variable_rename,[status(thm)],[130])).
% cnf(132,plain,(~empty(X1)|~element(X2,powerset(X1))|~in(X3,X2)),inference(split_conjunct,[status(thm)],[131])).
% fof(133, plain,![X1]:(~(relation(X1))|![X2]:((~(is_transitive_in(X1,X2))|![X3]:![X4]:![X5]:(((((~(in(X3,X2))|~(in(X4,X2)))|~(in(X5,X2)))|~(in(ordered_pair(X3,X4),X1)))|~(in(ordered_pair(X4,X5),X1)))|in(ordered_pair(X3,X5),X1)))&(?[X3]:?[X4]:?[X5]:(((((in(X3,X2)&in(X4,X2))&in(X5,X2))&in(ordered_pair(X3,X4),X1))&in(ordered_pair(X4,X5),X1))&~(in(ordered_pair(X3,X5),X1)))|is_transitive_in(X1,X2)))),inference(fof_nnf,[status(thm)],[23])).
% fof(134, plain,![X6]:(~(relation(X6))|![X7]:((~(is_transitive_in(X6,X7))|![X8]:![X9]:![X10]:(((((~(in(X8,X7))|~(in(X9,X7)))|~(in(X10,X7)))|~(in(ordered_pair(X8,X9),X6)))|~(in(ordered_pair(X9,X10),X6)))|in(ordered_pair(X8,X10),X6)))&(?[X11]:?[X12]:?[X13]:(((((in(X11,X7)&in(X12,X7))&in(X13,X7))&in(ordered_pair(X11,X12),X6))&in(ordered_pair(X12,X13),X6))&~(in(ordered_pair(X11,X13),X6)))|is_transitive_in(X6,X7)))),inference(variable_rename,[status(thm)],[133])).
% fof(135, plain,![X6]:(~(relation(X6))|![X7]:((~(is_transitive_in(X6,X7))|![X8]:![X9]:![X10]:(((((~(in(X8,X7))|~(in(X9,X7)))|~(in(X10,X7)))|~(in(ordered_pair(X8,X9),X6)))|~(in(ordered_pair(X9,X10),X6)))|in(ordered_pair(X8,X10),X6)))&((((((in(esk10_2(X6,X7),X7)&in(esk11_2(X6,X7),X7))&in(esk12_2(X6,X7),X7))&in(ordered_pair(esk10_2(X6,X7),esk11_2(X6,X7)),X6))&in(ordered_pair(esk11_2(X6,X7),esk12_2(X6,X7)),X6))&~(in(ordered_pair(esk10_2(X6,X7),esk12_2(X6,X7)),X6)))|is_transitive_in(X6,X7)))),inference(skolemize,[status(esa)],[134])).
% fof(136, plain,![X6]:![X7]:![X8]:![X9]:![X10]:((((((((~(in(X8,X7))|~(in(X9,X7)))|~(in(X10,X7)))|~(in(ordered_pair(X8,X9),X6)))|~(in(ordered_pair(X9,X10),X6)))|in(ordered_pair(X8,X10),X6))|~(is_transitive_in(X6,X7)))&((((((in(esk10_2(X6,X7),X7)&in(esk11_2(X6,X7),X7))&in(esk12_2(X6,X7),X7))&in(ordered_pair(esk10_2(X6,X7),esk11_2(X6,X7)),X6))&in(ordered_pair(esk11_2(X6,X7),esk12_2(X6,X7)),X6))&~(in(ordered_pair(esk10_2(X6,X7),esk12_2(X6,X7)),X6)))|is_transitive_in(X6,X7)))|~(relation(X6))),inference(shift_quantors,[status(thm)],[135])).
% fof(137, plain,![X6]:![X7]:![X8]:![X9]:![X10]:((((((((~(in(X8,X7))|~(in(X9,X7)))|~(in(X10,X7)))|~(in(ordered_pair(X8,X9),X6)))|~(in(ordered_pair(X9,X10),X6)))|in(ordered_pair(X8,X10),X6))|~(is_transitive_in(X6,X7)))|~(relation(X6)))&(((((((in(esk10_2(X6,X7),X7)|is_transitive_in(X6,X7))|~(relation(X6)))&((in(esk11_2(X6,X7),X7)|is_transitive_in(X6,X7))|~(relation(X6))))&((in(esk12_2(X6,X7),X7)|is_transitive_in(X6,X7))|~(relation(X6))))&((in(ordered_pair(esk10_2(X6,X7),esk11_2(X6,X7)),X6)|is_transitive_in(X6,X7))|~(relation(X6))))&((in(ordered_pair(esk11_2(X6,X7),esk12_2(X6,X7)),X6)|is_transitive_in(X6,X7))|~(relation(X6))))&((~(in(ordered_pair(esk10_2(X6,X7),esk12_2(X6,X7)),X6))|is_transitive_in(X6,X7))|~(relation(X6))))),inference(distribute,[status(thm)],[136])).
% cnf(144,plain,(in(ordered_pair(X3,X4),X1)|~relation(X1)|~is_transitive_in(X1,X2)|~in(ordered_pair(X5,X4),X1)|~in(ordered_pair(X3,X5),X1)|~in(X4,X2)|~in(X5,X2)|~in(X3,X2)),inference(split_conjunct,[status(thm)],[137])).
% fof(149, plain,![X1]:![X2]:((~(empty(X1))|X1=X2)|~(empty(X2))),inference(fof_nnf,[status(thm)],[25])).
% fof(150, plain,![X3]:![X4]:((~(empty(X3))|X3=X4)|~(empty(X4))),inference(variable_rename,[status(thm)],[149])).
% cnf(151,plain,(X2=X1|~empty(X1)|~empty(X2)),inference(split_conjunct,[status(thm)],[150])).
% cnf(152,plain,(empty(empty_set)),inference(split_conjunct,[status(thm)],[26])).
% fof(164, plain,![X1]:![X2]:![X3]:(~(element(X3,powerset(cartesian_product2(X1,X2))))|relation(X3)),inference(fof_nnf,[status(thm)],[32])).
% fof(165, plain,![X4]:![X5]:![X6]:(~(element(X6,powerset(cartesian_product2(X4,X5))))|relation(X6)),inference(variable_rename,[status(thm)],[164])).
% cnf(166,plain,(relation(X1)|~element(X1,powerset(cartesian_product2(X2,X3)))),inference(split_conjunct,[status(thm)],[165])).
% fof(167, plain,![X1]:![X2]:![X3]:(~(relation_of2_as_subset(X3,X1,X2))|element(X3,powerset(cartesian_product2(X1,X2)))),inference(fof_nnf,[status(thm)],[33])).
% fof(168, plain,![X4]:![X5]:![X6]:(~(relation_of2_as_subset(X6,X4,X5))|element(X6,powerset(cartesian_product2(X4,X5)))),inference(variable_rename,[status(thm)],[167])).
% cnf(169,plain,(element(X1,powerset(cartesian_product2(X2,X3)))|~relation_of2_as_subset(X1,X2,X3)),inference(split_conjunct,[status(thm)],[168])).
% fof(173, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[35])).
% cnf(174,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[173])).
% fof(185, negated_conjecture,?[X1]:((transitive_relstr(X1)&rel_str(X1))&?[X2]:(element(X2,the_carrier(X1))&?[X3]:(element(X3,the_carrier(X1))&?[X4]:(element(X4,the_carrier(X1))&((related(X1,X2,X3)&related(X1,X3,X4))&~(related(X1,X2,X4))))))),inference(fof_nnf,[status(thm)],[47])).
% fof(186, negated_conjecture,?[X5]:((transitive_relstr(X5)&rel_str(X5))&?[X6]:(element(X6,the_carrier(X5))&?[X7]:(element(X7,the_carrier(X5))&?[X8]:(element(X8,the_carrier(X5))&((related(X5,X6,X7)&related(X5,X7,X8))&~(related(X5,X6,X8))))))),inference(variable_rename,[status(thm)],[185])).
% fof(187, negated_conjecture,((transitive_relstr(esk13_0)&rel_str(esk13_0))&(element(esk14_0,the_carrier(esk13_0))&(element(esk15_0,the_carrier(esk13_0))&(element(esk16_0,the_carrier(esk13_0))&((related(esk13_0,esk14_0,esk15_0)&related(esk13_0,esk15_0,esk16_0))&~(related(esk13_0,esk14_0,esk16_0))))))),inference(skolemize,[status(esa)],[186])).
% cnf(188,negated_conjecture,(~related(esk13_0,esk14_0,esk16_0)),inference(split_conjunct,[status(thm)],[187])).
% cnf(189,negated_conjecture,(related(esk13_0,esk15_0,esk16_0)),inference(split_conjunct,[status(thm)],[187])).
% cnf(190,negated_conjecture,(related(esk13_0,esk14_0,esk15_0)),inference(split_conjunct,[status(thm)],[187])).
% cnf(191,negated_conjecture,(element(esk16_0,the_carrier(esk13_0))),inference(split_conjunct,[status(thm)],[187])).
% cnf(192,negated_conjecture,(element(esk15_0,the_carrier(esk13_0))),inference(split_conjunct,[status(thm)],[187])).
% cnf(193,negated_conjecture,(element(esk14_0,the_carrier(esk13_0))),inference(split_conjunct,[status(thm)],[187])).
% cnf(194,negated_conjecture,(rel_str(esk13_0)),inference(split_conjunct,[status(thm)],[187])).
% cnf(195,negated_conjecture,(transitive_relstr(esk13_0)),inference(split_conjunct,[status(thm)],[187])).
% cnf(196,plain,(in(X2,X4)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))),inference(rw,[status(thm)],[118,174,theory(equality)]),['unfolding']).
% cnf(202,plain,(related(X1,X2,X3)|~rel_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1))|~in(unordered_pair(unordered_pair(X2,X3),singleton(X2)),the_InternalRel(X1))),inference(rw,[status(thm)],[70,174,theory(equality)]),['unfolding']).
% cnf(203,plain,(in(unordered_pair(unordered_pair(X2,X3),singleton(X2)),the_InternalRel(X1))|~rel_str(X1)|~related(X1,X2,X3)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1))),inference(rw,[status(thm)],[71,174,theory(equality)]),['unfolding']).
% cnf(204,plain,(in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),X1)|~relation(X1)|~is_transitive_in(X1,X2)|~in(X5,X2)|~in(X4,X2)|~in(X3,X2)|~in(unordered_pair(unordered_pair(X5,X4),singleton(X5)),X1)|~in(unordered_pair(unordered_pair(X3,X5),singleton(X3)),X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[144,174,theory(equality)]),174,theory(equality)]),174,theory(equality)]),['unfolding']).
% cnf(216,plain,(~empty(X1)|~in(X2,esk2_1(powerset(X1)))),inference(spm,[status(thm)],[132,60,theory(equality)])).
% cnf(224,plain,(element(X1,X2)|~in(X1,esk2_1(powerset(X2)))),inference(spm,[status(thm)],[122,60,theory(equality)])).
% cnf(228,negated_conjecture,(empty(the_carrier(esk13_0))|in(esk15_0,the_carrier(esk13_0))),inference(spm,[status(thm)],[94,192,theory(equality)])).
% cnf(229,negated_conjecture,(empty(the_carrier(esk13_0))|in(esk14_0,the_carrier(esk13_0))),inference(spm,[status(thm)],[94,193,theory(equality)])).
% cnf(232,plain,(empty(X1)|in(esk2_1(X1),X1)),inference(spm,[status(thm)],[94,60,theory(equality)])).
% cnf(238,plain,(element(X1,cartesian_product2(X2,X3))|~in(X1,X4)|~relation_of2_as_subset(X4,X2,X3)),inference(spm,[status(thm)],[122,169,theory(equality)])).
% cnf(239,plain,(~empty(cartesian_product2(X1,X2))|~in(X3,X4)|~relation_of2_as_subset(X4,X1,X2)),inference(spm,[status(thm)],[132,169,theory(equality)])).
% cnf(240,plain,(relation(X1)|~relation_of2_as_subset(X1,X2,X3)),inference(spm,[status(thm)],[166,169,theory(equality)])).
% cnf(288,plain,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),the_InternalRel(X3))|~relation(the_InternalRel(X3))|~in(unordered_pair(unordered_pair(X1,X4),singleton(X1)),the_InternalRel(X3))|~in(X4,X5)|~in(X2,X5)|~in(X1,X5)|~is_transitive_in(the_InternalRel(X3),X5)|~related(X3,X4,X2)|~element(X2,the_carrier(X3))|~element(X4,the_carrier(X3))|~rel_str(X3)),inference(spm,[status(thm)],[204,203,theory(equality)])).
% cnf(306,plain,(relation(the_InternalRel(X1))|~rel_str(X1)),inference(spm,[status(thm)],[240,77,theory(equality)])).
% cnf(316,plain,(empty(esk2_1(powerset(X1)))|~empty(X1)),inference(spm,[status(thm)],[216,232,theory(equality)])).
% cnf(335,negated_conjecture,(X1=the_carrier(esk13_0)|in(esk14_0,the_carrier(esk13_0))|~empty(X1)),inference(spm,[status(thm)],[151,229,theory(equality)])).
% cnf(356,plain,(element(esk2_1(esk2_1(powerset(X1))),X1)|empty(esk2_1(powerset(X1)))),inference(spm,[status(thm)],[224,232,theory(equality)])).
% cnf(429,plain,(element(X1,cartesian_product2(the_carrier(X2),the_carrier(X2)))|~in(X1,the_InternalRel(X2))|~rel_str(X2)),inference(spm,[status(thm)],[238,77,theory(equality)])).
% cnf(464,plain,(X1=esk2_1(powerset(X2))|~empty(X1)|~empty(X2)),inference(spm,[status(thm)],[151,316,theory(equality)])).
% cnf(469,negated_conjecture,(the_carrier(esk13_0)=esk2_1(powerset(X1))|in(esk14_0,the_carrier(esk13_0))|~empty(X1)),inference(spm,[status(thm)],[464,229,theory(equality)])).
% cnf(517,plain,(empty(cartesian_product2(the_carrier(X1),the_carrier(X1)))|in(X2,cartesian_product2(the_carrier(X1),the_carrier(X1)))|~in(X2,the_InternalRel(X1))|~rel_str(X1)),inference(spm,[status(thm)],[94,429,theory(equality)])).
% cnf(679,negated_conjecture,(in(esk14_0,the_carrier(esk13_0))|~empty(X1)|~in(X2,the_carrier(esk13_0))),inference(spm,[status(thm)],[216,469,theory(equality)])).
% cnf(728,plain,(empty(X1)|in(esk2_1(esk2_1(powerset(X1))),X1)|empty(esk2_1(powerset(X1)))),inference(spm,[status(thm)],[94,356,theory(equality)])).
% cnf(936,plain,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),the_InternalRel(X3))|~in(unordered_pair(unordered_pair(X1,X4),singleton(X1)),the_InternalRel(X3))|~in(X4,X5)|~in(X2,X5)|~in(X1,X5)|~related(X3,X4,X2)|~is_transitive_in(the_InternalRel(X3),X5)|~element(X2,the_carrier(X3))|~element(X4,the_carrier(X3))|~rel_str(X3)),inference(csr,[status(thm)],[288,306])).
% cnf(941,plain,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),the_InternalRel(X3))|~in(X4,X5)|~in(X2,X5)|~in(X1,X5)|~related(X3,X4,X2)|~is_transitive_in(the_InternalRel(X3),X5)|~element(X2,the_carrier(X3))|~element(X4,the_carrier(X3))|~rel_str(X3)|~related(X3,X1,X4)|~element(X1,the_carrier(X3))),inference(spm,[status(thm)],[936,203,theory(equality)])).
% cnf(1643,plain,(empty(cartesian_product2(the_carrier(X1),the_carrier(X1)))|in(unordered_pair(unordered_pair(X2,X3),singleton(X2)),cartesian_product2(the_carrier(X1),the_carrier(X1)))|~rel_str(X1)|~related(X1,X2,X3)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1))),inference(spm,[status(thm)],[517,203,theory(equality)])).
% cnf(1809,plain,(empty(esk2_1(powerset(X1)))|in(esk2_1(esk2_1(powerset(X1))),X1)),inference(csr,[status(thm)],[728,316])).
% cnf(1835,negated_conjecture,(in(esk14_0,the_carrier(esk13_0))|empty(esk2_1(powerset(the_carrier(esk13_0))))|~empty(X1)),inference(spm,[status(thm)],[679,1809,theory(equality)])).
% cnf(2566,negated_conjecture,(empty(esk2_1(powerset(the_carrier(esk13_0))))|in(esk14_0,the_carrier(esk13_0))),inference(spm,[status(thm)],[1835,152,theory(equality)])).
% cnf(2590,negated_conjecture,(esk2_1(powerset(the_carrier(esk13_0)))=the_carrier(esk13_0)|in(esk14_0,the_carrier(esk13_0))),inference(spm,[status(thm)],[335,2566,theory(equality)])).
% cnf(2613,negated_conjecture,(in(esk14_0,the_carrier(esk13_0))|~empty(the_carrier(esk13_0))|~in(X1,the_carrier(esk13_0))),inference(spm,[status(thm)],[216,2590,theory(equality)])).
% cnf(2721,negated_conjecture,(in(esk14_0,the_carrier(esk13_0))|~in(X1,the_carrier(esk13_0))),inference(csr,[status(thm)],[2613,229])).
% cnf(3628,plain,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),the_InternalRel(X3))|~in(X4,the_carrier(X3))|~in(X2,the_carrier(X3))|~in(X1,the_carrier(X3))|~related(X3,X4,X2)|~related(X3,X1,X4)|~element(X2,the_carrier(X3))|~element(X4,the_carrier(X3))|~element(X1,the_carrier(X3))|~rel_str(X3)|~transitive_relstr(X3)),inference(spm,[status(thm)],[941,65,theory(equality)])).
% cnf(11381,plain,(in(X1,the_carrier(X2))|empty(cartesian_product2(the_carrier(X2),the_carrier(X2)))|~related(X2,X3,X1)|~element(X1,the_carrier(X2))|~element(X3,the_carrier(X2))|~rel_str(X2)),inference(spm,[status(thm)],[196,1643,theory(equality)])).
% cnf(32891,plain,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),the_InternalRel(X3))|~in(X4,the_carrier(X3))|~in(X2,the_carrier(X3))|~in(X1,the_carrier(X3))|~related(X3,X4,X2)|~related(X3,X1,X4)|~transitive_relstr(X3)|~element(X2,the_carrier(X3))|~element(X4,the_carrier(X3))|~rel_str(X3)),inference(csr,[status(thm)],[3628,88])).
% cnf(32892,plain,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),the_InternalRel(X3))|~in(X4,the_carrier(X3))|~in(X2,the_carrier(X3))|~in(X1,the_carrier(X3))|~related(X3,X4,X2)|~related(X3,X1,X4)|~transitive_relstr(X3)|~element(X2,the_carrier(X3))|~rel_str(X3)),inference(csr,[status(thm)],[32891,88])).
% cnf(32893,plain,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),the_InternalRel(X3))|~in(X4,the_carrier(X3))|~in(X2,the_carrier(X3))|~in(X1,the_carrier(X3))|~related(X3,X4,X2)|~related(X3,X1,X4)|~transitive_relstr(X3)|~rel_str(X3)),inference(csr,[status(thm)],[32892,88])).
% cnf(32894,negated_conjecture,(in(unordered_pair(unordered_pair(X1,esk16_0),singleton(X1)),the_InternalRel(esk13_0))|~in(esk15_0,the_carrier(esk13_0))|~in(esk16_0,the_carrier(esk13_0))|~in(X1,the_carrier(esk13_0))|~related(esk13_0,X1,esk15_0)|~transitive_relstr(esk13_0)|~rel_str(esk13_0)),inference(spm,[status(thm)],[32893,189,theory(equality)])).
% cnf(32898,negated_conjecture,(in(unordered_pair(unordered_pair(X1,esk16_0),singleton(X1)),the_InternalRel(esk13_0))|~in(esk15_0,the_carrier(esk13_0))|~in(esk16_0,the_carrier(esk13_0))|~in(X1,the_carrier(esk13_0))|~related(esk13_0,X1,esk15_0)|$false|~rel_str(esk13_0)),inference(rw,[status(thm)],[32894,195,theory(equality)])).
% cnf(32899,negated_conjecture,(in(unordered_pair(unordered_pair(X1,esk16_0),singleton(X1)),the_InternalRel(esk13_0))|~in(esk15_0,the_carrier(esk13_0))|~in(esk16_0,the_carrier(esk13_0))|~in(X1,the_carrier(esk13_0))|~related(esk13_0,X1,esk15_0)|$false|$false),inference(rw,[status(thm)],[32898,194,theory(equality)])).
% cnf(32900,negated_conjecture,(in(unordered_pair(unordered_pair(X1,esk16_0),singleton(X1)),the_InternalRel(esk13_0))|~in(esk15_0,the_carrier(esk13_0))|~in(esk16_0,the_carrier(esk13_0))|~in(X1,the_carrier(esk13_0))|~related(esk13_0,X1,esk15_0)),inference(cn,[status(thm)],[32899,theory(equality)])).
% cnf(32922,negated_conjecture,(empty(cartesian_product2(the_carrier(esk13_0),the_carrier(esk13_0)))|in(esk16_0,the_carrier(esk13_0))|~element(esk16_0,the_carrier(esk13_0))|~element(esk15_0,the_carrier(esk13_0))|~rel_str(esk13_0)),inference(spm,[status(thm)],[11381,189,theory(equality)])).
% cnf(32926,negated_conjecture,(empty(cartesian_product2(the_carrier(esk13_0),the_carrier(esk13_0)))|in(esk16_0,the_carrier(esk13_0))|$false|~element(esk15_0,the_carrier(esk13_0))|~rel_str(esk13_0)),inference(rw,[status(thm)],[32922,191,theory(equality)])).
% cnf(32927,negated_conjecture,(empty(cartesian_product2(the_carrier(esk13_0),the_carrier(esk13_0)))|in(esk16_0,the_carrier(esk13_0))|$false|$false|~rel_str(esk13_0)),inference(rw,[status(thm)],[32926,192,theory(equality)])).
% cnf(32928,negated_conjecture,(empty(cartesian_product2(the_carrier(esk13_0),the_carrier(esk13_0)))|in(esk16_0,the_carrier(esk13_0))|$false|$false|$false),inference(rw,[status(thm)],[32927,194,theory(equality)])).
% cnf(32929,negated_conjecture,(empty(cartesian_product2(the_carrier(esk13_0),the_carrier(esk13_0)))|in(esk16_0,the_carrier(esk13_0))),inference(cn,[status(thm)],[32928,theory(equality)])).
% cnf(32959,negated_conjecture,(in(esk16_0,the_carrier(esk13_0))|~relation_of2_as_subset(X1,the_carrier(esk13_0),the_carrier(esk13_0))|~in(X2,X1)),inference(spm,[status(thm)],[239,32929,theory(equality)])).
% cnf(35407,negated_conjecture,(in(esk16_0,the_carrier(esk13_0))|~in(X1,the_InternalRel(esk13_0))|~rel_str(esk13_0)),inference(spm,[status(thm)],[32959,77,theory(equality)])).
% cnf(35408,negated_conjecture,(in(esk16_0,the_carrier(esk13_0))|~in(X1,the_InternalRel(esk13_0))|$false),inference(rw,[status(thm)],[35407,194,theory(equality)])).
% cnf(35409,negated_conjecture,(in(esk16_0,the_carrier(esk13_0))|~in(X1,the_InternalRel(esk13_0))),inference(cn,[status(thm)],[35408,theory(equality)])).
% cnf(35450,negated_conjecture,(in(esk16_0,the_carrier(esk13_0))|~related(esk13_0,X1,X2)|~element(X2,the_carrier(esk13_0))|~element(X1,the_carrier(esk13_0))|~rel_str(esk13_0)),inference(spm,[status(thm)],[35409,203,theory(equality)])).
% cnf(35454,negated_conjecture,(in(esk16_0,the_carrier(esk13_0))|~related(esk13_0,X1,X2)|~element(X2,the_carrier(esk13_0))|~element(X1,the_carrier(esk13_0))|$false),inference(rw,[status(thm)],[35450,194,theory(equality)])).
% cnf(35455,negated_conjecture,(in(esk16_0,the_carrier(esk13_0))|~related(esk13_0,X1,X2)|~element(X2,the_carrier(esk13_0))|~element(X1,the_carrier(esk13_0))),inference(cn,[status(thm)],[35454,theory(equality)])).
% cnf(35814,negated_conjecture,(in(esk16_0,the_carrier(esk13_0))|~element(esk16_0,the_carrier(esk13_0))|~element(esk15_0,the_carrier(esk13_0))),inference(spm,[status(thm)],[35455,189,theory(equality)])).
% cnf(35820,negated_conjecture,(in(esk16_0,the_carrier(esk13_0))|$false|~element(esk15_0,the_carrier(esk13_0))),inference(rw,[status(thm)],[35814,191,theory(equality)])).
% cnf(35821,negated_conjecture,(in(esk16_0,the_carrier(esk13_0))|$false|$false),inference(rw,[status(thm)],[35820,192,theory(equality)])).
% cnf(35822,negated_conjecture,(in(esk16_0,the_carrier(esk13_0))),inference(cn,[status(thm)],[35821,theory(equality)])).
% cnf(35826,negated_conjecture,(~empty(the_carrier(esk13_0))),inference(spm,[status(thm)],[129,35822,theory(equality)])).
% cnf(35828,negated_conjecture,(in(esk14_0,the_carrier(esk13_0))),inference(spm,[status(thm)],[2721,35822,theory(equality)])).
% cnf(35926,negated_conjecture,(in(esk15_0,the_carrier(esk13_0))),inference(sr,[status(thm)],[228,35826,theory(equality)])).
% cnf(188517,negated_conjecture,(in(unordered_pair(unordered_pair(X1,esk16_0),singleton(X1)),the_InternalRel(esk13_0))|$false|~in(esk16_0,the_carrier(esk13_0))|~in(X1,the_carrier(esk13_0))|~related(esk13_0,X1,esk15_0)),inference(rw,[status(thm)],[32900,35926,theory(equality)])).
% cnf(188518,negated_conjecture,(in(unordered_pair(unordered_pair(X1,esk16_0),singleton(X1)),the_InternalRel(esk13_0))|$false|$false|~in(X1,the_carrier(esk13_0))|~related(esk13_0,X1,esk15_0)),inference(rw,[status(thm)],[188517,35822,theory(equality)])).
% cnf(188519,negated_conjecture,(in(unordered_pair(unordered_pair(X1,esk16_0),singleton(X1)),the_InternalRel(esk13_0))|~in(X1,the_carrier(esk13_0))|~related(esk13_0,X1,esk15_0)),inference(cn,[status(thm)],[188518,theory(equality)])).
% cnf(188525,negated_conjecture,(related(esk13_0,X1,esk16_0)|~element(esk16_0,the_carrier(esk13_0))|~element(X1,the_carrier(esk13_0))|~rel_str(esk13_0)|~in(X1,the_carrier(esk13_0))|~related(esk13_0,X1,esk15_0)),inference(spm,[status(thm)],[202,188519,theory(equality)])).
% cnf(188535,negated_conjecture,(related(esk13_0,X1,esk16_0)|$false|~element(X1,the_carrier(esk13_0))|~rel_str(esk13_0)|~in(X1,the_carrier(esk13_0))|~related(esk13_0,X1,esk15_0)),inference(rw,[status(thm)],[188525,191,theory(equality)])).
% cnf(188536,negated_conjecture,(related(esk13_0,X1,esk16_0)|$false|~element(X1,the_carrier(esk13_0))|$false|~in(X1,the_carrier(esk13_0))|~related(esk13_0,X1,esk15_0)),inference(rw,[status(thm)],[188535,194,theory(equality)])).
% cnf(188537,negated_conjecture,(related(esk13_0,X1,esk16_0)|~element(X1,the_carrier(esk13_0))|~in(X1,the_carrier(esk13_0))|~related(esk13_0,X1,esk15_0)),inference(cn,[status(thm)],[188536,theory(equality)])).
% cnf(188574,negated_conjecture,(related(esk13_0,X1,esk16_0)|~in(X1,the_carrier(esk13_0))|~related(esk13_0,X1,esk15_0)),inference(csr,[status(thm)],[188537,88])).
% cnf(188580,negated_conjecture,(~in(esk14_0,the_carrier(esk13_0))|~related(esk13_0,esk14_0,esk15_0)),inference(spm,[status(thm)],[188,188574,theory(equality)])).
% cnf(188600,negated_conjecture,($false|~related(esk13_0,esk14_0,esk15_0)),inference(rw,[status(thm)],[188580,35828,theory(equality)])).
% cnf(188601,negated_conjecture,($false|$false),inference(rw,[status(thm)],[188600,190,theory(equality)])).
% cnf(188602,negated_conjecture,($false),inference(cn,[status(thm)],[188601,theory(equality)])).
% cnf(188603,negated_conjecture,($false),188602,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 16120
% # ...of these trivial                : 12
% # ...subsumed                        : 13024
% # ...remaining for further processing: 3084
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 65
% # Backward-rewritten                 : 477
% # Generated clauses                  : 152629
% # ...of the previous two non-trivial : 144959
% # Contextual simplify-reflections    : 14716
% # Paramodulations                    : 152360
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 2451
% #    Positive orientable unit clauses: 153
% #    Positive unorientable unit clauses: 1
% #    Negative unit clauses           : 104
% #    Non-unit-clauses                : 2193
% # Current number of unprocessed clauses: 112933
% # ...number of literals in the above : 637074
% # Clause-clause subsumption calls (NU) : 1152704
% # Rec. Clause-clause subsumption calls : 595598
% # Unit Clause-clause subsumption calls : 9927
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 685
% # Indexed BW rewrite successes       : 113
% # Backwards rewriting index:  1130 leaves,   4.89+/-15.087 terms/leaf
% # Paramod-from index:          414 leaves,   3.80+/-13.421 terms/leaf
% # Paramod-into index:         1002 leaves,   4.88+/-15.555 terms/leaf
% # -------------------------------------------------
% # User time              : 8.615 s
% # System time            : 0.246 s
% # Total time             : 8.861 s
% # Maximum resident set size: 0 pages
% PrfWatch: 11.74 CPU 11.89 WC
% FINAL PrfWatch: 11.74 CPU 11.89 WC
% SZS output end Solution for /tmp/SystemOnTPTP26418/SEU340+1.tptp
% 
%------------------------------------------------------------------------------