%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV386^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 : n012.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:39:26 AM UTC 2026
% Result : Theorem 0.08s 0.16s
% Output : Refutation 0.08s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEV386^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.00/0.10 % Computer : n012.cluster.edu
% 0.00/0.10 % Model : x86_64 x86_64
% 0.00/0.10 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10 % Memory : 8046.5625MB
% 0.00/0.10 % OS : Linux 6.8.0-71-generic
% 0.00/0.10 % CPULimit : 300
% 0.00/0.10 % WCLimit : 300
% 0.00/0.10 % DateTime : Tue Sep 29 15:43:03 UTC 2026
% 0.00/0.10 % CPUTime :
% 0.00/0.10 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.12 Running first-order model finding
% 0.08/0.12 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.08/0.16 % (271488)Will run a generic schedule for satisfiability detection.
% 0.08/0.16 % (271494)% WARNING: option uhcvi not known.
% 0.08/0.16 % (271499)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1346359678:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.16 % (271497)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2651292085:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.16 % (271494)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1949672432:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.16 % (271496)dis+10_1_sil=32000:sp=arity:random_seed=2293472354:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.16 % (271495)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1677774019:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.16 % (271493)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3286622955_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.16 % (271498)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3845367902:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.16 % (271497)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.16 % (271494)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.16 % (271494)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.08/0.16 % Exception at run slice level
% 0.08/0.16 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.08/0.16 % (271497) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-271488-271497"...
% 0.08/0.16 % (271499) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-271488-271499"...
% 0.08/0.16 % (271496) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-271488-271496"...
% 0.08/0.16 % (271499)...printing done.
% 0.08/0.16 % (271497)...printing done.
% 0.08/0.16 % (271498) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-271488-271498"...
% 0.08/0.16 % (271499)Refutation found. Thanks to Tanya!
% 0.08/0.16 % SZS status Theorem for theBenchmark
% 0.08/0.16 % SZS output start Proof for theBenchmark
% 0.08/0.16 thf(type_def_5, type, a: $tType).
% 0.08/0.16 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.08/0.16 thf(func_def_0, type, p: (a > $o)).
% 0.08/0.16 thf(func_def_2, type, db1: !>[X0: $tType]:(X0)).
% 0.08/0.16 thf(func_def_3, type, db0: !>[X0: $tType]:(X0)).
% 0.08/0.16 thf(func_def_4, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.08/0.16 thf(func_def_5, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.08/0.16 thf(func_def_8, type, sK0: (a > a)).
% 0.08/0.16 thf(func_def_9, type, sK1: a).
% 0.08/0.16 thf(func_def_10, type, sK2: a).
% 0.08/0.16 thf(func_def_12, type, sK4: (a > a)).
% 0.08/0.16 thf(f1,conjecture,(
% 0.08/0.16 ? [X0 : a] : (p = (((^[X1 : a, X0 : a] : ((X1 = X0))) @ X0))) <=> ? [X0 : a] : (! [X2 : a] : ((p @ X2) => (X0 = X2)) & (p @ X0))),
% 0.08/0.16 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTTTP5306A_pme)).
% 0.08/0.16 thf(f2,negated_conjecture,(
% 0.08/0.16 ~(? [X0 : a] : (p = (((^[X1 : a, X0 : a] : ((X1 = X0))) @ X0))) <=> ? [X0 : a] : (! [X2 : a] : ((p @ X2) => (X0 = X2)) & (p @ X0)))),
% 0.08/0.16 inference(negated_conjecture,[status(cth)],[f1])).
% 0.08/0.16 thf(f3,plain,(
% 0.08/0.16 ~(? [X0 : a] : (p = (((^[X1 : a, X2 : a] : ((X1 = X2))) @ X0))) <=> ? [X3 : a] : (! [X4 : a] : ((p @ X4) => (X3 = X4)) & (p @ X3)))),
% 0.08/0.16 inference(rectify,[],[f2])).
% 0.08/0.16 thf(f4,plain,(
% 0.08/0.16 ~(? [X0 : a] : (p = (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ X0))) <=> ? [X3 : a] : (! [X4 : a] : ((((p @ X4)) = $true) => (X3 = X4)) & (((p @ X3)) = $true)))),
% 0.08/0.16 inference(fool_elimination,[],[f3])).
% 0.08/0.16 thf(f5,plain,(
% 0.08/0.16 ~(? [X0 : a] : (p = (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ X0))) <=> ? [X1 : a] : (! [X2 : a] : ((((p @ X2)) = $true) => (X1 = X2)) & ($true = ((p @ X1)))))),
% 0.08/0.16 inference(rectify,[],[f4])).
% 0.08/0.16 thf(f6,plain,(
% 0.08/0.16 ? [X0 : a] : (p = (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ X0))) <~> ? [X1 : a] : (! [X2 : a] : ((X1 = X2) | (((p @ X2)) != $true)) & ($true = ((p @ X1))))),
% 0.08/0.16 inference(ennf_transformation,[],[f5])).
% 0.08/0.16 thf(f7,plain,(
% 0.08/0.16 (! [X1 : a] : (? [X2 : a] : ((X1 != X2) & (((p @ X2)) = $true)) | ($true != ((p @ X1)))) | ! [X0 : a] : (p != (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ X0)))) & (? [X1 : a] : (! [X2 : a] : ((X1 = X2) | (((p @ X2)) != $true)) & ($true = ((p @ X1)))) | ? [X0 : a] : (p = (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ X0))))),
% 0.08/0.16 inference(nnf_transformation,[],[f6])).
% 0.08/0.16 thf(f8,plain,(
% 0.08/0.16 (! [X0 : a] : (? [X1 : a] : ((X0 != X1) & ($true = ((p @ X1)))) | (((p @ X0)) != $true)) | ! [X2 : a] : (p != (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ X2)))) & (? [X3 : a] : (! [X4 : a] : ((X3 = X4) | (((p @ X4)) != $true)) & (((p @ X3)) = $true)) | ? [X5 : a] : (p = (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ X5))))),
% 0.08/0.16 inference(rectify,[],[f7])).
% 0.08/0.16 thf(f9,plain,(
% 0.08/0.16 (! [X0 : a] : (((((sK0 @ X0)) != X0) & ($true = ((p @ (sK0 @ X0))))) | (((p @ X0)) != $true)) | ! [X2 : a] : (p != (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ X2)))) & ((! [X4 : a] : ((sK1 = X4) | (((p @ X4)) != $true)) & ($true = ((p @ sK1)))) | (p = (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ sK2))))),
% 0.08/0.16 inference(skolemize,[status(esa),new_symbols(skolem,[vAPP,sK1,sK2]),skolemize(X1,sK0 @ X0),skolemize(X3,sK1),skolemize(X5,sK2)],[f8])).
% 0.08/0.16 thf(f10,plain,(
% 0.08/0.16 ($true = ((p @ sK1))) | (p = (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ sK2)))),
% 0.08/0.16 inference(cnf_transformation,[],[f9])).
% 0.08/0.16 thf(f11,plain,(
% 0.08/0.16 ( ! [X4 : a] : ((sK1 = X4) | (((p @ X4)) != $true) | (p = (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ sK2)))) )),
% 0.08/0.16 inference(cnf_transformation,[],[f9])).
% 0.08/0.16 thf(f12,plain,(
% 0.08/0.16 ( ! [X2 : a,X0 : a] : (($true = ((p @ (sK0 @ X0)))) | (((p @ X0)) != $true) | (p != (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ X2)))) )),
% 0.08/0.16 inference(cnf_transformation,[],[f9])).
% 0.08/0.16 thf(f13,plain,(
% 0.08/0.16 ( ! [X2 : a,X0 : a] : ((((sK0 @ X0)) != X0) | (((p @ X0)) != $true) | (p != (((^[Y0 : a]: ((^[Y1 : a]: (Y0 = Y1)))) @ X2)))) )),
% 0.08/0.16 inference(cnf_transformation,[],[f9])).
% 0.08/0.16 thf(f16,plain,(
% 0.08/0.16 ($true = ((p @ sK1))) | (p = ((= @ sK2)))),
% 0.08/0.16 inference(beta-eta_normalization,[],[f10])).
% 0.08/0.16 thf(f17,plain,(
% 0.08/0.16 ( ! [X4 : a] : ((sK1 = X4) | (((p @ X4)) != $true) | (p = ((= @ sK2)))) )),
% 0.08/0.16 inference(beta-eta_normalization,[],[f11])).
% 0.08/0.16 thf(f18,plain,(
% 0.08/0.16 ( ! [X2 : a,X0 : a] : (($true = ((p @ (sK0 @ X0)))) | (((p @ X0)) != $true) | (p != ((= @ X2)))) )),
% 0.08/0.16 inference(beta-eta_normalization,[],[f12])).
% 0.08/0.16 thf(f19,plain,(
% 0.08/0.16 ( ! [X2 : a,X0 : a] : ((((sK0 @ X0)) != X0) | (((p @ X0)) != $true) | (p != ((= @ X2)))) )),
% 0.08/0.16 inference(beta-eta_normalization,[],[f13])).
% 0.08/0.16 thf(f21,definition,(
% 0.08/0.16 spl3_1 <=> (p = ((= @ sK2)))),
% 0.08/0.16 introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition])).
% 0.08/0.16 thf(f23,plain,(
% 0.08/0.16 (p = ((= @ sK2))) | ~spl3_1),
% 0.08/0.16 inference(avatar_component_clause,[],[f21])).
% 0.08/0.16 thf(f25,definition,(
% 0.08/0.16 spl3_2 <=> ($true = ((p @ sK1)))),
% 0.08/0.16 introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition])).
% 0.08/0.16 thf(f27,plain,(
% 0.08/0.16 ($true = ((p @ sK1))) | ~spl3_2),
% 0.08/0.16 inference(avatar_component_clause,[],[f25])).
% 0.08/0.16 thf(f28,plain,(
% 0.08/0.16 spl3_1 | spl3_2),
% 0.08/0.16 inference(avatar_split_clause,[],[f16,f25,f21])).
% 0.08/0.16 thf(f30,definition,(
% 0.08/0.16 spl3_3 <=> ! [X4 : a] : ((sK1 = X4) | (((p @ X4)) != $true))),
% 0.08/0.16 introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition])).
% 0.08/0.16 thf(f31,plain,(
% 0.08/0.16 ( ! [X4 : a] : ((((p @ X4)) != $true) | (sK1 = X4)) ) | ~spl3_3),
% 0.08/0.16 inference(avatar_component_clause,[],[f30])).
% 0.08/0.16 thf(f32,plain,(
% 0.08/0.16 spl3_1 | spl3_3),
% 0.08/0.16 inference(avatar_split_clause,[],[f17,f30,f21])).
% 0.08/0.16 thf(f34,definition,(
% 0.08/0.16 spl3_4 <=> ! [X2 : a] : (p != ((= @ X2)))),
% 0.08/0.16 introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition])).
% 0.08/0.16 thf(f35,plain,(
% 0.08/0.16 ( ! [X2 : a] : ((p != ((= @ X2)))) ) | ~spl3_4),
% 0.08/0.16 inference(avatar_component_clause,[],[f34])).
% 0.08/0.16 thf(f37,definition,(
% 0.08/0.16 spl3_5 <=> ! [X0 : a] : (($true = ((p @ (sK0 @ X0)))) | (((p @ X0)) != $true))),
% 0.08/0.16 introduced(definition,[new_symbols(definition,[spl3_5])],[avatar_definition])).
% 0.08/0.16 thf(f38,plain,(
% 0.08/0.16 ( ! [X0 : a] : ((((p @ X0)) != $true) | ($true = ((p @ (sK0 @ X0))))) ) | ~spl3_5),
% 0.08/0.16 inference(avatar_component_clause,[],[f37])).
% 0.08/0.16 thf(f39,plain,(
% 0.08/0.16 spl3_4 | spl3_5),
% 0.08/0.16 inference(avatar_split_clause,[],[f18,f37,f34])).
% 0.08/0.16 thf(f41,definition,(
% 0.08/0.16 spl3_6 <=> ! [X0 : a] : ((((sK0 @ X0)) != X0) | (((p @ X0)) != $true))),
% 0.08/0.16 introduced(definition,[new_symbols(definition,[spl3_6])],[avatar_definition])).
% 0.08/0.16 thf(f42,plain,(
% 0.08/0.16 ( ! [X0 : a] : ((((p @ X0)) != $true) | (((sK0 @ X0)) != X0)) ) | ~spl3_6),
% 0.08/0.16 inference(avatar_component_clause,[],[f41])).
% 0.08/0.16 thf(f43,plain,(
% 0.08/0.16 spl3_4 | spl3_6),
% 0.08/0.16 inference(avatar_split_clause,[],[f19,f41,f34])).
% 0.08/0.16 thf(f44,plain,(
% 0.08/0.16 ( ! [X2 : a] : ((((p @ (sK4 @ X2))) != ((X2 = (sK4 @ X2))))) ) | ~spl3_4),
% 0.08/0.16 inference(negative_extensionality,[],[f35])).
% 0.08/0.16 thf(f45,plain,(
% 0.08/0.16 ( ! [X2 : a] : (($true = ((p @ (sK4 @ X2)))) | ($true = ((X2 = (sK4 @ X2))))) ) | ~spl3_4),
% 0.08/0.16 inference(xor_proxy_clausification,[],[f44])).
% 0.08/0.16 thf(f46,plain,(
% 0.08/0.16 ( ! [X2 : a] : (($false = ((p @ (sK4 @ X2)))) | ($false = ((X2 = (sK4 @ X2))))) ) | ~spl3_4),
% 0.08/0.16 inference(xor_proxy_clausification,[],[f44])).
% 0.08/0.16 thf(f47,plain,(
% 0.08/0.16 ( ! [X2 : a] : ((((sK4 @ X2)) != X2) | ($false = ((p @ (sK4 @ X2))))) ) | ~spl3_4),
% 0.08/0.16 inference(equality_proxy_clausification,[],[f46])).
% 0.08/0.16 thf(f48,plain,(
% 0.08/0.16 ( ! [X2 : a] : (($true = ((p @ (sK4 @ X2)))) | (((sK4 @ X2)) = X2)) ) | ~spl3_4),
% 0.08/0.16 inference(equality_proxy_clausification,[],[f45])).
% 0.08/0.16 thf(f49,plain,(
% 0.08/0.16 ( ! [X0 : a] : (($true != $true) | (sK1 = ((sK4 @ X0))) | (((sK4 @ X0)) = X0)) ) | (~spl3_3 | ~spl3_4)),
% 0.08/0.16 inference(constrained_superposition,[],[f31,f48])).
% 0.08/0.16 thf(f50,plain,(
% 0.08/0.16 ( ! [X0 : a] : ((sK1 = ((sK4 @ X0))) | (((sK4 @ X0)) = X0)) ) | (~spl3_3 | ~spl3_4)),
% 0.08/0.16 inference(trivial_inequality_removal,[],[f49])).
% 0.08/0.16 thf(f54,plain,(
% 0.08/0.16 ( ! [X0 : a] : ((sK1 != X0) | (((sK4 @ X0)) = X0)) ) | (~spl3_3 | ~spl3_4)),
% 0.08/0.16 inference(equality_factoring,[],[f50])).
% 0.08/0.16 thf(f57,plain,(
% 0.08/0.16 (sK1 = ((sK4 @ sK1))) | (~spl3_3 | ~spl3_4)),
% 0.08/0.16 inference(equality_resolution,[],[f54])).
% 0.08/0.16 thf(f58,plain,(
% 0.08/0.16 (sK1 != sK1) | (((p @ sK1)) = $false) | (~spl3_3 | ~spl3_4)),
% 0.08/0.16 inference(constrained_superposition,[],[f47,f57])).
% 0.08/0.16 thf(f59,plain,(
% 0.08/0.16 (((p @ sK1)) = $false) | (~spl3_3 | ~spl3_4)),
% 0.08/0.16 inference(trivial_inequality_removal,[],[f58])).
% 0.08/0.16 thf(f60,plain,(
% 0.08/0.16 ($true = $false) | (~spl3_2 | ~spl3_3 | ~spl3_4)),
% 0.08/0.16 inference(constrained_superposition,[],[f59,f27])).
% 0.08/0.16 thf(f64,plain,(
% 0.08/0.16 $false | (~spl3_2 | ~spl3_3 | ~spl3_4)),
% 0.08/0.16 inference(trivial_inequality_removal,[],[f60])).
% 0.08/0.16 thf(f65,plain,(
% 0.08/0.16 ~spl3_2 | ~spl3_3 | ~spl3_4),
% 0.08/0.16 inference(avatar_contradiction_clause,[],[f64])).
% 0.08/0.16 thf(f82,plain,(
% 0.08/0.16 ( ! [X1 : a] : ((((p @ X1)) = ((sK2 = X1)))) ) | ~spl3_1),
% 0.08/0.16 inference(argument_congruence,[],[f23])).
% 0.08/0.16 thf(f83,plain,(
% 0.08/0.16 (p != p) | (~spl3_1 | ~spl3_4)),
% 0.08/0.16 inference(constrained_superposition,[],[f35,f23])).
% 0.08/0.16 thf(f84,plain,(
% 0.08/0.16 $false | (~spl3_1 | ~spl3_4)),
% 0.08/0.16 inference(trivial_inequality_removal,[],[f83])).
% 0.08/0.16 thf(f85,plain,(
% 0.08/0.16 ~spl3_1 | ~spl3_4),
% 0.08/0.16 inference(avatar_contradiction_clause,[],[f84])).
% 0.08/0.16 thf(f86,plain,(
% 0.08/0.16 ( ! [X1 : a] : (($true = ((p @ X1))) | ($false = ((sK2 = X1)))) ) | ~spl3_1),
% 0.08/0.16 inference(iff_proxy_clausification,[],[f82])).
% 0.08/0.16 thf(f87,plain,(
% 0.08/0.16 ( ! [X1 : a] : ((((p @ X1)) = $false) | ($true = ((sK2 = X1)))) ) | ~spl3_1),
% 0.08/0.16 inference(iff_proxy_clausification,[],[f82])).
% 0.08/0.16 thf(f88,plain,(
% 0.08/0.16 ( ! [X1 : a] : ((((p @ X1)) = $false) | (sK2 = X1)) ) | ~spl3_1),
% 0.08/0.16 inference(equality_proxy_clausification,[],[f87])).
% 0.08/0.16 thf(f89,plain,(
% 0.08/0.16 ( ! [X1 : a] : ((sK2 != X1) | ($true = ((p @ X1)))) ) | ~spl3_1),
% 0.08/0.16 inference(equality_proxy_clausification,[],[f86])).
% 0.08/0.16 thf(f92,plain,(
% 0.08/0.16 ($true = ((p @ sK2))) | ~spl3_1),
% 0.08/0.16 inference(equality_resolution,[],[f89])).
% 0.08/0.16 thf(f117,plain,(
% 0.08/0.16 ($true != $true) | (sK2 != ((sK0 @ sK2))) | (~spl3_1 | ~spl3_6)),
% 0.08/0.16 inference(constrained_superposition,[],[f42,f92])).
% 0.08/0.16 thf(f118,plain,(
% 0.08/0.16 ($true != $true) | (sK1 != ((sK0 @ sK1))) | (~spl3_2 | ~spl3_6)),
% 0.08/0.16 inference(constrained_superposition,[],[f42,f27])).
% 0.08/0.16 thf(f119,plain,(
% 0.08/0.16 (sK1 != ((sK0 @ sK1))) | (~spl3_2 | ~spl3_6)),
% 0.08/0.16 inference(trivial_inequality_removal,[],[f118])).
% 0.08/0.16 thf(f120,plain,(
% 0.08/0.16 (sK2 != ((sK0 @ sK2))) | (~spl3_1 | ~spl3_6)),
% 0.08/0.16 inference(trivial_inequality_removal,[],[f117])).
% 0.08/0.16 thf(f124,plain,(
% 0.08/0.16 ($true != $true) | ($true = ((p @ (sK0 @ sK2)))) | (~spl3_1 | ~spl3_5)),
% 0.08/0.16 inference(constrained_superposition,[],[f38,f92])).
% 0.08/0.16 thf(f125,plain,(
% 0.08/0.16 ($true != $true) | ($true = ((p @ (sK0 @ sK1)))) | (~spl3_2 | ~spl3_5)),
% 0.08/0.16 inference(constrained_superposition,[],[f38,f27])).
% 0.08/0.16 thf(f126,plain,(
% 0.08/0.16 ($true = ((p @ (sK0 @ sK1)))) | (~spl3_2 | ~spl3_5)),
% 0.08/0.16 inference(trivial_inequality_removal,[],[f125])).
% 0.08/0.16 thf(f127,plain,(
% 0.08/0.16 ($true = ((p @ (sK0 @ sK2)))) | (~spl3_1 | ~spl3_5)),
% 0.08/0.16 inference(trivial_inequality_removal,[],[f124])).
% 0.08/0.16 thf(f134,plain,(
% 0.08/0.16 ($true != $true) | (sK1 = ((sK0 @ sK1))) | (~spl3_2 | ~spl3_3 | ~spl3_5)),
% 0.08/0.16 inference(constrained_superposition,[],[f31,f126])).
% 0.08/0.16 thf(f135,plain,(
% 0.08/0.16 (sK1 = ((sK0 @ sK1))) | (~spl3_2 | ~spl3_3 | ~spl3_5)),
% 0.08/0.16 inference(trivial_inequality_removal,[],[f134])).
% 0.08/0.16 thf(f143,plain,(
% 0.08/0.16 (sK1 != sK1) | (~spl3_2 | ~spl3_3 | ~spl3_5 | ~spl3_6)),
% 0.08/0.16 inference(constrained_superposition,[],[f119,f135])).
% 0.08/0.16 thf(f144,plain,(
% 0.08/0.16 $false | (~spl3_2 | ~spl3_3 | ~spl3_5 | ~spl3_6)),
% 0.08/0.16 inference(trivial_inequality_removal,[],[f143])).
% 0.08/0.16 thf(f145,plain,(
% 0.08/0.16 ~spl3_2 | ~spl3_3 | ~spl3_5 | ~spl3_6),
% 0.08/0.16 inference(avatar_contradiction_clause,[],[f144])).
% 0.08/0.16 thf(f159,plain,(
% 0.08/0.16 ($true = $false) | (sK2 = ((sK0 @ sK2))) | (~spl3_1 | ~spl3_5)),
% 0.08/0.16 inference(constrained_superposition,[],[f88,f127])).
% 0.08/0.16 thf(f160,plain,(
% 0.08/0.16 (sK2 = ((sK0 @ sK2))) | (~spl3_1 | ~spl3_5)),
% 0.08/0.16 inference(trivial_inequality_removal,[],[f159])).
% 0.08/0.16 thf(f165,plain,(
% 0.08/0.16 (sK2 != sK2) | (~spl3_1 | ~spl3_5 | ~spl3_6)),
% 0.08/0.16 inference(constrained_superposition,[],[f120,f160])).
% 0.08/0.16 thf(f166,plain,(
% 0.08/0.16 $false | (~spl3_1 | ~spl3_5 | ~spl3_6)),
% 0.08/0.16 inference(trivial_inequality_removal,[],[f165])).
% 0.08/0.16 thf(f167,plain,(
% 0.08/0.16 ~spl3_1 | ~spl3_5 | ~spl3_6),
% 0.08/0.16 inference(avatar_contradiction_clause,[],[f166])).
% 0.08/0.16 cnf(s1, plain, spl3_1 | spl3_2, inference(sat_conversion,[],[f28])).
% 0.08/0.16 cnf(s2, plain, spl3_1 | spl3_3, inference(sat_conversion,[],[f32])).
% 0.08/0.16 cnf(s3, plain, spl3_4 | spl3_5, inference(sat_conversion,[],[f39])).
% 0.08/0.16 cnf(s4, plain, spl3_4 | spl3_6, inference(sat_conversion,[],[f43])).
% 0.08/0.16 cnf(s6, plain, ~spl3_2 | ~spl3_3 | ~spl3_4, inference(sat_conversion,[],[f65])).
% 0.08/0.16 cnf(s8, plain, ~spl3_1 | ~spl3_4, inference(sat_conversion,[],[f85])).
% 0.08/0.16 cnf(s10, plain, ~spl3_2 | ~spl3_3 | ~spl3_5 | ~spl3_6, inference(sat_conversion,[],[f145])).
% 0.08/0.16 cnf(s12, plain, ~spl3_1 | ~spl3_5 | ~spl3_6, inference(sat_conversion,[],[f167])).
% 0.08/0.16 cnf(s13, plain, ~spl3_2 | ~spl3_3, inference(rat,[],[s10,s3,s4,s6])).
% 0.08/0.16 cnf(s14, plain, spl3_1, inference(rat,[],[s13,s1,s2])).
% 0.08/0.16 cnf(s15, plain, ~spl3_4, inference(rat,[],[s8,s14])).
% 0.08/0.16 cnf(s16, plain, spl3_6, inference(rat,[],[s4,s15])).
% 0.08/0.16 cnf(s17, plain, spl3_5, inference(rat,[],[s3,s15])).
% 0.08/0.16 cnf(s18, plain, $false, inference(rat,[],[s12,s14,s16,s17])).
% 0.08/0.16 thf(f168,plain,(
% 0.08/0.16 $false),
% 0.08/0.16 inference(avatar_sat_refutation,[],[s18])).
% 0.08/0.16 % SZS output end Proof for theBenchmark
% 0.08/0.16 % (271499)------------------------------
% 0.08/0.16 % (271499)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.16 % (271499)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.16 % (271499)CaDiCaL version: 2.1.3
% 0.08/0.16 % (271499)Termination reason: Refutation
% 0.08/0.16 % (271499)Time elapsed: 0.004 s
% 0.08/0.16 % (271499)Peak memory usage: 13 MB
% 0.08/0.16 % (271499)Instructions burned: 9 (million)
% 0.08/0.16 % (271488)Success in time 0.032 s
% 0.08/0.16 % Vampire exiting
%------------------------------------------------------------------------------