%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV459^1 : TPTP v9.3.1. Released v7.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:38:40 AM UTC 2026
% Result : Theorem 0.19s 0.27s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV459^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n014.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 15:48:45 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running higher-order theorem proving
% 0.08/0.23 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.19/0.27 % (2838725)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.19/0.27 % (2838731)lrs+10_16_si=on:nwc=1.5:random_seed=1024627125:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.19/0.27 % (2838736)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.19/0.27 % (2838736)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.19/0.27 % (2838731)Instruction limit reached!
% 0.19/0.27 % (2838731)------------------------------
% 0.19/0.27 % (2838731)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.27 % (2838731)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.27 % (2838731)CaDiCaL version: 2.1.3
% 0.19/0.27 % (2838731)Termination reason: Instruction limit
% 0.19/0.27 % (2838731)Termination phase: Saturation
% 0.19/0.27 % (2838731)Time elapsed: 0.007 s
% 0.19/0.27 % (2838731)Peak memory usage: 12 MB
% 0.19/0.27 % (2838731)Instructions burned: 21 (million)
% 0.19/0.27 % (2838730)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3092394866:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.19/0.27 % (2838732)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=777409347:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.19/0.27 % (2838735)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=982705357:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.19/0.27 % (2838733)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=1273602083: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.19/0.27 % (2838734)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=4129564720:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.19/0.27 % (2838736)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=1127621478:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.19/0.27 % (2838732)Instruction limit reached!
% 0.19/0.27 % (2838732)------------------------------
% 0.19/0.27 % (2838732)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.27 % (2838732)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.27 % (2838732)CaDiCaL version: 2.1.3
% 0.19/0.27 % (2838732)Termination reason: Instruction limit
% 0.19/0.27 % (2838732)Termination phase: Saturation
% 0.19/0.27 % (2838732)Time elapsed: 0.003 s
% 0.19/0.27 % (2838732)Peak memory usage: 12 MB
% 0.19/0.27 % (2838732)Instructions burned: 4 (million)
% 0.19/0.27 % (2838733) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2838725-2838733"...
% 0.19/0.27 % (2838733)...printing done.
% 0.19/0.27 % (2838733)Refutation found. Thanks to Tanya!
% 0.19/0.27 % SZS status Theorem for theBenchmark
% 0.19/0.27 % SZS output start Proof for theBenchmark
% 0.19/0.27 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.19/0.27 thf(type_def_6, type, sK0: $tType).
% 0.19/0.27 thf(func_def_0, type, 'const/sets/SUBSET': !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > $o))).
% 0.19/0.27 thf(func_def_1, type, 'const/sets/IN': !>[X0: $tType]:((X0 > (X0 > $o) > $o))).
% 0.19/0.27 thf(func_def_2, type, 'const/sets/DELETE': !>[X0: $tType]:(((X0 > $o) > X0 > X0 > $o))).
% 0.19/0.27 thf(func_def_6, type, sK1: sK0).
% 0.19/0.27 thf(func_def_7, type, sK2: (sK0 > $o)).
% 0.19/0.27 thf(func_def_8, type, sK3: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 0.19/0.27 thf(func_def_9, type, vNOT: ($o > $o)).
% 0.19/0.27 thf(f2,axiom,(
% 0.19/0.27 ! [X0 : $tType,X1 : (X0 > $o),X2 : X0,X3 : X0] : ((('const/sets/IN' @ X0 @ X2 @ ('const/sets/DELETE' @ X0 @ X1 @ X3))) = (X2 != X3) & ('const/sets/IN' @ X0 @ X2 @ X1))),
% 0.19/0.27 file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/IN_DELETE_')).
% 0.19/0.27 thf(f3,axiom,(
% 0.19/0.27 ! [X0 : $tType,X2 : (X0 > $o),X1 : (X0 > $o)] : (! [X3 : X0] : (('const/sets/IN' @ X0 @ X3 @ X1) => ('const/sets/IN' @ X0 @ X3 @ X2)) = (('const/sets/SUBSET' @ X0 @ X1 @ X2)))),
% 0.19/0.27 file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/SUBSET_')).
% 0.19/0.28 thf(f4,conjecture,(
% 0.19/0.28 ! [X0 : $tType,X2 : (X0 > $o),X1 : X0] : ('const/sets/SUBSET' @ X0 @ ('const/sets/DELETE' @ X0 @ X2 @ X1) @ X2)),
% 0.19/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/DELETE_SUBSET_')).
% 0.19/0.28 thf(f5,negated_conjecture,(
% 0.19/0.28 ~ ! [X0 : $tType,X2 : (X0 > $o),X1 : X0] : ('const/sets/SUBSET' @ X0 @ ('const/sets/DELETE' @ X0 @ X2 @ X1) @ X2)),
% 0.19/0.28 inference(negated_conjecture,[status(cth)],[f4])).
% 0.19/0.28 thf(f6,plain,(
% 0.19/0.28 ~ ! [X0 : $tType,X1 : (X0 > $o),X2 : X0] : ('const/sets/SUBSET' @ X0 @ ('const/sets/DELETE' @ X0 @ X1 @ X2) @ X1)),
% 0.19/0.28 inference(rectify,[],[f5])).
% 0.19/0.28 thf(f7,plain,(
% 0.19/0.28 ~ ! [X0 : $tType,X2 : X0,X1 : (X0 > $o)] : ((('const/sets/SUBSET' @ X0 @ ('const/sets/DELETE' @ X0 @ X1 @ X2) @ X1)) = $true)),
% 0.19/0.28 inference(fool_elimination,[],[f6])).
% 0.19/0.28 thf(f8,plain,(
% 0.19/0.28 ! [X0 : $tType,X1 : (X0 > $o),X2 : X0,X3 : X0] : ((('const/sets/IN' @ X0 @ X2 @ ('const/sets/DELETE' @ X0 @ X1 @ X3))) = (X2 != X3) & ('const/sets/IN' @ X0 @ X2 @ X1))),
% 0.19/0.28 inference(rectify,[],[f2])).
% 0.19/0.28 thf(f9,plain,(
% 0.19/0.28 ! [X0 : $tType,X3 : X0,X1 : (X0 > $o),X2 : X0] : (((('const/sets/IN' @ X0 @ X2 @ ('const/sets/DELETE' @ X0 @ X1 @ X3))) = $true) <=> ((X2 != X3) & ((('const/sets/IN' @ X0 @ X2 @ X1)) = $true)))),
% 0.19/0.28 inference(fool_elimination,[],[f8])).
% 0.19/0.28 thf(f10,plain,(
% 0.19/0.28 ! [X0 : $tType,X1 : (X0 > $o),X2 : (X0 > $o)] : (! [X3 : X0] : (('const/sets/IN' @ X0 @ X3 @ X2) => ('const/sets/IN' @ X0 @ X3 @ X1)) = (('const/sets/SUBSET' @ X0 @ X2 @ X1)))),
% 0.19/0.28 inference(rectify,[],[f3])).
% 0.19/0.28 thf(f11,plain,(
% 0.19/0.28 ! [X0 : $tType,X1 : (X0 > $o),X2 : (X0 > $o)] : (((('const/sets/SUBSET' @ X0 @ X2 @ X1)) = $true) <=> ! [X3 : X0] : (((('const/sets/IN' @ X0 @ X3 @ X2)) = $true) => ((('const/sets/IN' @ X0 @ X3 @ X1)) = $true)))),
% 0.19/0.28 inference(fool_elimination,[],[f10])).
% 0.19/0.28 thf(f12,plain,(
% 0.19/0.28 ! [X0 : $tType,X2 : (X0 > $o),X1 : (X0 > $o)] : (((('const/sets/SUBSET' @ X0 @ X2 @ X1)) = $true) <=> ! [X3 : X0] : (((('const/sets/IN' @ X0 @ X3 @ X1)) = $true) | ((('const/sets/IN' @ X0 @ X3 @ X2)) != $true)))),
% 0.19/0.28 inference(ennf_transformation,[],[f11])).
% 0.19/0.28 thf(f13,plain,(
% 0.19/0.28 ? [X0 : $tType,X2 : X0,X1 : (X0 > $o)] : ((('const/sets/SUBSET' @ X0 @ ('const/sets/DELETE' @ X0 @ X1 @ X2) @ X1)) != $true)),
% 0.19/0.28 inference(ennf_transformation,[],[f7])).
% 0.19/0.28 thf(f14,plain,(
% 0.19/0.28 ! [X0 : $tType,X3 : X0,X1 : (X0 > $o),X2 : X0] : ((((('const/sets/IN' @ X0 @ X2 @ ('const/sets/DELETE' @ X0 @ X1 @ X3))) = $true) | ((X2 = X3) | ((('const/sets/IN' @ X0 @ X2 @ X1)) != $true))) & (((X2 != X3) & ((('const/sets/IN' @ X0 @ X2 @ X1)) = $true)) | ((('const/sets/IN' @ X0 @ X2 @ ('const/sets/DELETE' @ X0 @ X1 @ X3))) != $true)))),
% 0.19/0.28 inference(nnf_transformation,[],[f9])).
% 0.19/0.28 thf(f15,plain,(
% 0.19/0.28 ! [X0 : $tType,X3 : X0,X1 : (X0 > $o),X2 : X0] : ((((('const/sets/IN' @ X0 @ X2 @ ('const/sets/DELETE' @ X0 @ X1 @ X3))) = $true) | (X2 = X3) | ((('const/sets/IN' @ X0 @ X2 @ X1)) != $true)) & (((X2 != X3) & ((('const/sets/IN' @ X0 @ X2 @ X1)) = $true)) | ((('const/sets/IN' @ X0 @ X2 @ ('const/sets/DELETE' @ X0 @ X1 @ X3))) != $true)))),
% 0.19/0.28 inference(flattening,[],[f14])).
% 0.19/0.28 thf(f16,plain,(
% 0.19/0.28 ! [X0 : $tType,X1 : X0,X2 : (X0 > $o),X3 : X0] : ((((('const/sets/IN' @ X0 @ X3 @ ('const/sets/DELETE' @ X0 @ X2 @ X1))) = $true) | (X1 = X3) | ((('const/sets/IN' @ X0 @ X3 @ X2)) != $true)) & (((X1 != X3) & ((('const/sets/IN' @ X0 @ X3 @ X2)) = $true)) | ((('const/sets/IN' @ X0 @ X3 @ ('const/sets/DELETE' @ X0 @ X2 @ X1))) != $true)))),
% 0.19/0.28 inference(rectify,[],[f15])).
% 0.19/0.28 thf(f17,plain,(
% 0.19/0.28 ? [X0 : $tType,X1 : X0,X2 : (X0 > $o)] : ((('const/sets/SUBSET' @ X0 @ ('const/sets/DELETE' @ X0 @ X2 @ X1) @ X2)) != $true)),
% 0.19/0.28 inference(rectify,[],[f13])).
% 0.19/0.28 thf(f18,plain,(
% 0.19/0.28 ($true != (('const/sets/SUBSET' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK2 @ sK1) @ sK2)))),
% 0.19/0.28 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f17])).
% 0.19/0.28 thf(f19,plain,(
% 0.19/0.28 ! [X0 : $tType,X2 : (X0 > $o),X1 : (X0 > $o)] : ((((('const/sets/SUBSET' @ X0 @ X2 @ X1)) = $true) | ? [X3 : X0] : (((('const/sets/IN' @ X0 @ X3 @ X1)) != $true) & ((('const/sets/IN' @ X0 @ X3 @ X2)) = $true))) & (! [X3 : X0] : (((('const/sets/IN' @ X0 @ X3 @ X1)) = $true) | ((('const/sets/IN' @ X0 @ X3 @ X2)) != $true)) | ((('const/sets/SUBSET' @ X0 @ X2 @ X1)) != $true)))),
% 0.19/0.28 inference(nnf_transformation,[],[f12])).
% 0.19/0.28 thf(f20,plain,(
% 0.19/0.28 ! [X0 : $tType,X1 : (X0 > $o),X2 : (X0 > $o)] : ((((('const/sets/SUBSET' @ X0 @ X1 @ X2)) = $true) | ? [X3 : X0] : (((('const/sets/IN' @ X0 @ X3 @ X2)) != $true) & ((('const/sets/IN' @ X0 @ X3 @ X1)) = $true))) & (! [X4 : X0] : (((('const/sets/IN' @ X0 @ X4 @ X2)) = $true) | ($true != (('const/sets/IN' @ X0 @ X4 @ X1)))) | ((('const/sets/SUBSET' @ X0 @ X1 @ X2)) != $true)))),
% 0.19/0.28 inference(rectify,[],[f19])).
% 0.19/0.28 thf(f21,plain,(
% 0.19/0.28 ! [X0 : $tType,X1 : (X0 > $o),X2 : (X0 > $o)] : ((((('const/sets/SUBSET' @ X0 @ X1 @ X2)) = $true) | (($true != (('const/sets/IN' @ X0 @ (sK3 @ X0 @ X2 @ X1) @ X2))) & ((('const/sets/IN' @ X0 @ (sK3 @ X0 @ X2 @ X1) @ X1)) = $true))) & (! [X4 : X0] : (((('const/sets/IN' @ X0 @ X4 @ X2)) = $true) | ($true != (('const/sets/IN' @ X0 @ X4 @ X1)))) | ((('const/sets/SUBSET' @ X0 @ X1 @ X2)) != $true)))),
% 0.19/0.28 inference(skolemize,[status(esa),new_symbols(skolem,[vAPP]),skolemize(X3,sK3 @ X0 @ X2 @ X1)],[f20])).
% 0.19/0.28 thf(f23,plain,(
% 0.19/0.28 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : X0,X1 : X0] : (((('const/sets/IN' @ X0 @ X3 @ ('const/sets/DELETE' @ X0 @ X2 @ X1))) != $true) | ((('const/sets/IN' @ X0 @ X3 @ X2)) = $true)) )),
% 0.19/0.28 inference(cnf_transformation,[],[f16])).
% 0.19/0.28 thf(f26,plain,(
% 0.19/0.28 ($true != (('const/sets/SUBSET' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK2 @ sK1) @ sK2)))),
% 0.19/0.28 inference(cnf_transformation,[],[f18])).
% 0.19/0.28 thf(f28,plain,(
% 0.19/0.28 ( ! [X0 : $tType,X2 : (X0 > $o),X1 : (X0 > $o)] : (((('const/sets/IN' @ X0 @ (sK3 @ X0 @ X2 @ X1) @ X1)) = $true) | ((('const/sets/SUBSET' @ X0 @ X1 @ X2)) = $true)) )),
% 0.19/0.28 inference(cnf_transformation,[],[f21])).
% 0.19/0.28 thf(f29,plain,(
% 0.19/0.28 ( ! [X0 : $tType,X2 : (X0 > $o),X1 : (X0 > $o)] : (($true != (('const/sets/IN' @ X0 @ (sK3 @ X0 @ X2 @ X1) @ X2))) | ((('const/sets/SUBSET' @ X0 @ X1 @ X2)) = $true)) )),
% 0.19/0.28 inference(cnf_transformation,[],[f21])).
% 0.19/0.28 thf(f35,definition,(
% 0.19/0.28 spl4_1 <=> ($true = (('const/sets/SUBSET' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK2 @ sK1) @ sK2)))),
% 0.19/0.28 introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition])).
% 0.19/0.28 thf(f37,plain,(
% 0.19/0.28 ($true != (('const/sets/SUBSET' @ sK0 @ ('const/sets/DELETE' @ sK0 @ sK2 @ sK1) @ sK2))) | spl4_1),
% 0.19/0.28 inference(avatar_component_clause,[],[f35])).
% 0.19/0.28 thf(f38,plain,(
% 0.19/0.28 ~spl4_1),
% 0.19/0.28 inference(avatar_split_clause,[],[f26,f35])).
% 0.19/0.28 thf(f39,plain,(
% 0.19/0.28 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : X0,X1 : (X0 > $o)] : (((('const/sets/SUBSET' @ X0 @ ('const/sets/DELETE' @ X0 @ X2 @ X3) @ X1)) = $true) | ((('const/sets/IN' @ X0 @ (sK3 @ X0 @ X1 @ ('const/sets/DELETE' @ X0 @ X2 @ X3)) @ X2)) = $true) | ($true != $true)) )),
% 0.19/0.28 inference(superposition,[],[f23,f28])).
% 0.19/0.28 thf(f40,plain,(
% 0.19/0.28 ( ! [X0 : $tType,X2 : (X0 > $o),X3 : X0,X1 : (X0 > $o)] : (((('const/sets/IN' @ X0 @ (sK3 @ X0 @ X1 @ ('const/sets/DELETE' @ X0 @ X2 @ X3)) @ X2)) = $true) | ((('const/sets/SUBSET' @ X0 @ ('const/sets/DELETE' @ X0 @ X2 @ X3) @ X1)) = $true)) )),
% 0.19/0.28 inference(trivial_inequality_removal,[],[f39])).
% 0.19/0.28 thf(f48,plain,(
% 0.19/0.28 ( ! [X0 : $tType,X2 : X0,X1 : (X0 > $o)] : (((('const/sets/SUBSET' @ X0 @ ('const/sets/DELETE' @ X0 @ X1 @ X2) @ X1)) = $true) | ($true != $true) | ((('const/sets/SUBSET' @ X0 @ ('const/sets/DELETE' @ X0 @ X1 @ X2) @ X1)) = $true)) )),
% 0.19/0.28 inference(superposition,[],[f29,f40])).
% 0.19/0.28 thf(f51,plain,(
% 0.19/0.28 ( ! [X0 : $tType,X2 : X0,X1 : (X0 > $o)] : (((('const/sets/SUBSET' @ X0 @ ('const/sets/DELETE' @ X0 @ X1 @ X2) @ X1)) = $true) | ($true != $true)) )),
% 0.19/0.28 inference(duplicate_literal_removal,[],[f48])).
% 0.19/0.28 thf(f52,plain,(
% 0.19/0.28 ( ! [X0 : $tType,X2 : X0,X1 : (X0 > $o)] : (((('const/sets/SUBSET' @ X0 @ ('const/sets/DELETE' @ X0 @ X1 @ X2) @ X1)) = $true)) )),
% 0.19/0.28 inference(trivial_inequality_removal,[],[f51])).
% 0.19/0.28 thf(f61,plain,(
% 0.19/0.28 ($true != $true) | spl4_1),
% 0.19/0.28 inference(superposition,[],[f37,f52])).
% 0.19/0.28 thf(f64,plain,(
% 0.19/0.28 $false | spl4_1),
% 0.19/0.28 inference(trivial_inequality_removal,[],[f61])).
% 0.19/0.28 thf(f65,plain,(
% 0.19/0.28 spl4_1),
% 0.19/0.28 inference(avatar_contradiction_clause,[],[f64])).
% 0.19/0.28 cnf(s1, plain, ~spl4_1, inference(sat_conversion,[],[f38])).
% 0.19/0.28 cnf(s2, plain, spl4_1, inference(sat_conversion,[],[f65])).
% 0.19/0.28 cnf(s3, plain, $false, inference(rat,[],[s1,s2])).
% 0.19/0.28 thf(f66,plain,(
% 0.19/0.28 $false),
% 0.19/0.28 inference(avatar_sat_refutation,[],[s3])).
% 0.19/0.28 % SZS output end Proof for theBenchmark
% 0.19/0.28 % (2838733)------------------------------
% 0.19/0.28 % (2838733)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.28 % (2838733)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.28 % (2838733)CaDiCaL version: 2.1.3
% 0.19/0.28 % (2838733)Termination reason: Refutation
% 0.19/0.28 % (2838733)Time elapsed: 0.006 s
% 0.19/0.28 % (2838733)Peak memory usage: 13 MB
% 0.19/0.28 % (2838733)Instructions burned: 8 (million)
% 0.19/0.28 % (2838725)Success in time 0.039 s
% 0.19/0.28 % Vampire exiting
%------------------------------------------------------------------------------