%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU387+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n015.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:06 PM UTC 2026
% Result : Theorem 0.18s 0.47s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 7
% Syntax : Number of formulae : 52 ( 19 unt; 0 def)
% Number of atoms : 293 ( 6 equ)
% Maximal formula atoms : 18 ( 5 avg)
% Number of connectives : 376 ( 135 ~; 102 |; 129 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 7 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 27 ( 25 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-1 aty)
% Number of variables : 48 ( 42 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f26,axiom,
! [X0] :
( strict_rel_str(boole_POSet(X0))
& rel_str(boole_POSet(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k3_yellow_1) ).
fof(f43,axiom,
! [X0] :
( ~ empty_carrier(boole_POSet(X0))
& strict_rel_str(boole_POSet(X0))
& reflexive_relstr(boole_POSet(X0))
& transitive_relstr(boole_POSet(X0))
& antisymmetric_relstr(boole_POSet(X0))
& lower_bounded_relstr(boole_POSet(X0))
& upper_bounded_relstr(boole_POSet(X0))
& bounded_relstr(boole_POSet(X0))
& up_complete_relstr(boole_POSet(X0))
& join_complete_relstr(boole_POSet(X0))
& ~ v1_yellow_3(boole_POSet(X0))
& distributive_relstr(boole_POSet(X0))
& heyting_relstr(boole_POSet(X0))
& complemented_relstr(boole_POSet(X0))
& boolean_relstr(boole_POSet(X0))
& with_suprema_relstr(boole_POSet(X0))
& with_infima_relstr(boole_POSet(X0))
& complete_relstr(boole_POSet(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_waybel_7) ).
fof(f75,axiom,
! [X0] : bottom_of_relstr(boole_POSet(X0)) = empty_set,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t18_yellow_1) ).
fof(f78,conjecture,
! [X0] :
( ~ empty(X0)
=> ! [X1] :
( ( ~ empty(X1)
& filtered_subset(X1,boole_POSet(X0))
& upper_relstr_subset(X1,boole_POSet(X0))
& proper_element(X1,powerset(the_carrier(boole_POSet(X0))))
& element(X1,powerset(the_carrier(boole_POSet(X0)))) )
=> ! [X2] :
~ ( in(X2,X1)
& empty(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_yellow19) ).
fof(f79,negated_conjecture,
~ ! [X0] :
( ~ empty(X0)
=> ! [X1] :
( ( ~ empty(X1)
& filtered_subset(X1,boole_POSet(X0))
& upper_relstr_subset(X1,boole_POSet(X0))
& proper_element(X1,powerset(the_carrier(boole_POSet(X0))))
& element(X1,powerset(the_carrier(boole_POSet(X0)))) )
=> ! [X2] :
~ ( in(X2,X1)
& empty(X2) ) ) ),
inference(negated_conjecture,[status(cth)],[f78]) ).
fof(f83,axiom,
! [X0] :
( empty(X0)
=> X0 = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).
fof(f84,axiom,
! [X0,X1] :
~ ( in(X0,X1)
& empty(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_boole) ).
fof(f86,axiom,
! [X0] :
( ( ~ empty_carrier(X0)
& reflexive_relstr(X0)
& transitive_relstr(X0)
& antisymmetric_relstr(X0)
& lower_bounded_relstr(X0)
& rel_str(X0) )
=> ! [X1] :
( ( ~ empty(X1)
& filtered_subset(X1,X0)
& upper_relstr_subset(X1,X0)
& element(X1,powerset(the_carrier(X0))) )
=> ( proper_element(X1,powerset(the_carrier(X0)))
<=> ~ in(bottom_of_relstr(X0),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_waybel_7) ).
fof(f91,plain,
! [X0] :
( ~ empty_carrier(boole_POSet(X0))
& strict_rel_str(boole_POSet(X0))
& reflexive_relstr(boole_POSet(X0))
& transitive_relstr(boole_POSet(X0))
& antisymmetric_relstr(boole_POSet(X0))
& lower_bounded_relstr(boole_POSet(X0))
& upper_bounded_relstr(boole_POSet(X0))
& bounded_relstr(boole_POSet(X0))
& up_complete_relstr(boole_POSet(X0))
& join_complete_relstr(boole_POSet(X0))
& ~ v1_yellow_3(boole_POSet(X0))
& distributive_relstr(boole_POSet(X0))
& heyting_relstr(boole_POSet(X0))
& complemented_relstr(boole_POSet(X0))
& with_suprema_relstr(boole_POSet(X0))
& with_infima_relstr(boole_POSet(X0))
& complete_relstr(boole_POSet(X0)) ),
inference(pure_predicate_removal,[],[f43]) ).
fof(f96,plain,
! [X0] :
( ~ empty_carrier(boole_POSet(X0))
& strict_rel_str(boole_POSet(X0))
& reflexive_relstr(boole_POSet(X0))
& transitive_relstr(boole_POSet(X0))
& antisymmetric_relstr(boole_POSet(X0))
& lower_bounded_relstr(boole_POSet(X0))
& upper_bounded_relstr(boole_POSet(X0))
& bounded_relstr(boole_POSet(X0))
& up_complete_relstr(boole_POSet(X0))
& join_complete_relstr(boole_POSet(X0))
& ~ v1_yellow_3(boole_POSet(X0))
& distributive_relstr(boole_POSet(X0))
& heyting_relstr(boole_POSet(X0))
& with_suprema_relstr(boole_POSet(X0))
& with_infima_relstr(boole_POSet(X0))
& complete_relstr(boole_POSet(X0)) ),
inference(pure_predicate_removal,[],[f91]) ).
fof(f98,plain,
! [X0] :
( ~ empty_carrier(boole_POSet(X0))
& strict_rel_str(boole_POSet(X0))
& reflexive_relstr(boole_POSet(X0))
& transitive_relstr(boole_POSet(X0))
& antisymmetric_relstr(boole_POSet(X0))
& lower_bounded_relstr(boole_POSet(X0))
& upper_bounded_relstr(boole_POSet(X0))
& bounded_relstr(boole_POSet(X0))
& up_complete_relstr(boole_POSet(X0))
& join_complete_relstr(boole_POSet(X0))
& ~ v1_yellow_3(boole_POSet(X0))
& distributive_relstr(boole_POSet(X0))
& with_suprema_relstr(boole_POSet(X0))
& with_infima_relstr(boole_POSet(X0))
& complete_relstr(boole_POSet(X0)) ),
inference(pure_predicate_removal,[],[f96]) ).
fof(f102,plain,
! [X0] :
( ~ empty_carrier(boole_POSet(X0))
& strict_rel_str(boole_POSet(X0))
& reflexive_relstr(boole_POSet(X0))
& transitive_relstr(boole_POSet(X0))
& antisymmetric_relstr(boole_POSet(X0))
& lower_bounded_relstr(boole_POSet(X0))
& upper_bounded_relstr(boole_POSet(X0))
& bounded_relstr(boole_POSet(X0))
& up_complete_relstr(boole_POSet(X0))
& join_complete_relstr(boole_POSet(X0))
& ~ v1_yellow_3(boole_POSet(X0))
& with_suprema_relstr(boole_POSet(X0))
& with_infima_relstr(boole_POSet(X0))
& complete_relstr(boole_POSet(X0)) ),
inference(pure_predicate_removal,[],[f98]) ).
fof(f106,plain,
! [X0] :
( ~ empty_carrier(boole_POSet(X0))
& strict_rel_str(boole_POSet(X0))
& reflexive_relstr(boole_POSet(X0))
& transitive_relstr(boole_POSet(X0))
& antisymmetric_relstr(boole_POSet(X0))
& lower_bounded_relstr(boole_POSet(X0))
& upper_bounded_relstr(boole_POSet(X0))
& bounded_relstr(boole_POSet(X0))
& up_complete_relstr(boole_POSet(X0))
& join_complete_relstr(boole_POSet(X0))
& with_suprema_relstr(boole_POSet(X0))
& with_infima_relstr(boole_POSet(X0))
& complete_relstr(boole_POSet(X0)) ),
inference(pure_predicate_removal,[],[f102]) ).
fof(f177,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( in(X2,X1)
& empty(X2) )
& ~ empty(X1)
& filtered_subset(X1,boole_POSet(X0))
& upper_relstr_subset(X1,boole_POSet(X0))
& proper_element(X1,powerset(the_carrier(boole_POSet(X0))))
& element(X1,powerset(the_carrier(boole_POSet(X0)))) )
& ~ empty(X0) ),
inference(ennf_transformation,[],[f79]) ).
fof(f178,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( in(X2,X1)
& empty(X2) )
& ~ empty(X1)
& filtered_subset(X1,boole_POSet(X0))
& upper_relstr_subset(X1,boole_POSet(X0))
& proper_element(X1,powerset(the_carrier(boole_POSet(X0))))
& element(X1,powerset(the_carrier(boole_POSet(X0)))) )
& ~ empty(X0) ),
inference(flattening,[],[f177]) ).
fof(f183,plain,
! [X0] :
( X0 = empty_set
| ~ empty(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f184,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ empty(X1) ),
inference(ennf_transformation,[],[f84]) ).
fof(f186,plain,
! [X0] :
( ! [X1] :
( ( proper_element(X1,powerset(the_carrier(X0)))
<=> ~ in(bottom_of_relstr(X0),X1) )
| empty(X1)
| ~ filtered_subset(X1,X0)
| ~ upper_relstr_subset(X1,X0)
| ~ element(X1,powerset(the_carrier(X0))) )
| empty_carrier(X0)
| ~ reflexive_relstr(X0)
| ~ transitive_relstr(X0)
| ~ antisymmetric_relstr(X0)
| ~ lower_bounded_relstr(X0)
| ~ rel_str(X0) ),
inference(ennf_transformation,[],[f86]) ).
fof(f187,plain,
! [X0] :
( ! [X1] :
( ( proper_element(X1,powerset(the_carrier(X0)))
<=> ~ in(bottom_of_relstr(X0),X1) )
| empty(X1)
| ~ filtered_subset(X1,X0)
| ~ upper_relstr_subset(X1,X0)
| ~ element(X1,powerset(the_carrier(X0))) )
| empty_carrier(X0)
| ~ reflexive_relstr(X0)
| ~ transitive_relstr(X0)
| ~ antisymmetric_relstr(X0)
| ~ lower_bounded_relstr(X0)
| ~ rel_str(X0) ),
inference(flattening,[],[f186]) ).
fof(f221,plain,
( in(sK30,sK29)
& empty(sK30)
& ~ empty(sK29)
& filtered_subset(sK29,boole_POSet(sK28))
& upper_relstr_subset(sK29,boole_POSet(sK28))
& proper_element(sK29,powerset(the_carrier(boole_POSet(sK28))))
& element(sK29,powerset(the_carrier(boole_POSet(sK28))))
& ~ empty(sK28) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK28,sK29,sK30]),skolemize(X0,sK28),skolemize(X1,sK29),skolemize(X2,sK30)],[f178]) ).
fof(f222,plain,
! [X0] :
( ! [X1] :
( ( ( proper_element(X1,powerset(the_carrier(X0)))
| in(bottom_of_relstr(X0),X1) )
& ( ~ in(bottom_of_relstr(X0),X1)
| ~ proper_element(X1,powerset(the_carrier(X0))) ) )
| empty(X1)
| ~ filtered_subset(X1,X0)
| ~ upper_relstr_subset(X1,X0)
| ~ element(X1,powerset(the_carrier(X0))) )
| empty_carrier(X0)
| ~ reflexive_relstr(X0)
| ~ transitive_relstr(X0)
| ~ antisymmetric_relstr(X0)
| ~ lower_bounded_relstr(X0)
| ~ rel_str(X0) ),
inference(nnf_transformation,[],[f187]) ).
fof(f278,plain,
! [X0] : rel_str(boole_POSet(X0)),
inference(cnf_transformation,[],[f26]) ).
fof(f299,plain,
! [X0] : lower_bounded_relstr(boole_POSet(X0)),
inference(cnf_transformation,[],[f106]) ).
fof(f300,plain,
! [X0] : antisymmetric_relstr(boole_POSet(X0)),
inference(cnf_transformation,[],[f106]) ).
fof(f301,plain,
! [X0] : transitive_relstr(boole_POSet(X0)),
inference(cnf_transformation,[],[f106]) ).
fof(f302,plain,
! [X0] : reflexive_relstr(boole_POSet(X0)),
inference(cnf_transformation,[],[f106]) ).
fof(f304,plain,
! [X0] : ~ empty_carrier(boole_POSet(X0)),
inference(cnf_transformation,[],[f106]) ).
fof(f461,plain,
! [X0] : empty_set = bottom_of_relstr(boole_POSet(X0)),
inference(cnf_transformation,[],[f75]) ).
fof(f465,plain,
element(sK29,powerset(the_carrier(boole_POSet(sK28)))),
inference(cnf_transformation,[],[f221]) ).
fof(f466,plain,
proper_element(sK29,powerset(the_carrier(boole_POSet(sK28)))),
inference(cnf_transformation,[],[f221]) ).
fof(f467,plain,
upper_relstr_subset(sK29,boole_POSet(sK28)),
inference(cnf_transformation,[],[f221]) ).
fof(f468,plain,
filtered_subset(sK29,boole_POSet(sK28)),
inference(cnf_transformation,[],[f221]) ).
fof(f470,plain,
empty(sK30),
inference(cnf_transformation,[],[f221]) ).
fof(f471,plain,
in(sK30,sK29),
inference(cnf_transformation,[],[f221]) ).
fof(f475,plain,
! [X0] :
( ~ empty(X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f183]) ).
fof(f476,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ empty(X1) ),
inference(cnf_transformation,[],[f184]) ).
fof(f478,plain,
! [X0,X1] :
( ~ in(bottom_of_relstr(X0),X1)
| ~ proper_element(X1,powerset(the_carrier(X0)))
| empty(X1)
| ~ filtered_subset(X1,X0)
| ~ upper_relstr_subset(X1,X0)
| ~ element(X1,powerset(the_carrier(X0)))
| empty_carrier(X0)
| ~ reflexive_relstr(X0)
| ~ transitive_relstr(X0)
| ~ antisymmetric_relstr(X0)
| ~ lower_bounded_relstr(X0)
| ~ rel_str(X0) ),
inference(cnf_transformation,[],[f222]) ).
fof(f497,plain,
empty_set = sK30,
inference(resolution,[],[f475,f470]) ).
fof(f500,plain,
in(empty_set,sK29),
inference(superposition,[],[f471,f497]) ).
fof(f917,plain,
! [X0,X1] :
( ~ proper_element(X1,powerset(the_carrier(X0)))
| ~ in(bottom_of_relstr(X0),X1)
| ~ filtered_subset(X1,X0)
| ~ upper_relstr_subset(X1,X0)
| ~ element(X1,powerset(the_carrier(X0)))
| empty_carrier(X0)
| ~ reflexive_relstr(X0)
| ~ transitive_relstr(X0)
| ~ antisymmetric_relstr(X0)
| ~ lower_bounded_relstr(X0)
| ~ rel_str(X0) ),
inference(forward_subsumption_resolution,[],[f478,f476]) ).
fof(f928,plain,
( ~ in(bottom_of_relstr(boole_POSet(sK28)),sK29)
| ~ filtered_subset(sK29,boole_POSet(sK28))
| ~ upper_relstr_subset(sK29,boole_POSet(sK28))
| ~ element(sK29,powerset(the_carrier(boole_POSet(sK28))))
| empty_carrier(boole_POSet(sK28))
| ~ reflexive_relstr(boole_POSet(sK28))
| ~ transitive_relstr(boole_POSet(sK28))
| ~ antisymmetric_relstr(boole_POSet(sK28))
| ~ lower_bounded_relstr(boole_POSet(sK28))
| ~ rel_str(boole_POSet(sK28)) ),
inference(resolution,[],[f917,f466]) ).
fof(f932,plain,
( ~ in(bottom_of_relstr(boole_POSet(sK28)),sK29)
| ~ upper_relstr_subset(sK29,boole_POSet(sK28))
| ~ element(sK29,powerset(the_carrier(boole_POSet(sK28))))
| empty_carrier(boole_POSet(sK28))
| ~ reflexive_relstr(boole_POSet(sK28))
| ~ transitive_relstr(boole_POSet(sK28))
| ~ antisymmetric_relstr(boole_POSet(sK28))
| ~ lower_bounded_relstr(boole_POSet(sK28))
| ~ rel_str(boole_POSet(sK28)) ),
inference(forward_subsumption_resolution,[],[f928,f468]) ).
fof(f934,plain,
( ~ in(bottom_of_relstr(boole_POSet(sK28)),sK29)
| ~ element(sK29,powerset(the_carrier(boole_POSet(sK28))))
| empty_carrier(boole_POSet(sK28))
| ~ reflexive_relstr(boole_POSet(sK28))
| ~ transitive_relstr(boole_POSet(sK28))
| ~ antisymmetric_relstr(boole_POSet(sK28))
| ~ lower_bounded_relstr(boole_POSet(sK28))
| ~ rel_str(boole_POSet(sK28)) ),
inference(forward_subsumption_resolution,[],[f932,f467]) ).
fof(f936,plain,
( ~ in(bottom_of_relstr(boole_POSet(sK28)),sK29)
| empty_carrier(boole_POSet(sK28))
| ~ reflexive_relstr(boole_POSet(sK28))
| ~ transitive_relstr(boole_POSet(sK28))
| ~ antisymmetric_relstr(boole_POSet(sK28))
| ~ lower_bounded_relstr(boole_POSet(sK28))
| ~ rel_str(boole_POSet(sK28)) ),
inference(forward_subsumption_resolution,[],[f934,f465]) ).
fof(f937,plain,
( ~ in(bottom_of_relstr(boole_POSet(sK28)),sK29)
| ~ reflexive_relstr(boole_POSet(sK28))
| ~ transitive_relstr(boole_POSet(sK28))
| ~ antisymmetric_relstr(boole_POSet(sK28))
| ~ lower_bounded_relstr(boole_POSet(sK28))
| ~ rel_str(boole_POSet(sK28)) ),
inference(forward_subsumption_resolution,[],[f936,f304]) ).
fof(f938,plain,
( ~ in(bottom_of_relstr(boole_POSet(sK28)),sK29)
| ~ transitive_relstr(boole_POSet(sK28))
| ~ antisymmetric_relstr(boole_POSet(sK28))
| ~ lower_bounded_relstr(boole_POSet(sK28))
| ~ rel_str(boole_POSet(sK28)) ),
inference(forward_subsumption_resolution,[],[f937,f302]) ).
fof(f939,plain,
( ~ in(bottom_of_relstr(boole_POSet(sK28)),sK29)
| ~ antisymmetric_relstr(boole_POSet(sK28))
| ~ lower_bounded_relstr(boole_POSet(sK28))
| ~ rel_str(boole_POSet(sK28)) ),
inference(forward_subsumption_resolution,[],[f938,f301]) ).
fof(f940,plain,
( ~ in(bottom_of_relstr(boole_POSet(sK28)),sK29)
| ~ lower_bounded_relstr(boole_POSet(sK28))
| ~ rel_str(boole_POSet(sK28)) ),
inference(forward_subsumption_resolution,[],[f939,f300]) ).
fof(f941,plain,
( ~ in(bottom_of_relstr(boole_POSet(sK28)),sK29)
| ~ rel_str(boole_POSet(sK28)) ),
inference(forward_subsumption_resolution,[],[f940,f299]) ).
fof(f942,plain,
~ in(bottom_of_relstr(boole_POSet(sK28)),sK29),
inference(forward_subsumption_resolution,[],[f941,f278]) ).
fof(f943,plain,
~ in(empty_set,sK29),
inference(forward_demodulation,[],[f942,f461]) ).
fof(f944,plain,
$false,
inference(forward_subsumption_resolution,[],[f943,f500]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU387+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.39 % Computer : n015.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Mon Sep 28 05:07:32 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42 Running first-order model finding
% 0.13/0.43 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.47 % (2268714)Will run a generic schedule for satisfiability detection.
% 0.18/0.47 % (2268722)dis+10_1_sil=32000:sp=arity:random_seed=3868874603:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.47 % (2268720)% WARNING: option uhcvi not known.
% 0.18/0.47 % (2268722) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2268714-2268722"...
% 0.18/0.47 % (2268719)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1487422474_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.47 % (2268720)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2615710849:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.47 % (2268724)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=37204962:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.47 % (2268721)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3160118735:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.47 % (2268723)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1780604582:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.47 % (2268725)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1698811827:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.47 % (2268722)...printing done.
% 0.18/0.47 % (2268722)Refutation found. Thanks to Tanya!
% 0.18/0.47 % SZS status Theorem for theBenchmark
% 0.18/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.48 % (2268722)------------------------------
% 0.18/0.48 % (2268722)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.48 % (2268722)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.48 % (2268722)CaDiCaL version: 2.1.3
% 0.18/0.48 % (2268722)Termination reason: Refutation
% 0.18/0.48 % (2268722)Time elapsed: 0.007 s
% 0.18/0.48 % (2268722)Peak memory usage: 12 MB
% 0.18/0.48 % (2268722)Instructions burned: 19 (million)
% 0.18/0.48 % (2268714)Success in time 0.04 s
% 0.18/0.48 % Vampire exiting
%------------------------------------------------------------------------------