%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU716^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:30:56 AM UTC 2026
% Result : Theorem 0.23s 0.31s
% Output : Refutation 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU716^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 % Computer : n007.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Sep 29 14:12:48 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.24 Running higher-order theorem proving
% 0.09/0.25 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.23/0.31 % (3429429)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.23/0.31 % (3429439)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=587204739:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.23/0.31 % (3429434)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3344993567:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.23/0.31 % (3429436)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1951934523:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.23/0.31 % (3429437)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=4075439915: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.23/0.31 % (3429436)Refutation not found, incomplete strategy
% 0.23/0.31 % (3429436)------------------------------
% 0.23/0.31 % (3429436)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.31 % (3429436)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.31 % (3429436)CaDiCaL version: 2.1.3
% 0.23/0.31 % (3429436)Termination reason: Refutation not found, incomplete strategy
% 0.23/0.31 % (3429436)Time elapsed: 0.002 s
% 0.23/0.31 % (3429436)Peak memory usage: 12 MB
% 0.23/0.31 % (3429436)Instructions burned: 2 (million)
% 0.23/0.31 % (3429436)------------------------------
% 0.23/0.31 % (3429436)------------------------------
% 0.23/0.31 % (3429435)lrs+10_16_si=on:nwc=1.5:random_seed=1333498934:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.23/0.31 % (3429434) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3429429-3429434"...
% 0.23/0.31 % (3429439) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3429429-3429439"...
% 0.23/0.31 % (3429437) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3429429-3429437"...
% 0.23/0.31 % (3429434)...printing done.
% 0.23/0.31 % (3429440)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.23/0.31 % (3429440)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.23/0.31 % (3429434)Refutation found. Thanks to Tanya!
% 0.23/0.31 % SZS status Theorem for theBenchmark
% 0.23/0.31 % SZS output start Proof for theBenchmark
% 0.23/0.31 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.23/0.31 thf(func_def_0, type, in: ($i > $i > $o)).
% 0.23/0.31 thf(func_def_1, type, powerset: ($i > $i)).
% 0.23/0.31 thf(func_def_2, type, powersetE: $o).
% 0.23/0.31 thf(func_def_4, type, subset: ($i > $i > $o)).
% 0.23/0.31 thf(func_def_5, type, subsetI2: $o).
% 0.23/0.31 thf(func_def_13, type, sK5: ($i > $i > $i)).
% 0.23/0.31 thf(func_def_17, type, vNOT: ($o > $o)).
% 0.23/0.31 thf(f1,axiom,(
% 0.23/0.31 (powersetE = ! [X1 : $i,X0 : $i,X2 : $i] : ((in @ X1 @ (powerset @ X0)) => ((in @ X2 @ X1) => (in @ X2 @ X0))))),
% 0.23/0.31 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',powersetE)).
% 0.23/0.31 thf(f2,axiom,(
% 0.23/0.31 (! [X1 : $i,X0 : $i] : (! [X2 : $i] : ((in @ X2 @ X0) => (in @ X2 @ X1)) => (subset @ X0 @ X1)) = subsetI2)),
% 0.23/0.31 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetI2)).
% 0.23/0.31 thf(f3,conjecture,(
% 0.23/0.31 powersetE => (subsetI2 => ! [X1 : $i,X0 : $i] : ((in @ X1 @ (powerset @ X0)) => ! [X2 : $i] : ((in @ X2 @ (powerset @ X0)) => (! [X3 : $i] : ((in @ X3 @ X0) => ((in @ X3 @ X1) => (in @ X3 @ X2))) => (subset @ X1 @ X2)))))),
% 0.23/0.31 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetTI)).
% 0.23/0.31 thf(f4,negated_conjecture,(
% 0.23/0.31 ~(powersetE => (subsetI2 => ! [X1 : $i,X0 : $i] : ((in @ X1 @ (powerset @ X0)) => ! [X2 : $i] : ((in @ X2 @ (powerset @ X0)) => (! [X3 : $i] : ((in @ X3 @ X0) => ((in @ X3 @ X1) => (in @ X3 @ X2))) => (subset @ X1 @ X2))))))),
% 0.23/0.31 inference(negated_conjecture,[status(cth)],[f3])).
% 0.23/0.31 thf(f5,plain,(
% 0.23/0.31 (powersetE = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X0 @ (powerset @ X1)) => ((in @ X2 @ X0) => (in @ X2 @ X1))))),
% 0.23/0.31 inference(rectify,[],[f1])).
% 0.23/0.31 thf(f6,plain,(
% 0.23/0.31 ! [X0 : $i,X2 : $i,X1 : $i] : ((((in @ X0 @ (powerset @ X1))) = $true) => ((((in @ X2 @ X0)) = $true) => (((in @ X2 @ X1)) = $true))) <=> (powersetE = $true)),
% 0.23/0.31 inference(fool_elimination,[],[f5])).
% 0.23/0.31 thf(f7,plain,(
% 0.23/0.31 ~(powersetE => (subsetI2 => ! [X0 : $i,X1 : $i] : ((in @ X0 @ (powerset @ X1)) => ! [X2 : $i] : ((in @ X2 @ (powerset @ X1)) => (! [X3 : $i] : ((in @ X3 @ X1) => ((in @ X3 @ X0) => (in @ X3 @ X2))) => (subset @ X0 @ X2))))))),
% 0.23/0.31 inference(rectify,[],[f4])).
% 0.23/0.31 thf(f8,plain,(
% 0.23/0.31 ~((powersetE = $true) => ((subsetI2 = $true) => ! [X1 : $i,X0 : $i] : ((((in @ X0 @ (powerset @ X1))) = $true) => ! [X2 : $i] : ((((in @ X2 @ (powerset @ X1))) = $true) => (! [X3 : $i] : ((((in @ X3 @ X1)) = $true) => ((((in @ X3 @ X0)) = $true) => (((in @ X3 @ X2)) = $true))) => (((subset @ X0 @ X2)) = $true))))))),
% 0.23/0.31 inference(fool_elimination,[],[f7])).
% 0.23/0.31 thf(f9,plain,(
% 0.23/0.31 (! [X0 : $i,X1 : $i] : (! [X2 : $i] : ((in @ X2 @ X1) => (in @ X2 @ X0)) => (subset @ X1 @ X0)) = subsetI2)),
% 0.23/0.31 inference(rectify,[],[f2])).
% 0.23/0.31 thf(f10,plain,(
% 0.23/0.31 ! [X0 : $i,X1 : $i] : (! [X2 : $i] : ((((in @ X2 @ X1)) = $true) => (((in @ X2 @ X0)) = $true)) => (((subset @ X1 @ X0)) = $true)) <=> (subsetI2 = $true)),
% 0.23/0.31 inference(fool_elimination,[],[f9])).
% 0.23/0.31 thf(f11,plain,(
% 0.23/0.31 (? [X1 : $i,X0 : $i] : (? [X2 : $i] : (((((subset @ X0 @ X2)) != $true) & ! [X3 : $i] : (((((in @ X3 @ X2)) = $true) | (((in @ X3 @ X0)) != $true)) | (((in @ X3 @ X1)) != $true))) & (((in @ X2 @ (powerset @ X1))) = $true)) & (((in @ X0 @ (powerset @ X1))) = $true)) & (subsetI2 = $true)) & (powersetE = $true)),
% 0.23/0.31 inference(ennf_transformation,[],[f8])).
% 0.23/0.31 thf(f12,plain,(
% 0.23/0.31 (powersetE = $true) & (subsetI2 = $true) & ? [X0 : $i,X1 : $i] : (? [X2 : $i] : (! [X3 : $i] : ((((in @ X3 @ X1)) != $true) | (((in @ X3 @ X2)) = $true) | (((in @ X3 @ X0)) != $true)) & (((subset @ X0 @ X2)) != $true) & (((in @ X2 @ (powerset @ X1))) = $true)) & (((in @ X0 @ (powerset @ X1))) = $true))),
% 0.23/0.31 inference(flattening,[],[f11])).
% 0.23/0.31 thf(f13,plain,(
% 0.23/0.31 (subsetI2 = $true) <=> ! [X1 : $i,X0 : $i] : ((((subset @ X1 @ X0)) = $true) | ? [X2 : $i] : ((((in @ X2 @ X1)) = $true) & (((in @ X2 @ X0)) != $true)))),
% 0.23/0.31 inference(ennf_transformation,[],[f10])).
% 0.23/0.31 thf(f14,plain,(
% 0.23/0.31 ! [X0 : $i,X2 : $i,X1 : $i] : (((((in @ X2 @ X1)) = $true) | (((in @ X2 @ X0)) != $true)) | (((in @ X0 @ (powerset @ X1))) != $true)) <=> (powersetE = $true)),
% 0.23/0.31 inference(ennf_transformation,[],[f6])).
% 0.23/0.31 thf(f15,plain,(
% 0.23/0.31 (powersetE = $true) <=> ! [X1 : $i,X0 : $i,X2 : $i] : ((((in @ X2 @ X0)) != $true) | (((in @ X0 @ (powerset @ X1))) != $true) | (((in @ X2 @ X1)) = $true))),
% 0.23/0.31 inference(flattening,[],[f14])).
% 0.23/0.31 thf(f16,plain,(
% 0.23/0.31 (powersetE = $true) & (subsetI2 = $true) & ((! [X3 : $i] : ((((in @ X3 @ sK1)) != $true) | (((in @ X3 @ sK2)) = $true) | (((in @ X3 @ sK0)) != $true)) & (((subset @ sK0 @ sK2)) != $true) & (((in @ sK2 @ (powerset @ sK1))) = $true)) & (((in @ sK0 @ (powerset @ sK1))) = $true))),
% 0.23/0.31 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f12])).
% 0.23/0.31 thf(f17,plain,(
% 0.23/0.31 ((subsetI2 = $true) | ? [X1 : $i,X0 : $i] : ((((subset @ X1 @ X0)) != $true) & ! [X2 : $i] : ((((in @ X2 @ X1)) != $true) | (((in @ X2 @ X0)) = $true)))) & (! [X1 : $i,X0 : $i] : ((((subset @ X1 @ X0)) = $true) | ? [X2 : $i] : ((((in @ X2 @ X1)) = $true) & (((in @ X2 @ X0)) != $true))) | (subsetI2 != $true))),
% 0.23/0.31 inference(nnf_transformation,[],[f13])).
% 0.23/0.31 thf(f18,plain,(
% 0.23/0.31 ((subsetI2 = $true) | ? [X0 : $i,X1 : $i] : ((((subset @ X0 @ X1)) != $true) & ! [X2 : $i] : ((((in @ X2 @ X0)) != $true) | (((in @ X2 @ X1)) = $true)))) & (! [X3 : $i,X4 : $i] : ((((subset @ X3 @ X4)) = $true) | ? [X5 : $i] : ((((in @ X5 @ X3)) = $true) & (((in @ X5 @ X4)) != $true))) | (subsetI2 != $true))),
% 0.23/0.31 inference(rectify,[],[f17])).
% 0.23/0.31 thf(f19,plain,(
% 0.23/0.31 ((subsetI2 = $true) | ((((subset @ sK3 @ sK4)) != $true) & ! [X2 : $i] : ((((in @ X2 @ sK3)) != $true) | ($true = ((in @ X2 @ sK4)))))) & (! [X3 : $i,X4 : $i] : ((((subset @ X3 @ X4)) = $true) | ((((in @ (sK5 @ X4 @ X3) @ X3)) = $true) & (((in @ (sK5 @ X4 @ X3) @ X4)) != $true))) | (subsetI2 != $true))),
% 0.23/0.31 inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,vAPP]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X5,sK5 @ X4 @ X3)],[f18])).
% 0.23/0.31 thf(f20,plain,(
% 0.23/0.31 ((powersetE = $true) | ? [X1 : $i,X0 : $i,X2 : $i] : ((((in @ X2 @ X0)) = $true) & (((in @ X0 @ (powerset @ X1))) = $true) & (((in @ X2 @ X1)) != $true))) & (! [X1 : $i,X0 : $i,X2 : $i] : ((((in @ X2 @ X0)) != $true) | (((in @ X0 @ (powerset @ X1))) != $true) | (((in @ X2 @ X1)) = $true)) | (powersetE != $true))),
% 0.23/0.31 inference(nnf_transformation,[],[f15])).
% 0.23/0.31 thf(f21,plain,(
% 0.23/0.31 ((powersetE = $true) | ? [X0 : $i,X1 : $i,X2 : $i] : ((((in @ X2 @ X1)) = $true) & (((in @ X1 @ (powerset @ X0))) = $true) & (((in @ X2 @ X0)) != $true))) & (! [X3 : $i,X4 : $i,X5 : $i] : ((((in @ X5 @ X4)) != $true) | (((in @ X4 @ (powerset @ X3))) != $true) | (((in @ X5 @ X3)) = $true)) | (powersetE != $true))),
% 0.23/0.31 inference(rectify,[],[f20])).
% 0.23/0.31 thf(f22,plain,(
% 0.23/0.31 ((powersetE = $true) | ((((in @ sK8 @ sK7)) = $true) & (((in @ sK7 @ (powerset @ sK6))) = $true) & (((in @ sK8 @ sK6)) != $true))) & (! [X3 : $i,X4 : $i,X5 : $i] : ((((in @ X5 @ X4)) != $true) | (((in @ X4 @ (powerset @ X3))) != $true) | (((in @ X5 @ X3)) = $true)) | (powersetE != $true))),
% 0.23/0.31 inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8]),skolemize(X0,sK6),skolemize(X1,sK7),skolemize(X2,sK8)],[f21])).
% 0.23/0.31 thf(f23,plain,(
% 0.23/0.31 (((in @ sK0 @ (powerset @ sK1))) = $true)),
% 0.23/0.31 inference(cnf_transformation,[],[f16])).
% 0.23/0.31 thf(f25,plain,(
% 0.23/0.31 (((subset @ sK0 @ sK2)) != $true)),
% 0.23/0.31 inference(cnf_transformation,[],[f16])).
% 0.23/0.31 thf(f26,plain,(
% 0.23/0.31 ( ! [X3 : $i] : ((((in @ X3 @ sK1)) != $true) | (((in @ X3 @ sK2)) = $true) | (((in @ X3 @ sK0)) != $true)) )),
% 0.23/0.31 inference(cnf_transformation,[],[f16])).
% 0.23/0.31 thf(f27,plain,(
% 0.23/0.31 (subsetI2 = $true)),
% 0.23/0.31 inference(cnf_transformation,[],[f16])).
% 0.23/0.31 thf(f28,plain,(
% 0.23/0.31 (powersetE = $true)),
% 0.23/0.31 inference(cnf_transformation,[],[f16])).
% 0.23/0.31 thf(f29,plain,(
% 0.23/0.31 ( ! [X3 : $i,X4 : $i] : ((((subset @ X3 @ X4)) = $true) | (((in @ (sK5 @ X4 @ X3) @ X4)) != $true) | (subsetI2 != $true)) )),
% 0.23/0.31 inference(cnf_transformation,[],[f19])).
% 0.23/0.31 thf(f30,plain,(
% 0.23/0.31 ( ! [X3 : $i,X4 : $i] : ((((subset @ X3 @ X4)) = $true) | (((in @ (sK5 @ X4 @ X3) @ X3)) = $true) | (subsetI2 != $true)) )),
% 0.23/0.31 inference(cnf_transformation,[],[f19])).
% 0.23/0.31 thf(f33,plain,(
% 0.23/0.31 ( ! [X3 : $i,X4 : $i,X5 : $i] : ((((in @ X5 @ X4)) != $true) | (((in @ X4 @ (powerset @ X3))) != $true) | (((in @ X5 @ X3)) = $true) | (powersetE != $true)) )),
% 0.23/0.31 inference(cnf_transformation,[],[f22])).
% 0.23/0.31 thf(f41,plain,(
% 0.23/0.31 ( ! [X3 : $i,X4 : $i] : ((((subset @ X3 @ X4)) = $true) | (((in @ (sK5 @ X4 @ X3) @ X3)) = $true) | ($true != $true)) )),
% 0.23/0.31 inference(definition_unfolding,[],[f30,f27])).
% 0.23/0.31 thf(f42,plain,(
% 0.23/0.31 ( ! [X3 : $i,X4 : $i] : ((((in @ (sK5 @ X4 @ X3) @ X4)) != $true) | (((subset @ X3 @ X4)) = $true) | ($true != $true)) )),
% 0.23/0.31 inference(definition_unfolding,[],[f29,f27])).
% 0.23/0.31 thf(f46,plain,(
% 0.23/0.31 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != $true) | (((in @ X5 @ X4)) != $true) | (((in @ X5 @ X3)) = $true) | (((in @ X4 @ (powerset @ X3))) != $true)) )),
% 0.23/0.31 inference(definition_unfolding,[],[f33,f28])).
% 0.23/0.31 thf(f47,plain,(
% 0.23/0.31 ( ! [X3 : $i,X4 : $i] : ((((in @ (sK5 @ X4 @ X3) @ X3)) = $true) | (((subset @ X3 @ X4)) = $true)) )),
% 0.23/0.31 inference(trivial_inequality_removal,[],[f41])).
% 0.23/0.31 thf(f48,plain,(
% 0.23/0.31 ( ! [X3 : $i,X4 : $i,X5 : $i] : ((((in @ X4 @ (powerset @ X3))) != $true) | (((in @ X5 @ X4)) != $true) | (((in @ X5 @ X3)) = $true)) )),
% 0.23/0.31 inference(trivial_inequality_removal,[],[f46])).
% 0.23/0.31 thf(f49,plain,(
% 0.23/0.31 ( ! [X3 : $i,X4 : $i] : ((((in @ (sK5 @ X4 @ X3) @ X4)) != $true) | (((subset @ X3 @ X4)) = $true)) )),
% 0.23/0.31 inference(trivial_inequality_removal,[],[f42])).
% 0.23/0.31 thf(f55,plain,(
% 0.23/0.31 ( ! [X0 : $i] : ((((in @ X0 @ sK1)) = $true) | ($true != $true) | (((in @ X0 @ sK0)) != $true)) )),
% 0.23/0.31 inference(constrained_superposition,[],[f48,f23])).
% 0.23/0.31 thf(f58,plain,(
% 0.23/0.31 ( ! [X0 : $i] : ((((in @ X0 @ sK0)) != $true) | (((in @ X0 @ sK1)) = $true)) )),
% 0.23/0.31 inference(trivial_inequality_removal,[],[f55])).
% 0.23/0.31 thf(f61,plain,(
% 0.23/0.31 ( ! [X0 : $i] : (($true != $true) | (((in @ (sK5 @ X0 @ sK0) @ sK1)) = $true) | (((subset @ sK0 @ X0)) = $true)) )),
% 0.23/0.31 inference(constrained_superposition,[],[f58,f47])).
% 0.23/0.31 thf(f62,plain,(
% 0.23/0.31 ( ! [X0 : $i] : ((((in @ (sK5 @ X0 @ sK0) @ sK1)) = $true) | (((subset @ sK0 @ X0)) = $true)) )),
% 0.23/0.31 inference(trivial_inequality_removal,[],[f61])).
% 0.23/0.31 thf(f65,plain,(
% 0.23/0.31 ( ! [X0 : $i] : (($true != $true) | (((in @ (sK5 @ X0 @ sK0) @ sK2)) = $true) | (((subset @ sK0 @ X0)) = $true) | (((in @ (sK5 @ X0 @ sK0) @ sK0)) != $true)) )),
% 0.23/0.31 inference(constrained_superposition,[],[f26,f62])).
% 0.23/0.31 thf(f69,plain,(
% 0.23/0.31 ( ! [X0 : $i] : ((((in @ (sK5 @ X0 @ sK0) @ sK2)) = $true) | (((subset @ sK0 @ X0)) = $true) | (((in @ (sK5 @ X0 @ sK0) @ sK0)) != $true)) )),
% 0.23/0.31 inference(trivial_inequality_removal,[],[f65])).
% 0.23/0.31 thf(f70,plain,(
% 0.23/0.31 ( ! [X0 : $i] : ((((in @ (sK5 @ X0 @ sK0) @ sK2)) = $true) | (((subset @ sK0 @ X0)) = $true)) )),
% 0.23/0.31 inference(forward_subsumption_resolution,[],[f69,f47])).
% 0.23/0.31 thf(f77,plain,(
% 0.23/0.31 ($true != $true) | (((subset @ sK0 @ sK2)) = $true) | (((subset @ sK0 @ sK2)) = $true)),
% 0.23/0.31 inference(constrained_superposition,[],[f49,f70])).
% 0.23/0.31 thf(f79,plain,(
% 0.23/0.31 ($true != $true) | (((subset @ sK0 @ sK2)) = $true)),
% 0.23/0.31 inference(duplicate_literal_removal,[],[f77])).
% 0.23/0.31 thf(f80,plain,(
% 0.23/0.31 (((subset @ sK0 @ sK2)) = $true)),
% 0.23/0.31 inference(trivial_inequality_removal,[],[f79])).
% 0.23/0.31 thf(f81,plain,(
% 0.23/0.31 $false),
% 0.23/0.31 inference(forward_subsumption_resolution,[],[f80,f25])).
% 0.23/0.31 % SZS output end Proof for theBenchmark
% 0.23/0.31 % (3429434)------------------------------
% 0.23/0.31 % (3429434)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.31 % (3429434)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.31 % (3429434)CaDiCaL version: 2.1.3
% 0.23/0.31 % (3429434)Termination reason: Refutation
% 0.23/0.31 % (3429434)Time elapsed: 0.005 s
% 0.23/0.31 % (3429434)Peak memory usage: 12 MB
% 0.23/0.31 % (3429434)Instructions burned: 8 (million)
% 0.23/0.31 % (3429429)Success in time 0.043 s
% 0.23/0.31 % Vampire exiting
%------------------------------------------------------------------------------