TSTP Solution File: SEU376+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SEU376+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 04:17:23 EST 2010

% Result   : Theorem 2.04s
% Output   : Solution 2.04s
% 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/SystemOnTPTP21555/SEU376+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP21555/SEU376+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21555/SEU376+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 21651
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.020 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:(one_sorted_str(X1)=>![X2]:(net_str(X2,X1)=>rel_str(X2))),file('/tmp/SRASS.s.p', dt_l1_waybel_0)).
% fof(11, axiom,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:((~(empty_carrier(X2))&net_str(X2,X1))=>![X3]:(is_eventually_in(X1,X2,X3)<=>?[X4]:(element(X4,the_carrier(X2))&![X5]:(element(X5,the_carrier(X2))=>(related(X2,X4,X5)=>in(apply_netmap(X1,X2,X5),X3))))))),file('/tmp/SRASS.s.p', d11_waybel_0)).
% fof(12, axiom,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:((~(empty_carrier(X2))&net_str(X2,X1))=>![X3]:(is_often_in(X1,X2,X3)<=>![X4]:(element(X4,the_carrier(X2))=>?[X5]:((element(X5,the_carrier(X2))&related(X2,X4,X5))&in(apply_netmap(X1,X2,X5),X3)))))),file('/tmp/SRASS.s.p', d12_waybel_0)).
% fof(14, axiom,![X1]:((~(empty_carrier(X1))&rel_str(X1))=>(directed_relstr(X1)<=>![X2]:(element(X2,the_carrier(X1))=>![X3]:(element(X3,the_carrier(X1))=>?[X4]:((element(X4,the_carrier(X1))&related(X1,X2,X4))&related(X1,X3,X4)))))),file('/tmp/SRASS.s.p', d5_yellow_6)).
% fof(61, conjecture,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:((((~(empty_carrier(X2))&transitive_relstr(X2))&directed_relstr(X2))&net_str(X2,X1))=>![X3]:(is_eventually_in(X1,X2,X3)=>is_often_in(X1,X2,X3)))),file('/tmp/SRASS.s.p', t28_yellow_6)).
% fof(62, negated_conjecture,~(![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:((((~(empty_carrier(X2))&transitive_relstr(X2))&directed_relstr(X2))&net_str(X2,X1))=>![X3]:(is_eventually_in(X1,X2,X3)=>is_often_in(X1,X2,X3))))),inference(assume_negation,[status(cth)],[61])).
% fof(67, plain,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:((~(empty_carrier(X2))&net_str(X2,X1))=>![X3]:(is_eventually_in(X1,X2,X3)<=>?[X4]:(element(X4,the_carrier(X2))&![X5]:(element(X5,the_carrier(X2))=>(related(X2,X4,X5)=>in(apply_netmap(X1,X2,X5),X3))))))),inference(fof_simplification,[status(thm)],[11,theory(equality)])).
% fof(68, plain,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:((~(empty_carrier(X2))&net_str(X2,X1))=>![X3]:(is_often_in(X1,X2,X3)<=>![X4]:(element(X4,the_carrier(X2))=>?[X5]:((element(X5,the_carrier(X2))&related(X2,X4,X5))&in(apply_netmap(X1,X2,X5),X3)))))),inference(fof_simplification,[status(thm)],[12,theory(equality)])).
% fof(69, plain,![X1]:((~(empty_carrier(X1))&rel_str(X1))=>(directed_relstr(X1)<=>![X2]:(element(X2,the_carrier(X1))=>![X3]:(element(X3,the_carrier(X1))=>?[X4]:((element(X4,the_carrier(X1))&related(X1,X2,X4))&related(X1,X3,X4)))))),inference(fof_simplification,[status(thm)],[14,theory(equality)])).
% fof(80, negated_conjecture,~(![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:((((~(empty_carrier(X2))&transitive_relstr(X2))&directed_relstr(X2))&net_str(X2,X1))=>![X3]:(is_eventually_in(X1,X2,X3)=>is_often_in(X1,X2,X3))))),inference(fof_simplification,[status(thm)],[62,theory(equality)])).
% fof(92, plain,![X1]:(~(one_sorted_str(X1))|![X2]:(~(net_str(X2,X1))|rel_str(X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(93, plain,![X3]:(~(one_sorted_str(X3))|![X4]:(~(net_str(X4,X3))|rel_str(X4))),inference(variable_rename,[status(thm)],[92])).
% fof(94, plain,![X3]:![X4]:((~(net_str(X4,X3))|rel_str(X4))|~(one_sorted_str(X3))),inference(shift_quantors,[status(thm)],[93])).
% cnf(95,plain,(rel_str(X2)|~one_sorted_str(X1)|~net_str(X2,X1)),inference(split_conjunct,[status(thm)],[94])).
% fof(114, plain,![X1]:((empty_carrier(X1)|~(one_sorted_str(X1)))|![X2]:((empty_carrier(X2)|~(net_str(X2,X1)))|![X3]:((~(is_eventually_in(X1,X2,X3))|?[X4]:(element(X4,the_carrier(X2))&![X5]:(~(element(X5,the_carrier(X2)))|(~(related(X2,X4,X5))|in(apply_netmap(X1,X2,X5),X3)))))&(![X4]:(~(element(X4,the_carrier(X2)))|?[X5]:(element(X5,the_carrier(X2))&(related(X2,X4,X5)&~(in(apply_netmap(X1,X2,X5),X3)))))|is_eventually_in(X1,X2,X3))))),inference(fof_nnf,[status(thm)],[67])).
% fof(115, plain,![X6]:((empty_carrier(X6)|~(one_sorted_str(X6)))|![X7]:((empty_carrier(X7)|~(net_str(X7,X6)))|![X8]:((~(is_eventually_in(X6,X7,X8))|?[X9]:(element(X9,the_carrier(X7))&![X10]:(~(element(X10,the_carrier(X7)))|(~(related(X7,X9,X10))|in(apply_netmap(X6,X7,X10),X8)))))&(![X11]:(~(element(X11,the_carrier(X7)))|?[X12]:(element(X12,the_carrier(X7))&(related(X7,X11,X12)&~(in(apply_netmap(X6,X7,X12),X8)))))|is_eventually_in(X6,X7,X8))))),inference(variable_rename,[status(thm)],[114])).
% fof(116, plain,![X6]:((empty_carrier(X6)|~(one_sorted_str(X6)))|![X7]:((empty_carrier(X7)|~(net_str(X7,X6)))|![X8]:((~(is_eventually_in(X6,X7,X8))|(element(esk6_3(X6,X7,X8),the_carrier(X7))&![X10]:(~(element(X10,the_carrier(X7)))|(~(related(X7,esk6_3(X6,X7,X8),X10))|in(apply_netmap(X6,X7,X10),X8)))))&(![X11]:(~(element(X11,the_carrier(X7)))|(element(esk7_4(X6,X7,X8,X11),the_carrier(X7))&(related(X7,X11,esk7_4(X6,X7,X8,X11))&~(in(apply_netmap(X6,X7,esk7_4(X6,X7,X8,X11)),X8)))))|is_eventually_in(X6,X7,X8))))),inference(skolemize,[status(esa)],[115])).
% fof(117, plain,![X6]:![X7]:![X8]:![X10]:![X11]:(((((~(element(X11,the_carrier(X7)))|(element(esk7_4(X6,X7,X8,X11),the_carrier(X7))&(related(X7,X11,esk7_4(X6,X7,X8,X11))&~(in(apply_netmap(X6,X7,esk7_4(X6,X7,X8,X11)),X8)))))|is_eventually_in(X6,X7,X8))&(((~(element(X10,the_carrier(X7)))|(~(related(X7,esk6_3(X6,X7,X8),X10))|in(apply_netmap(X6,X7,X10),X8)))&element(esk6_3(X6,X7,X8),the_carrier(X7)))|~(is_eventually_in(X6,X7,X8))))|(empty_carrier(X7)|~(net_str(X7,X6))))|(empty_carrier(X6)|~(one_sorted_str(X6)))),inference(shift_quantors,[status(thm)],[116])).
% fof(118, plain,![X6]:![X7]:![X8]:![X10]:![X11]:((((((element(esk7_4(X6,X7,X8,X11),the_carrier(X7))|~(element(X11,the_carrier(X7))))|is_eventually_in(X6,X7,X8))|(empty_carrier(X7)|~(net_str(X7,X6))))|(empty_carrier(X6)|~(one_sorted_str(X6))))&(((((related(X7,X11,esk7_4(X6,X7,X8,X11))|~(element(X11,the_carrier(X7))))|is_eventually_in(X6,X7,X8))|(empty_carrier(X7)|~(net_str(X7,X6))))|(empty_carrier(X6)|~(one_sorted_str(X6))))&((((~(in(apply_netmap(X6,X7,esk7_4(X6,X7,X8,X11)),X8))|~(element(X11,the_carrier(X7))))|is_eventually_in(X6,X7,X8))|(empty_carrier(X7)|~(net_str(X7,X6))))|(empty_carrier(X6)|~(one_sorted_str(X6))))))&(((((~(element(X10,the_carrier(X7)))|(~(related(X7,esk6_3(X6,X7,X8),X10))|in(apply_netmap(X6,X7,X10),X8)))|~(is_eventually_in(X6,X7,X8)))|(empty_carrier(X7)|~(net_str(X7,X6))))|(empty_carrier(X6)|~(one_sorted_str(X6))))&(((element(esk6_3(X6,X7,X8),the_carrier(X7))|~(is_eventually_in(X6,X7,X8)))|(empty_carrier(X7)|~(net_str(X7,X6))))|(empty_carrier(X6)|~(one_sorted_str(X6)))))),inference(distribute,[status(thm)],[117])).
% cnf(119,plain,(empty_carrier(X1)|empty_carrier(X2)|element(esk6_3(X1,X2,X3),the_carrier(X2))|~one_sorted_str(X1)|~net_str(X2,X1)|~is_eventually_in(X1,X2,X3)),inference(split_conjunct,[status(thm)],[118])).
% cnf(120,plain,(empty_carrier(X1)|empty_carrier(X2)|in(apply_netmap(X1,X2,X4),X3)|~one_sorted_str(X1)|~net_str(X2,X1)|~is_eventually_in(X1,X2,X3)|~related(X2,esk6_3(X1,X2,X3),X4)|~element(X4,the_carrier(X2))),inference(split_conjunct,[status(thm)],[118])).
% fof(124, plain,![X1]:((empty_carrier(X1)|~(one_sorted_str(X1)))|![X2]:((empty_carrier(X2)|~(net_str(X2,X1)))|![X3]:((~(is_often_in(X1,X2,X3))|![X4]:(~(element(X4,the_carrier(X2)))|?[X5]:((element(X5,the_carrier(X2))&related(X2,X4,X5))&in(apply_netmap(X1,X2,X5),X3))))&(?[X4]:(element(X4,the_carrier(X2))&![X5]:((~(element(X5,the_carrier(X2)))|~(related(X2,X4,X5)))|~(in(apply_netmap(X1,X2,X5),X3))))|is_often_in(X1,X2,X3))))),inference(fof_nnf,[status(thm)],[68])).
% fof(125, plain,![X6]:((empty_carrier(X6)|~(one_sorted_str(X6)))|![X7]:((empty_carrier(X7)|~(net_str(X7,X6)))|![X8]:((~(is_often_in(X6,X7,X8))|![X9]:(~(element(X9,the_carrier(X7)))|?[X10]:((element(X10,the_carrier(X7))&related(X7,X9,X10))&in(apply_netmap(X6,X7,X10),X8))))&(?[X11]:(element(X11,the_carrier(X7))&![X12]:((~(element(X12,the_carrier(X7)))|~(related(X7,X11,X12)))|~(in(apply_netmap(X6,X7,X12),X8))))|is_often_in(X6,X7,X8))))),inference(variable_rename,[status(thm)],[124])).
% fof(126, plain,![X6]:((empty_carrier(X6)|~(one_sorted_str(X6)))|![X7]:((empty_carrier(X7)|~(net_str(X7,X6)))|![X8]:((~(is_often_in(X6,X7,X8))|![X9]:(~(element(X9,the_carrier(X7)))|((element(esk8_4(X6,X7,X8,X9),the_carrier(X7))&related(X7,X9,esk8_4(X6,X7,X8,X9)))&in(apply_netmap(X6,X7,esk8_4(X6,X7,X8,X9)),X8))))&((element(esk9_3(X6,X7,X8),the_carrier(X7))&![X12]:((~(element(X12,the_carrier(X7)))|~(related(X7,esk9_3(X6,X7,X8),X12)))|~(in(apply_netmap(X6,X7,X12),X8))))|is_often_in(X6,X7,X8))))),inference(skolemize,[status(esa)],[125])).
% fof(127, plain,![X6]:![X7]:![X8]:![X9]:![X12]:(((((((~(element(X12,the_carrier(X7)))|~(related(X7,esk9_3(X6,X7,X8),X12)))|~(in(apply_netmap(X6,X7,X12),X8)))&element(esk9_3(X6,X7,X8),the_carrier(X7)))|is_often_in(X6,X7,X8))&((~(element(X9,the_carrier(X7)))|((element(esk8_4(X6,X7,X8,X9),the_carrier(X7))&related(X7,X9,esk8_4(X6,X7,X8,X9)))&in(apply_netmap(X6,X7,esk8_4(X6,X7,X8,X9)),X8)))|~(is_often_in(X6,X7,X8))))|(empty_carrier(X7)|~(net_str(X7,X6))))|(empty_carrier(X6)|~(one_sorted_str(X6)))),inference(shift_quantors,[status(thm)],[126])).
% fof(128, plain,![X6]:![X7]:![X8]:![X9]:![X12]:(((((((~(element(X12,the_carrier(X7)))|~(related(X7,esk9_3(X6,X7,X8),X12)))|~(in(apply_netmap(X6,X7,X12),X8)))|is_often_in(X6,X7,X8))|(empty_carrier(X7)|~(net_str(X7,X6))))|(empty_carrier(X6)|~(one_sorted_str(X6))))&(((element(esk9_3(X6,X7,X8),the_carrier(X7))|is_often_in(X6,X7,X8))|(empty_carrier(X7)|~(net_str(X7,X6))))|(empty_carrier(X6)|~(one_sorted_str(X6)))))&((((((element(esk8_4(X6,X7,X8,X9),the_carrier(X7))|~(element(X9,the_carrier(X7))))|~(is_often_in(X6,X7,X8)))|(empty_carrier(X7)|~(net_str(X7,X6))))|(empty_carrier(X6)|~(one_sorted_str(X6))))&((((related(X7,X9,esk8_4(X6,X7,X8,X9))|~(element(X9,the_carrier(X7))))|~(is_often_in(X6,X7,X8)))|(empty_carrier(X7)|~(net_str(X7,X6))))|(empty_carrier(X6)|~(one_sorted_str(X6)))))&((((in(apply_netmap(X6,X7,esk8_4(X6,X7,X8,X9)),X8)|~(element(X9,the_carrier(X7))))|~(is_often_in(X6,X7,X8)))|(empty_carrier(X7)|~(net_str(X7,X6))))|(empty_carrier(X6)|~(one_sorted_str(X6)))))),inference(distribute,[status(thm)],[127])).
% cnf(132,plain,(empty_carrier(X1)|empty_carrier(X2)|is_often_in(X1,X2,X3)|element(esk9_3(X1,X2,X3),the_carrier(X2))|~one_sorted_str(X1)|~net_str(X2,X1)),inference(split_conjunct,[status(thm)],[128])).
% cnf(133,plain,(empty_carrier(X1)|empty_carrier(X2)|is_often_in(X1,X2,X3)|~one_sorted_str(X1)|~net_str(X2,X1)|~in(apply_netmap(X1,X2,X4),X3)|~related(X2,esk9_3(X1,X2,X3),X4)|~element(X4,the_carrier(X2))),inference(split_conjunct,[status(thm)],[128])).
% fof(137, plain,![X1]:((empty_carrier(X1)|~(rel_str(X1)))|((~(directed_relstr(X1))|![X2]:(~(element(X2,the_carrier(X1)))|![X3]:(~(element(X3,the_carrier(X1)))|?[X4]:((element(X4,the_carrier(X1))&related(X1,X2,X4))&related(X1,X3,X4)))))&(?[X2]:(element(X2,the_carrier(X1))&?[X3]:(element(X3,the_carrier(X1))&![X4]:((~(element(X4,the_carrier(X1)))|~(related(X1,X2,X4)))|~(related(X1,X3,X4)))))|directed_relstr(X1)))),inference(fof_nnf,[status(thm)],[69])).
% fof(138, plain,![X5]:((empty_carrier(X5)|~(rel_str(X5)))|((~(directed_relstr(X5))|![X6]:(~(element(X6,the_carrier(X5)))|![X7]:(~(element(X7,the_carrier(X5)))|?[X8]:((element(X8,the_carrier(X5))&related(X5,X6,X8))&related(X5,X7,X8)))))&(?[X9]:(element(X9,the_carrier(X5))&?[X10]:(element(X10,the_carrier(X5))&![X11]:((~(element(X11,the_carrier(X5)))|~(related(X5,X9,X11)))|~(related(X5,X10,X11)))))|directed_relstr(X5)))),inference(variable_rename,[status(thm)],[137])).
% fof(139, plain,![X5]:((empty_carrier(X5)|~(rel_str(X5)))|((~(directed_relstr(X5))|![X6]:(~(element(X6,the_carrier(X5)))|![X7]:(~(element(X7,the_carrier(X5)))|((element(esk10_3(X5,X6,X7),the_carrier(X5))&related(X5,X6,esk10_3(X5,X6,X7)))&related(X5,X7,esk10_3(X5,X6,X7))))))&((element(esk11_1(X5),the_carrier(X5))&(element(esk12_1(X5),the_carrier(X5))&![X11]:((~(element(X11,the_carrier(X5)))|~(related(X5,esk11_1(X5),X11)))|~(related(X5,esk12_1(X5),X11)))))|directed_relstr(X5)))),inference(skolemize,[status(esa)],[138])).
% fof(140, plain,![X5]:![X6]:![X7]:![X11]:(((((((~(element(X11,the_carrier(X5)))|~(related(X5,esk11_1(X5),X11)))|~(related(X5,esk12_1(X5),X11)))&element(esk12_1(X5),the_carrier(X5)))&element(esk11_1(X5),the_carrier(X5)))|directed_relstr(X5))&(((~(element(X7,the_carrier(X5)))|((element(esk10_3(X5,X6,X7),the_carrier(X5))&related(X5,X6,esk10_3(X5,X6,X7)))&related(X5,X7,esk10_3(X5,X6,X7))))|~(element(X6,the_carrier(X5))))|~(directed_relstr(X5))))|(empty_carrier(X5)|~(rel_str(X5)))),inference(shift_quantors,[status(thm)],[139])).
% fof(141, plain,![X5]:![X6]:![X7]:![X11]:(((((((~(element(X11,the_carrier(X5)))|~(related(X5,esk11_1(X5),X11)))|~(related(X5,esk12_1(X5),X11)))|directed_relstr(X5))|(empty_carrier(X5)|~(rel_str(X5))))&((element(esk12_1(X5),the_carrier(X5))|directed_relstr(X5))|(empty_carrier(X5)|~(rel_str(X5)))))&((element(esk11_1(X5),the_carrier(X5))|directed_relstr(X5))|(empty_carrier(X5)|~(rel_str(X5)))))&((((((element(esk10_3(X5,X6,X7),the_carrier(X5))|~(element(X7,the_carrier(X5))))|~(element(X6,the_carrier(X5))))|~(directed_relstr(X5)))|(empty_carrier(X5)|~(rel_str(X5))))&((((related(X5,X6,esk10_3(X5,X6,X7))|~(element(X7,the_carrier(X5))))|~(element(X6,the_carrier(X5))))|~(directed_relstr(X5)))|(empty_carrier(X5)|~(rel_str(X5)))))&((((related(X5,X7,esk10_3(X5,X6,X7))|~(element(X7,the_carrier(X5))))|~(element(X6,the_carrier(X5))))|~(directed_relstr(X5)))|(empty_carrier(X5)|~(rel_str(X5)))))),inference(distribute,[status(thm)],[140])).
% cnf(142,plain,(empty_carrier(X1)|related(X1,X3,esk10_3(X1,X2,X3))|~rel_str(X1)|~directed_relstr(X1)|~element(X2,the_carrier(X1))|~element(X3,the_carrier(X1))),inference(split_conjunct,[status(thm)],[141])).
% cnf(143,plain,(empty_carrier(X1)|related(X1,X2,esk10_3(X1,X2,X3))|~rel_str(X1)|~directed_relstr(X1)|~element(X2,the_carrier(X1))|~element(X3,the_carrier(X1))),inference(split_conjunct,[status(thm)],[141])).
% cnf(144,plain,(empty_carrier(X1)|element(esk10_3(X1,X2,X3),the_carrier(X1))|~rel_str(X1)|~directed_relstr(X1)|~element(X2,the_carrier(X1))|~element(X3,the_carrier(X1))),inference(split_conjunct,[status(thm)],[141])).
% fof(299, negated_conjecture,?[X1]:((~(empty_carrier(X1))&one_sorted_str(X1))&?[X2]:((((~(empty_carrier(X2))&transitive_relstr(X2))&directed_relstr(X2))&net_str(X2,X1))&?[X3]:(is_eventually_in(X1,X2,X3)&~(is_often_in(X1,X2,X3))))),inference(fof_nnf,[status(thm)],[80])).
% fof(300, negated_conjecture,?[X4]:((~(empty_carrier(X4))&one_sorted_str(X4))&?[X5]:((((~(empty_carrier(X5))&transitive_relstr(X5))&directed_relstr(X5))&net_str(X5,X4))&?[X6]:(is_eventually_in(X4,X5,X6)&~(is_often_in(X4,X5,X6))))),inference(variable_rename,[status(thm)],[299])).
% fof(301, negated_conjecture,((~(empty_carrier(esk26_0))&one_sorted_str(esk26_0))&((((~(empty_carrier(esk27_0))&transitive_relstr(esk27_0))&directed_relstr(esk27_0))&net_str(esk27_0,esk26_0))&(is_eventually_in(esk26_0,esk27_0,esk28_0)&~(is_often_in(esk26_0,esk27_0,esk28_0))))),inference(skolemize,[status(esa)],[300])).
% cnf(302,negated_conjecture,(~is_often_in(esk26_0,esk27_0,esk28_0)),inference(split_conjunct,[status(thm)],[301])).
% cnf(303,negated_conjecture,(is_eventually_in(esk26_0,esk27_0,esk28_0)),inference(split_conjunct,[status(thm)],[301])).
% cnf(304,negated_conjecture,(net_str(esk27_0,esk26_0)),inference(split_conjunct,[status(thm)],[301])).
% cnf(305,negated_conjecture,(directed_relstr(esk27_0)),inference(split_conjunct,[status(thm)],[301])).
% cnf(307,negated_conjecture,(~empty_carrier(esk27_0)),inference(split_conjunct,[status(thm)],[301])).
% cnf(308,negated_conjecture,(one_sorted_str(esk26_0)),inference(split_conjunct,[status(thm)],[301])).
% cnf(309,negated_conjecture,(~empty_carrier(esk26_0)),inference(split_conjunct,[status(thm)],[301])).
% cnf(363,plain,(in(apply_netmap(X1,X2,esk10_3(X2,X3,esk6_3(X1,X2,X4))),X4)|empty_carrier(X2)|empty_carrier(X1)|~is_eventually_in(X1,X2,X4)|~element(esk10_3(X2,X3,esk6_3(X1,X2,X4)),the_carrier(X2))|~net_str(X2,X1)|~one_sorted_str(X1)|~directed_relstr(X2)|~element(esk6_3(X1,X2,X4),the_carrier(X2))|~element(X3,the_carrier(X2))|~rel_str(X2)),inference(spm,[status(thm)],[120,142,theory(equality)])).
% cnf(364,plain,(is_often_in(X1,X2,X3)|empty_carrier(X2)|empty_carrier(X1)|~element(esk10_3(X2,esk9_3(X1,X2,X3),X4),the_carrier(X2))|~in(apply_netmap(X1,X2,esk10_3(X2,esk9_3(X1,X2,X3),X4)),X3)|~net_str(X2,X1)|~one_sorted_str(X1)|~directed_relstr(X2)|~element(X4,the_carrier(X2))|~element(esk9_3(X1,X2,X3),the_carrier(X2))|~rel_str(X2)),inference(spm,[status(thm)],[133,143,theory(equality)])).
% cnf(788,plain,(in(apply_netmap(X1,X2,esk10_3(X2,X3,esk6_3(X1,X2,X4))),X4)|empty_carrier(X2)|empty_carrier(X1)|~directed_relstr(X2)|~is_eventually_in(X1,X2,X4)|~element(esk10_3(X2,X3,esk6_3(X1,X2,X4)),the_carrier(X2))|~element(esk6_3(X1,X2,X4),the_carrier(X2))|~element(X3,the_carrier(X2))|~net_str(X2,X1)|~one_sorted_str(X1)),inference(csr,[status(thm)],[363,95])).
% cnf(789,plain,(in(apply_netmap(X1,X2,esk10_3(X2,X3,esk6_3(X1,X2,X4))),X4)|empty_carrier(X2)|empty_carrier(X1)|~directed_relstr(X2)|~is_eventually_in(X1,X2,X4)|~element(esk10_3(X2,X3,esk6_3(X1,X2,X4)),the_carrier(X2))|~element(X3,the_carrier(X2))|~net_str(X2,X1)|~one_sorted_str(X1)),inference(csr,[status(thm)],[788,119])).
% cnf(859,plain,(is_often_in(X1,X2,X3)|empty_carrier(X2)|empty_carrier(X1)|~directed_relstr(X2)|~element(esk10_3(X2,esk9_3(X1,X2,X3),X4),the_carrier(X2))|~element(esk9_3(X1,X2,X3),the_carrier(X2))|~element(X4,the_carrier(X2))|~in(apply_netmap(X1,X2,esk10_3(X2,esk9_3(X1,X2,X3),X4)),X3)|~net_str(X2,X1)|~one_sorted_str(X1)),inference(csr,[status(thm)],[364,95])).
% cnf(860,plain,(is_often_in(X1,X2,X3)|empty_carrier(X2)|empty_carrier(X1)|~directed_relstr(X2)|~element(esk10_3(X2,esk9_3(X1,X2,X3),X4),the_carrier(X2))|~element(X4,the_carrier(X2))|~in(apply_netmap(X1,X2,esk10_3(X2,esk9_3(X1,X2,X3),X4)),X3)|~net_str(X2,X1)|~one_sorted_str(X1)),inference(csr,[status(thm)],[859,132])).
% cnf(862,plain,(is_often_in(X1,X2,X3)|empty_carrier(X1)|empty_carrier(X2)|~directed_relstr(X2)|~element(esk10_3(X2,esk9_3(X1,X2,X3),esk6_3(X1,X2,X3)),the_carrier(X2))|~element(esk6_3(X1,X2,X3),the_carrier(X2))|~net_str(X2,X1)|~one_sorted_str(X1)|~is_eventually_in(X1,X2,X3)|~element(esk9_3(X1,X2,X3),the_carrier(X2))),inference(spm,[status(thm)],[860,789,theory(equality)])).
% cnf(9075,plain,(is_often_in(X1,X2,X3)|empty_carrier(X1)|empty_carrier(X2)|~directed_relstr(X2)|~is_eventually_in(X1,X2,X3)|~element(esk10_3(X2,esk9_3(X1,X2,X3),esk6_3(X1,X2,X3)),the_carrier(X2))|~element(esk6_3(X1,X2,X3),the_carrier(X2))|~net_str(X2,X1)|~one_sorted_str(X1)),inference(csr,[status(thm)],[862,132])).
% cnf(9076,plain,(is_often_in(X1,X2,X3)|empty_carrier(X1)|empty_carrier(X2)|~directed_relstr(X2)|~is_eventually_in(X1,X2,X3)|~element(esk10_3(X2,esk9_3(X1,X2,X3),esk6_3(X1,X2,X3)),the_carrier(X2))|~net_str(X2,X1)|~one_sorted_str(X1)),inference(csr,[status(thm)],[9075,119])).
% cnf(9077,plain,(is_often_in(X1,X2,X3)|empty_carrier(X2)|empty_carrier(X1)|~directed_relstr(X2)|~is_eventually_in(X1,X2,X3)|~net_str(X2,X1)|~one_sorted_str(X1)|~element(esk6_3(X1,X2,X3),the_carrier(X2))|~element(esk9_3(X1,X2,X3),the_carrier(X2))|~rel_str(X2)),inference(spm,[status(thm)],[9076,144,theory(equality)])).
% cnf(14635,plain,(is_often_in(X1,X2,X3)|empty_carrier(X2)|empty_carrier(X1)|~directed_relstr(X2)|~is_eventually_in(X1,X2,X3)|~element(esk6_3(X1,X2,X3),the_carrier(X2))|~element(esk9_3(X1,X2,X3),the_carrier(X2))|~net_str(X2,X1)|~one_sorted_str(X1)),inference(csr,[status(thm)],[9077,95])).
% cnf(14636,plain,(is_often_in(X1,X2,X3)|empty_carrier(X2)|empty_carrier(X1)|~directed_relstr(X2)|~is_eventually_in(X1,X2,X3)|~element(esk6_3(X1,X2,X3),the_carrier(X2))|~net_str(X2,X1)|~one_sorted_str(X1)),inference(csr,[status(thm)],[14635,132])).
% cnf(14637,plain,(is_often_in(X1,X2,X3)|empty_carrier(X2)|empty_carrier(X1)|~directed_relstr(X2)|~is_eventually_in(X1,X2,X3)|~net_str(X2,X1)|~one_sorted_str(X1)),inference(csr,[status(thm)],[14636,119])).
% cnf(14638,negated_conjecture,(empty_carrier(esk26_0)|empty_carrier(esk27_0)|~directed_relstr(esk27_0)|~is_eventually_in(esk26_0,esk27_0,esk28_0)|~net_str(esk27_0,esk26_0)|~one_sorted_str(esk26_0)),inference(spm,[status(thm)],[302,14637,theory(equality)])).
% cnf(14651,negated_conjecture,(empty_carrier(esk26_0)|empty_carrier(esk27_0)|$false|~is_eventually_in(esk26_0,esk27_0,esk28_0)|~net_str(esk27_0,esk26_0)|~one_sorted_str(esk26_0)),inference(rw,[status(thm)],[14638,305,theory(equality)])).
% cnf(14652,negated_conjecture,(empty_carrier(esk26_0)|empty_carrier(esk27_0)|$false|$false|~net_str(esk27_0,esk26_0)|~one_sorted_str(esk26_0)),inference(rw,[status(thm)],[14651,303,theory(equality)])).
% cnf(14653,negated_conjecture,(empty_carrier(esk26_0)|empty_carrier(esk27_0)|$false|$false|$false|~one_sorted_str(esk26_0)),inference(rw,[status(thm)],[14652,304,theory(equality)])).
% cnf(14654,negated_conjecture,(empty_carrier(esk26_0)|empty_carrier(esk27_0)|$false|$false|$false|$false),inference(rw,[status(thm)],[14653,308,theory(equality)])).
% cnf(14655,negated_conjecture,(empty_carrier(esk26_0)|empty_carrier(esk27_0)),inference(cn,[status(thm)],[14654,theory(equality)])).
% cnf(14656,negated_conjecture,(empty_carrier(esk27_0)),inference(sr,[status(thm)],[14655,309,theory(equality)])).
% cnf(14657,negated_conjecture,($false),inference(sr,[status(thm)],[14656,307,theory(equality)])).
% cnf(14658,negated_conjecture,($false),14657,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 2462
% # ...of these trivial                : 2
% # ...subsumed                        : 1489
% # ...remaining for further processing: 971
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 30
% # Backward-rewritten                 : 9
% # Generated clauses                  : 10961
% # ...of the previous two non-trivial : 10001
% # Contextual simplify-reflections    : 2263
% # Paramodulations                    : 10958
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 837
% #    Positive orientable unit clauses: 57
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 11
% #    Non-unit-clauses                : 769
% # Current number of unprocessed clauses: 7022
% # ...number of literals in the above : 39618
% # Clause-clause subsumption calls (NU) : 121537
% # Rec. Clause-clause subsumption calls : 64986
% # Unit Clause-clause subsumption calls : 91
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 210
% # Indexed BW rewrite successes       : 4
% # Backwards rewriting index:   317 leaves,   6.71+/-19.236 terms/leaf
% # Paramod-from index:          120 leaves,   4.39+/-12.329 terms/leaf
% # Paramod-into index:          286 leaves,   6.29+/-19.198 terms/leaf
% # -------------------------------------------------
% # User time              : 0.809 s
% # System time            : 0.013 s
% # Total time             : 0.822 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.13 CPU 1.21 WC
% FINAL PrfWatch: 1.13 CPU 1.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP21555/SEU376+1.tptp
% 
%------------------------------------------------------------------------------