%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU394+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 : n003.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:42 PM UTC 2026
% Result : Theorem 2.66s 1.28s
% Output : Refutation 3.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of formulae : 52 ( 13 unt; 0 def)
% Number of atoms : 204 ( 22 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 272 ( 120 ~; 98 |; 44 &)
% ( 1 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 54 ( 50 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f59,axiom,
! [X0] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ~ empty(cast_as_carrier_subset(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc2_pre_topc) ).
fof(f68,axiom,
( empty(empty_set)
& relation(empty_set) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc4_relat_1) ).
fof(f113,axiom,
! [X0] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ! [X1] :
( ( ~ empty(X1)
& filtered_subset(X1,boole_POSet(cast_as_carrier_subset(X0)))
& upper_relstr_subset(X1,boole_POSet(cast_as_carrier_subset(X0)))
& element(X1,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X0))))) )
=> set_difference(X1,singleton(empty_set)) = filter_of_net_str(X0,net_of_bool_filter(X0,cast_as_carrier_subset(X0),X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t14_yellow19) ).
fof(f114,conjecture,
! [X0] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ! [X1] :
( ( ~ empty(X1)
& filtered_subset(X1,boole_POSet(cast_as_carrier_subset(X0)))
& upper_relstr_subset(X1,boole_POSet(cast_as_carrier_subset(X0)))
& proper_element(X1,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X0)))))
& element(X1,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X0))))) )
=> X1 = filter_of_net_str(X0,net_of_bool_filter(X0,cast_as_carrier_subset(X0),X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t15_yellow19) ).
fof(f115,negated_conjecture,
~ ! [X0] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ! [X1] :
( ( ~ empty(X1)
& filtered_subset(X1,boole_POSet(cast_as_carrier_subset(X0)))
& upper_relstr_subset(X1,boole_POSet(cast_as_carrier_subset(X0)))
& proper_element(X1,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X0)))))
& element(X1,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X0))))) )
=> X1 = filter_of_net_str(X0,net_of_bool_filter(X0,cast_as_carrier_subset(X0),X1)) ) ),
inference(negated_conjecture,[status(cth)],[f114]) ).
fof(f119,axiom,
! [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/sandbox/benchmark/theBenchmark.p',t2_yellow19) ).
fof(f125,axiom,
! [X0,X1] :
( set_difference(X0,singleton(X1)) = X0
<=> ~ in(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t65_zfmisc_1) ).
fof(f127,axiom,
! [X0,X1] :
~ ( in(X0,X1)
& empty(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
fof(f147,plain,
? [X0] :
( ? [X1] :
( filter_of_net_str(X0,net_of_bool_filter(X0,cast_as_carrier_subset(X0),X1)) != X1
& ~ empty(X1)
& filtered_subset(X1,boole_POSet(cast_as_carrier_subset(X0)))
& upper_relstr_subset(X1,boole_POSet(cast_as_carrier_subset(X0)))
& proper_element(X1,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X0)))))
& element(X1,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X0))))) )
& ~ empty_carrier(X0)
& one_sorted_str(X0) ),
inference(ennf_transformation,[],[f115]) ).
fof(f148,plain,
? [X0] :
( ? [X1] :
( filter_of_net_str(X0,net_of_bool_filter(X0,cast_as_carrier_subset(X0),X1)) != X1
& ~ empty(X1)
& filtered_subset(X1,boole_POSet(cast_as_carrier_subset(X0)))
& upper_relstr_subset(X1,boole_POSet(cast_as_carrier_subset(X0)))
& proper_element(X1,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X0)))))
& element(X1,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X0))))) )
& ~ empty_carrier(X0)
& one_sorted_str(X0) ),
inference(flattening,[],[f147]) ).
fof(f164,plain,
! [X0] :
( ~ empty(cast_as_carrier_subset(X0))
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(ennf_transformation,[],[f59]) ).
fof(f165,plain,
! [X0] :
( ~ empty(cast_as_carrier_subset(X0))
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(flattening,[],[f164]) ).
fof(f167,plain,
! [X0] :
( ! [X1] :
( set_difference(X1,singleton(empty_set)) = filter_of_net_str(X0,net_of_bool_filter(X0,cast_as_carrier_subset(X0),X1))
| empty(X1)
| ~ filtered_subset(X1,boole_POSet(cast_as_carrier_subset(X0)))
| ~ upper_relstr_subset(X1,boole_POSet(cast_as_carrier_subset(X0)))
| ~ element(X1,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X0))))) )
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(ennf_transformation,[],[f113]) ).
fof(f168,plain,
! [X0] :
( ! [X1] :
( set_difference(X1,singleton(empty_set)) = filter_of_net_str(X0,net_of_bool_filter(X0,cast_as_carrier_subset(X0),X1))
| empty(X1)
| ~ filtered_subset(X1,boole_POSet(cast_as_carrier_subset(X0)))
| ~ upper_relstr_subset(X1,boole_POSet(cast_as_carrier_subset(X0)))
| ~ element(X1,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X0))))) )
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(flattening,[],[f167]) ).
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,[],[f119]) ).
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(f191,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ empty(X1) ),
inference(ennf_transformation,[],[f127]) ).
fof(f212,plain,
( sK1 != filter_of_net_str(sK0,net_of_bool_filter(sK0,cast_as_carrier_subset(sK0),sK1))
& ~ empty(sK1)
& filtered_subset(sK1,boole_POSet(cast_as_carrier_subset(sK0)))
& upper_relstr_subset(sK1,boole_POSet(cast_as_carrier_subset(sK0)))
& proper_element(sK1,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(sK0)))))
& element(sK1,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(sK0)))))
& ~ empty_carrier(sK0)
& one_sorted_str(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f148]) ).
fof(f222,plain,
! [X0,X1] :
( ( set_difference(X0,singleton(X1)) = X0
| in(X1,X0) )
& ( ~ in(X1,X0)
| set_difference(X0,singleton(X1)) != X0 ) ),
inference(nnf_transformation,[],[f125]) ).
fof(f238,plain,
one_sorted_str(sK0),
inference(cnf_transformation,[],[f212]) ).
fof(f239,plain,
~ empty_carrier(sK0),
inference(cnf_transformation,[],[f212]) ).
fof(f240,plain,
element(sK1,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(sK0))))),
inference(cnf_transformation,[],[f212]) ).
fof(f241,plain,
proper_element(sK1,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(sK0))))),
inference(cnf_transformation,[],[f212]) ).
fof(f242,plain,
upper_relstr_subset(sK1,boole_POSet(cast_as_carrier_subset(sK0))),
inference(cnf_transformation,[],[f212]) ).
fof(f243,plain,
filtered_subset(sK1,boole_POSet(cast_as_carrier_subset(sK0))),
inference(cnf_transformation,[],[f212]) ).
fof(f244,plain,
~ empty(sK1),
inference(cnf_transformation,[],[f212]) ).
fof(f245,plain,
sK1 != filter_of_net_str(sK0,net_of_bool_filter(sK0,cast_as_carrier_subset(sK0),sK1)),
inference(cnf_transformation,[],[f212]) ).
fof(f265,plain,
! [X0] :
( ~ empty(cast_as_carrier_subset(X0))
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f165]) ).
fof(f271,plain,
! [X0,X1] :
( set_difference(X1,singleton(empty_set)) = filter_of_net_str(X0,net_of_bool_filter(X0,cast_as_carrier_subset(X0),X1))
| empty(X1)
| ~ filtered_subset(X1,boole_POSet(cast_as_carrier_subset(X0)))
| ~ upper_relstr_subset(X1,boole_POSet(cast_as_carrier_subset(X0)))
| ~ element(X1,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X0)))))
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f168]) ).
fof(f286,plain,
! [X2,X0,X1] :
( ~ 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(cnf_transformation,[],[f178]) ).
fof(f301,plain,
empty(empty_set),
inference(cnf_transformation,[],[f68]) ).
fof(f303,plain,
! [X0,X1] :
( set_difference(X0,singleton(X1)) = X0
| in(X1,X0) ),
inference(cnf_transformation,[],[f222]) ).
fof(f317,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ empty(X1) ),
inference(cnf_transformation,[],[f191]) ).
fof(f541,plain,
! [X2,X0,X1] :
( ~ proper_element(X1,powerset(the_carrier(boole_POSet(X0))))
| ~ empty(X2)
| ~ filtered_subset(X1,boole_POSet(X0))
| ~ upper_relstr_subset(X1,boole_POSet(X0))
| ~ in(X2,X1)
| ~ element(X1,powerset(the_carrier(boole_POSet(X0))))
| empty(X0) ),
inference(forward_subsumption_resolution,[],[f286,f317]) ).
fof(f543,plain,
! [X0] :
( ~ empty(X0)
| ~ filtered_subset(sK1,boole_POSet(cast_as_carrier_subset(sK0)))
| ~ upper_relstr_subset(sK1,boole_POSet(cast_as_carrier_subset(sK0)))
| ~ in(X0,sK1)
| ~ element(sK1,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(sK0)))))
| empty(cast_as_carrier_subset(sK0)) ),
inference(resolution,[],[f541,f241]) ).
fof(f546,plain,
! [X0] :
( ~ empty(X0)
| ~ upper_relstr_subset(sK1,boole_POSet(cast_as_carrier_subset(sK0)))
| ~ in(X0,sK1)
| ~ element(sK1,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(sK0)))))
| empty(cast_as_carrier_subset(sK0)) ),
inference(forward_subsumption_resolution,[],[f543,f243]) ).
fof(f548,plain,
! [X0] :
( ~ empty(X0)
| ~ in(X0,sK1)
| ~ element(sK1,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(sK0)))))
| empty(cast_as_carrier_subset(sK0)) ),
inference(forward_subsumption_resolution,[],[f546,f242]) ).
fof(f550,plain,
! [X0] :
( empty(cast_as_carrier_subset(sK0))
| ~ in(X0,sK1)
| ~ empty(X0) ),
inference(forward_subsumption_resolution,[],[f548,f240]) ).
fof(f552,plain,
! [X0] :
( ~ in(X0,sK1)
| ~ empty(X0)
| empty_carrier(sK0)
| ~ one_sorted_str(sK0) ),
inference(resolution,[],[f550,f265]) ).
fof(f556,plain,
! [X0] :
( ~ in(X0,sK1)
| ~ empty(X0)
| ~ one_sorted_str(sK0) ),
inference(forward_subsumption_resolution,[],[f552,f239]) ).
fof(f557,plain,
! [X0] :
( ~ in(X0,sK1)
| ~ empty(X0) ),
inference(forward_subsumption_resolution,[],[f556,f238]) ).
fof(f677,plain,
( sK1 != set_difference(sK1,singleton(empty_set))
| empty(sK1)
| ~ filtered_subset(sK1,boole_POSet(cast_as_carrier_subset(sK0)))
| ~ upper_relstr_subset(sK1,boole_POSet(cast_as_carrier_subset(sK0)))
| ~ element(sK1,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(sK0)))))
| empty_carrier(sK0)
| ~ one_sorted_str(sK0) ),
inference(superposition,[],[f245,f271]) ).
fof(f688,plain,
( sK1 != set_difference(sK1,singleton(empty_set))
| ~ filtered_subset(sK1,boole_POSet(cast_as_carrier_subset(sK0)))
| ~ upper_relstr_subset(sK1,boole_POSet(cast_as_carrier_subset(sK0)))
| ~ element(sK1,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(sK0)))))
| empty_carrier(sK0)
| ~ one_sorted_str(sK0) ),
inference(forward_subsumption_resolution,[],[f677,f244]) ).
fof(f689,plain,
( sK1 != set_difference(sK1,singleton(empty_set))
| ~ upper_relstr_subset(sK1,boole_POSet(cast_as_carrier_subset(sK0)))
| ~ element(sK1,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(sK0)))))
| empty_carrier(sK0)
| ~ one_sorted_str(sK0) ),
inference(forward_subsumption_resolution,[],[f688,f243]) ).
fof(f690,plain,
( sK1 != set_difference(sK1,singleton(empty_set))
| ~ element(sK1,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(sK0)))))
| empty_carrier(sK0)
| ~ one_sorted_str(sK0) ),
inference(forward_subsumption_resolution,[],[f689,f242]) ).
fof(f691,plain,
( sK1 != set_difference(sK1,singleton(empty_set))
| empty_carrier(sK0)
| ~ one_sorted_str(sK0) ),
inference(forward_subsumption_resolution,[],[f690,f240]) ).
fof(f692,plain,
( sK1 != set_difference(sK1,singleton(empty_set))
| ~ one_sorted_str(sK0) ),
inference(forward_subsumption_resolution,[],[f691,f239]) ).
fof(f693,plain,
sK1 != set_difference(sK1,singleton(empty_set)),
inference(forward_subsumption_resolution,[],[f692,f238]) ).
fof(f695,plain,
( sK1 != sK1
| in(empty_set,sK1) ),
inference(superposition,[],[f693,f303]) ).
fof(f700,plain,
in(empty_set,sK1),
inference(trivial_inequality_removal,[],[f695]) ).
fof(f701,plain,
~ empty(empty_set),
inference(resolution,[],[f700,f557]) ).
fof(f706,plain,
$false,
inference(forward_subsumption_resolution,[],[f701,f301]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU394+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n003.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 28 05:07:12 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/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
% 2.66/1.28 % (1200727)Detected formulas, will run a generic FOF schedule.
% 2.66/1.28 % (1200738)dis-21_1_sil=8000:lcm=predicate:random_seed=2192126789: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)
% 2.66/1.28 % (1200732)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=2116487133:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.66/1.28 % (1200733)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=606478678:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.66/1.28 % (1200736)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=96596703:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.66/1.28 % (1200735)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1011754790:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.66/1.28 % (1200734)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=2472193783:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.66/1.28 % (1200737)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3818699724:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.66/1.28 % (1200735)Refutation not found, incomplete strategy
% 2.66/1.28 % (1200735)------------------------------
% 2.66/1.28 % (1200735)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.66/1.28 % (1200735)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.66/1.28 % (1200735)CaDiCaL version: 2.1.3
% 2.66/1.28 % (1200735)Termination reason: Refutation not found, incomplete strategy
% 2.66/1.28 % (1200735)Time elapsed: 0.005 s
% 2.66/1.28 % (1200735)Peak memory usage: 89 MB
% 2.66/1.28 % (1200735)Instructions burned: 7 (million)
% 2.66/1.28 % (1200736)First to succeed.
% 2.66/1.28 % (1200738)Instruction limit reached!
% 2.66/1.28 % (1200738)------------------------------
% 2.66/1.28 % (1200738)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.66/1.28 % (1200738)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.66/1.28 % (1200738)CaDiCaL version: 2.1.3
% 2.66/1.28 % (1200738)Termination reason: Instruction limit
% 2.66/1.28 % (1200738)Termination phase: Saturation
% 2.66/1.28 % (1200738)Time elapsed: 0.042 s
% 2.66/1.28 % (1200738)Peak memory usage: 91 MB
% 2.66/1.28 % (1200738)Instructions burned: 130 (million)
% 2.66/1.28 % (1200736)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1200727"
% 2.66/1.28 % (1200737)Also succeeded, but the first one will report.
% 2.66/1.28 % (1200746)lrs+10_1_sil=8000:sp=occurrence:random_seed=4204779996:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.66/1.28 % (1200746)Also succeeded, but the first one will report.
% 2.66/1.28 % (1200735)------------------------------
% 2.66/1.28 % (1200735)------------------------------
% 2.66/1.28 % (1200736)Refutation found. Thanks to Tanya!
% 2.66/1.28 % SZS status Theorem for theBenchmark
% 2.66/1.28 % SZS output start Proof for theBenchmark
% See solution above
% 3.54/1.47 % (1200736)------------------------------
% 3.54/1.47 % (1200736)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.54/1.47 % (1200736)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.54/1.47 % (1200736)CaDiCaL version: 2.1.3
% 3.54/1.47 % (1200736)Termination reason: Refutation
% 3.54/1.47 % (1200736)Time elapsed: 0.015 s
% 3.54/1.47 % (1200736)Peak memory usage: 88 MB
% 3.54/1.47 % (1200736)Instructions burned: 22 (million)
% 3.54/1.47 % (1200736)------------------------------
% 3.54/1.47 % (1200736)------------------------------
% 3.54/1.47 % (1200727)Success in time 0.426 s
% 3.54/1.47 % Vampire exiting
%------------------------------------------------------------------------------