%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU325+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 : n016.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:21 PM UTC 2026
% Result : Theorem 2.79s 1.26s
% Output : Refutation 3.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 12
% Syntax : Number of formulae : 74 ( 23 unt; 2 def)
% Number of atoms : 207 ( 32 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 221 ( 88 ~; 77 |; 40 &)
% ( 6 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 3 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-2 aty)
% Number of variables : 82 ( 0 sgn 70 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
! [X0] :
( one_sorted_str(X0)
=> cast_as_carrier_subset(X0) = the_carrier(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_pre_topc) ).
fof(f18,axiom,
! [X0,X1] :
( X1 = union(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] :
( in(X2,X3)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_tarski) ).
fof(f19,axiom,
! [X0] :
( one_sorted_str(X0)
=> ! [X1] :
( element(X1,powerset(powerset(the_carrier(X0))))
=> ( is_a_cover_of_carrier(X0,X1)
<=> cast_as_carrier_subset(X0) = union_of_subsets(the_carrier(X0),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_pre_topc) ).
fof(f29,axiom,
! [X0] :
? [X1] : element(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_m1_subset_1) ).
fof(f32,axiom,
! [X0] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ~ empty(cast_as_carrier_subset(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc2_pre_topc) ).
fof(f33,axiom,
( empty(empty_set)
& v1_membered(empty_set)
& v2_membered(empty_set)
& v3_membered(empty_set)
& v4_membered(empty_set)
& v5_membered(empty_set) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc6_membered) ).
fof(f39,axiom,
! [X0,X1] :
( element(X1,powerset(powerset(X0)))
=> union_of_subsets(X0,X1) = union(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k5_setfam_1) ).
fof(f42,axiom,
! [X0,X1] :
( element(X0,X1)
=> ( empty(X1)
| in(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).
fof(f46,conjecture,
! [X0] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ! [X1] :
( element(X1,powerset(powerset(the_carrier(X0))))
=> ~ ( is_a_cover_of_carrier(X0,X1)
& X1 = empty_set ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_tops_2) ).
fof(f47,negated_conjecture,
~ ! [X0] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ! [X1] :
( element(X1,powerset(powerset(the_carrier(X0))))
=> ~ ( is_a_cover_of_carrier(X0,X1)
& X1 = empty_set ) ) ),
inference(negated_conjecture,[status(cth)],[f46]) ).
fof(f49,axiom,
! [X0,X1] :
~ ( in(X0,X1)
& empty(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_boole) ).
fof(f79,plain,
! [X0] :
( cast_as_carrier_subset(X0) = the_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(ennf_transformation,[],[f17]) ).
fof(f80,plain,
! [X0] :
( ! [X1] :
( ( is_a_cover_of_carrier(X0,X1)
<=> cast_as_carrier_subset(X0) = union_of_subsets(the_carrier(X0),X1) )
| ~ element(X1,powerset(powerset(the_carrier(X0)))) )
| ~ one_sorted_str(X0) ),
inference(ennf_transformation,[],[f19]) ).
fof(f85,plain,
! [X0] :
( ~ empty(cast_as_carrier_subset(X0))
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(ennf_transformation,[],[f32]) ).
fof(f86,plain,
! [X0] :
( ~ empty(cast_as_carrier_subset(X0))
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(flattening,[],[f85]) ).
fof(f90,plain,
! [X0,X1] :
( union_of_subsets(X0,X1) = union(X1)
| ~ element(X1,powerset(powerset(X0))) ),
inference(ennf_transformation,[],[f39]) ).
fof(f92,plain,
! [X0,X1] :
( empty(X1)
| in(X0,X1)
| ~ element(X0,X1) ),
inference(ennf_transformation,[],[f42]) ).
fof(f93,plain,
! [X0,X1] :
( empty(X1)
| in(X0,X1)
| ~ element(X0,X1) ),
inference(flattening,[],[f92]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( is_a_cover_of_carrier(X0,X1)
& X1 = empty_set
& element(X1,powerset(powerset(the_carrier(X0)))) )
& ~ empty_carrier(X0)
& one_sorted_str(X0) ),
inference(ennf_transformation,[],[f47]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( is_a_cover_of_carrier(X0,X1)
& X1 = empty_set
& element(X1,powerset(powerset(the_carrier(X0)))) )
& ~ empty_carrier(X0)
& one_sorted_str(X0) ),
inference(flattening,[],[f98]) ).
fof(f101,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ empty(X1) ),
inference(ennf_transformation,[],[f49]) ).
fof(f103,plain,
! [X0,X1] :
( ( X1 = union(X0)
| ? [X2] :
( ( ! [X3] :
( ~ in(X2,X3)
| ~ in(X3,X0) )
| ~ in(X2,X1) )
& ( ? [X3] :
( in(X2,X3)
& in(X3,X0) )
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ! [X3] :
( ~ in(X2,X3)
| ~ in(X3,X0) ) )
& ( ? [X3] :
( in(X2,X3)
& in(X3,X0) )
| ~ in(X2,X1) ) )
| union(X0) != X1 ) ),
inference(nnf_transformation,[],[f18]) ).
fof(f104,plain,
! [X0,X1] :
( ( X1 = union(X0)
| ? [X2] :
( ( ! [X3] :
( ~ in(X2,X3)
| ~ in(X3,X0) )
| ~ in(X2,X1) )
& ( ? [X4] :
( in(X2,X4)
& in(X4,X0) )
| in(X2,X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] :
( ~ in(X5,X6)
| ~ in(X6,X0) ) )
& ( ? [X7] :
( in(X5,X7)
& in(X7,X0) )
| ~ in(X5,X1) ) )
| union(X0) != X1 ) ),
inference(rectify,[],[f103]) ).
fof(f105,plain,
! [X0,X1] :
( ( X1 = union(X0)
| ( ( ! [X3] :
( ~ in(sK0(X0,X1),X3)
| ~ in(X3,X0) )
| ~ in(sK0(X0,X1),X1) )
& ( ( in(sK0(X0,X1),sK1(X0,X1))
& in(sK1(X0,X1),X0) )
| in(sK0(X0,X1),X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] :
( ~ in(X5,X6)
| ~ in(X6,X0) ) )
& ( ( in(X5,sK2(X0,X5))
& in(sK2(X0,X5),X0) )
| ~ in(X5,X1) ) )
| union(X0) != X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X2,sK0(X0,X1)),skolemize(X4,sK1(X0,X1)),skolemize(X7,sK2(X0,X5))],[f104]) ).
fof(f106,plain,
! [X0] :
( ! [X1] :
( ( ( is_a_cover_of_carrier(X0,X1)
| cast_as_carrier_subset(X0) != union_of_subsets(the_carrier(X0),X1) )
& ( cast_as_carrier_subset(X0) = union_of_subsets(the_carrier(X0),X1)
| ~ is_a_cover_of_carrier(X0,X1) ) )
| ~ element(X1,powerset(powerset(the_carrier(X0)))) )
| ~ one_sorted_str(X0) ),
inference(nnf_transformation,[],[f80]) ).
fof(f108,plain,
! [X0] : element(sK4(X0),X0),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X1,sK4(X0))],[f29]) ).
fof(f114,plain,
( is_a_cover_of_carrier(sK10,sK11)
& empty_set = sK11
& element(sK11,powerset(powerset(the_carrier(sK10))))
& ~ empty_carrier(sK10)
& one_sorted_str(sK10) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11]),skolemize(X0,sK10),skolemize(X1,sK11)],[f99]) ).
fof(f140,plain,
! [X0] :
( cast_as_carrier_subset(X0) = the_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f79]) ).
fof(f141,plain,
! [X0,X1,X5] :
( in(sK2(X0,X5),X0)
| ~ in(X5,X1)
| union(X0) != X1 ),
inference(cnf_transformation,[],[f105]) ).
fof(f147,plain,
! [X0,X1] :
( ~ is_a_cover_of_carrier(X0,X1)
| cast_as_carrier_subset(X0) = union_of_subsets(the_carrier(X0),X1)
| ~ element(X1,powerset(powerset(the_carrier(X0))))
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f152,plain,
! [X0] : element(sK4(X0),X0),
inference(cnf_transformation,[],[f108]) ).
fof(f155,plain,
! [X0] :
( ~ empty(cast_as_carrier_subset(X0))
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f86]) ).
fof(f161,plain,
empty(empty_set),
inference(cnf_transformation,[],[f33]) ).
fof(f176,plain,
! [X0,X1] :
( union_of_subsets(X0,X1) = union(X1)
| ~ element(X1,powerset(powerset(X0))) ),
inference(cnf_transformation,[],[f90]) ).
fof(f179,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(cnf_transformation,[],[f93]) ).
fof(f183,plain,
one_sorted_str(sK10),
inference(cnf_transformation,[],[f114]) ).
fof(f184,plain,
~ empty_carrier(sK10),
inference(cnf_transformation,[],[f114]) ).
fof(f185,plain,
element(sK11,powerset(powerset(the_carrier(sK10)))),
inference(cnf_transformation,[],[f114]) ).
fof(f186,plain,
empty_set = sK11,
inference(cnf_transformation,[],[f114]) ).
fof(f187,plain,
is_a_cover_of_carrier(sK10,sK11),
inference(cnf_transformation,[],[f114]) ).
fof(f189,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ empty(X1) ),
inference(cnf_transformation,[],[f101]) ).
fof(f193,plain,
! [X0,X5] :
( ~ in(X5,union(X0))
| in(sK2(X0,X5),X0) ),
inference(equality_resolution,[],[f141]) ).
fof(f194,plain,
is_a_cover_of_carrier(sK10,empty_set),
inference(forward_demodulation,[],[f187,f186]) ).
fof(f195,plain,
element(empty_set,powerset(powerset(the_carrier(sK10)))),
inference(forward_demodulation,[],[f185,f186]) ).
fof(f261,plain,
( cast_as_carrier_subset(sK10) = union_of_subsets(the_carrier(sK10),empty_set)
| ~ element(empty_set,powerset(powerset(the_carrier(sK10))))
| ~ one_sorted_str(sK10) ),
inference(resolution,[],[f147,f194]) ).
fof(f262,plain,
( cast_as_carrier_subset(sK10) = union_of_subsets(the_carrier(sK10),empty_set)
| ~ one_sorted_str(sK10) ),
inference(forward_subsumption_resolution,[],[f261,f195]) ).
fof(f263,plain,
cast_as_carrier_subset(sK10) = union_of_subsets(the_carrier(sK10),empty_set),
inference(forward_subsumption_resolution,[],[f262,f183]) ).
fof(f265,plain,
( cast_as_carrier_subset(sK10) = union(empty_set)
| ~ element(empty_set,powerset(powerset(the_carrier(sK10)))) ),
inference(superposition,[],[f176,f263]) ).
fof(f268,plain,
cast_as_carrier_subset(sK10) = union(empty_set),
inference(forward_subsumption_resolution,[],[f265,f195]) ).
fof(f274,plain,
( ~ empty(union(empty_set))
| empty_carrier(sK10)
| ~ one_sorted_str(sK10) ),
inference(superposition,[],[f155,f268]) ).
fof(f275,plain,
( the_carrier(sK10) = union(empty_set)
| ~ one_sorted_str(sK10) ),
inference(superposition,[],[f140,f268]) ).
fof(f276,plain,
the_carrier(sK10) = union(empty_set),
inference(forward_subsumption_resolution,[],[f275,f183]) ).
fof(f277,plain,
( ~ empty(union(empty_set))
| ~ one_sorted_str(sK10) ),
inference(forward_subsumption_resolution,[],[f274,f184]) ).
fof(f280,plain,
~ empty(union(empty_set)),
inference(forward_subsumption_resolution,[],[f277,f183]) ).
fof(f290,plain,
~ empty(the_carrier(sK10)),
inference(superposition,[],[f280,f276]) ).
fof(f293,plain,
! [X0] :
( ~ in(X0,the_carrier(sK10))
| in(sK2(empty_set,X0),empty_set) ),
inference(superposition,[],[f193,f276]) ).
fof(f297,definition,
( spl12_1
<=> empty(the_carrier(sK10)) ),
introduced(definition,[new_symbols(definition,[spl12_1])],[avatar_definition]) ).
fof(f298,plain,
( ~ empty(the_carrier(sK10))
| spl12_1 ),
inference(avatar_component_clause,[],[f297]) ).
fof(f304,plain,
~ spl12_1,
inference(avatar_split_clause,[],[f290,f297]) ).
fof(f310,definition,
( spl12_3
<=> ! [X0] :
( ~ element(X0,the_carrier(sK10))
| in(sK2(empty_set,X0),empty_set) ) ),
introduced(definition,[new_symbols(definition,[spl12_3])],[avatar_definition]) ).
fof(f311,plain,
( ! [X0] :
( ~ element(X0,the_carrier(sK10))
| in(sK2(empty_set,X0),empty_set) )
| ~ spl12_3 ),
inference(avatar_component_clause,[],[f310]) ).
fof(f332,plain,
! [X0] :
( in(sK2(empty_set,X0),empty_set)
| empty(the_carrier(sK10))
| ~ element(X0,the_carrier(sK10)) ),
inference(resolution,[],[f293,f179]) ).
fof(f334,plain,
( ! [X0] :
( in(sK2(empty_set,X0),empty_set)
| ~ element(X0,the_carrier(sK10)) )
| spl12_1 ),
inference(forward_subsumption_resolution,[],[f332,f298]) ).
fof(f335,plain,
( spl12_3
| spl12_1 ),
inference(avatar_split_clause,[],[f334,f297,f310]) ).
fof(f365,plain,
( in(sK2(empty_set,sK4(the_carrier(sK10))),empty_set)
| ~ spl12_3 ),
inference(resolution,[],[f311,f152]) ).
fof(f379,plain,
( ~ empty(empty_set)
| ~ spl12_3 ),
inference(resolution,[],[f365,f189]) ).
fof(f398,plain,
( $false
| ~ spl12_3 ),
inference(forward_subsumption_resolution,[],[f379,f161]) ).
fof(f399,plain,
~ spl12_3,
inference(avatar_contradiction_clause,[],[f398]) ).
cnf(s2,plain,
~ spl12_1,
inference(sat_conversion,[],[f304]) ).
cnf(s4,plain,
( spl12_1
| spl12_3 ),
inference(sat_conversion,[],[f335]) ).
cnf(s8,plain,
~ spl12_3,
inference(sat_conversion,[],[f399]) ).
cnf(s10,plain,
spl12_1,
inference(rat,[],[s4,s8]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s2,s10]) ).
fof(f405,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU325+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.37 % Computer : n016.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 04:47:48 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 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
% 2.79/1.26 % (3263785)Detected formulas, will run a generic FOF schedule.
% 2.79/1.26 % (3263791)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=4159372221:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.79/1.26 % (3263795)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1035629081:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.79/1.26 % (3263794)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1430783834:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.79/1.26 % (3263796)dis-21_1_sil=8000:lcm=predicate:random_seed=545406087: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.79/1.26 % (3263793)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1315182244:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.79/1.26 % (3263790)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=3881915995:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.79/1.26 % (3263792)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=3762498419:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.79/1.26 % (3263793)Refutation not found, incomplete strategy
% 2.79/1.26 % (3263793)------------------------------
% 2.79/1.26 % (3263793)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.79/1.26 % (3263793)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/1.26 % (3263793)CaDiCaL version: 2.1.3
% 2.79/1.26 % (3263793)Termination reason: Refutation not found, incomplete strategy
% 2.79/1.26 % (3263793)Time elapsed: 0.001 s
% 2.79/1.26 % (3263793)Peak memory usage: 88 MB
% 2.79/1.26 % (3263793)Instructions burned: 1 (million)
% 2.79/1.26 % (3263795)First to succeed.
% 2.79/1.26 % (3263795)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3263785"
% 2.79/1.26 % (3263794)Refutation not found, incomplete strategy
% 2.79/1.26 % (3263794)------------------------------
% 2.79/1.26 % (3263794)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.79/1.26 % (3263794)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/1.26 % (3263794)CaDiCaL version: 2.1.3
% 2.79/1.26 % (3263794)Termination reason: Refutation not found, incomplete strategy
% 2.79/1.26 % (3263794)Time elapsed: 0.018 s
% 2.79/1.26 % (3263794)Peak memory usage: 88 MB
% 2.79/1.26 % (3263794)Instructions burned: 31 (million)
% 2.79/1.26 % (3263796)Instruction limit reached!
% 2.79/1.26 % (3263796)------------------------------
% 2.79/1.26 % (3263796)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.79/1.26 % (3263796)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/1.26 % (3263796)CaDiCaL version: 2.1.3
% 2.79/1.26 % (3263796)Termination reason: Instruction limit
% 2.79/1.26 % (3263796)Termination phase: Saturation
% 2.79/1.26 % (3263796)Time elapsed: 0.077 s
% 2.79/1.26 % (3263796)Peak memory usage: 90 MB
% 2.79/1.26 % (3263796)Instructions burned: 129 (million)
% 2.79/1.26 % (3263804)lrs+10_1_sil=8000:sp=occurrence:random_seed=4203733702:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.79/1.26 % (3263804)Also succeeded, but the first one will report.
% 2.79/1.26 % (3263793)------------------------------
% 2.79/1.26 % (3263793)------------------------------
% 2.79/1.26 % (3263794)------------------------------
% 2.79/1.26 % (3263794)------------------------------
% 2.79/1.26 % (3263795)Refutation found. Thanks to Tanya!
% 2.79/1.26 % SZS status Theorem for theBenchmark
% 2.79/1.26 % SZS output start Proof for theBenchmark
% See solution above
% 3.44/1.35 % (3263795)------------------------------
% 3.44/1.35 % (3263795)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.44/1.35 % (3263795)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.44/1.35 % (3263795)CaDiCaL version: 2.1.3
% 3.44/1.35 % (3263795)Termination reason: Refutation
% 3.44/1.36 % (3263795)Time elapsed: 0.015 s
% 3.44/1.36 % (3263795)Peak memory usage: 89 MB
% 3.44/1.36 % (3263795)Instructions burned: 15 (million)
% 3.44/1.36 % (3263795)------------------------------
% 3.44/1.36 % (3263795)------------------------------
% 3.44/1.36 % (3263785)Success in time 0.42 s
% 3.44/1.36 % Vampire exiting
%------------------------------------------------------------------------------