%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO040^2 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.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.26s 0.37s
% Output : Refutation 0.26s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SYO040^2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.26 % Computer : n020.cluster.edu
% 0.10/0.26 % Model : x86_64 x86_64
% 0.10/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.26 % Memory : 8046.5625MB
% 0.10/0.26 % OS : Linux 6.8.0-71-generic
% 0.10/0.26 % CPULimit : 300
% 0.10/0.26 % WCLimit : 300
% 0.10/0.26 % DateTime : Tue Sep 29 16:24:59 UTC 2026
% 0.10/0.26 % CPUTime :
% 0.10/0.26 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.30 Running higher-order theorem proving
% 0.26/0.31 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.26/0.37 % (1248953)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.26/0.37 % (1248959)lrs+10_16_si=on:nwc=1.5:random_seed=1047683557:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.26/0.37 % (1248959)Refutation not found, incomplete strategy
% 0.26/0.37 % (1248959)------------------------------
% 0.26/0.37 % (1248959)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.37 % (1248959)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.37 % (1248959)CaDiCaL version: 2.1.3
% 0.26/0.37 % (1248959)Termination reason: Refutation not found, incomplete strategy
% 0.26/0.37 % (1248959)Time elapsed: 0.001 s
% 0.26/0.37 % (1248959)Peak memory usage: 12 MB
% 0.26/0.37 % (1248959)------------------------------
% 0.26/0.37 % (1248959)------------------------------
% 0.26/0.37 % (1248960)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=3171970276:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.26/0.37 % (1248958)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2854411961:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.26/0.37 % (1248964)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.26/0.37 % (1248964)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.26/0.37 % (1248958)Refutation not found, incomplete strategy
% 0.26/0.37 % (1248958)------------------------------
% 0.26/0.37 % (1248958)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.37 % (1248960)Refutation not found, incomplete strategy
% 0.26/0.37 % (1248960)------------------------------
% 0.26/0.37 % (1248960)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.37 % (1248961)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=838121670: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.26/0.37 % (1248960)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.37 % (1248958)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.37 % (1248958)CaDiCaL version: 2.1.3
% 0.26/0.37 % (1248958)Termination reason: Refutation not found, incomplete strategy
% 0.26/0.37 % (1248958)Time elapsed: 0.001 s
% 0.26/0.37 % (1248960)CaDiCaL version: 2.1.3
% 0.26/0.37 % (1248960)Termination reason: Refutation not found, incomplete strategy
% 0.26/0.37 % (1248960)Time elapsed: 0.001 s
% 0.26/0.37 % (1248960)Peak memory usage: 12 MB
% 0.26/0.37 % (1248958)Peak memory usage: 12 MB
% 0.26/0.37 % (1248963)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=4208213069:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.26/0.37 % (1248958)------------------------------
% 0.26/0.37 % (1248958)------------------------------
% 0.26/0.37 % (1248960)------------------------------
% 0.26/0.37 % (1248960)------------------------------
% 0.26/0.37 % (1248962)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3222815865:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.26/0.37 % (1248962)Refutation not found, incomplete strategy
% 0.26/0.37 % (1248962)------------------------------
% 0.26/0.37 % (1248962)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.37 % (1248962)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.37 % (1248962)CaDiCaL version: 2.1.3
% 0.26/0.37 % (1248962)Termination reason: Refutation not found, incomplete strategy
% 0.26/0.37 % (1248962)Time elapsed: 0.001 s
% 0.26/0.37 % (1248962)Peak memory usage: 11 MB
% 0.26/0.37 % (1248964)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=2165246690:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.26/0.37 % (1248961) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1248953-1248961"...
% 0.26/0.37 % (1248962)------------------------------
% 0.26/0.37 % (1248962)------------------------------
% 0.26/0.37 % (1248966)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=1381621277:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.26/0.37 % (1248961)...printing done.
% 0.26/0.37 % (1248966)Instruction limit reached!
% 0.26/0.37 % (1248966)------------------------------
% 0.26/0.37 % (1248966)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.37 % (1248966)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.37 % (1248966)CaDiCaL version: 2.1.3
% 0.26/0.37 % (1248966)Termination reason: Instruction limit
% 0.26/0.37 % (1248966)Termination phase: Saturation
% 0.26/0.37 % (1248966)Time elapsed: 0.002 s
% 0.26/0.37 % (1248966)Peak memory usage: 12 MB
% 0.26/0.37 % (1248966)Instructions burned: 3 (million)
% 0.26/0.37 % (1248961)Refutation found. Thanks to Tanya!
% 0.26/0.37 % SZS status Theorem for theBenchmark
% 0.26/0.37 % SZS output start Proof for theBenchmark
% 0.26/0.37 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.26/0.37 thf(func_def_0, type, f: ($o > $o)).
% 0.26/0.37 thf(func_def_1, type, h: ($o > $i)).
% 0.26/0.37 thf(func_def_2, type, x: $o).
% 0.26/0.37 thf(f1,conjecture,(
% 0.26/0.37 (((h @ (f @ (f @ (f @ x))))) = ((h @ (f @ x))))),
% 0.26/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',2)).
% 0.26/0.37 thf(f2,negated_conjecture,(
% 0.26/0.37 ~ (((h @ (f @ (f @ (f @ x))))) = ((h @ (f @ x))))),
% 0.26/0.37 inference(negated_conjecture,[status(cth)],[f1])).
% 0.26/0.37 thf(f3,plain,(
% 0.26/0.37 (((h @ (f @ (f @ (f @ x))))) != ((h @ (f @ x))))),
% 0.26/0.37 inference(flattening,[],[f2])).
% 0.26/0.37 thf(f4,plain,(
% 0.26/0.37 (((h @ (f @ (f @ (f @ x))))) != ((h @ (f @ x))))),
% 0.26/0.37 inference(cnf_transformation,[],[f3])).
% 0.26/0.37 thf(f7,definition,(
% 0.26/0.37 spl0_1 <=> (((h @ (f @ (f @ (f @ x))))) = ((h @ (f @ x))))),
% 0.26/0.37 introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition])).
% 0.26/0.37 thf(f9,plain,(
% 0.26/0.37 (((h @ (f @ (f @ (f @ x))))) != ((h @ (f @ x)))) | spl0_1),
% 0.26/0.37 inference(avatar_component_clause,[],[f7])).
% 0.26/0.37 thf(f10,plain,(
% 0.26/0.37 ~spl0_1),
% 0.26/0.37 inference(avatar_split_clause,[],[f4,f7])).
% 0.26/0.37 thf(f12,plain,(
% 0.26/0.37 (((f @ x)) = $false) | (((h @ (f @ (f @ $true)))) != ((h @ $true))) | spl0_1),
% 0.26/0.37 inference(fool_paramodulation,[],[f9])).
% 0.26/0.37 thf(f13,plain,(
% 0.26/0.37 (((h @ (f @ x))) != ((h @ (f @ $true)))) | (((f @ (f @ x))) = $false) | spl0_1),
% 0.26/0.37 inference(fool_paramodulation,[],[f9])).
% 0.26/0.37 thf(f14,plain,(
% 0.26/0.37 (((h @ (f @ x))) != ((h @ $true))) | (((f @ (f @ (f @ x)))) = $false) | spl0_1),
% 0.26/0.37 inference(fool_paramodulation,[],[f9])).
% 0.26/0.37 thf(f17,definition,(
% 0.26/0.37 spl0_2 <=> (((h @ (f @ x))) = ((h @ $true)))),
% 0.26/0.37 introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition])).
% 0.26/0.37 thf(f19,plain,(
% 0.26/0.37 (((h @ (f @ x))) != ((h @ $true))) | spl0_2),
% 0.26/0.37 inference(avatar_component_clause,[],[f17])).
% 0.26/0.37 thf(f21,definition,(
% 0.26/0.37 spl0_3 <=> (((f @ (f @ (f @ x)))) = $false)),
% 0.26/0.37 introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition])).
% 0.26/0.37 thf(f24,plain,(
% 0.26/0.37 ~spl0_2 | spl0_3 | spl0_1),
% 0.26/0.37 inference(avatar_split_clause,[],[f14,f7,f21,f17])).
% 0.26/0.37 thf(f26,definition,(
% 0.26/0.37 spl0_4 <=> (x = $false)),
% 0.26/0.37 introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition])).
% 0.26/0.37 thf(f36,definition,(
% 0.26/0.37 spl0_6 <=> (((h @ (f @ (f @ $true)))) = ((h @ $true)))),
% 0.26/0.37 introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition])).
% 0.26/0.37 thf(f40,definition,(
% 0.26/0.37 spl0_7 <=> (((f @ x)) = $false)),
% 0.26/0.37 introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition])).
% 0.26/0.37 thf(f41,plain,(
% 0.26/0.37 (((f @ x)) != $false) | spl0_7),
% 0.26/0.37 inference(avatar_component_clause,[],[f40])).
% 0.26/0.37 thf(f43,plain,(
% 0.26/0.37 ~spl0_6 | spl0_7 | spl0_1),
% 0.26/0.37 inference(avatar_split_clause,[],[f12,f7,f40,f36])).
% 0.26/0.37 thf(f45,definition,(
% 0.26/0.37 spl0_8 <=> (((f @ (f @ x))) = $false)),
% 0.26/0.37 introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition])).
% 0.26/0.37 thf(f47,plain,(
% 0.26/0.37 (((f @ (f @ x))) = $false) | ~spl0_8),
% 0.26/0.37 inference(avatar_component_clause,[],[f45])).
% 0.26/0.37 thf(f49,definition,(
% 0.26/0.37 spl0_9 <=> (((h @ (f @ x))) = ((h @ (f @ $true))))),
% 0.26/0.37 introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition])).
% 0.26/0.37 thf(f52,plain,(
% 0.26/0.37 spl0_8 | ~spl0_9 | spl0_1),
% 0.26/0.37 inference(avatar_split_clause,[],[f13,f7,f49,f45])).
% 0.26/0.37 thf(f53,plain,(
% 0.26/0.37 (((h @ (f @ $true))) != ((h @ $true))) | (x = $false) | spl0_2),
% 0.26/0.37 inference(fool_paramodulation,[],[f19])).
% 0.26/0.37 thf(f54,plain,(
% 0.26/0.37 (((f @ x)) = $false) | (((h @ $true)) != ((h @ $true))) | spl0_2),
% 0.26/0.37 inference(fool_paramodulation,[],[f19])).
% 0.26/0.37 thf(f56,plain,(
% 0.26/0.37 (((f @ x)) = $false) | spl0_2),
% 0.26/0.37 inference(trivial_inequality_removal,[],[f54])).
% 0.26/0.37 thf(f58,definition,(
% 0.26/0.37 spl0_10 <=> (((h @ (f @ $true))) = ((h @ $true)))),
% 0.26/0.37 introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition])).
% 0.26/0.37 thf(f60,plain,(
% 0.26/0.37 (((h @ (f @ $true))) != ((h @ $true))) | spl0_10),
% 0.26/0.37 inference(avatar_component_clause,[],[f58])).
% 0.26/0.37 thf(f62,plain,(
% 0.26/0.37 spl0_7 | spl0_2),
% 0.26/0.37 inference(avatar_split_clause,[],[f56,f17,f40])).
% 0.26/0.37 thf(f63,plain,(
% 0.26/0.37 ~spl0_10 | spl0_4 | spl0_2),
% 0.26/0.37 inference(avatar_split_clause,[],[f53,f17,f26,f58])).
% 0.26/0.37 thf(f64,plain,(
% 0.26/0.37 (((h @ $true)) != ((h @ $true))) | ($false = ((f @ $true))) | spl0_10),
% 0.26/0.37 inference(fool_paramodulation,[],[f60])).
% 0.26/0.37 thf(f65,plain,(
% 0.26/0.37 ($false = ((f @ $true))) | spl0_10),
% 0.26/0.37 inference(trivial_inequality_removal,[],[f64])).
% 0.26/0.37 thf(f67,definition,(
% 0.26/0.37 spl0_11 <=> ($false = ((f @ $true)))),
% 0.26/0.37 introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition])).
% 0.26/0.37 thf(f70,plain,(
% 0.26/0.37 spl0_11 | spl0_10),
% 0.26/0.37 inference(avatar_split_clause,[],[f65,f58,f67])).
% 0.26/0.37 thf(f71,definition,(
% 0.26/0.37 (((f @ (f @ (f @ x)))) != $false) | (((f @ x)) != $false) | (((h @ (f @ (f @ (f @ x))))) = ((h @ (f @ x))))),
% 0.26/0.37 introduced(theory,[theory_tautology_sat_conflict])).
% 0.26/0.37 thf(f72,definition,(
% 0.26/0.37 (((h @ (f @ x))) != ((h @ $true))) | (((h @ (f @ $true))) != ((h @ $true))) | (((h @ (f @ x))) = ((h @ (f @ $true))))),
% 0.26/0.37 introduced(theory,[theory_tautology_sat_conflict])).
% 0.26/0.37 thf(f73,plain,(
% 0.26/0.37 (x = $false) | ($false != ((f @ $true))) | spl0_7),
% 0.26/0.37 inference(fool_paramodulation,[],[f41])).
% 0.26/0.37 thf(f76,plain,(
% 0.26/0.37 ~spl0_11 | spl0_4 | spl0_7),
% 0.26/0.37 inference(avatar_split_clause,[],[f73,f40,f26,f67])).
% 0.26/0.37 thf(f78,plain,(
% 0.26/0.37 ($false = ((f @ $true))) | (((f @ x)) = $false) | ~spl0_8),
% 0.26/0.37 inference(fool_paramodulation,[],[f47])).
% 0.26/0.37 thf(f90,plain,(
% 0.26/0.37 ($false = ((f @ $true))) | (spl0_7 | ~spl0_8)),
% 0.26/0.37 inference(forward_subsumption_resolution,[],[f78,f41])).
% 0.26/0.37 thf(f91,plain,(
% 0.26/0.37 spl0_11 | spl0_7 | ~spl0_8),
% 0.26/0.37 inference(avatar_split_clause,[],[f90,f45,f40,f67])).
% 0.26/0.37 thf(f94,definition,(
% 0.26/0.37 (((f @ (f @ x))) != $false) | (((f @ x)) != $false) | (((h @ (f @ (f @ (f @ x))))) = ((h @ (f @ x))))),
% 0.26/0.37 introduced(theory,[theory_tautology_sat_conflict])).
% 0.26/0.37 thf(f101,definition,(
% 0.26/0.37 (((f @ x)) != $false) | ($false != ((f @ $true))) | (((h @ (f @ x))) = ((h @ (f @ $true))))),
% 0.26/0.37 introduced(theory,[theory_tautology_sat_conflict])).
% 0.26/0.37 thf(f103,definition,(
% 0.26/0.37 (x != $false) | (((f @ x)) != $false) | (((h @ (f @ (f @ (f @ x))))) = ((h @ (f @ x))))),
% 0.26/0.37 introduced(theory,[theory_tautology_sat_conflict])).
% 0.26/0.37 thf(f108,definition,(
% 0.26/0.37 ($false != ((f @ $true))) | (x != $false) | (((h @ (f @ x))) != ((h @ $true))) | (((h @ (f @ (f @ $true)))) = ((h @ $true)))),
% 0.26/0.37 introduced(theory,[theory_tautology_sat_conflict])).
% 0.26/0.37 cnf(s1, plain, ~spl0_1, inference(sat_conversion,[],[f10])).
% 0.26/0.37 cnf(s2, plain, spl0_1 | ~spl0_2 | spl0_3, inference(sat_conversion,[],[f24])).
% 0.26/0.37 cnf(s5, plain, spl0_1 | ~spl0_6 | spl0_7, inference(sat_conversion,[],[f43])).
% 0.26/0.37 cnf(s6, plain, spl0_1 | spl0_8 | ~spl0_9, inference(sat_conversion,[],[f52])).
% 0.26/0.37 cnf(s8, plain, spl0_2 | spl0_7, inference(sat_conversion,[],[f62])).
% 0.26/0.37 cnf(s9, plain, spl0_2 | spl0_4 | ~spl0_10, inference(sat_conversion,[],[f63])).
% 0.26/0.37 cnf(s10, plain, spl0_10 | spl0_11, inference(sat_conversion,[],[f70])).
% 0.26/0.37 cnf(s11, plain, spl0_1 | ~spl0_3 | ~spl0_7, inference(sat_conversion,[],[f71])).
% 0.26/0.37 cnf(s12, plain, ~spl0_2 | spl0_9 | ~spl0_10, inference(sat_conversion,[],[f72])).
% 0.26/0.37 cnf(s14, plain, spl0_4 | spl0_7 | ~spl0_11, inference(sat_conversion,[],[f76])).
% 0.26/0.37 cnf(s17, plain, spl0_7 | ~spl0_8 | spl0_11, inference(sat_conversion,[],[f91])).
% 0.26/0.37 cnf(s20, plain, spl0_1 | ~spl0_7 | ~spl0_8, inference(sat_conversion,[],[f94])).
% 0.26/0.37 cnf(s27, plain, ~spl0_7 | spl0_9 | ~spl0_11, inference(sat_conversion,[],[f101])).
% 0.26/0.37 cnf(s29, plain, spl0_1 | ~spl0_4 | ~spl0_7, inference(sat_conversion,[],[f103])).
% 0.26/0.37 cnf(s34, plain, ~spl0_2 | ~spl0_4 | spl0_6 | ~spl0_11, inference(sat_conversion,[],[f108])).
% 0.26/0.37 cnf(s38, plain, spl0_2, inference(rat,[],[s10,s27,s9,s6,s29,s20,s8,s1])).
% 0.26/0.37 cnf(s39, plain, spl0_3, inference(rat,[],[s2,s1,s38])).
% 0.26/0.37 cnf(s40, plain, ~spl0_7, inference(rat,[],[s11,s1,s39])).
% 0.26/0.37 cnf(s41, plain, ~spl0_6, inference(rat,[],[s5,s1,s40])).
% 0.26/0.37 cnf(s42, plain, spl0_11, inference(rat,[],[s6,s12,s17,s10,s1,s38,s40])).
% 0.26/0.37 cnf(s43, plain, spl0_4, inference(rat,[],[s14,s40,s42])).
% 0.26/0.37 cnf(s44, plain, $false, inference(rat,[],[s34,s41,s38,s42,s43])).
% 0.26/0.37 thf(f112,plain,(
% 0.26/0.37 $false),
% 0.26/0.37 inference(avatar_sat_refutation,[],[s44])).
% 0.26/0.37 % SZS output end Proof for theBenchmark
% 0.26/0.37 % (1248961)------------------------------
% 0.26/0.37 % (1248961)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.37 % (1248961)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.37 % (1248961)CaDiCaL version: 2.1.3
% 0.26/0.37 % (1248961)Termination reason: Refutation
% 0.26/0.37 % (1248961)Time elapsed: 0.006 s
% 0.26/0.37 % (1248961)Peak memory usage: 13 MB
% 0.26/0.37 % (1248961)Instructions burned: 4 (million)
% 0.26/0.37 % (1248953)Success in time 0.044 s
% 0.26/0.37 % Vampire exiting
%------------------------------------------------------------------------------