%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO042^2 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 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:46:21 AM UTC 2026
% Result : Theorem 0.09s 0.17s
% Output : Refutation 0.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYO042^2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.00/0.11 % Computer : n012.cluster.edu
% 0.00/0.11 % Model : x86_64 x86_64
% 0.00/0.11 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11 % Memory : 8046.5625MB
% 0.00/0.11 % OS : Linux 6.8.0-71-generic
% 0.00/0.11 % CPULimit : 300
% 0.00/0.11 % WCLimit : 300
% 0.00/0.11 % DateTime : Tue Sep 29 16:23:49 UTC 2026
% 0.00/0.11 % CPUTime :
% 0.00/0.11 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.13 Running higher-order theorem proving
% 0.09/0.13 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.09/0.17 % (315133)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.09/0.17 % (315156)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.09/0.17 % (315156)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.09/0.17 % (315152)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2099820159:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.09/0.17 % (315153)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=1721387895: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.09/0.17 % (315156)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=1932596580:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.09/0.17 % (315151)lrs+10_16_si=on:nwc=1.5:random_seed=3792115983:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.09/0.17 % (315150)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=679681294:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.09/0.17 % (315155)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=94047556:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.09/0.17 % (315154)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=791364698:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.09/0.17 % (315152)Refutation not found, incomplete strategy
% 0.09/0.17 % (315152)------------------------------
% 0.09/0.17 % (315152)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.17 % (315152)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.17 % (315152)CaDiCaL version: 2.1.3
% 0.09/0.17 % (315152)Termination reason: Refutation not found, incomplete strategy
% 0.09/0.17 % (315152)Time elapsed: 0.0000 s
% 0.09/0.17 % (315152)Peak memory usage: 12 MB
% 0.09/0.17 % (315150)Refutation not found, incomplete strategy
% 0.09/0.17 % (315150)------------------------------
% 0.09/0.17 % (315150)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.17 % (315150)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.17 % (315150)CaDiCaL version: 2.1.3
% 0.09/0.17 % (315150)Termination reason: Refutation not found, incomplete strategy
% 0.09/0.17 % (315150)Time elapsed: 0.0000 s
% 0.09/0.17 % (315150)Peak memory usage: 12 MB
% 0.09/0.17 % (315150)Instructions burned: 1 (million)
% 0.09/0.17 % (315153)Refutation not found, incomplete strategy
% 0.09/0.17 % (315153)------------------------------
% 0.09/0.17 % (315153)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.17 % (315153)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.17 % (315153)CaDiCaL version: 2.1.3
% 0.09/0.17 % (315153)Termination reason: Refutation not found, incomplete strategy
% 0.09/0.17 % (315153)Time elapsed: 0.001 s
% 0.09/0.17 % (315153)Peak memory usage: 12 MB
% 0.09/0.17 % (315153)Instructions burned: 2 (million)
% 0.09/0.17 % (315152)------------------------------
% 0.09/0.17 % (315152)------------------------------
% 0.09/0.17 % (315150)------------------------------
% 0.09/0.17 % (315150)------------------------------
% 0.09/0.17 % (315154)Refutation not found, incomplete strategy
% 0.09/0.17 % (315154)------------------------------
% 0.09/0.17 % (315154)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.17 % (315154)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.17 % (315154)CaDiCaL version: 2.1.3
% 0.09/0.17 % (315154)Termination reason: Refutation not found, incomplete strategy
% 0.09/0.17 % (315154)Time elapsed: 0.001 s
% 0.09/0.17 % (315154)Peak memory usage: 12 MB
% 0.09/0.17 % (315154)Instructions burned: 3 (million)
% 0.09/0.17 % (315156)Refutation not found, incomplete strategy
% 0.09/0.17 % (315156)------------------------------
% 0.09/0.17 % (315156)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.17 % (315156)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.17 % (315156)CaDiCaL version: 2.1.3
% 0.09/0.17 % (315156)Termination reason: Refutation not found, incomplete strategy
% 0.09/0.17 % (315156)Time elapsed: 0.001 s
% 0.09/0.17 % (315156)Peak memory usage: 12 MB
% 0.09/0.17 % (315156)Instructions burned: 3 (million)
% 0.09/0.17 % (315153)------------------------------
% 0.09/0.17 % (315153)------------------------------
% 0.09/0.17 % (315154)------------------------------
% 0.09/0.17 % (315154)------------------------------
% 0.09/0.17 % (315156)------------------------------
% 0.09/0.17 % (315156)------------------------------
% 0.09/0.17 % (315155) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-315133-315155"...
% 0.09/0.17 % (315151) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-315133-315151"...
% 0.09/0.17 % (315155)...printing done.
% 0.09/0.17 % (315151)...printing done.
% 0.09/0.17 % (315155)Refutation found. Thanks to Tanya!
% 0.09/0.17 % SZS status Theorem for theBenchmark
% 0.09/0.17 % SZS output start Proof for theBenchmark
% 0.09/0.17 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.09/0.17 thf(func_def_0, type, g: ($o > $o)).
% 0.09/0.17 thf(func_def_1, type, p: (($o > $o) > $o)).
% 0.09/0.17 thf(func_def_2, type, x: $o).
% 0.09/0.17 thf(func_def_3, type, y: $o).
% 0.09/0.17 thf(func_def_5, type, vNOT: ($o > $o)).
% 0.09/0.17 thf(func_def_9, type, sK1: $o).
% 0.09/0.17 thf(f1,conjecture,(
% 0.09/0.17 ~((((g @ y)) = x) & (p @ g) & (x != y) & (((g @ x)) = y) & ~(p @ ~))),
% 0.09/0.17 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',4)).
% 0.09/0.17 thf(f2,negated_conjecture,(
% 0.09/0.17 ~ ~((((g @ y)) = x) & (p @ g) & (x != y) & (((g @ x)) = y) & ~(p @ ~))),
% 0.09/0.17 inference(negated_conjecture,[status(cth)],[f1])).
% 0.09/0.17 thf(f3,plain,(
% 0.09/0.17 ~ ~((((g @ y)) = x) & (p @ g) & (x != y) & (((g @ x)) = y) & ~(p @ ~))),
% 0.09/0.17 inference(rectify,[],[f2])).
% 0.09/0.17 thf(f4,plain,(
% 0.09/0.17 ~ ~(((x = $true) <=> (((g @ y)) = $true)) & (((p @ g)) = $true) & ((y = $true) <~> (x = $true)) & ((((g @ x)) = $true) <=> (y = $true)) & ~ (((p @ ~)) = $true))),
% 0.09/0.17 inference(fool_elimination,[],[f3])).
% 0.09/0.17 thf(f5,plain,(
% 0.09/0.17 ((y = $true) <~> (x = $true)) & ((((g @ x)) = $true) <=> (y = $true)) & ((x = $true) <=> (((g @ y)) = $true)) & (((p @ ~)) != $true) & (((p @ g)) = $true)),
% 0.09/0.17 inference(flattening,[],[f4])).
% 0.09/0.17 thf(f6,plain,(
% 0.09/0.17 (((x != $true) | (y != $true)) & ((x = $true) | (y = $true))) & (((((g @ x)) = $true) | (y != $true)) & ((y = $true) | (((g @ x)) != $true))) & (((x = $true) | (((g @ y)) != $true)) & ((((g @ y)) = $true) | (x != $true))) & (((p @ ~)) != $true) & (((p @ g)) = $true)),
% 0.09/0.17 inference(nnf_transformation,[],[f5])).
% 0.09/0.17 thf(f7,plain,(
% 0.09/0.17 ((x != $true) | (y != $true)) & ((x = $true) | (y = $true)) & ((((g @ x)) = $true) | (y != $true)) & ((y = $true) | (((g @ x)) != $true)) & ((x = $true) | (((g @ y)) != $true)) & ((((g @ y)) = $true) | (x != $true)) & (((p @ ~)) != $true) & (((p @ g)) = $true)),
% 0.09/0.17 inference(flattening,[],[f6])).
% 0.09/0.17 thf(f8,plain,(
% 0.09/0.17 (((p @ g)) = $true)),
% 0.09/0.17 inference(cnf_transformation,[],[f7])).
% 0.09/0.17 thf(f9,plain,(
% 0.09/0.17 (((p @ ~)) != $true)),
% 0.09/0.17 inference(cnf_transformation,[],[f7])).
% 0.09/0.17 thf(f10,plain,(
% 0.09/0.17 (((g @ y)) = $true) | (x != $true)),
% 0.09/0.17 inference(cnf_transformation,[],[f7])).
% 0.09/0.17 thf(f11,plain,(
% 0.09/0.17 (((g @ y)) != $true) | (x = $true)),
% 0.09/0.17 inference(cnf_transformation,[],[f7])).
% 0.09/0.17 thf(f12,plain,(
% 0.09/0.17 (y = $true) | (((g @ x)) != $true)),
% 0.09/0.17 inference(cnf_transformation,[],[f7])).
% 0.09/0.17 thf(f13,plain,(
% 0.09/0.17 (((g @ x)) = $true) | (y != $true)),
% 0.09/0.17 inference(cnf_transformation,[],[f7])).
% 0.09/0.17 thf(f14,plain,(
% 0.09/0.17 (x = $true) | (y = $true)),
% 0.09/0.17 inference(cnf_transformation,[],[f7])).
% 0.09/0.17 thf(f15,plain,(
% 0.09/0.17 (x != $true) | (y != $true)),
% 0.09/0.17 inference(cnf_transformation,[],[f7])).
% 0.09/0.17 thf(f17,definition,(
% 0.09/0.17 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.09/0.17 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.09/0.17 thf(f19,definition,(
% 0.09/0.17 spl0_1 <=> (((g @ x)) = $true)),
% 0.09/0.17 introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition])).
% 0.09/0.17 thf(f20,plain,(
% 0.09/0.17 (((g @ x)) != $true) | spl0_1),
% 0.09/0.17 inference(avatar_component_clause,[],[f19])).
% 0.09/0.17 thf(f22,definition,(
% 0.09/0.17 spl0_2 <=> (y = $true)),
% 0.09/0.17 introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition])).
% 0.09/0.17 thf(f23,plain,(
% 0.09/0.17 (y = $true) | ~spl0_2),
% 0.09/0.17 inference(avatar_component_clause,[],[f22])).
% 0.09/0.17 thf(f24,plain,(
% 0.09/0.17 ~spl0_1 | spl0_2),
% 0.09/0.17 inference(avatar_split_clause,[],[f12,f22,f19])).
% 0.09/0.17 thf(f26,definition,(
% 0.09/0.17 spl0_3 <=> (x = $true)),
% 0.09/0.17 introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition])).
% 0.09/0.17 thf(f27,plain,(
% 0.09/0.17 (x != $true) | spl0_3),
% 0.09/0.17 inference(avatar_component_clause,[],[f26])).
% 0.09/0.17 thf(f29,definition,(
% 0.09/0.17 spl0_4 <=> (((g @ y)) = $true)),
% 0.09/0.17 introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition])).
% 0.09/0.17 thf(f30,plain,(
% 0.09/0.17 (((g @ y)) = $true) | ~spl0_4),
% 0.09/0.17 inference(avatar_component_clause,[],[f29])).
% 0.09/0.17 thf(f31,plain,(
% 0.09/0.17 ~spl0_3 | spl0_4),
% 0.09/0.17 inference(avatar_split_clause,[],[f10,f29,f26])).
% 0.09/0.17 thf(f32,plain,(
% 0.09/0.17 (y != $true) | spl0_2),
% 0.09/0.17 inference(avatar_component_clause,[],[f22])).
% 0.09/0.17 thf(f33,plain,(
% 0.09/0.17 (((g @ x)) = $true) | ~spl0_1),
% 0.09/0.17 inference(avatar_component_clause,[],[f19])).
% 0.09/0.17 thf(f34,plain,(
% 0.09/0.17 ~spl0_2 | spl0_1),
% 0.09/0.17 inference(avatar_split_clause,[],[f13,f19,f22])).
% 0.09/0.17 thf(f35,plain,(
% 0.09/0.17 (x = $true) | ~spl0_3),
% 0.09/0.17 inference(avatar_component_clause,[],[f26])).
% 0.09/0.17 thf(f36,plain,(
% 0.09/0.17 spl0_2 | spl0_3),
% 0.09/0.17 inference(avatar_split_clause,[],[f14,f26,f22])).
% 0.09/0.17 thf(f37,plain,(
% 0.09/0.17 ~spl0_3 | ~spl0_2),
% 0.09/0.17 inference(avatar_split_clause,[],[f15,f22,f26])).
% 0.09/0.17 thf(f38,plain,(
% 0.09/0.17 (((g @ y)) != $true) | spl0_4),
% 0.09/0.17 inference(avatar_component_clause,[],[f29])).
% 0.09/0.17 thf(f39,plain,(
% 0.09/0.17 spl0_3 | ~spl0_4),
% 0.09/0.17 inference(avatar_split_clause,[],[f11,f29,f26])).
% 0.09/0.17 thf(f40,plain,(
% 0.09/0.17 (((g @ $true)) != $true) | (spl0_1 | ~spl0_3)),
% 0.09/0.17 inference(backward_demodulation,[],[f20,f35])).
% 0.09/0.17 thf(f41,plain,(
% 0.09/0.17 ($true != $true) | (g != ~)),
% 0.09/0.17 inference(constrained_superposition,[],[f9,f8])).
% 0.09/0.17 thf(f42,plain,(
% 0.09/0.17 (g != ~)),
% 0.09/0.17 inference(trivial_inequality_removal,[],[f41])).
% 0.09/0.17 thf(f43,plain,(
% 0.09/0.17 (((~ sK1)) != ((g @ sK1)))),
% 0.09/0.17 inference(negative_extensionality,[],[f42])).
% 0.09/0.17 thf(f44,plain,(
% 0.09/0.17 ($true = ((~ sK1))) | ($true = ((g @ sK1)))),
% 0.09/0.17 inference(xor_proxy_clausification,[],[f43])).
% 0.09/0.17 thf(f45,plain,(
% 0.09/0.17 (((~ sK1)) = $false) | ($false = ((g @ sK1)))),
% 0.09/0.17 inference(xor_proxy_clausification,[],[f43])).
% 0.09/0.17 thf(f46,plain,(
% 0.09/0.17 ($true = sK1) | ($false = ((g @ sK1)))),
% 0.09/0.17 inference(not_proxy_clausification,[],[f45])).
% 0.09/0.17 thf(f47,plain,(
% 0.09/0.17 ($false = sK1) | ($true = ((g @ sK1)))),
% 0.09/0.17 inference(not_proxy_clausification,[],[f44])).
% 0.09/0.17 thf(f49,definition,(
% 0.09/0.17 spl0_5 <=> ($false = ((g @ sK1)))),
% 0.09/0.17 introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition])).
% 0.09/0.17 thf(f50,plain,(
% 0.09/0.17 ($false = ((g @ sK1))) | ~spl0_5),
% 0.09/0.17 inference(avatar_component_clause,[],[f49])).
% 0.09/0.17 thf(f52,definition,(
% 0.09/0.17 spl0_6 <=> ($true = sK1)),
% 0.09/0.17 introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition])).
% 0.09/0.17 thf(f53,plain,(
% 0.09/0.17 ($true = sK1) | ~spl0_6),
% 0.09/0.17 inference(avatar_component_clause,[],[f52])).
% 0.09/0.17 thf(f54,plain,(
% 0.09/0.17 spl0_5 | spl0_6),
% 0.09/0.17 inference(avatar_split_clause,[],[f46,f52,f49])).
% 0.09/0.17 thf(f56,definition,(
% 0.09/0.17 spl0_7 <=> ($true = ((g @ sK1)))),
% 0.09/0.17 introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition])).
% 0.09/0.17 thf(f57,plain,(
% 0.09/0.17 ($true = ((g @ sK1))) | ~spl0_7),
% 0.09/0.17 inference(avatar_component_clause,[],[f56])).
% 0.09/0.17 thf(f59,definition,(
% 0.09/0.17 spl0_8 <=> ($false = sK1)),
% 0.09/0.17 introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition])).
% 0.09/0.17 thf(f60,plain,(
% 0.09/0.17 ($false = sK1) | ~spl0_8),
% 0.09/0.17 inference(avatar_component_clause,[],[f59])).
% 0.09/0.17 thf(f61,plain,(
% 0.09/0.17 spl0_7 | spl0_8),
% 0.09/0.17 inference(avatar_split_clause,[],[f47,f59,f56])).
% 0.09/0.17 thf(f62,plain,(
% 0.09/0.17 ($true = $false) | (~spl0_5 | ~spl0_7)),
% 0.09/0.17 inference(forward_demodulation,[],[f57,f50])).
% 0.09/0.17 thf(f63,plain,(
% 0.09/0.17 $false | (~spl0_5 | ~spl0_7)),
% 0.09/0.17 inference(trivial_inequality_removal,[],[f62])).
% 0.09/0.17 thf(f64,plain,(
% 0.09/0.17 ~spl0_5 | ~spl0_7),
% 0.09/0.17 inference(avatar_contradiction_clause,[],[f63])).
% 0.09/0.17 thf(f65,plain,(
% 0.09/0.17 (((g @ $false)) = $false) | (~spl0_5 | ~spl0_8)),
% 0.09/0.17 inference(backward_demodulation,[],[f50,f60])).
% 0.09/0.17 thf(f70,plain,(
% 0.09/0.17 ($true != $true) | (y = $false) | spl0_2),
% 0.09/0.17 inference(constrained_superposition,[],[f32,f17])).
% 0.09/0.17 thf(f71,plain,(
% 0.09/0.17 ($true != $true) | (((g @ $true)) = $false) | (spl0_1 | ~spl0_3)),
% 0.09/0.17 inference(constrained_superposition,[],[f40,f17])).
% 0.09/0.17 thf(f81,plain,(
% 0.09/0.17 (y = $false) | spl0_2),
% 0.09/0.17 inference(trivial_inequality_removal,[],[f70])).
% 0.09/0.17 thf(f84,plain,(
% 0.09/0.17 (((g @ $true)) = $false) | (spl0_1 | ~spl0_3)),
% 0.09/0.17 inference(trivial_inequality_removal,[],[f71])).
% 0.09/0.17 thf(f89,plain,(
% 0.09/0.17 ($true = ((g @ $false))) | (spl0_2 | ~spl0_4)),
% 0.09/0.17 inference(backward_demodulation,[],[f30,f81])).
% 0.09/0.17 thf(f92,plain,(
% 0.09/0.17 ($true = $false) | (spl0_2 | ~spl0_4 | ~spl0_5 | ~spl0_8)),
% 0.09/0.17 inference(forward_demodulation,[],[f89,f65])).
% 0.09/0.17 thf(f93,plain,(
% 0.09/0.17 $false | (spl0_2 | ~spl0_4 | ~spl0_5 | ~spl0_8)),
% 0.09/0.17 inference(trivial_inequality_removal,[],[f92])).
% 0.09/0.17 thf(f94,plain,(
% 0.09/0.17 spl0_2 | ~spl0_4 | ~spl0_5 | ~spl0_8),
% 0.09/0.17 inference(avatar_contradiction_clause,[],[f93])).
% 0.09/0.17 thf(f95,plain,(
% 0.09/0.17 (((g @ $true)) != $true) | (~spl0_2 | spl0_4)),
% 0.09/0.17 inference(forward_demodulation,[],[f38,f23])).
% 0.09/0.17 thf(f96,plain,(
% 0.09/0.17 (x = $false) | ($true != $true) | spl0_3),
% 0.09/0.17 inference(constrained_superposition,[],[f27,f17])).
% 0.09/0.17 thf(f97,plain,(
% 0.09/0.17 (x = $false) | spl0_3),
% 0.09/0.17 inference(trivial_inequality_removal,[],[f96])).
% 0.09/0.17 thf(f98,plain,(
% 0.09/0.17 ($true = ((g @ $false))) | (~spl0_1 | spl0_3)),
% 0.09/0.17 inference(backward_demodulation,[],[f33,f97])).
% 0.09/0.17 thf(f100,plain,(
% 0.09/0.17 ($true = $false) | (~spl0_1 | spl0_3 | ~spl0_5 | ~spl0_8)),
% 0.09/0.17 inference(forward_demodulation,[],[f98,f65])).
% 0.09/0.17 thf(f101,plain,(
% 0.09/0.17 $false | (~spl0_1 | spl0_3 | ~spl0_5 | ~spl0_8)),
% 0.09/0.17 inference(trivial_inequality_removal,[],[f100])).
% 0.09/0.17 thf(f102,plain,(
% 0.09/0.17 ~spl0_1 | spl0_3 | ~spl0_5 | ~spl0_8),
% 0.09/0.17 inference(avatar_contradiction_clause,[],[f101])).
% 0.09/0.17 thf(f103,plain,(
% 0.09/0.17 (((g @ $true)) = $true) | (~spl0_6 | ~spl0_7)),
% 0.09/0.17 inference(forward_demodulation,[],[f57,f53])).
% 0.09/0.17 thf(f104,plain,(
% 0.09/0.17 $false | (~spl0_2 | spl0_4 | ~spl0_6 | ~spl0_7)),
% 0.09/0.17 inference(forward_subsumption_resolution,[],[f103,f95])).
% 0.09/0.17 thf(f105,plain,(
% 0.09/0.17 ~spl0_2 | spl0_4 | ~spl0_6 | ~spl0_7),
% 0.09/0.17 inference(avatar_contradiction_clause,[],[f104])).
% 0.09/0.17 thf(f108,plain,(
% 0.09/0.17 ($true = $false) | (spl0_1 | ~spl0_3 | ~spl0_6 | ~spl0_7)),
% 0.09/0.17 inference(forward_demodulation,[],[f103,f84])).
% 0.09/0.17 thf(f109,plain,(
% 0.09/0.17 $false | (spl0_1 | ~spl0_3 | ~spl0_6 | ~spl0_7)),
% 0.09/0.17 inference(trivial_inequality_removal,[],[f108])).
% 0.09/0.17 thf(f110,plain,(
% 0.09/0.17 spl0_1 | ~spl0_3 | ~spl0_6 | ~spl0_7),
% 0.09/0.17 inference(avatar_contradiction_clause,[],[f109])).
% 0.09/0.17 thf(f113,plain,(
% 0.09/0.17 ($true = $false) | (~spl0_6 | ~spl0_8)),
% 0.09/0.17 inference(backward_demodulation,[],[f53,f60])).
% 0.09/0.17 thf(f114,plain,(
% 0.09/0.17 $false | (~spl0_6 | ~spl0_8)),
% 0.09/0.17 inference(trivial_inequality_removal,[],[f113])).
% 0.09/0.17 thf(f115,plain,(
% 0.09/0.17 ~spl0_6 | ~spl0_8),
% 0.09/0.17 inference(avatar_contradiction_clause,[],[f114])).
% 0.09/0.17 cnf(s1, plain, ~spl0_1 | spl0_2, inference(sat_conversion,[],[f24])).
% 0.09/0.17 cnf(s2, plain, ~spl0_3 | spl0_4, inference(sat_conversion,[],[f31])).
% 0.09/0.17 cnf(s3, plain, spl0_1 | ~spl0_2, inference(sat_conversion,[],[f34])).
% 0.09/0.17 cnf(s4, plain, spl0_2 | spl0_3, inference(sat_conversion,[],[f36])).
% 0.09/0.17 cnf(s5, plain, ~spl0_2 | ~spl0_3, inference(sat_conversion,[],[f37])).
% 0.09/0.17 cnf(s6, plain, spl0_3 | ~spl0_4, inference(sat_conversion,[],[f39])).
% 0.09/0.17 cnf(s7, plain, spl0_5 | spl0_6, inference(sat_conversion,[],[f54])).
% 0.09/0.17 cnf(s8, plain, spl0_7 | spl0_8, inference(sat_conversion,[],[f61])).
% 0.09/0.17 cnf(s9, plain, ~spl0_5 | ~spl0_7, inference(sat_conversion,[],[f64])).
% 0.09/0.17 cnf(s10, plain, spl0_2 | ~spl0_4 | ~spl0_5 | ~spl0_8, inference(sat_conversion,[],[f94])).
% 0.09/0.17 cnf(s11, plain, ~spl0_1 | spl0_3 | ~spl0_5 | ~spl0_8, inference(sat_conversion,[],[f102])).
% 0.09/0.17 cnf(s12, plain, ~spl0_2 | spl0_4 | ~spl0_6 | ~spl0_7, inference(sat_conversion,[],[f105])).
% 0.09/0.17 cnf(s13, plain, spl0_1 | ~spl0_3 | ~spl0_6 | ~spl0_7, inference(sat_conversion,[],[f110])).
% 0.09/0.17 cnf(s14, plain, ~spl0_6 | ~spl0_8, inference(sat_conversion,[],[f115])).
% 0.09/0.17 cnf(s15, plain, ~spl0_6 | spl0_1, inference(rat,[],[s8,s13,s14,s4,s3])).
% 0.09/0.17 cnf(s16, plain, spl0_1, inference(rat,[],[s8,s10,s9,s7,s15,s2,s4,s3])).
% 0.09/0.17 cnf(s17, plain, spl0_2, inference(rat,[],[s1,s16])).
% 0.09/0.17 cnf(s18, plain, ~spl0_3, inference(rat,[],[s5,s17])).
% 0.09/0.17 cnf(s19, plain, ~spl0_4, inference(rat,[],[s6,s18])).
% 0.09/0.17 cnf(s20, plain, ~spl0_6, inference(rat,[],[s8,s12,s14,s17,s19])).
% 0.09/0.17 cnf(s21, plain, spl0_5, inference(rat,[],[s7,s20])).
% 0.09/0.17 cnf(s22, plain, ~spl0_7, inference(rat,[],[s9,s21])).
% 0.09/0.17 cnf(s23, plain, ~spl0_8, inference(rat,[],[s11,s18,s16,s21])).
% 0.09/0.17 cnf(s24, plain, $false, inference(rat,[],[s8,s23,s22])).
% 0.09/0.17 thf(f116,plain,(
% 0.09/0.17 $false),
% 0.09/0.17 inference(avatar_sat_refutation,[],[s24])).
% 0.09/0.17 % SZS output end Proof for theBenchmark
% 0.09/0.17 % (315155)------------------------------
% 0.09/0.17 % (315155)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.17 % (315155)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.17 % (315155)CaDiCaL version: 2.1.3
% 0.09/0.17 % (315155)Termination reason: Refutation
% 0.09/0.17 % (315155)Time elapsed: 0.002 s
% 0.09/0.17 % (315155)Peak memory usage: 13 MB
% 0.09/0.17 % (315155)Instructions burned: 5 (million)
% 0.09/0.17 % (315133)Success in time 0.034 s
% 0.09/0.17 % Vampire exiting
%------------------------------------------------------------------------------