%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV057^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n001.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:38:56 AM UTC 2026
% Result : Theorem 0.22s 0.30s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV057^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.21 % Computer : n001.cluster.edu
% 0.11/0.21 % Model : x86_64 x86_64
% 0.11/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.21 % Memory : 8046.5625MB
% 0.11/0.21 % OS : Linux 6.8.0-71-generic
% 0.11/0.21 % CPULimit : 300
% 0.11/0.21 % WCLimit : 300
% 0.11/0.21 % DateTime : Tue Sep 29 15:11:36 UTC 2026
% 0.11/0.21 % CPUTime :
% 0.11/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.24 Running first-order model finding
% 0.11/0.24 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.22/0.30 % (1365418)Will run a generic schedule for satisfiability detection.
% 0.22/0.30 % (1365424)% WARNING: option uhcvi not known.
% 0.22/0.30 % (1365427)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=170427515:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.22/0.30 % (1365427)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.22/0.30 % (1365426)dis+10_1_sil=32000:sp=arity:random_seed=2746143153:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.22/0.30 % (1365424)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2337393424:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.22/0.30 % (1365425)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=914050357:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.22/0.30 % (1365424)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.22/0.30 % (1365423)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2345442681_2999 on theBenchmark for (2999ds/0Mi)
% 0.22/0.30 % (1365424)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.22/0.30 % Exception at run slice level
% 0.22/0.30 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.22/0.30 % (1365428)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=636022030:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.22/0.30 % (1365429)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=237127499:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.22/0.30 % (1365427) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1365418-1365427"...
% 0.22/0.30 % (1365427)...printing done.
% 0.22/0.30 % (1365427)Refutation found. Thanks to Tanya!
% 0.22/0.30 % SZS status Theorem for theBenchmark
% 0.22/0.30 % SZS output start Proof for theBenchmark
% 0.22/0.30 thf(type_def_5, type, a: $tType).
% 0.22/0.30 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.22/0.30 thf(func_def_3, type, sK0: (a > $o)).
% 0.22/0.30 thf(func_def_4, type, sK1: ((a > a) > a)).
% 0.22/0.30 thf(func_def_5, type, sK2: (a > (a > a) > a)).
% 0.22/0.30 thf(func_def_6, type, sK3: ((a > a) > a)).
% 0.22/0.30 thf(func_def_7, type, db0: !>[X0: $tType]:(X0)).
% 0.22/0.30 thf(func_def_8, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.22/0.30 thf(func_def_9, type, db1: !>[X0: $tType]:(X0)).
% 0.22/0.30 thf(f1,conjecture,(
% 0.22/0.30 ! [X0 : (a > $o)] : ? [X1 : (a > a)] : (! [X3 : a] : ((X0 @ X3) => ? [X2 : a] : (! [X4 : a] : (((X3 = ((X1 @ X4))) & (X0 @ X4)) => (X4 = X2)) & (X3 = ((X1 @ X2))) & (X0 @ X2))) & ! [X2 : a] : ((X0 @ X2) => (X0 @ (X1 @ X2))))),
% 0.22/0.30 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cEQP1_1A_pme)).
% 0.22/0.30 thf(f2,negated_conjecture,(
% 0.22/0.30 ~ ! [X0 : (a > $o)] : ? [X1 : (a > a)] : (! [X3 : a] : ((X0 @ X3) => ? [X2 : a] : (! [X4 : a] : (((X3 = ((X1 @ X4))) & (X0 @ X4)) => (X4 = X2)) & (X3 = ((X1 @ X2))) & (X0 @ X2))) & ! [X2 : a] : ((X0 @ X2) => (X0 @ (X1 @ X2))))),
% 0.22/0.30 inference(negated_conjecture,[status(cth)],[f1])).
% 0.22/0.30 thf(f3,plain,(
% 0.22/0.30 ~ ! [X0 : (a > $o)] : ? [X1 : (a > a)] : (! [X2 : a] : ((X0 @ X2) => ? [X3 : a] : (! [X4 : a] : (((((X1 @ X4)) = X2) & (X0 @ X4)) => (X3 = X4)) & (((X1 @ X3)) = X2) & (X0 @ X3))) & ! [X5 : a] : ((X0 @ X5) => (X0 @ (X1 @ X5))))),
% 0.22/0.30 inference(rectify,[],[f2])).
% 0.22/0.30 thf(f4,plain,(
% 0.22/0.30 ~ ! [X0 : (a > $o)] : ? [X1 : (a > a)] : (! [X2 : a] : ((((X0 @ X2)) = $true) => ? [X3 : a] : (! [X4 : a] : (((((X1 @ X4)) = X2) & (((X0 @ X4)) = $true)) => (X3 = X4)) & (((X1 @ X3)) = X2) & (((X0 @ X3)) = $true))) & ! [X5 : a] : ((((X0 @ X5)) = $true) => (((X0 @ (X1 @ X5))) = $true)))),
% 0.22/0.30 inference(fool_elimination,[],[f3])).
% 0.22/0.30 thf(f5,plain,(
% 0.22/0.30 ? [X0 : (a > $o)] : ! [X1 : (a > a)] : (? [X2 : a] : (! [X3 : a] : (? [X4 : a] : ((X3 != X4) & ((((X1 @ X4)) = X2) & (((X0 @ X4)) = $true))) | (((X1 @ X3)) != X2) | (((X0 @ X3)) != $true)) & (((X0 @ X2)) = $true)) | ? [X5 : a] : ((((X0 @ (X1 @ X5))) != $true) & (((X0 @ X5)) = $true)))),
% 0.22/0.30 inference(ennf_transformation,[],[f4])).
% 0.22/0.30 thf(f6,plain,(
% 0.22/0.30 ? [X0 : (a > $o)] : ! [X1 : (a > a)] : (? [X2 : a] : (! [X3 : a] : (? [X4 : a] : ((X3 != X4) & (((X1 @ X4)) = X2) & (((X0 @ X4)) = $true)) | (((X1 @ X3)) != X2) | (((X0 @ X3)) != $true)) & (((X0 @ X2)) = $true)) | ? [X5 : a] : ((((X0 @ (X1 @ X5))) != $true) & (((X0 @ X5)) = $true)))),
% 0.22/0.30 inference(flattening,[],[f5])).
% 0.22/0.30 thf(f7,plain,(
% 0.22/0.30 ! [X1 : (a > a)] : ((! [X3 : a] : (((((sK2 @ X3 @ X1)) != X3) & (((sK1 @ X1)) = ((X1 @ (sK2 @ X3 @ X1)))) & ($true = ((sK0 @ (sK2 @ X3 @ X1))))) | (((X1 @ X3)) != ((sK1 @ X1))) | ($true != ((sK0 @ X3)))) & ($true = ((sK0 @ (sK1 @ X1))))) | (($true != ((sK0 @ (X1 @ (sK3 @ X1))))) & ($true = ((sK0 @ (sK3 @ X1))))))),
% 0.22/0.30 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,vAPP,vAPP,vAPP]),skolemize(X0,sK0),skolemize(X5,sK3 @ X1),skolemize(X5,sK3 @ X1),skolemize(X5,sK3 @ X1)],[f6])).
% 0.22/0.30 thf(f8,plain,(
% 0.22/0.30 ( ! [X1 : (a > a)] : (($true = ((sK0 @ (sK3 @ X1)))) | ($true = ((sK0 @ (sK1 @ X1))))) )),
% 0.22/0.30 inference(cnf_transformation,[],[f7])).
% 0.22/0.30 thf(f9,plain,(
% 0.22/0.30 ( ! [X1 : (a > a)] : (($true != ((sK0 @ (X1 @ (sK3 @ X1))))) | ($true = ((sK0 @ (sK1 @ X1))))) )),
% 0.22/0.30 inference(cnf_transformation,[],[f7])).
% 0.22/0.30 thf(f12,plain,(
% 0.22/0.30 ( ! [X3 : a,X1 : (a > a)] : ((((sK1 @ X1)) = ((X1 @ (sK2 @ X3 @ X1)))) | (((X1 @ X3)) != ((sK1 @ X1))) | ($true != ((sK0 @ X3))) | ($true = ((sK0 @ (sK3 @ X1))))) )),
% 0.22/0.30 inference(cnf_transformation,[],[f7])).
% 0.22/0.30 thf(f13,plain,(
% 0.22/0.30 ( ! [X3 : a,X1 : (a > a)] : ((((sK1 @ X1)) = ((X1 @ (sK2 @ X3 @ X1)))) | (((X1 @ X3)) != ((sK1 @ X1))) | ($true != ((sK0 @ X3))) | ($true != ((sK0 @ (X1 @ (sK3 @ X1)))))) )),
% 0.22/0.30 inference(cnf_transformation,[],[f7])).
% 0.22/0.30 thf(f14,plain,(
% 0.22/0.30 ( ! [X3 : a,X1 : (a > a)] : ((((sK2 @ X3 @ X1)) != X3) | (((X1 @ X3)) != ((sK1 @ X1))) | ($true != ((sK0 @ X3))) | ($true = ((sK0 @ (sK3 @ X1))))) )),
% 0.22/0.30 inference(cnf_transformation,[],[f7])).
% 0.22/0.30 thf(f15,plain,(
% 0.22/0.30 ( ! [X3 : a,X1 : (a > a)] : ((((sK2 @ X3 @ X1)) != X3) | ($true != ((sK0 @ (X1 @ (sK3 @ X1))))) | ($true != ((sK0 @ X3))) | (((X1 @ X3)) != ((sK1 @ X1)))) )),
% 0.22/0.30 inference(cnf_transformation,[],[f7])).
% 0.22/0.30 thf(f18,plain,(
% 0.22/0.30 ($true != $true) | ($true = ((sK0 @ (sK1 @ (^[Y0 : a]: (Y0)))))) | ($true = ((sK0 @ (sK1 @ (^[Y0 : a]: (Y0))))))),
% 0.22/0.30 inference(constrained_superposition,[],[f9,f8])).
% 0.22/0.30 thf(f21,plain,(
% 0.22/0.30 ($true != $true) | ($true = ((sK0 @ (sK1 @ (^[Y0 : a]: (Y0))))))),
% 0.22/0.30 inference(duplicate_literal_removal,[],[f18])).
% 0.22/0.30 thf(f22,plain,(
% 0.22/0.30 ($true = ((sK0 @ (sK1 @ (^[Y0 : a]: (Y0))))))),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f21])).
% 0.22/0.30 thf(f87,plain,(
% 0.22/0.30 ( ! [X0 : a,X1 : a] : ((((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | (((sK1 @ (^[Y0 : a]: (Y0)))) != (((^[Y0 : a]: (Y0)) @ X0))) | ($true != ((sK0 @ X0))) | ($true = ((sK0 @ (sK3 @ (^[Y0 : a]: (Y0)))))) | (((sK1 @ (^[Y0 : a]: (Y0)))) != (((^[Y0 : a]: (Y0)) @ X1))) | ($true != ((sK0 @ X1))) | ($true = ((sK0 @ (sK3 @ (^[Y0 : a]: (Y0)))))) | (X0 != X1)) )),
% 0.22/0.30 inference(constrained_superposition,[],[f14,f12])).
% 0.22/0.30 thf(f93,plain,(
% 0.22/0.30 ( ! [X0 : a,X1 : a] : ((((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | (((sK1 @ (^[Y0 : a]: (Y0)))) != (((^[Y0 : a]: (Y0)) @ X0))) | ($true != ((sK0 @ X0))) | ($true = ((sK0 @ (sK3 @ (^[Y0 : a]: (Y0)))))) | (((sK1 @ (^[Y0 : a]: (Y0)))) != (((^[Y0 : a]: (Y0)) @ X1))) | ($true != ((sK0 @ X1))) | (X0 != X1)) )),
% 0.22/0.30 inference(duplicate_literal_removal,[],[f87])).
% 0.22/0.30 thf(f94,plain,(
% 0.22/0.30 ( ! [X0 : a,X1 : a] : ((((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | (((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | ($true != ((sK0 @ X0))) | ($true = ((sK0 @ (sK3 @ (^[Y0 : a]: (Y0)))))) | (((sK1 @ (^[Y0 : a]: (Y0)))) != X1) | ($true != ((sK0 @ X1))) | (X0 != X1)) )),
% 0.22/0.30 inference(beta-eta_normalization,[],[f93])).
% 0.22/0.30 thf(f95,plain,(
% 0.22/0.30 ( ! [X0 : a,X1 : a] : ((((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | ($true != ((sK0 @ X0))) | ($true = ((sK0 @ (sK3 @ (^[Y0 : a]: (Y0)))))) | (((sK1 @ (^[Y0 : a]: (Y0)))) != X1) | ($true != ((sK0 @ X1))) | (X0 != X1)) )),
% 0.22/0.30 inference(duplicate_literal_removal,[],[f94])).
% 0.22/0.30 thf(f115,definition,(
% 0.22/0.30 spl4_3 <=> ($true = ((sK0 @ (sK3 @ (^[Y0 : a]: (Y0))))))),
% 0.22/0.30 introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition])).
% 0.22/0.30 thf(f117,plain,(
% 0.22/0.30 ($true = ((sK0 @ (sK3 @ (^[Y0 : a]: (Y0)))))) | ~spl4_3),
% 0.22/0.30 inference(avatar_component_clause,[],[f115])).
% 0.22/0.30 thf(f119,definition,(
% 0.22/0.30 spl4_4 <=> ! [X0 : a,X1 : a] : ((((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | (X0 != X1) | (((sK1 @ (^[Y0 : a]: (Y0)))) != X1) | ($true != ((sK0 @ X1))) | ($true != ((sK0 @ X0))))),
% 0.22/0.30 introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition])).
% 0.22/0.30 thf(f120,plain,(
% 0.22/0.30 ( ! [X0 : a,X1 : a] : ((((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | (((sK1 @ (^[Y0 : a]: (Y0)))) != X1) | ($true != ((sK0 @ X1))) | ($true != ((sK0 @ X0))) | (X0 != X1)) ) | ~spl4_4),
% 0.22/0.30 inference(avatar_component_clause,[],[f119])).
% 0.22/0.30 thf(f121,plain,(
% 0.22/0.30 spl4_3 | spl4_4),
% 0.22/0.30 inference(avatar_split_clause,[],[f95,f119,f115])).
% 0.22/0.30 thf(f175,plain,(
% 0.22/0.30 ( ! [X0 : a,X1 : a] : ((((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | ($true != ((sK0 @ ((^[Y0 : a]: (Y0)) @ (sK3 @ (^[Y0 : a]: (Y0))))))) | ($true != ((sK0 @ X0))) | (((sK1 @ (^[Y0 : a]: (Y0)))) != (((^[Y0 : a]: (Y0)) @ X0))) | (((sK1 @ (^[Y0 : a]: (Y0)))) != (((^[Y0 : a]: (Y0)) @ X1))) | ($true != ((sK0 @ X1))) | ($true != ((sK0 @ ((^[Y0 : a]: (Y0)) @ (sK3 @ (^[Y0 : a]: (Y0))))))) | (X0 != X1)) )),
% 0.22/0.30 inference(constrained_superposition,[],[f15,f13])).
% 0.22/0.30 thf(f191,plain,(
% 0.22/0.30 ( ! [X0 : a,X1 : a] : ((((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | ($true != ((sK0 @ ((^[Y0 : a]: (Y0)) @ (sK3 @ (^[Y0 : a]: (Y0))))))) | ($true != ((sK0 @ X0))) | (((sK1 @ (^[Y0 : a]: (Y0)))) != (((^[Y0 : a]: (Y0)) @ X0))) | (((sK1 @ (^[Y0 : a]: (Y0)))) != (((^[Y0 : a]: (Y0)) @ X1))) | ($true != ((sK0 @ X1))) | (X0 != X1)) )),
% 0.22/0.30 inference(duplicate_literal_removal,[],[f175])).
% 0.22/0.30 thf(f192,plain,(
% 0.22/0.30 ( ! [X0 : a,X1 : a] : ((((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | ($true != ((sK0 @ (sK3 @ (^[Y0 : a]: (Y0)))))) | ($true != ((sK0 @ X0))) | (((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | (((sK1 @ (^[Y0 : a]: (Y0)))) != X1) | ($true != ((sK0 @ X1))) | (X0 != X1)) )),
% 0.22/0.30 inference(beta-eta_normalization,[],[f191])).
% 0.22/0.30 thf(f193,plain,(
% 0.22/0.30 ( ! [X0 : a,X1 : a] : ((((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | ($true != ((sK0 @ (sK3 @ (^[Y0 : a]: (Y0)))))) | ($true != ((sK0 @ X0))) | (((sK1 @ (^[Y0 : a]: (Y0)))) != X1) | ($true != ((sK0 @ X1))) | (X0 != X1)) )),
% 0.22/0.30 inference(duplicate_literal_removal,[],[f192])).
% 0.22/0.30 thf(f211,plain,(
% 0.22/0.30 ( ! [X0 : a,X1 : a] : ((((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | ($true != ((sK0 @ X0))) | (((sK1 @ (^[Y0 : a]: (Y0)))) != X1) | ($true != ((sK0 @ X1))) | (X0 != X1)) ) | ~spl4_3),
% 0.22/0.30 inference(forward_subsumption_resolution,[],[f193,f117])).
% 0.22/0.30 thf(f213,plain,(
% 0.22/0.30 spl4_4 | ~spl4_3),
% 0.22/0.30 inference(avatar_split_clause,[],[f211,f115,f119])).
% 0.22/0.30 thf(f292,plain,(
% 0.22/0.30 ( ! [X0 : a] : (($true != $true) | (((sK1 @ (^[Y0 : a]: (Y0)))) != ((sK1 @ (^[Y0 : a]: (Y0))))) | (((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | ($true != ((sK0 @ X0))) | (((sK1 @ (^[Y0 : a]: (Y0)))) != X0)) ) | ~spl4_4),
% 0.22/0.30 inference(constrained_superposition,[],[f120,f22])).
% 0.22/0.30 thf(f304,plain,(
% 0.22/0.30 ( ! [X0 : a] : (($true != $true) | (((sK1 @ (^[Y0 : a]: (Y0)))) != ((sK1 @ (^[Y0 : a]: (Y0))))) | (((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | ($true != ((sK0 @ X0)))) ) | ~spl4_4),
% 0.22/0.30 inference(duplicate_literal_removal,[],[f292])).
% 0.22/0.30 thf(f305,plain,(
% 0.22/0.30 ( ! [X0 : a] : ((((sK1 @ (^[Y0 : a]: (Y0)))) != X0) | ($true != ((sK0 @ X0)))) ) | ~spl4_4),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f304])).
% 0.22/0.30 thf(f327,plain,(
% 0.22/0.30 ($true != $true) | (((sK1 @ (^[Y0 : a]: (Y0)))) != ((sK1 @ (^[Y0 : a]: (Y0))))) | ~spl4_4),
% 0.22/0.30 inference(constrained_superposition,[],[f305,f22])).
% 0.22/0.30 thf(f339,plain,(
% 0.22/0.30 $false | ~spl4_4),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f327])).
% 0.22/0.30 thf(f340,plain,(
% 0.22/0.30 ~spl4_4),
% 0.22/0.30 inference(avatar_contradiction_clause,[],[f339])).
% 0.22/0.30 cnf(s2, plain, spl4_3 | spl4_4, inference(sat_conversion,[],[f121])).
% 0.22/0.30 cnf(s5, plain, ~spl4_3 | spl4_4, inference(sat_conversion,[],[f213])).
% 0.22/0.30 cnf(s7, plain, ~spl4_4, inference(sat_conversion,[],[f340])).
% 0.22/0.30 cnf(s8, plain, ~spl4_3, inference(rat,[],[s5,s7])).
% 0.22/0.30 cnf(s9, plain, $false, inference(rat,[],[s2,s7,s8])).
% 0.22/0.30 thf(f343,plain,(
% 0.22/0.30 $false),
% 0.22/0.30 inference(avatar_sat_refutation,[],[s9])).
% 0.22/0.30 % SZS output end Proof for theBenchmark
% 0.22/0.30 % (1365427)------------------------------
% 0.22/0.30 % (1365427)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.30 % (1365427)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.30 % (1365427)CaDiCaL version: 2.1.3
% 0.22/0.30 % (1365427)Termination reason: Refutation
% 0.22/0.30 % (1365427)Time elapsed: 0.014 s
% 0.22/0.30 % (1365427)Peak memory usage: 13 MB
% 0.22/0.30 % (1365427)Instructions burned: 46 (million)
% 0.22/0.30 % (1365418)Success in time 0.049 s
% 0.22/0.30 % Vampire exiting
%------------------------------------------------------------------------------