%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU376+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n013.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:03 PM UTC 2026
% Result : Theorem 0.15s 0.51s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 5
% Syntax : Number of formulae : 62 ( 9 unt; 0 def)
% Number of atoms : 470 ( 0 equ)
% Maximal formula atoms : 14 ( 7 avg)
% Number of connectives : 650 ( 242 ~; 290 |; 88 &)
% ( 9 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 10 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-4 aty)
% Number of variables : 194 ( 165 !; 29 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,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(f9,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(f10,axiom,
! [X0] :
( ( ~ empty_carrier(X0)
& rel_str(X0) )
=> ( directed_relstr(X0)
<=> ! [X1] :
( element(X1,the_carrier(X0))
=> ! [X2] :
( element(X2,the_carrier(X0))
=> ? [X3] :
( element(X3,the_carrier(X0))
& related(X0,X1,X3)
& related(X0,X2,X3) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_yellow_6) ).
fof(f20,axiom,
! [X0] :
( one_sorted_str(X0)
=> ! [X1] :
( net_str(X1,X0)
=> rel_str(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_l1_waybel_0) ).
fof(f54,conjecture,
! [X0] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ! [X1] :
( ( ~ empty_carrier(X1)
& transitive_relstr(X1)
& directed_relstr(X1)
& net_str(X1,X0) )
=> ! [X2] :
( is_eventually_in(X0,X1,X2)
=> is_often_in(X0,X1,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_yellow_6) ).
fof(f55,negated_conjecture,
~ ! [X0] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ! [X1] :
( ( ~ empty_carrier(X1)
& transitive_relstr(X1)
& directed_relstr(X1)
& net_str(X1,X0) )
=> ! [X2] :
( is_eventually_in(X0,X1,X2)
=> is_often_in(X0,X1,X2) ) ) ),
inference(negated_conjecture,[status(cth)],[f54]) ).
fof(f65,plain,
~ ! [X0] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ! [X1] :
( ( ~ empty_carrier(X1)
& directed_relstr(X1)
& net_str(X1,X0) )
=> ! [X2] :
( is_eventually_in(X0,X1,X2)
=> is_often_in(X0,X1,X2) ) ) ),
inference(pure_predicate_removal,[],[f55]) ).
fof(f80,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,[],[f8]) ).
fof(f81,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,[],[f80]) ).
fof(f82,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,[],[f9]) ).
fof(f83,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,[],[f82]) ).
fof(f84,plain,
! [X0] :
( ( directed_relstr(X0)
<=> ! [X1] :
( ! [X2] :
( ? [X3] :
( element(X3,the_carrier(X0))
& related(X0,X1,X3)
& related(X0,X2,X3) )
| ~ element(X2,the_carrier(X0)) )
| ~ element(X1,the_carrier(X0)) ) )
| empty_carrier(X0)
| ~ rel_str(X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f85,plain,
! [X0] :
( ( directed_relstr(X0)
<=> ! [X1] :
( ! [X2] :
( ? [X3] :
( element(X3,the_carrier(X0))
& related(X0,X1,X3)
& related(X0,X2,X3) )
| ~ element(X2,the_carrier(X0)) )
| ~ element(X1,the_carrier(X0)) ) )
| empty_carrier(X0)
| ~ rel_str(X0) ),
inference(flattening,[],[f84]) ).
fof(f93,plain,
! [X0] :
( ! [X1] :
( rel_str(X1)
| ~ net_str(X1,X0) )
| ~ one_sorted_str(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f110,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ~ is_often_in(X0,X1,X2)
& is_eventually_in(X0,X1,X2) )
& ~ empty_carrier(X1)
& directed_relstr(X1)
& net_str(X1,X0) )
& ~ empty_carrier(X0)
& one_sorted_str(X0) ),
inference(ennf_transformation,[],[f65]) ).
fof(f111,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ~ is_often_in(X0,X1,X2)
& is_eventually_in(X0,X1,X2) )
& ~ empty_carrier(X1)
& directed_relstr(X1)
& net_str(X1,X0) )
& ~ empty_carrier(X0)
& one_sorted_str(X0) ),
inference(flattening,[],[f110]) ).
fof(f121,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,[],[f81]) ).
fof(f122,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,[],[f121]) ).
fof(f123,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))],[f122]) ).
fof(f124,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,[],[f83]) ).
fof(f125,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,[],[f124]) ).
fof(f126,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))],[f125]) ).
fof(f127,plain,
! [X0] :
( ( ( directed_relstr(X0)
| ? [X1] :
( ? [X2] :
( ! [X3] :
( ~ element(X3,the_carrier(X0))
| ~ related(X0,X1,X3)
| ~ related(X0,X2,X3) )
& element(X2,the_carrier(X0)) )
& element(X1,the_carrier(X0)) ) )
& ( ! [X1] :
( ! [X2] :
( ? [X3] :
( element(X3,the_carrier(X0))
& related(X0,X1,X3)
& related(X0,X2,X3) )
| ~ element(X2,the_carrier(X0)) )
| ~ element(X1,the_carrier(X0)) )
| ~ directed_relstr(X0) ) )
| empty_carrier(X0)
| ~ rel_str(X0) ),
inference(nnf_transformation,[],[f85]) ).
fof(f128,plain,
! [X0] :
( ( ( directed_relstr(X0)
| ? [X1] :
( ? [X2] :
( ! [X3] :
( ~ element(X3,the_carrier(X0))
| ~ related(X0,X1,X3)
| ~ related(X0,X2,X3) )
& element(X2,the_carrier(X0)) )
& element(X1,the_carrier(X0)) ) )
& ( ! [X4] :
( ! [X5] :
( ? [X6] :
( element(X6,the_carrier(X0))
& related(X0,X4,X6)
& related(X0,X5,X6) )
| ~ element(X5,the_carrier(X0)) )
| ~ element(X4,the_carrier(X0)) )
| ~ directed_relstr(X0) ) )
| empty_carrier(X0)
| ~ rel_str(X0) ),
inference(rectify,[],[f127]) ).
fof(f129,plain,
! [X0] :
( ( ( directed_relstr(X0)
| ( ! [X3] :
( ~ element(X3,the_carrier(X0))
| ~ related(X0,sK4(X0),X3)
| ~ related(X0,sK5(X0),X3) )
& element(sK5(X0),the_carrier(X0))
& element(sK4(X0),the_carrier(X0)) ) )
& ( ! [X4] :
( ! [X5] :
( ( element(sK6(X0,X4,X5),the_carrier(X0))
& related(X0,X4,sK6(X0,X4,X5))
& related(X0,X5,sK6(X0,X4,X5)) )
| ~ element(X5,the_carrier(X0)) )
| ~ element(X4,the_carrier(X0)) )
| ~ directed_relstr(X0) ) )
| empty_carrier(X0)
| ~ rel_str(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6]),skolemize(X1,sK4(X0)),skolemize(X2,sK5(X0)),skolemize(X6,sK6(X0,X4,X5))],[f128]) ).
fof(f149,plain,
( ~ is_often_in(sK25,sK26,sK27)
& is_eventually_in(sK25,sK26,sK27)
& ~ empty_carrier(sK26)
& directed_relstr(sK26)
& net_str(sK26,sK25)
& ~ empty_carrier(sK25)
& one_sorted_str(sK25) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK25,sK26,sK27]),skolemize(X0,sK25),skolemize(X1,sK26),skolemize(X2,sK27)],[f111]) ).
fof(f156,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,[],[f123]) ).
fof(f157,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,[],[f123]) ).
fof(f164,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,[],[f126]) ).
fof(f165,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,[],[f126]) ).
fof(f166,plain,
! [X0,X4,X5] :
( related(X0,X5,sK6(X0,X4,X5))
| ~ element(X5,the_carrier(X0))
| ~ element(X4,the_carrier(X0))
| ~ directed_relstr(X0)
| empty_carrier(X0)
| ~ rel_str(X0) ),
inference(cnf_transformation,[],[f129]) ).
fof(f167,plain,
! [X0,X4,X5] :
( related(X0,X4,sK6(X0,X4,X5))
| ~ element(X5,the_carrier(X0))
| ~ element(X4,the_carrier(X0))
| ~ directed_relstr(X0)
| empty_carrier(X0)
| ~ rel_str(X0) ),
inference(cnf_transformation,[],[f129]) ).
fof(f168,plain,
! [X0,X4,X5] :
( element(sK6(X0,X4,X5),the_carrier(X0))
| ~ element(X5,the_carrier(X0))
| ~ element(X4,the_carrier(X0))
| ~ directed_relstr(X0)
| empty_carrier(X0)
| ~ rel_str(X0) ),
inference(cnf_transformation,[],[f129]) ).
fof(f176,plain,
! [X0,X1] :
( ~ net_str(X1,X0)
| rel_str(X1)
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f93]) ).
fof(f227,plain,
one_sorted_str(sK25),
inference(cnf_transformation,[],[f149]) ).
fof(f228,plain,
~ empty_carrier(sK25),
inference(cnf_transformation,[],[f149]) ).
fof(f229,plain,
net_str(sK26,sK25),
inference(cnf_transformation,[],[f149]) ).
fof(f230,plain,
directed_relstr(sK26),
inference(cnf_transformation,[],[f149]) ).
fof(f231,plain,
~ empty_carrier(sK26),
inference(cnf_transformation,[],[f149]) ).
fof(f232,plain,
is_eventually_in(sK25,sK26,sK27),
inference(cnf_transformation,[],[f149]) ).
fof(f233,plain,
~ is_often_in(sK25,sK26,sK27),
inference(cnf_transformation,[],[f149]) ).
fof(f416,plain,
! [X2,X3,X0,X1] :
( in(apply_netmap(X0,X1,sK6(X1,X2,sK1(X0,X1,X3))),X3)
| ~ element(sK6(X1,X2,sK1(X0,X1,X3)),the_carrier(X1))
| ~ is_eventually_in(X0,X1,X3)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| ~ element(sK1(X0,X1,X3),the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ directed_relstr(X1)
| empty_carrier(X1)
| ~ rel_str(X1) ),
inference(resolution,[],[f156,f166]) ).
fof(f423,plain,
! [X2,X3,X0,X1] :
( in(apply_netmap(X0,X1,sK6(X1,X2,sK1(X0,X1,X3))),X3)
| ~ element(sK6(X1,X2,sK1(X0,X1,X3)),the_carrier(X1))
| ~ is_eventually_in(X0,X1,X3)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| ~ element(sK1(X0,X1,X3),the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ directed_relstr(X1)
| ~ rel_str(X1) ),
inference(duplicate_literal_removal,[],[f416]) ).
fof(f427,plain,
! [X2,X3,X0,X1] :
( in(apply_netmap(X0,X1,sK6(X1,X2,sK1(X0,X1,X3))),X3)
| ~ is_eventually_in(X0,X1,X3)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| ~ element(sK1(X0,X1,X3),the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ directed_relstr(X1)
| ~ rel_str(X1) ),
inference(forward_subsumption_resolution,[],[f423,f168]) ).
fof(f431,plain,
! [X2,X3,X0,X1] :
( in(apply_netmap(X0,X1,sK6(X1,X2,sK1(X0,X1,X3))),X3)
| ~ is_eventually_in(X0,X1,X3)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| ~ element(X2,the_carrier(X1))
| ~ directed_relstr(X1)
| ~ rel_str(X1) ),
inference(forward_subsumption_resolution,[],[f427,f157]) ).
fof(f433,plain,
! [X2,X3,X0,X1] :
( in(apply_netmap(X0,X1,sK6(X1,X2,sK1(X0,X1,X3))),X3)
| ~ is_eventually_in(X0,X1,X3)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| ~ element(X2,the_carrier(X1))
| ~ directed_relstr(X1) ),
inference(forward_subsumption_resolution,[],[f431,f176]) ).
fof(f435,plain,
! [X2,X3,X0,X1] :
( ~ element(sK6(X0,sK2(X1,X0,X2),X3),the_carrier(X0))
| is_often_in(X1,X0,X2)
| ~ in(apply_netmap(X1,X0,sK6(X0,sK2(X1,X0,X2),X3)),X2)
| empty_carrier(X0)
| ~ net_str(X0,X1)
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| ~ element(X3,the_carrier(X0))
| ~ element(sK2(X1,X0,X2),the_carrier(X0))
| ~ directed_relstr(X0)
| empty_carrier(X0)
| ~ rel_str(X0) ),
inference(resolution,[],[f165,f167]) ).
fof(f440,plain,
! [X2,X3,X0,X1] :
( ~ element(sK6(X0,sK2(X1,X0,X2),X3),the_carrier(X0))
| is_often_in(X1,X0,X2)
| ~ in(apply_netmap(X1,X0,sK6(X0,sK2(X1,X0,X2),X3)),X2)
| empty_carrier(X0)
| ~ net_str(X0,X1)
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| ~ element(X3,the_carrier(X0))
| ~ element(sK2(X1,X0,X2),the_carrier(X0))
| ~ directed_relstr(X0)
| ~ rel_str(X0) ),
inference(duplicate_literal_removal,[],[f435]) ).
fof(f444,plain,
! [X2,X3,X0,X1] :
( is_often_in(X1,X0,X2)
| ~ in(apply_netmap(X1,X0,sK6(X0,sK2(X1,X0,X2),X3)),X2)
| empty_carrier(X0)
| ~ net_str(X0,X1)
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| ~ element(X3,the_carrier(X0))
| ~ element(sK2(X1,X0,X2),the_carrier(X0))
| ~ directed_relstr(X0)
| ~ rel_str(X0) ),
inference(forward_subsumption_resolution,[],[f440,f168]) ).
fof(f448,plain,
! [X2,X3,X0,X1] :
( is_often_in(X1,X0,X2)
| ~ in(apply_netmap(X1,X0,sK6(X0,sK2(X1,X0,X2),X3)),X2)
| empty_carrier(X0)
| ~ net_str(X0,X1)
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| ~ element(X3,the_carrier(X0))
| ~ directed_relstr(X0)
| ~ rel_str(X0) ),
inference(forward_subsumption_resolution,[],[f444,f164]) ).
fof(f450,plain,
! [X2,X3,X0,X1] :
( ~ in(apply_netmap(X1,X0,sK6(X0,sK2(X1,X0,X2),X3)),X2)
| is_often_in(X1,X0,X2)
| empty_carrier(X0)
| ~ net_str(X0,X1)
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| ~ element(X3,the_carrier(X0))
| ~ directed_relstr(X0) ),
inference(forward_subsumption_resolution,[],[f448,f176]) ).
fof(f677,plain,
! [X2,X0,X1] :
( is_often_in(X0,X1,X2)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| ~ element(sK1(X0,X1,X2),the_carrier(X1))
| ~ directed_relstr(X1)
| ~ is_eventually_in(X0,X1,X2)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| ~ element(sK2(X0,X1,X2),the_carrier(X1))
| ~ directed_relstr(X1) ),
inference(resolution,[],[f450,f433]) ).
fof(f680,plain,
! [X2,X0,X1] :
( is_often_in(X0,X1,X2)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| ~ element(sK1(X0,X1,X2),the_carrier(X1))
| ~ directed_relstr(X1)
| ~ is_eventually_in(X0,X1,X2)
| ~ element(sK2(X0,X1,X2),the_carrier(X1)) ),
inference(duplicate_literal_removal,[],[f677]) ).
fof(f682,plain,
! [X2,X0,X1] :
( is_often_in(X0,X1,X2)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| ~ directed_relstr(X1)
| ~ is_eventually_in(X0,X1,X2)
| ~ element(sK2(X0,X1,X2),the_carrier(X1)) ),
inference(forward_subsumption_resolution,[],[f680,f157]) ).
fof(f683,plain,
! [X2,X0,X1] :
( ~ is_eventually_in(X0,X1,X2)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| ~ directed_relstr(X1)
| is_often_in(X0,X1,X2) ),
inference(forward_subsumption_resolution,[],[f682,f164]) ).
fof(f1157,plain,
( empty_carrier(sK26)
| ~ net_str(sK26,sK25)
| empty_carrier(sK25)
| ~ one_sorted_str(sK25)
| ~ directed_relstr(sK26)
| is_often_in(sK25,sK26,sK27) ),
inference(resolution,[],[f683,f232]) ).
fof(f1158,plain,
( ~ net_str(sK26,sK25)
| empty_carrier(sK25)
| ~ one_sorted_str(sK25)
| ~ directed_relstr(sK26)
| is_often_in(sK25,sK26,sK27) ),
inference(forward_subsumption_resolution,[],[f1157,f231]) ).
fof(f1159,plain,
( empty_carrier(sK25)
| ~ one_sorted_str(sK25)
| ~ directed_relstr(sK26)
| is_often_in(sK25,sK26,sK27) ),
inference(forward_subsumption_resolution,[],[f1158,f229]) ).
fof(f1160,plain,
( ~ one_sorted_str(sK25)
| ~ directed_relstr(sK26)
| is_often_in(sK25,sK26,sK27) ),
inference(forward_subsumption_resolution,[],[f1159,f228]) ).
fof(f1161,plain,
( ~ directed_relstr(sK26)
| is_often_in(sK25,sK26,sK27) ),
inference(forward_subsumption_resolution,[],[f1160,f227]) ).
fof(f1162,plain,
is_often_in(sK25,sK26,sK27),
inference(forward_subsumption_resolution,[],[f1161,f230]) ).
fof(f1163,plain,
$false,
inference(forward_subsumption_resolution,[],[f1162,f233]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU376+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 % Computer : n013.cluster.edu
% 0.10/0.40 % Model : x86_64 x86_64
% 0.10/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.40 % Memory : 8046.5625MB
% 0.10/0.40 % OS : Linux 6.8.0-71-generic
% 0.10/0.40 % CPULimit : 300
% 0.10/0.40 % WCLimit : 300
% 0.10/0.40 % DateTime : Mon Sep 28 04:58:52 UTC 2026
% 0.10/0.40 % CPUTime :
% 0.10/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.43 Running first-order model finding
% 0.10/0.43 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.51 % (813405)Will run a generic schedule for satisfiability detection.
% 0.15/0.51 % (813410)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1064955012_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.51 % (813411)% WARNING: option uhcvi not known.
% 0.15/0.51 % TRYING [1]
% 0.15/0.51 % TRYING [2]
% 0.15/0.51 % TRYING [3]
% 0.15/0.51 % (813411)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3404910087:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.51 % (813415)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=856696844:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.51 % (813412)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1055051923:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.51 % (813413)dis+10_1_sil=32000:sp=arity:random_seed=775294194:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.51 % (813414)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3669332010:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.51 % (813416)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=27666495:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.51 % TRYING [4]
% 0.15/0.51 % (813413) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-813405-813413"...
% 0.15/0.51 % TRYING [5]
% 0.15/0.51 % (813413)...printing done.
% 0.15/0.51 % (813413)Refutation found. Thanks to Tanya!
% 0.15/0.51 % SZS status Theorem for theBenchmark
% 0.15/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.51 % (813413)------------------------------
% 0.15/0.51 % (813413)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.51 % (813413)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.51 % (813413)CaDiCaL version: 2.1.3
% 0.15/0.51 % (813413)Termination reason: Refutation
% 0.15/0.51 % (813413)Time elapsed: 0.032 s
% 0.15/0.51 % (813413)Peak memory usage: 12 MB
% 0.15/0.51 % (813413)Instructions burned: 46 (million)
% 0.15/0.51 % (813405)Success in time 0.07 s
% 0.15/0.51 % Vampire exiting
%------------------------------------------------------------------------------