%------------------------------------------------------------------------------
% File : Vampire---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 THM
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 12:48:40 PM UTC 2026
% Result : Theorem 1.75s 1.13s
% Output : Refutation 2.58s
% 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(f483,plain,
empty_set = sK30,
inference(resolution,[],[f475,f470]) ).
fof(f484,plain,
in(empty_set,sK29),
inference(superposition,[],[f471,f483]) ).
fof(f533,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(f544,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,[],[f533,f466]) ).
fof(f548,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,[],[f544,f468]) ).
fof(f550,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,[],[f548,f467]) ).
fof(f552,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,[],[f550,f465]) ).
fof(f553,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,[],[f552,f304]) ).
fof(f554,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,[],[f553,f302]) ).
fof(f555,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,[],[f554,f301]) ).
fof(f556,plain,
( ~ in(bottom_of_relstr(boole_POSet(sK28)),sK29)
| ~ lower_bounded_relstr(boole_POSet(sK28))
| ~ rel_str(boole_POSet(sK28)) ),
inference(forward_subsumption_resolution,[],[f555,f300]) ).
fof(f557,plain,
( ~ in(bottom_of_relstr(boole_POSet(sK28)),sK29)
| ~ rel_str(boole_POSet(sK28)) ),
inference(forward_subsumption_resolution,[],[f556,f299]) ).
fof(f558,plain,
~ in(bottom_of_relstr(boole_POSet(sK28)),sK29),
inference(forward_subsumption_resolution,[],[f557,f278]) ).
fof(f559,plain,
~ in(empty_set,sK29),
inference(forward_demodulation,[],[f558,f461]) ).
fof(f560,plain,
$false,
inference(forward_subsumption_resolution,[],[f559,f484]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU387+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n002.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 28 05:06:52 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.75/1.13 % (4160131)Detected formulas, will run a generic FOF schedule.
% 1.75/1.13 % (4160141)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2563988837:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.75/1.13 % (4160141)First to succeed.
% 1.75/1.13 % (4160141)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4160131"
% 1.75/1.13 % (4160136)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=2883345050:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.75/1.13 % (4160139)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4130463088:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.75/1.13 % (4160137)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=225172890:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.75/1.13 % (4160142)dis-21_1_sil=8000:lcm=predicate:random_seed=2947761272: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)
% 1.75/1.13 % (4160138)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=382222835:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.75/1.13 % (4160140)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=837814616:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.75/1.13 % (4160139)Refutation not found, incomplete strategy
% 1.75/1.13 % (4160139)------------------------------
% 1.75/1.13 % (4160139)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.75/1.13 % (4160139)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.75/1.13 % (4160139)CaDiCaL version: 2.1.3
% 1.75/1.13 % (4160139)Termination reason: Refutation not found, incomplete strategy
% 1.75/1.13 % (4160139)Time elapsed: 0.003 s
% 1.75/1.13 % (4160139)Peak memory usage: 88 MB
% 1.75/1.13 % (4160139)Instructions burned: 3 (million)
% 1.75/1.13 % (4160140)Also succeeded, but the first one will report.
% 1.75/1.13 % (4160142)Instruction limit reached!
% 1.75/1.13 % (4160142)------------------------------
% 1.75/1.13 % (4160142)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.75/1.13 % (4160142)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.75/1.13 % (4160142)CaDiCaL version: 2.1.3
% 1.75/1.13 % (4160142)Termination reason: Instruction limit
% 1.75/1.13 % (4160142)Termination phase: Saturation
% 1.75/1.13 % (4160142)Time elapsed: 0.071 s
% 1.75/1.13 % (4160142)Peak memory usage: 91 MB
% 1.75/1.13 % (4160142)Instructions burned: 129 (million)
% 1.75/1.13 % (4160141)Refutation found. Thanks to Tanya!
% 1.75/1.13 % SZS status Theorem for theBenchmark
% 1.75/1.13 % SZS output start Proof for theBenchmark
% See solution above
% 2.58/1.33 % (4160141)------------------------------
% 2.58/1.33 % (4160141)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.58/1.33 % (4160141)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.58/1.33 % (4160141)CaDiCaL version: 2.1.3
% 2.58/1.33 % (4160141)Termination reason: Refutation
% 2.58/1.33 % (4160141)Time elapsed: 0.006 s
% 2.58/1.33 % (4160141)Peak memory usage: 89 MB
% 2.58/1.33 % (4160141)Instructions burned: 14 (million)
% 2.58/1.33 % (4160141)------------------------------
% 2.58/1.33 % (4160141)------------------------------
% 2.58/1.33 % (4160131)Success in time 0.278 s
% 2.58/1.33 % Vampire exiting
%------------------------------------------------------------------------------