%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU896^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:31:54 AM UTC 2026
% Result : Theorem 0.10s 0.26s
% Output : Refutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU896^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.16 % Computer : n014.cluster.edu
% 0.10/0.16 % Model : x86_64 x86_64
% 0.10/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16 % Memory : 8046.5625MB
% 0.10/0.16 % OS : Linux 6.8.0-71-generic
% 0.10/0.16 % CPULimit : 300
% 0.10/0.16 % WCLimit : 300
% 0.10/0.16 % DateTime : Tue Sep 29 14:44:30 UTC 2026
% 0.10/0.17 % CPUTime :
% 0.10/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.20 Running higher-order theorem proving
% 0.10/0.21 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.10/0.26 % (2759960)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.10/0.26 % (2759968)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=76147560: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.10/0.26 % (2759968) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2759960-2759968"...
% 0.10/0.26 % (2759968)...printing done.
% 0.10/0.26 % (2759971)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.10/0.26 % (2759971)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.10/0.26 % (2759968)Refutation found. Thanks to Tanya!
% 0.10/0.26 % SZS status Theorem for theBenchmark
% 0.10/0.26 % SZS output start Proof for theBenchmark
% 0.10/0.26 thf(type_def_5, type, b: $tType).
% 0.10/0.26 thf(type_def_6, type, a: $tType).
% 0.10/0.26 thf(type_def_7, type, sTfun: ($tType * $tType) > $tType).
% 0.10/0.26 thf(func_def_0, type, y: b).
% 0.10/0.26 thf(func_def_1, type, g: (b > a)).
% 0.10/0.26 thf(func_def_2, type, x: b).
% 0.10/0.26 thf(func_def_4, type, vOR: ($o > $o > $o)).
% 0.10/0.26 thf(func_def_5, type, db0: !>[X0: $tType]:(X0)).
% 0.10/0.26 thf(func_def_6, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.10/0.26 thf(func_def_7, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.10/0.26 thf(func_def_8, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.10/0.26 thf(func_def_9, type, vAND: ($o > $o > $o)).
% 0.10/0.26 thf(func_def_10, type, db1: !>[X0: $tType]:(X0)).
% 0.10/0.26 thf(func_def_14, type, sK1: a).
% 0.10/0.26 thf(func_def_15, type, sK2: b).
% 0.10/0.26 thf(f1,conjecture,(
% 0.10/0.26 ((^[X2 : a] : ((X2 = ((g @ y))) | (X2 = ((g @ x))))) = (^[X0 : a] : (? [X1 : b] : ((X0 = ((g @ X1))) & ((X1 = x) | (X1 = y))))))),
% 0.10/0.26 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM500_pme)).
% 0.10/0.26 thf(f2,negated_conjecture,(
% 0.10/0.26 ~ ((^[X2 : a] : ((X2 = ((g @ y))) | (X2 = ((g @ x))))) = (^[X0 : a] : (? [X1 : b] : ((X0 = ((g @ X1))) & ((X1 = x) | (X1 = y))))))),
% 0.10/0.26 inference(negated_conjecture,[status(cth)],[f1])).
% 0.10/0.26 thf(f3,plain,(
% 0.10/0.26 ~ ((^[X0 : a] : ((((g @ y)) = X0) | (((g @ x)) = X0))) = (^[X1 : a] : (? [X2 : b] : ((((g @ X2)) = X1) & ((x = X2) | (y = X2))))))),
% 0.10/0.26 inference(rectify,[],[f2])).
% 0.10/0.26 thf(f4,plain,(
% 0.10/0.26 ~ ((^[Y0 : a]: (((g @ x) = Y0) | ((g @ y) = Y0))) = (^[Y0 : a]: (?? @ b @ (^[Y1 : b]: (((y = Y1) | (x = Y1)) & ((g @ Y1) = Y0))))))),
% 0.10/0.26 inference(fool_elimination,[],[f3])).
% 0.10/0.26 thf(f5,plain,(
% 0.10/0.26 ((^[Y0 : a]: (((g @ x) = Y0) | ((g @ y) = Y0))) != (^[Y0 : a]: (?? @ b @ (^[Y1 : b]: (((y = Y1) | (x = Y1)) & ((g @ Y1) = Y0))))))),
% 0.10/0.26 inference(flattening,[],[f4])).
% 0.10/0.26 thf(f6,plain,(
% 0.10/0.26 ((^[Y0 : a]: (((g @ x) = Y0) | ((g @ y) = Y0))) != (^[Y0 : a]: (?? @ b @ (^[Y1 : b]: (((y = Y1) | (x = Y1)) & ((g @ Y1) = Y0))))))),
% 0.10/0.26 inference(cnf_transformation,[],[f5])).
% 0.10/0.26 thf(f9,definition,(
% 0.10/0.26 spl0_1 <=> ((^[Y0 : a]: (((g @ x) = Y0) | ((g @ y) = Y0))) = (^[Y0 : a]: (?? @ b @ (^[Y1 : b]: (((y = Y1) | (x = Y1)) & ((g @ Y1) = Y0))))))),
% 0.10/0.26 introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition])).
% 0.10/0.26 thf(f11,plain,(
% 0.10/0.26 ((^[Y0 : a]: (((g @ x) = Y0) | ((g @ y) = Y0))) != (^[Y0 : a]: (?? @ b @ (^[Y1 : b]: (((y = Y1) | (x = Y1)) & ((g @ Y1) = Y0)))))) | spl0_1),
% 0.10/0.26 inference(avatar_component_clause,[],[f9])).
% 0.10/0.26 thf(f12,plain,(
% 0.10/0.26 ~spl0_1),
% 0.10/0.26 inference(avatar_split_clause,[],[f6,f9])).
% 0.10/0.26 thf(f13,plain,(
% 0.10/0.26 ((((^[Y0 : a]: (?? @ b @ (^[Y1 : b]: (((y = Y1) | (x = Y1)) & ((g @ Y1) = Y0))))) @ sK1)) != (((^[Y0 : a]: (((g @ x) = Y0) | ((g @ y) = Y0))) @ sK1))) | spl0_1),
% 0.10/0.26 inference(negative_extensionality,[],[f11])).
% 0.10/0.26 thf(f14,plain,(
% 0.10/0.26 ($true = (((^[Y0 : a]: (((g @ x) = Y0) | ((g @ y) = Y0))) @ sK1))) | ((((^[Y0 : a]: (?? @ b @ (^[Y1 : b]: (((y = Y1) | (x = Y1)) & ((g @ Y1) = Y0))))) @ sK1)) = $true) | spl0_1),
% 0.10/0.26 inference(xor_proxy_clausification,[],[f13])).
% 0.10/0.26 thf(f15,plain,(
% 0.10/0.26 ($false = (((^[Y0 : a]: (((g @ x) = Y0) | ((g @ y) = Y0))) @ sK1))) | ((((^[Y0 : a]: (?? @ b @ (^[Y1 : b]: (((y = Y1) | (x = Y1)) & ((g @ Y1) = Y0))))) @ sK1)) = $false) | spl0_1),
% 0.10/0.26 inference(xor_proxy_clausification,[],[f13])).
% 0.10/0.26 thf(f16,plain,(
% 0.10/0.26 ($false = ((?? @ b @ (^[Y0 : b]: (((y = Y0) | (x = Y0)) & ((g @ Y0) = sK1)))))) | (((((g @ x) = sK1) | ((g @ y) = sK1))) = $false) | spl0_1),
% 0.10/0.26 inference(beta-eta_normalization,[],[f15])).
% 0.10/0.26 thf(f17,plain,(
% 0.10/0.26 ( ! [X1 : b] : ((((((g @ x) = sK1) | ((g @ y) = sK1))) = $false) | ((((^[Y0 : b]: (((y = Y0) | (x = Y0)) & ((g @ Y0) = sK1))) @ X1)) = $false)) ) | spl0_1),
% 0.10/0.26 inference(pi_proxy_clausification,[],[f16])).
% 0.10/0.26 thf(f18,plain,(
% 0.10/0.26 ( ! [X1 : b] : (((((g @ y) = sK1)) = $false) | ((((^[Y0 : b]: (((y = Y0) | (x = Y0)) & ((g @ Y0) = sK1))) @ X1)) = $false)) ) | spl0_1),
% 0.10/0.26 inference(or_proxy_clausification,[],[f17])).
% 0.10/0.26 thf(f19,plain,(
% 0.10/0.26 ( ! [X1 : b] : (((((^[Y0 : b]: (((y = Y0) | (x = Y0)) & ((g @ Y0) = sK1))) @ X1)) = $false) | ((((g @ x) = sK1)) = $false)) ) | spl0_1),
% 0.10/0.26 inference(or_proxy_clausification,[],[f17])).
% 0.10/0.26 thf(f20,plain,(
% 0.10/0.26 ( ! [X1 : b] : ((((g @ x)) != sK1) | ((((^[Y0 : b]: (((y = Y0) | (x = Y0)) & ((g @ Y0) = sK1))) @ X1)) = $false)) ) | spl0_1),
% 0.10/0.26 inference(equality_proxy_clausification,[],[f19])).
% 0.10/0.26 thf(f21,plain,(
% 0.10/0.26 ( ! [X1 : b] : ((((((y = X1) | (x = X1)) & ((g @ X1) = sK1))) = $false) | (((g @ x)) != sK1)) ) | spl0_1),
% 0.10/0.26 inference(beta-eta_normalization,[],[f20])).
% 0.10/0.26 thf(f22,plain,(
% 0.10/0.26 ( ! [X1 : b] : (((((y = X1) | (x = X1))) = $false) | ((((g @ X1) = sK1)) = $false) | (((g @ x)) != sK1)) ) | spl0_1),
% 0.10/0.26 inference(and_proxy_clausification,[],[f21])).
% 0.10/0.26 thf(f23,plain,(
% 0.10/0.26 ( ! [X1 : b] : ((((g @ x)) != sK1) | ((((g @ X1) = sK1)) = $false) | (((x = X1)) = $false)) ) | spl0_1),
% 0.10/0.26 inference(or_proxy_clausification,[],[f22])).
% 0.10/0.26 thf(f27,plain,(
% 0.10/0.26 ( ! [X1 : b] : ((((x = X1)) = $false) | (((g @ x)) != sK1) | (((g @ X1)) != sK1)) ) | spl0_1),
% 0.10/0.26 inference(equality_proxy_clausification,[],[f23])).
% 0.10/0.26 thf(f28,plain,(
% 0.10/0.26 ( ! [X1 : b] : ((x != X1) | (((g @ x)) != sK1) | (((g @ X1)) != sK1)) ) | spl0_1),
% 0.10/0.26 inference(equality_proxy_clausification,[],[f27])).
% 0.10/0.26 thf(f29,plain,(
% 0.10/0.26 ( ! [X1 : b] : ((((g @ y)) != sK1) | ((((^[Y0 : b]: (((y = Y0) | (x = Y0)) & ((g @ Y0) = sK1))) @ X1)) = $false)) ) | spl0_1),
% 0.10/0.26 inference(equality_proxy_clausification,[],[f18])).
% 0.10/0.26 thf(f30,plain,(
% 0.10/0.26 ( ! [X1 : b] : ((((((y = X1) | (x = X1)) & ((g @ X1) = sK1))) = $false) | (((g @ y)) != sK1)) ) | spl0_1),
% 0.10/0.26 inference(beta-eta_normalization,[],[f29])).
% 0.10/0.26 thf(f31,plain,(
% 0.10/0.26 ( ! [X1 : b] : (((((y = X1) | (x = X1))) = $false) | (((g @ y)) != sK1) | ((((g @ X1) = sK1)) = $false)) ) | spl0_1),
% 0.10/0.26 inference(and_proxy_clausification,[],[f30])).
% 0.10/0.26 thf(f33,plain,(
% 0.10/0.26 ( ! [X1 : b] : ((((y = X1)) = $false) | (((g @ y)) != sK1) | ((((g @ X1) = sK1)) = $false)) ) | spl0_1),
% 0.10/0.26 inference(or_proxy_clausification,[],[f31])).
% 0.10/0.26 thf(f34,plain,(
% 0.10/0.26 ( ! [X1 : b] : (((((g @ X1) = sK1)) = $false) | (((g @ y)) != sK1) | (y != X1)) ) | spl0_1),
% 0.10/0.26 inference(equality_proxy_clausification,[],[f33])).
% 0.10/0.26 thf(f35,plain,(
% 0.10/0.26 ( ! [X1 : b] : ((y != X1) | (((g @ y)) != sK1) | (((g @ X1)) != sK1)) ) | spl0_1),
% 0.10/0.26 inference(equality_proxy_clausification,[],[f34])).
% 0.10/0.26 thf(f38,plain,(
% 0.10/0.26 ($true = ((?? @ b @ (^[Y0 : b]: (((y = Y0) | (x = Y0)) & ((g @ Y0) = sK1)))))) | (((((g @ x) = sK1) | ((g @ y) = sK1))) = $true) | spl0_1),
% 0.10/0.26 inference(beta-eta_normalization,[],[f14])).
% 0.10/0.26 thf(f39,plain,(
% 0.10/0.26 ($true = (((^[Y0 : b]: (((y = Y0) | (x = Y0)) & ((g @ Y0) = sK1))) @ sK2))) | (((((g @ x) = sK1) | ((g @ y) = sK1))) = $true) | spl0_1),
% 0.10/0.26 inference(sigma_proxy_clausification,[],[f38])).
% 0.10/0.26 thf(f40,plain,(
% 0.10/0.26 ((((g @ y) = sK1)) = $true) | ($true = (((^[Y0 : b]: (((y = Y0) | (x = Y0)) & ((g @ Y0) = sK1))) @ sK2))) | ($true = (((g @ x) = sK1))) | spl0_1),
% 0.10/0.26 inference(or_proxy_clausification,[],[f39])).
% 0.10/0.26 thf(f41,plain,(
% 0.10/0.26 (((g @ y)) = sK1) | ($true = (((g @ x) = sK1))) | ($true = (((^[Y0 : b]: (((y = Y0) | (x = Y0)) & ((g @ Y0) = sK1))) @ sK2))) | spl0_1),
% 0.10/0.26 inference(equality_proxy_clausification,[],[f40])).
% 0.10/0.26 thf(f42,plain,(
% 0.10/0.26 (((g @ x)) = sK1) | (((g @ y)) = sK1) | ($true = (((^[Y0 : b]: (((y = Y0) | (x = Y0)) & ((g @ Y0) = sK1))) @ sK2))) | spl0_1),
% 0.10/0.26 inference(equality_proxy_clausification,[],[f41])).
% 0.10/0.26 thf(f43,plain,(
% 0.10/0.26 (((((y = sK2) | (x = sK2)) & ((g @ sK2) = sK1))) = $true) | (((g @ x)) = sK1) | (((g @ y)) = sK1) | spl0_1),
% 0.10/0.26 inference(beta-eta_normalization,[],[f42])).
% 0.10/0.26 thf(f44,plain,(
% 0.10/0.26 (((g @ x)) = sK1) | (((g @ y)) = sK1) | ((((g @ sK2) = sK1)) = $true) | spl0_1),
% 0.10/0.26 inference(and_proxy_clausification,[],[f43])).
% 0.10/0.26 thf(f45,plain,(
% 0.10/0.26 ((((y = sK2) | (x = sK2))) = $true) | (((g @ y)) = sK1) | (((g @ x)) = sK1) | spl0_1),
% 0.10/0.26 inference(and_proxy_clausification,[],[f43])).
% 0.10/0.26 thf(f46,plain,(
% 0.10/0.26 (((g @ y)) = sK1) | (((x = sK2)) = $true) | (((g @ x)) = sK1) | (((y = sK2)) = $true) | spl0_1),
% 0.10/0.26 inference(or_proxy_clausification,[],[f45])).
% 0.10/0.26 thf(f47,plain,(
% 0.10/0.26 (((g @ y)) = sK1) | (((g @ x)) = sK1) | (x = sK2) | (((y = sK2)) = $true) | spl0_1),
% 0.10/0.26 inference(equality_proxy_clausification,[],[f46])).
% 0.10/0.26 thf(f48,plain,(
% 0.10/0.26 (((g @ y)) = sK1) | (x = sK2) | (((g @ x)) = sK1) | (y = sK2) | spl0_1),
% 0.10/0.26 inference(equality_proxy_clausification,[],[f47])).
% 0.10/0.26 thf(f49,plain,(
% 0.10/0.26 (((g @ sK2)) = sK1) | (((g @ y)) = sK1) | (((g @ x)) = sK1) | spl0_1),
% 0.10/0.26 inference(equality_proxy_clausification,[],[f44])).
% 0.10/0.26 thf(f51,definition,(
% 0.10/0.26 spl0_2 <=> (((g @ x)) = sK1)),
% 0.10/0.26 introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition])).
% 0.10/0.26 thf(f52,plain,(
% 0.10/0.26 (((g @ x)) = sK1) | ~spl0_2),
% 0.10/0.26 inference(avatar_component_clause,[],[f51])).
% 0.10/0.26 thf(f55,definition,(
% 0.10/0.26 spl0_3 <=> ! [X1 : b] : ((((g @ X1)) != sK1) | (y != X1))),
% 0.10/0.26 introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition])).
% 0.10/0.26 thf(f56,plain,(
% 0.10/0.26 ( ! [X1 : b] : ((((g @ X1)) != sK1) | (y != X1)) ) | ~spl0_3),
% 0.10/0.26 inference(avatar_component_clause,[],[f55])).
% 0.10/0.26 thf(f59,definition,(
% 0.10/0.26 spl0_4 <=> ! [X1 : b] : ((x != X1) | (((g @ X1)) != sK1))),
% 0.10/0.26 introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition])).
% 0.10/0.26 thf(f60,plain,(
% 0.10/0.26 ( ! [X1 : b] : ((x != X1) | (((g @ X1)) != sK1)) ) | ~spl0_4),
% 0.10/0.26 inference(avatar_component_clause,[],[f59])).
% 0.10/0.26 thf(f61,plain,(
% 0.10/0.26 spl0_4 | ~spl0_2 | spl0_1),
% 0.10/0.26 inference(avatar_split_clause,[],[f28,f9,f51,f59])).
% 0.10/0.26 thf(f63,definition,(
% 0.10/0.26 spl0_5 <=> (((g @ y)) = sK1)),
% 0.10/0.26 introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition])).
% 0.10/0.26 thf(f64,plain,(
% 0.10/0.26 (((g @ y)) = sK1) | ~spl0_5),
% 0.10/0.26 inference(avatar_component_clause,[],[f63])).
% 0.10/0.26 thf(f66,plain,(
% 0.10/0.26 ~spl0_5 | spl0_3 | spl0_1),
% 0.10/0.26 inference(avatar_split_clause,[],[f35,f9,f55,f63])).
% 0.10/0.26 thf(f69,definition,(
% 0.10/0.26 spl0_6 <=> (x = sK2)),
% 0.10/0.26 introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition])).
% 0.10/0.26 thf(f73,definition,(
% 0.10/0.26 spl0_7 <=> (y = sK2)),
% 0.10/0.26 introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition])).
% 0.10/0.26 thf(f76,plain,(
% 0.10/0.26 spl0_2 | spl0_6 | spl0_5 | spl0_7 | spl0_1),
% 0.10/0.26 inference(avatar_split_clause,[],[f48,f9,f73,f63,f69,f51])).
% 0.10/0.26 thf(f78,definition,(
% 0.10/0.26 spl0_8 <=> (((g @ sK2)) = sK1)),
% 0.10/0.26 introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition])).
% 0.10/0.26 thf(f81,plain,(
% 0.10/0.26 spl0_8 | spl0_5 | spl0_2 | spl0_1),
% 0.10/0.26 inference(avatar_split_clause,[],[f49,f9,f51,f63,f78])).
% 0.10/0.26 thf(f88,plain,(
% 0.10/0.26 ( ! [X1 : b] : ((((g @ X1)) != ((g @ y))) | (y != X1)) ) | (~spl0_3 | ~spl0_5)),
% 0.10/0.26 inference(forward_demodulation,[],[f56,f64])).
% 0.10/0.26 thf(f90,plain,(
% 0.10/0.26 (y != y) | (~spl0_3 | ~spl0_5)),
% 0.10/0.26 inference(equality_resolution,[],[f88])).
% 0.10/0.26 thf(f91,plain,(
% 0.10/0.26 $false | (~spl0_3 | ~spl0_5)),
% 0.10/0.26 inference(trivial_inequality_removal,[],[f90])).
% 0.10/0.26 thf(f92,plain,(
% 0.10/0.26 ~spl0_3 | ~spl0_5),
% 0.10/0.26 inference(avatar_contradiction_clause,[],[f91])).
% 0.10/0.26 thf(f95,plain,(
% 0.10/0.26 ( ! [X1 : b] : ((((g @ X1)) != ((g @ x))) | (x != X1)) ) | (~spl0_2 | ~spl0_4)),
% 0.10/0.26 inference(forward_demodulation,[],[f60,f52])).
% 0.10/0.26 thf(f102,plain,(
% 0.10/0.26 (x != x) | (~spl0_2 | ~spl0_4)),
% 0.10/0.26 inference(equality_resolution,[],[f95])).
% 0.10/0.26 thf(f103,plain,(
% 0.10/0.26 $false | (~spl0_2 | ~spl0_4)),
% 0.10/0.26 inference(trivial_inequality_removal,[],[f102])).
% 0.10/0.26 thf(f104,plain,(
% 0.10/0.26 ~spl0_2 | ~spl0_4),
% 0.10/0.26 inference(avatar_contradiction_clause,[],[f103])).
% 0.10/0.26 thf(f105,definition,(
% 0.10/0.26 (x != sK2) | (((g @ sK2)) != sK1) | (((g @ x)) = sK1)),
% 0.10/0.26 introduced(theory,[theory_tautology_sat_conflict])).
% 0.10/0.26 thf(f106,definition,(
% 0.10/0.26 (y != sK2) | (((g @ sK2)) != sK1) | (((g @ y)) = sK1)),
% 0.10/0.26 introduced(theory,[theory_tautology_sat_conflict])).
% 0.10/0.26 cnf(s1, plain, ~spl0_1, inference(sat_conversion,[],[f12])).
% 0.10/0.26 cnf(s3, plain, spl0_1 | ~spl0_2 | spl0_4, inference(sat_conversion,[],[f61])).
% 0.10/0.26 cnf(s4, plain, spl0_1 | spl0_3 | ~spl0_5, inference(sat_conversion,[],[f66])).
% 0.10/0.26 cnf(s6, plain, spl0_1 | spl0_2 | spl0_5 | spl0_6 | spl0_7, inference(sat_conversion,[],[f76])).
% 0.10/0.26 cnf(s7, plain, spl0_1 | spl0_2 | spl0_5 | spl0_8, inference(sat_conversion,[],[f81])).
% 0.10/0.26 cnf(s9, plain, ~spl0_3 | ~spl0_5, inference(sat_conversion,[],[f92])).
% 0.10/0.26 cnf(s11, plain, ~spl0_2 | ~spl0_4, inference(sat_conversion,[],[f104])).
% 0.10/0.26 cnf(s12, plain, spl0_2 | ~spl0_6 | ~spl0_8, inference(sat_conversion,[],[f105])).
% 0.10/0.26 cnf(s13, plain, spl0_5 | ~spl0_7 | ~spl0_8, inference(sat_conversion,[],[f106])).
% 0.10/0.26 cnf(s14, plain, spl0_5 | spl0_2, inference(rat,[],[s6,s12,s13,s7,s1])).
% 0.10/0.26 cnf(s15, plain, ~spl0_5, inference(rat,[],[s4,s9,s1])).
% 0.10/0.26 cnf(s16, plain, spl0_2, inference(rat,[],[s14,s15])).
% 0.10/0.26 cnf(s17, plain, ~spl0_4, inference(rat,[],[s11,s16])).
% 0.10/0.26 cnf(s18, plain, $false, inference(rat,[],[s3,s1,s17,s16])).
% 0.10/0.26 thf(f107,plain,(
% 0.10/0.26 $false),
% 0.10/0.26 inference(avatar_sat_refutation,[],[s18])).
% 0.10/0.26 % SZS output end Proof for theBenchmark
% 0.10/0.26 % (2759968)------------------------------
% 0.10/0.26 % (2759968)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.26 % (2759968)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.26 % (2759968)CaDiCaL version: 2.1.3
% 0.10/0.26 % (2759968)Termination reason: Refutation
% 0.10/0.26 % (2759968)Time elapsed: 0.003 s
% 0.10/0.26 % (2759968)Peak memory usage: 13 MB
% 0.10/0.26 % (2759968)Instructions burned: 7 (million)
% 0.10/0.26 % (2759960)Success in time 0.042 s
% 0.10/0.26 % Vampire exiting
%------------------------------------------------------------------------------