%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : DAT027_1 : TPTP v9.3.1. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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 09:47:59 AM UTC 2026
% Result : Theorem 0.40s 0.28s
% Output : Refutation 0.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : DAT027_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n008.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 00:06:39 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.28 % (2779360)Will run a generic schedule for satisfiability detection.
% 0.40/0.28 % (2779369)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1057566307:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.40/0.28 % (2779365)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1010465363_2999 on theBenchmark for (2999ds/0Mi)
% 0.40/0.28 % (2779371)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1223793453:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.40/0.28 % (2779368)dis+10_1_sil=32000:sp=arity:random_seed=1855809502:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.40/0.28 % (2779367)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3738882686:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.40/0.28 % (2779370)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=797891403:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.40/0.28 % (2779365)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.40/0.28 % (2779365)Terminated due to inappropriate strategy.
% 0.40/0.28 % (2779365)------------------------------
% 0.40/0.28 % (2779365)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.40/0.28 % (2779365)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.40/0.28 % (2779365)CaDiCaL version: 2.1.3
% 0.40/0.28 % (2779365)Termination reason: Inappropriate
% 0.40/0.28 % (2779365)Time elapsed: 0.001 s
% 0.40/0.28 % (2779365)Peak memory usage: 10 MB
% 0.40/0.28 % (2779365)------------------------------
% 0.40/0.28 % (2779365)------------------------------
% 0.40/0.28 % (2779366)% WARNING: option uhcvi not known.
% 0.40/0.28 % (2779366)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3688857845:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.40/0.28 % (2779378)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1064983870:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.40/0.28 % (2779378)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.40/0.28 % (2779378)Terminated due to inappropriate strategy.
% 0.40/0.28 % (2779378)------------------------------
% 0.40/0.28 % (2779378)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.40/0.28 % (2779378)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.40/0.28 % (2779378)CaDiCaL version: 2.1.3
% 0.40/0.28 % (2779378)Termination reason: Inappropriate
% 0.40/0.28 % (2779378)Time elapsed: 0.001 s
% 0.40/0.28 % (2779378)Peak memory usage: 11 MB
% 0.40/0.28 % (2779368) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2779360-2779368"...
% 0.40/0.28 % (2779378)------------------------------
% 0.40/0.28 % (2779378)------------------------------
% 0.40/0.28 % (2779368)...printing done.
% 0.40/0.28 % (2779368)Refutation found. Thanks to Tanya!
% 0.40/0.28 % SZS status Theorem for theBenchmark
% 0.40/0.28 % SZS output start Proof for theBenchmark
% 0.40/0.28 tff(type_def_5, type, collection: $tType).
% 0.40/0.28 tff(func_def_0, type, empty: collection).
% 0.40/0.28 tff(func_def_1, type, add: ($int * collection) > collection).
% 0.40/0.28 tff(func_def_2, type, remove: ($int * collection) > collection).
% 0.40/0.28 tff(func_def_7, type, sK0: collection).
% 0.40/0.28 tff(func_def_8, type, sK1: collection).
% 0.40/0.28 tff(func_def_9, type, sK2: $int).
% 0.40/0.28 tff(func_def_10, type, sK3: $int).
% 0.40/0.28 tff(func_def_11, type, sK4: $int).
% 0.40/0.28 tff(pred_def_1, type, in: ($int * collection) > $o).
% 0.40/0.28 tff(f4,axiom,(
% 0.40/0.28 ! [X0 : $int,X1 : collection,X2 : $int] : ((in(X0,X1) | X0 = X2) <=> in(X0,add(X2,X1)))),
% 0.40/0.28 file('/export/starexec/sandbox/benchmark/Axioms/DAT002_0.ax',ax4)).
% 0.40/0.28 tff(f5,axiom,(
% 0.40/0.28 ! [X0 : $int,X1 : collection,X2 : $int] : ((in(X0,X1) & X0 != X2) <=> in(X0,remove(X2,X1)))),
% 0.40/0.28 file('/export/starexec/sandbox/benchmark/Axioms/DAT002_0.ax',ax5)).
% 0.40/0.28 tff(f6,conjecture,(
% 0.40/0.28 ! [X0 : collection,X1 : collection,X2 : $int,X3 : $int] : ((! [X4 : $int] : (in(X4,X1) => $greater(X4,0)) & in(X2,X1) & $greatereq(X3,0) & X0 = add($sum(X2,X3),remove(X2,X1))) => ! [X5 : $int] : (in(X5,X0) => $greater(X5,0)))),
% 0.40/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)).
% 0.40/0.28 tff(f7,negated_conjecture,(
% 0.40/0.28 ~ ! [X0 : collection,X1 : collection,X2 : $int,X3 : $int] : ((! [X4 : $int] : (in(X4,X1) => $greater(X4,0)) & in(X2,X1) & $greatereq(X3,0) & X0 = add($sum(X2,X3),remove(X2,X1))) => ! [X5 : $int] : (in(X5,X0) => $greater(X5,0)))),
% 0.40/0.28 inference(negated_conjecture,[status(cth)],[f6])).
% 0.40/0.28 tff(f8,plain,(
% 0.40/0.28 ~ ! [X0 : collection,X1 : collection,X2 : $int,X3 : $int] : ((! [X4 : $int] : (in(X4,X1) => $less(0,X4)) & in(X2,X1) & ~$less(X3,0) & X0 = add($sum(X2,X3),remove(X2,X1))) => ! [X5 : $int] : (in(X5,X0) => $less(0,X5)))),
% 0.40/0.28 inference(theory_normalization,[],[f7])).
% 0.40/0.28 tff(f9,definition,(
% 0.40/0.28 ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 0.40/0.28 introduced(theory,[tha_commutativity])).
% 0.40/0.28 tff(f11,definition,(
% 0.40/0.28 ( ! [X0 : $int] : ($sum(X0,0) = X0) )),
% 0.40/0.28 introduced(theory,[tha_right_identity])).
% 0.40/0.28 tff(f13,definition,(
% 0.40/0.28 ( ! [X0 : $int] : (0 = $sum(X0,$uminus(X0))) )),
% 0.40/0.28 introduced(theory,[tha_inverse_op_unit])).
% 0.40/0.28 tff(f15,definition,(
% 0.40/0.28 ( ! [X2 : $int,X0 : $int,X1 : $int] : (~$less(X1,X2) | ~$less(X0,X1) | $less(X0,X2)) )),
% 0.40/0.28 introduced(theory,[tha_transitivity])).
% 0.40/0.28 tff(f16,definition,(
% 0.40/0.28 ( ! [X0 : $int,X1 : $int] : ($less(X1,X0) | $less(X0,X1) | X0 = X1) )),
% 0.40/0.28 introduced(theory,[tha_order_totality])).
% 0.40/0.28 tff(f17,definition,(
% 0.40/0.28 ( ! [X2 : $int,X0 : $int,X1 : $int] : ($less($sum(X0,X2),$sum(X1,X2)) | ~$less(X0,X1)) )),
% 0.40/0.28 introduced(theory,[tha_order_monotonicity])).
% 0.40/0.28 tff(f21,plain,(
% 0.40/0.28 ? [X0 : collection,X1 : collection,X2 : $int,X3 : $int] : (? [X5 : $int] : (~$less(0,X5) & in(X5,X0)) & (! [X4 : $int] : ($less(0,X4) | ~in(X4,X1)) & in(X2,X1) & ~$less(X3,0) & X0 = add($sum(X2,X3),remove(X2,X1))))),
% 0.40/0.28 inference(ennf_transformation,[],[f8])).
% 0.40/0.28 tff(f22,plain,(
% 0.40/0.28 ? [X0 : collection,X1 : collection,X2 : $int,X3 : $int] : (? [X5 : $int] : (~$less(0,X5) & in(X5,X0)) & ! [X4 : $int] : ($less(0,X4) | ~in(X4,X1)) & in(X2,X1) & ~$less(X3,0) & X0 = add($sum(X2,X3),remove(X2,X1)))),
% 0.40/0.28 inference(flattening,[],[f21])).
% 0.40/0.28 tff(f23,plain,(
% 0.40/0.28 ! [X0 : $int,X1 : collection,X2 : $int] : (((in(X0,X1) | X0 = X2) | ~in(X0,add(X2,X1))) & (in(X0,add(X2,X1)) | (~in(X0,X1) & X0 != X2)))),
% 0.40/0.28 inference(nnf_transformation,[],[f4])).
% 0.40/0.28 tff(f24,plain,(
% 0.40/0.28 ! [X0 : $int,X1 : collection,X2 : $int] : ((in(X0,X1) | X0 = X2 | ~in(X0,add(X2,X1))) & (in(X0,add(X2,X1)) | (~in(X0,X1) & X0 != X2)))),
% 0.40/0.28 inference(flattening,[],[f23])).
% 0.40/0.28 tff(f25,plain,(
% 0.40/0.28 ! [X0 : $int,X1 : collection,X2 : $int] : (((in(X0,X1) & X0 != X2) | ~in(X0,remove(X2,X1))) & (in(X0,remove(X2,X1)) | (~in(X0,X1) | X0 = X2)))),
% 0.40/0.28 inference(nnf_transformation,[],[f5])).
% 0.40/0.28 tff(f26,plain,(
% 0.40/0.28 ! [X0 : $int,X1 : collection,X2 : $int] : (((in(X0,X1) & X0 != X2) | ~in(X0,remove(X2,X1))) & (in(X0,remove(X2,X1)) | ~in(X0,X1) | X0 = X2))),
% 0.40/0.28 inference(flattening,[],[f25])).
% 0.40/0.28 tff(f27,plain,(
% 0.40/0.28 ? [X0 : collection,X1 : collection,X2 : $int,X3 : $int] : (? [X4 : $int] : (~$less(0,X4) & in(X4,X0)) & ! [X5 : $int] : ($less(0,X5) | ~in(X5,X1)) & in(X2,X1) & ~$less(X3,0) & X0 = add($sum(X2,X3),remove(X2,X1)))),
% 0.40/0.28 inference(rectify,[],[f22])).
% 0.40/0.28 tff(f28,plain,(
% 0.40/0.28 (~$less(0,sK4) & in(sK4,sK0)) & ! [X5 : $int] : ($less(0,X5) | ~in(X5,sK1)) & in(sK2,sK1) & ~$less(sK3,0) & sK0 = add($sum(sK2,sK3),remove(sK2,sK1))),
% 0.40/0.28 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4)],[f27])).
% 0.40/0.28 tff(f34,plain,(
% 0.40/0.28 ( ! [X2 : $int,X0 : $int,X1 : collection] : (~in(X0,add(X2,X1)) | X0 = X2 | in(X0,X1)) )),
% 0.40/0.28 inference(cnf_transformation,[],[f24])).
% 0.40/0.28 tff(f37,plain,(
% 0.40/0.28 ( ! [X2 : $int,X0 : $int,X1 : collection] : (~in(X0,remove(X2,X1)) | in(X0,X1)) )),
% 0.40/0.28 inference(cnf_transformation,[],[f26])).
% 0.40/0.28 tff(f38,plain,(
% 0.40/0.28 sK0 = add($sum(sK2,sK3),remove(sK2,sK1))),
% 0.40/0.28 inference(cnf_transformation,[],[f28])).
% 0.40/0.28 tff(f39,plain,(
% 0.40/0.28 ~$less(sK3,0)),
% 0.40/0.28 inference(cnf_transformation,[],[f28])).
% 0.40/0.28 tff(f40,plain,(
% 0.40/0.28 in(sK2,sK1)),
% 0.40/0.28 inference(cnf_transformation,[],[f28])).
% 0.40/0.28 tff(f41,plain,(
% 0.40/0.28 ( ! [X5 : $int] : (~in(X5,sK1) | $less(0,X5)) )),
% 0.40/0.28 inference(cnf_transformation,[],[f28])).
% 0.40/0.28 tff(f42,plain,(
% 0.40/0.28 in(sK4,sK0)),
% 0.40/0.28 inference(cnf_transformation,[],[f28])).
% 0.40/0.28 tff(f43,plain,(
% 0.40/0.28 ~$less(0,sK4)),
% 0.40/0.28 inference(cnf_transformation,[],[f28])).
% 0.40/0.28 tff(f46,plain,(
% 0.40/0.28 $less(0,sK2)),
% 0.40/0.28 inference(resolution,[],[f41,f40])).
% 0.40/0.28 tff(f73,plain,(
% 0.40/0.28 $less(0,sK3) | 0 = sK3),
% 0.40/0.28 inference(resolution,[],[f16,f39])).
% 0.40/0.28 tff(f83,definition,(
% 0.40/0.28 spl5_1 <=> 0 = sK3),
% 0.40/0.28 introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition])).
% 0.40/0.28 tff(f85,plain,(
% 0.40/0.28 0 = sK3 | ~spl5_1),
% 0.40/0.28 inference(avatar_component_clause,[],[f83])).
% 0.40/0.28 tff(f87,definition,(
% 0.40/0.28 spl5_2 <=> $less(0,sK3)),
% 0.40/0.28 introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition])).
% 0.40/0.28 tff(f89,plain,(
% 0.40/0.28 $less(0,sK3) | ~spl5_2),
% 0.40/0.28 inference(avatar_component_clause,[],[f87])).
% 0.40/0.28 tff(f91,plain,(
% 0.40/0.28 spl5_1 | spl5_2),
% 0.40/0.28 inference(avatar_split_clause,[],[f73,f87,f83])).
% 0.40/0.28 tff(f149,plain,(
% 0.40/0.28 ( ! [X0 : $int] : (in(X0,remove(sK2,sK1)) | $sum(sK2,sK3) = X0 | ~in(X0,sK0)) )),
% 0.40/0.28 inference(superposition,[],[f34,f38])).
% 0.40/0.28 tff(f159,plain,(
% 0.40/0.28 ( ! [X0 : $int] : (~in(X0,sK0) | $sum(sK2,sK3) = X0 | in(X0,sK1)) )),
% 0.40/0.28 inference(resolution,[],[f149,f37])).
% 0.40/0.28 tff(f178,plain,(
% 0.40/0.28 sK4 = $sum(sK2,sK3) | in(sK4,sK1)),
% 0.40/0.28 inference(resolution,[],[f159,f42])).
% 0.40/0.28 tff(f180,definition,(
% 0.40/0.28 spl5_5 <=> in(sK4,sK1)),
% 0.40/0.28 introduced(definition,[new_symbols(definition,[spl5_5])],[avatar_definition])).
% 0.40/0.28 tff(f182,plain,(
% 0.40/0.28 in(sK4,sK1) | ~spl5_5),
% 0.40/0.28 inference(avatar_component_clause,[],[f180])).
% 0.40/0.28 tff(f184,definition,(
% 0.40/0.28 spl5_6 <=> sK4 = $sum(sK2,sK3)),
% 0.40/0.28 introduced(definition,[new_symbols(definition,[spl5_6])],[avatar_definition])).
% 0.40/0.28 tff(f186,plain,(
% 0.40/0.28 sK4 = $sum(sK2,sK3) | ~spl5_6),
% 0.40/0.28 inference(avatar_component_clause,[],[f184])).
% 0.40/0.28 tff(f187,plain,(
% 0.40/0.28 spl5_5 | spl5_6),
% 0.40/0.28 inference(avatar_split_clause,[],[f178,f184,f180])).
% 0.40/0.28 tff(f201,plain,(
% 0.40/0.28 $less(0,sK4) | ~spl5_5),
% 0.40/0.28 inference(resolution,[],[f182,f41])).
% 0.40/0.28 tff(f202,plain,(
% 0.40/0.28 $false | ~spl5_5),
% 0.40/0.28 inference(forward_subsumption_resolution,[],[f201,f43])).
% 0.40/0.28 tff(f203,plain,(
% 0.40/0.28 ~spl5_5),
% 0.40/0.28 inference(avatar_contradiction_clause,[],[f202])).
% 0.40/0.28 tff(f226,plain,(
% 0.40/0.28 ( ! [X0 : $int] : ($less($sum(X0,sK3),sK4) | ~$less(X0,sK2)) ) | ~spl5_6),
% 0.40/0.28 inference(superposition,[],[f17,f186])).
% 0.40/0.28 tff(f251,plain,(
% 0.40/0.28 ( ! [X0 : $int] : ($less($sum(sK3,X0),sK4) | ~$less(X0,sK2)) ) | ~spl5_6),
% 0.40/0.28 inference(superposition,[],[f226,f9])).
% 0.40/0.28 tff(f284,definition,(
% 0.40/0.28 spl5_7 <=> $less(sK3,sK4)),
% 0.40/0.28 introduced(definition,[new_symbols(definition,[spl5_7])],[avatar_definition])).
% 0.40/0.28 tff(f285,plain,(
% 0.40/0.28 $less(sK3,sK4) | ~spl5_7),
% 0.40/0.28 inference(avatar_component_clause,[],[f284])).
% 0.40/0.28 tff(f331,plain,(
% 0.40/0.28 $less(sK3,sK4) | ~$less(0,sK2) | ~spl5_6),
% 0.40/0.28 inference(superposition,[],[f251,f11])).
% 0.40/0.28 tff(f333,plain,(
% 0.40/0.28 $less(0,sK4) | ~$less($uminus(sK3),sK2) | ~spl5_6),
% 0.40/0.28 inference(superposition,[],[f251,f13])).
% 0.40/0.28 tff(f334,plain,(
% 0.40/0.28 ~$less($uminus(sK3),sK2) | ~spl5_6),
% 0.40/0.28 inference(forward_subsumption_resolution,[],[f333,f43])).
% 0.40/0.28 tff(f338,plain,(
% 0.40/0.28 $less(sK3,sK4) | ~spl5_6),
% 0.40/0.28 inference(forward_subsumption_resolution,[],[f331,f46])).
% 0.40/0.28 tff(f339,plain,(
% 0.40/0.28 spl5_7 | ~spl5_6),
% 0.40/0.28 inference(avatar_split_clause,[],[f338,f184,f284])).
% 0.40/0.28 tff(f340,plain,(
% 0.40/0.28 ( ! [X0 : $int] : (~$less(X0,sK3) | $less(X0,sK4)) ) | ~spl5_7),
% 0.40/0.28 inference(resolution,[],[f285,f15])).
% 0.40/0.28 tff(f881,plain,(
% 0.40/0.28 $less(0,sK4) | (~spl5_2 | ~spl5_7)),
% 0.40/0.28 inference(resolution,[],[f340,f89])).
% 0.40/0.28 tff(f883,plain,(
% 0.40/0.28 $false | (~spl5_2 | ~spl5_7)),
% 0.40/0.28 inference(forward_subsumption_resolution,[],[f881,f43])).
% 0.40/0.28 tff(f884,plain,(
% 0.40/0.28 ~spl5_2 | ~spl5_7),
% 0.40/0.28 inference(avatar_contradiction_clause,[],[f883])).
% 0.40/0.28 tff(f893,plain,(
% 0.40/0.28 ~$less($uminus(0),sK2) | (~spl5_1 | ~spl5_6)),
% 0.40/0.28 inference(superposition,[],[f334,f85])).
% 0.40/0.28 tff(f905,plain,(
% 0.40/0.28 ~$less(0,sK2) | (~spl5_1 | ~spl5_6)),
% 0.40/0.28 inference(evaluation,[],[f893])).
% 0.40/0.28 tff(f912,plain,(
% 0.40/0.28 $false | (~spl5_1 | ~spl5_6)),
% 0.40/0.28 inference(forward_subsumption_resolution,[],[f905,f46])).
% 0.40/0.28 tff(f913,plain,(
% 0.40/0.28 ~spl5_1 | ~spl5_6),
% 0.40/0.28 inference(avatar_contradiction_clause,[],[f912])).
% 0.40/0.28 cnf(s2, plain, spl5_1 | spl5_2, inference(sat_conversion,[],[f91])).
% 0.40/0.28 cnf(s4, plain, spl5_5 | spl5_6, inference(sat_conversion,[],[f187])).
% 0.40/0.28 cnf(s5, plain, ~spl5_5, inference(sat_conversion,[],[f203])).
% 0.40/0.28 cnf(s8, plain, ~spl5_6 | spl5_7, inference(sat_conversion,[],[f339])).
% 0.40/0.28 cnf(s20, plain, ~spl5_2 | ~spl5_7, inference(sat_conversion,[],[f884])).
% 0.40/0.28 cnf(s23, plain, ~spl5_1 | ~spl5_6, inference(sat_conversion,[],[f913])).
% 0.40/0.28 cnf(s26, plain, spl5_6, inference(rat,[],[s4,s5])).
% 0.40/0.28 cnf(s27, plain, ~spl5_1, inference(rat,[],[s23,s26])).
% 0.40/0.28 cnf(s29, plain, spl5_7, inference(rat,[],[s8,s26])).
% 0.40/0.28 cnf(s31, plain, ~spl5_2, inference(rat,[],[s20,s29])).
% 0.40/0.28 cnf(s35, plain, $false, inference(rat,[],[s2,s31,s27])).
% 0.40/0.28 tff(f918,plain,(
% 0.40/0.28 $false),
% 0.40/0.28 inference(avatar_sat_refutation,[],[s35])).
% 0.40/0.28 % SZS output end Proof for theBenchmark
% 0.40/0.28 % (2779368)------------------------------
% 0.40/0.28 % (2779368)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.40/0.28 % (2779368)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.40/0.28 % (2779368)CaDiCaL version: 2.1.3
% 0.40/0.28 % (2779368)Termination reason: Refutation
% 0.40/0.28 % (2779368)Time elapsed: 0.025 s
% 0.40/0.28 % (2779368)Peak memory usage: 13 MB
% 0.40/0.28 % (2779368)Instructions burned: 36 (million)
% 0.40/0.28 % (2779360)Success in time 0.057 s
% 0.40/0.28 % Vampire exiting
%------------------------------------------------------------------------------