%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU367+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:48:33 PM UTC 2026
% Result : Theorem 9.17s 2.29s
% Output : Refutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 16
% Syntax : Number of formulae : 163 ( 13 unt; 9 def)
% Number of atoms : 830 ( 0 equ)
% Maximal formula atoms : 16 ( 5 avg)
% Number of connectives : 1088 ( 421 ~; 564 |; 67 &)
% ( 16 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 20 ( 19 usr; 10 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-4 aty)
% Number of variables : 273 ( 0 sgn 251 !; 22 ?)
% 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/sandbox/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/sandbox/benchmark/theBenchmark.p',d12_waybel_0) ).
fof(f46,axiom,
! [X0,X1] :
( element(X0,X1)
=> ( empty(X1)
| in(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).
fof(f47,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).
fof(f48,axiom,
! [X0,X1,X2] :
( ( in(X0,X1)
& element(X1,powerset(X2)) )
=> element(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_subset) ).
fof(f49,axiom,
! [X0,X1,X2] :
~ ( in(X0,X1)
& element(X1,powerset(X2))
& empty(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_subset) ).
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/sandbox/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(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(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(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(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(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_often_in(sK19,sK20,sK22) ),
introduced(definition,[new_symbols(definition,[spl23_3])],[avatar_definition]) ).
fof(f209,plain,
( ~ is_often_in(sK19,sK20,sK22)
| spl23_3 ),
inference(avatar_component_clause,[],[f207]) ).
fof(f210,plain,
( ~ spl23_3
| spl23_2 ),
inference(avatar_split_clause,[],[f194,f202,f207]) ).
fof(f212,definition,
( spl23_4
<=> is_eventually_in(sK19,sK20,sK22) ),
introduced(definition,[new_symbols(definition,[spl23_4])],[avatar_definition]) ).
fof(f214,plain,
( ~ is_eventually_in(sK19,sK20,sK22)
| spl23_4 ),
inference(avatar_component_clause,[],[f212]) ).
fof(f215,plain,
( spl23_1
| ~ spl23_4 ),
inference(avatar_split_clause,[],[f195,f212,f198]) ).
fof(f216,plain,
( ~ spl23_3
| ~ spl23_4 ),
inference(avatar_split_clause,[],[f196,f212,f207]) ).
fof(f217,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(f220,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,[],[f217]) ).
fof(f222,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,[],[f220,f135]) ).
fof(f224,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,[],[f222,f136]) ).
fof(f228,plain,
! [X2,X3,X0,X1,X4] :
( in(apply_netmap(X0,X1,sK0(X2,X1,X3,sK1(X0,X1,X4))),X4)
| ~ element(sK0(X2,X1,X3,sK1(X0,X1,X4)),the_carrier(X1))
| ~ is_eventually_in(X0,X1,X4)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| ~ element(sK1(X0,X1,X4),the_carrier(X1))
| is_eventually_in(X2,X1,X3)
| empty_carrier(X1)
| ~ net_str(X1,X2)
| empty_carrier(X2)
| ~ one_sorted_str(X2) ),
inference(resolution,[],[f128,f131]) ).
fof(f229,plain,
! [X2,X3,X0,X1,X4] :
( in(apply_netmap(X0,X1,sK0(X2,X1,X3,sK1(X0,X1,X4))),X4)
| ~ element(sK0(X2,X1,X3,sK1(X0,X1,X4)),the_carrier(X1))
| ~ is_eventually_in(X0,X1,X4)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| ~ element(sK1(X0,X1,X4),the_carrier(X1))
| is_eventually_in(X2,X1,X3)
| ~ net_str(X1,X2)
| empty_carrier(X2)
| ~ one_sorted_str(X2) ),
inference(duplicate_literal_removal,[],[f228]) ).
fof(f231,plain,
! [X2,X3,X0,X1,X4] :
( in(apply_netmap(X0,X1,sK0(X2,X1,X3,sK1(X0,X1,X4))),X4)
| ~ is_eventually_in(X0,X1,X4)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| ~ element(sK1(X0,X1,X4),the_carrier(X1))
| is_eventually_in(X2,X1,X3)
| ~ net_str(X1,X2)
| empty_carrier(X2)
| ~ one_sorted_str(X2) ),
inference(forward_subsumption_resolution,[],[f229,f130]) ).
fof(f233,plain,
! [X2,X3,X0,X1,X4] :
( in(apply_netmap(X0,X1,sK0(X2,X1,X3,sK1(X0,X1,X4))),X4)
| ~ is_eventually_in(X0,X1,X4)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| is_eventually_in(X2,X1,X3)
| ~ net_str(X1,X2)
| empty_carrier(X2)
| ~ one_sorted_str(X2) ),
inference(forward_subsumption_resolution,[],[f231,f129]) ).
fof(f257,plain,
! [X2,X0,X1] :
( ~ subset(X1,X2)
| element(X0,X2)
| ~ in(X0,X1) ),
inference(resolution,[],[f183,f182]) ).
fof(f277,plain,
! [X2,X0,X1] :
( ~ subset(X1,X2)
| ~ empty(X2)
| ~ in(X0,X1) ),
inference(resolution,[],[f184,f182]) ).
fof(f284,plain,
! [X0] :
( ~ in(X0,sK21)
| element(X0,sK22) ),
inference(resolution,[],[f257,f192]) ).
fof(f285,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,[],[f284,f133]) ).
fof(f287,plain,
! [X2,X3,X0,X1] :
( element(apply_netmap(X0,X1,sK0(X2,X1,X3,sK1(X0,X1,sK21))),sK22)
| ~ is_eventually_in(X0,X1,sK21)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| is_eventually_in(X2,X1,X3)
| ~ net_str(X1,X2)
| empty_carrier(X2)
| ~ one_sorted_str(X2) ),
inference(resolution,[],[f284,f233]) ).
fof(f298,definition,
( spl23_5
<=> ! [X0,X1] :
( is_eventually_in(X0,sK20,X1)
| ~ one_sorted_str(X0)
| empty_carrier(X0)
| ~ net_str(sK20,X0) ) ),
introduced(definition,[new_symbols(definition,[spl23_5])],[avatar_definition]) ).
fof(f299,plain,
( ! [X0,X1] :
( is_eventually_in(X0,sK20,X1)
| ~ one_sorted_str(X0)
| empty_carrier(X0)
| ~ net_str(sK20,X0) )
| ~ spl23_5 ),
inference(avatar_component_clause,[],[f298]) ).
fof(f425,definition,
( spl23_16
<=> element(sK2(sK19,sK20,sK22),the_carrier(sK20)) ),
introduced(definition,[new_symbols(definition,[spl23_16])],[avatar_definition]) ).
fof(f426,plain,
( element(sK2(sK19,sK20,sK22),the_carrier(sK20))
| ~ spl23_16 ),
inference(avatar_component_clause,[],[f425]) ).
fof(f427,plain,
( ~ element(sK2(sK19,sK20,sK22),the_carrier(sK20))
| spl23_16 ),
inference(avatar_component_clause,[],[f425]) ).
fof(f433,plain,
( is_often_in(sK19,sK20,sK22)
| empty_carrier(sK20)
| ~ net_str(sK20,sK19)
| empty_carrier(sK19)
| ~ one_sorted_str(sK19)
| spl23_16 ),
inference(resolution,[],[f427,f136]) ).
fof(f434,plain,
( empty_carrier(sK20)
| ~ net_str(sK20,sK19)
| empty_carrier(sK19)
| ~ one_sorted_str(sK19)
| spl23_3
| spl23_16 ),
inference(forward_subsumption_resolution,[],[f433,f209]) ).
fof(f435,plain,
( ~ net_str(sK20,sK19)
| empty_carrier(sK19)
| ~ one_sorted_str(sK19)
| spl23_3
| spl23_16 ),
inference(forward_subsumption_resolution,[],[f434,f191]) ).
fof(f436,plain,
( empty_carrier(sK19)
| ~ one_sorted_str(sK19)
| spl23_3
| spl23_16 ),
inference(forward_subsumption_resolution,[],[f435,f190]) ).
fof(f437,plain,
( ~ one_sorted_str(sK19)
| spl23_3
| spl23_16 ),
inference(forward_subsumption_resolution,[],[f436,f189]) ).
fof(f438,plain,
( $false
| spl23_3
| spl23_16 ),
inference(forward_subsumption_resolution,[],[f437,f188]) ).
fof(f439,plain,
( spl23_3
| spl23_16 ),
inference(avatar_contradiction_clause,[],[f438]) ).
fof(f497,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,[],[f285,f181]) ).
fof(f499,definition,
( spl23_19
<=> empty(sK22) ),
introduced(definition,[new_symbols(definition,[spl23_19])],[avatar_definition]) ).
fof(f500,plain,
( ~ empty(sK22)
| spl23_19 ),
inference(avatar_component_clause,[],[f499]) ).
fof(f501,plain,
( empty(sK22)
| ~ spl23_19 ),
inference(avatar_component_clause,[],[f499]) ).
fof(f503,definition,
( spl23_20
<=> ! [X2,X0,X1] :
( ~ element(X0,the_carrier(X1))
| in(apply_netmap(X2,X1,sK3(X2,X1,sK21,X0)),sK22)
| ~ one_sorted_str(X2)
| empty_carrier(X2)
| ~ net_str(X1,X2)
| empty_carrier(X1)
| ~ is_often_in(X2,X1,sK21) ) ),
introduced(definition,[new_symbols(definition,[spl23_20])],[avatar_definition]) ).
fof(f504,plain,
( ! [X2,X0,X1] :
( in(apply_netmap(X2,X1,sK3(X2,X1,sK21,X0)),sK22)
| ~ element(X0,the_carrier(X1))
| ~ one_sorted_str(X2)
| empty_carrier(X2)
| ~ net_str(X1,X2)
| empty_carrier(X1)
| ~ is_often_in(X2,X1,sK21) )
| ~ spl23_20 ),
inference(avatar_component_clause,[],[f503]) ).
fof(f505,plain,
( spl23_19
| spl23_20 ),
inference(avatar_split_clause,[],[f497,f503,f499]) ).
fof(f506,plain,
! [X0] :
( ~ empty(sK22)
| ~ in(X0,sK21) ),
inference(resolution,[],[f277,f192]) ).
fof(f508,plain,
( ! [X0] : ~ in(X0,sK21)
| ~ spl23_19 ),
inference(forward_subsumption_resolution,[],[f506,f501]) ).
fof(f509,plain,
( ! [X2,X0,X1] :
( ~ is_often_in(X2,X1,sK21)
| ~ element(X0,the_carrier(X1))
| empty_carrier(X1)
| ~ net_str(X1,X2)
| empty_carrier(X2)
| ~ one_sorted_str(X2) )
| ~ spl23_19 ),
inference(resolution,[],[f508,f133]) ).
fof(f540,definition,
( spl23_24
<=> ! [X0] : ~ element(X0,the_carrier(sK20)) ),
introduced(definition,[new_symbols(definition,[spl23_24])],[avatar_definition]) ).
fof(f541,plain,
( ! [X0] : ~ element(X0,the_carrier(sK20))
| ~ spl23_24 ),
inference(avatar_component_clause,[],[f540]) ).
fof(f543,plain,
( ! [X0] :
( ~ element(X0,the_carrier(sK20))
| empty_carrier(sK20)
| ~ net_str(sK20,sK19)
| empty_carrier(sK19)
| ~ one_sorted_str(sK19) )
| ~ spl23_1
| ~ spl23_19 ),
inference(resolution,[],[f509,f200]) ).
fof(f547,plain,
( ! [X0] :
( ~ element(X0,the_carrier(sK20))
| ~ net_str(sK20,sK19)
| empty_carrier(sK19)
| ~ one_sorted_str(sK19) )
| ~ spl23_1
| ~ spl23_19 ),
inference(forward_subsumption_resolution,[],[f543,f191]) ).
fof(f552,plain,
( ! [X0] :
( ~ element(X0,the_carrier(sK20))
| empty_carrier(sK19)
| ~ one_sorted_str(sK19) )
| ~ spl23_1
| ~ spl23_19 ),
inference(forward_subsumption_resolution,[],[f547,f190]) ).
fof(f553,plain,
( ! [X0] :
( ~ element(X0,the_carrier(sK20))
| ~ one_sorted_str(sK19) )
| ~ spl23_1
| ~ spl23_19 ),
inference(forward_subsumption_resolution,[],[f552,f189]) ).
fof(f554,plain,
( ! [X0] : ~ element(X0,the_carrier(sK20))
| ~ spl23_1
| ~ spl23_19 ),
inference(forward_subsumption_resolution,[],[f553,f188]) ).
fof(f555,plain,
( spl23_24
| ~ spl23_1
| ~ spl23_19 ),
inference(avatar_split_clause,[],[f554,f499,f198,f540]) ).
fof(f556,plain,
( $false
| ~ spl23_16
| ~ spl23_24 ),
inference(resolution,[],[f541,f426]) ).
fof(f563,plain,
( ~ spl23_16
| ~ spl23_24 ),
inference(avatar_contradiction_clause,[],[f556]) ).
fof(f570,plain,
( ! [X0,X1] :
( ~ element(sK2(X0,X1,sK22),the_carrier(X1))
| ~ one_sorted_str(X0)
| empty_carrier(X0)
| ~ net_str(X1,X0)
| empty_carrier(X1)
| ~ is_often_in(X0,X1,sK21)
| 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_20 ),
inference(resolution,[],[f504,f224]) ).
fof(f573,plain,
( ! [X0,X1] :
( ~ element(sK2(X0,X1,sK22),the_carrier(X1))
| ~ one_sorted_str(X0)
| empty_carrier(X0)
| ~ net_str(X1,X0)
| empty_carrier(X1)
| ~ is_often_in(X0,X1,sK21)
| is_often_in(X0,X1,sK22) )
| ~ spl23_20 ),
inference(duplicate_literal_removal,[],[f570]) ).
fof(f574,plain,
( ! [X0,X1] :
( ~ is_often_in(X0,X1,sK21)
| empty_carrier(X0)
| ~ net_str(X1,X0)
| empty_carrier(X1)
| ~ one_sorted_str(X0)
| is_often_in(X0,X1,sK22) )
| ~ spl23_20 ),
inference(forward_subsumption_resolution,[],[f573,f136]) ).
fof(f575,plain,
( empty_carrier(sK19)
| ~ net_str(sK20,sK19)
| empty_carrier(sK20)
| ~ one_sorted_str(sK19)
| is_often_in(sK19,sK20,sK22)
| ~ spl23_1
| ~ spl23_20 ),
inference(resolution,[],[f574,f200]) ).
fof(f579,plain,
( ~ net_str(sK20,sK19)
| empty_carrier(sK20)
| ~ one_sorted_str(sK19)
| is_often_in(sK19,sK20,sK22)
| ~ spl23_1
| ~ spl23_20 ),
inference(forward_subsumption_resolution,[],[f575,f189]) ).
fof(f580,plain,
( empty_carrier(sK20)
| ~ one_sorted_str(sK19)
| is_often_in(sK19,sK20,sK22)
| ~ spl23_1
| ~ spl23_20 ),
inference(forward_subsumption_resolution,[],[f579,f190]) ).
fof(f581,plain,
( ~ one_sorted_str(sK19)
| is_often_in(sK19,sK20,sK22)
| ~ spl23_1
| ~ spl23_20 ),
inference(forward_subsumption_resolution,[],[f580,f191]) ).
fof(f582,plain,
( is_often_in(sK19,sK20,sK22)
| ~ spl23_1
| ~ spl23_20 ),
inference(forward_subsumption_resolution,[],[f581,f188]) ).
fof(f583,plain,
( $false
| ~ spl23_1
| spl23_3
| ~ spl23_20 ),
inference(forward_subsumption_resolution,[],[f582,f209]) ).
fof(f584,plain,
( ~ spl23_1
| spl23_3
| ~ spl23_20 ),
inference(avatar_contradiction_clause,[],[f583]) ).
fof(f708,plain,
! [X2,X3,X0,X1] :
( ~ is_eventually_in(X0,X1,sK21)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| is_eventually_in(X2,X1,X3)
| ~ net_str(X1,X2)
| empty_carrier(X2)
| ~ one_sorted_str(X2)
| in(apply_netmap(X0,X1,sK0(X2,X1,X3,sK1(X0,X1,sK21))),sK22)
| empty(sK22) ),
inference(resolution,[],[f287,f181]) ).
fof(f709,plain,
( ! [X2,X3,X0,X1] :
( in(apply_netmap(X0,X1,sK0(X2,X1,X3,sK1(X0,X1,sK21))),sK22)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| is_eventually_in(X2,X1,X3)
| ~ net_str(X1,X2)
| empty_carrier(X2)
| ~ one_sorted_str(X2)
| ~ is_eventually_in(X0,X1,sK21) )
| spl23_19 ),
inference(forward_subsumption_resolution,[],[f708,f500]) ).
fof(f710,plain,
( ! [X0,X1] :
( empty_carrier(X0)
| ~ net_str(X0,X1)
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| is_eventually_in(X1,X0,sK22)
| ~ net_str(X0,X1)
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| ~ is_eventually_in(X1,X0,sK21)
| ~ element(sK1(X1,X0,sK21),the_carrier(X0))
| is_eventually_in(X1,X0,sK22)
| empty_carrier(X0)
| ~ net_str(X0,X1)
| empty_carrier(X1)
| ~ one_sorted_str(X1) )
| spl23_19 ),
inference(resolution,[],[f709,f132]) ).
fof(f713,plain,
( ! [X0,X1] :
( empty_carrier(X0)
| ~ net_str(X0,X1)
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| is_eventually_in(X1,X0,sK22)
| ~ is_eventually_in(X1,X0,sK21)
| ~ element(sK1(X1,X0,sK21),the_carrier(X0)) )
| spl23_19 ),
inference(duplicate_literal_removal,[],[f710]) ).
fof(f714,plain,
( ! [X0,X1] :
( ~ is_eventually_in(X1,X0,sK21)
| ~ net_str(X0,X1)
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| is_eventually_in(X1,X0,sK22)
| empty_carrier(X0) )
| spl23_19 ),
inference(forward_subsumption_resolution,[],[f713,f129]) ).
fof(f715,plain,
( ~ net_str(sK20,sK19)
| empty_carrier(sK19)
| ~ one_sorted_str(sK19)
| is_eventually_in(sK19,sK20,sK22)
| empty_carrier(sK20)
| ~ spl23_2
| spl23_19 ),
inference(resolution,[],[f714,f204]) ).
fof(f716,plain,
( empty_carrier(sK19)
| ~ one_sorted_str(sK19)
| is_eventually_in(sK19,sK20,sK22)
| empty_carrier(sK20)
| ~ spl23_2
| spl23_19 ),
inference(forward_subsumption_resolution,[],[f715,f190]) ).
fof(f717,plain,
( ~ one_sorted_str(sK19)
| is_eventually_in(sK19,sK20,sK22)
| empty_carrier(sK20)
| ~ spl23_2
| spl23_19 ),
inference(forward_subsumption_resolution,[],[f716,f189]) ).
fof(f718,plain,
( is_eventually_in(sK19,sK20,sK22)
| empty_carrier(sK20)
| ~ spl23_2
| spl23_19 ),
inference(forward_subsumption_resolution,[],[f717,f188]) ).
fof(f719,plain,
( empty_carrier(sK20)
| ~ spl23_2
| spl23_4
| spl23_19 ),
inference(forward_subsumption_resolution,[],[f718,f214]) ).
fof(f720,plain,
( $false
| ~ spl23_2
| spl23_4
| spl23_19 ),
inference(forward_subsumption_resolution,[],[f719,f191]) ).
fof(f721,plain,
( ~ spl23_2
| spl23_4
| spl23_19 ),
inference(avatar_contradiction_clause,[],[f720]) ).
fof(f723,plain,
( ! [X0] : ~ in(X0,sK21)
| ~ spl23_19 ),
inference(forward_subsumption_resolution,[],[f506,f501]) ).
fof(f738,plain,
( ! [X2,X3,X0,X1] :
( ~ is_eventually_in(X0,X1,sK21)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| is_eventually_in(X2,X1,X3)
| ~ net_str(X1,X2)
| empty_carrier(X2)
| ~ one_sorted_str(X2) )
| ~ spl23_19 ),
inference(resolution,[],[f723,f233]) ).
fof(f741,plain,
( ! [X0,X1] :
( empty_carrier(sK20)
| ~ net_str(sK20,sK19)
| empty_carrier(sK19)
| ~ one_sorted_str(sK19)
| is_eventually_in(X0,sK20,X1)
| ~ net_str(sK20,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0) )
| ~ spl23_2
| ~ spl23_19 ),
inference(resolution,[],[f738,f204]) ).
fof(f742,plain,
( ! [X0,X1] :
( ~ net_str(sK20,sK19)
| empty_carrier(sK19)
| ~ one_sorted_str(sK19)
| is_eventually_in(X0,sK20,X1)
| ~ net_str(sK20,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0) )
| ~ spl23_2
| ~ spl23_19 ),
inference(forward_subsumption_resolution,[],[f741,f191]) ).
fof(f743,plain,
( ! [X0,X1] :
( empty_carrier(sK19)
| ~ one_sorted_str(sK19)
| is_eventually_in(X0,sK20,X1)
| ~ net_str(sK20,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0) )
| ~ spl23_2
| ~ spl23_19 ),
inference(forward_subsumption_resolution,[],[f742,f190]) ).
fof(f744,plain,
( ! [X0,X1] :
( ~ one_sorted_str(sK19)
| is_eventually_in(X0,sK20,X1)
| ~ net_str(sK20,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0) )
| ~ spl23_2
| ~ spl23_19 ),
inference(forward_subsumption_resolution,[],[f743,f189]) ).
fof(f745,plain,
( ! [X0,X1] :
( is_eventually_in(X0,sK20,X1)
| ~ net_str(sK20,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0) )
| ~ spl23_2
| ~ spl23_19 ),
inference(forward_subsumption_resolution,[],[f744,f188]) ).
fof(f746,plain,
( spl23_5
| ~ spl23_2
| ~ spl23_19 ),
inference(avatar_split_clause,[],[f745,f499,f202,f298]) ).
fof(f747,plain,
( ~ one_sorted_str(sK19)
| empty_carrier(sK19)
| ~ net_str(sK20,sK19)
| spl23_4
| ~ spl23_5 ),
inference(resolution,[],[f299,f214]) ).
fof(f757,plain,
( empty_carrier(sK19)
| ~ net_str(sK20,sK19)
| spl23_4
| ~ spl23_5 ),
inference(forward_subsumption_resolution,[],[f747,f188]) ).
fof(f758,plain,
( ~ net_str(sK20,sK19)
| spl23_4
| ~ spl23_5 ),
inference(forward_subsumption_resolution,[],[f757,f189]) ).
fof(f759,plain,
( $false
| spl23_4
| ~ spl23_5 ),
inference(forward_subsumption_resolution,[],[f758,f190]) ).
fof(f760,plain,
( spl23_4
| ~ spl23_5 ),
inference(avatar_contradiction_clause,[],[f759]) ).
cnf(s1,plain,
( spl23_1
| spl23_2 ),
inference(sat_conversion,[],[f205]) ).
cnf(s2,plain,
( spl23_2
| ~ spl23_3 ),
inference(sat_conversion,[],[f210]) ).
cnf(s3,plain,
( spl23_1
| ~ spl23_4 ),
inference(sat_conversion,[],[f215]) ).
cnf(s4,plain,
( ~ spl23_3
| ~ spl23_4 ),
inference(sat_conversion,[],[f216]) ).
cnf(s17,plain,
( spl23_3
| spl23_16 ),
inference(sat_conversion,[],[f439]) ).
cnf(s20,plain,
( spl23_19
| spl23_20 ),
inference(sat_conversion,[],[f505]) ).
cnf(s25,plain,
( ~ spl23_1
| ~ spl23_19
| spl23_24 ),
inference(sat_conversion,[],[f555]) ).
cnf(s26,plain,
( ~ spl23_16
| ~ spl23_24 ),
inference(sat_conversion,[],[f563]) ).
cnf(s27,plain,
( ~ spl23_1
| spl23_3
| ~ spl23_20 ),
inference(sat_conversion,[],[f584]) ).
cnf(s34,plain,
( ~ spl23_2
| spl23_4
| spl23_19 ),
inference(sat_conversion,[],[f721]) ).
cnf(s35,plain,
( ~ spl23_2
| spl23_5
| ~ spl23_19 ),
inference(sat_conversion,[],[f746]) ).
cnf(s36,plain,
( spl23_4
| ~ spl23_5 ),
inference(sat_conversion,[],[f760]) ).
cnf(s41,plain,
spl23_1,
inference(rat,[],[s34,s35,s36,s1,s3]) ).
cnf(s42,plain,
spl23_3,
inference(rat,[],[s25,s26,s20,s17,s27,s41]) ).
cnf(s43,plain,
~ spl23_4,
inference(rat,[],[s4,s42]) ).
cnf(s44,plain,
spl23_2,
inference(rat,[],[s2,s42]) ).
cnf(s45,plain,
~ spl23_5,
inference(rat,[],[s36,s43]) ).
cnf(s49,plain,
~ spl23_19,
inference(rat,[],[s35,s45,s44]) ).
cnf(s51,plain,
$false,
inference(rat,[],[s34,s43,s49,s44]) ).
fof(f761,plain,
$false,
inference(avatar_sat_refutation,[],[s51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU367+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.43 % Computer : n008.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Mon Sep 28 04:55:54 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.17/2.29 % (1887565)Detected formulas, will run a generic FOF schedule.
% 9.17/2.29 % (1887570)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=378462912:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 9.17/2.29 % (1887576)dis-21_1_sil=8000:lcm=predicate:random_seed=1442438790:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 9.17/2.29 % (1887575)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=328796646:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 9.17/2.29 % (1887574)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4112282252:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 9.17/2.29 % (1887571)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3467550409:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 9.17/2.29 % (1887573)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=915347489:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 9.17/2.29 % (1887572)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=853557340:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 9.17/2.29 % (1887573)Refutation not found, incomplete strategy
% 9.17/2.29 % (1887573)------------------------------
% 9.17/2.29 % (1887573)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.17/2.29 % (1887573)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.17/2.29 % (1887573)CaDiCaL version: 2.1.3
% 9.17/2.29 % (1887573)Termination reason: Refutation not found, incomplete strategy
% 9.17/2.29 % (1887573)Time elapsed: 0.004 s
% 9.17/2.29 % (1887573)Peak memory usage: 88 MB
% 9.17/2.29 % (1887573)Instructions burned: 3 (million)
% 9.17/2.29 % (1887574)Instruction limit reached!
% 9.17/2.29 % (1887574)------------------------------
% 9.17/2.29 % (1887574)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.17/2.29 % (1887574)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.17/2.29 % (1887574)CaDiCaL version: 2.1.3
% 9.17/2.29 % (1887574)Termination reason: Instruction limit
% 9.17/2.29 % (1887574)Termination phase: Saturation
% 9.17/2.29 % (1887574)Time elapsed: 0.094 s
% 9.17/2.29 % (1887574)Peak memory usage: 88 MB
% 9.17/2.29 % (1887574)Instructions burned: 120 (million)
% 9.17/2.29 % (1887576)Instruction limit reached!
% 9.17/2.29 % (1887576)------------------------------
% 9.17/2.29 % (1887576)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.17/2.29 % (1887576)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.17/2.29 % (1887576)CaDiCaL version: 2.1.3
% 9.17/2.29 % (1887576)Termination reason: Instruction limit
% 9.17/2.29 % (1887576)Termination phase: Saturation
% 9.17/2.29 % (1887576)Time elapsed: 0.117 s
% 9.17/2.29 % (1887576)Peak memory usage: 91 MB
% 9.17/2.29 % (1887576)Instructions burned: 130 (million)
% 9.17/2.29 % (1887575)Instruction limit reached!
% 9.17/2.29 % (1887575)------------------------------
% 9.17/2.29 % (1887575)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.17/2.29 % (1887575)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.17/2.29 % (1887575)CaDiCaL version: 2.1.3
% 9.17/2.29 % (1887575)Termination reason: Instruction limit
% 9.17/2.29 % (1887575)Termination phase: Saturation
% 9.17/2.29 % (1887575)Time elapsed: 0.162 s
% 9.17/2.29 % (1887575)Peak memory usage: 89 MB
% 9.17/2.29 % (1887575)Instructions burned: 139 (million)
% 9.17/2.29 % (1887584)lrs+10_1_sil=8000:sp=occurrence:random_seed=3739531051:i=285:sd=3:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/285Mi)
% 9.17/2.29 % (1887585)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3537176652:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/157Mi)
% 9.17/2.29 % (1887573)------------------------------
% 9.17/2.29 % (1887573)------------------------------
% 9.17/2.29 % (1887586)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3860028131:i=325:sd=1:ss=axioms:sgt=32_2995 on theBenchmark for (2995ds/325Mi)
% 9.17/2.29 % (1887586)Refutation not found, incomplete strategy
% 9.17/2.29 % (1887586)------------------------------
% 9.17/2.29 % (1887586)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.17/2.29 % (1887586)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.17/2.29 % (1887586)CaDiCaL version: 2.1.3
% 9.17/2.29 % (1887586)Termination reason: Refutation not found, incomplete strategy
% 9.17/2.29 % (1887586)Time elapsed: 0.005 s
% 9.17/2.29 % (1887586)Peak memory usage: 88 MB
% 9.17/2.29 % (1887586)Instructions burned: 3 (million)
% 9.17/2.29 % (1887585)Instruction limit reached!
% 9.17/2.29 % (1887585)------------------------------
% 9.17/2.29 % (1887585)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.17/2.29 % (1887585)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.17/2.29 % (1887585)CaDiCaL version: 2.1.3
% 9.17/2.29 % (1887585)Termination reason: Instruction limit
% 9.17/2.29 % (1887585)Termination phase: Saturation
% 9.17/2.29 % (1887585)Time elapsed: 0.123 s
% 9.17/2.29 % (1887585)Peak memory usage: 89 MB
% 9.17/2.29 % (1887585)Instructions burned: 157 (million)
% 9.17/2.29 % (1887584)Instruction limit reached!
% 9.17/2.29 % (1887584)------------------------------
% 9.17/2.29 % (1887584)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.17/2.29 % (1887584)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.17/2.29 % (1887584)CaDiCaL version: 2.1.3
% 9.17/2.29 % (1887584)Termination reason: Instruction limit
% 9.17/2.29 % (1887584)Termination phase: Saturation
% 9.17/2.29 % (1887584)Time elapsed: 0.263 s
% 9.17/2.29 % (1887584)Peak memory usage: 93 MB
% 9.17/2.29 % (1887584)Instructions burned: 285 (million)
% 9.17/2.29 % (1887589)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=2326812791:s2a=on:i=248:s2at=1.23:gtg=position_2993 on theBenchmark for (2993ds/248Mi)
% 9.17/2.29 % (1887570)First to succeed.
% 9.17/2.29 % (1887570)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1887565"
% 9.17/2.29 % (1887589)Instruction limit reached!
% 9.17/2.29 % (1887589)------------------------------
% 9.17/2.29 % (1887589)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.17/2.29 % (1887589)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.17/2.29 % (1887589)CaDiCaL version: 2.1.3
% 9.17/2.29 % (1887589)Termination reason: Instruction limit
% 9.17/2.29 % (1887589)Termination phase: Saturation
% 9.17/2.29 % (1887589)Time elapsed: 0.122 s
% 9.17/2.29 % (1887589)Peak memory usage: 94 MB
% 9.17/2.29 % (1887589)Instructions burned: 249 (million)
% 9.17/2.29 % (1887591)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=2380422847:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2992 on theBenchmark for (2992ds/294Mi)
% 9.17/2.29 % (1887591)Refutation not found, incomplete strategy
% 9.17/2.29 % (1887591)------------------------------
% 9.17/2.29 % (1887591)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.17/2.29 % (1887591)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.17/2.29 % (1887591)CaDiCaL version: 2.1.3
% 9.17/2.29 % (1887591)Termination reason: Refutation not found, incomplete strategy
% 9.17/2.29 % (1887591)Time elapsed: 0.005 s
% 9.17/2.29 % (1887591)Peak memory usage: 88 MB
% 9.17/2.29 % (1887591)Instructions burned: 3 (million)
% 9.17/2.29 % (1887586)------------------------------
% 9.17/2.29 % (1887586)------------------------------
% 9.17/2.29 % (1887592)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=1055237016:i=2350_2991 on theBenchmark for (2991ds/2350Mi)
% 9.17/2.29 % (1887595)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=3554392027:cts=off:i=113:fsr=off:ss=included:sgt=4_2989 on theBenchmark for (2989ds/113Mi)
% 9.17/2.29 % (1887595)Instruction limit reached!
% 9.17/2.29 % (1887595)------------------------------
% 9.17/2.29 % (1887595)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.17/2.29 % (1887595)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.17/2.29 % (1887595)CaDiCaL version: 2.1.3
% 9.17/2.29 % (1887595)Termination reason: Instruction limit
% 9.17/2.29 % (1887595)Termination phase: Saturation
% 9.17/2.29 % (1887595)Time elapsed: 0.065 s
% 9.17/2.29 % (1887595)Peak memory usage: 91 MB
% 9.17/2.29 % (1887595)Instructions burned: 114 (million)
% 9.17/2.29 % (1887570)Refutation found. Thanks to Tanya!
% 9.17/2.29 % SZS status Theorem for theBenchmark
% 9.17/2.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.25/2.51 % (1887570)------------------------------
% 0.25/2.51 % (1887570)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.25/2.51 % (1887570)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/2.51 % (1887570)CaDiCaL version: 2.1.3
% 0.25/2.51 % (1887570)Termination reason: Refutation
% 0.25/2.51 % (1887570)Time elapsed: 0.705 s
% 0.25/2.51 % (1887570)Peak memory usage: 130 MB
% 0.25/2.51 % (1887570)Instructions burned: 1031 (million)
% 0.25/2.51 % (1887570)------------------------------
% 0.25/2.51 % (1887570)------------------------------
% 0.25/2.51 % (1887565)Success in time 1.331 s
% 0.25/2.51 % Vampire exiting
%------------------------------------------------------------------------------