%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC473_1 : TPTP v9.3.1. Released v9.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 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 01:06:02 PM UTC 2026
% Result : Theorem 0.25s 0.39s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC473_1 : TPTP v9.3.1. Released v9.0.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.27 % Computer : n003.cluster.edu
% 0.10/0.27 % Model : x86_64 x86_64
% 0.10/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.27 % Memory : 8046.5625MB
% 0.10/0.27 % OS : Linux 6.8.0-71-generic
% 0.10/0.27 % CPULimit : 300
% 0.10/0.27 % WCLimit : 300
% 0.10/0.27 % DateTime : Mon Sep 28 09:41:42 UTC 2026
% 0.10/0.27 % CPUTime :
% 0.10/0.27 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.25/0.30 Running first-order model finding
% 0.25/0.30 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.25/0.38 % (1467959)Will run a generic schedule for satisfiability detection.
% 0.25/0.38 % (1467965)% WARNING: option uhcvi not known.
% 0.25/0.38 % (1467965)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1307221307:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.25/0.38 % (1467970)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1882435752:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.25/0.38 % (1467964)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=6729901_2999 on theBenchmark for (2999ds/0Mi)
% 0.25/0.38 % (1467968)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3058651073:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.25/0.38 % (1467967)dis+10_1_sil=32000:sp=arity:random_seed=594302347:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.25/0.38 % (1467966)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3841365641:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.25/0.38 % (1467964)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.25/0.39 % (1467964)Terminated due to inappropriate strategy.
% 0.25/0.39 % (1467964)------------------------------
% 0.25/0.39 % (1467964)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.39 % (1467964)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.39 % (1467964)CaDiCaL version: 2.1.3
% 0.25/0.39 % (1467964)Termination reason: Inappropriate
% 0.25/0.39 % (1467964)Time elapsed: 0.001 s
% 0.25/0.39 % (1467969)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2806740558:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.25/0.39 % (1467964)Peak memory usage: 10 MB
% 0.25/0.39 % (1467964)Instructions burned: 1 (million)
% 0.25/0.39 % (1467964)------------------------------
% 0.25/0.39 % (1467964)------------------------------
% 0.25/0.39 % (1467965) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1467959-1467965"...
% 0.25/0.39 % (1467965)...printing done.
% 0.25/0.39 % (1467965)Refutation found. Thanks to Tanya!
% 0.25/0.39 % SZS status Theorem for theBenchmark
% 0.25/0.39 % SZS output start Proof for theBenchmark
% 0.25/0.39 tff(func_def_0, type, v0: $int > $int).
% 0.25/0.39 tff(func_def_1, type, f0: $int).
% 0.25/0.39 tff(func_def_2, type, u0: ($int * $int) > $int).
% 0.25/0.39 tff(func_def_3, type, g0: $int > $int).
% 0.25/0.39 tff(func_def_4, type, fast: $int > $int).
% 0.25/0.39 tff(func_def_5, type, 'mod:(Int*Int)>Int': ($int * $int) > $int).
% 0.25/0.39 tff(func_def_6, type, h0: $int > $int).
% 0.25/0.39 tff(func_def_7, type, small: $int > $int).
% 0.25/0.39 tff(func_def_14, type, sK0: $int).
% 0.25/0.39 tff(f1,axiom,(
% 0.25/0.39 ! [X0 : $int] : (($lesseq('mod:(Int*Int)>Int'(X0,2),0) => small(X0) = $sum(1,$sum($product(X0,X0),X0))) & (~$lesseq('mod:(Int*Int)>Int'(X0,2),0) => small(X0) = $sum(1,$sum($product(0,X0),X0))))),
% 0.25/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_1)).
% 0.25/0.39 tff(f2,axiom,(
% 0.25/0.39 f0 = 0),
% 0.25/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_2)).
% 0.25/0.39 tff(f3,axiom,(
% 0.25/0.39 ! [X0 : $int] : g0(X0) = 'mod:(Int*Int)>Int'(X0,2)),
% 0.25/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_3)).
% 0.25/0.39 tff(f4,axiom,(
% 0.25/0.39 ! [X0 : $int] : h0(X0) = X0),
% 0.25/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_4)).
% 0.25/0.39 tff(f5,axiom,(
% 0.25/0.39 ! [X0 : $int,X1 : $int] : (($lesseq(X0,0) => u0(X0,X1) = X1) & (~$lesseq(X0,0) => u0(X0,X1) = f0))),
% 0.25/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_5)).
% 0.25/0.39 tff(f6,axiom,(
% 0.25/0.39 ! [X0 : $int] : v0(X0) = u0(g0(X0),h0(X0))),
% 0.25/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_6)).
% 0.25/0.39 tff(f7,axiom,(
% 0.25/0.39 ! [X0 : $int] : fast(X0) = $sum(1,$sum($product(v0(X0),X0),X0))),
% 0.25/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_7)).
% 0.25/0.39 tff(f8,conjecture,(
% 0.25/0.39 ~ ? [X0 : $int] : ($greatereq(X0,0) & small(X0) != fast(X0))),
% 0.25/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjecture_1)).
% 0.25/0.39 tff(f9,negated_conjecture,(
% 0.25/0.39 ~ ~ ? [X0 : $int] : ($greatereq(X0,0) & small(X0) != fast(X0))),
% 0.25/0.39 inference(negated_conjecture,[status(cth)],[f8])).
% 0.25/0.39 tff(f10,plain,(
% 0.25/0.39 ! [X0 : $int] : ((~$less(0,'mod:(Int*Int)>Int'(X0,2)) => small(X0) = $sum(1,$sum($product(X0,X0),X0))) & ($less(0,'mod:(Int*Int)>Int'(X0,2)) => small(X0) = $sum(1,$sum($product(0,X0),X0))))),
% 0.25/0.39 inference(theory_normalization,[],[f1])).
% 0.41/0.39 tff(f11,plain,(
% 0.41/0.39 ! [X0 : $int,X1 : $int] : ((~$less(0,X0) => u0(X0,X1) = X1) & ($less(0,X0) => u0(X0,X1) = f0))),
% 0.41/0.39 inference(theory_normalization,[],[f5])).
% 0.41/0.39 tff(f12,plain,(
% 0.41/0.39 ? [X0 : $int] : (~$less(X0,0) & small(X0) != fast(X0))),
% 0.41/0.39 inference(theory_normalization,[],[f9])).
% 0.41/0.39 tff(f13,definition,(
% 0.41/0.39 ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 0.41/0.39 introduced(theory,[tha_commutativity])).
% 0.41/0.39 tff(f24,definition,(
% 0.41/0.39 ( ! [X0 : $int,X1 : $int] : ($product(X0,X1) = $product(X1,X0)) )),
% 0.41/0.39 introduced(theory,[tha_commutativity])).
% 0.41/0.39 tff(f26,definition,(
% 0.41/0.39 ( ! [X0 : $int] : ($product(X0,1) = X0) )),
% 0.41/0.39 introduced(theory,[tha_right_identity])).
% 0.41/0.39 tff(f28,definition,(
% 0.41/0.39 ( ! [X2 : $int,X0 : $int,X1 : $int] : ($product(X0,$sum(X1,X2)) = $sum($product(X0,X1),$product(X0,X2))) )),
% 0.41/0.39 introduced(theory,[tha_distributivity])).
% 0.41/0.39 tff(f31,plain,(
% 0.41/0.39 ! [X0 : $int] : ((small(X0) = $sum(1,$sum($product(X0,X0),X0)) | $less(0,'mod:(Int*Int)>Int'(X0,2))) & (small(X0) = $sum(1,$sum($product(0,X0),X0)) | ~$less(0,'mod:(Int*Int)>Int'(X0,2))))),
% 0.41/0.39 inference(ennf_transformation,[],[f10])).
% 0.41/0.39 tff(f32,plain,(
% 0.41/0.39 ! [X0 : $int,X1 : $int] : ((u0(X0,X1) = X1 | $less(0,X0)) & (u0(X0,X1) = f0 | ~$less(0,X0)))),
% 0.41/0.39 inference(ennf_transformation,[],[f11])).
% 0.41/0.39 tff(f33,plain,(
% 0.41/0.39 ( ! [X0 : $int] : ($less(0,'mod:(Int*Int)>Int'(X0,2)) | small(X0) = $sum(1,$sum($product(X0,X0),X0))) )),
% 0.41/0.39 inference(cnf_transformation,[],[f31])).
% 0.41/0.39 tff(f34,plain,(
% 0.41/0.39 ( ! [X0 : $int] : (~$less(0,'mod:(Int*Int)>Int'(X0,2)) | small(X0) = $sum(1,$sum($product(0,X0),X0))) )),
% 0.41/0.39 inference(cnf_transformation,[],[f31])).
% 0.41/0.39 tff(f35,plain,(
% 0.41/0.39 0 = f0),
% 0.41/0.39 inference(cnf_transformation,[],[f2])).
% 0.41/0.39 tff(f36,plain,(
% 0.41/0.39 ( ! [X0 : $int] : ('mod:(Int*Int)>Int'(X0,2) = g0(X0)) )),
% 0.41/0.39 inference(cnf_transformation,[],[f3])).
% 0.41/0.39 tff(f37,plain,(
% 0.41/0.39 ( ! [X0 : $int] : (h0(X0) = X0) )),
% 0.41/0.39 inference(cnf_transformation,[],[f4])).
% 0.41/0.39 tff(f38,plain,(
% 0.41/0.39 ( ! [X0 : $int,X1 : $int] : ($less(0,X0) | u0(X0,X1) = X1) )),
% 0.41/0.39 inference(cnf_transformation,[],[f32])).
% 0.41/0.39 tff(f39,plain,(
% 0.41/0.39 ( ! [X0 : $int,X1 : $int] : (~$less(0,X0) | f0 = u0(X0,X1)) )),
% 0.41/0.39 inference(cnf_transformation,[],[f32])).
% 0.41/0.39 tff(f40,plain,(
% 0.41/0.39 ( ! [X0 : $int] : (v0(X0) = u0(g0(X0),h0(X0))) )),
% 0.41/0.39 inference(cnf_transformation,[],[f6])).
% 0.41/0.39 tff(f41,plain,(
% 0.41/0.39 ( ! [X0 : $int] : (fast(X0) = $sum(1,$sum($product(v0(X0),X0),X0))) )),
% 0.41/0.39 inference(cnf_transformation,[],[f7])).
% 0.41/0.39 tff(f42,plain,(
% 0.41/0.39 small(sK0) != fast(sK0)),
% 0.41/0.39 inference(cnf_transformation,[],[f12])).
% 0.41/0.39 tff(f44,plain,(
% 0.41/0.39 ( ! [X0 : $int] : (v0(X0) = u0('mod:(Int*Int)>Int'(X0,2),h0(X0))) )),
% 0.41/0.39 inference(definition_unfolding,[],[f40,f36])).
% 0.41/0.39 tff(f45,plain,(
% 0.41/0.39 ( ! [X0 : $int] : (fast(X0) = $sum(1,$sum($product(u0('mod:(Int*Int)>Int'(X0,2),h0(X0)),X0),X0))) )),
% 0.41/0.39 inference(definition_unfolding,[],[f41,f44])).
% 0.41/0.39 tff(f46,plain,(
% 0.41/0.39 ( ! [X0 : $int,X1 : $int] : (~$less(0,X0) | 0 = u0(X0,X1)) )),
% 0.41/0.39 inference(definition_unfolding,[],[f39,f35])).
% 0.41/0.39 tff(f47,plain,(
% 0.41/0.39 small(sK0) != $sum(1,$sum($product(u0('mod:(Int*Int)>Int'(sK0,2),h0(sK0)),sK0),sK0))),
% 0.41/0.39 inference(definition_unfolding,[],[f42,f45])).
% 0.41/0.39 tff(f49,plain,(
% 0.41/0.39 ( ! [X0 : $int] : (~$less(0,'mod:(Int*Int)>Int'(X0,2)) | small(X0) = $sum(1,X0)) )),
% 0.41/0.39 inference(evaluation,[],[f34])).
% 0.41/0.39 tff(f50,plain,(
% 0.41/0.39 small(sK0) != $sum(1,$sum($product(u0('mod:(Int*Int)>Int'(sK0,2),sK0),sK0),sK0))),
% 0.41/0.39 inference(superposition,[],[f47,f37])).
% 0.41/0.39 tff(f70,plain,(
% 0.41/0.39 small(sK0) != $sum(1,$sum($product(sK0,u0('mod:(Int*Int)>Int'(sK0,2),h0(sK0))),sK0))),
% 0.41/0.39 inference(superposition,[],[f47,f24])).
% 0.41/0.39 tff(f75,plain,(
% 0.41/0.39 small(sK0) != $sum(1,$sum(sK0,$product(sK0,u0('mod:(Int*Int)>Int'(sK0,2),h0(sK0)))))),
% 0.41/0.39 inference(forward_demodulation,[],[f70,f13])).
% 0.41/0.39 tff(f78,plain,(
% 0.41/0.39 small(sK0) != $sum(1,$sum(sK0,$product(sK0,u0('mod:(Int*Int)>Int'(sK0,2),sK0))))),
% 0.41/0.39 inference(forward_demodulation,[],[f75,f37])).
% 0.41/0.39 tff(f90,plain,(
% 0.41/0.39 ( ! [X2 : $int,X0 : $int,X1 : $int] : (0 = u0(X0,X1) | u0(X0,X2) = X2) )),
% 0.41/0.39 inference(resolution,[],[f46,f38])).
% 0.41/0.39 tff(f182,plain,(
% 0.41/0.39 ( ! [X0 : $int,X1 : $int] : (u0('mod:(Int*Int)>Int'(X0,2),X1) = X1 | small(X0) = $sum(1,X0)) )),
% 0.41/0.39 inference(resolution,[],[f49,f38])).
% 0.41/0.39 tff(f183,plain,(
% 0.41/0.39 ( ! [X0 : $int,X1 : $int] : ($product(X0,$sum(1,X1)) = $sum(X0,$product(X0,X1))) )),
% 0.41/0.39 inference(superposition,[],[f28,f26])).
% 0.41/0.39 tff(f238,plain,(
% 0.41/0.39 ( ! [X0 : $int] : ($less(0,'mod:(Int*Int)>Int'(X0,2)) | small(X0) = $sum(1,$sum(X0,$product(X0,X0)))) )),
% 0.41/0.39 inference(forward_demodulation,[],[f33,f13])).
% 0.41/0.39 tff(f239,plain,(
% 0.41/0.39 ( ! [X0 : $int] : (small(X0) = $sum(1,$sum(X0,$product(X0,X0))) | small(X0) = $sum(1,X0)) )),
% 0.41/0.39 inference(resolution,[],[f238,f49])).
% 0.41/0.39 tff(f240,plain,(
% 0.41/0.39 ( ! [X0 : $int,X1 : $int] : (small(X0) = $sum(1,$sum(X0,$product(X0,X0))) | 0 = u0('mod:(Int*Int)>Int'(X0,2),X1)) )),
% 0.41/0.39 inference(resolution,[],[f238,f46])).
% 0.41/0.39 tff(f378,plain,(
% 0.41/0.39 ( ! [X0 : $int] : (small(sK0) != $sum(1,$sum($product(0,sK0),sK0)) | u0('mod:(Int*Int)>Int'(sK0,2),X0) = X0) )),
% 0.41/0.39 inference(superposition,[],[f50,f90])).
% 0.41/0.39 tff(f390,plain,(
% 0.41/0.39 ( ! [X0 : $int] : (small(sK0) != $sum(1,sK0) | u0('mod:(Int*Int)>Int'(sK0,2),X0) = X0) )),
% 0.41/0.39 inference(evaluation,[],[f378])).
% 0.41/0.39 tff(f1327,plain,(
% 0.41/0.39 small(sK0) != $sum(1,$sum($product(sK0,sK0),sK0)) | small(sK0) = $sum(1,sK0)),
% 0.41/0.39 inference(superposition,[],[f50,f182])).
% 0.41/0.39 tff(f1331,plain,(
% 0.41/0.39 small(sK0) != $sum(1,$sum(sK0,$product(sK0,sK0))) | small(sK0) = $sum(1,sK0)),
% 0.41/0.39 inference(forward_demodulation,[],[f1327,f13])).
% 0.41/0.39 tff(f1333,plain,(
% 0.41/0.39 small(sK0) != $sum(1,$product(sK0,$sum(1,sK0))) | small(sK0) = $sum(1,sK0)),
% 0.41/0.39 inference(forward_demodulation,[],[f1331,f183])).
% 0.41/0.39 tff(f1636,plain,(
% 0.41/0.39 ( ! [X0 : $int] : (small(X0) = $sum(1,$product(X0,$sum(1,X0))) | small(X0) = $sum(1,X0)) )),
% 0.41/0.39 inference(forward_demodulation,[],[f239,f183])).
% 0.41/0.39 tff(f1695,definition,(
% 0.41/0.39 spl1_12 <=> ! [X1 : $int] : 0 = X1),
% 0.41/0.39 introduced(definition,[new_symbols(definition,[spl1_12])],[avatar_definition])).
% 0.41/0.39 tff(f1696,plain,(
% 0.41/0.39 ( ! [X1 : $int] : (0 = X1) ) | ~spl1_12),
% 0.41/0.39 inference(avatar_component_clause,[],[f1695])).
% 0.41/0.39 tff(f1734,plain,(
% 0.41/0.39 small(sK0) != $sum(1,$product(sK0,$sum(1,u0('mod:(Int*Int)>Int'(sK0,2),sK0))))),
% 0.41/0.39 inference(forward_demodulation,[],[f78,f183])).
% 0.41/0.39 tff(f1738,plain,(
% 0.41/0.39 ( ! [X0 : $int] : (u0('mod:(Int*Int)>Int'(sK0,2),X0) = X0) )),
% 0.41/0.39 inference(forward_subsumption_resolution,[],[f390,f182])).
% 0.41/0.39 tff(f1742,plain,(
% 0.41/0.39 small(sK0) = $sum(1,sK0)),
% 0.41/0.39 inference(forward_subsumption_resolution,[],[f1333,f1636])).
% 0.41/0.39 tff(f1859,plain,(
% 0.41/0.39 ( ! [X0 : $int,X1 : $int] : (small(X0) = $sum(1,$product(X0,$sum(1,X0))) | 0 = u0('mod:(Int*Int)>Int'(X0,2),X1)) )),
% 0.41/0.39 inference(forward_demodulation,[],[f240,f183])).
% 0.41/0.39 tff(f2308,definition,(
% 0.41/0.39 spl1_26 <=> small(sK0) = $sum(1,$product(sK0,small(sK0)))),
% 0.41/0.39 introduced(definition,[new_symbols(definition,[spl1_26])],[avatar_definition])).
% 0.41/0.39 tff(f2433,plain,(
% 0.41/0.39 small(sK0) != $sum(1,$product(sK0,$sum(1,u0(0,sK0)))) | ~spl1_12),
% 0.41/0.39 inference(superposition,[],[f1734,f1696])).
% 0.41/0.39 tff(f2811,plain,(
% 0.41/0.39 0 != small(sK0) | ~spl1_12),
% 0.41/0.39 inference(forward_demodulation,[],[f2433,f1696])).
% 0.41/0.39 tff(f2855,plain,(
% 0.41/0.39 $false | ~spl1_12),
% 0.41/0.39 inference(forward_subsumption_resolution,[],[f2811,f1696])).
% 0.41/0.39 tff(f2856,plain,(
% 0.41/0.39 ~spl1_12),
% 0.41/0.39 inference(avatar_contradiction_clause,[],[f2855])).
% 0.41/0.39 tff(f2886,plain,(
% 0.41/0.39 ( ! [X0 : $int] : (0 = X0 | small(sK0) = $sum(1,$product(sK0,$sum(1,sK0)))) )),
% 0.41/0.39 inference(superposition,[],[f1738,f1859])).
% 0.41/0.39 tff(f2889,plain,(
% 0.41/0.39 small(sK0) != $sum(1,$product(sK0,$sum(1,sK0)))),
% 0.41/0.39 inference(superposition,[],[f1734,f1738])).
% 0.41/0.39 tff(f2895,plain,(
% 0.41/0.39 small(sK0) != $sum(1,$product(sK0,small(sK0)))),
% 0.41/0.39 inference(forward_demodulation,[],[f2889,f1742])).
% 0.41/0.39 tff(f2897,plain,(
% 0.41/0.39 ( ! [X0 : $int] : (small(sK0) = $sum(1,$product(sK0,small(sK0))) | 0 = X0) )),
% 0.41/0.39 inference(forward_demodulation,[],[f2886,f1742])).
% 0.41/0.39 tff(f2900,plain,(
% 0.41/0.39 ~spl1_26),
% 0.41/0.39 inference(avatar_split_clause,[],[f2895,f2308])).
% 0.41/0.39 tff(f2902,plain,(
% 0.41/0.39 spl1_12 | spl1_26),
% 0.41/0.39 inference(avatar_split_clause,[],[f2897,f2308,f1695])).
% 0.41/0.39 cnf(s105, plain, ~spl1_12, inference(sat_conversion,[],[f2856])).
% 0.41/0.39 cnf(s108, plain, ~spl1_26, inference(sat_conversion,[],[f2900])).
% 0.41/0.39 cnf(s109, plain, spl1_12 | spl1_26, inference(sat_conversion,[],[f2902])).
% 0.41/0.39 cnf(s112, plain, spl1_12, inference(rat,[],[s109,s108])).
% 0.41/0.39 cnf(s113, plain, $false, inference(rat,[],[s105,s112])).
% 0.41/0.39 tff(f2907,plain,(
% 0.41/0.39 $false),
% 0.41/0.39 inference(avatar_sat_refutation,[],[s113])).
% 0.41/0.39 % SZS output end Proof for theBenchmark
% 0.41/0.39 % (1467965)------------------------------
% 0.41/0.39 % (1467965)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.41/0.39 % (1467965)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.41/0.39 % (1467965)CaDiCaL version: 2.1.3
% 0.41/0.39 % (1467965)Termination reason: Refutation
% 0.41/0.39 % (1467965)Time elapsed: 0.047 s
% 0.41/0.39 % (1467965)Peak memory usage: 13 MB
% 0.41/0.39 % (1467965)Instructions burned: 119 (million)
% 0.41/0.39 % (1467959)Success in time 0.072 s
% 0.41/0.39 % Vampire exiting
%------------------------------------------------------------------------------