↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SEU499^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 : n026.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:29:49 AM UTC 2026

% Result   : Theorem 0.21s 0.27s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU499^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19  % Computer : n026.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Tue Sep 29 13:49:13 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22  Running higher-order theorem proving
% 0.08/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.21/0.27  % (614545)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.27  % (614553)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=1182520668: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.21/0.27  % (614553) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-614545-614553"...
% 0.21/0.27  % (614556)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.21/0.27  % (614556)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.21/0.27  % (614553)...printing done.
% 0.21/0.27  % (614553)Refutation found. Thanks to Tanya!
% 0.21/0.27  % SZS status Theorem for theBenchmark
% 0.21/0.27  % SZS output start Proof for theBenchmark
% 0.21/0.27  thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.21/0.27  thf(func_def_0, type, exu: (($i > $o) > $o)).
% 0.21/0.27  thf(func_def_2, type, db0: !>[X0: $tType]:(X0)).
% 0.21/0.27  thf(func_def_3, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.21/0.27  thf(func_def_6, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.21/0.27  thf(func_def_7, type, vAND: ($o > $o > $o)).
% 0.21/0.27  thf(func_def_8, type, db1: !>[X0: $tType]:(X0)).
% 0.21/0.27  thf(func_def_9, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.21/0.27  thf(func_def_10, type, vIMP: ($o > $o > $o)).
% 0.21/0.27  thf(func_def_11, type, db2: !>[X0: $tType]:(X0)).
% 0.21/0.27  thf(func_def_12, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.21/0.27  thf(func_def_13, type, sK0: ($i > $o)).
% 0.21/0.27  thf(func_def_14, type, sK1: ($i > $i)).
% 0.21/0.27  thf(func_def_16, type, sK3: (($i > $o) > $i)).
% 0.21/0.27  thf(func_def_17, type, sK4: (($i > $o) > $i > $i)).
% 0.21/0.27  thf(f1,axiom,(
% 0.21/0.27    (exu = (^[X0 : ($i > $o)] : (? [X1 : $i] : (! [X2 : $i] : ((X0 @ X2) => (X1 = X2)) & (X0 @ X1)))))),
% 0.21/0.27    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',exu)).
% 0.21/0.27  thf(f2,conjecture,(
% 0.21/0.27    ! [X0 : ($i > $o)] : ((exu @ (^[X1 : $i] : ((X0 @ X1)))) => ? [X1 : $i] : ((X0 @ X1) & ! [X2 : $i] : ((X0 @ X2) => (X1 = X2))))),
% 0.21/0.27    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',exuE1)).
% 0.21/0.27  thf(f3,negated_conjecture,(
% 0.21/0.27    ~ ! [X0 : ($i > $o)] : ((exu @ (^[X1 : $i] : ((X0 @ X1)))) => ? [X1 : $i] : ((X0 @ X1) & ! [X2 : $i] : ((X0 @ X2) => (X1 = X2))))),
% 0.21/0.27    inference(negated_conjecture,[status(cth)],[f2])).
% 0.21/0.27  thf(f4,plain,(
% 0.21/0.27    ~ ! [X0 : ($i > $o)] : ((exu @ (^[X1 : $i] : ((X0 @ X1)))) => ? [X2 : $i] : ((X0 @ X2) & ! [X3 : $i] : ((X0 @ X3) => (X2 = X3))))),
% 0.21/0.27    inference(rectify,[],[f3])).
% 0.21/0.27  thf(f5,plain,(
% 0.21/0.27    ~ ! [X0 : ($i > $o)] : ((((exu @ (^[Y0 : $i]: (X0 @ Y0)))) = $true) => ? [X2 : $i] : ((((X0 @ X2)) = $true) & ! [X3 : $i] : ((((X0 @ X3)) = $true) => (X2 = X3))))),
% 0.21/0.27    inference(fool_elimination,[],[f4])).
% 0.21/0.27  thf(f6,plain,(
% 0.21/0.27    (exu = (^[X0 : ($i > $o)] : (? [X1 : $i] : (! [X2 : $i] : ((X0 @ X2) => (X1 = X2)) & (X0 @ X1)))))),
% 0.21/0.27    inference(rectify,[],[f1])).
% 0.21/0.27  thf(f7,plain,(
% 0.21/0.27    (exu = (^[Y0 : $i > $o]: (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 = Y2)))))))))),
% 0.21/0.27    inference(fool_elimination,[],[f6])).
% 0.21/0.27  thf(f8,plain,(
% 0.21/0.27    ~ ! [X0 : ($i > $o)] : ((((exu @ (^[Y0 : $i]: (X0 @ Y0)))) = $true) => ? [X1 : $i] : ((((X0 @ X1)) = $true) & ! [X2 : $i] : ((((X0 @ X2)) = $true) => (X1 = X2))))),
% 0.21/0.27    inference(rectify,[],[f5])).
% 0.21/0.27  thf(f9,plain,(
% 0.21/0.27    ? [X0 : ($i > $o)] : (! [X1 : $i] : ((((X0 @ X1)) != $true) | ? [X2 : $i] : ((X1 != X2) & (((X0 @ X2)) = $true))) & (((exu @ (^[Y0 : $i]: (X0 @ Y0)))) = $true))),
% 0.21/0.27    inference(ennf_transformation,[],[f8])).
% 0.21/0.27  thf(f10,plain,(
% 0.21/0.27    ! [X1 : $i] : ((((sK0 @ X1)) != $true) | ((((sK1 @ X1)) != X1) & (((sK0 @ (sK1 @ X1))) = $true))) & ($true = ((exu @ (^[Y0 : $i]: (sK0 @ Y0)))))),
% 0.21/0.27    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,vAPP]),skolemize(X0,sK0),skolemize(X2,sK1 @ X1)],[f9])).
% 0.21/0.27  thf(f11,plain,(
% 0.21/0.27    (exu = (^[Y0 : $i > $o]: (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 = Y2)))))))))),
% 0.21/0.27    inference(cnf_transformation,[],[f7])).
% 0.21/0.27  thf(f12,plain,(
% 0.21/0.27    ($true = ((exu @ (^[Y0 : $i]: (sK0 @ Y0)))))),
% 0.21/0.27    inference(cnf_transformation,[],[f10])).
% 0.21/0.27  thf(f13,plain,(
% 0.21/0.27    ( ! [X1 : $i] : ((((sK0 @ (sK1 @ X1))) = $true) | (((sK0 @ X1)) != $true)) )),
% 0.21/0.27    inference(cnf_transformation,[],[f10])).
% 0.21/0.27  thf(f14,plain,(
% 0.21/0.27    ( ! [X1 : $i] : ((((sK0 @ X1)) != $true) | (((sK1 @ X1)) != X1)) )),
% 0.21/0.27    inference(cnf_transformation,[],[f10])).
% 0.21/0.27  thf(f16,plain,(
% 0.21/0.27    (((exu @ sK0)) = $true)),
% 0.21/0.27    inference(beta-eta_normalization,[],[f12])).
% 0.21/0.27  thf(f18,definition,(
% 0.21/0.27    spl2_1 <=> (((exu @ sK0)) = $true)),
% 0.21/0.27    introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition])).
% 0.21/0.27  thf(f20,plain,(
% 0.21/0.27    (((exu @ sK0)) = $true) | ~spl2_1),
% 0.21/0.27    inference(avatar_component_clause,[],[f18])).
% 0.21/0.27  thf(f21,plain,(
% 0.21/0.27    spl2_1),
% 0.21/0.27    inference(avatar_split_clause,[],[f16,f18])).
% 0.21/0.27  thf(f23,definition,(
% 0.21/0.27    spl2_2 <=> (exu = (^[Y0 : $i > $o]: (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 = Y2)))))))))),
% 0.21/0.27    introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition])).
% 0.21/0.27  thf(f25,plain,(
% 0.21/0.27    (exu = (^[Y0 : $i > $o]: (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 = Y2))))))))) | ~spl2_2),
% 0.21/0.27    inference(avatar_component_clause,[],[f23])).
% 0.21/0.27  thf(f26,plain,(
% 0.21/0.27    spl2_2),
% 0.21/0.27    inference(avatar_split_clause,[],[f11,f23])).
% 0.21/0.27  thf(f27,plain,(
% 0.21/0.27    ( ! [X1 : ($i > $o)] : ((((exu @ X1)) = (((^[Y0 : $i > $o]: (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 = Y2)))))))) @ X1)))) ) | ~spl2_2),
% 0.21/0.27    inference(argument_congruence,[],[f25])).
% 0.21/0.27  thf(f29,plain,(
% 0.21/0.27    ( ! [X1 : ($i > $o)] : ((((exu @ X1)) = $false) | ($true = (((^[Y0 : $i > $o]: (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 = Y2)))))))) @ X1)))) ) | ~spl2_2),
% 0.21/0.27    inference(iff_proxy_clausification,[],[f27])).
% 0.21/0.27  thf(f30,plain,(
% 0.21/0.27    ( ! [X1 : ($i > $o)] : (($true = ((?? @ $i @ (^[Y0 : $i]: ((X1 @ Y0) & (!! @ $i @ (^[Y1 : $i]: ((X1 @ Y1) => (Y0 = Y1))))))))) | (((exu @ X1)) = $false)) ) | ~spl2_2),
% 0.21/0.27    inference(beta-eta_normalization,[],[f29])).
% 0.21/0.27  thf(f31,plain,(
% 0.21/0.27    ( ! [X1 : ($i > $o)] : (((((^[Y0 : $i]: ((X1 @ Y0) & (!! @ $i @ (^[Y1 : $i]: ((X1 @ Y1) => (Y0 = Y1)))))) @ (sK3 @ X1))) = $true) | (((exu @ X1)) = $false)) ) | ~spl2_2),
% 0.21/0.27    inference(sigma_proxy_clausification,[],[f30])).
% 0.21/0.27  thf(f32,plain,(
% 0.21/0.27    ( ! [X1 : ($i > $o)] : ((((exu @ X1)) = $false) | ((((X1 @ (sK3 @ X1)) & (!! @ $i @ (^[Y0 : $i]: ((X1 @ Y0) => ((sK3 @ X1) = Y0)))))) = $true)) ) | ~spl2_2),
% 0.21/0.27    inference(beta-eta_normalization,[],[f31])).
% 0.21/0.27  thf(f33,plain,(
% 0.21/0.27    ( ! [X1 : ($i > $o)] : ((((exu @ X1)) = $false) | ($true = ((!! @ $i @ (^[Y0 : $i]: ((X1 @ Y0) => ((sK3 @ X1) = Y0))))))) ) | ~spl2_2),
% 0.21/0.27    inference(and_proxy_clausification,[],[f32])).
% 0.21/0.27  thf(f34,plain,(
% 0.21/0.27    ( ! [X1 : ($i > $o)] : ((((X1 @ (sK3 @ X1))) = $true) | (((exu @ X1)) = $false)) ) | ~spl2_2),
% 0.21/0.27    inference(and_proxy_clausification,[],[f32])).
% 0.21/0.27  thf(f35,plain,(
% 0.21/0.27    ( ! [X2 : $i,X1 : ($i > $o)] : (((((^[Y0 : $i]: ((X1 @ Y0) => ((sK3 @ X1) = Y0))) @ X2)) = $true) | (((exu @ X1)) = $false)) ) | ~spl2_2),
% 0.21/0.27    inference(pi_proxy_clausification,[],[f33])).
% 0.21/0.27  thf(f36,plain,(
% 0.21/0.27    ( ! [X2 : $i,X1 : ($i > $o)] : ((((exu @ X1)) = $false) | ((((X1 @ X2) => ((sK3 @ X1) = X2))) = $true)) ) | ~spl2_2),
% 0.21/0.27    inference(beta-eta_normalization,[],[f35])).
% 0.21/0.27  thf(f37,plain,(
% 0.21/0.27    ( ! [X2 : $i,X1 : ($i > $o)] : (($false = ((X1 @ X2))) | (((exu @ X1)) = $false) | ((((sK3 @ X1) = X2)) = $true)) ) | ~spl2_2),
% 0.21/0.27    inference(imp_proxy_clausification,[],[f36])).
% 0.21/0.27  thf(f38,plain,(
% 0.21/0.27    ( ! [X2 : $i,X1 : ($i > $o)] : ((((exu @ X1)) = $false) | (((sK3 @ X1)) = X2) | ($false = ((X1 @ X2)))) ) | ~spl2_2),
% 0.21/0.27    inference(equality_proxy_clausification,[],[f37])).
% 0.21/0.27  thf(f48,plain,(
% 0.21/0.27    ( ! [X0 : $i] : ((((sK1 @ X0)) != ((sK1 @ (sK1 @ X0)))) | ($true != $true) | (((sK0 @ X0)) != $true)) )),
% 0.21/0.27    inference(superposition,[],[f14,f13])).
% 0.21/0.27  thf(f49,plain,(
% 0.21/0.27    ( ! [X0 : $i] : ((((sK1 @ X0)) != ((sK1 @ (sK1 @ X0)))) | (((sK0 @ X0)) != $true)) )),
% 0.21/0.27    inference(trivial_inequality_removal,[],[f48])).
% 0.21/0.27  thf(f59,plain,(
% 0.21/0.27    ( ! [X0 : $i] : ((((sK3 @ sK0)) = X0) | ($false = $true) | ($false = ((sK0 @ X0)))) ) | (~spl2_1 | ~spl2_2)),
% 0.21/0.27    inference(superposition,[],[f38,f20])).
% 0.21/0.27  thf(f61,plain,(
% 0.21/0.27    ( ! [X0 : $i] : ((((sK3 @ sK0)) = X0) | ($false = ((sK0 @ X0)))) ) | (~spl2_1 | ~spl2_2)),
% 0.21/0.27    inference(trivial_inequality_removal,[],[f59])).
% 0.21/0.27  thf(f63,plain,(
% 0.21/0.27    ( ! [X0 : $i,X1 : $i] : (($false = ((sK0 @ X1))) | ($false = ((sK0 @ X0))) | (X0 = X1)) ) | (~spl2_1 | ~spl2_2)),
% 0.21/0.27    inference(superposition,[],[f61,f61])).
% 0.21/0.27  thf(f78,plain,(
% 0.21/0.27    ( ! [X0 : $i,X1 : $i] : ((((sK1 @ X0)) = X1) | ($false = ((sK0 @ X1))) | ($false = $true) | (((sK0 @ X0)) != $true)) ) | (~spl2_1 | ~spl2_2)),
% 0.21/0.27    inference(superposition,[],[f13,f63])).
% 0.21/0.27  thf(f84,plain,(
% 0.21/0.27    ( ! [X0 : $i,X1 : $i] : (($false = ((sK0 @ X1))) | (((sK0 @ X0)) != $true) | (((sK1 @ X0)) = X1)) ) | (~spl2_1 | ~spl2_2)),
% 0.21/0.27    inference(trivial_inequality_removal,[],[f78])).
% 0.21/0.27  thf(f86,plain,(
% 0.21/0.27    ( ! [X0 : $i,X1 : $i] : (($false = $true) | (((sK0 @ X1)) != $true) | (((sK1 @ X1)) = ((sK1 @ X0))) | (((sK0 @ X0)) != $true)) ) | (~spl2_1 | ~spl2_2)),
% 0.21/0.27    inference(superposition,[],[f84,f13])).
% 0.21/0.27  thf(f91,plain,(
% 0.21/0.27    ( ! [X0 : $i,X1 : $i] : ((((sK1 @ X1)) = ((sK1 @ X0))) | (((sK0 @ X0)) != $true) | (((sK0 @ X1)) != $true)) ) | (~spl2_1 | ~spl2_2)),
% 0.21/0.27    inference(trivial_inequality_removal,[],[f86])).
% 0.21/0.27  thf(f118,definition,(
% 0.21/0.27    spl2_5 <=> ! [X0 : $i] : (((sK0 @ X0)) != $true)),
% 0.21/0.27    introduced(definition,[new_symbols(definition,[spl2_5])],[avatar_definition])).
% 0.21/0.27  thf(f119,plain,(
% 0.21/0.27    ( ! [X0 : $i] : ((((sK0 @ X0)) != $true)) ) | ~spl2_5),
% 0.21/0.27    inference(avatar_component_clause,[],[f118])).
% 0.21/0.27  thf(f137,plain,(
% 0.21/0.27    ( ! [X0 : $i,X1 : $i] : ((((sK0 @ X1)) != $true) | (((sK1 @ X1)) != ((sK1 @ X0))) | (((sK0 @ X0)) != $true) | (((sK0 @ (sK1 @ X1))) != $true)) ) | (~spl2_1 | ~spl2_2)),
% 0.21/0.27    inference(superposition,[],[f49,f91])).
% 0.21/0.27  thf(f154,plain,(
% 0.21/0.27    ( ! [X0 : $i,X1 : $i] : ((((sK0 @ X0)) != $true) | (((sK0 @ X1)) != $true) | (((sK0 @ (sK1 @ X1))) != $true)) ) | (~spl2_1 | ~spl2_2)),
% 0.21/0.27    inference(forward_subsumption_resolution,[],[f137,f91])).
% 0.21/0.27  thf(f158,plain,(
% 0.21/0.27    ( ! [X0 : $i,X1 : $i] : ((((sK0 @ X0)) != $true) | (((sK0 @ X1)) != $true)) ) | (~spl2_1 | ~spl2_2)),
% 0.21/0.27    inference(forward_subsumption_resolution,[],[f154,f13])).
% 0.21/0.27  thf(f160,plain,(
% 0.21/0.27    spl2_5 | spl2_5 | ~spl2_1 | ~spl2_2),
% 0.21/0.27    inference(avatar_split_clause,[],[f158,f23,f18,f118,f118])).
% 0.21/0.27  thf(f177,plain,(
% 0.21/0.27    ($false = ((exu @ sK0))) | ($true != $true) | (~spl2_2 | ~spl2_5)),
% 0.21/0.27    inference(superposition,[],[f119,f34])).
% 0.21/0.27  thf(f182,plain,(
% 0.21/0.27    ($false = ((exu @ sK0))) | (~spl2_2 | ~spl2_5)),
% 0.21/0.27    inference(trivial_inequality_removal,[],[f177])).
% 0.21/0.27  thf(f186,definition,(
% 0.21/0.27    spl2_6 <=> ($false = ((exu @ sK0)))),
% 0.21/0.27    introduced(definition,[new_symbols(definition,[spl2_6])],[avatar_definition])).
% 0.21/0.27  thf(f188,plain,(
% 0.21/0.27    ($false = ((exu @ sK0))) | ~spl2_6),
% 0.21/0.27    inference(avatar_component_clause,[],[f186])).
% 0.21/0.27  thf(f189,plain,(
% 0.21/0.27    spl2_6 | ~spl2_2 | ~spl2_5),
% 0.21/0.27    inference(avatar_split_clause,[],[f182,f118,f23,f186])).
% 0.21/0.27  thf(f191,plain,(
% 0.21/0.27    ($false = $true) | (~spl2_1 | ~spl2_6)),
% 0.21/0.27    inference(superposition,[],[f20,f188])).
% 0.21/0.27  thf(f194,plain,(
% 0.21/0.27    $false | (~spl2_1 | ~spl2_6)),
% 0.21/0.27    inference(trivial_inequality_removal,[],[f191])).
% 0.21/0.27  thf(f195,plain,(
% 0.21/0.27    ~spl2_1 | ~spl2_6),
% 0.21/0.27    inference(avatar_contradiction_clause,[],[f194])).
% 0.21/0.27  cnf(s1, plain, spl2_1, inference(sat_conversion,[],[f21])).
% 0.21/0.27  cnf(s2, plain, spl2_2, inference(sat_conversion,[],[f26])).
% 0.21/0.27  cnf(s11, plain, spl2_5 | ~spl2_2 | ~spl2_1 | spl2_5, inference(sat_conversion,[],[f160])).
% 0.21/0.27  cnf(s12, plain, ~spl2_1 | ~spl2_2 | spl2_5, inference(rat,[],[s11])).
% 0.21/0.27  cnf(s13, plain, ~spl2_2 | ~spl2_5 | spl2_6, inference(sat_conversion,[],[f189])).
% 0.21/0.27  cnf(s15, plain, ~spl2_1 | ~spl2_6, inference(sat_conversion,[],[f195])).
% 0.21/0.27  cnf(s16, plain, ~spl2_6, inference(rat,[],[s15,s1])).
% 0.21/0.27  cnf(s17, plain, spl2_5, inference(rat,[],[s12,s2,s1])).
% 0.21/0.27  cnf(s19, plain, $false, inference(rat,[],[s13,s2,s16,s17])).
% 0.21/0.27  thf(f196,plain,(
% 0.21/0.27    $false),
% 0.21/0.27    inference(avatar_sat_refutation,[],[s19])).
% 0.21/0.27  % SZS output end Proof for theBenchmark
% 0.21/0.27  % (614553)------------------------------
% 0.21/0.27  % (614553)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.27  % (614553)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.27  % (614553)CaDiCaL version: 2.1.3
% 0.21/0.27  % (614553)Termination reason: Refutation
% 0.21/0.27  % (614553)Time elapsed: 0.004 s
% 0.21/0.27  % (614553)Peak memory usage: 13 MB
% 0.21/0.27  % (614553)Instructions burned: 11 (million)
% 0.21/0.27  % (614545)Success in time 0.028 s
% 0.21/0.27  % Vampire exiting
%------------------------------------------------------------------------------