%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU367+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 12:53:01 PM UTC 2026
% Result : Theorem 2.28s 0.85s
% Output : Refutation 2.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 17
% Syntax : Number of formulae : 162 ( 17 unt; 6 def)
% Number of atoms : 772 ( 6 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 994 ( 384 ~; 508 |; 68 &)
% ( 13 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 18 ( 16 usr; 7 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-4 aty)
% Number of variables : 266 ( 0 sgn 243 !; 23 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ! [X1] :
( ( ~ empty_carrier(X1)
& net_str(X1,X0) )
=> ! [X2] :
( is_eventually_in(X0,X1,X2)
<=> ? [X3] :
( element(X3,the_carrier(X1))
& ! [X4] :
( element(X4,the_carrier(X1))
=> ( related(X1,X3,X4)
=> in(apply_netmap(X0,X1,X4),X2) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d11_waybel_0) ).
fof(f6,axiom,
! [X0] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ! [X1] :
( ( ~ empty_carrier(X1)
& net_str(X1,X0) )
=> ! [X2] :
( is_often_in(X0,X1,X2)
<=> ! [X3] :
( element(X3,the_carrier(X1))
=> ? [X4] :
( element(X4,the_carrier(X1))
& related(X1,X3,X4)
& in(apply_netmap(X0,X1,X4),X2) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d12_waybel_0) ).
fof(f26,axiom,
! [X0] :
? [X1] : element(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_m1_subset_1) ).
fof(f31,axiom,
empty(empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(f46,axiom,
! [X0,X1] :
( element(X0,X1)
=> ( empty(X1)
| in(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).
fof(f47,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(f48,axiom,
! [X0,X1,X2] :
( ( in(X0,X1)
& element(X1,powerset(X2)) )
=> element(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_subset) ).
fof(f49,axiom,
! [X0,X1,X2] :
~ ( in(X0,X1)
& element(X1,powerset(X2))
& empty(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_subset) ).
fof(f50,axiom,
! [X0] :
( empty(X0)
=> X0 = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).
fof(f51,axiom,
! [X0,X1] :
~ ( in(X0,X1)
& empty(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_boole) ).
fof(f53,conjecture,
! [X0] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ! [X1] :
( ( ~ empty_carrier(X1)
& net_str(X1,X0) )
=> ! [X2,X3] :
( subset(X2,X3)
=> ( ( is_eventually_in(X0,X1,X2)
=> is_eventually_in(X0,X1,X3) )
& ( is_often_in(X0,X1,X2)
=> is_often_in(X0,X1,X3) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_waybel_0) ).
fof(f54,negated_conjecture,
~ ! [X0] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ! [X1] :
( ( ~ empty_carrier(X1)
& net_str(X1,X0) )
=> ! [X2,X3] :
( subset(X2,X3)
=> ( ( is_eventually_in(X0,X1,X2)
=> is_eventually_in(X0,X1,X3) )
& ( is_often_in(X0,X1,X2)
=> is_often_in(X0,X1,X3) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f56,plain,
! [X0,X1] :
( subset(X0,X1)
=> element(X0,powerset(X1)) ),
inference(unused_predicate_definition_removal,[],[f47]) ).
fof(f61,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( is_eventually_in(X0,X1,X2)
<=> ? [X3] :
( element(X3,the_carrier(X1))
& ! [X4] :
( in(apply_netmap(X0,X1,X4),X2)
| ~ related(X1,X3,X4)
| ~ element(X4,the_carrier(X1)) ) ) )
| empty_carrier(X1)
| ~ net_str(X1,X0) )
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f62,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( is_eventually_in(X0,X1,X2)
<=> ? [X3] :
( element(X3,the_carrier(X1))
& ! [X4] :
( in(apply_netmap(X0,X1,X4),X2)
| ~ related(X1,X3,X4)
| ~ element(X4,the_carrier(X1)) ) ) )
| empty_carrier(X1)
| ~ net_str(X1,X0) )
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(flattening,[],[f61]) ).
fof(f63,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( is_often_in(X0,X1,X2)
<=> ! [X3] :
( ? [X4] :
( element(X4,the_carrier(X1))
& related(X1,X3,X4)
& in(apply_netmap(X0,X1,X4),X2) )
| ~ element(X3,the_carrier(X1)) ) )
| empty_carrier(X1)
| ~ net_str(X1,X0) )
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f64,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( is_often_in(X0,X1,X2)
<=> ! [X3] :
( ? [X4] :
( element(X4,the_carrier(X1))
& related(X1,X3,X4)
& in(apply_netmap(X0,X1,X4),X2) )
| ~ element(X3,the_carrier(X1)) ) )
| empty_carrier(X1)
| ~ net_str(X1,X0) )
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(flattening,[],[f63]) ).
fof(f91,plain,
! [X0,X1] :
( empty(X1)
| in(X0,X1)
| ~ element(X0,X1) ),
inference(ennf_transformation,[],[f46]) ).
fof(f92,plain,
! [X0,X1] :
( empty(X1)
| in(X0,X1)
| ~ element(X0,X1) ),
inference(flattening,[],[f91]) ).
fof(f93,plain,
! [X0,X1] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f56]) ).
fof(f94,plain,
! [X0,X1,X2] :
( element(X0,X2)
| ~ in(X0,X1)
| ~ element(X1,powerset(X2)) ),
inference(ennf_transformation,[],[f48]) ).
fof(f95,plain,
! [X0,X1,X2] :
( element(X0,X2)
| ~ in(X0,X1)
| ~ element(X1,powerset(X2)) ),
inference(flattening,[],[f94]) ).
fof(f96,plain,
! [X0,X1,X2] :
( ~ in(X0,X1)
| ~ element(X1,powerset(X2))
| ~ empty(X2) ),
inference(ennf_transformation,[],[f49]) ).
fof(f97,plain,
! [X0] :
( X0 = empty_set
| ~ empty(X0) ),
inference(ennf_transformation,[],[f50]) ).
fof(f98,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ empty(X1) ),
inference(ennf_transformation,[],[f51]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2,X3] :
( ( ( ~ is_eventually_in(X0,X1,X3)
& is_eventually_in(X0,X1,X2) )
| ( ~ is_often_in(X0,X1,X3)
& is_often_in(X0,X1,X2) ) )
& subset(X2,X3) )
& ~ empty_carrier(X1)
& net_str(X1,X0) )
& ~ empty_carrier(X0)
& one_sorted_str(X0) ),
inference(ennf_transformation,[],[f54]) ).
fof(f101,plain,
? [X0] :
( ? [X1] :
( ? [X2,X3] :
( ( ( ~ is_eventually_in(X0,X1,X3)
& is_eventually_in(X0,X1,X2) )
| ( ~ is_often_in(X0,X1,X3)
& is_often_in(X0,X1,X2) ) )
& subset(X2,X3) )
& ~ empty_carrier(X1)
& net_str(X1,X0) )
& ~ empty_carrier(X0)
& one_sorted_str(X0) ),
inference(flattening,[],[f100]) ).
fof(f102,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( is_eventually_in(X0,X1,X2)
| ! [X3] :
( ~ element(X3,the_carrier(X1))
| ? [X4] :
( ~ in(apply_netmap(X0,X1,X4),X2)
& related(X1,X3,X4)
& element(X4,the_carrier(X1)) ) ) )
& ( ? [X3] :
( element(X3,the_carrier(X1))
& ! [X4] :
( in(apply_netmap(X0,X1,X4),X2)
| ~ related(X1,X3,X4)
| ~ element(X4,the_carrier(X1)) ) )
| ~ is_eventually_in(X0,X1,X2) ) )
| empty_carrier(X1)
| ~ net_str(X1,X0) )
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(nnf_transformation,[],[f62]) ).
fof(f103,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( is_eventually_in(X0,X1,X2)
| ! [X3] :
( ~ element(X3,the_carrier(X1))
| ? [X4] :
( ~ in(apply_netmap(X0,X1,X4),X2)
& related(X1,X3,X4)
& element(X4,the_carrier(X1)) ) ) )
& ( ? [X5] :
( element(X5,the_carrier(X1))
& ! [X6] :
( in(apply_netmap(X0,X1,X6),X2)
| ~ related(X1,X5,X6)
| ~ element(X6,the_carrier(X1)) ) )
| ~ is_eventually_in(X0,X1,X2) ) )
| empty_carrier(X1)
| ~ net_str(X1,X0) )
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(rectify,[],[f102]) ).
fof(f104,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( is_eventually_in(X0,X1,X2)
| ! [X3] :
( ~ element(X3,the_carrier(X1))
| ( ~ in(apply_netmap(X0,X1,sK0(X0,X1,X2,X3)),X2)
& related(X1,X3,sK0(X0,X1,X2,X3))
& element(sK0(X0,X1,X2,X3),the_carrier(X1)) ) ) )
& ( ( element(sK1(X0,X1,X2),the_carrier(X1))
& ! [X6] :
( in(apply_netmap(X0,X1,X6),X2)
| ~ related(X1,sK1(X0,X1,X2),X6)
| ~ element(X6,the_carrier(X1)) ) )
| ~ is_eventually_in(X0,X1,X2) ) )
| empty_carrier(X1)
| ~ net_str(X1,X0) )
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X4,sK0(X0,X1,X2,X3)),skolemize(X5,sK1(X0,X1,X2))],[f103]) ).
fof(f105,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( is_often_in(X0,X1,X2)
| ? [X3] :
( ! [X4] :
( ~ element(X4,the_carrier(X1))
| ~ related(X1,X3,X4)
| ~ in(apply_netmap(X0,X1,X4),X2) )
& element(X3,the_carrier(X1)) ) )
& ( ! [X3] :
( ? [X4] :
( element(X4,the_carrier(X1))
& related(X1,X3,X4)
& in(apply_netmap(X0,X1,X4),X2) )
| ~ element(X3,the_carrier(X1)) )
| ~ is_often_in(X0,X1,X2) ) )
| empty_carrier(X1)
| ~ net_str(X1,X0) )
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(nnf_transformation,[],[f64]) ).
fof(f106,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( is_often_in(X0,X1,X2)
| ? [X3] :
( ! [X4] :
( ~ element(X4,the_carrier(X1))
| ~ related(X1,X3,X4)
| ~ in(apply_netmap(X0,X1,X4),X2) )
& element(X3,the_carrier(X1)) ) )
& ( ! [X5] :
( ? [X6] :
( element(X6,the_carrier(X1))
& related(X1,X5,X6)
& in(apply_netmap(X0,X1,X6),X2) )
| ~ element(X5,the_carrier(X1)) )
| ~ is_often_in(X0,X1,X2) ) )
| empty_carrier(X1)
| ~ net_str(X1,X0) )
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(rectify,[],[f105]) ).
fof(f107,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( is_often_in(X0,X1,X2)
| ( ! [X4] :
( ~ element(X4,the_carrier(X1))
| ~ related(X1,sK2(X0,X1,X2),X4)
| ~ in(apply_netmap(X0,X1,X4),X2) )
& element(sK2(X0,X1,X2),the_carrier(X1)) ) )
& ( ! [X5] :
( ( element(sK3(X0,X1,X2,X5),the_carrier(X1))
& related(X1,X5,sK3(X0,X1,X2,X5))
& in(apply_netmap(X0,X1,sK3(X0,X1,X2,X5)),X2) )
| ~ element(X5,the_carrier(X1)) )
| ~ is_often_in(X0,X1,X2) ) )
| empty_carrier(X1)
| ~ net_str(X1,X0) )
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X3,sK2(X0,X1,X2)),skolemize(X6,sK3(X0,X1,X2,X5))],[f106]) ).
fof(f112,plain,
! [X0] : element(sK8(X0),X0),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X1,sK8(X0))],[f26]) ).
fof(f124,plain,
( ( ( ~ is_eventually_in(sK19,sK20,sK22)
& is_eventually_in(sK19,sK20,sK21) )
| ( ~ is_often_in(sK19,sK20,sK22)
& is_often_in(sK19,sK20,sK21) ) )
& subset(sK21,sK22)
& ~ empty_carrier(sK20)
& net_str(sK20,sK19)
& ~ empty_carrier(sK19)
& one_sorted_str(sK19) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK19,sK20,sK21,sK22]),skolemize(X0,sK19),skolemize(X1,sK20),skolemize(X2,sK21),skolemize(X3,sK22)],[f101]) ).
fof(f128,plain,
! [X2,X0,X1,X6] :
( ~ related(X1,sK1(X0,X1,X2),X6)
| in(apply_netmap(X0,X1,X6),X2)
| ~ element(X6,the_carrier(X1))
| ~ is_eventually_in(X0,X1,X2)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f104]) ).
fof(f129,plain,
! [X2,X0,X1] :
( element(sK1(X0,X1,X2),the_carrier(X1))
| ~ is_eventually_in(X0,X1,X2)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f104]) ).
fof(f130,plain,
! [X2,X3,X0,X1] :
( element(sK0(X0,X1,X2,X3),the_carrier(X1))
| ~ element(X3,the_carrier(X1))
| is_eventually_in(X0,X1,X2)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f104]) ).
fof(f131,plain,
! [X2,X3,X0,X1] :
( related(X1,X3,sK0(X0,X1,X2,X3))
| ~ element(X3,the_carrier(X1))
| is_eventually_in(X0,X1,X2)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f104]) ).
fof(f132,plain,
! [X2,X3,X0,X1] :
( ~ in(apply_netmap(X0,X1,sK0(X0,X1,X2,X3)),X2)
| ~ element(X3,the_carrier(X1))
| is_eventually_in(X0,X1,X2)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f104]) ).
fof(f133,plain,
! [X2,X0,X1,X5] :
( in(apply_netmap(X0,X1,sK3(X0,X1,X2,X5)),X2)
| ~ element(X5,the_carrier(X1))
| ~ is_often_in(X0,X1,X2)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f134,plain,
! [X2,X0,X1,X5] :
( related(X1,X5,sK3(X0,X1,X2,X5))
| ~ element(X5,the_carrier(X1))
| ~ is_often_in(X0,X1,X2)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f135,plain,
! [X2,X0,X1,X5] :
( element(sK3(X0,X1,X2,X5),the_carrier(X1))
| ~ element(X5,the_carrier(X1))
| ~ is_often_in(X0,X1,X2)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f136,plain,
! [X2,X0,X1] :
( element(sK2(X0,X1,X2),the_carrier(X1))
| is_often_in(X0,X1,X2)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f137,plain,
! [X2,X0,X1,X4] :
( ~ related(X1,sK2(X0,X1,X2),X4)
| ~ element(X4,the_carrier(X1))
| is_often_in(X0,X1,X2)
| ~ in(apply_netmap(X0,X1,X4),X2)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f151,plain,
! [X0] : element(sK8(X0),X0),
inference(cnf_transformation,[],[f112]) ).
fof(f156,plain,
empty(empty_set),
inference(cnf_transformation,[],[f31]) ).
fof(f181,plain,
! [X0,X1] :
( ~ element(X0,X1)
| in(X0,X1)
| empty(X1) ),
inference(cnf_transformation,[],[f92]) ).
fof(f182,plain,
! [X0,X1] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f93]) ).
fof(f183,plain,
! [X2,X0,X1] :
( ~ element(X1,powerset(X2))
| ~ in(X0,X1)
| element(X0,X2) ),
inference(cnf_transformation,[],[f95]) ).
fof(f184,plain,
! [X2,X0,X1] :
( ~ element(X1,powerset(X2))
| ~ in(X0,X1)
| ~ empty(X2) ),
inference(cnf_transformation,[],[f96]) ).
fof(f185,plain,
! [X0] :
( ~ empty(X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f97]) ).
fof(f186,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ empty(X1) ),
inference(cnf_transformation,[],[f98]) ).
fof(f188,plain,
one_sorted_str(sK19),
inference(cnf_transformation,[],[f124]) ).
fof(f189,plain,
~ empty_carrier(sK19),
inference(cnf_transformation,[],[f124]) ).
fof(f190,plain,
net_str(sK20,sK19),
inference(cnf_transformation,[],[f124]) ).
fof(f191,plain,
~ empty_carrier(sK20),
inference(cnf_transformation,[],[f124]) ).
fof(f192,plain,
subset(sK21,sK22),
inference(cnf_transformation,[],[f124]) ).
fof(f193,plain,
( is_eventually_in(sK19,sK20,sK21)
| is_often_in(sK19,sK20,sK21) ),
inference(cnf_transformation,[],[f124]) ).
fof(f194,plain,
( is_eventually_in(sK19,sK20,sK21)
| ~ is_often_in(sK19,sK20,sK22) ),
inference(cnf_transformation,[],[f124]) ).
fof(f195,plain,
( ~ is_eventually_in(sK19,sK20,sK22)
| is_often_in(sK19,sK20,sK21) ),
inference(cnf_transformation,[],[f124]) ).
fof(f196,plain,
( ~ is_eventually_in(sK19,sK20,sK22)
| ~ is_often_in(sK19,sK20,sK22) ),
inference(cnf_transformation,[],[f124]) ).
fof(f198,definition,
( spl23_1
<=> is_often_in(sK19,sK20,sK21) ),
introduced(definition,[new_symbols(definition,[spl23_1])],[avatar_definition]) ).
fof(f200,plain,
( is_often_in(sK19,sK20,sK21)
| ~ spl23_1 ),
inference(avatar_component_clause,[],[f198]) ).
fof(f202,definition,
( spl23_2
<=> is_eventually_in(sK19,sK20,sK21) ),
introduced(definition,[new_symbols(definition,[spl23_2])],[avatar_definition]) ).
fof(f203,plain,
( ~ is_eventually_in(sK19,sK20,sK21)
| spl23_2 ),
inference(avatar_component_clause,[],[f202]) ).
fof(f204,plain,
( is_eventually_in(sK19,sK20,sK21)
| ~ spl23_2 ),
inference(avatar_component_clause,[],[f202]) ).
fof(f205,plain,
( spl23_1
| spl23_2 ),
inference(avatar_split_clause,[],[f193,f202,f198]) ).
fof(f207,definition,
( spl23_3
<=> is_eventually_in(sK19,sK20,sK22) ),
introduced(definition,[new_symbols(definition,[spl23_3])],[avatar_definition]) ).
fof(f208,plain,
( is_eventually_in(sK19,sK20,sK22)
| ~ spl23_3 ),
inference(avatar_component_clause,[],[f207]) ).
fof(f209,plain,
( ~ is_eventually_in(sK19,sK20,sK22)
| spl23_3 ),
inference(avatar_component_clause,[],[f207]) ).
fof(f210,plain,
( spl23_1
| ~ spl23_3 ),
inference(avatar_split_clause,[],[f195,f207,f198]) ).
fof(f541,plain,
( ~ is_often_in(sK19,sK20,sK22)
| spl23_2 ),
inference(forward_subsumption_resolution,[],[f194,f203]) ).
fof(f656,plain,
! [X0] :
( in(sK8(X0),X0)
| empty(X0) ),
inference(resolution,[],[f181,f151]) ).
fof(f720,plain,
! [X2,X0,X1] :
( ~ subset(X1,X2)
| ~ empty(X2)
| ~ in(X0,X1) ),
inference(resolution,[],[f184,f182]) ).
fof(f1124,plain,
! [X2,X0,X1] :
( ~ subset(X1,X2)
| element(X0,X2)
| ~ in(X0,X1) ),
inference(resolution,[],[f183,f182]) ).
fof(f1164,plain,
! [X0] :
( ~ empty(sK22)
| ~ in(X0,sK21) ),
inference(resolution,[],[f720,f192]) ).
fof(f1167,definition,
( spl23_54
<=> ! [X0] : ~ in(X0,sK21) ),
introduced(definition,[new_symbols(definition,[spl23_54])],[avatar_definition]) ).
fof(f1168,plain,
( ! [X0] : ~ in(X0,sK21)
| ~ spl23_54 ),
inference(avatar_component_clause,[],[f1167]) ).
fof(f1170,definition,
( spl23_55
<=> empty(sK22) ),
introduced(definition,[new_symbols(definition,[spl23_55])],[avatar_definition]) ).
fof(f1171,plain,
( empty(sK22)
| ~ spl23_55 ),
inference(avatar_component_clause,[],[f1170]) ).
fof(f1172,plain,
( ~ empty(sK22)
| spl23_55 ),
inference(avatar_component_clause,[],[f1170]) ).
fof(f1173,plain,
( spl23_54
| ~ spl23_55 ),
inference(avatar_split_clause,[],[f1164,f1170,f1167]) ).
fof(f1867,plain,
! [X0] :
( ~ in(X0,sK21)
| element(X0,sK22) ),
inference(resolution,[],[f1124,f192]) ).
fof(f1876,plain,
( empty(sK21)
| ~ spl23_54 ),
inference(resolution,[],[f1168,f656]) ).
fof(f1884,plain,
( empty_set = sK21
| ~ spl23_54 ),
inference(resolution,[],[f1876,f185]) ).
fof(f1905,plain,
( is_often_in(sK19,sK20,empty_set)
| ~ spl23_1
| ~ spl23_54 ),
inference(backward_demodulation,[],[f200,f1884]) ).
fof(f1943,plain,
! [X2,X3,X0,X1] :
( ~ is_often_in(X2,X1,X3)
| ~ element(X0,the_carrier(X1))
| empty_carrier(X1)
| ~ net_str(X1,X2)
| empty_carrier(X2)
| ~ one_sorted_str(X2)
| ~ empty(X3) ),
inference(resolution,[],[f133,f186]) ).
fof(f2023,plain,
! [X2,X3,X0,X1,X4] :
( ~ element(sK3(X0,X1,X2,sK2(X3,X1,X4)),the_carrier(X1))
| is_often_in(X3,X1,X4)
| ~ in(apply_netmap(X3,X1,sK3(X0,X1,X2,sK2(X3,X1,X4))),X4)
| empty_carrier(X1)
| ~ net_str(X1,X3)
| empty_carrier(X3)
| ~ one_sorted_str(X3)
| ~ element(sK2(X3,X1,X4),the_carrier(X1))
| ~ is_often_in(X0,X1,X2)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(resolution,[],[f137,f134]) ).
fof(f2024,plain,
! [X2,X3,X0,X1,X4] :
( ~ element(sK3(X0,X1,X2,sK2(X3,X1,X4)),the_carrier(X1))
| is_often_in(X3,X1,X4)
| ~ in(apply_netmap(X3,X1,sK3(X0,X1,X2,sK2(X3,X1,X4))),X4)
| empty_carrier(X1)
| ~ net_str(X1,X3)
| empty_carrier(X3)
| ~ one_sorted_str(X3)
| ~ element(sK2(X3,X1,X4),the_carrier(X1))
| ~ is_often_in(X0,X1,X2)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(duplicate_literal_removal,[],[f2023]) ).
fof(f2887,plain,
( ! [X0] :
( ~ element(X0,the_carrier(sK20))
| empty_carrier(sK20)
| ~ net_str(sK20,sK19)
| empty_carrier(sK19)
| ~ one_sorted_str(sK19)
| ~ empty(empty_set) )
| ~ spl23_1
| ~ spl23_54 ),
inference(resolution,[],[f1943,f1905]) ).
fof(f2888,plain,
( ! [X0] :
( ~ element(X0,the_carrier(sK20))
| ~ net_str(sK20,sK19)
| empty_carrier(sK19)
| ~ one_sorted_str(sK19)
| ~ empty(empty_set) )
| ~ spl23_1
| ~ spl23_54 ),
inference(forward_subsumption_resolution,[],[f2887,f191]) ).
fof(f2889,plain,
( ! [X0] :
( ~ element(X0,the_carrier(sK20))
| empty_carrier(sK19)
| ~ one_sorted_str(sK19)
| ~ empty(empty_set) )
| ~ spl23_1
| ~ spl23_54 ),
inference(forward_subsumption_resolution,[],[f2888,f190]) ).
fof(f2890,plain,
( ! [X0] :
( ~ element(X0,the_carrier(sK20))
| ~ one_sorted_str(sK19)
| ~ empty(empty_set) )
| ~ spl23_1
| ~ spl23_54 ),
inference(forward_subsumption_resolution,[],[f2889,f189]) ).
fof(f2891,plain,
( ! [X0] :
( ~ element(X0,the_carrier(sK20))
| ~ empty(empty_set) )
| ~ spl23_1
| ~ spl23_54 ),
inference(forward_subsumption_resolution,[],[f2890,f188]) ).
fof(f2892,plain,
( ! [X0] : ~ element(X0,the_carrier(sK20))
| ~ spl23_1
| ~ spl23_54 ),
inference(forward_subsumption_resolution,[],[f2891,f156]) ).
fof(f2904,plain,
( $false
| ~ spl23_1
| ~ spl23_54 ),
inference(resolution,[],[f2892,f151]) ).
fof(f2935,plain,
( ~ spl23_1
| ~ spl23_54 ),
inference(avatar_contradiction_clause,[],[f2904]) ).
fof(f2980,plain,
! [X2,X0,X1] :
( element(apply_netmap(X0,X1,sK3(X0,X1,sK21,X2)),sK22)
| ~ element(X2,the_carrier(X1))
| ~ is_often_in(X0,X1,sK21)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(resolution,[],[f1867,f133]) ).
fof(f2982,definition,
( spl23_137
<=> empty(sK21) ),
introduced(definition,[new_symbols(definition,[spl23_137])],[avatar_definition]) ).
fof(f2983,plain,
( empty(sK21)
| ~ spl23_137 ),
inference(avatar_component_clause,[],[f2982]) ).
fof(f2984,plain,
( ~ empty(sK21)
| spl23_137 ),
inference(avatar_component_clause,[],[f2982]) ).
fof(f3138,plain,
! [X2,X0,X1] :
( ~ element(X0,the_carrier(X1))
| ~ is_often_in(X2,X1,sK21)
| empty_carrier(X1)
| ~ net_str(X1,X2)
| empty_carrier(X2)
| ~ one_sorted_str(X2)
| in(apply_netmap(X2,X1,sK3(X2,X1,sK21,X0)),sK22)
| empty(sK22) ),
inference(resolution,[],[f2980,f181]) ).
fof(f3139,plain,
( ! [X2,X0,X1] :
( in(apply_netmap(X2,X1,sK3(X2,X1,sK21,X0)),sK22)
| ~ is_often_in(X2,X1,sK21)
| empty_carrier(X1)
| ~ net_str(X1,X2)
| empty_carrier(X2)
| ~ one_sorted_str(X2)
| ~ element(X0,the_carrier(X1)) )
| spl23_55 ),
inference(forward_subsumption_resolution,[],[f3138,f1172]) ).
fof(f3165,plain,
! [X2,X3,X0,X1,X4] :
( is_often_in(X3,X1,X4)
| ~ in(apply_netmap(X3,X1,sK3(X0,X1,X2,sK2(X3,X1,X4))),X4)
| empty_carrier(X1)
| ~ net_str(X1,X3)
| empty_carrier(X3)
| ~ one_sorted_str(X3)
| ~ element(sK2(X3,X1,X4),the_carrier(X1))
| ~ is_often_in(X0,X1,X2)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(forward_subsumption_resolution,[],[f2024,f135]) ).
fof(f3166,plain,
! [X2,X3,X0,X1,X4] :
( ~ in(apply_netmap(X3,X1,sK3(X0,X1,X2,sK2(X3,X1,X4))),X4)
| is_often_in(X3,X1,X4)
| empty_carrier(X1)
| ~ net_str(X1,X3)
| empty_carrier(X3)
| ~ one_sorted_str(X3)
| ~ is_often_in(X0,X1,X2)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(forward_subsumption_resolution,[],[f3165,f136]) ).
fof(f4350,plain,
( ! [X0,X1] :
( ~ is_often_in(X0,X1,sK21)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| ~ element(sK2(X0,X1,sK22),the_carrier(X1))
| is_often_in(X0,X1,sK22)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| ~ is_often_in(X0,X1,sK21)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0) )
| spl23_55 ),
inference(resolution,[],[f3139,f3166]) ).
fof(f4354,plain,
( ! [X0,X1] :
( ~ is_often_in(X0,X1,sK21)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| ~ element(sK2(X0,X1,sK22),the_carrier(X1))
| is_often_in(X0,X1,sK22) )
| spl23_55 ),
inference(duplicate_literal_removal,[],[f4350]) ).
fof(f4355,plain,
( ! [X0,X1] :
( ~ is_often_in(X0,X1,sK21)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| is_often_in(X0,X1,sK22) )
| spl23_55 ),
inference(forward_subsumption_resolution,[],[f4354,f136]) ).
fof(f4367,plain,
( empty_carrier(sK20)
| ~ net_str(sK20,sK19)
| empty_carrier(sK19)
| ~ one_sorted_str(sK19)
| is_often_in(sK19,sK20,sK22)
| ~ spl23_1
| spl23_55 ),
inference(resolution,[],[f4355,f200]) ).
fof(f4368,plain,
( ~ net_str(sK20,sK19)
| empty_carrier(sK19)
| ~ one_sorted_str(sK19)
| is_often_in(sK19,sK20,sK22)
| ~ spl23_1
| spl23_55 ),
inference(forward_subsumption_resolution,[],[f4367,f191]) ).
fof(f4369,plain,
( empty_carrier(sK19)
| ~ one_sorted_str(sK19)
| is_often_in(sK19,sK20,sK22)
| ~ spl23_1
| spl23_55 ),
inference(forward_subsumption_resolution,[],[f4368,f190]) ).
fof(f4370,plain,
( ~ one_sorted_str(sK19)
| is_often_in(sK19,sK20,sK22)
| ~ spl23_1
| spl23_55 ),
inference(forward_subsumption_resolution,[],[f4369,f189]) ).
fof(f4371,plain,
( is_often_in(sK19,sK20,sK22)
| ~ spl23_1
| spl23_55 ),
inference(forward_subsumption_resolution,[],[f4370,f188]) ).
fof(f4372,plain,
( $false
| ~ spl23_1
| spl23_2
| spl23_55 ),
inference(forward_subsumption_resolution,[],[f4371,f541]) ).
fof(f4373,plain,
( ~ spl23_1
| spl23_2
| spl23_55 ),
inference(avatar_contradiction_clause,[],[f4372]) ).
fof(f5725,plain,
! [X2,X3,X0,X1,X4] :
( ~ element(sK1(X0,X1,X2),the_carrier(X1))
| is_eventually_in(X3,X1,X4)
| empty_carrier(X1)
| ~ net_str(X1,X3)
| empty_carrier(X3)
| ~ one_sorted_str(X3)
| in(apply_netmap(X0,X1,sK0(X3,X1,X4,sK1(X0,X1,X2))),X2)
| ~ element(sK0(X3,X1,X4,sK1(X0,X1,X2)),the_carrier(X1))
| ~ is_eventually_in(X0,X1,X2)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(resolution,[],[f131,f128]) ).
fof(f5726,plain,
! [X2,X3,X0,X1,X4] :
( ~ element(sK1(X0,X1,X2),the_carrier(X1))
| is_eventually_in(X3,X1,X4)
| empty_carrier(X1)
| ~ net_str(X1,X3)
| empty_carrier(X3)
| ~ one_sorted_str(X3)
| in(apply_netmap(X0,X1,sK0(X3,X1,X4,sK1(X0,X1,X2))),X2)
| ~ element(sK0(X3,X1,X4,sK1(X0,X1,X2)),the_carrier(X1))
| ~ is_eventually_in(X0,X1,X2)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(duplicate_literal_removal,[],[f5725]) ).
fof(f5727,plain,
! [X2,X3,X0,X1,X4] :
( ~ element(sK1(X0,X1,X2),the_carrier(X1))
| is_eventually_in(X3,X1,X4)
| empty_carrier(X1)
| ~ net_str(X1,X3)
| empty_carrier(X3)
| ~ one_sorted_str(X3)
| in(apply_netmap(X0,X1,sK0(X3,X1,X4,sK1(X0,X1,X2))),X2)
| ~ is_eventually_in(X0,X1,X2)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(forward_subsumption_resolution,[],[f5726,f130]) ).
fof(f5728,plain,
! [X2,X3,X0,X1,X4] :
( in(apply_netmap(X0,X1,sK0(X3,X1,X4,sK1(X0,X1,X2))),X2)
| empty_carrier(X1)
| ~ net_str(X1,X3)
| empty_carrier(X3)
| ~ one_sorted_str(X3)
| is_eventually_in(X3,X1,X4)
| ~ is_eventually_in(X0,X1,X2)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(forward_subsumption_resolution,[],[f5727,f129]) ).
fof(f6532,plain,
! [X2,X3,X0,X1] :
( element(apply_netmap(X3,X0,sK0(X1,X0,X2,sK1(X3,X0,sK21))),sK22)
| ~ net_str(X0,X1)
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| is_eventually_in(X1,X0,X2)
| ~ is_eventually_in(X3,X0,sK21)
| ~ net_str(X0,X3)
| empty_carrier(X3)
| ~ one_sorted_str(X3)
| empty_carrier(X0) ),
inference(resolution,[],[f5728,f1867]) ).
fof(f6534,plain,
! [X2,X3,X0,X1] :
( ~ net_str(X0,X1)
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| is_eventually_in(X1,X0,X2)
| ~ is_eventually_in(X3,X0,sK21)
| ~ net_str(X0,X3)
| empty_carrier(X3)
| ~ one_sorted_str(X3)
| empty_carrier(X0)
| in(apply_netmap(X3,X0,sK0(X1,X0,X2,sK1(X3,X0,sK21))),sK22)
| empty(sK22) ),
inference(resolution,[],[f6532,f181]) ).
fof(f6535,plain,
( ! [X2,X3,X0,X1] :
( in(apply_netmap(X3,X0,sK0(X1,X0,X2,sK1(X3,X0,sK21))),sK22)
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| is_eventually_in(X1,X0,X2)
| ~ is_eventually_in(X3,X0,sK21)
| ~ net_str(X0,X3)
| empty_carrier(X3)
| ~ one_sorted_str(X3)
| empty_carrier(X0)
| ~ net_str(X0,X1) )
| spl23_55 ),
inference(forward_subsumption_resolution,[],[f6534,f1172]) ).
fof(f7163,plain,
( ~ is_eventually_in(sK19,sK20,sK22)
| ~ spl23_1
| spl23_55 ),
inference(forward_subsumption_resolution,[],[f196,f4371]) ).
fof(f7237,plain,
( $false
| ~ spl23_1
| ~ spl23_3
| spl23_55 ),
inference(forward_subsumption_resolution,[],[f7163,f208]) ).
fof(f7238,plain,
( ~ spl23_1
| ~ spl23_3
| spl23_55 ),
inference(avatar_contradiction_clause,[],[f7237]) ).
fof(f7720,plain,
( ! [X0,X1] :
( empty_carrier(X0)
| ~ one_sorted_str(X0)
| is_eventually_in(X0,X1,sK22)
| ~ is_eventually_in(X0,X1,sK21)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| ~ element(sK1(X0,X1,sK21),the_carrier(X1))
| is_eventually_in(X0,X1,sK22)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0) )
| spl23_55 ),
inference(resolution,[],[f6535,f132]) ).
fof(f7724,plain,
( ! [X0,X1] :
( empty_carrier(X0)
| ~ one_sorted_str(X0)
| is_eventually_in(X0,X1,sK22)
| ~ is_eventually_in(X0,X1,sK21)
| ~ net_str(X1,X0)
| empty_carrier(X1)
| ~ element(sK1(X0,X1,sK21),the_carrier(X1)) )
| spl23_55 ),
inference(duplicate_literal_removal,[],[f7720]) ).
fof(f7725,plain,
( ! [X0,X1] :
( ~ is_eventually_in(X0,X1,sK21)
| ~ one_sorted_str(X0)
| is_eventually_in(X0,X1,sK22)
| empty_carrier(X0)
| ~ net_str(X1,X0)
| empty_carrier(X1) )
| spl23_55 ),
inference(forward_subsumption_resolution,[],[f7724,f129]) ).
fof(f7726,plain,
( ~ one_sorted_str(sK19)
| is_eventually_in(sK19,sK20,sK22)
| empty_carrier(sK19)
| ~ net_str(sK20,sK19)
| empty_carrier(sK20)
| ~ spl23_2
| spl23_55 ),
inference(resolution,[],[f7725,f204]) ).
fof(f7727,plain,
( is_eventually_in(sK19,sK20,sK22)
| empty_carrier(sK19)
| ~ net_str(sK20,sK19)
| empty_carrier(sK20)
| ~ spl23_2
| spl23_55 ),
inference(forward_subsumption_resolution,[],[f7726,f188]) ).
fof(f7728,plain,
( empty_carrier(sK19)
| ~ net_str(sK20,sK19)
| empty_carrier(sK20)
| ~ spl23_2
| spl23_3
| spl23_55 ),
inference(forward_subsumption_resolution,[],[f7727,f209]) ).
fof(f7729,plain,
( ~ net_str(sK20,sK19)
| empty_carrier(sK20)
| ~ spl23_2
| spl23_3
| spl23_55 ),
inference(forward_subsumption_resolution,[],[f7728,f189]) ).
fof(f7730,plain,
( empty_carrier(sK20)
| ~ spl23_2
| spl23_3
| spl23_55 ),
inference(forward_subsumption_resolution,[],[f7729,f190]) ).
fof(f7731,plain,
( $false
| ~ spl23_2
| spl23_3
| spl23_55 ),
inference(forward_subsumption_resolution,[],[f7730,f191]) ).
fof(f7732,plain,
( ~ spl23_2
| spl23_3
| spl23_55 ),
inference(avatar_contradiction_clause,[],[f7731]) ).
fof(f7733,plain,
( empty_set = sK22
| ~ spl23_55 ),
inference(resolution,[],[f1171,f185]) ).
fof(f7746,plain,
( empty(sK21)
| ~ spl23_54 ),
inference(resolution,[],[f1168,f656]) ).
fof(f7816,plain,
( $false
| ~ spl23_54
| spl23_137 ),
inference(forward_subsumption_resolution,[],[f7746,f2984]) ).
fof(f7817,plain,
( ~ spl23_54
| spl23_137 ),
inference(avatar_contradiction_clause,[],[f7816]) ).
fof(f7818,plain,
( empty_set = sK21
| ~ spl23_137 ),
inference(resolution,[],[f2983,f185]) ).
fof(f7840,plain,
( ~ is_eventually_in(sK19,sK20,empty_set)
| spl23_3
| ~ spl23_55 ),
inference(backward_demodulation,[],[f209,f7733]) ).
fof(f7855,plain,
( is_eventually_in(sK19,sK20,empty_set)
| ~ spl23_2
| ~ spl23_137 ),
inference(backward_demodulation,[],[f204,f7818]) ).
fof(f7863,plain,
( $false
| ~ spl23_2
| spl23_3
| ~ spl23_55
| ~ spl23_137 ),
inference(forward_subsumption_resolution,[],[f7855,f7840]) ).
fof(f7864,plain,
( ~ spl23_2
| spl23_3
| ~ spl23_55
| ~ spl23_137 ),
inference(avatar_contradiction_clause,[],[f7863]) ).
cnf(s1,plain,
( spl23_1
| spl23_2 ),
inference(sat_conversion,[],[f205]) ).
cnf(s2,plain,
( spl23_1
| ~ spl23_3 ),
inference(sat_conversion,[],[f210]) ).
cnf(s125,plain,
( spl23_54
| ~ spl23_55 ),
inference(sat_conversion,[],[f1173]) ).
cnf(s220,plain,
( ~ spl23_1
| ~ spl23_54 ),
inference(sat_conversion,[],[f2935]) ).
cnf(s270,plain,
( ~ spl23_1
| spl23_2
| spl23_55 ),
inference(sat_conversion,[],[f4373]) ).
cnf(s341,plain,
( ~ spl23_1
| ~ spl23_3
| spl23_55 ),
inference(sat_conversion,[],[f7238]) ).
cnf(s352,plain,
( ~ spl23_2
| spl23_3
| spl23_55 ),
inference(sat_conversion,[],[f7732]) ).
cnf(s376,plain,
( ~ spl23_54
| spl23_137 ),
inference(sat_conversion,[],[f7817]) ).
cnf(s377,plain,
( ~ spl23_2
| spl23_3
| ~ spl23_55
| ~ spl23_137 ),
inference(sat_conversion,[],[f7864]) ).
cnf(s415,plain,
( ~ spl23_2
| spl23_3 ),
inference(rat,[],[s376,s377,s125,s352]) ).
cnf(s416,plain,
spl23_1,
inference(rat,[],[s415,s1,s2]) ).
cnf(s418,plain,
~ spl23_54,
inference(rat,[],[s220,s416]) ).
cnf(s420,plain,
~ spl23_55,
inference(rat,[],[s125,s418]) ).
cnf(s422,plain,
~ spl23_3,
inference(rat,[],[s341,s416,s420]) ).
cnf(s423,plain,
spl23_2,
inference(rat,[],[s270,s416,s420]) ).
cnf(s426,plain,
$false,
inference(rat,[],[s415,s422,s423]) ).
fof(f7865,plain,
$false,
inference(avatar_sat_refutation,[],[s426]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU367+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n002.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 04:57:52 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/0.40 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.28/0.85 % (4156607)Will run a generic schedule for satisfiability detection.
% 2.28/0.85 % (4156617)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1633641854:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.28/0.85 % (4156613)% WARNING: option uhcvi not known.
% 2.28/0.85 % (4156612)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3647571497_2999 on theBenchmark for (2999ds/0Mi)
% 2.28/0.85 % (4156614)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3826707967:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.28/0.85 % (4156616)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2984095399:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.28/0.85 % (4156615)dis+10_1_sil=32000:sp=arity:random_seed=3584786683:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.28/0.85 % (4156618)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1328803589:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.28/0.85 % (4156613)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1836378065:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.28/0.85 % TRYING [1]
% 2.28/0.85 % TRYING [2]
% 2.28/0.85 % TRYING [3]
% 2.28/0.85 % TRYING [4]
% 2.28/0.85 % (4156617)Instruction limit reached!
% 2.28/0.85 % (4156617)------------------------------
% 2.28/0.85 % (4156617)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.28/0.85 % (4156617)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.28/0.85 % (4156617)CaDiCaL version: 2.1.3
% 2.28/0.85 % (4156617)Termination reason: Instruction limit
% 2.28/0.85 % (4156617)Termination phase: Saturation
% 2.28/0.85 % (4156617)Time elapsed: 0.045 s
% 2.28/0.85 % (4156617)Peak memory usage: 13 MB
% 2.28/0.85 % (4156617)Instructions burned: 131 (million)
% 2.28/0.85 % (4156626)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=12792138:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.28/0.85 % TRYING [1]
% 2.28/0.85 % TRYING [2]
% 2.28/0.85 % TRYING [3]
% 2.28/0.85 % TRYING [4]
% 2.28/0.85 % TRYING [5]
% 2.28/0.85 % (4156615)Instruction limit reached!
% 2.28/0.85 % (4156615)------------------------------
% 2.28/0.85 % (4156615)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.28/0.85 % (4156615)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.28/0.85 % (4156615)CaDiCaL version: 2.1.3
% 2.28/0.85 % (4156615)Termination reason: Instruction limit
% 2.28/0.85 % (4156615)Termination phase: Saturation
% 2.28/0.85 % (4156615)Time elapsed: 0.067 s
% 2.28/0.85 % (4156615)Peak memory usage: 13 MB
% 2.28/0.85 % (4156615)Instructions burned: 104 (million)
% 2.28/0.85 % (4156616)Instruction limit reached!
% 2.28/0.85 % (4156616)------------------------------
% 2.28/0.85 % (4156616)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.28/0.85 % (4156616)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.28/0.85 % (4156616)CaDiCaL version: 2.1.3
% 2.28/0.85 % (4156616)Termination reason: Instruction limit
% 2.28/0.85 % (4156616)Termination phase: Saturation
% 2.28/0.85 % (4156616)Time elapsed: 0.071 s
% 2.28/0.85 % (4156616)Peak memory usage: 13 MB
% 2.28/0.85 % (4156616)Instructions burned: 118 (million)
% 2.28/0.85 % (4156628)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2618648933:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.28/0.85 % TRYING [5]
% 2.28/0.85 % (4156629)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=879156516:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.28/0.85 % (4156618)Instruction limit reached!
% 2.28/0.85 % (4156618)------------------------------
% 2.28/0.85 % (4156618)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.28/0.85 % (4156618)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.28/0.85 % (4156618)CaDiCaL version: 2.1.3
% 2.28/0.85 % (4156618)Termination reason: Instruction limit
% 2.28/0.85 % (4156618)Termination phase: Saturation
% 2.28/0.85 % (4156618)Time elapsed: 0.099 s
% 2.28/0.85 % (4156618)Peak memory usage: 14 MB
% 2.28/0.85 % (4156618)Instructions burned: 160 (million)
% 2.28/0.85 % (4156632)ott-21_1_sil=16000:fs=off:random_seed=3746609525:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.28/0.85 % TRYING [6]
% 2.28/0.85 % (4156628)Instruction limit reached!
% 2.28/0.85 % (4156628)------------------------------
% 2.28/0.85 % (4156628)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.28/0.85 % (4156628)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.28/0.85 % (4156628)CaDiCaL version: 2.1.3
% 2.28/0.85 % (4156628)Termination reason: Instruction limit
% 2.28/0.85 % (4156628)Termination phase: Saturation
% 2.28/0.85 % (4156628)Time elapsed: 0.086 s
% 2.28/0.85 % (4156628)Peak memory usage: 14 MB
% 2.28/0.85 % (4156628)Instructions burned: 131 (million)
% 2.28/0.85 % (4156626)Instruction limit reached!
% 2.28/0.85 % (4156626)------------------------------
% 2.28/0.85 % (4156626)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.28/0.85 % (4156626)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.28/0.85 % (4156626)CaDiCaL version: 2.1.3
% 2.28/0.85 % (4156626)Termination reason: Instruction limit
% 2.28/0.85 % (4156626)Termination phase: Finite model building constraint generation
% 2.28/0.85 % (4156626)Time elapsed: 0.141 s
% 2.28/0.85 % (4156626)Peak memory usage: 32 MB
% 2.28/0.85 % (4156626)Instructions burned: 721 (million)
% 2.28/0.85 % (4156634)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2162818659:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.28/0.85 % TRYING [6]
% 2.28/0.85 % (4156635)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1178140037:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.28/0.85 % TRYING [1]
% 2.28/0.85 % TRYING [2]
% 2.28/0.85 % TRYING [3]
% 2.28/0.85 % (4156632)Instruction limit reached!
% 2.28/0.85 % (4156632)------------------------------
% 2.28/0.85 % (4156632)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.28/0.85 % (4156632)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.28/0.85 % (4156632)CaDiCaL version: 2.1.3
% 2.28/0.85 % (4156632)Termination reason: Instruction limit
% 2.28/0.85 % (4156632)Termination phase: Saturation
% 2.28/0.85 % (4156632)Time elapsed: 0.099 s
% 2.28/0.85 % (4156632)Peak memory usage: 13 MB
% 2.28/0.85 % (4156632)Instructions burned: 182 (million)
% 2.28/0.85 % TRYING [4]
% 2.28/0.85 % (4156638)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1275504392:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 2.28/0.85 % TRYING [5]
% 2.28/0.85 % (4156635)Instruction limit reached!
% 2.28/0.85 % (4156635)------------------------------
% 2.28/0.85 % (4156635)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.28/0.85 % (4156635)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.28/0.85 % (4156635)CaDiCaL version: 2.1.3
% 2.28/0.85 % (4156635)Termination reason: Instruction limit
% 2.28/0.85 % (4156635)Termination phase: Finite model building SAT solving
% 2.28/0.85 % (4156635)Time elapsed: 0.173 s
% 2.28/0.85 % (4156635)Peak memory usage: 27 MB
% 2.28/0.85 % (4156635)Instructions burned: 869 (million)
% 2.28/0.85 % (4156640)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3931258059:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 2.28/0.85 % (4156634) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4156607-4156634"...
% 2.28/0.85 % (4156634)...printing done.
% 2.28/0.85 % (4156634)Refutation found. Thanks to Tanya!
% 2.28/0.85 % SZS status Theorem for theBenchmark
% 2.28/0.85 % SZS output start Proof for theBenchmark
% See solution above
% 2.28/0.86 % (4156634)------------------------------
% 2.28/0.86 % (4156634)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.28/0.86 % (4156634)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.28/0.86 % (4156634)CaDiCaL version: 2.1.3
% 2.28/0.86 % (4156634)Termination reason: Refutation
% 2.28/0.86 % (4156634)Time elapsed: 0.208 s
% 2.28/0.86 % (4156634)Peak memory usage: 15 MB
% 2.28/0.86 % (4156634)Instructions burned: 304 (million)
% 2.28/0.86 % (4156607)Success in time 0.449 s
% 2.28/0.86 % Vampire exiting
%------------------------------------------------------------------------------