%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU367+2 : 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 : n005.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:34 PM UTC 2026
% Result : Theorem 3.09s 1.47s
% Output : Refutation 4.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 8
% Syntax : Number of formulae : 81 ( 11 unt; 4 def)
% Number of atoms : 376 ( 0 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 459 ( 164 ~; 195 |; 70 &)
% ( 12 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 5 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-4 aty)
% Number of variables : 142 ( 0 sgn 118 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f57,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(f62,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(f121,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f702,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(f703,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)],[f702]) ).
fof(f721,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,[],[f703]) ).
fof(f722,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,[],[f721]) ).
fof(f730,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f121]) ).
fof(f736,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,[],[f62]) ).
fof(f737,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,[],[f736]) ).
fof(f738,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,[],[f57]) ).
fof(f739,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,[],[f738]) ).
fof(f740,plain,
( ( ( ~ is_eventually_in(sK0,sK1,sK3)
& is_eventually_in(sK0,sK1,sK2) )
| ( ~ is_often_in(sK0,sK1,sK3)
& is_often_in(sK0,sK1,sK2) ) )
& subset(sK2,sK3)
& ~ empty_carrier(sK1)
& net_str(sK1,sK0)
& ~ empty_carrier(sK0)
& one_sorted_str(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f722]) ).
fof(f746,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f730]) ).
fof(f747,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f746]) ).
fof(f748,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK7(X0,X1),X1)
& in(sK7(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(X2,sK7(X0,X1))],[f747]) ).
fof(f755,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,[],[f737]) ).
fof(f756,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,[],[f755]) ).
fof(f757,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( is_often_in(X0,X1,X2)
| ( ! [X4] :
( ~ element(X4,the_carrier(X1))
| ~ related(X1,sK10(X0,X1,X2),X4)
| ~ in(apply_netmap(X0,X1,X4),X2) )
& element(sK10(X0,X1,X2),the_carrier(X1)) ) )
& ( ! [X5] :
( ( element(sK11(X0,X1,X2,X5),the_carrier(X1))
& related(X1,X5,sK11(X0,X1,X2,X5))
& in(apply_netmap(X0,X1,sK11(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,[sK10,sK11]),skolemize(X3,sK10(X0,X1,X2)),skolemize(X6,sK11(X0,X1,X2,X5))],[f756]) ).
fof(f758,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,[],[f739]) ).
fof(f759,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,[],[f758]) ).
fof(f760,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( is_eventually_in(X0,X1,X2)
| ! [X3] :
( ~ element(X3,the_carrier(X1))
| ( ~ in(apply_netmap(X0,X1,sK12(X0,X1,X2,X3)),X2)
& related(X1,X3,sK12(X0,X1,X2,X3))
& element(sK12(X0,X1,X2,X3),the_carrier(X1)) ) ) )
& ( ( element(sK13(X0,X1,X2),the_carrier(X1))
& ! [X6] :
( in(apply_netmap(X0,X1,X6),X2)
| ~ related(X1,sK13(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,[sK12,sK13]),skolemize(X4,sK12(X0,X1,X2,X3)),skolemize(X5,sK13(X0,X1,X2))],[f759]) ).
fof(f761,plain,
one_sorted_str(sK0),
inference(cnf_transformation,[],[f740]) ).
fof(f762,plain,
~ empty_carrier(sK0),
inference(cnf_transformation,[],[f740]) ).
fof(f763,plain,
net_str(sK1,sK0),
inference(cnf_transformation,[],[f740]) ).
fof(f764,plain,
~ empty_carrier(sK1),
inference(cnf_transformation,[],[f740]) ).
fof(f765,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f740]) ).
fof(f766,plain,
( is_eventually_in(sK0,sK1,sK2)
| is_often_in(sK0,sK1,sK2) ),
inference(cnf_transformation,[],[f740]) ).
fof(f767,plain,
( is_eventually_in(sK0,sK1,sK2)
| ~ is_often_in(sK0,sK1,sK3) ),
inference(cnf_transformation,[],[f740]) ).
fof(f768,plain,
( ~ is_eventually_in(sK0,sK1,sK3)
| is_often_in(sK0,sK1,sK2) ),
inference(cnf_transformation,[],[f740]) ).
fof(f769,plain,
( ~ is_eventually_in(sK0,sK1,sK3)
| ~ is_often_in(sK0,sK1,sK3) ),
inference(cnf_transformation,[],[f740]) ).
fof(f782,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f748]) ).
fof(f795,plain,
! [X2,X0,X1,X5] :
( in(apply_netmap(X0,X1,sK11(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,[],[f757]) ).
fof(f796,plain,
! [X2,X0,X1,X5] :
( related(X1,X5,sK11(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,[],[f757]) ).
fof(f797,plain,
! [X2,X0,X1,X5] :
( element(sK11(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,[],[f757]) ).
fof(f798,plain,
! [X2,X0,X1] :
( element(sK10(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,[],[f757]) ).
fof(f799,plain,
! [X2,X0,X1,X4] :
( ~ related(X1,sK10(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,[],[f757]) ).
fof(f800,plain,
! [X2,X0,X1,X6] :
( ~ related(X1,sK13(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,[],[f760]) ).
fof(f801,plain,
! [X2,X0,X1] :
( element(sK13(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,[],[f760]) ).
fof(f802,plain,
! [X2,X3,X0,X1] :
( element(sK12(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,[],[f760]) ).
fof(f803,plain,
! [X2,X3,X0,X1] :
( related(X1,X3,sK12(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,[],[f760]) ).
fof(f804,plain,
! [X2,X3,X0,X1] :
( ~ in(apply_netmap(X0,X1,sK12(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,[],[f760]) ).
fof(f810,definition,
( spl14_1
<=> is_often_in(sK0,sK1,sK2) ),
introduced(definition,[new_symbols(definition,[spl14_1])],[avatar_definition]) ).
fof(f812,plain,
( is_often_in(sK0,sK1,sK2)
| ~ spl14_1 ),
inference(avatar_component_clause,[],[f810]) ).
fof(f814,definition,
( spl14_2
<=> is_eventually_in(sK0,sK1,sK2) ),
introduced(definition,[new_symbols(definition,[spl14_2])],[avatar_definition]) ).
fof(f816,plain,
( is_eventually_in(sK0,sK1,sK2)
| ~ spl14_2 ),
inference(avatar_component_clause,[],[f814]) ).
fof(f817,plain,
( spl14_1
| spl14_2 ),
inference(avatar_split_clause,[],[f766,f814,f810]) ).
fof(f819,definition,
( spl14_3
<=> is_often_in(sK0,sK1,sK3) ),
introduced(definition,[new_symbols(definition,[spl14_3])],[avatar_definition]) ).
fof(f821,plain,
( ~ is_often_in(sK0,sK1,sK3)
| spl14_3 ),
inference(avatar_component_clause,[],[f819]) ).
fof(f822,plain,
( ~ spl14_3
| spl14_2 ),
inference(avatar_split_clause,[],[f767,f814,f819]) ).
fof(f824,definition,
( spl14_4
<=> is_eventually_in(sK0,sK1,sK3) ),
introduced(definition,[new_symbols(definition,[spl14_4])],[avatar_definition]) ).
fof(f826,plain,
( ~ is_eventually_in(sK0,sK1,sK3)
| spl14_4 ),
inference(avatar_component_clause,[],[f824]) ).
fof(f827,plain,
( spl14_1
| ~ spl14_4 ),
inference(avatar_split_clause,[],[f768,f824,f810]) ).
fof(f828,plain,
( ~ spl14_3
| ~ spl14_4 ),
inference(avatar_split_clause,[],[f769,f824,f819]) ).
fof(f866,plain,
( element(sK13(sK0,sK1,sK2),the_carrier(sK1))
| ~ spl14_2 ),
inference(unit_resulting_resolution,[],[f801,f761,f762,f764,f763,f816]) ).
fof(f871,plain,
( element(sK12(sK0,sK1,sK3,sK13(sK0,sK1,sK2)),the_carrier(sK1))
| ~ spl14_2
| spl14_4 ),
inference(unit_resulting_resolution,[],[f802,f761,f762,f764,f763,f826,f866]) ).
fof(f875,plain,
( related(sK1,sK13(sK0,sK1,sK2),sK12(sK0,sK1,sK3,sK13(sK0,sK1,sK2)))
| ~ spl14_2
| spl14_4 ),
inference(unit_resulting_resolution,[],[f803,f761,f762,f764,f763,f826,f866]) ).
fof(f877,plain,
( ~ in(apply_netmap(sK0,sK1,sK12(sK0,sK1,sK3,sK13(sK0,sK1,sK2))),sK3)
| ~ spl14_2
| spl14_4 ),
inference(unit_resulting_resolution,[],[f804,f761,f762,f764,f763,f826,f866]) ).
fof(f879,plain,
( ~ in(apply_netmap(sK0,sK1,sK12(sK0,sK1,sK3,sK13(sK0,sK1,sK2))),sK2)
| ~ spl14_2
| spl14_4 ),
inference(unit_resulting_resolution,[],[f782,f765,f877]) ).
fof(f892,plain,
( $false
| ~ spl14_2
| spl14_4 ),
inference(unit_resulting_resolution,[],[f800,f761,f762,f764,f763,f816,f871,f879,f875]) ).
fof(f893,plain,
( ~ spl14_2
| spl14_4 ),
inference(avatar_contradiction_clause,[],[f892]) ).
fof(f913,plain,
( element(sK10(sK0,sK1,sK3),the_carrier(sK1))
| spl14_3 ),
inference(unit_resulting_resolution,[],[f798,f761,f762,f764,f763,f821]) ).
fof(f917,plain,
( in(apply_netmap(sK0,sK1,sK11(sK0,sK1,sK2,sK10(sK0,sK1,sK3))),sK2)
| ~ spl14_1
| spl14_3 ),
inference(unit_resulting_resolution,[],[f795,f761,f762,f764,f763,f812,f913]) ).
fof(f918,plain,
( related(sK1,sK10(sK0,sK1,sK3),sK11(sK0,sK1,sK2,sK10(sK0,sK1,sK3)))
| ~ spl14_1
| spl14_3 ),
inference(unit_resulting_resolution,[],[f796,f761,f762,f764,f763,f812,f913]) ).
fof(f919,plain,
( element(sK11(sK0,sK1,sK2,sK10(sK0,sK1,sK3)),the_carrier(sK1))
| ~ spl14_1
| spl14_3 ),
inference(unit_resulting_resolution,[],[f797,f761,f762,f764,f763,f812,f913]) ).
fof(f942,plain,
( in(apply_netmap(sK0,sK1,sK11(sK0,sK1,sK2,sK10(sK0,sK1,sK3))),sK3)
| ~ spl14_1
| spl14_3 ),
inference(unit_resulting_resolution,[],[f782,f765,f917]) ).
fof(f949,plain,
( ~ in(apply_netmap(sK0,sK1,sK11(sK0,sK1,sK2,sK10(sK0,sK1,sK3))),sK3)
| ~ spl14_1
| spl14_3 ),
inference(unit_resulting_resolution,[],[f799,f761,f762,f764,f763,f821,f919,f918]) ).
fof(f950,plain,
( $false
| ~ spl14_1
| spl14_3 ),
inference(forward_subsumption_resolution,[],[f949,f942]) ).
fof(f951,plain,
( ~ spl14_1
| spl14_3 ),
inference(avatar_contradiction_clause,[],[f950]) ).
cnf(s1,plain,
( spl14_1
| spl14_2 ),
inference(sat_conversion,[],[f817]) ).
cnf(s2,plain,
( spl14_2
| ~ spl14_3 ),
inference(sat_conversion,[],[f822]) ).
cnf(s3,plain,
( spl14_1
| ~ spl14_4 ),
inference(sat_conversion,[],[f827]) ).
cnf(s4,plain,
( ~ spl14_3
| ~ spl14_4 ),
inference(sat_conversion,[],[f828]) ).
cnf(s5,plain,
( ~ spl14_2
| spl14_4 ),
inference(sat_conversion,[],[f893]) ).
cnf(s14,plain,
( ~ spl14_1
| spl14_3 ),
inference(sat_conversion,[],[f951]) ).
cnf(s15,plain,
spl14_1,
inference(rat,[],[s5,s1,s3]) ).
cnf(s16,plain,
spl14_3,
inference(rat,[],[s14,s15]) ).
cnf(s17,plain,
~ spl14_4,
inference(rat,[],[s4,s16]) ).
cnf(s18,plain,
spl14_2,
inference(rat,[],[s2,s16]) ).
cnf(s19,plain,
$false,
inference(rat,[],[s5,s17,s18]) ).
fof(f952,plain,
$false,
inference(avatar_sat_refutation,[],[s19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU367+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.38 % Computer : n005.cluster.edu
% 0.09/0.38 % Model : x86_64 x86_64
% 0.09/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38 % Memory : 8046.5625MB
% 0.09/0.38 % OS : Linux 6.8.0-71-generic
% 0.09/0.38 % CPULimit : 300
% 0.09/0.38 % WCLimit : 300
% 0.09/0.38 % DateTime : Mon Sep 28 04:55:02 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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
% 3.09/1.47 % (442155)Detected formulas, will run a generic FOF schedule.
% 3.09/1.47 % (442165)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1798800700:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.09/1.47 % (442162)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=1507641011:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.09/1.47 % (442164)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2435480397:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.09/1.47 % (442160)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=216909024:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.09/1.47 % (442161)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=2774624829:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.09/1.47 % (442163)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2941712948:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.09/1.47 % (442166)dis-21_1_sil=8000:lcm=predicate:random_seed=966203070: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)
% 3.09/1.47 % (442165)Instruction limit reached!
% 3.09/1.47 % (442165)------------------------------
% 3.09/1.47 % (442165)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.09/1.47 % (442165)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.09/1.47 % (442165)CaDiCaL version: 2.1.3
% 3.09/1.47 % (442165)Termination reason: Instruction limit
% 3.09/1.47 % (442165)Termination phase: Saturation
% 3.09/1.47 % (442165)Time elapsed: 0.049 s
% 3.09/1.47 % (442165)Peak memory usage: 92 MB
% 3.09/1.47 % (442165)Instructions burned: 140 (million)
% 3.09/1.47 % (442163)Instruction limit reached!
% 3.09/1.47 % (442163)------------------------------
% 3.09/1.47 % (442163)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.09/1.47 % (442163)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.09/1.47 % (442163)CaDiCaL version: 2.1.3
% 3.09/1.47 % (442163)Termination reason: Instruction limit
% 3.09/1.47 % (442163)Termination phase: Saturation
% 3.09/1.47 % (442163)Time elapsed: 0.060 s
% 3.09/1.47 % (442163)Peak memory usage: 91 MB
% 3.09/1.47 % (442163)Instructions burned: 110 (million)
% 3.09/1.47 % (442164)Instruction limit reached!
% 3.09/1.47 % (442164)------------------------------
% 3.09/1.47 % (442164)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.09/1.47 % (442164)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.09/1.47 % (442164)CaDiCaL version: 2.1.3
% 3.09/1.47 % (442164)Termination reason: Instruction limit
% 3.09/1.47 % (442164)Termination phase: Saturation
% 3.09/1.47 % (442164)Time elapsed: 0.076 s
% 3.09/1.47 % (442164)Peak memory usage: 91 MB
% 3.09/1.47 % (442164)Instructions burned: 119 (million)
% 3.09/1.47 % (442166)Instruction limit reached!
% 3.09/1.47 % (442166)------------------------------
% 3.09/1.47 % (442166)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.09/1.47 % (442166)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.09/1.47 % (442166)CaDiCaL version: 2.1.3
% 3.09/1.47 % (442166)Termination reason: Instruction limit
% 3.09/1.47 % (442166)Termination phase: Saturation
% 3.09/1.47 % (442166)Time elapsed: 0.069 s
% 3.09/1.47 % (442166)Peak memory usage: 91 MB
% 3.09/1.47 % (442166)Instructions burned: 129 (million)
% 3.09/1.47 % (442174)lrs+10_1_sil=8000:sp=occurrence:random_seed=3041110661:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.09/1.47 % (442175)lrs+10_1_sil=32000:urr=on:br=off:random_seed=502731845:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.09/1.47 % (442175)First to succeed.
% 3.09/1.47 % (442176)lrs+1011_1_sil=32000:sp=occurrence:random_seed=4105016666:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.09/1.47 % (442175)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-442155"
% 3.09/1.47 % (442177)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=3541246217:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 3.09/1.47 % (442174)Instruction limit reached!
% 3.09/1.47 % (442174)------------------------------
% 3.09/1.47 % (442174)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.09/1.47 % (442174)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.09/1.47 % (442174)CaDiCaL version: 2.1.3
% 3.09/1.47 % (442174)Termination reason: Instruction limit
% 3.09/1.47 % (442174)Termination phase: Saturation
% 3.09/1.47 % (442174)Time elapsed: 0.101 s
% 3.09/1.47 % (442174)Peak memory usage: 95 MB
% 3.09/1.47 % (442174)Instructions burned: 287 (million)
% 3.09/1.47 % (442182)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=910605322:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2996 on theBenchmark for (2996ds/294Mi)
% 3.09/1.47 % (442177)Instruction limit reached!
% 3.09/1.47 % (442177)------------------------------
% 3.09/1.47 % (442177)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.09/1.47 % (442177)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.09/1.47 % (442177)CaDiCaL version: 2.1.3
% 3.09/1.47 % (442177)Termination reason: Instruction limit
% 3.09/1.47 % (442177)Termination phase: Saturation
% 3.09/1.47 % (442177)Time elapsed: 0.151 s
% 3.09/1.47 % (442177)Peak memory usage: 95 MB
% 3.09/1.47 % (442177)Instructions burned: 248 (million)
% 3.09/1.47 % (442182)Instruction limit reached!
% 3.09/1.47 % (442182)------------------------------
% 3.09/1.47 % (442182)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.09/1.47 % (442182)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.09/1.47 % (442182)CaDiCaL version: 2.1.3
% 3.09/1.47 % (442182)Termination reason: Instruction limit
% 3.09/1.47 % (442182)Termination phase: Saturation
% 3.09/1.47 % (442182)Time elapsed: 0.099 s
% 3.09/1.47 % (442182)Peak memory usage: 93 MB
% 3.09/1.47 % (442182)Instructions burned: 297 (million)
% 3.09/1.47 % (442176)Instruction limit reached!
% 3.09/1.47 % (442176)------------------------------
% 3.09/1.47 % (442176)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.09/1.47 % (442176)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.09/1.47 % (442176)CaDiCaL version: 2.1.3
% 3.09/1.47 % (442176)Termination reason: Instruction limit
% 3.09/1.47 % (442176)Termination phase: Saturation
% 3.09/1.47 % (442176)Time elapsed: 0.219 s
% 3.09/1.47 % (442176)Peak memory usage: 95 MB
% 3.09/1.47 % (442176)Instructions burned: 325 (million)
% 3.09/1.47 % (442175)Refutation found. Thanks to Tanya!
% 3.09/1.47 % SZS status Theorem for theBenchmark
% 3.09/1.47 % SZS output start Proof for theBenchmark
% See solution above
% 4.70/1.57 % (442175)------------------------------
% 4.70/1.57 % (442175)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.70/1.57 % (442175)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.70/1.57 % (442175)CaDiCaL version: 2.1.3
% 4.70/1.57 % (442175)Termination reason: Refutation
% 4.70/1.57 % (442175)Time elapsed: 0.016 s
% 4.70/1.57 % (442175)Peak memory usage: 91 MB
% 4.70/1.57 % (442175)Instructions burned: 23 (million)
% 4.70/1.57 % (442175)------------------------------
% 4.70/1.57 % (442175)------------------------------
% 4.70/1.57 % (442155)Success in time 0.622 s
% 4.70/1.57 % Vampire exiting
%------------------------------------------------------------------------------