%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV231^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:04 AM UTC 2026
% Result : Theorem 0.22s 0.29s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV231^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n002.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 15:26:07 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.09/0.24 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.22/0.29 % (1426991)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.29 % (1426996)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3514156276:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.22/0.29 % (1427001)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=558825434:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.22/0.29 % (1426997)lrs+10_16_si=on:nwc=1.5:random_seed=1790789545:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.22/0.29 % (1426999)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=2205478435: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.29 % (1427000)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=770390590:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.22/0.29 % (1426999) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1426991-1426999"...
% 0.22/0.29 % (1426996) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1426991-1426996"...
% 0.22/0.29 % (1427000) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1426991-1427000"...
% 0.22/0.29 % (1426999)...printing done.
% 0.22/0.29 % (1426996)...printing done.
% 0.22/0.29 % (1426999)Refutation found. Thanks to Tanya!
% 0.22/0.29 % SZS status Theorem for theBenchmark
% 0.22/0.29 % SZS output start Proof for theBenchmark
% 0.22/0.29 thf(type_def_5, type, a: $tType).
% 0.22/0.29 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.22/0.29 thf(func_def_0, type, y: (a > $o)).
% 0.22/0.29 thf(func_def_1, type, x: (a > $o)).
% 0.22/0.29 thf(func_def_3, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.22/0.29 thf(func_def_4, type, vIMP: ($o > $o > $o)).
% 0.22/0.29 thf(func_def_5, type, vOR: ($o > $o > $o)).
% 0.22/0.29 thf(func_def_6, type, db0: !>[X0: $tType]:(X0)).
% 0.22/0.29 thf(func_def_7, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.22/0.29 thf(func_def_8, type, db1: !>[X0: $tType]:(X0)).
% 0.22/0.29 thf(func_def_9, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.22/0.29 thf(func_def_10, type, vAND: ($o > $o > $o)).
% 0.22/0.29 thf(func_def_13, type, vNOT: ($o > $o)).
% 0.22/0.29 thf(func_def_15, type, sK1: a).
% 0.22/0.29 thf(func_def_16, type, sK2: (a > $o)).
% 0.22/0.29 thf(f1,conjecture,(
% 0.22/0.29 ((^[X0 : a] : (! [X1 : (a > $o)] : (((X1 = x) | (X1 = y)) => (X1 @ X0)))) = (^[X0 : a] : ((x @ X0) & (y @ X0))))),
% 0.22/0.29 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX5201_pme)).
% 0.22/0.29 thf(f2,negated_conjecture,(
% 0.22/0.29 ~ ((^[X0 : a] : (! [X1 : (a > $o)] : (((X1 = x) | (X1 = y)) => (X1 @ X0)))) = (^[X0 : a] : ((x @ X0) & (y @ X0))))),
% 0.22/0.29 inference(negated_conjecture,[status(cth)],[f1])).
% 0.22/0.29 thf(f3,plain,(
% 0.22/0.29 ~ ((^[X0 : a] : (! [X1 : (a > $o)] : (((X1 = x) | (X1 = y)) => (X1 @ X0)))) = (^[X2 : a] : ((x @ X2) & (y @ X2))))),
% 0.22/0.29 inference(rectify,[],[f2])).
% 0.22/0.29 thf(f4,plain,(
% 0.22/0.29 ~ ((^[Y0 : a]: ((y @ Y0) & (x @ Y0))) = (^[Y0 : a]: (!! @ (a > $o) @ (^[Y1 : a > $o]: (((y = Y1) | (x = Y1)) => (Y1 @ Y0))))))),
% 0.22/0.29 inference(fool_elimination,[],[f3])).
% 0.22/0.29 thf(f5,plain,(
% 0.22/0.29 ((^[Y0 : a]: ((y @ Y0) & (x @ Y0))) != (^[Y0 : a]: (!! @ (a > $o) @ (^[Y1 : a > $o]: (((y = Y1) | (x = Y1)) => (Y1 @ Y0))))))),
% 0.22/0.29 inference(flattening,[],[f4])).
% 0.22/0.29 thf(f6,plain,(
% 0.22/0.29 ((^[Y0 : a]: ((y @ Y0) & (x @ Y0))) != (^[Y0 : a]: (!! @ (a > $o) @ (^[Y1 : a > $o]: (((y = Y1) | (x = Y1)) => (Y1 @ Y0))))))),
% 0.22/0.29 inference(cnf_transformation,[],[f5])).
% 0.22/0.29 thf(f9,definition,(
% 0.22/0.29 spl0_1 <=> ((^[Y0 : a]: ((y @ Y0) & (x @ Y0))) = (^[Y0 : a]: (!! @ (a > $o) @ (^[Y1 : a > $o]: (((y = Y1) | (x = Y1)) => (Y1 @ Y0))))))),
% 0.22/0.29 introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition])).
% 0.22/0.29 thf(f11,plain,(
% 0.22/0.29 ((^[Y0 : a]: ((y @ Y0) & (x @ Y0))) != (^[Y0 : a]: (!! @ (a > $o) @ (^[Y1 : a > $o]: (((y = Y1) | (x = Y1)) => (Y1 @ Y0)))))) | spl0_1),
% 0.22/0.29 inference(avatar_component_clause,[],[f9])).
% 0.22/0.29 thf(f12,plain,(
% 0.22/0.29 ~spl0_1),
% 0.22/0.29 inference(avatar_split_clause,[],[f6,f9])).
% 0.22/0.29 thf(f13,plain,(
% 0.22/0.29 ((((^[Y0 : a]: (!! @ (a > $o) @ (^[Y1 : a > $o]: (((y = Y1) | (x = Y1)) => (Y1 @ Y0))))) @ sK1)) != (((^[Y0 : a]: ((y @ Y0) & (x @ Y0))) @ sK1))) | spl0_1),
% 0.22/0.29 inference(negative_extensionality,[],[f11])).
% 0.22/0.29 thf(f14,plain,(
% 0.22/0.29 ((((^[Y0 : a]: (!! @ (a > $o) @ (^[Y1 : a > $o]: (((y = Y1) | (x = Y1)) => (Y1 @ Y0))))) @ sK1)) = $true) | ($true = (((^[Y0 : a]: ((y @ Y0) & (x @ Y0))) @ sK1))) | spl0_1),
% 0.22/0.29 inference(xor_proxy_clausification,[],[f13])).
% 0.22/0.29 thf(f15,plain,(
% 0.22/0.29 ((((^[Y0 : a]: (!! @ (a > $o) @ (^[Y1 : a > $o]: (((y = Y1) | (x = Y1)) => (Y1 @ Y0))))) @ sK1)) = $false) | ($false = (((^[Y0 : a]: ((y @ Y0) & (x @ Y0))) @ sK1))) | spl0_1),
% 0.22/0.29 inference(xor_proxy_clausification,[],[f13])).
% 0.22/0.29 thf(f16,plain,(
% 0.22/0.29 (((!! @ (a > $o) @ (^[Y0 : a > $o]: (((y = Y0) | (x = Y0)) => (Y0 @ sK1))))) = $false) | ((((y @ sK1) & (x @ sK1))) = $false) | spl0_1),
% 0.22/0.29 inference(beta-eta_normalization,[],[f15])).
% 0.22/0.29 thf(f17,plain,(
% 0.22/0.29 ((((^[Y0 : a > $o]: (((y = Y0) | (x = Y0)) => (Y0 @ sK1))) @ sK2)) = $false) | ((((y @ sK1) & (x @ sK1))) = $false) | spl0_1),
% 0.22/0.29 inference(sigma_proxy_clausification,[],[f16])).
% 0.22/0.29 thf(f18,plain,(
% 0.22/0.29 ((((^[Y0 : a > $o]: (((y = Y0) | (x = Y0)) => (Y0 @ sK1))) @ sK2)) = $false) | (((x @ sK1)) = $false) | (((y @ sK1)) = $false) | spl0_1),
% 0.22/0.29 inference(and_proxy_clausification,[],[f17])).
% 0.22/0.29 thf(f19,plain,(
% 0.22/0.29 (((y @ sK1)) = $false) | (((((y = sK2) | (x = sK2)) => (sK2 @ sK1))) = $false) | (((x @ sK1)) = $false) | spl0_1),
% 0.22/0.29 inference(beta-eta_normalization,[],[f18])).
% 0.22/0.29 thf(f20,plain,(
% 0.22/0.29 (((sK2 @ sK1)) = $false) | (((y @ sK1)) = $false) | (((x @ sK1)) = $false) | spl0_1),
% 0.22/0.29 inference(imp_proxy_clausification,[],[f19])).
% 0.22/0.29 thf(f21,plain,(
% 0.22/0.29 ($true = (((y = sK2) | (x = sK2)))) | (((y @ sK1)) = $false) | (((x @ sK1)) = $false) | spl0_1),
% 0.22/0.29 inference(imp_proxy_clausification,[],[f19])).
% 0.22/0.29 thf(f22,plain,(
% 0.22/0.29 ($true = ((x = sK2))) | (((y @ sK1)) = $false) | ($true = ((y = sK2))) | (((x @ sK1)) = $false) | spl0_1),
% 0.22/0.29 inference(or_proxy_clausification,[],[f21])).
% 0.22/0.29 thf(f23,plain,(
% 0.22/0.29 (((x @ sK1)) = $false) | ($true = ((y = sK2))) | (((y @ sK1)) = $false) | (x = sK2) | spl0_1),
% 0.22/0.29 inference(equality_proxy_clausification,[],[f22])).
% 0.22/0.29 thf(f24,plain,(
% 0.22/0.29 (y = sK2) | (((x @ sK1)) = $false) | (x = sK2) | (((y @ sK1)) = $false) | spl0_1),
% 0.22/0.29 inference(equality_proxy_clausification,[],[f23])).
% 0.22/0.29 thf(f25,plain,(
% 0.22/0.29 ($true = ((!! @ (a > $o) @ (^[Y0 : a > $o]: (((y = Y0) | (x = Y0)) => (Y0 @ sK1)))))) | ($true = (((y @ sK1) & (x @ sK1)))) | spl0_1),
% 0.22/0.29 inference(beta-eta_normalization,[],[f14])).
% 0.22/0.29 thf(f26,plain,(
% 0.22/0.29 ( ! [X1 : (a > $o)] : (($true = (((y @ sK1) & (x @ sK1)))) | ($true = (((^[Y0 : a > $o]: (((y = Y0) | (x = Y0)) => (Y0 @ sK1))) @ X1)))) ) | spl0_1),
% 0.22/0.29 inference(pi_proxy_clausification,[],[f25])).
% 0.22/0.29 thf(f27,plain,(
% 0.22/0.29 ( ! [X1 : (a > $o)] : (($true = ((x @ sK1))) | ($true = (((^[Y0 : a > $o]: (((y = Y0) | (x = Y0)) => (Y0 @ sK1))) @ X1)))) ) | spl0_1),
% 0.22/0.29 inference(and_proxy_clausification,[],[f26])).
% 0.22/0.29 thf(f28,plain,(
% 0.22/0.29 ( ! [X1 : (a > $o)] : (($true = (((^[Y0 : a > $o]: (((y = Y0) | (x = Y0)) => (Y0 @ sK1))) @ X1))) | (((y @ sK1)) = $true)) ) | spl0_1),
% 0.22/0.29 inference(and_proxy_clausification,[],[f26])).
% 0.22/0.29 thf(f29,plain,(
% 0.22/0.29 ( ! [X1 : (a > $o)] : ((((y @ sK1)) = $true) | (((((y = X1) | (x = X1)) => (X1 @ sK1))) = $true)) ) | spl0_1),
% 0.22/0.29 inference(beta-eta_normalization,[],[f28])).
% 0.22/0.29 thf(f30,plain,(
% 0.22/0.29 ( ! [X1 : (a > $o)] : (((((y = X1) | (x = X1))) = $false) | (((y @ sK1)) = $true) | (((X1 @ sK1)) = $true)) ) | spl0_1),
% 0.22/0.29 inference(imp_proxy_clausification,[],[f29])).
% 0.22/0.29 thf(f32,plain,(
% 0.22/0.29 ( ! [X1 : (a > $o)] : ((((X1 @ sK1)) = $true) | (((y = X1)) = $false) | (((y @ sK1)) = $true)) ) | spl0_1),
% 0.22/0.29 inference(or_proxy_clausification,[],[f30])).
% 0.22/0.29 thf(f33,plain,(
% 0.22/0.29 ( ! [X1 : (a > $o)] : ((((y @ sK1)) = $true) | (((X1 @ sK1)) = $true) | (y != X1)) ) | spl0_1),
% 0.22/0.29 inference(equality_proxy_clausification,[],[f32])).
% 0.22/0.29 thf(f35,plain,(
% 0.22/0.29 ( ! [X1 : (a > $o)] : ((((((y = X1) | (x = X1)) => (X1 @ sK1))) = $true) | ($true = ((x @ sK1)))) ) | spl0_1),
% 0.22/0.29 inference(beta-eta_normalization,[],[f27])).
% 0.22/0.29 thf(f36,plain,(
% 0.22/0.29 ( ! [X1 : (a > $o)] : (($true = ((x @ sK1))) | ((((y = X1) | (x = X1))) = $false) | (((X1 @ sK1)) = $true)) ) | spl0_1),
% 0.22/0.29 inference(imp_proxy_clausification,[],[f35])).
% 0.22/0.29 thf(f37,plain,(
% 0.22/0.29 ( ! [X1 : (a > $o)] : ((((x = X1)) = $false) | (((X1 @ sK1)) = $true) | ($true = ((x @ sK1)))) ) | spl0_1),
% 0.22/0.29 inference(or_proxy_clausification,[],[f36])).
% 0.22/0.29 thf(f38,plain,(
% 0.22/0.29 ( ! [X1 : (a > $o)] : (($true = ((x @ sK1))) | (((y = X1)) = $false) | (((X1 @ sK1)) = $true)) ) | spl0_1),
% 0.22/0.29 inference(or_proxy_clausification,[],[f36])).
% 0.22/0.29 thf(f39,plain,(
% 0.22/0.29 ( ! [X1 : (a > $o)] : ((((X1 @ sK1)) = $true) | ($true = ((x @ sK1))) | (y != X1)) ) | spl0_1),
% 0.22/0.29 inference(equality_proxy_clausification,[],[f38])).
% 0.22/0.29 thf(f40,plain,(
% 0.22/0.29 ( ! [X1 : (a > $o)] : (($true = ((x @ sK1))) | (((X1 @ sK1)) = $true) | (x != X1)) ) | spl0_1),
% 0.22/0.29 inference(equality_proxy_clausification,[],[f37])).
% 0.22/0.29 thf(f42,definition,(
% 0.22/0.29 spl0_2 <=> (x = sK2)),
% 0.22/0.29 introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition])).
% 0.22/0.29 thf(f46,definition,(
% 0.22/0.29 spl0_3 <=> (((x @ sK1)) = $false)),
% 0.22/0.29 introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition])).
% 0.22/0.29 thf(f48,plain,(
% 0.22/0.29 (((x @ sK1)) = $false) | ~spl0_3),
% 0.22/0.29 inference(avatar_component_clause,[],[f46])).
% 0.22/0.29 thf(f50,definition,(
% 0.22/0.29 spl0_4 <=> (y = sK2)),
% 0.22/0.29 introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition])).
% 0.22/0.29 thf(f54,definition,(
% 0.22/0.29 spl0_5 <=> (((y @ sK1)) = $false)),
% 0.22/0.29 introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition])).
% 0.22/0.29 thf(f56,plain,(
% 0.22/0.29 (((y @ sK1)) = $false) | ~spl0_5),
% 0.22/0.29 inference(avatar_component_clause,[],[f54])).
% 0.22/0.29 thf(f57,plain,(
% 0.22/0.29 spl0_2 | spl0_3 | spl0_4 | spl0_5 | spl0_1),
% 0.22/0.29 inference(avatar_split_clause,[],[f24,f9,f54,f50,f46,f42])).
% 0.22/0.29 thf(f59,definition,(
% 0.22/0.29 spl0_6 <=> (((sK2 @ sK1)) = $false)),
% 0.22/0.29 introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition])).
% 0.22/0.29 thf(f62,plain,(
% 0.22/0.29 spl0_6 | spl0_5 | spl0_3 | spl0_1),
% 0.22/0.29 inference(avatar_split_clause,[],[f20,f9,f46,f54,f59])).
% 0.22/0.29 thf(f64,definition,(
% 0.22/0.29 spl0_7 <=> ! [X1 : (a > $o)] : ((((X1 @ sK1)) = $true) | (y != X1))),
% 0.22/0.29 introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition])).
% 0.22/0.29 thf(f65,plain,(
% 0.22/0.29 ( ! [X1 : (a > $o)] : ((((X1 @ sK1)) = $true) | (y != X1)) ) | ~spl0_7),
% 0.22/0.29 inference(avatar_component_clause,[],[f64])).
% 0.22/0.29 thf(f67,definition,(
% 0.22/0.29 spl0_8 <=> (((y @ sK1)) = $true)),
% 0.22/0.29 introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition])).
% 0.22/0.29 thf(f70,plain,(
% 0.22/0.29 spl0_7 | spl0_8 | spl0_1),
% 0.22/0.29 inference(avatar_split_clause,[],[f33,f9,f67,f64])).
% 0.22/0.29 thf(f72,definition,(
% 0.22/0.29 spl0_9 <=> ! [X1 : (a > $o)] : ((((X1 @ sK1)) = $true) | (x != X1))),
% 0.22/0.29 introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition])).
% 0.22/0.29 thf(f73,plain,(
% 0.22/0.29 ( ! [X1 : (a > $o)] : ((((X1 @ sK1)) = $true) | (x != X1)) ) | ~spl0_9),
% 0.22/0.29 inference(avatar_component_clause,[],[f72])).
% 0.22/0.29 thf(f76,definition,(
% 0.22/0.29 spl0_10 <=> ($true = ((x @ sK1)))),
% 0.22/0.29 introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition])).
% 0.22/0.29 thf(f78,plain,(
% 0.22/0.29 ($true = ((x @ sK1))) | ~spl0_10),
% 0.22/0.29 inference(avatar_component_clause,[],[f76])).
% 0.22/0.29 thf(f79,plain,(
% 0.22/0.29 spl0_7 | spl0_10 | spl0_1),
% 0.22/0.29 inference(avatar_split_clause,[],[f39,f9,f76,f64])).
% 0.22/0.29 thf(f80,plain,(
% 0.22/0.29 spl0_9 | spl0_10 | spl0_1),
% 0.22/0.29 inference(avatar_split_clause,[],[f40,f9,f76,f72])).
% 0.22/0.29 thf(f106,plain,(
% 0.22/0.29 (x != x) | ($true = $false) | (~spl0_3 | ~spl0_9)),
% 0.22/0.29 inference(superposition,[],[f73,f48])).
% 0.22/0.29 thf(f115,plain,(
% 0.22/0.29 $false | (~spl0_3 | ~spl0_9)),
% 0.22/0.29 inference(trivial_inequality_removal,[],[f106])).
% 0.22/0.29 thf(f116,plain,(
% 0.22/0.29 ~spl0_3 | ~spl0_9),
% 0.22/0.29 inference(avatar_contradiction_clause,[],[f115])).
% 0.22/0.29 thf(f122,plain,(
% 0.22/0.29 ($true = $false) | (~spl0_3 | ~spl0_10)),
% 0.22/0.29 inference(forward_demodulation,[],[f78,f48])).
% 0.22/0.29 thf(f123,plain,(
% 0.22/0.29 $false | (~spl0_3 | ~spl0_10)),
% 0.22/0.29 inference(trivial_inequality_removal,[],[f122])).
% 0.22/0.29 thf(f124,plain,(
% 0.22/0.29 ~spl0_3 | ~spl0_10),
% 0.22/0.29 inference(avatar_contradiction_clause,[],[f123])).
% 0.22/0.29 thf(f126,plain,(
% 0.22/0.29 ($true = $false) | (y != y) | (~spl0_5 | ~spl0_7)),
% 0.22/0.29 inference(superposition,[],[f65,f56])).
% 0.22/0.29 thf(f129,plain,(
% 0.22/0.29 $false | (~spl0_5 | ~spl0_7)),
% 0.22/0.29 inference(trivial_inequality_removal,[],[f126])).
% 0.22/0.29 thf(f130,plain,(
% 0.22/0.29 ~spl0_5 | ~spl0_7),
% 0.22/0.29 inference(avatar_contradiction_clause,[],[f129])).
% 0.22/0.29 thf(f131,definition,(
% 0.22/0.29 (y != sK2) | (((sK2 @ sK1)) != $false) | (((y @ sK1)) = $false)),
% 0.22/0.29 introduced(theory,[theory_tautology_sat_conflict])).
% 0.22/0.29 thf(f132,definition,(
% 0.22/0.29 (x != sK2) | (((sK2 @ sK1)) != $false) | (((x @ sK1)) = $false)),
% 0.22/0.29 introduced(theory,[theory_tautology_sat_conflict])).
% 0.22/0.29 thf(f133,definition,(
% 0.22/0.29 ($true != ((x @ sK1))) | (((y @ sK1)) != $true) | (((y @ sK1)) != $false) | (((x @ sK1)) = $false)),
% 0.22/0.29 introduced(theory,[theory_tautology_sat_conflict])).
% 0.22/0.29 cnf(s1, plain, ~spl0_1, inference(sat_conversion,[],[f12])).
% 0.22/0.29 cnf(s2, plain, spl0_1 | spl0_2 | spl0_3 | spl0_4 | spl0_5, inference(sat_conversion,[],[f57])).
% 0.22/0.29 cnf(s3, plain, spl0_1 | spl0_3 | spl0_5 | spl0_6, inference(sat_conversion,[],[f62])).
% 0.22/0.29 cnf(s4, plain, spl0_1 | spl0_7 | spl0_8, inference(sat_conversion,[],[f70])).
% 0.22/0.29 cnf(s6, plain, spl0_1 | spl0_7 | spl0_10, inference(sat_conversion,[],[f79])).
% 0.22/0.29 cnf(s7, plain, spl0_1 | spl0_9 | spl0_10, inference(sat_conversion,[],[f80])).
% 0.22/0.29 cnf(s12, plain, ~spl0_3 | ~spl0_9, inference(sat_conversion,[],[f116])).
% 0.22/0.29 cnf(s14, plain, ~spl0_3 | ~spl0_10, inference(sat_conversion,[],[f124])).
% 0.22/0.29 cnf(s16, plain, ~spl0_5 | ~spl0_7, inference(sat_conversion,[],[f130])).
% 0.22/0.29 cnf(s17, plain, ~spl0_4 | spl0_5 | ~spl0_6, inference(sat_conversion,[],[f131])).
% 0.22/0.29 cnf(s18, plain, ~spl0_2 | spl0_3 | ~spl0_6, inference(sat_conversion,[],[f132])).
% 0.22/0.29 cnf(s19, plain, spl0_3 | ~spl0_5 | ~spl0_8 | ~spl0_10, inference(sat_conversion,[],[f133])).
% 0.22/0.29 cnf(s20, plain, ~spl0_5 | spl0_3, inference(rat,[],[s19,s4,s6,s16,s1])).
% 0.22/0.29 cnf(s21, plain, spl0_3 | spl0_2, inference(rat,[],[s17,s2,s3,s20,s1])).
% 0.22/0.29 cnf(s22, plain, ~spl0_3, inference(rat,[],[s7,s12,s14,s1])).
% 0.22/0.29 cnf(s23, plain, ~spl0_5, inference(rat,[],[s20,s22])).
% 0.22/0.29 cnf(s24, plain, spl0_2, inference(rat,[],[s21,s22])).
% 0.22/0.29 cnf(s25, plain, spl0_6, inference(rat,[],[s3,s22,s1,s23])).
% 0.22/0.29 cnf(s26, plain, $false, inference(rat,[],[s18,s22,s24,s25])).
% 0.22/0.29 thf(f134,plain,(
% 0.22/0.29 $false),
% 0.22/0.29 inference(avatar_sat_refutation,[],[s26])).
% 0.22/0.29 % SZS output end Proof for theBenchmark
% 0.22/0.29 % (1426999)------------------------------
% 0.22/0.29 % (1426999)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29 % (1426999)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29 % (1426999)CaDiCaL version: 2.1.3
% 0.22/0.29 % (1426999)Termination reason: Refutation
% 0.22/0.29 % (1426999)Time elapsed: 0.005 s
% 0.22/0.29 % (1426999)Peak memory usage: 13 MB
% 0.22/0.29 % (1426999)Instructions burned: 6 (million)
% 0.22/0.29 % (1426991)Success in time 0.038 s
% 0.22/0.29 % Vampire exiting
%------------------------------------------------------------------------------