%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU353+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 : n005.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:29 PM UTC 2026
% Result : Theorem 2.46s 1.33s
% Output : Refutation 3.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 72 ( 13 unt; 3 def)
% Number of atoms : 196 ( 33 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 216 ( 92 ~; 89 |; 21 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 4 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-4 aty)
% Number of variables : 81 ( 0 sgn 77 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0] :
( one_sorted_str(X0)
=> identity_on_carrier(X0) = identity_as_relation_of(the_carrier(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d11_grcat_1) ).
fof(f17,axiom,
! [X0] :
( one_sorted_str(X0)
=> ( function(identity_on_carrier(X0))
& quasi_total(identity_on_carrier(X0),the_carrier(X0),the_carrier(X0))
& relation_of2_as_subset(identity_on_carrier(X0),the_carrier(X0),the_carrier(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k7_grcat_1) ).
fof(f28,axiom,
! [X0] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ~ empty(the_carrier(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_struct_0) ).
fof(f44,axiom,
! [X0] : identity_as_relation_of(X0) = identity_relation(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k6_partfun1) ).
fof(f45,axiom,
! [X0,X1,X2,X3] :
( ( ~ empty(X0)
& function(X2)
& quasi_total(X2,X0,X1)
& relation_of2(X2,X0,X1)
& element(X3,X0) )
=> apply_as_element(X0,X1,X2,X3) = apply(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k8_funct_2) ).
fof(f46,axiom,
! [X0,X1,X2] :
( relation_of2_as_subset(X2,X0,X1)
<=> relation_of2(X2,X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_m2_relset_1) ).
fof(f49,axiom,
! [X0,X1] :
( element(X0,X1)
=> ( empty(X1)
| in(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).
fof(f50,axiom,
! [X0,X1] :
( in(X1,X0)
=> apply(identity_relation(X0),X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t35_funct_1) ).
fof(f57,conjecture,
! [X0] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ! [X1] :
( element(X1,the_carrier(X0))
=> apply_as_element(the_carrier(X0),the_carrier(X0),identity_on_carrier(X0),X1) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t91_tmap_1) ).
fof(f58,negated_conjecture,
~ ! [X0] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ! [X1] :
( element(X1,the_carrier(X0))
=> apply_as_element(the_carrier(X0),the_carrier(X0),identity_on_carrier(X0),X1) = X1 ) ),
inference(negated_conjecture,[status(cth)],[f57]) ).
fof(f79,plain,
! [X0] :
( identity_on_carrier(X0) = identity_as_relation_of(the_carrier(X0))
| ~ one_sorted_str(X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f80,plain,
! [X0] :
( ( function(identity_on_carrier(X0))
& quasi_total(identity_on_carrier(X0),the_carrier(X0),the_carrier(X0))
& relation_of2_as_subset(identity_on_carrier(X0),the_carrier(X0),the_carrier(X0)) )
| ~ one_sorted_str(X0) ),
inference(ennf_transformation,[],[f17]) ).
fof(f84,plain,
! [X0] :
( ~ empty(the_carrier(X0))
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f85,plain,
! [X0] :
( ~ empty(the_carrier(X0))
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(flattening,[],[f84]) ).
fof(f91,plain,
! [X0,X1,X2,X3] :
( apply_as_element(X0,X1,X2,X3) = apply(X2,X3)
| empty(X0)
| ~ function(X2)
| ~ quasi_total(X2,X0,X1)
| ~ relation_of2(X2,X0,X1)
| ~ element(X3,X0) ),
inference(ennf_transformation,[],[f45]) ).
fof(f92,plain,
! [X0,X1,X2,X3] :
( apply_as_element(X0,X1,X2,X3) = apply(X2,X3)
| empty(X0)
| ~ function(X2)
| ~ quasi_total(X2,X0,X1)
| ~ relation_of2(X2,X0,X1)
| ~ element(X3,X0) ),
inference(flattening,[],[f91]) ).
fof(f94,plain,
! [X0,X1] :
( empty(X1)
| in(X0,X1)
| ~ element(X0,X1) ),
inference(ennf_transformation,[],[f49]) ).
fof(f95,plain,
! [X0,X1] :
( empty(X1)
| in(X0,X1)
| ~ element(X0,X1) ),
inference(flattening,[],[f94]) ).
fof(f96,plain,
! [X0,X1] :
( apply(identity_relation(X0),X1) = X1
| ~ in(X1,X0) ),
inference(ennf_transformation,[],[f50]) ).
fof(f104,plain,
? [X0] :
( ? [X1] :
( apply_as_element(the_carrier(X0),the_carrier(X0),identity_on_carrier(X0),X1) != X1
& element(X1,the_carrier(X0)) )
& ~ empty_carrier(X0)
& one_sorted_str(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f105,plain,
? [X0] :
( ? [X1] :
( apply_as_element(the_carrier(X0),the_carrier(X0),identity_on_carrier(X0),X1) != X1
& element(X1,the_carrier(X0)) )
& ~ empty_carrier(X0)
& one_sorted_str(X0) ),
inference(flattening,[],[f104]) ).
fof(f121,plain,
! [X0,X1,X2] :
( ( relation_of2_as_subset(X2,X0,X1)
| ~ relation_of2(X2,X0,X1) )
& ( relation_of2(X2,X0,X1)
| ~ relation_of2_as_subset(X2,X0,X1) ) ),
inference(nnf_transformation,[],[f46]) ).
fof(f122,plain,
( sK16 != apply_as_element(the_carrier(sK15),the_carrier(sK15),identity_on_carrier(sK15),sK16)
& element(sK16,the_carrier(sK15))
& ~ empty_carrier(sK15)
& one_sorted_str(sK15) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK15,sK16]),skolemize(X0,sK15),skolemize(X1,sK16)],[f105]) ).
fof(f148,plain,
! [X0] :
( identity_on_carrier(X0) = identity_as_relation_of(the_carrier(X0))
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f79]) ).
fof(f152,plain,
! [X0] :
( relation_of2_as_subset(identity_on_carrier(X0),the_carrier(X0),the_carrier(X0))
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f80]) ).
fof(f153,plain,
! [X0] :
( quasi_total(identity_on_carrier(X0),the_carrier(X0),the_carrier(X0))
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f80]) ).
fof(f154,plain,
! [X0] :
( function(identity_on_carrier(X0))
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f80]) ).
fof(f161,plain,
! [X0] :
( ~ empty(the_carrier(X0))
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f85]) ).
fof(f204,plain,
! [X0] : identity_as_relation_of(X0) = identity_relation(X0),
inference(cnf_transformation,[],[f44]) ).
fof(f205,plain,
! [X2,X3,X0,X1] :
( ~ relation_of2(X2,X0,X1)
| empty(X0)
| ~ function(X2)
| ~ quasi_total(X2,X0,X1)
| apply_as_element(X0,X1,X2,X3) = apply(X2,X3)
| ~ element(X3,X0) ),
inference(cnf_transformation,[],[f92]) ).
fof(f206,plain,
! [X2,X0,X1] :
( relation_of2(X2,X0,X1)
| ~ relation_of2_as_subset(X2,X0,X1) ),
inference(cnf_transformation,[],[f121]) ).
fof(f210,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(cnf_transformation,[],[f95]) ).
fof(f211,plain,
! [X0,X1] :
( ~ in(X1,X0)
| apply(identity_relation(X0),X1) = X1 ),
inference(cnf_transformation,[],[f96]) ).
fof(f218,plain,
one_sorted_str(sK15),
inference(cnf_transformation,[],[f122]) ).
fof(f219,plain,
~ empty_carrier(sK15),
inference(cnf_transformation,[],[f122]) ).
fof(f220,plain,
element(sK16,the_carrier(sK15)),
inference(cnf_transformation,[],[f122]) ).
fof(f221,plain,
sK16 != apply_as_element(the_carrier(sK15),the_carrier(sK15),identity_on_carrier(sK15),sK16),
inference(cnf_transformation,[],[f122]) ).
fof(f231,plain,
! [X0] :
( ~ one_sorted_str(X0)
| identity_on_carrier(X0) = identity_relation(the_carrier(X0)) ),
inference(forward_demodulation,[],[f148,f204]) ).
fof(f232,plain,
identity_on_carrier(sK15) = identity_relation(the_carrier(sK15)),
inference(resolution,[],[f231,f218]) ).
fof(f240,plain,
! [X0,X1] :
( apply(identity_relation(X0),X1) = X1
| empty(X0)
| ~ element(X1,X0) ),
inference(resolution,[],[f211,f210]) ).
fof(f293,plain,
! [X2,X3,X0,X1] :
( ~ quasi_total(X0,X1,X2)
| empty(X1)
| ~ function(X0)
| ~ relation_of2_as_subset(X0,X1,X2)
| apply_as_element(X1,X2,X0,X3) = apply(X0,X3)
| ~ element(X3,X1) ),
inference(resolution,[],[f206,f205]) ).
fof(f294,plain,
! [X0] :
( apply(identity_on_carrier(sK15),X0) = X0
| empty(the_carrier(sK15))
| ~ element(X0,the_carrier(sK15)) ),
inference(superposition,[],[f240,f232]) ).
fof(f314,definition,
( spl17_5
<=> empty(the_carrier(sK15)) ),
introduced(definition,[new_symbols(definition,[spl17_5])],[avatar_definition]) ).
fof(f315,plain,
( ~ empty(the_carrier(sK15))
| spl17_5 ),
inference(avatar_component_clause,[],[f314]) ).
fof(f316,plain,
( empty(the_carrier(sK15))
| ~ spl17_5 ),
inference(avatar_component_clause,[],[f314]) ).
fof(f318,definition,
( spl17_6
<=> ! [X0] :
( apply(identity_on_carrier(sK15),X0) = X0
| ~ element(X0,the_carrier(sK15)) ) ),
introduced(definition,[new_symbols(definition,[spl17_6])],[avatar_definition]) ).
fof(f319,plain,
( ! [X0] :
( apply(identity_on_carrier(sK15),X0) = X0
| ~ element(X0,the_carrier(sK15)) )
| ~ spl17_6 ),
inference(avatar_component_clause,[],[f318]) ).
fof(f320,plain,
( spl17_5
| spl17_6 ),
inference(avatar_split_clause,[],[f294,f318,f314]) ).
fof(f321,plain,
( empty_carrier(sK15)
| ~ one_sorted_str(sK15)
| ~ spl17_5 ),
inference(resolution,[],[f316,f161]) ).
fof(f326,plain,
( ~ one_sorted_str(sK15)
| ~ spl17_5 ),
inference(forward_subsumption_resolution,[],[f321,f219]) ).
fof(f327,plain,
( $false
| ~ spl17_5 ),
inference(forward_subsumption_resolution,[],[f326,f218]) ).
fof(f328,plain,
~ spl17_5,
inference(avatar_contradiction_clause,[],[f327]) ).
fof(f489,plain,
! [X0,X1] :
( empty(the_carrier(X0))
| ~ function(identity_on_carrier(X0))
| ~ relation_of2_as_subset(identity_on_carrier(X0),the_carrier(X0),the_carrier(X0))
| apply_as_element(the_carrier(X0),the_carrier(X0),identity_on_carrier(X0),X1) = apply(identity_on_carrier(X0),X1)
| ~ element(X1,the_carrier(X0))
| ~ one_sorted_str(X0) ),
inference(resolution,[],[f293,f153]) ).
fof(f494,plain,
! [X0,X1] :
( empty(the_carrier(X0))
| ~ relation_of2_as_subset(identity_on_carrier(X0),the_carrier(X0),the_carrier(X0))
| apply_as_element(the_carrier(X0),the_carrier(X0),identity_on_carrier(X0),X1) = apply(identity_on_carrier(X0),X1)
| ~ element(X1,the_carrier(X0))
| ~ one_sorted_str(X0) ),
inference(forward_subsumption_resolution,[],[f489,f154]) ).
fof(f496,plain,
! [X0,X1] :
( ~ one_sorted_str(X0)
| apply_as_element(the_carrier(X0),the_carrier(X0),identity_on_carrier(X0),X1) = apply(identity_on_carrier(X0),X1)
| ~ element(X1,the_carrier(X0))
| empty(the_carrier(X0)) ),
inference(forward_subsumption_resolution,[],[f494,f152]) ).
fof(f562,plain,
! [X0] :
( apply(identity_on_carrier(sK15),X0) = apply_as_element(the_carrier(sK15),the_carrier(sK15),identity_on_carrier(sK15),X0)
| ~ element(X0,the_carrier(sK15))
| empty(the_carrier(sK15)) ),
inference(resolution,[],[f496,f218]) ).
fof(f569,plain,
( ! [X0] :
( apply(identity_on_carrier(sK15),X0) = apply_as_element(the_carrier(sK15),the_carrier(sK15),identity_on_carrier(sK15),X0)
| ~ element(X0,the_carrier(sK15)) )
| spl17_5 ),
inference(forward_subsumption_resolution,[],[f562,f315]) ).
fof(f614,definition,
( spl17_20
<=> ! [X0] :
( apply(identity_on_carrier(sK15),X0) = apply_as_element(the_carrier(sK15),the_carrier(sK15),identity_on_carrier(sK15),X0)
| ~ element(X0,the_carrier(sK15)) ) ),
introduced(definition,[new_symbols(definition,[spl17_20])],[avatar_definition]) ).
fof(f615,plain,
( ! [X0] :
( apply(identity_on_carrier(sK15),X0) = apply_as_element(the_carrier(sK15),the_carrier(sK15),identity_on_carrier(sK15),X0)
| ~ element(X0,the_carrier(sK15)) )
| ~ spl17_20 ),
inference(avatar_component_clause,[],[f614]) ).
fof(f637,plain,
( spl17_20
| spl17_5 ),
inference(avatar_split_clause,[],[f569,f314,f614]) ).
fof(f639,plain,
( sK16 != apply(identity_on_carrier(sK15),sK16)
| ~ element(sK16,the_carrier(sK15))
| ~ spl17_20 ),
inference(superposition,[],[f221,f615]) ).
fof(f643,plain,
( ~ element(sK16,the_carrier(sK15))
| ~ spl17_6
| ~ spl17_20 ),
inference(forward_subsumption_resolution,[],[f639,f319]) ).
fof(f645,plain,
( $false
| ~ spl17_6
| ~ spl17_20 ),
inference(forward_subsumption_resolution,[],[f643,f220]) ).
fof(f646,plain,
( ~ spl17_6
| ~ spl17_20 ),
inference(avatar_contradiction_clause,[],[f645]) ).
cnf(s3,plain,
( spl17_5
| spl17_6 ),
inference(sat_conversion,[],[f320]) ).
cnf(s4,plain,
~ spl17_5,
inference(sat_conversion,[],[f328]) ).
cnf(s19,plain,
( spl17_5
| spl17_20 ),
inference(sat_conversion,[],[f637]) ).
cnf(s20,plain,
( ~ spl17_6
| ~ spl17_20 ),
inference(sat_conversion,[],[f646]) ).
cnf(s27,plain,
spl17_20,
inference(rat,[],[s19,s4]) ).
cnf(s28,plain,
~ spl17_6,
inference(rat,[],[s20,s27]) ).
cnf(s29,plain,
$false,
inference(rat,[],[s3,s28,s4]) ).
fof(f652,plain,
$false,
inference(avatar_sat_refutation,[],[s29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU353+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.11/0.39 % Computer : n005.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Mon Sep 28 04:51:02 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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.46/1.33 % (440395)Detected formulas, will run a generic FOF schedule.
% 2.46/1.33 % (440402)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=4008527855:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.46/1.33 % (440401)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=740391854:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.46/1.33 % (440405)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1263981524:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.46/1.33 % (440403)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=405512048:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.46/1.33 % (440404)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=677074330:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.46/1.33 % (440406)dis-21_1_sil=8000:lcm=predicate:random_seed=84267950: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.46/1.33 % (440400)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=947572549:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.46/1.33 % (440403)Refutation not found, incomplete strategy
% 2.46/1.33 % (440403)------------------------------
% 2.46/1.33 % (440403)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.46/1.33 % (440403)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.46/1.33 % (440403)CaDiCaL version: 2.1.3
% 2.46/1.33 % (440403)Termination reason: Refutation not found, incomplete strategy
% 2.46/1.33 % (440403)Time elapsed: 0.002 s
% 2.46/1.33 % (440403)Peak memory usage: 88 MB
% 2.46/1.33 % (440404)Refutation not found, incomplete strategy
% 2.46/1.33 % (440404)------------------------------
% 2.46/1.33 % (440404)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.46/1.33 % (440404)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.46/1.33 % (440404)CaDiCaL version: 2.1.3
% 2.46/1.33 % (440404)Termination reason: Refutation not found, incomplete strategy
% 2.46/1.33 % (440404)Time elapsed: 0.003 s
% 2.46/1.33 % (440404)Peak memory usage: 88 MB
% 2.46/1.33 % (440404)Instructions burned: 3 (million)
% 2.46/1.33 % (440405)First to succeed.
% 2.46/1.33 % (440405)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-440395"
% 2.46/1.33 % (440406)Instruction limit reached!
% 2.46/1.33 % (440406)------------------------------
% 2.46/1.33 % (440406)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.46/1.33 % (440406)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.46/1.33 % (440406)CaDiCaL version: 2.1.3
% 2.46/1.33 % (440406)Termination reason: Instruction limit
% 2.46/1.33 % (440406)Termination phase: Saturation
% 2.46/1.33 % (440406)Time elapsed: 0.078 s
% 2.46/1.33 % (440406)Peak memory usage: 91 MB
% 2.46/1.33 % (440406)Instructions burned: 131 (million)
% 2.46/1.33 % (440403)------------------------------
% 2.46/1.33 % (440403)------------------------------
% 2.46/1.33 % (440404)------------------------------
% 2.46/1.33 % (440404)------------------------------
% 2.46/1.33 % (440414)lrs+10_1_sil=8000:sp=occurrence:random_seed=727237442:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.46/1.33 % (440414)Also succeeded, but the first one will report.
% 2.46/1.33 % (440405)Refutation found. Thanks to Tanya!
% 2.46/1.33 % SZS status Theorem for theBenchmark
% 2.46/1.33 % SZS output start Proof for theBenchmark
% See solution above
% 3.82/1.55 % (440405)------------------------------
% 3.82/1.55 % (440405)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.82/1.55 % (440405)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.82/1.55 % (440405)CaDiCaL version: 2.1.3
% 3.82/1.55 % (440405)Termination reason: Refutation
% 3.82/1.55 % (440405)Time elapsed: 0.018 s
% 3.82/1.55 % (440405)Peak memory usage: 90 MB
% 3.82/1.55 % (440405)Instructions burned: 22 (million)
% 3.82/1.55 % (440405)------------------------------
% 3.82/1.55 % (440405)------------------------------
% 3.82/1.55 % (440395)Success in time 0.452 s
% 3.82/1.55 % Vampire exiting
%------------------------------------------------------------------------------