%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO499^1 : 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 : n004.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:50:19 AM UTC 2026
% Result : Theorem 0.18s 0.26s
% Output : Refutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO499^1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18 % Computer : n004.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 17:10:37 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22 Running first-order model finding
% 0.07/0.22 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.18/0.26 % (1584014)Will run a generic schedule for satisfiability detection.
% 0.18/0.26 % (1584020)% WARNING: option uhcvi not known.
% 0.18/0.26 % (1584020)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=580406784:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.26 % (1584020)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.18/0.26 % (1584020)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.18/0.26 % (1584020) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1584014-1584020"...
% 0.18/0.26 % (1584021)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=497073934:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.26 % (1584019)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4933054_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.26 % (1584020)...printing done.
% 0.18/0.26 % (1584022)dis+10_1_sil=32000:sp=arity:random_seed=4116571242:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.26 % Exception at run slice level
% 0.18/0.26 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.18/0.26 % (1584023)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1591865912:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.26 % (1584020)Refutation found. Thanks to Tanya!
% 0.18/0.26 % SZS status Theorem for theBenchmark
% 0.18/0.26 % SZS output start Proof for theBenchmark
% 0.18/0.26 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.18/0.26 thf(func_def_0, type, a: $o).
% 0.18/0.26 thf(func_def_1, type, b: $o).
% 0.18/0.26 thf(func_def_2, type, c: $o).
% 0.18/0.26 thf(func_def_3, type, f: ($o > $i)).
% 0.18/0.26 thf(func_def_4, type, f1: ($o > $i)).
% 0.18/0.26 thf(func_def_5, type, f2: ($o > $i)).
% 0.18/0.26 thf(func_def_6, type, g: ($o > $i)).
% 0.18/0.26 thf(func_def_7, type, g1: ($o > $i)).
% 0.18/0.26 thf(func_def_8, type, g2: ($o > $i)).
% 0.18/0.26 thf(f1,conjecture,(
% 0.18/0.26 (((f2 @ c)) != ((g2 @ b))) | (((f2 @ b)) = ((g2 @ c))) | (((f1 @ c)) != ((g1 @ a))) | (((f1 @ a)) = ((g1 @ c))) | (((f @ b)) != ((g @ a))) | (((f @ a)) = ((g @ b)))),
% 0.18/0.26 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con)).
% 0.18/0.26 thf(f2,negated_conjecture,(
% 0.18/0.26 ~((((f2 @ c)) != ((g2 @ b))) | (((f2 @ b)) = ((g2 @ c))) | (((f1 @ c)) != ((g1 @ a))) | (((f1 @ a)) = ((g1 @ c))) | (((f @ b)) != ((g @ a))) | (((f @ a)) = ((g @ b))))),
% 0.18/0.26 inference(negated_conjecture,[status(cth)],[f1])).
% 0.18/0.26 thf(f3,plain,(
% 0.18/0.26 (((f2 @ c)) = ((g2 @ b))) & (((f2 @ b)) != ((g2 @ c))) & (((f1 @ c)) = ((g1 @ a))) & (((f1 @ a)) != ((g1 @ c))) & (((f @ b)) = ((g @ a))) & (((f @ a)) != ((g @ b)))),
% 0.18/0.26 inference(ennf_transformation,[],[f2])).
% 0.18/0.26 thf(f4,plain,(
% 0.18/0.26 (((f @ a)) != ((g @ b)))),
% 0.18/0.26 inference(cnf_transformation,[],[f3])).
% 0.18/0.26 thf(f5,plain,(
% 0.18/0.26 (((f @ b)) = ((g @ a)))),
% 0.18/0.26 inference(cnf_transformation,[],[f3])).
% 0.18/0.26 thf(f6,plain,(
% 0.18/0.26 (((f1 @ a)) != ((g1 @ c)))),
% 0.18/0.26 inference(cnf_transformation,[],[f3])).
% 0.18/0.26 thf(f7,plain,(
% 0.18/0.26 (((f1 @ c)) = ((g1 @ a)))),
% 0.18/0.26 inference(cnf_transformation,[],[f3])).
% 0.18/0.26 thf(f8,plain,(
% 0.18/0.26 (((f2 @ b)) != ((g2 @ c)))),
% 0.18/0.26 inference(cnf_transformation,[],[f3])).
% 0.18/0.26 thf(f9,plain,(
% 0.18/0.26 (((f2 @ c)) = ((g2 @ b)))),
% 0.18/0.26 inference(cnf_transformation,[],[f3])).
% 0.18/0.26 thf(f11,definition,(
% 0.18/0.26 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.18/0.26 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.18/0.26 thf(f14,plain,(
% 0.18/0.26 (((f1 @ c)) = ((g1 @ $true))) | (a = $false)),
% 0.18/0.26 inference(constrained_superposition,[],[f7,f11])).
% 0.18/0.26 thf(f15,plain,(
% 0.18/0.26 (((f @ b)) = ((g @ $true))) | (a = $false)),
% 0.18/0.26 inference(constrained_superposition,[],[f5,f11])).
% 0.18/0.26 thf(f16,plain,(
% 0.18/0.26 (((f2 @ c)) = ((g2 @ $true))) | (b = $false)),
% 0.18/0.26 inference(constrained_superposition,[],[f9,f11])).
% 0.18/0.26 thf(f17,plain,(
% 0.18/0.26 (((f @ a)) != ((g @ $true))) | (b = $false)),
% 0.18/0.26 inference(constrained_superposition,[],[f4,f11])).
% 0.18/0.26 thf(f18,plain,(
% 0.18/0.26 (((f2 @ b)) != ((g2 @ $true))) | (c = $false)),
% 0.18/0.26 inference(constrained_superposition,[],[f8,f11])).
% 0.18/0.26 thf(f19,plain,(
% 0.18/0.26 (((f1 @ a)) != ((g1 @ $true))) | (c = $false)),
% 0.18/0.26 inference(constrained_superposition,[],[f6,f11])).
% 0.18/0.26 thf(f26,definition,(
% 0.18/0.26 spl0_1 <=> (c = $false)),
% 0.18/0.26 introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition])).
% 0.18/0.26 thf(f27,plain,(
% 0.18/0.26 (c != $false) | spl0_1),
% 0.18/0.26 inference(avatar_component_clause,[],[f26])).
% 0.18/0.27 thf(f28,plain,(
% 0.18/0.27 (c = $false) | ~spl0_1),
% 0.18/0.27 inference(avatar_component_clause,[],[f26])).
% 0.18/0.27 thf(f30,definition,(
% 0.18/0.27 spl0_2 <=> (((f1 @ a)) = ((g1 @ $true)))),
% 0.18/0.27 introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition])).
% 0.18/0.27 thf(f32,plain,(
% 0.18/0.27 (((f1 @ a)) != ((g1 @ $true))) | spl0_2),
% 0.18/0.27 inference(avatar_component_clause,[],[f30])).
% 0.18/0.27 thf(f33,plain,(
% 0.18/0.27 spl0_1 | ~spl0_2),
% 0.18/0.27 inference(avatar_split_clause,[],[f19,f30,f26])).
% 0.18/0.27 thf(f35,definition,(
% 0.18/0.27 spl0_3 <=> (((f2 @ b)) = ((g2 @ $true)))),
% 0.18/0.27 introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition])).
% 0.18/0.27 thf(f37,plain,(
% 0.18/0.27 (((f2 @ b)) != ((g2 @ $true))) | spl0_3),
% 0.18/0.27 inference(avatar_component_clause,[],[f35])).
% 0.18/0.27 thf(f38,plain,(
% 0.18/0.27 spl0_1 | ~spl0_3),
% 0.18/0.27 inference(avatar_split_clause,[],[f18,f35,f26])).
% 0.18/0.27 thf(f40,definition,(
% 0.18/0.27 spl0_4 <=> (b = $false)),
% 0.18/0.27 introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition])).
% 0.18/0.27 thf(f41,plain,(
% 0.18/0.27 (b != $false) | spl0_4),
% 0.18/0.27 inference(avatar_component_clause,[],[f40])).
% 0.18/0.27 thf(f42,plain,(
% 0.18/0.27 (b = $false) | ~spl0_4),
% 0.18/0.27 inference(avatar_component_clause,[],[f40])).
% 0.18/0.27 thf(f44,definition,(
% 0.18/0.27 spl0_5 <=> (((f @ a)) = ((g @ $true)))),
% 0.18/0.27 introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition])).
% 0.18/0.27 thf(f46,plain,(
% 0.18/0.27 (((f @ a)) != ((g @ $true))) | spl0_5),
% 0.18/0.27 inference(avatar_component_clause,[],[f44])).
% 0.18/0.27 thf(f47,plain,(
% 0.18/0.27 spl0_4 | ~spl0_5),
% 0.18/0.27 inference(avatar_split_clause,[],[f17,f44,f40])).
% 0.18/0.27 thf(f49,definition,(
% 0.18/0.27 spl0_6 <=> (((f2 @ c)) = ((g2 @ $true)))),
% 0.18/0.27 introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition])).
% 0.18/0.27 thf(f51,plain,(
% 0.18/0.27 (((f2 @ c)) = ((g2 @ $true))) | ~spl0_6),
% 0.18/0.27 inference(avatar_component_clause,[],[f49])).
% 0.18/0.27 thf(f52,plain,(
% 0.18/0.27 spl0_4 | spl0_6),
% 0.18/0.27 inference(avatar_split_clause,[],[f16,f49,f40])).
% 0.18/0.27 thf(f54,definition,(
% 0.18/0.27 spl0_7 <=> (a = $false)),
% 0.18/0.27 introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition])).
% 0.18/0.27 thf(f55,plain,(
% 0.18/0.27 (a != $false) | spl0_7),
% 0.18/0.27 inference(avatar_component_clause,[],[f54])).
% 0.18/0.27 thf(f56,plain,(
% 0.18/0.27 (a = $false) | ~spl0_7),
% 0.18/0.27 inference(avatar_component_clause,[],[f54])).
% 0.18/0.27 thf(f58,definition,(
% 0.18/0.27 spl0_8 <=> (((f @ b)) = ((g @ $true)))),
% 0.18/0.27 introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition])).
% 0.18/0.27 thf(f60,plain,(
% 0.18/0.27 (((f @ b)) = ((g @ $true))) | ~spl0_8),
% 0.18/0.27 inference(avatar_component_clause,[],[f58])).
% 0.18/0.27 thf(f61,plain,(
% 0.18/0.27 spl0_7 | spl0_8),
% 0.18/0.27 inference(avatar_split_clause,[],[f15,f58,f54])).
% 0.18/0.27 thf(f63,definition,(
% 0.18/0.27 spl0_9 <=> (((f1 @ c)) = ((g1 @ $true)))),
% 0.18/0.27 introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition])).
% 0.18/0.27 thf(f65,plain,(
% 0.18/0.27 (((f1 @ c)) = ((g1 @ $true))) | ~spl0_9),
% 0.18/0.27 inference(avatar_component_clause,[],[f63])).
% 0.18/0.27 thf(f66,plain,(
% 0.18/0.27 spl0_7 | spl0_9),
% 0.18/0.27 inference(avatar_split_clause,[],[f14,f63,f54])).
% 0.18/0.27 thf(f68,plain,(
% 0.18/0.27 (((f2 @ c)) = ((g2 @ $false))) | ~spl0_4),
% 0.18/0.27 inference(constrained_superposition,[],[f9,f42])).
% 0.18/0.27 thf(f69,plain,(
% 0.18/0.27 (((f @ a)) != ((g @ $false))) | ~spl0_4),
% 0.18/0.27 inference(constrained_superposition,[],[f4,f42])).
% 0.18/0.27 thf(f72,plain,(
% 0.18/0.27 (((f1 @ c)) = ((g1 @ $false))) | ~spl0_7),
% 0.18/0.27 inference(constrained_superposition,[],[f7,f56])).
% 0.18/0.27 thf(f73,plain,(
% 0.18/0.27 (((f @ b)) = ((g @ $false))) | ~spl0_7),
% 0.18/0.27 inference(constrained_superposition,[],[f5,f56])).
% 0.18/0.27 thf(f75,plain,(
% 0.18/0.27 (((g @ $false)) = ((f @ $false))) | (~spl0_4 | ~spl0_7)),
% 0.18/0.27 inference(forward_demodulation,[],[f73,f42])).
% 0.18/0.27 thf(f80,plain,(
% 0.18/0.27 (((g @ $false)) != ((f @ $false))) | (~spl0_4 | ~spl0_7)),
% 0.18/0.27 inference(forward_demodulation,[],[f69,f56])).
% 0.18/0.27 thf(f81,plain,(
% 0.18/0.27 $false | (~spl0_4 | ~spl0_7)),
% 0.18/0.27 inference(forward_subsumption_resolution,[],[f80,f75])).
% 0.18/0.27 thf(f82,plain,(
% 0.18/0.27 ~spl0_4 | ~spl0_7),
% 0.18/0.27 inference(avatar_contradiction_clause,[],[f81])).
% 0.18/0.27 thf(f87,plain,(
% 0.18/0.27 (((f2 @ b)) != ((f2 @ c))) | (spl0_3 | ~spl0_6)),
% 0.18/0.27 inference(constrained_superposition,[],[f37,f51])).
% 0.18/0.27 thf(f89,plain,(
% 0.18/0.27 (((f2 @ b)) != ((f2 @ $true))) | (c = $false) | (spl0_3 | ~spl0_6)),
% 0.18/0.27 inference(constrained_superposition,[],[f87,f11])).
% 0.18/0.27 thf(f91,definition,(
% 0.18/0.27 spl0_10 <=> (((f2 @ b)) = ((f2 @ $true)))),
% 0.18/0.27 introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition])).
% 0.18/0.27 thf(f93,plain,(
% 0.18/0.27 (((f2 @ b)) != ((f2 @ $true))) | spl0_10),
% 0.18/0.27 inference(avatar_component_clause,[],[f91])).
% 0.18/0.27 thf(f94,plain,(
% 0.18/0.27 spl0_1 | ~spl0_10 | spl0_3 | ~spl0_6),
% 0.18/0.27 inference(avatar_split_clause,[],[f89,f49,f35,f91,f26])).
% 0.18/0.27 thf(f104,plain,(
% 0.18/0.27 (((f2 @ $true)) != ((f2 @ $true))) | (b = $false) | spl0_10),
% 0.18/0.27 inference(constrained_superposition,[],[f93,f11])).
% 0.18/0.27 thf(f105,plain,(
% 0.18/0.27 (b = $false) | spl0_10),
% 0.18/0.27 inference(trivial_inequality_removal,[],[f104])).
% 0.18/0.27 thf(f106,plain,(
% 0.18/0.27 $false | (spl0_4 | spl0_10)),
% 0.18/0.27 inference(forward_subsumption_resolution,[],[f105,f41])).
% 0.18/0.27 thf(f107,plain,(
% 0.18/0.27 spl0_4 | spl0_10),
% 0.18/0.27 inference(avatar_contradiction_clause,[],[f106])).
% 0.18/0.27 thf(f110,plain,(
% 0.18/0.27 (((f2 @ b)) != ((g2 @ $false))) | ~spl0_1),
% 0.18/0.27 inference(constrained_superposition,[],[f8,f28])).
% 0.18/0.27 thf(f111,plain,(
% 0.18/0.27 (((f1 @ a)) != ((g1 @ $false))) | ~spl0_1),
% 0.18/0.27 inference(constrained_superposition,[],[f6,f28])).
% 0.18/0.27 thf(f113,plain,(
% 0.18/0.27 (((g1 @ $false)) != ((f1 @ $false))) | (~spl0_1 | ~spl0_7)),
% 0.18/0.27 inference(forward_demodulation,[],[f111,f56])).
% 0.18/0.27 thf(f114,plain,(
% 0.18/0.27 (((f1 @ c)) != ((f1 @ $false))) | (~spl0_1 | ~spl0_7)),
% 0.18/0.27 inference(constrained_superposition,[],[f113,f72])).
% 0.18/0.27 thf(f115,plain,(
% 0.18/0.27 (((f1 @ $false)) != ((f1 @ $false))) | (~spl0_1 | ~spl0_7)),
% 0.18/0.27 inference(forward_demodulation,[],[f114,f28])).
% 0.18/0.27 thf(f116,plain,(
% 0.18/0.27 $false | (~spl0_1 | ~spl0_7)),
% 0.18/0.27 inference(trivial_inequality_removal,[],[f115])).
% 0.18/0.27 thf(f117,plain,(
% 0.18/0.27 ~spl0_1 | ~spl0_7),
% 0.18/0.27 inference(avatar_contradiction_clause,[],[f116])).
% 0.18/0.27 thf(f123,plain,(
% 0.18/0.27 (((f @ a)) != ((f @ b))) | (spl0_5 | ~spl0_8)),
% 0.18/0.27 inference(constrained_superposition,[],[f46,f60])).
% 0.18/0.27 thf(f126,plain,(
% 0.18/0.27 (((f @ a)) != ((f @ $true))) | (b = $false) | (spl0_5 | ~spl0_8)),
% 0.18/0.27 inference(constrained_superposition,[],[f123,f11])).
% 0.18/0.27 thf(f127,plain,(
% 0.18/0.27 (((f @ a)) != ((f @ $true))) | (spl0_4 | spl0_5 | ~spl0_8)),
% 0.18/0.27 inference(forward_subsumption_resolution,[],[f126,f41])).
% 0.18/0.27 thf(f155,plain,(
% 0.18/0.27 (((f @ $true)) != ((f @ $true))) | (a = $false) | (spl0_4 | spl0_5 | ~spl0_8)),
% 0.18/0.27 inference(constrained_superposition,[],[f127,f11])).
% 0.18/0.27 thf(f156,plain,(
% 0.18/0.27 (a = $false) | (spl0_4 | spl0_5 | ~spl0_8)),
% 0.18/0.27 inference(trivial_inequality_removal,[],[f155])).
% 0.18/0.27 thf(f157,plain,(
% 0.18/0.27 $false | (spl0_4 | spl0_5 | spl0_7 | ~spl0_8)),
% 0.18/0.27 inference(forward_subsumption_resolution,[],[f156,f55])).
% 0.18/0.27 thf(f158,plain,(
% 0.18/0.27 spl0_4 | spl0_5 | spl0_7 | ~spl0_8),
% 0.18/0.27 inference(avatar_contradiction_clause,[],[f157])).
% 0.18/0.27 thf(f160,plain,(
% 0.18/0.27 (((g2 @ $false)) = ((f2 @ $false))) | (~spl0_1 | ~spl0_4)),
% 0.18/0.27 inference(forward_demodulation,[],[f68,f28])).
% 0.18/0.27 thf(f188,plain,(
% 0.18/0.27 (((f1 @ a)) != ((f1 @ c))) | (spl0_2 | ~spl0_9)),
% 0.18/0.27 inference(constrained_superposition,[],[f32,f65])).
% 0.18/0.27 thf(f194,plain,(
% 0.18/0.27 (((f1 @ a)) != ((f1 @ $true))) | (c = $false) | (spl0_2 | ~spl0_9)),
% 0.18/0.27 inference(constrained_superposition,[],[f188,f11])).
% 0.18/0.27 thf(f195,plain,(
% 0.18/0.27 (((f1 @ a)) != ((f1 @ $true))) | (spl0_1 | spl0_2 | ~spl0_9)),
% 0.18/0.27 inference(forward_subsumption_resolution,[],[f194,f27])).
% 0.18/0.27 thf(f211,plain,(
% 0.18/0.27 (((f1 @ $true)) != ((f1 @ $true))) | (a = $false) | (spl0_1 | spl0_2 | ~spl0_9)),
% 0.18/0.27 inference(constrained_superposition,[],[f195,f11])).
% 0.18/0.27 thf(f212,plain,(
% 0.18/0.27 (a = $false) | (spl0_1 | spl0_2 | ~spl0_9)),
% 0.18/0.27 inference(trivial_inequality_removal,[],[f211])).
% 0.18/0.27 thf(f213,plain,(
% 0.18/0.27 $false | (spl0_1 | spl0_2 | spl0_7 | ~spl0_9)),
% 0.18/0.27 inference(forward_subsumption_resolution,[],[f212,f55])).
% 0.18/0.27 thf(f214,plain,(
% 0.18/0.27 spl0_1 | spl0_2 | spl0_7 | ~spl0_9),
% 0.18/0.27 inference(avatar_contradiction_clause,[],[f213])).
% 0.18/0.27 thf(f219,plain,(
% 0.18/0.27 (((g2 @ $false)) != ((f2 @ $false))) | (~spl0_1 | ~spl0_4)),
% 0.18/0.27 inference(forward_demodulation,[],[f110,f42])).
% 0.18/0.27 thf(f257,plain,(
% 0.18/0.27 $false | (~spl0_1 | ~spl0_4)),
% 0.18/0.27 inference(forward_subsumption_resolution,[],[f219,f160])).
% 0.18/0.27 thf(f258,plain,(
% 0.18/0.27 ~spl0_1 | ~spl0_4),
% 0.18/0.27 inference(avatar_contradiction_clause,[],[f257])).
% 0.18/0.27 cnf(s1, plain, spl0_1 | ~spl0_2, inference(sat_conversion,[],[f33])).
% 0.18/0.27 cnf(s2, plain, spl0_1 | ~spl0_3, inference(sat_conversion,[],[f38])).
% 0.18/0.27 cnf(s3, plain, spl0_4 | ~spl0_5, inference(sat_conversion,[],[f47])).
% 0.18/0.27 cnf(s4, plain, spl0_4 | spl0_6, inference(sat_conversion,[],[f52])).
% 0.18/0.27 cnf(s5, plain, spl0_7 | spl0_8, inference(sat_conversion,[],[f61])).
% 0.18/0.27 cnf(s6, plain, spl0_7 | spl0_9, inference(sat_conversion,[],[f66])).
% 0.18/0.27 cnf(s7, plain, ~spl0_4 | ~spl0_7, inference(sat_conversion,[],[f82])).
% 0.18/0.27 cnf(s8, plain, spl0_1 | spl0_3 | ~spl0_6 | ~spl0_10, inference(sat_conversion,[],[f94])).
% 0.18/0.27 cnf(s9, plain, spl0_4 | spl0_10, inference(sat_conversion,[],[f107])).
% 0.18/0.27 cnf(s10, plain, ~spl0_1 | ~spl0_7, inference(sat_conversion,[],[f117])).
% 0.18/0.27 cnf(s11, plain, spl0_4 | spl0_5 | spl0_7 | ~spl0_8, inference(sat_conversion,[],[f158])).
% 0.18/0.27 cnf(s18, plain, spl0_1 | spl0_2 | spl0_7 | ~spl0_9, inference(sat_conversion,[],[f214])).
% 0.18/0.27 cnf(s27, plain, ~spl0_1 | ~spl0_4, inference(sat_conversion,[],[f258])).
% 0.18/0.27 cnf(s28, plain, spl0_4 | spl0_1, inference(rat,[],[s8,s4,s9,s2])).
% 0.18/0.27 cnf(s29, plain, spl0_1, inference(rat,[],[s18,s6,s7,s28,s1])).
% 0.18/0.27 cnf(s30, plain, ~spl0_4, inference(rat,[],[s27,s29])).
% 0.18/0.27 cnf(s31, plain, ~spl0_7, inference(rat,[],[s10,s29])).
% 0.18/0.27 cnf(s34, plain, ~spl0_5, inference(rat,[],[s3,s30])).
% 0.18/0.27 cnf(s36, plain, spl0_8, inference(rat,[],[s5,s31])).
% 0.18/0.27 cnf(s37, plain, $false, inference(rat,[],[s11,s30,s31,s36,s34])).
% 0.18/0.27 thf(f259,plain,(
% 0.18/0.27 $false),
% 0.18/0.27 inference(avatar_sat_refutation,[],[s37])).
% 0.18/0.27 % SZS output end Proof for theBenchmark
% 0.18/0.27 % (1584020)------------------------------
% 0.18/0.27 % (1584020)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.27 % (1584020)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.27 % (1584020)CaDiCaL version: 2.1.3
% 0.18/0.27 % (1584020)Termination reason: Refutation
% 0.18/0.27 % (1584020)Time elapsed: 0.006 s
% 0.18/0.27 % (1584020)Peak memory usage: 13 MB
% 0.18/0.27 % (1584020)Instructions burned: 17 (million)
% 0.18/0.27 % (1584014)Success in time 0.037 s
% 0.18/0.27 % Vampire exiting
%------------------------------------------------------------------------------