↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SYO500^1 : 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 : 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:48:08 AM UTC 2026

% Result   : Theorem 0.20s 0.29s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO500^1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.20  % Computer : n004.cluster.edu
% 0.08/0.20  % Model    : x86_64 x86_64
% 0.08/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20  % Memory   : 8046.5625MB
% 0.08/0.20  % OS       : Linux 6.8.0-71-generic
% 0.08/0.20  % CPULimit : 300
% 0.08/0.20  % WCLimit  : 300
% 0.08/0.20  % DateTime : Tue Sep 29 17:11:07 UTC 2026
% 0.08/0.20  % CPUTime  : 
% 0.08/0.20  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23  Running higher-order theorem proving
% 0.08/0.24  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.20/0.29  % (1584870)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.29  % (1584879)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=1815090574:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.20/0.29  % (1584879)Refutation not found, incomplete strategy
% 0.20/0.29  % (1584879)------------------------------
% 0.20/0.29  % (1584879)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29  % (1584879)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29  % (1584879)CaDiCaL version: 2.1.3
% 0.20/0.29  % (1584879)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.29  % (1584879)Time elapsed: 0.001 s
% 0.20/0.29  % (1584879)Peak memory usage: 11 MB
% 0.20/0.29  % (1584879)Instructions burned: 1 (million)
% 0.20/0.29  % (1584879)------------------------------
% 0.20/0.29  % (1584879)------------------------------
% 0.20/0.29  % (1584881)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.20/0.29  % (1584881)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.20/0.29  % (1584880)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=4149994809:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.20/0.29  % (1584876)lrs+10_16_si=on:nwc=1.5:random_seed=225565963:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.20/0.29  % (1584875)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=147859844:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.29  % (1584877)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1650526972:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.20/0.29  % (1584878)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=1178332613: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.20/0.29  % (1584881)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=868239193:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.20/0.29  % (1584877)Refutation not found, incomplete strategy
% 0.20/0.29  % (1584877)------------------------------
% 0.20/0.29  % (1584877)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29  % (1584877)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29  % (1584877)CaDiCaL version: 2.1.3
% 0.20/0.29  % (1584877)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.29  % (1584877)Time elapsed: 0.001 s
% 0.20/0.29  % (1584877)Peak memory usage: 11 MB
% 0.20/0.29  % (1584876)Refutation not found, incomplete strategy
% 0.20/0.29  % (1584876)------------------------------
% 0.20/0.29  % (1584876)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29  % (1584875)Refutation not found, incomplete strategy
% 0.20/0.29  % (1584875)------------------------------
% 0.20/0.29  % (1584875)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29  % (1584876)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29  % (1584875)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29  % (1584876)CaDiCaL version: 2.1.3
% 0.20/0.29  % (1584876)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.29  % (1584876)Time elapsed: 0.001 s
% 0.20/0.29  % (1584876)Peak memory usage: 11 MB
% 0.20/0.29  % (1584875)CaDiCaL version: 2.1.3
% 0.20/0.29  % (1584875)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.29  % (1584875)Time elapsed: 0.001 s
% 0.20/0.29  % (1584875)Peak memory usage: 12 MB
% 0.20/0.29  % (1584877)------------------------------
% 0.20/0.29  % (1584877)------------------------------
% 0.20/0.29  % (1584876)------------------------------
% 0.20/0.29  % (1584876)------------------------------
% 0.20/0.29  % (1584875)------------------------------
% 0.20/0.29  % (1584875)------------------------------
% 0.20/0.29  % (1584880) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1584870-1584880"...
% 0.20/0.29  % (1584878) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1584870-1584878"...
% 0.20/0.29  % (1584880)...printing done.
% 0.20/0.29  % (1584878)...printing done.
% 0.20/0.29  % (1584883)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=2752413245:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.20/0.29  % (1584881) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1584870-1584881"...
% 0.20/0.29  % (1584880)Refutation found. Thanks to Tanya!
% 0.20/0.29  % SZS status Theorem for theBenchmark
% 0.20/0.29  % SZS output start Proof for theBenchmark
% 0.20/0.29  thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.20/0.29  thf(func_def_0, type, f: ($o > $o)).
% 0.20/0.29  thf(func_def_1, type, x: $o).
% 0.20/0.29  thf(f1,conjecture,(
% 0.20/0.29    (((f @ (f @ (f @ x)))) = ((f @ x)))),
% 0.20/0.29    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con)).
% 0.20/0.29  thf(f2,negated_conjecture,(
% 0.20/0.29    ~ (((f @ (f @ (f @ x)))) = ((f @ x)))),
% 0.20/0.29    inference(negated_conjecture,[status(cth)],[f1])).
% 0.20/0.29  thf(f3,plain,(
% 0.20/0.29    (((f @ x)) != ((f @ (f @ (f @ x)))))),
% 0.20/0.29    inference(flattening,[],[f2])).
% 0.20/0.29  thf(f4,plain,(
% 0.20/0.29    (((f @ x)) != ((f @ (f @ (f @ x)))))),
% 0.20/0.29    inference(cnf_transformation,[],[f3])).
% 0.20/0.29  thf(f6,definition,(
% 0.20/0.29    ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.20/0.29    introduced(theory,[fool_exhaustiveness_axiom])).
% 0.20/0.29  thf(f7,plain,(
% 0.20/0.29    (((f @ (f @ (f @ x)))) = $true) | (((f @ x)) = $true)),
% 0.20/0.29    inference(xor_proxy_clausification,[],[f4])).
% 0.20/0.29  thf(f8,plain,(
% 0.20/0.29    (((f @ x)) = $false) | (((f @ (f @ (f @ x)))) = $false)),
% 0.20/0.29    inference(xor_proxy_clausification,[],[f4])).
% 0.20/0.29  thf(f10,definition,(
% 0.20/0.29    spl0_1 <=> (((f @ (f @ (f @ x)))) = $false)),
% 0.20/0.29    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition])).
% 0.20/0.29  thf(f11,plain,(
% 0.20/0.29    (((f @ (f @ (f @ x)))) = $false) | ~spl0_1),
% 0.20/0.29    inference(avatar_component_clause,[],[f10])).
% 0.20/0.29  thf(f13,definition,(
% 0.20/0.29    spl0_2 <=> (((f @ x)) = $false)),
% 0.20/0.29    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition])).
% 0.20/0.29  thf(f14,plain,(
% 0.20/0.29    (((f @ x)) = $false) | ~spl0_2),
% 0.20/0.29    inference(avatar_component_clause,[],[f13])).
% 0.20/0.29  thf(f15,plain,(
% 0.20/0.29    spl0_1 | spl0_2),
% 0.20/0.29    inference(avatar_split_clause,[],[f8,f13,f10])).
% 0.20/0.29  thf(f17,definition,(
% 0.20/0.29    spl0_3 <=> (((f @ (f @ (f @ x)))) = $true)),
% 0.20/0.29    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition])).
% 0.20/0.29  thf(f18,plain,(
% 0.20/0.29    (((f @ (f @ (f @ x)))) = $true) | ~spl0_3),
% 0.20/0.29    inference(avatar_component_clause,[],[f17])).
% 0.20/0.29  thf(f20,definition,(
% 0.20/0.29    spl0_4 <=> (((f @ x)) = $true)),
% 0.20/0.29    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition])).
% 0.20/0.29  thf(f21,plain,(
% 0.20/0.29    (((f @ x)) = $true) | ~spl0_4),
% 0.20/0.29    inference(avatar_component_clause,[],[f20])).
% 0.20/0.29  thf(f22,plain,(
% 0.20/0.29    spl0_3 | spl0_4),
% 0.20/0.29    inference(avatar_split_clause,[],[f7,f20,f17])).
% 0.20/0.29  thf(f23,plain,(
% 0.20/0.29    (((f @ (f @ $false))) = $true) | (~spl0_2 | ~spl0_3)),
% 0.20/0.29    inference(backward_demodulation,[],[f18,f14])).
% 0.20/0.29  thf(f26,plain,(
% 0.20/0.29    ($false = ((f @ $true))) | (x = $false) | ~spl0_2),
% 0.20/0.29    inference(constrained_superposition,[],[f14,f6])).
% 0.20/0.29  thf(f28,plain,(
% 0.20/0.29    ($true = ((f @ $true))) | (((f @ $false)) = $false) | (~spl0_2 | ~spl0_3)),
% 0.20/0.29    inference(constrained_superposition,[],[f23,f6])).
% 0.20/0.29  thf(f36,definition,(
% 0.20/0.29    spl0_5 <=> ($false = ((f @ $true)))),
% 0.20/0.29    introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition])).
% 0.20/0.29  thf(f37,plain,(
% 0.20/0.29    ($false = ((f @ $true))) | ~spl0_5),
% 0.20/0.29    inference(avatar_component_clause,[],[f36])).
% 0.20/0.29  thf(f39,definition,(
% 0.20/0.29    spl0_6 <=> (x = $false)),
% 0.20/0.29    introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition])).
% 0.20/0.29  thf(f40,plain,(
% 0.20/0.29    (x = $false) | ~spl0_6),
% 0.20/0.29    inference(avatar_component_clause,[],[f39])).
% 0.20/0.29  thf(f41,plain,(
% 0.20/0.29    spl0_5 | spl0_6 | ~spl0_2),
% 0.20/0.29    inference(avatar_split_clause,[],[f26,f13,f39,f36])).
% 0.20/0.29  thf(f43,definition,(
% 0.20/0.29    spl0_7 <=> ($true = ((f @ $true)))),
% 0.20/0.29    introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition])).
% 0.20/0.29  thf(f44,plain,(
% 0.20/0.29    ($true = ((f @ $true))) | ~spl0_7),
% 0.20/0.29    inference(avatar_component_clause,[],[f43])).
% 0.20/0.29  thf(f46,definition,(
% 0.20/0.29    spl0_8 <=> (((f @ $false)) = $false)),
% 0.20/0.29    introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition])).
% 0.20/0.29  thf(f47,plain,(
% 0.20/0.29    (((f @ $false)) = $false) | ~spl0_8),
% 0.20/0.29    inference(avatar_component_clause,[],[f46])).
% 0.20/0.29  thf(f49,plain,(
% 0.20/0.29    ($true = $false) | (~spl0_1 | ~spl0_3)),
% 0.20/0.29    inference(backward_demodulation,[],[f18,f11])).
% 0.20/0.29  thf(f50,plain,(
% 0.20/0.29    $false | (~spl0_1 | ~spl0_3)),
% 0.20/0.29    inference(trivial_inequality_removal,[],[f49])).
% 0.20/0.29  thf(f51,plain,(
% 0.20/0.29    ~spl0_1 | ~spl0_3),
% 0.20/0.29    inference(avatar_contradiction_clause,[],[f50])).
% 0.20/0.29  thf(f52,plain,(
% 0.20/0.29    (((f @ $false)) = $false) | ($true = $false) | (~spl0_2 | ~spl0_3 | ~spl0_5)),
% 0.20/0.29    inference(forward_demodulation,[],[f28,f37])).
% 0.20/0.29  thf(f53,plain,(
% 0.20/0.29    (((f @ $false)) = $false) | (~spl0_2 | ~spl0_3 | ~spl0_5)),
% 0.20/0.29    inference(trivial_inequality_removal,[],[f52])).
% 0.20/0.29  thf(f54,plain,(
% 0.20/0.29    ($true = $false) | (~spl0_5 | ~spl0_7)),
% 0.20/0.29    inference(forward_demodulation,[],[f44,f37])).
% 0.20/0.29  thf(f55,plain,(
% 0.20/0.29    $false | (~spl0_5 | ~spl0_7)),
% 0.20/0.29    inference(trivial_inequality_removal,[],[f54])).
% 0.20/0.29  thf(f56,plain,(
% 0.20/0.29    ~spl0_5 | ~spl0_7),
% 0.20/0.29    inference(avatar_contradiction_clause,[],[f55])).
% 0.20/0.29  thf(f58,plain,(
% 0.20/0.29    spl0_8 | ~spl0_2 | ~spl0_3 | ~spl0_5),
% 0.20/0.29    inference(avatar_split_clause,[],[f53,f36,f17,f13,f46])).
% 0.20/0.29  thf(f59,plain,(
% 0.20/0.29    ($true = ((f @ $false))) | (~spl0_2 | ~spl0_3 | ~spl0_8)),
% 0.20/0.29    inference(backward_demodulation,[],[f23,f47])).
% 0.20/0.29  thf(f60,plain,(
% 0.20/0.29    ($true = $false) | (~spl0_2 | ~spl0_3 | ~spl0_8)),
% 0.20/0.29    inference(forward_demodulation,[],[f59,f47])).
% 0.20/0.29  thf(f61,plain,(
% 0.20/0.29    $false | (~spl0_2 | ~spl0_3 | ~spl0_8)),
% 0.20/0.29    inference(trivial_inequality_removal,[],[f60])).
% 0.20/0.29  thf(f62,plain,(
% 0.20/0.29    ~spl0_2 | ~spl0_3 | ~spl0_8),
% 0.20/0.29    inference(avatar_contradiction_clause,[],[f61])).
% 0.20/0.29  thf(f63,plain,(
% 0.20/0.29    ($true = $false) | (~spl0_2 | ~spl0_4)),
% 0.20/0.29    inference(forward_demodulation,[],[f21,f14])).
% 0.20/0.29  thf(f64,plain,(
% 0.20/0.29    $false | (~spl0_2 | ~spl0_4)),
% 0.20/0.29    inference(trivial_inequality_removal,[],[f63])).
% 0.20/0.29  thf(f65,plain,(
% 0.20/0.29    ~spl0_2 | ~spl0_4),
% 0.20/0.29    inference(avatar_contradiction_clause,[],[f64])).
% 0.20/0.29  thf(f67,plain,(
% 0.20/0.29    (((f @ $false)) = $false) | (~spl0_2 | ~spl0_6)),
% 0.20/0.29    inference(backward_demodulation,[],[f14,f40])).
% 0.20/0.29  thf(f68,plain,(
% 0.20/0.29    spl0_8 | ~spl0_2 | ~spl0_6),
% 0.20/0.29    inference(avatar_split_clause,[],[f67,f39,f13,f46])).
% 0.20/0.29  thf(f69,plain,(
% 0.20/0.29    ($false = ((f @ (f @ $true)))) | (~spl0_1 | ~spl0_4)),
% 0.20/0.29    inference(backward_demodulation,[],[f11,f21])).
% 0.20/0.29  thf(f72,plain,(
% 0.20/0.29    (x = $false) | ($true = ((f @ $true))) | ~spl0_4),
% 0.20/0.29    inference(constrained_superposition,[],[f21,f6])).
% 0.20/0.29  thf(f73,plain,(
% 0.20/0.29    spl0_7 | spl0_6 | ~spl0_4),
% 0.20/0.29    inference(avatar_split_clause,[],[f72,f20,f39,f43])).
% 0.20/0.29  thf(f74,plain,(
% 0.20/0.29    ($true = ((f @ $false))) | (~spl0_4 | ~spl0_6)),
% 0.20/0.29    inference(backward_demodulation,[],[f21,f40])).
% 0.20/0.29  thf(f78,plain,(
% 0.20/0.29    ($false = ((f @ $true))) | ($false = ((f @ $true))) | (~spl0_1 | ~spl0_4)),
% 0.20/0.29    inference(constrained_superposition,[],[f69,f6])).
% 0.20/0.29  thf(f80,plain,(
% 0.20/0.29    ($false = ((f @ $true))) | (~spl0_1 | ~spl0_4)),
% 0.20/0.29    inference(duplicate_literal_removal,[],[f78])).
% 0.20/0.29  thf(f82,plain,(
% 0.20/0.29    spl0_5 | ~spl0_1 | ~spl0_4),
% 0.20/0.29    inference(avatar_split_clause,[],[f80,f20,f10,f36])).
% 0.20/0.29  thf(f83,plain,(
% 0.20/0.29    (((f @ $false)) = $false) | (~spl0_1 | ~spl0_4 | ~spl0_5)),
% 0.20/0.29    inference(backward_demodulation,[],[f69,f37])).
% 0.20/0.29  thf(f84,plain,(
% 0.20/0.29    spl0_8 | ~spl0_1 | ~spl0_4 | ~spl0_5),
% 0.20/0.29    inference(avatar_split_clause,[],[f83,f36,f20,f10,f46])).
% 0.20/0.29  thf(f85,plain,(
% 0.20/0.29    ($true = $false) | (~spl0_4 | ~spl0_6 | ~spl0_8)),
% 0.20/0.29    inference(backward_demodulation,[],[f74,f47])).
% 0.20/0.29  thf(f86,plain,(
% 0.20/0.29    $false | (~spl0_4 | ~spl0_6 | ~spl0_8)),
% 0.20/0.29    inference(trivial_inequality_removal,[],[f85])).
% 0.20/0.29  thf(f87,plain,(
% 0.20/0.29    ~spl0_4 | ~spl0_6 | ~spl0_8),
% 0.20/0.29    inference(avatar_contradiction_clause,[],[f86])).
% 0.20/0.29  cnf(s1, plain, spl0_1 | spl0_2, inference(sat_conversion,[],[f15])).
% 0.20/0.29  cnf(s2, plain, spl0_3 | spl0_4, inference(sat_conversion,[],[f22])).
% 0.20/0.29  cnf(s3, plain, ~spl0_2 | spl0_5 | spl0_6, inference(sat_conversion,[],[f41])).
% 0.20/0.29  cnf(s5, plain, ~spl0_1 | ~spl0_3, inference(sat_conversion,[],[f51])).
% 0.20/0.29  cnf(s6, plain, ~spl0_5 | ~spl0_7, inference(sat_conversion,[],[f56])).
% 0.20/0.29  cnf(s7, plain, ~spl0_2 | ~spl0_3 | ~spl0_5 | spl0_8, inference(sat_conversion,[],[f58])).
% 0.20/0.29  cnf(s8, plain, ~spl0_2 | ~spl0_3 | ~spl0_8, inference(sat_conversion,[],[f62])).
% 0.20/0.29  cnf(s9, plain, ~spl0_2 | ~spl0_4, inference(sat_conversion,[],[f65])).
% 0.20/0.29  cnf(s10, plain, ~spl0_2 | ~spl0_6 | spl0_8, inference(sat_conversion,[],[f68])).
% 0.20/0.29  cnf(s12, plain, ~spl0_4 | spl0_6 | spl0_7, inference(sat_conversion,[],[f73])).
% 0.20/0.29  cnf(s13, plain, ~spl0_1 | ~spl0_4 | spl0_5, inference(sat_conversion,[],[f82])).
% 0.20/0.29  cnf(s14, plain, ~spl0_1 | ~spl0_4 | ~spl0_5 | spl0_8, inference(sat_conversion,[],[f84])).
% 0.20/0.29  cnf(s15, plain, ~spl0_4 | ~spl0_6 | ~spl0_8, inference(sat_conversion,[],[f87])).
% 0.20/0.29  cnf(s16, plain, ~spl0_3 | spl0_8 | ~spl0_2, inference(rat,[],[s3,s10,s7])).
% 0.20/0.29  cnf(s17, plain, ~spl0_3 | ~spl0_2, inference(rat,[],[s16,s8])).
% 0.20/0.29  cnf(s18, plain, ~spl0_2, inference(rat,[],[s17,s2,s9])).
% 0.20/0.29  cnf(s19, plain, spl0_1, inference(rat,[],[s1,s18])).
% 0.20/0.29  cnf(s20, plain, ~spl0_3, inference(rat,[],[s5,s19])).
% 0.20/0.29  cnf(s21, plain, spl0_4, inference(rat,[],[s2,s20])).
% 0.20/0.29  cnf(s22, plain, spl0_5, inference(rat,[],[s13,s19,s21])).
% 0.20/0.29  cnf(s23, plain, ~spl0_7, inference(rat,[],[s6,s22])).
% 0.20/0.29  cnf(s24, plain, spl0_8, inference(rat,[],[s14,s21,s19,s22])).
% 0.20/0.29  cnf(s25, plain, spl0_6, inference(rat,[],[s12,s21,s23])).
% 0.20/0.29  cnf(s26, plain, $false, inference(rat,[],[s15,s21,s24,s25])).
% 0.20/0.29  thf(f88,plain,(
% 0.20/0.29    $false),
% 0.20/0.29    inference(avatar_sat_refutation,[],[s26])).
% 0.20/0.29  % SZS output end Proof for theBenchmark
% 0.20/0.29  % (1584880)------------------------------
% 0.20/0.29  % (1584880)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29  % (1584880)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29  % (1584880)CaDiCaL version: 2.1.3
% 0.20/0.29  % (1584880)Termination reason: Refutation
% 0.20/0.29  % (1584880)Time elapsed: 0.004 s
% 0.20/0.29  % (1584880)Peak memory usage: 13 MB
% 0.20/0.29  % (1584880)Instructions burned: 4 (million)
% 0.20/0.29  % (1584870)Success in time 0.041 s
% 0.20/0.29  % Vampire exiting
%------------------------------------------------------------------------------