%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU806^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.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 : Wed Sep 30 08:31:34 AM UTC 2026
% Result : Theorem 0.22s 0.38s
% Output : Refutation 0.30s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU806^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.27 % Computer : n019.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.22/0.27 % CPULimit : 300
% 0.22/0.27 % WCLimit : 300
% 0.22/0.27 % DateTime : Tue Sep 29 14:32:33 UTC 2026
% 0.22/0.28 % CPUTime :
% 0.22/0.28 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.32 Running higher-order theorem proving
% 0.22/0.34 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.38 % (861944)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.38 % (861954)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3618486412:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.22/0.38 % (861954) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-861944-861954"...
% 0.22/0.38 % (861954)...printing done.
% 0.22/0.38 % (861955)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.22/0.38 % (861955)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.22/0.38 % (861954)Refutation found. Thanks to Tanya!
% 0.22/0.38 % SZS status Theorem for theBenchmark
% 0.22/0.38 % SZS output start Proof for theBenchmark
% 0.22/0.38 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.22/0.38 thf(func_def_0, type, in: ($i > $i > $o)).
% 0.22/0.38 thf(func_def_2, type, setadjoin: ($i > $i > $i)).
% 0.22/0.38 thf(func_def_3, type, foundationAx: $o).
% 0.22/0.38 thf(func_def_5, type, setadjoinIL: $o).
% 0.22/0.38 thf(func_def_6, type, uniqinunit: $o).
% 0.22/0.38 thf(func_def_7, type, in__Cong: $o).
% 0.22/0.38 thf(func_def_19, type, sK9: ($i > $i)).
% 0.22/0.38 thf(func_def_21, type, sK11: ($i > $i)).
% 0.22/0.38 thf(func_def_23, type, vNOT: ($o > $o)).
% 0.22/0.38 thf(f1,axiom,(
% 0.22/0.38 (foundationAx = ! [X0 : $i] : (? [X1 : $i] : (in @ X1 @ X0) => ? [X2 : $i] : (~ ? [X1 : $i] : ((in @ X1 @ X0) & (in @ X1 @ X2)) & (in @ X2 @ X0))))),
% 0.22/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',foundationAx)).
% 0.22/0.38 thf(f2,axiom,(
% 0.22/0.38 (setadjoinIL = ! [X0 : $i,X1 : $i] : (in @ X0 @ (setadjoin @ X0 @ X1)))),
% 0.22/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setadjoinIL)).
% 0.22/0.38 thf(f3,axiom,(
% 0.22/0.38 (! [X0 : $i,X1 : $i] : ((in @ X0 @ (setadjoin @ X1 @ emptyset)) => (X0 = X1)) = uniqinunit)),
% 0.22/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',uniqinunit)).
% 0.22/0.38 thf(f5,conjecture,(
% 0.22/0.38 foundationAx => (setadjoinIL => (uniqinunit => (in__Cong => ! [X0 : $i] : ~(in @ X0 @ X0))))),
% 0.22/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',notinself)).
% 0.22/0.38 thf(f6,negated_conjecture,(
% 0.22/0.38 ~(foundationAx => (setadjoinIL => (uniqinunit => (in__Cong => ! [X0 : $i] : ~(in @ X0 @ X0)))))),
% 0.22/0.38 inference(negated_conjecture,[status(cth)],[f5])).
% 0.22/0.38 thf(f7,plain,(
% 0.22/0.38 (foundationAx = ! [X0 : $i] : (? [X1 : $i] : (in @ X1 @ X0) => ? [X2 : $i] : (~ ? [X3 : $i] : ((in @ X3 @ X0) & (in @ X3 @ X2)) & (in @ X2 @ X0))))),
% 0.22/0.38 inference(rectify,[],[f1])).
% 0.22/0.38 thf(f8,plain,(
% 0.22/0.38 (foundationAx = $true) <=> ! [X0 : $i] : (? [X1 : $i] : (((in @ X1 @ X0)) = $true) => ? [X2 : $i] : (~ ? [X3 : $i] : (($true = ((in @ X3 @ X0))) & ($true = ((in @ X3 @ X2)))) & (((in @ X2 @ X0)) = $true)))),
% 0.22/0.38 inference(fool_elimination,[],[f7])).
% 0.22/0.38 thf(f11,plain,(
% 0.22/0.38 ~(foundationAx => (setadjoinIL => (uniqinunit => (in__Cong => ! [X0 : $i] : ~(in @ X0 @ X0)))))),
% 0.22/0.38 inference(rectify,[],[f6])).
% 0.22/0.38 thf(f12,plain,(
% 0.22/0.38 ~((foundationAx = $true) => ((setadjoinIL = $true) => ((uniqinunit = $true) => ((in__Cong = $true) => ! [X0 : $i] : ~ (((in @ X0 @ X0)) = $true)))))),
% 0.22/0.38 inference(fool_elimination,[],[f11])).
% 0.22/0.38 thf(f13,plain,(
% 0.22/0.38 (! [X0 : $i,X1 : $i] : ((in @ X0 @ (setadjoin @ X1 @ emptyset)) => (X0 = X1)) = uniqinunit)),
% 0.22/0.38 inference(rectify,[],[f3])).
% 0.22/0.38 thf(f14,plain,(
% 0.22/0.38 ! [X0 : $i,X1 : $i] : ((((in @ X0 @ (setadjoin @ X1 @ emptyset))) = $true) => (X0 = X1)) <=> (uniqinunit = $true)),
% 0.22/0.38 inference(fool_elimination,[],[f13])).
% 0.22/0.38 thf(f15,plain,(
% 0.22/0.38 (setadjoinIL = ! [X0 : $i,X1 : $i] : (in @ X0 @ (setadjoin @ X0 @ X1)))),
% 0.22/0.38 inference(rectify,[],[f2])).
% 0.22/0.38 thf(f16,plain,(
% 0.22/0.38 ! [X0 : $i,X1 : $i] : (((in @ X0 @ (setadjoin @ X0 @ X1))) = $true) <=> (setadjoinIL = $true)),
% 0.22/0.38 inference(fool_elimination,[],[f15])).
% 0.22/0.38 thf(f17,plain,(
% 0.22/0.38 ~((foundationAx = $true) => ((setadjoinIL = $true) => ((uniqinunit = $true) => ((in__Cong = $true) => ! [X0 : $i] : (((in @ X0 @ X0)) != $true)))))),
% 0.22/0.38 inference(flattening,[],[f12])).
% 0.22/0.38 thf(f19,plain,(
% 0.22/0.38 (((? [X0 : $i] : (((in @ X0 @ X0)) = $true) & (in__Cong = $true)) & (uniqinunit = $true)) & (setadjoinIL = $true)) & (foundationAx = $true)),
% 0.22/0.38 inference(ennf_transformation,[],[f17])).
% 0.22/0.38 thf(f20,plain,(
% 0.22/0.38 (setadjoinIL = $true) & ? [X0 : $i] : (((in @ X0 @ X0)) = $true) & (in__Cong = $true) & (uniqinunit = $true) & (foundationAx = $true)),
% 0.22/0.39 inference(flattening,[],[f19])).
% 0.22/0.39 thf(f21,plain,(
% 0.22/0.39 (foundationAx = $true) <=> ! [X0 : $i] : (? [X2 : $i] : ((((in @ X2 @ X0)) = $true) & ! [X3 : $i] : (($true != ((in @ X3 @ X2))) | ($true != ((in @ X3 @ X0))))) | ! [X1 : $i] : (((in @ X1 @ X0)) != $true))),
% 0.22/0.39 inference(ennf_transformation,[],[f8])).
% 0.22/0.39 thf(f22,plain,(
% 0.22/0.39 ! [X0 : $i,X1 : $i] : ((((in @ X0 @ (setadjoin @ X1 @ emptyset))) != $true) | (X0 = X1)) <=> (uniqinunit = $true)),
% 0.22/0.39 inference(ennf_transformation,[],[f14])).
% 0.22/0.39 thf(f23,plain,(
% 0.22/0.39 (! [X0 : $i,X1 : $i] : (((in @ X0 @ (setadjoin @ X0 @ X1))) = $true) | (setadjoinIL != $true)) & ((setadjoinIL = $true) | ? [X0 : $i,X1 : $i] : (((in @ X0 @ (setadjoin @ X0 @ X1))) != $true))),
% 0.22/0.39 inference(nnf_transformation,[],[f16])).
% 0.22/0.39 thf(f24,plain,(
% 0.22/0.39 (! [X0 : $i,X1 : $i] : (((in @ X0 @ (setadjoin @ X0 @ X1))) = $true) | (setadjoinIL != $true)) & ((setadjoinIL = $true) | ? [X2 : $i,X3 : $i] : ($true != ((in @ X2 @ (setadjoin @ X2 @ X3)))))),
% 0.22/0.39 inference(rectify,[],[f23])).
% 0.22/0.39 thf(f25,plain,(
% 0.22/0.39 (! [X0 : $i,X1 : $i] : (((in @ X0 @ (setadjoin @ X0 @ X1))) = $true) | (setadjoinIL != $true)) & ((setadjoinIL = $true) | (((in @ sK0 @ (setadjoin @ sK0 @ sK1))) != $true))),
% 0.22/0.39 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X2,sK0),skolemize(X3,sK1)],[f24])).
% 0.22/0.39 thf(f29,plain,(
% 0.22/0.39 (! [X0 : $i,X1 : $i] : ((((in @ X0 @ (setadjoin @ X1 @ emptyset))) != $true) | (X0 = X1)) | (uniqinunit != $true)) & ((uniqinunit = $true) | ? [X0 : $i,X1 : $i] : ((((in @ X0 @ (setadjoin @ X1 @ emptyset))) = $true) & (X0 != X1)))),
% 0.22/0.39 inference(nnf_transformation,[],[f22])).
% 0.22/0.39 thf(f30,plain,(
% 0.22/0.39 (! [X0 : $i,X1 : $i] : ((((in @ X0 @ (setadjoin @ X1 @ emptyset))) != $true) | (X0 = X1)) | (uniqinunit != $true)) & ((uniqinunit = $true) | ? [X2 : $i,X3 : $i] : (($true = ((in @ X2 @ (setadjoin @ X3 @ emptyset)))) & (X2 != X3)))),
% 0.22/0.39 inference(rectify,[],[f29])).
% 0.22/0.39 thf(f31,plain,(
% 0.22/0.39 (! [X0 : $i,X1 : $i] : ((((in @ X0 @ (setadjoin @ X1 @ emptyset))) != $true) | (X0 = X1)) | (uniqinunit != $true)) & ((uniqinunit = $true) | ((((in @ sK6 @ (setadjoin @ sK7 @ emptyset))) = $true) & (sK7 != sK6)))),
% 0.22/0.39 inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X2,sK6),skolemize(X3,sK7)],[f30])).
% 0.22/0.39 thf(f32,plain,(
% 0.22/0.39 ((foundationAx = $true) | ? [X0 : $i] : (! [X2 : $i] : ((((in @ X2 @ X0)) != $true) | ? [X3 : $i] : (($true = ((in @ X3 @ X2))) & ($true = ((in @ X3 @ X0))))) & ? [X1 : $i] : (((in @ X1 @ X0)) = $true))) & (! [X0 : $i] : (? [X2 : $i] : ((((in @ X2 @ X0)) = $true) & ! [X3 : $i] : (($true != ((in @ X3 @ X2))) | ($true != ((in @ X3 @ X0))))) | ! [X1 : $i] : (((in @ X1 @ X0)) != $true)) | (foundationAx != $true))),
% 0.22/0.39 inference(nnf_transformation,[],[f21])).
% 0.22/0.39 thf(f33,plain,(
% 0.22/0.39 ((foundationAx = $true) | ? [X0 : $i] : (! [X1 : $i] : ((((in @ X1 @ X0)) != $true) | ? [X2 : $i] : ((((in @ X2 @ X1)) = $true) & (((in @ X2 @ X0)) = $true))) & ? [X3 : $i] : ($true = ((in @ X3 @ X0))))) & (! [X4 : $i] : (? [X5 : $i] : ((((in @ X5 @ X4)) = $true) & ! [X6 : $i] : ((((in @ X6 @ X5)) != $true) | ($true != ((in @ X6 @ X4))))) | ! [X7 : $i] : (((in @ X7 @ X4)) != $true)) | (foundationAx != $true))),
% 0.22/0.39 inference(rectify,[],[f32])).
% 0.22/0.39 thf(f34,plain,(
% 0.22/0.39 ((foundationAx = $true) | (! [X1 : $i] : (($true != ((in @ X1 @ sK8))) | ((((in @ (sK9 @ X1) @ X1)) = $true) & (((in @ (sK9 @ X1) @ sK8)) = $true))) & ($true = ((in @ sK10 @ sK8))))) & (! [X4 : $i] : (((((in @ (sK11 @ X4) @ X4)) = $true) & ! [X6 : $i] : (($true != ((in @ X6 @ (sK11 @ X4)))) | ($true != ((in @ X6 @ X4))))) | ! [X7 : $i] : (((in @ X7 @ X4)) != $true)) | (foundationAx != $true))),
% 0.22/0.39 inference(skolemize,[status(esa),new_symbols(skolem,[sK8,vAPP,sK10,vAPP]),skolemize(X0,sK8),skolemize(X5,sK11 @ X4),skolemize(X3,sK10),skolemize(X5,sK11 @ X4)],[f33])).
% 0.22/0.39 thf(f35,plain,(
% 0.22/0.39 (setadjoinIL = $true) & (((in @ sK12 @ sK12)) = $true) & (in__Cong = $true) & (uniqinunit = $true) & (foundationAx = $true)),
% 0.22/0.39 inference(skolemize,[status(esa),new_symbols(skolem,[sK12]),skolemize(X0,sK12)],[f20])).
% 0.22/0.39 thf(f37,plain,(
% 0.22/0.39 ( ! [X0 : $i,X1 : $i] : ((((in @ X0 @ (setadjoin @ X0 @ X1))) = $true) | (setadjoinIL != $true)) )),
% 0.22/0.39 inference(cnf_transformation,[],[f25])).
% 0.22/0.39 thf(f44,plain,(
% 0.22/0.39 ( ! [X0 : $i,X1 : $i] : ((((in @ X0 @ (setadjoin @ X1 @ emptyset))) != $true) | (X0 = X1) | (uniqinunit != $true)) )),
% 0.22/0.39 inference(cnf_transformation,[],[f31])).
% 0.22/0.39 thf(f45,plain,(
% 0.22/0.39 ( ! [X6 : $i,X7 : $i,X4 : $i] : (($true != ((in @ X6 @ (sK11 @ X4)))) | ($true != ((in @ X6 @ X4))) | (((in @ X7 @ X4)) != $true) | (foundationAx != $true)) )),
% 0.22/0.39 inference(cnf_transformation,[],[f34])).
% 0.22/0.39 thf(f46,plain,(
% 0.22/0.39 ( ! [X7 : $i,X4 : $i] : ((((in @ (sK11 @ X4) @ X4)) = $true) | (((in @ X7 @ X4)) != $true) | (foundationAx != $true)) )),
% 0.22/0.39 inference(cnf_transformation,[],[f34])).
% 0.22/0.39 thf(f50,plain,(
% 0.22/0.39 (foundationAx = $true)),
% 0.22/0.39 inference(cnf_transformation,[],[f35])).
% 0.22/0.39 thf(f51,plain,(
% 0.22/0.39 (uniqinunit = $true)),
% 0.22/0.39 inference(cnf_transformation,[],[f35])).
% 0.22/0.39 thf(f53,plain,(
% 0.22/0.39 (((in @ sK12 @ sK12)) = $true)),
% 0.22/0.39 inference(cnf_transformation,[],[f35])).
% 0.22/0.39 thf(f54,plain,(
% 0.22/0.39 (setadjoinIL = $true)),
% 0.30/0.39 inference(cnf_transformation,[],[f35])).
% 0.30/0.39 thf(f57,plain,(
% 0.30/0.39 ( ! [X0 : $i,X1 : $i] : (($true != $true) | (((in @ X0 @ (setadjoin @ X0 @ X1))) = $true)) )),
% 0.30/0.39 inference(definition_unfolding,[],[f37,f54])).
% 0.30/0.39 thf(f63,plain,(
% 0.30/0.39 ( ! [X0 : $i,X1 : $i] : ((((in @ X0 @ (setadjoin @ X1 @ emptyset))) != $true) | ($true != $true) | (X0 = X1)) )),
% 0.30/0.39 inference(definition_unfolding,[],[f44,f51])).
% 0.30/0.39 thf(f69,plain,(
% 0.30/0.39 ( ! [X7 : $i,X4 : $i] : ((((in @ (sK11 @ X4) @ X4)) = $true) | ($true != $true) | (((in @ X7 @ X4)) != $true)) )),
% 0.30/0.39 inference(definition_unfolding,[],[f46,f50])).
% 0.30/0.39 thf(f70,plain,(
% 0.30/0.39 ( ! [X6 : $i,X7 : $i,X4 : $i] : (($true != ((in @ X6 @ X4))) | (((in @ X7 @ X4)) != $true) | ($true != ((in @ X6 @ (sK11 @ X4)))) | ($true != $true)) )),
% 0.30/0.39 inference(definition_unfolding,[],[f45,f50])).
% 0.30/0.39 thf(f73,plain,(
% 0.30/0.39 ( ! [X0 : $i,X1 : $i] : ((((in @ X0 @ (setadjoin @ X1 @ emptyset))) != $true) | (X0 = X1)) )),
% 0.30/0.39 inference(trivial_inequality_removal,[],[f63])).
% 0.30/0.39 thf(f74,plain,(
% 0.30/0.39 ( ! [X7 : $i,X4 : $i] : ((((in @ X7 @ X4)) != $true) | (((in @ (sK11 @ X4) @ X4)) = $true)) )),
% 0.30/0.39 inference(trivial_inequality_removal,[],[f69])).
% 0.30/0.39 thf(f75,plain,(
% 0.30/0.39 ( ! [X0 : $i,X1 : $i] : ((((in @ X0 @ (setadjoin @ X0 @ X1))) = $true)) )),
% 0.30/0.39 inference(trivial_inequality_removal,[],[f57])).
% 0.30/0.39 thf(f76,plain,(
% 0.30/0.39 ( ! [X6 : $i,X7 : $i,X4 : $i] : (($true != ((in @ X6 @ (sK11 @ X4)))) | (((in @ X7 @ X4)) != $true) | ($true != ((in @ X6 @ X4)))) )),
% 0.30/0.39 inference(trivial_inequality_removal,[],[f70])).
% 0.30/0.39 thf(f84,plain,(
% 0.30/0.39 ( ! [X0 : $i,X1 : $i] : (($true != $true) | ($true = ((in @ (sK11 @ (setadjoin @ X0 @ X1)) @ (setadjoin @ X0 @ X1))))) )),
% 0.30/0.39 inference(constrained_superposition,[],[f74,f75])).
% 0.30/0.39 thf(f85,plain,(
% 0.30/0.39 ( ! [X0 : $i,X1 : $i] : (($true = ((in @ (sK11 @ (setadjoin @ X0 @ X1)) @ (setadjoin @ X0 @ X1))))) )),
% 0.30/0.39 inference(trivial_inequality_removal,[],[f84])).
% 0.30/0.39 thf(f87,plain,(
% 0.30/0.39 ( ! [X0 : $i] : ((((sK11 @ (setadjoin @ X0 @ emptyset))) = X0) | ($true != $true)) )),
% 0.30/0.39 inference(constrained_superposition,[],[f73,f85])).
% 0.30/0.39 thf(f88,plain,(
% 0.30/0.39 ( ! [X0 : $i] : ((((sK11 @ (setadjoin @ X0 @ emptyset))) = X0)) )),
% 0.30/0.39 inference(trivial_inequality_removal,[],[f87])).
% 0.30/0.39 thf(f89,plain,(
% 0.30/0.39 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != ((in @ X2 @ (setadjoin @ X0 @ emptyset)))) | (((in @ X1 @ (setadjoin @ X0 @ emptyset))) != $true) | (((in @ X1 @ X0)) != $true)) )),
% 0.30/0.39 inference(constrained_superposition,[],[f76,f88])).
% 0.30/0.39 thf(f92,plain,(
% 0.30/0.39 ( ! [X0 : $i,X1 : $i] : ((((in @ X1 @ X0)) != $true) | (((in @ X1 @ (setadjoin @ X0 @ emptyset))) != $true) | ($true != $true)) )),
% 0.30/0.39 inference(constrained_superposition,[],[f89,f85])).
% 0.30/0.39 thf(f93,plain,(
% 0.30/0.39 ( ! [X0 : $i,X1 : $i] : ((((in @ X1 @ (setadjoin @ X0 @ emptyset))) != $true) | (((in @ X1 @ X0)) != $true)) )),
% 0.30/0.39 inference(trivial_inequality_removal,[],[f92])).
% 0.30/0.39 thf(f95,plain,(
% 0.30/0.39 ( ! [X0 : $i] : (($true != $true) | (((in @ X0 @ X0)) != $true)) )),
% 0.30/0.39 inference(constrained_superposition,[],[f93,f75])).
% 0.30/0.39 thf(f97,plain,(
% 0.30/0.39 ( ! [X0 : $i] : ((((in @ X0 @ X0)) != $true)) )),
% 0.30/0.39 inference(trivial_inequality_removal,[],[f95])).
% 0.30/0.39 thf(f100,plain,(
% 0.30/0.39 ($true != $true)),
% 0.30/0.39 inference(constrained_superposition,[],[f97,f53])).
% 0.30/0.39 thf(f101,plain,(
% 0.30/0.39 $false),
% 0.30/0.39 inference(trivial_inequality_removal,[],[f100])).
% 0.30/0.39 % SZS output end Proof for theBenchmark
% 0.30/0.39 % (861954)------------------------------
% 0.30/0.39 % (861954)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.39 % (861954)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.39 % (861954)CaDiCaL version: 2.1.3
% 0.30/0.39 % (861954)Termination reason: Refutation
% 0.30/0.39 % (861954)Time elapsed: 0.005 s
% 0.30/0.39 % (861954)Peak memory usage: 12 MB
% 0.30/0.39 % (861954)Instructions burned: 7 (million)
% 0.30/0.39 % (861944)Success in time 0.032 s
% 0.30/0.39 % Vampire exiting
%------------------------------------------------------------------------------