%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV227^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 : n007.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.23s 0.30s
% Output : Refutation 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV227^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.20 % Computer : n007.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Sep 29 15:20:56 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.24 Running higher-order theorem proving
% 0.09/0.25 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.23/0.30 % (3499665)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.23/0.30 % (3499676)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.23/0.30 % (3499676)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.23/0.30 % (3499672)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1361327697:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.23/0.30 % (3499671)lrs+10_16_si=on:nwc=1.5:random_seed=3912097043:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.23/0.30 % (3499670)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=602371499:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.23/0.30 % (3499673)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=1523198961: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.23/0.30 % (3499676)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=4098289469:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.23/0.30 % (3499675)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1258684561:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.23/0.30 % (3499672)Refutation not found, incomplete strategy
% 0.23/0.30 % (3499672)------------------------------
% 0.23/0.30 % (3499672)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.30 % (3499672)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.30 % (3499672)CaDiCaL version: 2.1.3
% 0.23/0.30 % (3499672)Termination reason: Refutation not found, incomplete strategy
% 0.23/0.30 % (3499672)Time elapsed: 0.001 s
% 0.23/0.30 % (3499672)Peak memory usage: 12 MB
% 0.23/0.30 % (3499672)------------------------------
% 0.23/0.30 % (3499672)------------------------------
% 0.23/0.30 % (3499673) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3499665-3499673"...
% 0.23/0.30 % (3499670) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3499665-3499670"...
% 0.23/0.30 % (3499676) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3499665-3499676"...
% 0.23/0.30 % (3499673)...printing done.
% 0.23/0.30 % (3499670)...printing done.
% 0.23/0.30 % (3499673)Refutation found. Thanks to Tanya!
% 0.23/0.30 % SZS status Theorem for theBenchmark
% 0.23/0.30 % SZS output start Proof for theBenchmark
% 0.23/0.30 thf(type_def_5, type, a: $tType).
% 0.23/0.30 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.23/0.30 thf(func_def_0, type, y: (a > $o)).
% 0.23/0.30 thf(func_def_1, type, x: (a > $o)).
% 0.23/0.30 thf(func_def_3, type, vOR: ($o > $o > $o)).
% 0.23/0.30 thf(func_def_4, type, db0: !>[X0: $tType]:(X0)).
% 0.23/0.30 thf(func_def_5, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.23/0.30 thf(func_def_6, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.23/0.30 thf(func_def_7, type, vAND: ($o > $o > $o)).
% 0.23/0.30 thf(func_def_8, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.23/0.30 thf(func_def_9, type, db1: !>[X0: $tType]:(X0)).
% 0.23/0.30 thf(func_def_12, type, vNOT: ($o > $o)).
% 0.23/0.30 thf(func_def_14, type, sK1: a).
% 0.23/0.30 thf(func_def_15, type, sK2: (a > $o)).
% 0.23/0.30 thf(f1,conjecture,(
% 0.23/0.30 ((^[X0 : a] : ((x @ X0) | (y @ X0))) = (^[X1 : a] : (? [X2 : (a > $o)] : ((X2 @ X1) & ((X2 = y) | (X2 = x))))))),
% 0.23/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX5200_pme)).
% 0.23/0.30 thf(f2,negated_conjecture,(
% 0.23/0.30 ~ ((^[X0 : a] : ((x @ X0) | (y @ X0))) = (^[X1 : a] : (? [X2 : (a > $o)] : ((X2 @ X1) & ((X2 = y) | (X2 = x))))))),
% 0.23/0.30 inference(negated_conjecture,[status(cth)],[f1])).
% 0.23/0.30 thf(f3,plain,(
% 0.23/0.30 ~ ((^[X0 : a] : ((x @ X0) | (y @ X0))) = (^[X1 : a] : (? [X2 : (a > $o)] : ((X2 @ X1) & ((X2 = y) | (X2 = x))))))),
% 0.23/0.30 inference(rectify,[],[f2])).
% 0.23/0.30 thf(f4,plain,(
% 0.23/0.30 ~ ((^[Y0 : a]: (?? @ (a > $o) @ (^[Y1 : a > $o]: (((x = Y1) | (y = Y1)) & (Y1 @ Y0))))) = (^[Y0 : a]: ((y @ Y0) | (x @ Y0))))),
% 0.23/0.30 inference(fool_elimination,[],[f3])).
% 0.23/0.30 thf(f5,plain,(
% 0.23/0.30 ((^[Y0 : a]: (?? @ (a > $o) @ (^[Y1 : a > $o]: (((x = Y1) | (y = Y1)) & (Y1 @ Y0))))) != (^[Y0 : a]: ((y @ Y0) | (x @ Y0))))),
% 0.23/0.31 inference(flattening,[],[f4])).
% 0.23/0.31 thf(f6,plain,(
% 0.23/0.31 ((^[Y0 : a]: (?? @ (a > $o) @ (^[Y1 : a > $o]: (((x = Y1) | (y = Y1)) & (Y1 @ Y0))))) != (^[Y0 : a]: ((y @ Y0) | (x @ Y0))))),
% 0.23/0.31 inference(cnf_transformation,[],[f5])).
% 0.23/0.31 thf(f9,definition,(
% 0.23/0.31 spl0_1 <=> ((^[Y0 : a]: (?? @ (a > $o) @ (^[Y1 : a > $o]: (((x = Y1) | (y = Y1)) & (Y1 @ Y0))))) = (^[Y0 : a]: ((y @ Y0) | (x @ Y0))))),
% 0.23/0.31 introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition])).
% 0.23/0.31 thf(f11,plain,(
% 0.23/0.31 ((^[Y0 : a]: (?? @ (a > $o) @ (^[Y1 : a > $o]: (((x = Y1) | (y = Y1)) & (Y1 @ Y0))))) != (^[Y0 : a]: ((y @ Y0) | (x @ Y0)))) | spl0_1),
% 0.23/0.31 inference(avatar_component_clause,[],[f9])).
% 0.23/0.31 thf(f12,plain,(
% 0.23/0.31 ~spl0_1),
% 0.23/0.31 inference(avatar_split_clause,[],[f6,f9])).
% 0.23/0.31 thf(f13,plain,(
% 0.23/0.31 ((((^[Y0 : a]: (?? @ (a > $o) @ (^[Y1 : a > $o]: (((x = Y1) | (y = Y1)) & (Y1 @ Y0))))) @ sK1)) != (((^[Y0 : a]: ((y @ Y0) | (x @ Y0))) @ sK1))) | spl0_1),
% 0.23/0.31 inference(negative_extensionality,[],[f11])).
% 0.23/0.31 thf(f14,plain,(
% 0.23/0.31 ($true = (((^[Y0 : a]: (?? @ (a > $o) @ (^[Y1 : a > $o]: (((x = Y1) | (y = Y1)) & (Y1 @ Y0))))) @ sK1))) | ($true = (((^[Y0 : a]: ((y @ Y0) | (x @ Y0))) @ sK1))) | spl0_1),
% 0.23/0.31 inference(xor_proxy_clausification,[],[f13])).
% 0.23/0.31 thf(f15,plain,(
% 0.23/0.31 ($false = (((^[Y0 : a]: ((y @ Y0) | (x @ Y0))) @ sK1))) | ($false = (((^[Y0 : a]: (?? @ (a > $o) @ (^[Y1 : a > $o]: (((x = Y1) | (y = Y1)) & (Y1 @ Y0))))) @ sK1))) | spl0_1),
% 0.23/0.31 inference(xor_proxy_clausification,[],[f13])).
% 0.23/0.31 thf(f16,plain,(
% 0.23/0.31 ($false = ((?? @ (a > $o) @ (^[Y0 : a > $o]: (((x = Y0) | (y = Y0)) & (Y0 @ sK1)))))) | ($false = (((y @ sK1) | (x @ sK1)))) | spl0_1),
% 0.23/0.31 inference(beta-eta_normalization,[],[f15])).
% 0.23/0.31 thf(f17,plain,(
% 0.23/0.31 ( ! [X1 : (a > $o)] : (($false = (((y @ sK1) | (x @ sK1)))) | ($false = (((^[Y0 : a > $o]: (((x = Y0) | (y = Y0)) & (Y0 @ sK1))) @ X1)))) ) | spl0_1),
% 0.23/0.31 inference(pi_proxy_clausification,[],[f16])).
% 0.23/0.31 thf(f18,plain,(
% 0.23/0.31 ( ! [X1 : (a > $o)] : (($false = ((x @ sK1))) | ($false = (((^[Y0 : a > $o]: (((x = Y0) | (y = Y0)) & (Y0 @ sK1))) @ X1)))) ) | spl0_1),
% 0.23/0.31 inference(or_proxy_clausification,[],[f17])).
% 0.23/0.31 thf(f19,plain,(
% 0.23/0.31 ( ! [X1 : (a > $o)] : (($false = (((^[Y0 : a > $o]: (((x = Y0) | (y = Y0)) & (Y0 @ sK1))) @ X1))) | ($false = ((y @ sK1)))) ) | spl0_1),
% 0.23/0.31 inference(or_proxy_clausification,[],[f17])).
% 0.23/0.31 thf(f20,plain,(
% 0.23/0.31 ( ! [X1 : (a > $o)] : (($false = ((((x = X1) | (y = X1)) & (X1 @ sK1)))) | ($false = ((y @ sK1)))) ) | spl0_1),
% 0.23/0.31 inference(beta-eta_normalization,[],[f19])).
% 0.23/0.31 thf(f21,plain,(
% 0.23/0.31 ( ! [X1 : (a > $o)] : (($false = ((X1 @ sK1))) | ($false = ((y @ sK1))) | ($false = (((x = X1) | (y = X1))))) ) | spl0_1),
% 0.23/0.31 inference(and_proxy_clausification,[],[f20])).
% 0.23/0.31 thf(f22,plain,(
% 0.23/0.31 ( ! [X1 : (a > $o)] : ((((y = X1)) = $false) | ($false = ((X1 @ sK1))) | ($false = ((y @ sK1)))) ) | spl0_1),
% 0.23/0.31 inference(or_proxy_clausification,[],[f21])).
% 0.23/0.31 thf(f23,plain,(
% 0.23/0.31 ( ! [X1 : (a > $o)] : (($false = ((X1 @ sK1))) | ($false = ((y @ sK1))) | ($false = ((x = X1)))) ) | spl0_1),
% 0.23/0.31 inference(or_proxy_clausification,[],[f21])).
% 0.23/0.31 thf(f24,plain,(
% 0.23/0.31 ( ! [X1 : (a > $o)] : (($false = ((X1 @ sK1))) | ($false = ((y @ sK1))) | (x != X1)) ) | spl0_1),
% 0.23/0.31 inference(equality_proxy_clausification,[],[f23])).
% 0.23/0.31 thf(f25,plain,(
% 0.23/0.31 ( ! [X1 : (a > $o)] : (($false = ((y @ sK1))) | (y != X1) | ($false = ((X1 @ sK1)))) ) | spl0_1),
% 0.23/0.31 inference(equality_proxy_clausification,[],[f22])).
% 0.23/0.31 thf(f26,plain,(
% 0.23/0.31 ( ! [X1 : (a > $o)] : (($false = ((((x = X1) | (y = X1)) & (X1 @ sK1)))) | ($false = ((x @ sK1)))) ) | spl0_1),
% 0.23/0.31 inference(beta-eta_normalization,[],[f18])).
% 0.23/0.31 thf(f27,plain,(
% 0.23/0.31 ( ! [X1 : (a > $o)] : (($false = ((x @ sK1))) | ($false = ((X1 @ sK1))) | ($false = (((x = X1) | (y = X1))))) ) | spl0_1),
% 0.23/0.31 inference(and_proxy_clausification,[],[f26])).
% 0.23/0.31 thf(f29,plain,(
% 0.23/0.31 ( ! [X1 : (a > $o)] : (($false = ((X1 @ sK1))) | ($false = ((x = X1))) | ($false = ((x @ sK1)))) ) | spl0_1),
% 0.23/0.31 inference(or_proxy_clausification,[],[f27])).
% 0.23/0.31 thf(f30,plain,(
% 0.23/0.31 ( ! [X1 : (a > $o)] : (($false = ((X1 @ sK1))) | ($false = ((x @ sK1))) | (x != X1)) ) | spl0_1),
% 0.23/0.31 inference(equality_proxy_clausification,[],[f29])).
% 0.23/0.31 thf(f32,plain,(
% 0.23/0.31 ($true = ((?? @ (a > $o) @ (^[Y0 : a > $o]: (((x = Y0) | (y = Y0)) & (Y0 @ sK1)))))) | ($true = (((y @ sK1) | (x @ sK1)))) | spl0_1),
% 0.23/0.31 inference(beta-eta_normalization,[],[f14])).
% 0.23/0.31 thf(f33,plain,(
% 0.23/0.31 ($true = (((^[Y0 : a > $o]: (((x = Y0) | (y = Y0)) & (Y0 @ sK1))) @ sK2))) | ($true = (((y @ sK1) | (x @ sK1)))) | spl0_1),
% 0.23/0.31 inference(sigma_proxy_clausification,[],[f32])).
% 0.23/0.31 thf(f34,plain,(
% 0.23/0.31 ($true = ((y @ sK1))) | ($true = ((x @ sK1))) | ($true = (((^[Y0 : a > $o]: (((x = Y0) | (y = Y0)) & (Y0 @ sK1))) @ sK2))) | spl0_1),
% 0.23/0.31 inference(or_proxy_clausification,[],[f33])).
% 0.23/0.31 thf(f35,plain,(
% 0.23/0.31 ($true = ((y @ sK1))) | ($true = ((x @ sK1))) | ($true = ((((x = sK2) | (y = sK2)) & (sK2 @ sK1)))) | spl0_1),
% 0.23/0.31 inference(beta-eta_normalization,[],[f34])).
% 0.23/0.31 thf(f36,plain,(
% 0.23/0.31 ($true = ((sK2 @ sK1))) | ($true = ((x @ sK1))) | ($true = ((y @ sK1))) | spl0_1),
% 0.23/0.31 inference(and_proxy_clausification,[],[f35])).
% 0.23/0.31 thf(f37,plain,(
% 0.23/0.31 ($true = ((y @ sK1))) | ($true = (((x = sK2) | (y = sK2)))) | ($true = ((x @ sK1))) | spl0_1),
% 0.23/0.31 inference(and_proxy_clausification,[],[f35])).
% 0.23/0.31 thf(f38,plain,(
% 0.23/0.31 ($true = ((x = sK2))) | ($true = ((x @ sK1))) | ($true = ((y @ sK1))) | ($true = ((y = sK2))) | spl0_1),
% 0.23/0.31 inference(or_proxy_clausification,[],[f37])).
% 0.23/0.31 thf(f39,plain,(
% 0.23/0.31 ($true = ((x @ sK1))) | (x = sK2) | ($true = ((y = sK2))) | ($true = ((y @ sK1))) | spl0_1),
% 0.23/0.31 inference(equality_proxy_clausification,[],[f38])).
% 0.23/0.31 thf(f40,plain,(
% 0.23/0.31 ($true = ((y @ sK1))) | (y = sK2) | (x = sK2) | ($true = ((x @ sK1))) | spl0_1),
% 0.23/0.31 inference(equality_proxy_clausification,[],[f39])).
% 0.23/0.31 thf(f42,definition,(
% 0.23/0.31 spl0_2 <=> ($false = ((y @ sK1)))),
% 0.23/0.31 introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition])).
% 0.23/0.31 thf(f44,plain,(
% 0.23/0.31 ($false = ((y @ sK1))) | ~spl0_2),
% 0.23/0.31 inference(avatar_component_clause,[],[f42])).
% 0.23/0.31 thf(f46,definition,(
% 0.23/0.31 spl0_3 <=> ! [X1 : (a > $o)] : (($false = ((X1 @ sK1))) | (x != X1))),
% 0.23/0.31 introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition])).
% 0.23/0.31 thf(f47,plain,(
% 0.23/0.31 ( ! [X1 : (a > $o)] : (($false = ((X1 @ sK1))) | (x != X1)) ) | ~spl0_3),
% 0.23/0.31 inference(avatar_component_clause,[],[f46])).
% 0.23/0.31 thf(f48,plain,(
% 0.23/0.31 spl0_2 | spl0_3 | spl0_1),
% 0.23/0.31 inference(avatar_split_clause,[],[f24,f9,f46,f42])).
% 0.23/0.31 thf(f50,definition,(
% 0.23/0.31 spl0_4 <=> ! [X1 : (a > $o)] : ((y != X1) | ($false = ((X1 @ sK1))))),
% 0.23/0.31 introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition])).
% 0.23/0.31 thf(f51,plain,(
% 0.23/0.31 ( ! [X1 : (a > $o)] : (($false = ((X1 @ sK1))) | (y != X1)) ) | ~spl0_4),
% 0.23/0.31 inference(avatar_component_clause,[],[f50])).
% 0.23/0.31 thf(f52,plain,(
% 0.23/0.31 spl0_2 | spl0_4 | spl0_1),
% 0.23/0.31 inference(avatar_split_clause,[],[f25,f9,f50,f42])).
% 0.23/0.31 thf(f54,definition,(
% 0.23/0.31 spl0_5 <=> ($false = ((x @ sK1)))),
% 0.23/0.31 introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition])).
% 0.23/0.31 thf(f57,plain,(
% 0.23/0.31 spl0_5 | spl0_3 | spl0_1),
% 0.23/0.31 inference(avatar_split_clause,[],[f30,f9,f46,f54])).
% 0.23/0.31 thf(f60,definition,(
% 0.23/0.31 spl0_6 <=> (y = sK2)),
% 0.23/0.31 introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition])).
% 0.23/0.31 thf(f64,definition,(
% 0.23/0.31 spl0_7 <=> ($true = ((y @ sK1)))),
% 0.23/0.31 introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition])).
% 0.23/0.31 thf(f66,plain,(
% 0.23/0.31 ($true = ((y @ sK1))) | ~spl0_7),
% 0.23/0.31 inference(avatar_component_clause,[],[f64])).
% 0.23/0.31 thf(f68,definition,(
% 0.23/0.31 spl0_8 <=> (x = sK2)),
% 0.23/0.31 introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition])).
% 0.23/0.31 thf(f72,definition,(
% 0.23/0.31 spl0_9 <=> ($true = ((x @ sK1)))),
% 0.23/0.31 introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition])).
% 0.23/0.31 thf(f74,plain,(
% 0.23/0.31 ($true = ((x @ sK1))) | ~spl0_9),
% 0.23/0.31 inference(avatar_component_clause,[],[f72])).
% 0.23/0.31 thf(f75,plain,(
% 0.23/0.31 spl0_6 | spl0_7 | spl0_8 | spl0_9 | spl0_1),
% 0.23/0.31 inference(avatar_split_clause,[],[f40,f9,f72,f68,f64,f60])).
% 0.23/0.31 thf(f77,definition,(
% 0.23/0.31 spl0_10 <=> ($true = ((sK2 @ sK1)))),
% 0.23/0.31 introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition])).
% 0.23/0.31 thf(f80,plain,(
% 0.23/0.31 spl0_9 | spl0_10 | spl0_7 | spl0_1),
% 0.23/0.31 inference(avatar_split_clause,[],[f36,f9,f64,f77,f72])).
% 0.23/0.31 thf(f107,plain,(
% 0.23/0.31 ($true = $false) | (y != y) | (~spl0_4 | ~spl0_7)),
% 0.23/0.31 inference(superposition,[],[f66,f51])).
% 0.23/0.31 thf(f115,plain,(
% 0.23/0.31 $false | (~spl0_4 | ~spl0_7)),
% 0.23/0.31 inference(trivial_inequality_removal,[],[f107])).
% 0.23/0.31 thf(f116,plain,(
% 0.23/0.31 ~spl0_4 | ~spl0_7),
% 0.23/0.31 inference(avatar_contradiction_clause,[],[f115])).
% 0.23/0.31 thf(f123,plain,(
% 0.23/0.31 ($true = $false) | (x != x) | (~spl0_3 | ~spl0_9)),
% 0.23/0.31 inference(superposition,[],[f74,f47])).
% 0.23/0.31 thf(f129,plain,(
% 0.23/0.31 $false | (~spl0_3 | ~spl0_9)),
% 0.23/0.31 inference(trivial_inequality_removal,[],[f123])).
% 0.23/0.31 thf(f130,plain,(
% 0.23/0.31 ~spl0_3 | ~spl0_9),
% 0.23/0.31 inference(avatar_contradiction_clause,[],[f129])).
% 0.23/0.31 thf(f133,definition,(
% 0.23/0.31 ($true != ((x @ sK1))) | ($false != ((x @ sK1))) | ($false != ((y @ sK1))) | ($true = ((y @ sK1)))),
% 0.23/0.31 introduced(theory,[theory_tautology_sat_conflict])).
% 0.23/0.31 thf(f134,definition,(
% 0.23/0.31 (x != sK2) | ($true != ((sK2 @ sK1))) | ($true = ((x @ sK1)))),
% 0.23/0.31 introduced(theory,[theory_tautology_sat_conflict])).
% 0.23/0.31 thf(f135,definition,(
% 0.23/0.31 (y != sK2) | ($true != ((sK2 @ sK1))) | ($true = ((y @ sK1)))),
% 0.23/0.31 introduced(theory,[theory_tautology_sat_conflict])).
% 0.23/0.31 thf(f137,plain,(
% 0.23/0.31 ($true = $false) | (~spl0_2 | ~spl0_7)),
% 0.23/0.31 inference(superposition,[],[f44,f66])).
% 0.23/0.31 thf(f141,plain,(
% 0.23/0.31 $false | (~spl0_2 | ~spl0_7)),
% 0.23/0.31 inference(trivial_inequality_removal,[],[f137])).
% 0.23/0.31 thf(f142,plain,(
% 0.23/0.31 ~spl0_2 | ~spl0_7),
% 0.23/0.31 inference(avatar_contradiction_clause,[],[f141])).
% 0.23/0.31 cnf(s1, plain, ~spl0_1, inference(sat_conversion,[],[f12])).
% 0.23/0.31 cnf(s2, plain, spl0_1 | spl0_2 | spl0_3, inference(sat_conversion,[],[f48])).
% 0.23/0.31 cnf(s3, plain, spl0_1 | spl0_2 | spl0_4, inference(sat_conversion,[],[f52])).
% 0.23/0.31 cnf(s4, plain, spl0_1 | spl0_3 | spl0_5, inference(sat_conversion,[],[f57])).
% 0.23/0.31 cnf(s6, plain, spl0_1 | spl0_6 | spl0_7 | spl0_8 | spl0_9, inference(sat_conversion,[],[f75])).
% 0.23/0.31 cnf(s7, plain, spl0_1 | spl0_7 | spl0_9 | spl0_10, inference(sat_conversion,[],[f80])).
% 0.23/0.31 cnf(s12, plain, ~spl0_4 | ~spl0_7, inference(sat_conversion,[],[f116])).
% 0.23/0.31 cnf(s15, plain, ~spl0_3 | ~spl0_9, inference(sat_conversion,[],[f130])).
% 0.23/0.31 cnf(s18, plain, ~spl0_2 | ~spl0_5 | spl0_7 | ~spl0_9, inference(sat_conversion,[],[f133])).
% 0.23/0.31 cnf(s19, plain, ~spl0_8 | spl0_9 | ~spl0_10, inference(sat_conversion,[],[f134])).
% 0.23/0.31 cnf(s20, plain, ~spl0_6 | spl0_7 | ~spl0_10, inference(sat_conversion,[],[f135])).
% 0.23/0.31 cnf(s23, plain, ~spl0_2 | ~spl0_7, inference(sat_conversion,[],[f142])).
% 0.23/0.31 cnf(s24, plain, spl0_9 | spl0_7, inference(rat,[],[s6,s19,s20,s7,s1])).
% 0.23/0.31 cnf(s25, plain, spl0_2, inference(rat,[],[s24,s15,s12,s2,s3,s1])).
% 0.23/0.31 cnf(s26, plain, ~spl0_7, inference(rat,[],[s23,s25])).
% 0.23/0.31 cnf(s27, plain, spl0_9, inference(rat,[],[s24,s26])).
% 0.23/0.31 cnf(s28, plain, ~spl0_3, inference(rat,[],[s15,s27])).
% 0.23/0.31 cnf(s29, plain, ~spl0_5, inference(rat,[],[s18,s25,s26,s27])).
% 0.23/0.31 cnf(s30, plain, $false, inference(rat,[],[s4,s1,s29,s28])).
% 0.23/0.31 thf(f143,plain,(
% 0.23/0.31 $false),
% 0.23/0.31 inference(avatar_sat_refutation,[],[s30])).
% 0.23/0.31 % SZS output end Proof for theBenchmark
% 0.23/0.31 % (3499673)------------------------------
% 0.23/0.31 % (3499673)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.31 % (3499673)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.31 % (3499673)CaDiCaL version: 2.1.3
% 0.23/0.31 % (3499673)Termination reason: Refutation
% 0.23/0.31 % (3499673)Time elapsed: 0.005 s
% 0.23/0.31 % (3499673)Peak memory usage: 13 MB
% 0.23/0.31 % (3499673)Instructions burned: 6 (million)
% 0.23/0.31 % (3499665)Success in time 0.042 s
% 0.23/0.31 % Vampire exiting
%------------------------------------------------------------------------------