TSTP Solution File: SEU376+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU376+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 08:02:01 EST 2010
% Result : Theorem 1.14s
% Output : CNFRefutation 1.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 5
% Syntax : Number of formulae : 68 ( 10 unt; 0 def)
% Number of atoms : 594 ( 0 equ)
% Maximal formula atoms : 35 ( 8 avg)
% Number of connectives : 822 ( 296 ~; 371 |; 118 &)
% ( 6 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 9 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-4 aty)
% Number of variables : 205 ( 0 sgn 109 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(15,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/tmpTJU7Tt/sel_SEU376+1.p_1',d11_waybel_0) ).
fof(30,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/tmpTJU7Tt/sel_SEU376+1.p_1',d12_waybel_0) ).
fof(35,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/tmpTJU7Tt/sel_SEU376+1.p_1',t28_yellow_6) ).
fof(41,axiom,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( net_str(X2,X1)
=> rel_str(X2) ) ),
file('/tmp/tmpTJU7Tt/sel_SEU376+1.p_1',dt_l1_waybel_0) ).
fof(46,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/tmpTJU7Tt/sel_SEU376+1.p_1',d5_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)],[35]) ).
fof(66,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)],[15,theory(equality)]) ).
fof(73,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)],[30,theory(equality)]) ).
fof(74,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(78,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)],[46,theory(equality)]) ).
fof(128,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)],[66]) ).
fof(129,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)],[128]) ).
fof(130,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)],[129]) ).
fof(131,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)],[130]) ).
fof(132,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)],[131]) ).
cnf(133,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)],[132]) ).
cnf(134,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)],[132]) ).
fof(187,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)],[73]) ).
fof(188,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)],[187]) ).
fof(189,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(esk13_4(X6,X7,X8,X9),the_carrier(X7))
& related(X7,X9,esk13_4(X6,X7,X8,X9))
& in(apply_netmap(X6,X7,esk13_4(X6,X7,X8,X9)),X8) ) ) )
& ( ( element(esk14_3(X6,X7,X8),the_carrier(X7))
& ! [X12] :
( ~ element(X12,the_carrier(X7))
| ~ related(X7,esk14_3(X6,X7,X8),X12)
| ~ in(apply_netmap(X6,X7,X12),X8) ) )
| is_often_in(X6,X7,X8) ) ) ) ),
inference(skolemize,[status(esa)],[188]) ).
fof(190,plain,
! [X6,X7,X8,X9,X12] :
( ( ( ( ( ~ element(X12,the_carrier(X7))
| ~ related(X7,esk14_3(X6,X7,X8),X12)
| ~ in(apply_netmap(X6,X7,X12),X8) )
& element(esk14_3(X6,X7,X8),the_carrier(X7)) )
| is_often_in(X6,X7,X8) )
& ( ~ element(X9,the_carrier(X7))
| ( element(esk13_4(X6,X7,X8,X9),the_carrier(X7))
& related(X7,X9,esk13_4(X6,X7,X8,X9))
& in(apply_netmap(X6,X7,esk13_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)],[189]) ).
fof(191,plain,
! [X6,X7,X8,X9,X12] :
( ( ~ element(X12,the_carrier(X7))
| ~ related(X7,esk14_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(esk14_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(esk13_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,esk13_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,esk13_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)],[190]) ).
cnf(195,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_often_in(X1,X2,X3)
| element(esk14_3(X1,X2,X3),the_carrier(X2))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1) ),
inference(split_conjunct,[status(thm)],[191]) ).
cnf(196,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,esk14_3(X1,X2,X3),X4)
| ~ element(X4,the_carrier(X2)) ),
inference(split_conjunct,[status(thm)],[191]) ).
fof(206,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)],[74]) ).
fof(207,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)],[206]) ).
fof(208,negated_conjecture,
( ~ empty_carrier(esk16_0)
& one_sorted_str(esk16_0)
& ~ empty_carrier(esk17_0)
& transitive_relstr(esk17_0)
& directed_relstr(esk17_0)
& net_str(esk17_0,esk16_0)
& is_eventually_in(esk16_0,esk17_0,esk18_0)
& ~ is_often_in(esk16_0,esk17_0,esk18_0) ),
inference(skolemize,[status(esa)],[207]) ).
cnf(209,negated_conjecture,
~ is_often_in(esk16_0,esk17_0,esk18_0),
inference(split_conjunct,[status(thm)],[208]) ).
cnf(210,negated_conjecture,
is_eventually_in(esk16_0,esk17_0,esk18_0),
inference(split_conjunct,[status(thm)],[208]) ).
cnf(211,negated_conjecture,
net_str(esk17_0,esk16_0),
inference(split_conjunct,[status(thm)],[208]) ).
cnf(212,negated_conjecture,
directed_relstr(esk17_0),
inference(split_conjunct,[status(thm)],[208]) ).
cnf(214,negated_conjecture,
~ empty_carrier(esk17_0),
inference(split_conjunct,[status(thm)],[208]) ).
cnf(215,negated_conjecture,
one_sorted_str(esk16_0),
inference(split_conjunct,[status(thm)],[208]) ).
cnf(216,negated_conjecture,
~ empty_carrier(esk16_0),
inference(split_conjunct,[status(thm)],[208]) ).
fof(239,plain,
! [X1] :
( ~ one_sorted_str(X1)
| ! [X2] :
( ~ net_str(X2,X1)
| rel_str(X2) ) ),
inference(fof_nnf,[status(thm)],[41]) ).
fof(240,plain,
! [X3] :
( ~ one_sorted_str(X3)
| ! [X4] :
( ~ net_str(X4,X3)
| rel_str(X4) ) ),
inference(variable_rename,[status(thm)],[239]) ).
fof(241,plain,
! [X3,X4] :
( ~ net_str(X4,X3)
| rel_str(X4)
| ~ one_sorted_str(X3) ),
inference(shift_quantors,[status(thm)],[240]) ).
cnf(242,plain,
( rel_str(X2)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1) ),
inference(split_conjunct,[status(thm)],[241]) ).
fof(256,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)],[78]) ).
fof(257,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)],[256]) ).
fof(258,plain,
! [X5] :
( empty_carrier(X5)
| ~ rel_str(X5)
| ( ( ~ directed_relstr(X5)
| ! [X6] :
( ~ element(X6,the_carrier(X5))
| ! [X7] :
( ~ element(X7,the_carrier(X5))
| ( element(esk20_3(X5,X6,X7),the_carrier(X5))
& related(X5,X6,esk20_3(X5,X6,X7))
& related(X5,X7,esk20_3(X5,X6,X7)) ) ) ) )
& ( ( element(esk21_1(X5),the_carrier(X5))
& element(esk22_1(X5),the_carrier(X5))
& ! [X11] :
( ~ element(X11,the_carrier(X5))
| ~ related(X5,esk21_1(X5),X11)
| ~ related(X5,esk22_1(X5),X11) ) )
| directed_relstr(X5) ) ) ),
inference(skolemize,[status(esa)],[257]) ).
fof(259,plain,
! [X5,X6,X7,X11] :
( ( ( ( ( ~ element(X11,the_carrier(X5))
| ~ related(X5,esk21_1(X5),X11)
| ~ related(X5,esk22_1(X5),X11) )
& element(esk22_1(X5),the_carrier(X5))
& element(esk21_1(X5),the_carrier(X5)) )
| directed_relstr(X5) )
& ( ~ element(X7,the_carrier(X5))
| ( element(esk20_3(X5,X6,X7),the_carrier(X5))
& related(X5,X6,esk20_3(X5,X6,X7))
& related(X5,X7,esk20_3(X5,X6,X7)) )
| ~ element(X6,the_carrier(X5))
| ~ directed_relstr(X5) ) )
| empty_carrier(X5)
| ~ rel_str(X5) ),
inference(shift_quantors,[status(thm)],[258]) ).
fof(260,plain,
! [X5,X6,X7,X11] :
( ( ~ element(X11,the_carrier(X5))
| ~ related(X5,esk21_1(X5),X11)
| ~ related(X5,esk22_1(X5),X11)
| directed_relstr(X5)
| empty_carrier(X5)
| ~ rel_str(X5) )
& ( element(esk22_1(X5),the_carrier(X5))
| directed_relstr(X5)
| empty_carrier(X5)
| ~ rel_str(X5) )
& ( element(esk21_1(X5),the_carrier(X5))
| directed_relstr(X5)
| empty_carrier(X5)
| ~ rel_str(X5) )
& ( element(esk20_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,esk20_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,esk20_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)],[259]) ).
cnf(261,plain,
( empty_carrier(X1)
| related(X1,X3,esk20_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)],[260]) ).
cnf(262,plain,
( empty_carrier(X1)
| related(X1,X2,esk20_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)],[260]) ).
cnf(263,plain,
( empty_carrier(X1)
| element(esk20_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)],[260]) ).
cnf(362,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| in(apply_netmap(X1,X2,esk20_3(X2,esk6_3(X1,X2,X3),X4)),X3)
| ~ is_eventually_in(X1,X2,X3)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| ~ element(esk20_3(X2,esk6_3(X1,X2,X3),X4),the_carrier(X2))
| ~ directed_relstr(X2)
| ~ element(X4,the_carrier(X2))
| ~ element(esk6_3(X1,X2,X3),the_carrier(X2))
| ~ rel_str(X2) ),
inference(spm,[status(thm)],[134,262,theory(equality)]) ).
cnf(365,plain,
( is_often_in(X1,X2,X3)
| empty_carrier(X1)
| empty_carrier(X2)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| ~ element(esk20_3(X2,X4,esk14_3(X1,X2,X3)),the_carrier(X2))
| ~ in(apply_netmap(X1,X2,esk20_3(X2,X4,esk14_3(X1,X2,X3))),X3)
| ~ directed_relstr(X2)
| ~ element(esk14_3(X1,X2,X3),the_carrier(X2))
| ~ element(X4,the_carrier(X2))
| ~ rel_str(X2) ),
inference(spm,[status(thm)],[196,261,theory(equality)]) ).
cnf(843,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| in(apply_netmap(X1,X2,esk20_3(X2,esk6_3(X1,X2,X3),X4)),X3)
| ~ directed_relstr(X2)
| ~ is_eventually_in(X1,X2,X3)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| ~ element(esk20_3(X2,esk6_3(X1,X2,X3),X4),the_carrier(X2))
| ~ element(esk6_3(X1,X2,X3),the_carrier(X2))
| ~ element(X4,the_carrier(X2)) ),
inference(csr,[status(thm)],[362,242]) ).
cnf(844,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| in(apply_netmap(X1,X2,esk20_3(X2,esk6_3(X1,X2,X3),X4)),X3)
| ~ directed_relstr(X2)
| ~ is_eventually_in(X1,X2,X3)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| ~ element(esk20_3(X2,esk6_3(X1,X2,X3),X4),the_carrier(X2))
| ~ element(X4,the_carrier(X2)) ),
inference(csr,[status(thm)],[843,133]) ).
cnf(939,plain,
( is_often_in(X1,X2,X3)
| empty_carrier(X1)
| empty_carrier(X2)
| ~ directed_relstr(X2)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| ~ element(esk20_3(X2,X4,esk14_3(X1,X2,X3)),the_carrier(X2))
| ~ element(esk14_3(X1,X2,X3),the_carrier(X2))
| ~ element(X4,the_carrier(X2))
| ~ in(apply_netmap(X1,X2,esk20_3(X2,X4,esk14_3(X1,X2,X3))),X3) ),
inference(csr,[status(thm)],[365,242]) ).
cnf(940,plain,
( is_often_in(X1,X2,X3)
| empty_carrier(X1)
| empty_carrier(X2)
| ~ directed_relstr(X2)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| ~ element(esk20_3(X2,X4,esk14_3(X1,X2,X3)),the_carrier(X2))
| ~ element(X4,the_carrier(X2))
| ~ in(apply_netmap(X1,X2,esk20_3(X2,X4,esk14_3(X1,X2,X3))),X3) ),
inference(csr,[status(thm)],[939,195]) ).
cnf(942,plain,
( is_often_in(X1,X2,X3)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ directed_relstr(X2)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| ~ element(esk20_3(X2,esk6_3(X1,X2,X3),esk14_3(X1,X2,X3)),the_carrier(X2))
| ~ element(esk6_3(X1,X2,X3),the_carrier(X2))
| ~ is_eventually_in(X1,X2,X3)
| ~ element(esk14_3(X1,X2,X3),the_carrier(X2)) ),
inference(spm,[status(thm)],[940,844,theory(equality)]) ).
cnf(10530,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(esk20_3(X2,esk6_3(X1,X2,X3),esk14_3(X1,X2,X3)),the_carrier(X2))
| ~ element(esk6_3(X1,X2,X3),the_carrier(X2)) ),
inference(csr,[status(thm)],[942,195]) ).
cnf(10531,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(esk20_3(X2,esk6_3(X1,X2,X3),esk14_3(X1,X2,X3)),the_carrier(X2)) ),
inference(csr,[status(thm)],[10530,133]) ).
cnf(10532,plain,
( is_often_in(X1,X2,X3)
| empty_carrier(X1)
| empty_carrier(X2)
| ~ directed_relstr(X2)
| ~ is_eventually_in(X1,X2,X3)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| ~ element(esk14_3(X1,X2,X3),the_carrier(X2))
| ~ element(esk6_3(X1,X2,X3),the_carrier(X2))
| ~ rel_str(X2) ),
inference(spm,[status(thm)],[10531,263,theory(equality)]) ).
cnf(11054,plain,
( is_often_in(X1,X2,X3)
| empty_carrier(X1)
| empty_carrier(X2)
| ~ directed_relstr(X2)
| ~ is_eventually_in(X1,X2,X3)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| ~ element(esk14_3(X1,X2,X3),the_carrier(X2))
| ~ element(esk6_3(X1,X2,X3),the_carrier(X2)) ),
inference(csr,[status(thm)],[10532,242]) ).
cnf(11055,plain,
( is_often_in(X1,X2,X3)
| empty_carrier(X1)
| empty_carrier(X2)
| ~ directed_relstr(X2)
| ~ is_eventually_in(X1,X2,X3)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| ~ element(esk14_3(X1,X2,X3),the_carrier(X2)) ),
inference(csr,[status(thm)],[11054,133]) ).
cnf(11056,plain,
( is_often_in(X1,X2,X3)
| empty_carrier(X1)
| empty_carrier(X2)
| ~ directed_relstr(X2)
| ~ is_eventually_in(X1,X2,X3)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(csr,[status(thm)],[11055,195]) ).
cnf(11057,negated_conjecture,
( empty_carrier(esk17_0)
| empty_carrier(esk16_0)
| ~ directed_relstr(esk17_0)
| ~ is_eventually_in(esk16_0,esk17_0,esk18_0)
| ~ net_str(esk17_0,esk16_0)
| ~ one_sorted_str(esk16_0) ),
inference(spm,[status(thm)],[209,11056,theory(equality)]) ).
cnf(11068,negated_conjecture,
( empty_carrier(esk17_0)
| empty_carrier(esk16_0)
| $false
| ~ is_eventually_in(esk16_0,esk17_0,esk18_0)
| ~ net_str(esk17_0,esk16_0)
| ~ one_sorted_str(esk16_0) ),
inference(rw,[status(thm)],[11057,212,theory(equality)]) ).
cnf(11069,negated_conjecture,
( empty_carrier(esk17_0)
| empty_carrier(esk16_0)
| $false
| $false
| ~ net_str(esk17_0,esk16_0)
| ~ one_sorted_str(esk16_0) ),
inference(rw,[status(thm)],[11068,210,theory(equality)]) ).
cnf(11070,negated_conjecture,
( empty_carrier(esk17_0)
| empty_carrier(esk16_0)
| $false
| $false
| $false
| ~ one_sorted_str(esk16_0) ),
inference(rw,[status(thm)],[11069,211,theory(equality)]) ).
cnf(11071,negated_conjecture,
( empty_carrier(esk17_0)
| empty_carrier(esk16_0)
| $false
| $false
| $false
| $false ),
inference(rw,[status(thm)],[11070,215,theory(equality)]) ).
cnf(11072,negated_conjecture,
( empty_carrier(esk17_0)
| empty_carrier(esk16_0) ),
inference(cn,[status(thm)],[11071,theory(equality)]) ).
cnf(11073,negated_conjecture,
empty_carrier(esk16_0),
inference(sr,[status(thm)],[11072,214,theory(equality)]) ).
cnf(11074,negated_conjecture,
$false,
inference(sr,[status(thm)],[11073,216,theory(equality)]) ).
cnf(11075,negated_conjecture,
$false,
11074,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU376+1.p
% --creating new selector for []
% -running prover on /tmp/tmpTJU7Tt/sel_SEU376+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU376+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU376+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU376+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------