%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV386^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n002.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:33 AM UTC 2026
% Result : Theorem 0.20s 0.26s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV386^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.18 % Computer : n002.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 15:46:07 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running higher-order theorem proving
% 0.09/0.22 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.26 % (1450431)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.26 % (1450437)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2881923682:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.26 % (1450437) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1450431-1450437"...
% 0.20/0.26 % (1450437)...printing done.
% 0.20/0.26 % (1450437)Refutation found. Thanks to Tanya!
% 0.20/0.26 % SZS status Theorem for theBenchmark
% 0.20/0.26 % SZS output start Proof for theBenchmark
% 0.20/0.26 thf(type_def_5, type, a: $tType).
% 0.20/0.26 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.20/0.26 thf(func_def_0, type, p: (a > $o)).
% 0.20/0.26 thf(func_def_4, type, db1: !>[X0: $tType]:(X0)).
% 0.20/0.26 thf(func_def_5, type, db0: !>[X0: $tType]:(X0)).
% 0.20/0.26 thf(func_def_6, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.20/0.26 thf(func_def_7, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.20/0.26 thf(func_def_8, type, sK0: (a > a)).
% 0.20/0.26 thf(func_def_9, type, sK1: a).
% 0.20/0.26 thf(func_def_10, type, sK2: a).
% 0.20/0.26 thf(func_def_12, type, sK4: (a > a)).
% 0.20/0.26 thf(func_def_13, type, sK5: a).
% 0.20/0.26 thf(f1,conjecture,(
% 0.20/0.26 ? [X0 : a] : (! [X2 : a] : ((p @ X2) => (X0 = X2)) & (p @ X0)) <=> ? [X0 : a] : (p = (((^[X1 : a, X0 : a] : ((X1 = X0))) @ X0)))),
% 0.20/0.26 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTTTP5306A_pme)).
% 0.20/0.26 thf(f2,negated_conjecture,(
% 0.20/0.26 ~(? [X0 : a] : (! [X2 : a] : ((p @ X2) => (X0 = X2)) & (p @ X0)) <=> ? [X0 : a] : (p = (((^[X1 : a, X0 : a] : ((X1 = X0))) @ X0))))),
% 0.20/0.26 inference(negated_conjecture,[status(cth)],[f1])).
% 0.20/0.26 thf(f3,plain,(
% 0.20/0.26 ~(? [X0 : a] : (! [X1 : a] : ((p @ X1) => (X0 = X1)) & (p @ X0)) <=> ? [X2 : a] : (p = (((^[X3 : a, X4 : a] : ((X3 = X4))) @ X2))))),
% 0.20/0.26 inference(rectify,[],[f2])).
% 0.20/0.26 thf(f4,plain,(
% 0.20/0.26 ~(? [X2 : a] : (p = (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ X2))) <=> ? [X0 : a] : (! [X1 : a] : (($true = ((p @ X1))) => (X0 = X1)) & (((p @ X0)) = $true)))),
% 0.20/0.26 inference(fool_elimination,[],[f3])).
% 0.20/0.26 thf(f5,plain,(
% 0.20/0.26 ? [X0 : a] : (! [X1 : a] : ((X0 = X1) | ($true != ((p @ X1)))) & (((p @ X0)) = $true)) <~> ? [X2 : a] : (p = (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ X2)))),
% 0.20/0.26 inference(ennf_transformation,[],[f4])).
% 0.20/0.26 thf(f6,plain,(
% 0.20/0.26 (! [X2 : a] : (p != (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ X2))) | ! [X0 : a] : (? [X1 : a] : ((X0 != X1) & ($true = ((p @ X1)))) | (((p @ X0)) != $true))) & (? [X2 : a] : (p = (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ X2))) | ? [X0 : a] : (! [X1 : a] : ((X0 = X1) | ($true != ((p @ X1)))) & (((p @ X0)) = $true)))),
% 0.20/0.26 inference(nnf_transformation,[],[f5])).
% 0.20/0.26 thf(f7,plain,(
% 0.20/0.26 (! [X0 : a] : (p != (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ X0))) | ! [X1 : a] : (? [X2 : a] : ((X1 != X2) & (((p @ X2)) = $true)) | ($true != ((p @ X1))))) & (? [X3 : a] : (p = (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ X3))) | ? [X4 : a] : (! [X5 : a] : ((X4 = X5) | ($true != ((p @ X5)))) & (((p @ X4)) = $true)))),
% 0.20/0.26 inference(rectify,[],[f6])).
% 0.20/0.26 thf(f8,plain,(
% 0.20/0.26 (! [X0 : a] : (p != (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ X0))) | ! [X1 : a] : (((((sK0 @ X1)) != X1) & (((p @ (sK0 @ X1))) = $true)) | ($true != ((p @ X1))))) & ((p = (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ sK1))) | (! [X5 : a] : ((sK2 = X5) | ($true != ((p @ X5)))) & ($true = ((p @ sK2)))))),
% 0.20/0.26 inference(skolemize,[status(esa),new_symbols(skolem,[vAPP,sK1,sK2]),skolemize(X2,sK0 @ X1),skolemize(X3,sK1),skolemize(X4,sK2)],[f7])).
% 0.20/0.26 thf(f9,plain,(
% 0.20/0.26 ($true = ((p @ sK2))) | (p = (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ sK1)))),
% 0.20/0.26 inference(cnf_transformation,[],[f8])).
% 0.20/0.26 thf(f10,plain,(
% 0.20/0.26 ( ! [X5 : a] : ((p = (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ sK1))) | ($true != ((p @ X5))) | (sK2 = X5)) )),
% 0.20/0.26 inference(cnf_transformation,[],[f8])).
% 0.20/0.26 thf(f11,plain,(
% 0.20/0.26 ( ! [X0 : a,X1 : a] : ((p != (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ X0))) | ($true != ((p @ X1))) | (((p @ (sK0 @ X1))) = $true)) )),
% 0.20/0.26 inference(cnf_transformation,[],[f8])).
% 0.20/0.26 thf(f12,plain,(
% 0.20/0.26 ( ! [X0 : a,X1 : a] : ((((sK0 @ X1)) != X1) | (p != (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ X0))) | ($true != ((p @ X1)))) )),
% 0.20/0.26 inference(cnf_transformation,[],[f8])).
% 0.20/0.26 thf(f15,plain,(
% 0.20/0.26 (p = ((= @ sK1))) | ($true = ((p @ sK2)))),
% 0.20/0.26 inference(beta-eta_normalization,[],[f9])).
% 0.20/0.27 thf(f16,plain,(
% 0.20/0.27 ( ! [X0 : a,X1 : a] : ((p != ((= @ X0))) | (((sK0 @ X1)) != X1) | ($true != ((p @ X1)))) )),
% 0.20/0.27 inference(beta-eta_normalization,[],[f12])).
% 0.20/0.27 thf(f17,plain,(
% 0.20/0.27 ( ! [X0 : a,X1 : a] : ((((p @ (sK0 @ X1))) = $true) | (p != ((= @ X0))) | ($true != ((p @ X1)))) )),
% 0.20/0.27 inference(beta-eta_normalization,[],[f11])).
% 0.20/0.27 thf(f18,plain,(
% 0.20/0.27 ( ! [X5 : a] : ((sK2 = X5) | ($true != ((p @ X5))) | (p = ((= @ sK1)))) )),
% 0.20/0.27 inference(beta-eta_normalization,[],[f10])).
% 0.20/0.27 thf(f20,definition,(
% 0.20/0.27 spl3_1 <=> ($true = ((p @ sK2)))),
% 0.20/0.27 introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition])).
% 0.20/0.27 thf(f22,plain,(
% 0.20/0.27 ($true = ((p @ sK2))) | ~spl3_1),
% 0.20/0.27 inference(avatar_component_clause,[],[f20])).
% 0.20/0.27 thf(f24,definition,(
% 0.20/0.27 spl3_2 <=> (p = ((= @ sK1)))),
% 0.20/0.27 introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition])).
% 0.20/0.27 thf(f26,plain,(
% 0.20/0.27 (p = ((= @ sK1))) | ~spl3_2),
% 0.20/0.27 inference(avatar_component_clause,[],[f24])).
% 0.20/0.27 thf(f27,plain,(
% 0.20/0.27 spl3_1 | spl3_2),
% 0.20/0.27 inference(avatar_split_clause,[],[f15,f24,f20])).
% 0.20/0.27 thf(f29,definition,(
% 0.20/0.27 spl3_3 <=> ! [X0 : a] : (p != ((= @ X0)))),
% 0.20/0.27 introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition])).
% 0.20/0.27 thf(f30,plain,(
% 0.20/0.27 ( ! [X0 : a] : ((p != ((= @ X0)))) ) | ~spl3_3),
% 0.20/0.27 inference(avatar_component_clause,[],[f29])).
% 0.20/0.27 thf(f32,definition,(
% 0.20/0.27 spl3_4 <=> ! [X1 : a] : ((((sK0 @ X1)) != X1) | ($true != ((p @ X1))))),
% 0.20/0.27 introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition])).
% 0.20/0.27 thf(f33,plain,(
% 0.20/0.27 ( ! [X1 : a] : (($true != ((p @ X1))) | (((sK0 @ X1)) != X1)) ) | ~spl3_4),
% 0.20/0.27 inference(avatar_component_clause,[],[f32])).
% 0.20/0.27 thf(f34,plain,(
% 0.20/0.27 spl3_3 | spl3_4),
% 0.20/0.27 inference(avatar_split_clause,[],[f16,f32,f29])).
% 0.20/0.27 thf(f36,definition,(
% 0.20/0.27 spl3_5 <=> ! [X1 : a] : ((((p @ (sK0 @ X1))) = $true) | ($true != ((p @ X1))))),
% 0.20/0.27 introduced(definition,[new_symbols(definition,[spl3_5])],[avatar_definition])).
% 0.20/0.27 thf(f37,plain,(
% 0.20/0.27 ( ! [X1 : a] : (($true != ((p @ X1))) | (((p @ (sK0 @ X1))) = $true)) ) | ~spl3_5),
% 0.20/0.27 inference(avatar_component_clause,[],[f36])).
% 0.20/0.27 thf(f38,plain,(
% 0.20/0.27 spl3_5 | spl3_3),
% 0.20/0.27 inference(avatar_split_clause,[],[f17,f29,f36])).
% 0.20/0.27 thf(f40,definition,(
% 0.20/0.27 spl3_6 <=> ! [X5 : a] : ((sK2 = X5) | ($true != ((p @ X5))))),
% 0.20/0.27 introduced(definition,[new_symbols(definition,[spl3_6])],[avatar_definition])).
% 0.20/0.27 thf(f41,plain,(
% 0.20/0.27 ( ! [X5 : a] : (($true != ((p @ X5))) | (sK2 = X5)) ) | ~spl3_6),
% 0.20/0.27 inference(avatar_component_clause,[],[f40])).
% 0.20/0.27 thf(f42,plain,(
% 0.20/0.27 spl3_2 | spl3_6),
% 0.20/0.27 inference(avatar_split_clause,[],[f18,f40,f24])).
% 0.20/0.27 thf(f43,plain,(
% 0.20/0.27 ( ! [X1 : a] : ((((p @ X1)) = ((sK1 = X1)))) ) | ~spl3_2),
% 0.20/0.27 inference(argument_congruence,[],[f26])).
% 0.20/0.27 thf(f44,plain,(
% 0.20/0.27 ( ! [X1 : a] : (($true = ((p @ X1))) | ($false = ((sK1 = X1)))) ) | ~spl3_2),
% 0.20/0.27 inference(iff_proxy_clausification,[],[f43])).
% 0.20/0.27 thf(f45,plain,(
% 0.20/0.27 ( ! [X1 : a] : (($true = ((sK1 = X1))) | ($false = ((p @ X1)))) ) | ~spl3_2),
% 0.20/0.27 inference(iff_proxy_clausification,[],[f43])).
% 0.20/0.27 thf(f46,plain,(
% 0.20/0.27 ( ! [X1 : a] : (($false = ((p @ X1))) | (sK1 = X1)) ) | ~spl3_2),
% 0.20/0.27 inference(equality_proxy_clausification,[],[f45])).
% 0.20/0.27 thf(f47,plain,(
% 0.20/0.27 ( ! [X1 : a] : ((sK1 != X1) | ($true = ((p @ X1)))) ) | ~spl3_2),
% 0.20/0.27 inference(equality_proxy_clausification,[],[f44])).
% 0.20/0.27 thf(f48,plain,(
% 0.20/0.27 ( ! [X0 : a] : ((((X0 = (sK4 @ X0))) != ((p @ (sK4 @ X0))))) ) | ~spl3_3),
% 0.20/0.27 inference(negative_extensionality,[],[f30])).
% 0.20/0.27 thf(f49,plain,(
% 0.20/0.27 (p != p) | (~spl3_2 | ~spl3_3)),
% 0.20/0.27 inference(constrained_superposition,[],[f30,f26])).
% 0.20/0.27 thf(f50,plain,(
% 0.20/0.27 $false | (~spl3_2 | ~spl3_3)),
% 0.20/0.27 inference(trivial_inequality_removal,[],[f49])).
% 0.20/0.27 thf(f51,plain,(
% 0.20/0.27 ~spl3_2 | ~spl3_3),
% 0.20/0.27 inference(avatar_contradiction_clause,[],[f50])).
% 0.20/0.27 thf(f52,plain,(
% 0.20/0.27 ( ! [X0 : a] : (($true = ((p @ (sK4 @ X0)))) | ($true = ((X0 = (sK4 @ X0))))) ) | ~spl3_3),
% 0.20/0.27 inference(xor_proxy_clausification,[],[f48])).
% 0.20/0.27 thf(f53,plain,(
% 0.20/0.27 ( ! [X0 : a] : ((((X0 = (sK4 @ X0))) = $false) | ($false = ((p @ (sK4 @ X0))))) ) | ~spl3_3),
% 0.20/0.27 inference(xor_proxy_clausification,[],[f48])).
% 0.20/0.27 thf(f54,plain,(
% 0.20/0.27 ( ! [X0 : a] : ((((sK4 @ X0)) != X0) | ($false = ((p @ (sK4 @ X0))))) ) | ~spl3_3),
% 0.20/0.27 inference(equality_proxy_clausification,[],[f53])).
% 0.20/0.27 thf(f55,plain,(
% 0.20/0.27 ( ! [X0 : a] : (($true = ((p @ (sK4 @ X0)))) | (((sK4 @ X0)) = X0)) ) | ~spl3_3),
% 0.20/0.27 inference(equality_proxy_clausification,[],[f52])).
% 0.20/0.27 thf(f57,plain,(
% 0.20/0.27 ( ! [X0 : a] : ((((sK4 @ X0)) = X0) | ($true != $true) | (sK2 = ((sK4 @ X0)))) ) | (~spl3_3 | ~spl3_6)),
% 0.20/0.27 inference(constrained_superposition,[],[f41,f55])).
% 0.20/0.27 thf(f58,plain,(
% 0.20/0.27 ( ! [X0 : a] : ((((sK4 @ X0)) = X0) | (sK2 = ((sK4 @ X0)))) ) | (~spl3_3 | ~spl3_6)),
% 0.20/0.27 inference(trivial_inequality_removal,[],[f57])).
% 0.20/0.27 thf(f62,plain,(
% 0.20/0.27 ( ! [X0 : a] : ((sK2 != X0) | (sK2 = ((sK4 @ X0)))) ) | (~spl3_3 | ~spl3_6)),
% 0.20/0.27 inference(equality_factoring,[],[f58])).
% 0.20/0.27 thf(f65,plain,(
% 0.20/0.27 (((sK4 @ sK2)) = sK2) | (sK2 != sK2) | (~spl3_3 | ~spl3_6)),
% 0.20/0.27 inference(imitation,[],[f62])).
% 0.20/0.27 thf(f67,plain,(
% 0.20/0.27 (((sK4 @ sK2)) = sK2) | (~spl3_3 | ~spl3_6)),
% 0.20/0.27 inference(trivial_inequality_removal,[],[f65])).
% 0.20/0.27 thf(f68,plain,(
% 0.20/0.27 (sK2 != sK2) | (((p @ sK2)) = $false) | (~spl3_3 | ~spl3_6)),
% 0.20/0.27 inference(constrained_superposition,[],[f54,f67])).
% 0.20/0.27 thf(f69,plain,(
% 0.20/0.27 (((p @ sK2)) = $false) | (~spl3_3 | ~spl3_6)),
% 0.20/0.27 inference(trivial_inequality_removal,[],[f68])).
% 0.20/0.27 thf(f70,plain,(
% 0.20/0.27 ($true = $false) | (~spl3_1 | ~spl3_3 | ~spl3_6)),
% 0.20/0.27 inference(forward_demodulation,[],[f69,f22])).
% 0.20/0.27 thf(f71,plain,(
% 0.20/0.27 $false | (~spl3_1 | ~spl3_3 | ~spl3_6)),
% 0.20/0.27 inference(trivial_inequality_removal,[],[f70])).
% 0.20/0.27 thf(f72,plain,(
% 0.20/0.27 ~spl3_1 | ~spl3_3 | ~spl3_6),
% 0.20/0.27 inference(avatar_contradiction_clause,[],[f71])).
% 0.20/0.27 thf(f96,plain,(
% 0.20/0.27 ($true != $true) | (sK2 != ((sK0 @ sK2))) | (~spl3_1 | ~spl3_4)),
% 0.20/0.27 inference(constrained_superposition,[],[f33,f22])).
% 0.20/0.27 thf(f98,plain,(
% 0.20/0.27 (sK2 != ((sK0 @ sK2))) | (~spl3_1 | ~spl3_4)),
% 0.20/0.27 inference(trivial_inequality_removal,[],[f96])).
% 0.20/0.27 thf(f101,plain,(
% 0.20/0.27 ($true = ((p @ (sK0 @ sK2)))) | ($true != $true) | (~spl3_1 | ~spl3_5)),
% 0.20/0.27 inference(constrained_superposition,[],[f37,f22])).
% 0.20/0.27 thf(f104,plain,(
% 0.20/0.27 ($true = ((p @ (sK0 @ sK2)))) | (~spl3_1 | ~spl3_5)),
% 0.20/0.27 inference(trivial_inequality_removal,[],[f101])).
% 0.20/0.27 thf(f108,plain,(
% 0.20/0.27 (sK2 = ((sK0 @ sK2))) | ($true != $true) | (~spl3_1 | ~spl3_5 | ~spl3_6)),
% 0.20/0.27 inference(constrained_superposition,[],[f41,f104])).
% 0.20/0.27 thf(f110,plain,(
% 0.20/0.27 (sK2 = ((sK0 @ sK2))) | (~spl3_1 | ~spl3_5 | ~spl3_6)),
% 0.20/0.27 inference(trivial_inequality_removal,[],[f108])).
% 0.20/0.27 thf(f112,plain,(
% 0.20/0.27 $false | (~spl3_1 | ~spl3_4 | ~spl3_5 | ~spl3_6)),
% 0.20/0.27 inference(forward_subsumption_resolution,[],[f110,f98])).
% 0.20/0.27 thf(f113,plain,(
% 0.20/0.27 ~spl3_1 | ~spl3_4 | ~spl3_5 | ~spl3_6),
% 0.20/0.27 inference(avatar_contradiction_clause,[],[f112])).
% 0.20/0.27 thf(f151,plain,(
% 0.20/0.27 ($true = ((p @ sK1))) | ~spl3_2),
% 0.20/0.27 inference(equality_resolution,[],[f47])).
% 0.20/0.27 thf(f174,plain,(
% 0.20/0.27 ($true != $true) | ($true = ((p @ (sK0 @ sK1)))) | (~spl3_2 | ~spl3_5)),
% 0.20/0.27 inference(constrained_superposition,[],[f37,f151])).
% 0.20/0.27 thf(f175,plain,(
% 0.20/0.27 (((sK0 @ sK1)) != sK1) | ($true != $true) | (~spl3_2 | ~spl3_4)),
% 0.20/0.27 inference(constrained_superposition,[],[f33,f151])).
% 0.20/0.27 thf(f176,plain,(
% 0.20/0.27 ($true = ((p @ (sK0 @ sK1)))) | (~spl3_2 | ~spl3_5)),
% 0.20/0.27 inference(trivial_inequality_removal,[],[f174])).
% 0.20/0.27 thf(f177,plain,(
% 0.20/0.27 (((sK0 @ sK1)) != sK1) | (~spl3_2 | ~spl3_4)),
% 0.20/0.27 inference(trivial_inequality_removal,[],[f175])).
% 0.20/0.27 thf(f179,plain,(
% 0.20/0.27 (((sK0 @ sK1)) = sK1) | ($true = $false) | (~spl3_2 | ~spl3_5)),
% 0.20/0.27 inference(constrained_superposition,[],[f46,f176])).
% 0.20/0.27 thf(f183,plain,(
% 0.20/0.27 (((sK0 @ sK1)) = sK1) | (~spl3_2 | ~spl3_5)),
% 0.20/0.27 inference(trivial_inequality_removal,[],[f179])).
% 0.20/0.27 thf(f188,plain,(
% 0.20/0.27 $false | (~spl3_2 | ~spl3_4 | ~spl3_5)),
% 0.20/0.27 inference(forward_subsumption_resolution,[],[f183,f177])).
% 0.20/0.27 thf(f189,plain,(
% 0.20/0.27 ~spl3_2 | ~spl3_4 | ~spl3_5),
% 0.20/0.27 inference(avatar_contradiction_clause,[],[f188])).
% 0.20/0.27 cnf(s1, plain, spl3_1 | spl3_2, inference(sat_conversion,[],[f27])).
% 0.20/0.27 cnf(s2, plain, spl3_3 | spl3_4, inference(sat_conversion,[],[f34])).
% 0.20/0.27 cnf(s3, plain, spl3_3 | spl3_5, inference(sat_conversion,[],[f38])).
% 0.20/0.27 cnf(s4, plain, spl3_2 | spl3_6, inference(sat_conversion,[],[f42])).
% 0.20/0.27 cnf(s5, plain, ~spl3_2 | ~spl3_3, inference(sat_conversion,[],[f51])).
% 0.20/0.27 cnf(s6, plain, ~spl3_1 | ~spl3_3 | ~spl3_6, inference(sat_conversion,[],[f72])).
% 0.20/0.27 cnf(s9, plain, ~spl3_1 | ~spl3_4 | ~spl3_5 | ~spl3_6, inference(sat_conversion,[],[f113])).
% 0.20/0.27 cnf(s18, plain, ~spl3_2 | ~spl3_4 | ~spl3_5, inference(sat_conversion,[],[f189])).
% 0.20/0.27 cnf(s19, plain, ~spl3_2, inference(rat,[],[s18,s2,s3,s5])).
% 0.20/0.27 cnf(s20, plain, spl3_6, inference(rat,[],[s4,s19])).
% 0.20/0.27 cnf(s21, plain, spl3_1, inference(rat,[],[s1,s19])).
% 0.20/0.27 cnf(s22, plain, ~spl3_3, inference(rat,[],[s6,s20,s21])).
% 0.20/0.27 cnf(s23, plain, spl3_5, inference(rat,[],[s3,s22])).
% 0.20/0.27 cnf(s24, plain, spl3_4, inference(rat,[],[s2,s22])).
% 0.20/0.27 cnf(s25, plain, $false, inference(rat,[],[s9,s20,s21,s23,s24])).
% 0.20/0.27 thf(f190,plain,(
% 0.20/0.27 $false),
% 0.20/0.27 inference(avatar_sat_refutation,[],[s25])).
% 0.20/0.27 % SZS output end Proof for theBenchmark
% 0.20/0.27 % (1450437)------------------------------
% 0.20/0.27 % (1450437)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (1450437)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (1450437)CaDiCaL version: 2.1.3
% 0.20/0.27 % (1450437)Termination reason: Refutation
% 0.20/0.27 % (1450437)Time elapsed: 0.004 s
% 0.20/0.27 % (1450437)Peak memory usage: 13 MB
% 0.20/0.27 % (1450437)Instructions burned: 9 (million)
% 0.20/0.27 % (1450431)Success in time 0.031 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------