%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET171^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:23:15 AM UTC 2026
% Result : Theorem 0.22s 0.26s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET171^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.19 % Computer : n017.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Tue Sep 29 13:32:37 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running higher-order theorem proving
% 0.07/0.23 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.26 % (338060)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.26 % (338069)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=2728594452:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.22/0.26 % (338069) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-338060-338069"...
% 0.22/0.26 % (338069)...printing done.
% 0.22/0.26 % (338072)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.26 % (338072)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.26 % (338069)Refutation found. Thanks to Tanya!
% 0.22/0.26 % SZS status Theorem for theBenchmark
% 0.22/0.26 % SZS output start Proof for theBenchmark
% 0.22/0.26 thf(type_def_5, type, a: $tType).
% 0.22/0.26 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.22/0.26 thf(func_def_1, type, vOR: ($o > $o > $o)).
% 0.22/0.26 thf(func_def_2, type, vAND: ($o > $o > $o)).
% 0.22/0.26 thf(func_def_3, type, db0: !>[X0: $tType]:(X0)).
% 0.22/0.26 thf(func_def_4, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.22/0.26 thf(func_def_5, type, sK0: (a > $o)).
% 0.22/0.26 thf(func_def_6, type, sK1: (a > $o)).
% 0.22/0.26 thf(func_def_7, type, sK2: (a > $o)).
% 0.22/0.26 thf(func_def_11, type, sK4: a).
% 0.22/0.26 thf(f1,conjecture,(
% 0.22/0.26 ! [X0 : (a > $o),X2 : (a > $o),X1 : (a > $o)] : ((^[X3 : a] : ((X0 @ X3) | ((X1 @ X3) & (X2 @ X3)))) = (^[X4 : a] : (((X0 @ X4) | (X2 @ X4)) & ((X0 @ X4) | (X1 @ X4)))))),
% 0.22/0.26 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_71_pme)).
% 0.22/0.26 thf(f2,negated_conjecture,(
% 0.22/0.26 ~ ! [X0 : (a > $o),X2 : (a > $o),X1 : (a > $o)] : ((^[X3 : a] : ((X0 @ X3) | ((X1 @ X3) & (X2 @ X3)))) = (^[X4 : a] : (((X0 @ X4) | (X2 @ X4)) & ((X0 @ X4) | (X1 @ X4)))))),
% 0.22/0.26 inference(negated_conjecture,[status(cth)],[f1])).
% 0.22/0.26 thf(f3,plain,(
% 0.22/0.26 ~ ! [X0 : (a > $o),X1 : (a > $o),X2 : (a > $o)] : ((^[X3 : a] : ((X0 @ X3) | ((X2 @ X3) & (X1 @ X3)))) = (^[X4 : a] : (((X0 @ X4) | (X1 @ X4)) & ((X0 @ X4) | (X2 @ X4)))))),
% 0.22/0.26 inference(rectify,[],[f2])).
% 0.22/0.26 thf(f4,plain,(
% 0.22/0.26 ~ ! [X1 : (a > $o),X2 : (a > $o),X0 : (a > $o)] : ((^[Y0 : a]: (((X2 @ Y0) | (X0 @ Y0)) & ((X1 @ Y0) | (X0 @ Y0)))) = (^[Y0 : a]: (((X1 @ Y0) & (X2 @ Y0)) | (X0 @ Y0))))),
% 0.22/0.26 inference(fool_elimination,[],[f3])).
% 0.22/0.26 thf(f5,plain,(
% 0.22/0.26 ? [X1 : (a > $o),X2 : (a > $o),X0 : (a > $o)] : ((^[Y0 : a]: (((X2 @ Y0) | (X0 @ Y0)) & ((X1 @ Y0) | (X0 @ Y0)))) != (^[Y0 : a]: (((X1 @ Y0) & (X2 @ Y0)) | (X0 @ Y0))))),
% 0.22/0.26 inference(ennf_transformation,[],[f4])).
% 0.22/0.26 thf(f6,plain,(
% 0.22/0.26 ? [X0 : (a > $o),X1 : (a > $o),X2 : (a > $o)] : ((^[Y0 : a]: (((X1 @ Y0) | (X2 @ Y0)) & ((X0 @ Y0) | (X2 @ Y0)))) != (^[Y0 : a]: (((X0 @ Y0) & (X1 @ Y0)) | (X2 @ Y0))))),
% 0.22/0.26 inference(rectify,[],[f5])).
% 0.22/0.26 thf(f7,plain,(
% 0.22/0.26 ((^[Y0 : a]: (((sK0 @ Y0) & (sK1 @ Y0)) | (sK2 @ Y0))) != (^[Y0 : a]: (((sK1 @ Y0) | (sK2 @ Y0)) & ((sK0 @ Y0) | (sK2 @ Y0)))))),
% 0.22/0.26 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f6])).
% 0.22/0.26 thf(f8,plain,(
% 0.22/0.26 ((^[Y0 : a]: (((sK0 @ Y0) & (sK1 @ Y0)) | (sK2 @ Y0))) != (^[Y0 : a]: (((sK1 @ Y0) | (sK2 @ Y0)) & ((sK0 @ Y0) | (sK2 @ Y0)))))),
% 0.22/0.26 inference(cnf_transformation,[],[f7])).
% 0.22/0.26 thf(f11,definition,(
% 0.22/0.26 spl3_1 <=> ((^[Y0 : a]: (((sK0 @ Y0) & (sK1 @ Y0)) | (sK2 @ Y0))) = (^[Y0 : a]: (((sK1 @ Y0) | (sK2 @ Y0)) & ((sK0 @ Y0) | (sK2 @ Y0)))))),
% 0.22/0.26 introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition])).
% 0.22/0.26 thf(f13,plain,(
% 0.22/0.26 ((^[Y0 : a]: (((sK0 @ Y0) & (sK1 @ Y0)) | (sK2 @ Y0))) != (^[Y0 : a]: (((sK1 @ Y0) | (sK2 @ Y0)) & ((sK0 @ Y0) | (sK2 @ Y0))))) | spl3_1),
% 0.22/0.26 inference(avatar_component_clause,[],[f11])).
% 0.22/0.26 thf(f14,plain,(
% 0.22/0.26 ~spl3_1),
% 0.22/0.26 inference(avatar_split_clause,[],[f8,f11])).
% 0.22/0.26 thf(f15,plain,(
% 0.22/0.26 ((((^[Y0 : a]: (((sK1 @ Y0) | (sK2 @ Y0)) & ((sK0 @ Y0) | (sK2 @ Y0)))) @ sK4)) != (((^[Y0 : a]: (((sK0 @ Y0) & (sK1 @ Y0)) | (sK2 @ Y0))) @ sK4))) | spl3_1),
% 0.22/0.26 inference(negative_extensionality,[],[f13])).
% 0.22/0.26 thf(f16,plain,(
% 0.22/0.26 ((((^[Y0 : a]: (((sK1 @ Y0) | (sK2 @ Y0)) & ((sK0 @ Y0) | (sK2 @ Y0)))) @ sK4)) = $true) | ($true = (((^[Y0 : a]: (((sK0 @ Y0) & (sK1 @ Y0)) | (sK2 @ Y0))) @ sK4))) | spl3_1),
% 0.22/0.26 inference(xor_proxy_clausification,[],[f15])).
% 0.22/0.26 thf(f17,plain,(
% 0.22/0.26 ((((^[Y0 : a]: (((sK1 @ Y0) | (sK2 @ Y0)) & ((sK0 @ Y0) | (sK2 @ Y0)))) @ sK4)) = $false) | ((((^[Y0 : a]: (((sK0 @ Y0) & (sK1 @ Y0)) | (sK2 @ Y0))) @ sK4)) = $false) | spl3_1),
% 0.22/0.26 inference(xor_proxy_clausification,[],[f15])).
% 0.22/0.26 thf(f18,plain,(
% 0.22/0.26 (((((sK1 @ sK4) | (sK2 @ sK4)) & ((sK0 @ sK4) | (sK2 @ sK4)))) = $false) | (((((sK0 @ sK4) & (sK1 @ sK4)) | (sK2 @ sK4))) = $false) | spl3_1),
% 0.22/0.26 inference(beta-eta_normalization,[],[f17])).
% 0.22/0.26 thf(f19,plain,(
% 0.22/0.26 ((((sK1 @ sK4) | (sK2 @ sK4))) = $false) | ((((sK0 @ sK4) | (sK2 @ sK4))) = $false) | (((((sK0 @ sK4) & (sK1 @ sK4)) | (sK2 @ sK4))) = $false) | spl3_1),
% 0.22/0.26 inference(and_proxy_clausification,[],[f18])).
% 0.22/0.26 thf(f20,plain,(
% 0.22/0.26 (((((sK0 @ sK4) & (sK1 @ sK4)) | (sK2 @ sK4))) = $false) | ((((sK0 @ sK4) | (sK2 @ sK4))) = $false) | (((sK2 @ sK4)) = $false) | spl3_1),
% 0.22/0.26 inference(or_proxy_clausification,[],[f19])).
% 0.22/0.26 thf(f21,plain,(
% 0.22/0.26 (((sK1 @ sK4)) = $false) | ((((sK0 @ sK4) | (sK2 @ sK4))) = $false) | (((((sK0 @ sK4) & (sK1 @ sK4)) | (sK2 @ sK4))) = $false) | spl3_1),
% 0.22/0.26 inference(or_proxy_clausification,[],[f19])).
% 0.22/0.26 thf(f23,plain,(
% 0.22/0.26 (((sK1 @ sK4)) = $false) | (((((sK0 @ sK4) & (sK1 @ sK4)) | (sK2 @ sK4))) = $false) | (((sK0 @ sK4)) = $false) | spl3_1),
% 0.22/0.26 inference(or_proxy_clausification,[],[f21])).
% 0.22/0.26 thf(f25,plain,(
% 0.22/0.26 ($false = (((sK0 @ sK4) & (sK1 @ sK4)))) | (((sK1 @ sK4)) = $false) | (((sK0 @ sK4)) = $false) | spl3_1),
% 0.22/0.26 inference(or_proxy_clausification,[],[f23])).
% 0.22/0.26 thf(f26,plain,(
% 0.22/0.26 (((sK0 @ sK4)) = $false) | (((sK1 @ sK4)) = $false) | (((sK1 @ sK4)) = $false) | (((sK0 @ sK4)) = $false) | spl3_1),
% 0.22/0.26 inference(and_proxy_clausification,[],[f25])).
% 0.22/0.26 thf(f27,plain,(
% 0.22/0.26 (((sK1 @ sK4)) = $false) | (((sK0 @ sK4)) = $false) | spl3_1),
% 0.22/0.26 inference(duplicate_literal_removal,[],[f26])).
% 0.22/0.26 thf(f33,plain,(
% 0.22/0.26 ((((sK0 @ sK4) | (sK2 @ sK4))) = $false) | (((sK2 @ sK4)) = $false) | (((sK2 @ sK4)) = $false) | spl3_1),
% 0.22/0.26 inference(or_proxy_clausification,[],[f20])).
% 0.22/0.26 thf(f41,plain,(
% 0.22/0.26 (((sK2 @ sK4)) = $false) | (((sK2 @ sK4)) = $false) | (((sK2 @ sK4)) = $false) | spl3_1),
% 0.22/0.26 inference(or_proxy_clausification,[],[f33])).
% 0.22/0.26 thf(f44,plain,(
% 0.22/0.26 (((sK2 @ sK4)) = $false) | spl3_1),
% 0.22/0.26 inference(duplicate_literal_removal,[],[f41])).
% 0.22/0.26 thf(f45,plain,(
% 0.22/0.26 (((((sK0 @ sK4) & (sK1 @ sK4)) | (sK2 @ sK4))) = $true) | ($true = ((((sK1 @ sK4) | (sK2 @ sK4)) & ((sK0 @ sK4) | (sK2 @ sK4))))) | spl3_1),
% 0.22/0.26 inference(beta-eta_normalization,[],[f16])).
% 0.22/0.26 thf(f46,plain,(
% 0.22/0.26 ($true = (((sK0 @ sK4) & (sK1 @ sK4)))) | ($true = ((sK2 @ sK4))) | ($true = ((((sK1 @ sK4) | (sK2 @ sK4)) & ((sK0 @ sK4) | (sK2 @ sK4))))) | spl3_1),
% 0.22/0.26 inference(or_proxy_clausification,[],[f45])).
% 0.22/0.26 thf(f47,plain,(
% 0.22/0.26 ($true = ((((sK1 @ sK4) | (sK2 @ sK4)) & ((sK0 @ sK4) | (sK2 @ sK4))))) | ($true = ((sK2 @ sK4))) | ($true = ((sK1 @ sK4))) | spl3_1),
% 0.22/0.26 inference(and_proxy_clausification,[],[f46])).
% 0.22/0.26 thf(f48,plain,(
% 0.22/0.26 ($true = ((((sK1 @ sK4) | (sK2 @ sK4)) & ((sK0 @ sK4) | (sK2 @ sK4))))) | ($true = ((sK2 @ sK4))) | ($true = ((sK0 @ sK4))) | spl3_1),
% 0.22/0.26 inference(and_proxy_clausification,[],[f46])).
% 0.22/0.26 thf(f49,plain,(
% 0.22/0.26 ((((sK0 @ sK4) | (sK2 @ sK4))) = $true) | ($true = ((sK2 @ sK4))) | ($true = ((sK0 @ sK4))) | spl3_1),
% 0.22/0.26 inference(and_proxy_clausification,[],[f48])).
% 0.22/0.26 thf(f53,plain,(
% 0.22/0.26 ($true = ((sK2 @ sK4))) | ($true = ((sK2 @ sK4))) | ($true = ((sK0 @ sK4))) | ($true = ((sK0 @ sK4))) | spl3_1),
% 0.22/0.26 inference(or_proxy_clausification,[],[f49])).
% 0.22/0.26 thf(f54,plain,(
% 0.22/0.26 ($true = ((sK0 @ sK4))) | ($true = ((sK2 @ sK4))) | spl3_1),
% 0.22/0.26 inference(duplicate_literal_removal,[],[f53])).
% 0.22/0.26 thf(f56,plain,(
% 0.22/0.26 ($true = ((sK2 @ sK4))) | ((((sK1 @ sK4) | (sK2 @ sK4))) = $true) | ($true = ((sK1 @ sK4))) | spl3_1),
% 0.22/0.26 inference(and_proxy_clausification,[],[f47])).
% 0.22/0.26 thf(f57,plain,(
% 0.22/0.26 ($true = ((sK1 @ sK4))) | ($true = ((sK2 @ sK4))) | ($true = ((sK1 @ sK4))) | ($true = ((sK2 @ sK4))) | spl3_1),
% 0.22/0.26 inference(or_proxy_clausification,[],[f56])).
% 0.22/0.26 thf(f58,plain,(
% 0.22/0.26 ($true = ((sK1 @ sK4))) | ($true = ((sK2 @ sK4))) | spl3_1),
% 0.22/0.26 inference(duplicate_literal_removal,[],[f57])).
% 0.22/0.26 thf(f62,definition,(
% 0.22/0.26 spl3_2 <=> (((sK0 @ sK4)) = $false)),
% 0.22/0.26 introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition])).
% 0.22/0.26 thf(f66,definition,(
% 0.22/0.26 spl3_3 <=> (((sK1 @ sK4)) = $false)),
% 0.22/0.26 introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition])).
% 0.22/0.26 thf(f69,plain,(
% 0.22/0.26 spl3_2 | spl3_3 | spl3_1),
% 0.22/0.26 inference(avatar_split_clause,[],[f27,f11,f66,f62])).
% 0.22/0.26 thf(f71,definition,(
% 0.22/0.26 spl3_4 <=> (((sK2 @ sK4)) = $false)),
% 0.22/0.26 introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition])).
% 0.22/0.26 thf(f73,plain,(
% 0.22/0.26 (((sK2 @ sK4)) = $false) | ~spl3_4),
% 0.22/0.26 inference(avatar_component_clause,[],[f71])).
% 0.22/0.26 thf(f80,plain,(
% 0.22/0.26 spl3_4 | spl3_1),
% 0.22/0.26 inference(avatar_split_clause,[],[f44,f11,f71])).
% 0.22/0.26 thf(f82,definition,(
% 0.22/0.26 spl3_5 <=> ($true = ((sK2 @ sK4)))),
% 0.22/0.26 introduced(definition,[new_symbols(definition,[spl3_5])],[avatar_definition])).
% 0.22/0.26 thf(f84,plain,(
% 0.22/0.26 ($true = ((sK2 @ sK4))) | ~spl3_5),
% 0.22/0.26 inference(avatar_component_clause,[],[f82])).
% 0.22/0.26 thf(f86,definition,(
% 0.22/0.26 spl3_6 <=> ($true = ((sK0 @ sK4)))),
% 0.22/0.26 introduced(definition,[new_symbols(definition,[spl3_6])],[avatar_definition])).
% 0.22/0.26 thf(f90,definition,(
% 0.22/0.26 spl3_7 <=> ($true = ((sK1 @ sK4)))),
% 0.22/0.26 introduced(definition,[new_symbols(definition,[spl3_7])],[avatar_definition])).
% 0.22/0.26 thf(f94,plain,(
% 0.22/0.26 spl3_5 | spl3_6 | spl3_1),
% 0.22/0.26 inference(avatar_split_clause,[],[f54,f11,f86,f82])).
% 0.22/0.26 thf(f95,plain,(
% 0.22/0.26 spl3_7 | spl3_5 | spl3_1),
% 0.22/0.26 inference(avatar_split_clause,[],[f58,f11,f82,f90])).
% 0.22/0.26 thf(f98,plain,(
% 0.22/0.26 ($true = $false) | (~spl3_4 | ~spl3_5)),
% 0.22/0.26 inference(superposition,[],[f84,f73])).
% 0.22/0.26 thf(f101,plain,(
% 0.22/0.26 $false | (~spl3_4 | ~spl3_5)),
% 0.22/0.26 inference(trivial_inequality_removal,[],[f98])).
% 0.22/0.26 thf(f102,plain,(
% 0.22/0.26 ~spl3_4 | ~spl3_5),
% 0.22/0.26 inference(avatar_contradiction_clause,[],[f101])).
% 0.22/0.26 thf(f103,definition,(
% 0.22/0.26 ($true != ((sK1 @ sK4))) | (((sK1 @ sK4)) != $false) | (((sK2 @ sK4)) != $false) | ($true = ((sK2 @ sK4)))),
% 0.22/0.26 introduced(theory,[theory_tautology_sat_conflict])).
% 0.22/0.26 thf(f105,definition,(
% 0.22/0.26 ($true != ((sK0 @ sK4))) | (((sK0 @ sK4)) != $false) | (((sK2 @ sK4)) != $false) | ($true = ((sK2 @ sK4)))),
% 0.22/0.26 introduced(theory,[theory_tautology_sat_conflict])).
% 0.22/0.26 cnf(s1, plain, ~spl3_1, inference(sat_conversion,[],[f14])).
% 0.22/0.26 cnf(s2, plain, spl3_1 | spl3_2 | spl3_3, inference(sat_conversion,[],[f69])).
% 0.22/0.26 cnf(s9, plain, spl3_1 | spl3_4, inference(sat_conversion,[],[f80])).
% 0.22/0.26 cnf(s11, plain, spl3_1 | spl3_5 | spl3_6, inference(sat_conversion,[],[f94])).
% 0.22/0.26 cnf(s12, plain, spl3_1 | spl3_5 | spl3_7, inference(sat_conversion,[],[f95])).
% 0.22/0.26 cnf(s15, plain, ~spl3_4 | ~spl3_5, inference(sat_conversion,[],[f102])).
% 0.22/0.26 cnf(s16, plain, ~spl3_3 | ~spl3_4 | spl3_5 | ~spl3_7, inference(sat_conversion,[],[f103])).
% 0.22/0.26 cnf(s18, plain, ~spl3_2 | ~spl3_4 | spl3_5 | ~spl3_6, inference(sat_conversion,[],[f105])).
% 0.22/0.26 cnf(s19, plain, spl3_4, inference(rat,[],[s9,s1])).
% 0.22/0.26 cnf(s20, plain, ~spl3_5, inference(rat,[],[s15,s19])).
% 0.22/0.26 cnf(s21, plain, spl3_7, inference(rat,[],[s12,s1,s20])).
% 0.22/0.26 cnf(s22, plain, spl3_6, inference(rat,[],[s11,s1,s20])).
% 0.22/0.26 cnf(s23, plain, ~spl3_2, inference(rat,[],[s18,s22,s19,s20])).
% 0.22/0.26 cnf(s24, plain, ~spl3_3, inference(rat,[],[s16,s21,s19,s20])).
% 0.22/0.26 cnf(s25, plain, $false, inference(rat,[],[s2,s1,s24,s23])).
% 0.22/0.26 thf(f106,plain,(
% 0.22/0.26 $false),
% 0.22/0.26 inference(avatar_sat_refutation,[],[s25])).
% 0.22/0.26 % SZS output end Proof for theBenchmark
% 0.22/0.26 % (338069)------------------------------
% 0.22/0.26 % (338069)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.26 % (338069)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.26 % (338069)CaDiCaL version: 2.1.3
% 0.22/0.26 % (338069)Termination reason: Refutation
% 0.22/0.26 % (338069)Time elapsed: 0.002 s
% 0.22/0.26 % (338069)Peak memory usage: 13 MB
% 0.22/0.26 % (338069)Instructions burned: 5 (million)
% 0.22/0.26 % (338060)Success in time 0.019 s
% 0.22/0.26 % Vampire exiting
%------------------------------------------------------------------------------