%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : DAT047_1 : TPTP v9.3.1. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n011.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:48:01 AM UTC 2026
% Result : Theorem 0.20s 0.30s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT047_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.06/0.19 % Computer : n011.cluster.edu
% 0.06/0.19 % Model : x86_64 x86_64
% 0.06/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.19 % Memory : 8046.5625MB
% 0.06/0.19 % OS : Linux 6.8.0-71-generic
% 0.06/0.19 % CPULimit : 300
% 0.06/0.19 % WCLimit : 300
% 0.06/0.19 % DateTime : Tue Sep 29 00:07:18 UTC 2026
% 0.06/0.19 % CPUTime :
% 0.06/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.06/0.22 Running first-order model finding
% 0.06/0.22 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.30 % (3913181)Will run a generic schedule for satisfiability detection.
% 0.20/0.30 % (3913197)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2615269103_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.30 % (3913197)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.20/0.30 % (3913197)Terminated due to inappropriate strategy.
% 0.20/0.30 % (3913197)------------------------------
% 0.20/0.30 % (3913197)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (3913197)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (3913197)CaDiCaL version: 2.1.3
% 0.20/0.30 % (3913197)Termination reason: Inappropriate
% 0.20/0.30 % (3913197)Time elapsed: 0.0000 s
% 0.20/0.30 % (3913197)Peak memory usage: 10 MB
% 0.20/0.30 % (3913197)Instructions burned: 1 (million)
% 0.20/0.30 % (3913197)------------------------------
% 0.20/0.30 % (3913197)------------------------------
% 0.20/0.30 % (3913198)% WARNING: option uhcvi not known.
% 0.20/0.30 % (3913201)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3750482002:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.30 % (3913198)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1445716437:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.30 % (3913202)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=730019209:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.30 % (3913199)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2635916358:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.30 % (3913200)dis+10_1_sil=32000:sp=arity:random_seed=100017567:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.30 % (3913203)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1795647039:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.30 % (3913207)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2419664912:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.30 % (3913207)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.20/0.30 % (3913207)Terminated due to inappropriate strategy.
% 0.20/0.30 % (3913207)------------------------------
% 0.20/0.30 % (3913207)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (3913207)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (3913207)CaDiCaL version: 2.1.3
% 0.20/0.30 % (3913207)Termination reason: Inappropriate
% 0.20/0.30 % (3913207)Time elapsed: 0.0000 s
% 0.20/0.30 % (3913207)Peak memory usage: 10 MB
% 0.20/0.30 % (3913207)Instructions burned: 1 (million)
% 0.20/0.30 % (3913207)------------------------------
% 0.20/0.30 % (3913207)------------------------------
% 0.20/0.30 % (3913219)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3854529868:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.30 % (3913198) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3913181-3913198"...
% 0.20/0.30 % (3913198)...printing done.
% 0.20/0.30 % (3913198)Refutation found. Thanks to Tanya!
% 0.20/0.30 % SZS status Theorem for theBenchmark
% 0.20/0.30 % SZS output start Proof for theBenchmark
% 0.20/0.30 tff(type_def_5, type, collection: $tType).
% 0.20/0.30 tff(func_def_0, type, empty: collection).
% 0.20/0.30 tff(func_def_1, type, add: ($int * collection) > collection).
% 0.20/0.30 tff(func_def_2, type, remove: ($int * collection) > collection).
% 0.20/0.30 tff(func_def_3, type, count: collection > $int).
% 0.20/0.30 tff(pred_def_1, type, in: ($int * collection) > $o).
% 0.20/0.30 tff(f1,axiom,(
% 0.20/0.30 ! [X0 : $int] : ~in(X0,empty)),
% 0.20/0.30 file('/export/starexec/sandbox2/benchmark/Axioms/DAT002_0.ax',ax1)).
% 0.20/0.30 tff(f2,axiom,(
% 0.20/0.30 ! [X0 : $int,X1 : collection] : in(X0,add(X0,X1))),
% 0.20/0.30 file('/export/starexec/sandbox2/benchmark/Axioms/DAT002_0.ax',ax2)).
% 0.20/0.30 tff(f4,axiom,(
% 0.20/0.30 ! [X0 : $int,X1 : collection,X2 : $int] : ((in(X0,X1) | X0 = X2) <=> in(X0,add(X2,X1)))),
% 0.20/0.30 file('/export/starexec/sandbox2/benchmark/Axioms/DAT002_0.ax',ax4)).
% 0.20/0.30 tff(f5,axiom,(
% 0.20/0.30 ! [X0 : $int,X1 : collection,X2 : $int] : ((in(X0,X1) & X0 != X2) <=> in(X0,remove(X2,X1)))),
% 0.20/0.30 file('/export/starexec/sandbox2/benchmark/Axioms/DAT002_0.ax',ax5)).
% 0.20/0.30 tff(f7,axiom,(
% 0.20/0.30 ! [X0 : collection] : (X0 = empty <=> count(X0) = 0)),
% 0.20/0.30 file('/export/starexec/sandbox2/benchmark/Axioms/DAT002=1.ax',ax2)).
% 0.20/0.30 tff(f8,axiom,(
% 0.20/0.30 ! [X0 : $int,X1 : collection] : (~in(X0,X1) <=> count(add(X0,X1)) = $sum(count(X1),1))),
% 0.20/0.30 file('/export/starexec/sandbox2/benchmark/Axioms/DAT002=1.ax',ax3)).
% 0.20/0.30 tff(f9,axiom,(
% 0.20/0.30 ! [X0 : $int,X1 : collection] : (in(X0,X1) <=> count(add(X0,X1)) = count(X1))),
% 0.20/0.30 file('/export/starexec/sandbox2/benchmark/Axioms/DAT002=1.ax',ax4)).
% 0.20/0.30 tff(f10,axiom,(
% 0.20/0.30 ! [X0 : $int,X1 : collection] : (in(X0,X1) <=> count(remove(X0,X1)) = $difference(count(X1),1))),
% 0.20/0.30 file('/export/starexec/sandbox2/benchmark/Axioms/DAT002=1.ax',ax5)).
% 0.20/0.30 tff(f13,conjecture,(
% 0.20/0.30 count(add(5,remove(3,add(3,empty)))) = 1),
% 0.20/0.30 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)).
% 0.20/0.30 tff(f14,negated_conjecture,(
% 0.20/0.30 ~ count(add(5,remove(3,add(3,empty)))) = 1),
% 0.20/0.30 inference(negated_conjecture,[status(cth)],[f13])).
% 0.20/0.30 tff(f16,plain,(
% 0.20/0.30 ! [X0 : $int,X1 : collection] : (in(X0,X1) <=> count(remove(X0,X1)) = $sum(count(X1),$uminus(1)))),
% 0.20/0.30 inference(theory_normalization,[],[f10])).
% 0.20/0.30 tff(f17,definition,(
% 0.20/0.30 ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 0.20/0.30 introduced(theory,[tha_commutativity])).
% 0.20/0.30 tff(f18,definition,(
% 0.20/0.30 ( ! [X2 : $int,X0 : $int,X1 : $int] : ($sum(X0,$sum(X1,X2)) = $sum($sum(X0,X1),X2)) )),
% 0.20/0.30 introduced(theory,[tha_associativity])).
% 0.20/0.30 tff(f21,definition,(
% 0.20/0.30 ( ! [X0 : $int] : (0 = $sum(X0,$uminus(X0))) )),
% 0.20/0.30 introduced(theory,[tha_inverse_op_unit])).
% 0.20/0.30 tff(f22,definition,(
% 0.20/0.30 ( ! [X0 : $int] : (~$less(X0,X0)) )),
% 0.20/0.30 introduced(theory,[tha_non-reflexivity])).
% 0.20/0.30 tff(f24,definition,(
% 0.20/0.30 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,X0) | X0 = X1) )),
% 0.20/0.30 introduced(theory,[tha_order_totality])).
% 0.20/0.30 tff(f26,definition,(
% 0.20/0.30 ( ! [X0 : $int,X1 : $int] : ($less(X1,$sum(X0,1)) | $less(X0,X1)) )),
% 0.20/0.30 introduced(theory,[tha_order_plus_one_dichotomy])).
% 0.20/0.30 tff(f28,definition,(
% 0.20/0.30 ( ! [X0 : $int,X1 : $int] : (~$less(X1,$sum(X0,1)) | ~$less(X0,X1)) )),
% 0.20/0.30 introduced(theory,[tha_extra_integer_ordering])).
% 0.20/0.30 tff(f29,plain,(
% 0.20/0.30 1 != count(add(5,remove(3,add(3,empty))))),
% 0.20/0.30 inference(flattening,[],[f14])).
% 0.20/0.30 tff(f31,plain,(
% 0.20/0.30 ( ! [X0 : $int] : (~in(X0,empty)) )),
% 0.20/0.30 inference(cnf_transformation,[],[f1])).
% 0.20/0.30 tff(f32,plain,(
% 0.20/0.30 ( ! [X0 : $int,X1 : collection] : (in(X0,add(X0,X1))) )),
% 0.20/0.30 inference(cnf_transformation,[],[f2])).
% 0.20/0.30 tff(f36,plain,(
% 0.20/0.30 ( ! [X2 : $int,X0 : $int,X1 : collection] : (~in(X0,add(X2,X1)) | X0 = X2 | in(X0,X1)) )),
% 0.20/0.30 inference(cnf_transformation,[],[f4])).
% 0.20/0.30 tff(f39,plain,(
% 0.20/0.30 ( ! [X2 : $int,X0 : $int,X1 : collection] : (~in(X0,remove(X2,X1)) | in(X0,X1)) )),
% 0.20/0.30 inference(cnf_transformation,[],[f5])).
% 0.20/0.30 tff(f42,plain,(
% 0.20/0.30 ( ! [X0 : collection] : (count(X0) = 0 | empty != X0) )),
% 0.20/0.30 inference(cnf_transformation,[],[f7])).
% 0.20/0.30 tff(f44,plain,(
% 0.20/0.30 ( ! [X0 : $int,X1 : collection] : (count(add(X0,X1)) = $sum(count(X1),1) | in(X0,X1)) )),
% 0.20/0.30 inference(cnf_transformation,[],[f8])).
% 0.20/0.30 tff(f45,plain,(
% 0.20/0.30 ( ! [X0 : $int,X1 : collection] : (count(add(X0,X1)) != count(X1) | in(X0,X1)) )),
% 0.20/0.30 inference(cnf_transformation,[],[f9])).
% 0.20/0.30 tff(f46,plain,(
% 0.20/0.30 ( ! [X0 : $int,X1 : collection] : (~in(X0,X1) | count(add(X0,X1)) = count(X1)) )),
% 0.20/0.30 inference(cnf_transformation,[],[f9])).
% 0.20/0.30 tff(f48,plain,(
% 0.20/0.30 ( ! [X0 : $int,X1 : collection] : (count(remove(X0,X1)) = $sum(count(X1),$uminus(1)) | ~in(X0,X1)) )),
% 0.20/0.30 inference(cnf_transformation,[],[f16])).
% 0.20/0.30 tff(f52,plain,(
% 0.20/0.30 1 != count(add(5,remove(3,add(3,empty))))),
% 0.20/0.30 inference(cnf_transformation,[],[f29])).
% 0.20/0.30 tff(f55,plain,(
% 0.20/0.30 0 = count(empty)),
% 0.20/0.30 inference(equality_resolution,[],[f42])).
% 0.20/0.30 tff(f57,plain,(
% 0.20/0.30 ( ! [X0 : $int,X1 : collection] : (count(remove(X0,X1)) = $sum(count(X1),-1) | ~in(X0,X1)) )),
% 0.20/0.30 inference(evaluation,[],[f48])).
% 0.20/0.30 tff(f71,plain,(
% 0.20/0.30 ( ! [X0 : $int] : ($less(X0,$sum(X0,1))) )),
% 0.20/0.30 inference(resolution,[],[f26,f22])).
% 0.20/0.30 tff(f76,plain,(
% 0.20/0.30 ( ! [X0 : $int] : ($less(X0,$sum(1,X0))) )),
% 0.20/0.30 inference(superposition,[],[f71,f17])).
% 0.20/0.30 tff(f86,plain,(
% 0.20/0.30 ( ! [X0 : $int,X1 : $int] : (~$less(X0,X1) | ~$less(X1,$sum(1,X0))) )),
% 0.20/0.30 inference(superposition,[],[f28,f17])).
% 0.20/0.30 tff(f93,plain,(
% 0.20/0.30 ( ! [X0 : $int,X1 : $int] : (~$less(X1,X0) | $sum(X1,1) = X0 | $less($sum(X1,1),X0)) )),
% 0.20/0.30 inference(resolution,[],[f24,f28])).
% 0.20/0.30 tff(f169,plain,(
% 0.20/0.30 ( ! [X0 : $int,X1 : $int] : ($sum(0,X1) = $sum(X0,$sum($uminus(X0),X1))) )),
% 0.20/0.30 inference(superposition,[],[f18,f21])).
% 0.20/0.30 tff(f187,plain,(
% 0.20/0.30 ( ! [X0 : $int,X1 : $int] : ($sum(X0,$sum($uminus(X0),X1)) = X1) )),
% 0.20/0.30 inference(evaluation,[],[f169])).
% 0.20/0.30 tff(f197,plain,(
% 0.20/0.30 ( ! [X0 : $int,X1 : collection] : (in(X0,X1) | count(add(X0,X1)) = $sum(1,count(X1))) )),
% 0.20/0.30 inference(forward_demodulation,[],[f44,f17])).
% 0.20/0.30 tff(f199,plain,(
% 0.20/0.30 ( ! [X0 : $int,X1 : collection] : (~in(X0,X1) | count(remove(X0,X1)) = $sum(-1,count(X1))) )),
% 0.20/0.30 inference(forward_demodulation,[],[f57,f17])).
% 0.20/0.30 tff(f202,plain,(
% 0.20/0.30 ( ! [X0 : $int,X1 : collection] : (count(add(X0,X1)) = $sum(1,count(X1)) | count(add(X0,X1)) = count(X1)) )),
% 0.20/0.30 inference(resolution,[],[f197,f46])).
% 0.20/0.30 tff(f203,plain,(
% 0.20/0.30 ( ! [X0 : $int] : (count(add(X0,empty)) = $sum(1,count(empty))) )),
% 0.20/0.30 inference(resolution,[],[f197,f31])).
% 0.20/0.30 tff(f207,plain,(
% 0.20/0.30 ( ! [X0 : $int] : ($sum(1,0) = count(add(X0,empty))) )),
% 0.20/0.30 inference(forward_demodulation,[],[f203,f55])).
% 0.20/0.30 tff(f208,plain,(
% 0.20/0.30 ( ! [X0 : $int] : (1 = count(add(X0,empty))) )),
% 0.20/0.30 inference(evaluation,[],[f207])).
% 0.20/0.30 tff(f212,plain,(
% 0.20/0.30 ( ! [X0 : $int,X1 : collection] : (count(remove(X0,add(X0,X1))) = $sum(-1,count(add(X0,X1)))) )),
% 0.20/0.30 inference(resolution,[],[f199,f32])).
% 0.20/0.30 tff(f236,plain,(
% 0.20/0.30 ( ! [X0 : $int] : (~$less($sum(X0,1),$sum(1,X0))) )),
% 0.20/0.30 inference(resolution,[],[f86,f71])).
% 0.20/0.30 tff(f273,plain,(
% 0.20/0.30 ( ! [X0 : $int] : (~$less($sum($sum($uminus(1),X0),1),X0)) )),
% 0.20/0.30 inference(superposition,[],[f236,f187])).
% 0.20/0.30 tff(f275,plain,(
% 0.20/0.30 ( ! [X0 : $int] : ($less($sum($uminus(1),X0),X0)) )),
% 0.20/0.30 inference(superposition,[],[f76,f187])).
% 0.20/0.30 tff(f277,plain,(
% 0.20/0.30 ( ! [X0 : $int] : ($less($sum(-1,X0),X0)) )),
% 0.20/0.30 inference(evaluation,[],[f275])).
% 0.20/0.30 tff(f279,plain,(
% 0.20/0.30 ( ! [X0 : $int] : (~$less($sum($sum(-1,X0),1),X0)) )),
% 0.20/0.30 inference(evaluation,[],[f273])).
% 0.20/0.30 tff(f280,plain,(
% 0.20/0.30 ( ! [X0 : $int] : (~$less($sum(1,$sum(-1,X0)),X0)) )),
% 0.20/0.30 inference(forward_demodulation,[],[f279,f17])).
% 0.20/0.30 tff(f884,plain,(
% 0.20/0.30 ( ! [X0 : $int] : ($sum($sum(-1,X0),1) = X0 | $less($sum($sum(-1,X0),1),X0)) )),
% 0.20/0.30 inference(resolution,[],[f93,f277])).
% 0.20/0.30 tff(f897,plain,(
% 0.20/0.30 ( ! [X0 : $int] : ($sum(1,$sum(-1,X0)) = X0 | $less($sum($sum(-1,X0),1),X0)) )),
% 0.20/0.30 inference(forward_demodulation,[],[f884,f17])).
% 0.20/0.30 tff(f900,plain,(
% 0.20/0.30 ( ! [X0 : $int] : ($less($sum(1,$sum(-1,X0)),X0) | $sum(1,$sum(-1,X0)) = X0) )),
% 0.20/0.30 inference(forward_demodulation,[],[f897,f17])).
% 0.20/0.30 tff(f902,plain,(
% 0.20/0.30 ( ! [X0 : $int] : ($sum(1,$sum(-1,X0)) = X0) )),
% 0.20/0.30 inference(forward_subsumption_resolution,[],[f900,f280])).
% 0.20/0.30 tff(f1260,plain,(
% 0.20/0.30 1 != $sum(1,count(remove(3,add(3,empty)))) | count(add(5,remove(3,add(3,empty)))) = count(remove(3,add(3,empty)))),
% 0.20/0.30 inference(superposition,[],[f52,f202])).
% 0.20/0.30 tff(f1278,plain,(
% 0.20/0.30 1 != $sum(1,$sum(-1,count(add(3,empty)))) | count(add(5,remove(3,add(3,empty)))) = count(remove(3,add(3,empty)))),
% 0.20/0.30 inference(forward_demodulation,[],[f1260,f212])).
% 0.20/0.30 tff(f1281,plain,(
% 0.20/0.30 1 != count(add(3,empty)) | count(add(5,remove(3,add(3,empty)))) = count(remove(3,add(3,empty)))),
% 0.20/0.30 inference(forward_demodulation,[],[f1278,f902])).
% 0.20/0.30 tff(f1282,plain,(
% 0.20/0.30 count(add(5,remove(3,add(3,empty)))) = count(remove(3,add(3,empty)))),
% 0.20/0.30 inference(forward_subsumption_resolution,[],[f1281,f208])).
% 0.20/0.30 tff(f1283,plain,(
% 0.20/0.30 count(add(5,remove(3,add(3,empty)))) = $sum(-1,count(add(3,empty)))),
% 0.20/0.30 inference(forward_demodulation,[],[f1282,f212])).
% 0.20/0.30 tff(f1284,plain,(
% 0.20/0.30 count(add(5,remove(3,add(3,empty)))) = $sum(-1,1)),
% 0.20/0.30 inference(forward_demodulation,[],[f1283,f208])).
% 0.20/0.30 tff(f1285,plain,(
% 0.20/0.30 0 = count(add(5,remove(3,add(3,empty))))),
% 0.20/0.30 inference(evaluation,[],[f1284])).
% 0.20/0.30 tff(f1312,plain,(
% 0.20/0.30 0 != count(remove(3,add(3,empty))) | in(5,remove(3,add(3,empty)))),
% 0.20/0.30 inference(superposition,[],[f45,f1285])).
% 0.20/0.30 tff(f1321,plain,(
% 0.20/0.30 0 != $sum(-1,count(add(3,empty))) | in(5,remove(3,add(3,empty)))),
% 0.20/0.30 inference(forward_demodulation,[],[f1312,f212])).
% 0.20/0.30 tff(f1325,plain,(
% 0.20/0.30 0 != $sum(-1,1) | in(5,remove(3,add(3,empty)))),
% 0.20/0.30 inference(forward_demodulation,[],[f1321,f208])).
% 0.20/0.30 tff(f1326,plain,(
% 0.20/0.30 in(5,remove(3,add(3,empty)))),
% 0.20/0.30 inference(evaluation,[],[f1325])).
% 0.20/0.30 tff(f1337,plain,(
% 0.20/0.30 in(5,add(3,empty))),
% 0.20/0.30 inference(resolution,[],[f1326,f39])).
% 0.20/0.30 tff(f1352,plain,(
% 0.20/0.30 5 = 3 | in(5,empty)),
% 0.20/0.30 inference(resolution,[],[f1337,f36])).
% 0.20/0.30 tff(f1361,plain,(
% 0.20/0.30 in(5,empty)),
% 0.20/0.30 inference(evaluation,[],[f1352])).
% 0.20/0.30 tff(f1365,plain,(
% 0.20/0.30 $false),
% 0.20/0.30 inference(forward_subsumption_resolution,[],[f1361,f31])).
% 0.20/0.30 % SZS output end Proof for theBenchmark
% 0.20/0.30 % (3913198)------------------------------
% 0.20/0.30 % (3913198)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (3913198)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (3913198)CaDiCaL version: 2.1.3
% 0.20/0.30 % (3913198)Termination reason: Refutation
% 0.20/0.30 % (3913198)Time elapsed: 0.038 s
% 0.20/0.30 % (3913198)Peak memory usage: 12 MB
% 0.20/0.30 % (3913198)Instructions burned: 58 (million)
% 0.20/0.30 % (3913181)Success in time 0.073 s
% 0.20/0.30 % Vampire exiting
%------------------------------------------------------------------------------