%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU509^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:29:51 AM UTC 2026
% Result : Theorem 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU509^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n013.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 13:46:36 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.23 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.20/0.28 % (2137767)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.28 % (2137775)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=2131345347: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.28 % (2137775)Refutation not found, incomplete strategy
% 0.20/0.28 % (2137775)------------------------------
% 0.20/0.28 % (2137775)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (2137775)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (2137775)CaDiCaL version: 2.1.3
% 0.20/0.28 % (2137775)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.28 % (2137775)Time elapsed: 0.002 s
% 0.20/0.28 % (2137775)Peak memory usage: 12 MB
% 0.20/0.28 % (2137775)Instructions burned: 5 (million)
% 0.20/0.28 % (2137775)------------------------------
% 0.20/0.28 % (2137775)------------------------------
% 0.20/0.28 % (2137776)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=1695806919:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.20/0.28 % (2137773)lrs+10_16_si=on:nwc=1.5:random_seed=3416084882:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.20/0.28 % (2137774)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=3478476132:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.20/0.28 % (2137772)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1284352894:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.28 % (2137778)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.28 % (2137778)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.28 % (2137774)Refutation not found, incomplete strategy
% 0.20/0.28 % (2137774)------------------------------
% 0.20/0.28 % (2137774)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (2137774)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (2137774)CaDiCaL version: 2.1.3
% 0.20/0.28 % (2137774)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.28 % (2137774)Time elapsed: 0.002 s
% 0.20/0.28 % (2137774)Peak memory usage: 12 MB
% 0.20/0.28 % (2137774)Instructions burned: 2 (million)
% 0.20/0.28 % (2137774)------------------------------
% 0.20/0.28 % (2137774)------------------------------
% 0.20/0.28 % (2137772) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2137767-2137772"...
% 0.20/0.28 % (2137776) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2137767-2137776"...
% 0.20/0.28 % (2137773) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2137767-2137773"...
% 0.20/0.28 % (2137778)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=539683309:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.20/0.28 % (2137772)...printing done.
% 0.20/0.28 % (2137776)...printing done.
% 0.20/0.28 % (2137780)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=331720422:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.20/0.28 % (2137773)...printing done.
% 0.20/0.28 % (2137776)Refutation found. Thanks to Tanya!
% 0.20/0.28 % SZS status Theorem for theBenchmark
% 0.20/0.28 % SZS output start Proof for theBenchmark
% 0.20/0.28 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.20/0.28 thf(func_def_0, type, in: ($i > $i > $o)).
% 0.20/0.28 thf(func_def_2, type, emptysetE: $o).
% 0.20/0.28 thf(func_def_4, type, setext: $o).
% 0.20/0.28 thf(func_def_5, type, nonempty: ($i > $o)).
% 0.20/0.28 thf(func_def_8, type, db0: !>[X0: $tType]:(X0)).
% 0.20/0.28 thf(func_def_9, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.20/0.28 thf(func_def_10, type, vNOT: ($o > $o)).
% 0.20/0.28 thf(func_def_11, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.20/0.28 thf(func_def_15, type, sK3: ($i > $i > $i)).
% 0.20/0.28 thf(func_def_16, type, sK4: ($i > $i > $i)).
% 0.20/0.28 thf(func_def_18, type, sK6: $o).
% 0.20/0.28 thf(f1,axiom,(
% 0.20/0.28 (emptysetE = ! [X0 : $i] : ((in @ X0 @ emptyset) => ! [X1 : $o] : X1))),
% 0.20/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptysetE)).
% 0.20/0.28 thf(f2,axiom,(
% 0.20/0.28 (setext = ! [X0 : $i,X1 : $i] : (! [X2 : $i] : ((in @ X2 @ X0) => (in @ X2 @ X1)) => (! [X2 : $i] : ((in @ X2 @ X1) => (in @ X2 @ X0)) => (X0 = X1))))),
% 0.20/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setext)).
% 0.20/0.28 thf(f3,axiom,(
% 0.20/0.28 (nonempty = (^[X0 : $i] : ((X0 != emptyset))))),
% 0.20/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p',nonempty)).
% 0.20/0.28 thf(f4,conjecture,(
% 0.20/0.28 emptysetE => (setext => ! [X0 : $i] : ((nonempty @ X0) => ? [X1 : $i] : (in @ X1 @ X0)))),
% 0.20/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p',nonemptyE1)).
% 0.20/0.28 thf(f5,negated_conjecture,(
% 0.20/0.28 ~(emptysetE => (setext => ! [X0 : $i] : ((nonempty @ X0) => ? [X1 : $i] : (in @ X1 @ X0))))),
% 0.20/0.28 inference(negated_conjecture,[status(cth)],[f4])).
% 0.20/0.28 thf(f6,plain,(
% 0.20/0.28 (emptysetE = ! [X0 : $i] : ((in @ X0 @ emptyset) => ! [X1 : $o] : X1))),
% 0.20/0.28 inference(rectify,[],[f1])).
% 0.20/0.28 thf(f7,plain,(
% 0.20/0.28 (emptysetE = $true) <=> ! [X0 : $i] : ((((in @ X0 @ emptyset)) = $true) => ! [X1 : $o] : ($true = X1))),
% 0.20/0.28 inference(fool_elimination,[],[f6])).
% 0.20/0.28 thf(f8,plain,(
% 0.20/0.28 ~(emptysetE => (setext => ! [X0 : $i] : ((nonempty @ X0) => ? [X1 : $i] : (in @ X1 @ X0))))),
% 0.20/0.28 inference(rectify,[],[f5])).
% 0.20/0.28 thf(f9,plain,(
% 0.20/0.28 ~((emptysetE = $true) => ((setext = $true) => ! [X0 : $i] : ((((nonempty @ X0)) = $true) => ? [X1 : $i] : (((in @ X1 @ X0)) = $true))))),
% 0.20/0.28 inference(fool_elimination,[],[f8])).
% 0.20/0.28 thf(f10,plain,(
% 0.20/0.28 (nonempty = (^[Y0 : $i]: (~ (emptyset = Y0))))),
% 0.20/0.28 inference(fool_elimination,[],[f3])).
% 0.20/0.28 thf(f11,plain,(
% 0.20/0.28 (setext = ! [X0 : $i,X1 : $i] : (! [X2 : $i] : ((in @ X2 @ X0) => (in @ X2 @ X1)) => (! [X3 : $i] : ((in @ X3 @ X1) => (in @ X3 @ X0)) => (X0 = X1))))),
% 0.20/0.28 inference(rectify,[],[f2])).
% 0.20/0.28 thf(f12,plain,(
% 0.20/0.28 ! [X0 : $i,X1 : $i] : (! [X2 : $i] : ((((in @ X2 @ X0)) = $true) => (((in @ X2 @ X1)) = $true)) => (! [X3 : $i] : (($true = ((in @ X3 @ X1))) => ($true = ((in @ X3 @ X0)))) => (X0 = X1))) <=> (setext = $true)),
% 0.20/0.28 inference(fool_elimination,[],[f11])).
% 0.20/0.28 thf(f13,plain,(
% 0.20/0.28 ! [X0 : $i] : (! [X1 : $o] : ($true = X1) | (((in @ X0 @ emptyset)) != $true)) <=> (emptysetE = $true)),
% 0.20/0.28 inference(ennf_transformation,[],[f7])).
% 0.20/0.28 thf(f14,plain,(
% 0.20/0.28 ! [X0 : $i,X1 : $i] : (((X0 = X1) | ? [X3 : $i] : (($true = ((in @ X3 @ X1))) & ($true != ((in @ X3 @ X0))))) | ? [X2 : $i] : ((((in @ X2 @ X1)) != $true) & (((in @ X2 @ X0)) = $true))) <=> (setext = $true)),
% 0.20/0.28 inference(ennf_transformation,[],[f12])).
% 0.20/0.28 thf(f15,plain,(
% 0.20/0.28 (setext = $true) <=> ! [X0 : $i,X1 : $i] : (? [X2 : $i] : ((((in @ X2 @ X1)) != $true) & (((in @ X2 @ X0)) = $true)) | (X0 = X1) | ? [X3 : $i] : (($true = ((in @ X3 @ X1))) & ($true != ((in @ X3 @ X0)))))),
% 0.20/0.28 inference(flattening,[],[f14])).
% 0.20/0.28 thf(f16,plain,(
% 0.20/0.28 (? [X0 : $i] : ((((nonempty @ X0)) = $true) & ! [X1 : $i] : (((in @ X1 @ X0)) != $true)) & (setext = $true)) & (emptysetE = $true)),
% 0.20/0.28 inference(ennf_transformation,[],[f9])).
% 0.20/0.28 thf(f17,plain,(
% 0.20/0.28 (setext = $true) & ? [X0 : $i] : ((((nonempty @ X0)) = $true) & ! [X1 : $i] : (((in @ X1 @ X0)) != $true)) & (emptysetE = $true)),
% 0.20/0.28 inference(flattening,[],[f16])).
% 0.20/0.28 thf(f18,plain,(
% 0.20/0.28 (setext = $true) & ((((nonempty @ sK0)) = $true) & ! [X1 : $i] : ($true != ((in @ X1 @ sK0)))) & (emptysetE = $true)),
% 0.20/0.28 inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f17])).
% 0.20/0.28 thf(f19,plain,(
% 0.20/0.28 ((setext = $true) | ? [X0 : $i,X1 : $i] : (! [X2 : $i] : ((((in @ X2 @ X1)) = $true) | (((in @ X2 @ X0)) != $true)) & (X0 != X1) & ! [X3 : $i] : (($true != ((in @ X3 @ X1))) | ($true = ((in @ X3 @ X0)))))) & (! [X0 : $i,X1 : $i] : (? [X2 : $i] : ((((in @ X2 @ X1)) != $true) & (((in @ X2 @ X0)) = $true)) | (X0 = X1) | ? [X3 : $i] : (($true = ((in @ X3 @ X1))) & ($true != ((in @ X3 @ X0))))) | (setext != $true))),
% 0.20/0.28 inference(nnf_transformation,[],[f15])).
% 0.20/0.28 thf(f20,plain,(
% 0.20/0.28 ((setext = $true) | ? [X0 : $i,X1 : $i] : (! [X2 : $i] : ((((in @ X2 @ X1)) = $true) | (((in @ X2 @ X0)) != $true)) & (X0 != X1) & ! [X3 : $i] : (($true != ((in @ X3 @ X1))) | ($true = ((in @ X3 @ X0)))))) & (! [X4 : $i,X5 : $i] : (? [X6 : $i] : ((((in @ X6 @ X5)) != $true) & (((in @ X6 @ X4)) = $true)) | (X4 = X5) | ? [X7 : $i] : (($true = ((in @ X7 @ X5))) & (((in @ X7 @ X4)) != $true))) | (setext != $true))),
% 0.20/0.28 inference(rectify,[],[f19])).
% 0.20/0.28 thf(f21,plain,(
% 0.20/0.28 ((setext = $true) | (! [X2 : $i] : (($true = ((in @ X2 @ sK2))) | (((in @ X2 @ sK1)) != $true)) & (sK2 != sK1) & ! [X3 : $i] : (($true != ((in @ X3 @ sK2))) | ($true = ((in @ X3 @ sK1)))))) & (! [X4 : $i,X5 : $i] : (((((in @ (sK3 @ X5 @ X4) @ X5)) != $true) & (((in @ (sK3 @ X5 @ X4) @ X4)) = $true)) | (X4 = X5) | ((((in @ (sK4 @ X5 @ X4) @ X5)) = $true) & (((in @ (sK4 @ X5 @ X4) @ X4)) != $true))) | (setext != $true))),
% 0.20/0.28 inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,vAPP,vAPP]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X7,sK4 @ X5 @ X4),skolemize(X7,sK4 @ X5 @ X4)],[f20])).
% 0.20/0.28 thf(f22,plain,(
% 0.20/0.28 (! [X0 : $i] : (! [X1 : $o] : ($true = X1) | (((in @ X0 @ emptyset)) != $true)) | (emptysetE != $true)) & ((emptysetE = $true) | ? [X0 : $i] : (? [X1 : $o] : ($true != X1) & (((in @ X0 @ emptyset)) = $true)))),
% 0.20/0.28 inference(nnf_transformation,[],[f13])).
% 0.20/0.28 thf(f23,plain,(
% 0.20/0.28 (! [X0 : $i] : (! [X1 : $o] : ($true = X1) | (((in @ X0 @ emptyset)) != $true)) | (emptysetE != $true)) & ((emptysetE = $true) | ? [X2 : $i] : (? [X3 : $o] : ($true != X3) & ($true = ((in @ X2 @ emptyset)))))),
% 0.20/0.28 inference(rectify,[],[f22])).
% 0.20/0.28 thf(f24,plain,(
% 0.20/0.28 (! [X0 : $i] : (! [X1 : $o] : ($true = X1) | (((in @ X0 @ emptyset)) != $true)) | (emptysetE != $true)) & ((emptysetE = $true) | ((sK6 != $true) & (((in @ sK5 @ emptyset)) = $true)))),
% 0.20/0.28 inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6]),skolemize(X2,sK5),skolemize(X3,sK6)],[f23])).
% 0.20/0.28 thf(f25,plain,(
% 0.20/0.28 (emptysetE = $true)),
% 0.20/0.28 inference(cnf_transformation,[],[f18])).
% 0.20/0.28 thf(f26,plain,(
% 0.20/0.28 ( ! [X1 : $i] : (($true != ((in @ X1 @ sK0)))) )),
% 0.20/0.28 inference(cnf_transformation,[],[f18])).
% 0.20/0.28 thf(f27,plain,(
% 0.20/0.28 (((nonempty @ sK0)) = $true)),
% 0.20/0.28 inference(cnf_transformation,[],[f18])).
% 0.20/0.28 thf(f28,plain,(
% 0.20/0.28 (setext = $true)),
% 0.20/0.28 inference(cnf_transformation,[],[f18])).
% 0.20/0.28 thf(f30,plain,(
% 0.20/0.28 ( ! [X4 : $i,X5 : $i] : ((((in @ (sK4 @ X5 @ X4) @ X5)) = $true) | (setext != $true) | (((in @ (sK3 @ X5 @ X4) @ X4)) = $true) | (X4 = X5)) )),
% 0.20/0.28 inference(cnf_transformation,[],[f21])).
% 0.20/0.28 thf(f36,plain,(
% 0.20/0.28 (nonempty = (^[Y0 : $i]: (~ (emptyset = Y0))))),
% 0.20/0.28 inference(cnf_transformation,[],[f10])).
% 0.20/0.28 thf(f39,plain,(
% 0.20/0.28 ( ! [X0 : $i,X1 : $o] : ((((in @ X0 @ emptyset)) != $true) | (emptysetE != $true) | ($true = X1)) )),
% 0.20/0.28 inference(cnf_transformation,[],[f24])).
% 0.20/0.28 thf(f43,plain,(
% 0.20/0.28 ( ! [X0 : $i,X1 : $o] : ((((in @ X0 @ emptyset)) != $true) | ($true = X1)) )),
% 0.20/0.28 inference(forward_subsumption_resolution,[],[f39,f25])).
% 0.20/0.28 thf(f44,plain,(
% 0.20/0.28 ( ! [X1 : $i] : (((((^[Y0 : $i]: (~ (emptyset = Y0))) @ X1)) = ((nonempty @ X1)))) )),
% 0.20/0.28 inference(argument_congruence,[],[f36])).
% 0.20/0.28 thf(f45,plain,(
% 0.20/0.28 ( ! [X1 : $i] : ((((nonempty @ X1)) = $false) | ((((^[Y0 : $i]: (~ (emptyset = Y0))) @ X1)) = $true)) )),
% 0.20/0.28 inference(iff_proxy_clausification,[],[f44])).
% 0.20/0.28 thf(f50,plain,(
% 0.20/0.28 ( ! [X1 : $i] : (($true = ((~ (emptyset = X1)))) | (((nonempty @ X1)) = $false)) )),
% 0.20/0.28 inference(beta-eta_normalization,[],[f45])).
% 0.20/0.28 thf(f51,plain,(
% 0.20/0.28 ( ! [X1 : $i] : ((((nonempty @ X1)) = $false) | (((emptyset = X1)) = $false)) )),
% 0.20/0.28 inference(not_proxy_clausification,[],[f50])).
% 0.20/0.28 thf(f52,plain,(
% 0.20/0.28 ( ! [X1 : $i] : ((((nonempty @ X1)) = $false) | (emptyset != X1)) )),
% 0.20/0.28 inference(equality_proxy_clausification,[],[f51])).
% 0.20/0.28 thf(f53,plain,(
% 0.20/0.28 ($true = $false) | (emptyset != sK0)),
% 0.20/0.28 inference(superposition,[],[f52,f27])).
% 0.20/0.28 thf(f57,plain,(
% 0.20/0.28 (emptyset != sK0)),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f53])).
% 0.20/0.28 thf(f60,plain,(
% 0.20/0.28 ( ! [X4 : $i,X5 : $i] : ((((in @ (sK3 @ X5 @ X4) @ X4)) = $true) | (((in @ (sK4 @ X5 @ X4) @ X5)) = $true) | (X4 = X5)) )),
% 0.20/0.28 inference(forward_subsumption_resolution,[],[f30,f28])).
% 0.20/0.28 thf(f62,plain,(
% 0.20/0.28 ( ! [X0 : $i] : (($true != $true) | (sK0 = X0) | (((in @ (sK3 @ sK0 @ X0) @ X0)) = $true)) )),
% 0.20/0.28 inference(superposition,[],[f26,f60])).
% 0.20/0.28 thf(f64,plain,(
% 0.20/0.28 ( ! [X0 : $i] : ((((in @ (sK3 @ sK0 @ X0) @ X0)) = $true) | (sK0 = X0)) )),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f62])).
% 0.20/0.28 thf(f66,plain,(
% 0.20/0.28 ( ! [X0 : $o] : (($true != $true) | ($true = X0) | (emptyset = sK0)) )),
% 0.20/0.28 inference(superposition,[],[f43,f64])).
% 0.20/0.28 thf(f67,plain,(
% 0.20/0.28 ( ! [X0 : $o] : ((emptyset = sK0) | ($true = X0)) )),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f66])).
% 0.20/0.28 thf(f68,plain,(
% 0.20/0.28 ( ! [X0 : $o] : (($true = X0)) )),
% 0.20/0.28 inference(forward_subsumption_resolution,[],[f67,f57])).
% 0.20/0.28 thf(f74,plain,(
% 0.20/0.28 ($true != $true)),
% 0.20/0.28 inference(superposition,[],[f26,f68])).
% 0.20/0.28 thf(f77,plain,(
% 0.20/0.28 $false),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f74])).
% 0.20/0.28 % SZS output end Proof for theBenchmark
% 0.20/0.28 % (2137776)------------------------------
% 0.20/0.28 % (2137776)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (2137776)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (2137776)CaDiCaL version: 2.1.3
% 0.20/0.28 % (2137776)Termination reason: Refutation
% 0.20/0.28 % (2137776)Time elapsed: 0.005 s
% 0.20/0.28 % (2137776)Peak memory usage: 12 MB
% 0.20/0.28 % (2137776)Instructions burned: 6 (million)
% 0.20/0.28 % (2137767)Success in time 0.037 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------