TSTP Solution File: SEU391+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU391+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri May 3 03:06:04 EDT 2024
% Result : Theorem 0.47s 1.14s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 7
% Syntax : Number of formulae : 74 ( 14 unt; 0 def)
% Number of atoms : 383 ( 45 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 492 ( 183 ~; 209 |; 82 &)
% ( 5 <=>; 11 =>; 0 <=; 2 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 121 ( 0 sgn 54 !; 27 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f21,axiom,
! [X0] :
( ( one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ! [X1] :
( ( net_str(X1,X0)
& ~ empty_carrier(X1) )
=> filter_of_net_str(X0,X1) = a_2_1_yellow19(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_yellow19) ).
fof(f61,axiom,
! [X0,X1,X2] :
( ( net_str(X2,X1)
& ~ empty_carrier(X2)
& one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ( in(X0,a_2_1_yellow19(X1,X2))
<=> ? [X3] :
( is_eventually_in(X1,X2,X3)
& X0 = X3
& element(X3,powerset(the_carrier(X1))) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fraenkel_a_2_1_yellow19) ).
fof(f92,conjecture,
! [X0] :
( ( one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ! [X1] :
( ( net_str(X1,X0)
& ~ empty_carrier(X1) )
=> ! [X2] :
( in(X2,filter_of_net_str(X0,X1))
<=> ( element(X2,powerset(the_carrier(X0)))
& is_eventually_in(X0,X1,X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_yellow19) ).
fof(f93,negated_conjecture,
~ ! [X0] :
( ( one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ! [X1] :
( ( net_str(X1,X0)
& ~ empty_carrier(X1) )
=> ! [X2] :
( in(X2,filter_of_net_str(X0,X1))
<=> ( element(X2,powerset(the_carrier(X0)))
& is_eventually_in(X0,X1,X2) ) ) ) ),
inference(negated_conjecture,[],[f92]) ).
fof(f189,plain,
! [X0] :
( ! [X1] :
( filter_of_net_str(X0,X1) = a_2_1_yellow19(X0,X1)
| ~ net_str(X1,X0)
| empty_carrier(X1) )
| ~ one_sorted_str(X0)
| empty_carrier(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f190,plain,
! [X0] :
( ! [X1] :
( filter_of_net_str(X0,X1) = a_2_1_yellow19(X0,X1)
| ~ net_str(X1,X0)
| empty_carrier(X1) )
| ~ one_sorted_str(X0)
| empty_carrier(X0) ),
inference(flattening,[],[f189]) ).
fof(f221,plain,
! [X0,X1,X2] :
( ( in(X0,a_2_1_yellow19(X1,X2))
<=> ? [X3] :
( is_eventually_in(X1,X2,X3)
& X0 = X3
& element(X3,powerset(the_carrier(X1))) ) )
| ~ net_str(X2,X1)
| empty_carrier(X2)
| ~ one_sorted_str(X1)
| empty_carrier(X1) ),
inference(ennf_transformation,[],[f61]) ).
fof(f222,plain,
! [X0,X1,X2] :
( ( in(X0,a_2_1_yellow19(X1,X2))
<=> ? [X3] :
( is_eventually_in(X1,X2,X3)
& X0 = X3
& element(X3,powerset(the_carrier(X1))) ) )
| ~ net_str(X2,X1)
| empty_carrier(X2)
| ~ one_sorted_str(X1)
| empty_carrier(X1) ),
inference(flattening,[],[f221]) ).
fof(f242,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( in(X2,filter_of_net_str(X0,X1))
<~> ( element(X2,powerset(the_carrier(X0)))
& is_eventually_in(X0,X1,X2) ) )
& net_str(X1,X0)
& ~ empty_carrier(X1) )
& one_sorted_str(X0)
& ~ empty_carrier(X0) ),
inference(ennf_transformation,[],[f93]) ).
fof(f243,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( in(X2,filter_of_net_str(X0,X1))
<~> ( element(X2,powerset(the_carrier(X0)))
& is_eventually_in(X0,X1,X2) ) )
& net_str(X1,X0)
& ~ empty_carrier(X1) )
& one_sorted_str(X0)
& ~ empty_carrier(X0) ),
inference(flattening,[],[f242]) ).
fof(f273,plain,
! [X0,X1,X2] :
( ( ( in(X0,a_2_1_yellow19(X1,X2))
| ! [X3] :
( ~ is_eventually_in(X1,X2,X3)
| X0 != X3
| ~ element(X3,powerset(the_carrier(X1))) ) )
& ( ? [X3] :
( is_eventually_in(X1,X2,X3)
& X0 = X3
& element(X3,powerset(the_carrier(X1))) )
| ~ in(X0,a_2_1_yellow19(X1,X2)) ) )
| ~ net_str(X2,X1)
| empty_carrier(X2)
| ~ one_sorted_str(X1)
| empty_carrier(X1) ),
inference(nnf_transformation,[],[f222]) ).
fof(f274,plain,
! [X0,X1,X2] :
( ( ( in(X0,a_2_1_yellow19(X1,X2))
| ! [X3] :
( ~ is_eventually_in(X1,X2,X3)
| X0 != X3
| ~ element(X3,powerset(the_carrier(X1))) ) )
& ( ? [X4] :
( is_eventually_in(X1,X2,X4)
& X0 = X4
& element(X4,powerset(the_carrier(X1))) )
| ~ in(X0,a_2_1_yellow19(X1,X2)) ) )
| ~ net_str(X2,X1)
| empty_carrier(X2)
| ~ one_sorted_str(X1)
| empty_carrier(X1) ),
inference(rectify,[],[f273]) ).
fof(f275,plain,
! [X0,X1,X2] :
( ? [X4] :
( is_eventually_in(X1,X2,X4)
& X0 = X4
& element(X4,powerset(the_carrier(X1))) )
=> ( is_eventually_in(X1,X2,sK8(X0,X1,X2))
& sK8(X0,X1,X2) = X0
& element(sK8(X0,X1,X2),powerset(the_carrier(X1))) ) ),
introduced(choice_axiom,[]) ).
fof(f276,plain,
! [X0,X1,X2] :
( ( ( in(X0,a_2_1_yellow19(X1,X2))
| ! [X3] :
( ~ is_eventually_in(X1,X2,X3)
| X0 != X3
| ~ element(X3,powerset(the_carrier(X1))) ) )
& ( ( is_eventually_in(X1,X2,sK8(X0,X1,X2))
& sK8(X0,X1,X2) = X0
& element(sK8(X0,X1,X2),powerset(the_carrier(X1))) )
| ~ in(X0,a_2_1_yellow19(X1,X2)) ) )
| ~ net_str(X2,X1)
| empty_carrier(X2)
| ~ one_sorted_str(X1)
| empty_carrier(X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f274,f275]) ).
fof(f330,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ( ~ element(X2,powerset(the_carrier(X0)))
| ~ is_eventually_in(X0,X1,X2)
| ~ in(X2,filter_of_net_str(X0,X1)) )
& ( ( element(X2,powerset(the_carrier(X0)))
& is_eventually_in(X0,X1,X2) )
| in(X2,filter_of_net_str(X0,X1)) ) )
& net_str(X1,X0)
& ~ empty_carrier(X1) )
& one_sorted_str(X0)
& ~ empty_carrier(X0) ),
inference(nnf_transformation,[],[f243]) ).
fof(f331,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ( ~ element(X2,powerset(the_carrier(X0)))
| ~ is_eventually_in(X0,X1,X2)
| ~ in(X2,filter_of_net_str(X0,X1)) )
& ( ( element(X2,powerset(the_carrier(X0)))
& is_eventually_in(X0,X1,X2) )
| in(X2,filter_of_net_str(X0,X1)) ) )
& net_str(X1,X0)
& ~ empty_carrier(X1) )
& one_sorted_str(X0)
& ~ empty_carrier(X0) ),
inference(flattening,[],[f330]) ).
fof(f332,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ( ~ element(X2,powerset(the_carrier(X0)))
| ~ is_eventually_in(X0,X1,X2)
| ~ in(X2,filter_of_net_str(X0,X1)) )
& ( ( element(X2,powerset(the_carrier(X0)))
& is_eventually_in(X0,X1,X2) )
| in(X2,filter_of_net_str(X0,X1)) ) )
& net_str(X1,X0)
& ~ empty_carrier(X1) )
& one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ( ? [X1] :
( ? [X2] :
( ( ~ element(X2,powerset(the_carrier(sK35)))
| ~ is_eventually_in(sK35,X1,X2)
| ~ in(X2,filter_of_net_str(sK35,X1)) )
& ( ( element(X2,powerset(the_carrier(sK35)))
& is_eventually_in(sK35,X1,X2) )
| in(X2,filter_of_net_str(sK35,X1)) ) )
& net_str(X1,sK35)
& ~ empty_carrier(X1) )
& one_sorted_str(sK35)
& ~ empty_carrier(sK35) ) ),
introduced(choice_axiom,[]) ).
fof(f333,plain,
( ? [X1] :
( ? [X2] :
( ( ~ element(X2,powerset(the_carrier(sK35)))
| ~ is_eventually_in(sK35,X1,X2)
| ~ in(X2,filter_of_net_str(sK35,X1)) )
& ( ( element(X2,powerset(the_carrier(sK35)))
& is_eventually_in(sK35,X1,X2) )
| in(X2,filter_of_net_str(sK35,X1)) ) )
& net_str(X1,sK35)
& ~ empty_carrier(X1) )
=> ( ? [X2] :
( ( ~ element(X2,powerset(the_carrier(sK35)))
| ~ is_eventually_in(sK35,sK36,X2)
| ~ in(X2,filter_of_net_str(sK35,sK36)) )
& ( ( element(X2,powerset(the_carrier(sK35)))
& is_eventually_in(sK35,sK36,X2) )
| in(X2,filter_of_net_str(sK35,sK36)) ) )
& net_str(sK36,sK35)
& ~ empty_carrier(sK36) ) ),
introduced(choice_axiom,[]) ).
fof(f334,plain,
( ? [X2] :
( ( ~ element(X2,powerset(the_carrier(sK35)))
| ~ is_eventually_in(sK35,sK36,X2)
| ~ in(X2,filter_of_net_str(sK35,sK36)) )
& ( ( element(X2,powerset(the_carrier(sK35)))
& is_eventually_in(sK35,sK36,X2) )
| in(X2,filter_of_net_str(sK35,sK36)) ) )
=> ( ( ~ element(sK37,powerset(the_carrier(sK35)))
| ~ is_eventually_in(sK35,sK36,sK37)
| ~ in(sK37,filter_of_net_str(sK35,sK36)) )
& ( ( element(sK37,powerset(the_carrier(sK35)))
& is_eventually_in(sK35,sK36,sK37) )
| in(sK37,filter_of_net_str(sK35,sK36)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f335,plain,
( ( ~ element(sK37,powerset(the_carrier(sK35)))
| ~ is_eventually_in(sK35,sK36,sK37)
| ~ in(sK37,filter_of_net_str(sK35,sK36)) )
& ( ( element(sK37,powerset(the_carrier(sK35)))
& is_eventually_in(sK35,sK36,sK37) )
| in(sK37,filter_of_net_str(sK35,sK36)) )
& net_str(sK36,sK35)
& ~ empty_carrier(sK36)
& one_sorted_str(sK35)
& ~ empty_carrier(sK35) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK35,sK36,sK37])],[f331,f334,f333,f332]) ).
fof(f391,plain,
! [X0,X1] :
( filter_of_net_str(X0,X1) = a_2_1_yellow19(X0,X1)
| ~ net_str(X1,X0)
| empty_carrier(X1)
| ~ one_sorted_str(X0)
| empty_carrier(X0) ),
inference(cnf_transformation,[],[f190]) ).
fof(f478,plain,
! [X2,X0,X1] :
( element(sK8(X0,X1,X2),powerset(the_carrier(X1)))
| ~ in(X0,a_2_1_yellow19(X1,X2))
| ~ net_str(X2,X1)
| empty_carrier(X2)
| ~ one_sorted_str(X1)
| empty_carrier(X1) ),
inference(cnf_transformation,[],[f276]) ).
fof(f479,plain,
! [X2,X0,X1] :
( sK8(X0,X1,X2) = X0
| ~ in(X0,a_2_1_yellow19(X1,X2))
| ~ net_str(X2,X1)
| empty_carrier(X2)
| ~ one_sorted_str(X1)
| empty_carrier(X1) ),
inference(cnf_transformation,[],[f276]) ).
fof(f480,plain,
! [X2,X0,X1] :
( is_eventually_in(X1,X2,sK8(X0,X1,X2))
| ~ in(X0,a_2_1_yellow19(X1,X2))
| ~ net_str(X2,X1)
| empty_carrier(X2)
| ~ one_sorted_str(X1)
| empty_carrier(X1) ),
inference(cnf_transformation,[],[f276]) ).
fof(f481,plain,
! [X2,X3,X0,X1] :
( in(X0,a_2_1_yellow19(X1,X2))
| ~ is_eventually_in(X1,X2,X3)
| X0 != X3
| ~ element(X3,powerset(the_carrier(X1)))
| ~ net_str(X2,X1)
| empty_carrier(X2)
| ~ one_sorted_str(X1)
| empty_carrier(X1) ),
inference(cnf_transformation,[],[f276]) ).
fof(f596,plain,
~ empty_carrier(sK35),
inference(cnf_transformation,[],[f335]) ).
fof(f597,plain,
one_sorted_str(sK35),
inference(cnf_transformation,[],[f335]) ).
fof(f598,plain,
~ empty_carrier(sK36),
inference(cnf_transformation,[],[f335]) ).
fof(f599,plain,
net_str(sK36,sK35),
inference(cnf_transformation,[],[f335]) ).
fof(f600,plain,
( is_eventually_in(sK35,sK36,sK37)
| in(sK37,filter_of_net_str(sK35,sK36)) ),
inference(cnf_transformation,[],[f335]) ).
fof(f601,plain,
( element(sK37,powerset(the_carrier(sK35)))
| in(sK37,filter_of_net_str(sK35,sK36)) ),
inference(cnf_transformation,[],[f335]) ).
fof(f602,plain,
( ~ element(sK37,powerset(the_carrier(sK35)))
| ~ is_eventually_in(sK35,sK36,sK37)
| ~ in(sK37,filter_of_net_str(sK35,sK36)) ),
inference(cnf_transformation,[],[f335]) ).
fof(f613,plain,
! [X2,X3,X1] :
( in(X3,a_2_1_yellow19(X1,X2))
| ~ is_eventually_in(X1,X2,X3)
| ~ element(X3,powerset(the_carrier(X1)))
| ~ net_str(X2,X1)
| empty_carrier(X2)
| ~ one_sorted_str(X1)
| empty_carrier(X1) ),
inference(equality_resolution,[],[f481]) ).
cnf(c_82,plain,
( ~ net_str(X0,X1)
| ~ one_sorted_str(X1)
| filter_of_net_str(X1,X0) = a_2_1_yellow19(X1,X0)
| empty_carrier(X0)
| empty_carrier(X1) ),
inference(cnf_transformation,[],[f391]) ).
cnf(c_169,plain,
( ~ element(X0,powerset(the_carrier(X1)))
| ~ is_eventually_in(X1,X2,X0)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| in(X0,a_2_1_yellow19(X1,X2))
| empty_carrier(X1)
| empty_carrier(X2) ),
inference(cnf_transformation,[],[f613]) ).
cnf(c_170,plain,
( ~ in(X0,a_2_1_yellow19(X1,X2))
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| is_eventually_in(X1,X2,sK8(X0,X1,X2))
| empty_carrier(X1)
| empty_carrier(X2) ),
inference(cnf_transformation,[],[f480]) ).
cnf(c_171,plain,
( ~ in(X0,a_2_1_yellow19(X1,X2))
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| sK8(X0,X1,X2) = X0
| empty_carrier(X1)
| empty_carrier(X2) ),
inference(cnf_transformation,[],[f479]) ).
cnf(c_172,plain,
( ~ in(X0,a_2_1_yellow19(X1,X2))
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| element(sK8(X0,X1,X2),powerset(the_carrier(X1)))
| empty_carrier(X1)
| empty_carrier(X2) ),
inference(cnf_transformation,[],[f478]) ).
cnf(c_287,negated_conjecture,
( ~ in(sK37,filter_of_net_str(sK35,sK36))
| ~ element(sK37,powerset(the_carrier(sK35)))
| ~ is_eventually_in(sK35,sK36,sK37) ),
inference(cnf_transformation,[],[f602]) ).
cnf(c_288,negated_conjecture,
( in(sK37,filter_of_net_str(sK35,sK36))
| element(sK37,powerset(the_carrier(sK35))) ),
inference(cnf_transformation,[],[f601]) ).
cnf(c_289,negated_conjecture,
( in(sK37,filter_of_net_str(sK35,sK36))
| is_eventually_in(sK35,sK36,sK37) ),
inference(cnf_transformation,[],[f600]) ).
cnf(c_290,negated_conjecture,
net_str(sK36,sK35),
inference(cnf_transformation,[],[f599]) ).
cnf(c_291,negated_conjecture,
~ empty_carrier(sK36),
inference(cnf_transformation,[],[f598]) ).
cnf(c_292,negated_conjecture,
one_sorted_str(sK35),
inference(cnf_transformation,[],[f597]) ).
cnf(c_293,negated_conjecture,
~ empty_carrier(sK35),
inference(cnf_transformation,[],[f596]) ).
cnf(c_548,plain,
( is_eventually_in(sK35,sK36,sK37)
| in(sK37,filter_of_net_str(sK35,sK36)) ),
inference(prop_impl_just,[status(thm)],[c_289]) ).
cnf(c_549,plain,
( in(sK37,filter_of_net_str(sK35,sK36))
| is_eventually_in(sK35,sK36,sK37) ),
inference(renaming,[status(thm)],[c_548]) ).
cnf(c_2665,plain,
( X0 != sK37
| X1 != sK35
| X2 != sK36
| ~ element(X0,powerset(the_carrier(X1)))
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| in(X0,a_2_1_yellow19(X1,X2))
| in(sK37,filter_of_net_str(sK35,sK36))
| empty_carrier(X1)
| empty_carrier(X2) ),
inference(resolution_lifted,[status(thm)],[c_169,c_549]) ).
cnf(c_2666,plain,
( ~ element(sK37,powerset(the_carrier(sK35)))
| ~ net_str(sK36,sK35)
| ~ one_sorted_str(sK35)
| in(sK37,filter_of_net_str(sK35,sK36))
| in(sK37,a_2_1_yellow19(sK35,sK36))
| empty_carrier(sK35)
| empty_carrier(sK36) ),
inference(unflattening,[status(thm)],[c_2665]) ).
cnf(c_2667,plain,
( in(sK37,filter_of_net_str(sK35,sK36))
| in(sK37,a_2_1_yellow19(sK35,sK36)) ),
inference(global_subsumption_just,[status(thm)],[c_2666,c_292,c_293,c_291,c_290,c_288,c_2666]) ).
cnf(c_2675,plain,
( sK8(X0,X1,X2) != sK37
| X1 != sK35
| X2 != sK36
| ~ in(X0,a_2_1_yellow19(X1,X2))
| ~ in(sK37,filter_of_net_str(sK35,sK36))
| ~ element(sK37,powerset(the_carrier(sK35)))
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| empty_carrier(X1)
| empty_carrier(X2) ),
inference(resolution_lifted,[status(thm)],[c_170,c_287]) ).
cnf(c_2676,plain,
( sK8(X0,sK35,sK36) != sK37
| ~ in(X0,a_2_1_yellow19(sK35,sK36))
| ~ in(sK37,filter_of_net_str(sK35,sK36))
| ~ element(sK37,powerset(the_carrier(sK35)))
| ~ net_str(sK36,sK35)
| ~ one_sorted_str(sK35)
| empty_carrier(sK35)
| empty_carrier(sK36) ),
inference(unflattening,[status(thm)],[c_2675]) ).
cnf(c_2678,plain,
( sK8(X0,sK35,sK36) != sK37
| ~ in(X0,a_2_1_yellow19(sK35,sK36))
| ~ in(sK37,filter_of_net_str(sK35,sK36))
| ~ element(sK37,powerset(the_carrier(sK35))) ),
inference(global_subsumption_just,[status(thm)],[c_2676,c_292,c_293,c_291,c_290,c_2676]) ).
cnf(c_2912,plain,
( X0 != sK36
| X1 != sK35
| ~ one_sorted_str(X1)
| filter_of_net_str(X1,X0) = a_2_1_yellow19(X1,X0)
| empty_carrier(X0)
| empty_carrier(X1) ),
inference(resolution_lifted,[status(thm)],[c_82,c_290]) ).
cnf(c_2913,plain,
( ~ one_sorted_str(sK35)
| filter_of_net_str(sK35,sK36) = a_2_1_yellow19(sK35,sK36)
| empty_carrier(sK35)
| empty_carrier(sK36) ),
inference(unflattening,[status(thm)],[c_2912]) ).
cnf(c_2914,plain,
filter_of_net_str(sK35,sK36) = a_2_1_yellow19(sK35,sK36),
inference(global_subsumption_just,[status(thm)],[c_2913,c_292,c_293,c_291,c_2913]) ).
cnf(c_2985,plain,
( X0 != sK35
| X1 != sK36
| ~ in(X2,a_2_1_yellow19(X0,X1))
| ~ one_sorted_str(X0)
| element(sK8(X2,X0,X1),powerset(the_carrier(X0)))
| empty_carrier(X0)
| empty_carrier(X1) ),
inference(resolution_lifted,[status(thm)],[c_172,c_290]) ).
cnf(c_2986,plain,
( ~ in(X0,a_2_1_yellow19(sK35,sK36))
| ~ one_sorted_str(sK35)
| element(sK8(X0,sK35,sK36),powerset(the_carrier(sK35)))
| empty_carrier(sK35)
| empty_carrier(sK36) ),
inference(unflattening,[status(thm)],[c_2985]) ).
cnf(c_2988,plain,
( ~ in(X0,a_2_1_yellow19(sK35,sK36))
| element(sK8(X0,sK35,sK36),powerset(the_carrier(sK35))) ),
inference(global_subsumption_just,[status(thm)],[c_2986,c_292,c_293,c_291,c_2986]) ).
cnf(c_2997,plain,
( X0 != sK35
| X1 != sK36
| ~ in(X2,a_2_1_yellow19(X0,X1))
| ~ one_sorted_str(X0)
| sK8(X2,X0,X1) = X2
| empty_carrier(X0)
| empty_carrier(X1) ),
inference(resolution_lifted,[status(thm)],[c_171,c_290]) ).
cnf(c_2998,plain,
( ~ in(X0,a_2_1_yellow19(sK35,sK36))
| ~ one_sorted_str(sK35)
| sK8(X0,sK35,sK36) = X0
| empty_carrier(sK35)
| empty_carrier(sK36) ),
inference(unflattening,[status(thm)],[c_2997]) ).
cnf(c_3000,plain,
( ~ in(X0,a_2_1_yellow19(sK35,sK36))
| sK8(X0,sK35,sK36) = X0 ),
inference(global_subsumption_just,[status(thm)],[c_2998,c_292,c_293,c_291,c_2998]) ).
cnf(c_7307,plain,
in(sK37,filter_of_net_str(sK35,sK36)),
inference(light_normalisation,[status(thm)],[c_2667,c_2914]) ).
cnf(c_7442,plain,
( ~ in(X0,filter_of_net_str(sK35,sK36))
| sK8(X0,sK35,sK36) = X0 ),
inference(light_normalisation,[status(thm)],[c_3000,c_2914]) ).
cnf(c_7447,plain,
( ~ in(X0,filter_of_net_str(sK35,sK36))
| element(sK8(X0,sK35,sK36),powerset(the_carrier(sK35))) ),
inference(light_normalisation,[status(thm)],[c_2988,c_2914]) ).
cnf(c_7545,plain,
( sK8(X0,sK35,sK36) != sK37
| ~ in(X0,filter_of_net_str(sK35,sK36))
| ~ in(sK37,filter_of_net_str(sK35,sK36))
| ~ element(sK37,powerset(the_carrier(sK35))) ),
inference(light_normalisation,[status(thm)],[c_2678,c_2914]) ).
cnf(c_7546,plain,
( sK8(X0,sK35,sK36) != sK37
| ~ in(X0,filter_of_net_str(sK35,sK36))
| ~ element(sK37,powerset(the_carrier(sK35))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_7545,c_7307]) ).
cnf(c_13693,plain,
sK8(sK37,sK35,sK36) = sK37,
inference(superposition,[status(thm)],[c_7307,c_7442]) ).
cnf(c_13706,plain,
( ~ in(sK37,filter_of_net_str(sK35,sK36))
| element(sK37,powerset(the_carrier(sK35))) ),
inference(superposition,[status(thm)],[c_13693,c_7447]) ).
cnf(c_13708,plain,
element(sK37,powerset(the_carrier(sK35))),
inference(forward_subsumption_resolution,[status(thm)],[c_13706,c_7307]) ).
cnf(c_13719,plain,
( ~ in(X0,filter_of_net_str(sK35,sK36))
| sK8(X0,sK35,sK36) != sK37 ),
inference(global_subsumption_just,[status(thm)],[c_7546,c_7546,c_13708]) ).
cnf(c_13720,plain,
( sK8(X0,sK35,sK36) != sK37
| ~ in(X0,filter_of_net_str(sK35,sK36)) ),
inference(renaming,[status(thm)],[c_13719]) ).
cnf(c_13726,plain,
~ in(sK37,filter_of_net_str(sK35,sK36)),
inference(superposition,[status(thm)],[c_13693,c_13720]) ).
cnf(c_13727,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_13726,c_7307]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU391+1 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.13 % Command : run_iprover %s %d THM
% 0.13/0.33 % Computer : n011.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Thu May 2 17:51:33 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.45 Running first-order theorem proving
% 0.19/0.45 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.47/1.14 % SZS status Started for theBenchmark.p
% 0.47/1.14 % SZS status Theorem for theBenchmark.p
% 0.47/1.14
% 0.47/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.47/1.14
% 0.47/1.14 ------ iProver source info
% 0.47/1.14
% 0.47/1.14 git: date: 2024-05-02 19:28:25 +0000
% 0.47/1.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.47/1.14 git: non_committed_changes: false
% 0.47/1.14
% 0.47/1.14 ------ Parsing...
% 0.47/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.47/1.14
% 0.47/1.14 ------ Preprocessing... sup_sim: 0 sf_s rm: 11 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe_e sup_sim: 6 sf_s rm: 17 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 17 0s sf_e pe_s pe_e
% 0.47/1.14
% 0.47/1.14 ------ Preprocessing... gs_s sp: 4 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.47/1.14
% 0.47/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.47/1.14 ------ Proving...
% 0.47/1.14 ------ Problem Properties
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 clauses 216
% 0.47/1.14 conjectures 3
% 0.47/1.14 EPR 42
% 0.47/1.14 Horn 202
% 0.47/1.14 unary 120
% 0.47/1.14 binary 73
% 0.47/1.14 lits 343
% 0.47/1.14 lits eq 61
% 0.47/1.14 fd_pure 0
% 0.47/1.14 fd_pseudo 0
% 0.47/1.14 fd_cond 1
% 0.47/1.14 fd_pseudo_cond 5
% 0.47/1.14 AC symbols 0
% 0.47/1.14
% 0.47/1.14 ------ Schedule dynamic 5 is on
% 0.47/1.14
% 0.47/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 ------
% 0.47/1.14 Current options:
% 0.47/1.14 ------
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 ------ Proving...
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 % SZS status Theorem for theBenchmark.p
% 0.47/1.14
% 0.47/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.47/1.15
% 0.47/1.15
%------------------------------------------------------------------------------