%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU716^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 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:33:05 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 : SEU716^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n004.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 14:14:45 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.29 % (1349581)Will run a generic schedule for satisfiability detection.
% 0.20/0.29 % (1349599)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3147660507:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.29 % (1349593)% WARNING: option uhcvi not known.
% 0.20/0.29 % (1349592)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2727069784_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.29 % (1349596)dis+10_1_sil=32000:sp=arity:random_seed=2784764373:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.29 % (1349593)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=183082986:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.29 % (1349597)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=983697423:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.29 % (1349595)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1839591102:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.29 % (1349598)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3330426828:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.29 % (1349597)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.29 % (1349593)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.29 % Exception at run slice level
% 0.20/0.29 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.29 % (1349593)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.29 % (1349614)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=982062829:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.29 % (1349593) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1349581-1349593"...
% 0.20/0.29 % (1349596) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1349581-1349596"...
% 0.20/0.29 % Exception at run slice level
% 0.20/0.29 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.29 % (1349593)...printing done.
% 0.20/0.29 % (1349596)...printing done.
% 0.20/0.29 % (1349596)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, in: ($i > $i > $o)).
% 0.20/0.29 thf(func_def_1, type, powerset: ($i > $i)).
% 0.20/0.29 thf(func_def_2, type, powersetE: $o).
% 0.20/0.29 thf(func_def_4, type, subset: ($i > $i > $o)).
% 0.20/0.29 thf(func_def_5, type, subsetI2: $o).
% 0.20/0.29 thf(func_def_6, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.20/0.29 thf(func_def_7, type, vIMP: ($o > $o > $o)).
% 0.20/0.29 thf(func_def_8, type, db1: !>[X0: $tType]:(X0)).
% 0.20/0.29 thf(func_def_9, type, db0: !>[X0: $tType]:(X0)).
% 0.20/0.29 thf(func_def_10, type, db2: !>[X0: $tType]:(X0)).
% 0.20/0.29 thf(func_def_11, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.20/0.29 thf(func_def_17, type, vNOT: ($o > $o)).
% 0.20/0.29 thf(func_def_18, type, sK3: ($i > $i > $i)).
% 0.20/0.29 thf(f1,axiom,(
% 0.20/0.29 (powersetE = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X1 @ (powerset @ X0)) => ((in @ X2 @ X1) => (in @ X2 @ X0))))),
% 0.20/0.29 file('/export/starexec/sandbox/benchmark/theBenchmark.p',powersetE)).
% 0.20/0.29 thf(f2,axiom,(
% 0.20/0.29 (subsetI2 = ! [X0 : $i,X1 : $i] : (! [X2 : $i] : ((in @ X2 @ X0) => (in @ X2 @ X1)) => (subset @ X0 @ X1)))),
% 0.20/0.29 file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetI2)).
% 0.20/0.29 thf(f3,conjecture,(
% 0.20/0.29 powersetE => (subsetI2 => ! [X0 : $i,X1 : $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.20/0.29 file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetTI)).
% 0.20/0.29 thf(f4,negated_conjecture,(
% 0.20/0.29 ~(powersetE => (subsetI2 => ! [X0 : $i,X1 : $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.20/0.29 inference(negated_conjecture,[status(cth)],[f3])).
% 0.20/0.29 thf(f5,plain,(
% 0.20/0.29 (powersetE = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X1 @ (powerset @ X0)) => ((in @ X2 @ X1) => (in @ X2 @ X0))))),
% 0.20/0.29 inference(rectify,[],[f1])).
% 0.20/0.29 thf(f6,plain,(
% 0.20/0.29 (powersetE = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (powerset @ Y2)) => ((in @ Y0 @ Y1) => (in @ Y0 @ Y2)))))))))))),
% 0.20/0.29 inference(fool_elimination,[],[f5])).
% 0.20/0.29 thf(f7,plain,(
% 0.20/0.29 (subsetI2 = ! [X0 : $i,X1 : $i] : (! [X2 : $i] : ((in @ X2 @ X0) => (in @ X2 @ X1)) => (subset @ X0 @ X1)))),
% 0.20/0.29 inference(rectify,[],[f2])).
% 0.20/0.29 thf(f8,plain,(
% 0.20/0.29 (subsetI2 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) => (subset @ Y1 @ Y0))))))))),
% 0.20/0.29 inference(fool_elimination,[],[f7])).
% 0.20/0.29 thf(f9,plain,(
% 0.20/0.29 ~(powersetE => (subsetI2 => ! [X0 : $i,X1 : $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.20/0.29 inference(rectify,[],[f4])).
% 0.20/0.29 thf(f10,plain,(
% 0.20/0.29 ~((powersetE = $true) => ((subsetI2 = $true) => ! [X0 : $i,X1 : $i] : ((((in @ X1 @ (powerset @ X0))) = $true) => ! [X2 : $i] : ((((in @ X2 @ (powerset @ X0))) = $true) => (! [X3 : $i] : ((((in @ X3 @ X0)) = $true) => ((((in @ X3 @ X1)) = $true) => (((in @ X3 @ X2)) = $true))) => (((subset @ X1 @ X2)) = $true))))))),
% 0.20/0.29 inference(fool_elimination,[],[f9])).
% 0.20/0.29 thf(f11,plain,(
% 0.20/0.29 (? [X0 : $i,X1 : $i] : (? [X2 : $i] : (((((subset @ X1 @ X2)) != $true) & ! [X3 : $i] : (((((in @ X3 @ X2)) = $true) | (((in @ X3 @ X1)) != $true)) | (((in @ X3 @ X0)) != $true))) & (((in @ X2 @ (powerset @ X0))) = $true)) & (((in @ X1 @ (powerset @ X0))) = $true)) & (subsetI2 = $true)) & (powersetE = $true)),
% 0.20/0.29 inference(ennf_transformation,[],[f10])).
% 0.20/0.29 thf(f12,plain,(
% 0.20/0.29 ? [X0 : $i,X1 : $i] : (? [X2 : $i] : ((((subset @ X1 @ X2)) != $true) & ! [X3 : $i] : ((((in @ X3 @ X2)) = $true) | (((in @ X3 @ X1)) != $true) | (((in @ X3 @ X0)) != $true)) & (((in @ X2 @ (powerset @ X0))) = $true)) & (((in @ X1 @ (powerset @ X0))) = $true)) & (subsetI2 = $true) & (powersetE = $true)),
% 0.20/0.29 inference(flattening,[],[f11])).
% 0.20/0.29 thf(f13,plain,(
% 0.20/0.29 ((($true != ((subset @ sK1 @ sK2))) & ! [X3 : $i] : (($true = ((in @ X3 @ sK2))) | ($true != ((in @ X3 @ sK1))) | ($true != ((in @ X3 @ sK0)))) & ($true = ((in @ sK2 @ (powerset @ sK0))))) & ($true = ((in @ sK1 @ (powerset @ sK0))))) & (subsetI2 = $true) & (powersetE = $true)),
% 0.20/0.29 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f12])).
% 0.20/0.29 thf(f14,plain,(
% 0.20/0.29 (powersetE = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (powerset @ Y2)) => ((in @ Y0 @ Y1) => (in @ Y0 @ Y2)))))))))))),
% 0.20/0.29 inference(cnf_transformation,[],[f6])).
% 0.20/0.29 thf(f15,plain,(
% 0.20/0.29 (subsetI2 = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) => (subset @ Y1 @ Y0))))))))),
% 0.20/0.29 inference(cnf_transformation,[],[f8])).
% 0.20/0.29 thf(f16,plain,(
% 0.20/0.29 (powersetE = $true)),
% 0.20/0.29 inference(cnf_transformation,[],[f13])).
% 0.20/0.29 thf(f17,plain,(
% 0.20/0.29 (subsetI2 = $true)),
% 0.20/0.29 inference(cnf_transformation,[],[f13])).
% 0.20/0.29 thf(f18,plain,(
% 0.20/0.29 ($true = ((in @ sK1 @ (powerset @ sK0))))),
% 0.20/0.29 inference(cnf_transformation,[],[f13])).
% 0.20/0.29 thf(f20,plain,(
% 0.20/0.29 ( ! [X3 : $i] : (($true != ((in @ X3 @ sK1))) | ($true = ((in @ X3 @ sK2))) | ($true != ((in @ X3 @ sK0)))) )),
% 0.20/0.29 inference(cnf_transformation,[],[f13])).
% 0.20/0.29 thf(f21,plain,(
% 0.20/0.29 ($true != ((subset @ sK1 @ sK2)))),
% 0.20/0.29 inference(cnf_transformation,[],[f13])).
% 0.20/0.29 thf(f23,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(f24,plain,(
% 0.20/0.29 (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (powerset @ Y2)) => ((in @ Y0 @ Y1) => (in @ Y0 @ Y2)))))))))) = $true)),
% 0.20/0.29 inference(definition_unfolding,[],[f14,f16])).
% 0.20/0.29 thf(f25,plain,(
% 0.20/0.29 (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) => (subset @ Y1 @ Y0))))))) = $true)),
% 0.20/0.29 inference(definition_unfolding,[],[f15,f17])).
% 0.20/0.29 thf(f26,plain,(
% 0.20/0.29 ( ! [X1 : $i] : (($true = (((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((in @ Y2 @ Y1) => (in @ Y2 @ Y0)))) => (subset @ Y1 @ Y0))))) @ X1)))) )),
% 0.20/0.29 inference(pi_proxy_clausification,[],[f25])).
% 0.20/0.29 thf(f27,plain,(
% 0.20/0.29 ( ! [X1 : $i] : (($true = ((!! @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) => (in @ Y1 @ X1)))) => (subset @ Y0 @ X1))))))) )),
% 0.20/0.29 inference(beta-eta_normalization,[],[f26])).
% 0.20/0.29 thf(f28,plain,(
% 0.20/0.29 ( ! [X2 : $i,X1 : $i] : (($true = (((^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) => (in @ Y1 @ X1)))) => (subset @ Y0 @ X1))) @ X2)))) )),
% 0.20/0.29 inference(pi_proxy_clausification,[],[f27])).
% 0.20/0.29 thf(f29,plain,(
% 0.20/0.29 ( ! [X2 : $i,X1 : $i] : (($true = (((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X2) => (in @ Y0 @ X1)))) => (subset @ X2 @ X1))))) )),
% 0.20/0.29 inference(beta-eta_normalization,[],[f28])).
% 0.20/0.29 thf(f30,plain,(
% 0.20/0.29 ( ! [X2 : $i,X1 : $i] : (($false = ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X2) => (in @ Y0 @ X1)))))) | ($true = ((subset @ X2 @ X1)))) )),
% 0.20/0.29 inference(imp_proxy_clausification,[],[f29])).
% 0.20/0.29 thf(f31,plain,(
% 0.20/0.29 ( ! [X2 : $i,X1 : $i] : (($false = (((^[Y0 : $i]: ((in @ Y0 @ X2) => (in @ Y0 @ X1))) @ (sK3 @ X1 @ X2)))) | ($true = ((subset @ X2 @ X1)))) )),
% 0.20/0.29 inference(sigma_proxy_clausification,[],[f30])).
% 0.20/0.29 thf(f32,plain,(
% 0.20/0.29 ( ! [X2 : $i,X1 : $i] : (($false = (((in @ (sK3 @ X1 @ X2) @ X2) => (in @ (sK3 @ X1 @ X2) @ X1)))) | ($true = ((subset @ X2 @ X1)))) )),
% 0.20/0.29 inference(beta-eta_normalization,[],[f31])).
% 0.20/0.29 thf(f33,plain,(
% 0.20/0.29 ( ! [X2 : $i,X1 : $i] : (($false = ((in @ (sK3 @ X1 @ X2) @ X1))) | ($true = ((subset @ X2 @ X1)))) )),
% 0.20/0.29 inference(imp_proxy_clausification,[],[f32])).
% 0.20/0.29 thf(f34,plain,(
% 0.20/0.29 ( ! [X2 : $i,X1 : $i] : (($true = ((in @ (sK3 @ X1 @ X2) @ X2))) | ($true = ((subset @ X2 @ X1)))) )),
% 0.20/0.29 inference(imp_proxy_clausification,[],[f32])).
% 0.20/0.29 thf(f35,plain,(
% 0.20/0.29 ( ! [X1 : $i] : (($true = (((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ (powerset @ Y2)) => ((in @ Y0 @ Y1) => (in @ Y0 @ Y2)))))))) @ X1)))) )),
% 0.20/0.29 inference(pi_proxy_clausification,[],[f24])).
% 0.20/0.29 thf(f36,plain,(
% 0.20/0.29 ( ! [X1 : $i] : (($true = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ (powerset @ Y1)) => ((in @ X1 @ Y0) => (in @ X1 @ Y1)))))))))) )),
% 0.20/0.29 inference(beta-eta_normalization,[],[f35])).
% 0.20/0.29 thf(f37,plain,(
% 0.20/0.29 ( ! [X2 : $i,X1 : $i] : (($true = (((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ (powerset @ Y1)) => ((in @ X1 @ Y0) => (in @ X1 @ Y1)))))) @ X2)))) )),
% 0.20/0.29 inference(pi_proxy_clausification,[],[f36])).
% 0.20/0.29 thf(f38,plain,(
% 0.20/0.29 ( ! [X2 : $i,X1 : $i] : (($true = ((!! @ $i @ (^[Y0 : $i]: ((in @ X2 @ (powerset @ Y0)) => ((in @ X1 @ X2) => (in @ X1 @ Y0)))))))) )),
% 0.20/0.29 inference(beta-eta_normalization,[],[f37])).
% 0.20/0.29 thf(f39,plain,(
% 0.20/0.29 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = (((^[Y0 : $i]: ((in @ X2 @ (powerset @ Y0)) => ((in @ X1 @ X2) => (in @ X1 @ Y0)))) @ X3)))) )),
% 0.20/0.29 inference(pi_proxy_clausification,[],[f38])).
% 0.20/0.29 thf(f40,plain,(
% 0.20/0.29 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = (((in @ X2 @ (powerset @ X3)) => ((in @ X1 @ X2) => (in @ X1 @ X3)))))) )),
% 0.20/0.29 inference(beta-eta_normalization,[],[f39])).
% 0.20/0.29 thf(f41,plain,(
% 0.20/0.29 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($false = ((in @ X2 @ (powerset @ X3)))) | ($true = (((in @ X1 @ X2) => (in @ X1 @ X3))))) )),
% 0.20/0.29 inference(imp_proxy_clausification,[],[f40])).
% 0.20/0.29 thf(f42,plain,(
% 0.20/0.29 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($false = ((in @ X2 @ (powerset @ X3)))) | ($false = ((in @ X1 @ X2))) | ($true = ((in @ X1 @ X3)))) )),
% 0.20/0.29 inference(imp_proxy_clausification,[],[f41])).
% 0.20/0.29 thf(f62,plain,(
% 0.20/0.29 ( ! [X0 : $i] : (($true = $false) | ($false = ((in @ X0 @ sK1))) | ($true = ((in @ X0 @ sK0)))) )),
% 0.20/0.29 inference(constrained_superposition,[],[f18,f42])).
% 0.20/0.29 thf(f77,plain,(
% 0.20/0.29 ( ! [X0 : $i] : (($false = ((in @ X0 @ sK1))) | ($true = ((in @ X0 @ sK0)))) )),
% 0.20/0.29 inference(trivial_inequality_removal,[],[f62])).
% 0.20/0.29 thf(f90,plain,(
% 0.20/0.29 ( ! [X0 : $i] : (($true != $true) | ($true = ((in @ X0 @ sK2))) | ($true != ((in @ X0 @ sK0))) | ($false = ((in @ X0 @ sK1)))) )),
% 0.20/0.29 inference(constrained_superposition,[],[f20,f23])).
% 0.20/0.29 thf(f100,plain,(
% 0.20/0.29 ( ! [X0 : $i] : (($true = ((in @ X0 @ sK2))) | ($true != ((in @ X0 @ sK0))) | ($false = ((in @ X0 @ sK1)))) )),
% 0.20/0.29 inference(trivial_inequality_removal,[],[f90])).
% 0.20/0.29 thf(f145,plain,(
% 0.20/0.29 ( ! [X0 : $i] : (($true = ((in @ X0 @ sK2))) | ($false = ((in @ X0 @ sK1)))) )),
% 0.20/0.29 inference(forward_subsumption_resolution,[],[f100,f77])).
% 0.20/0.29 thf(f151,plain,(
% 0.20/0.29 ( ! [X0 : $i] : (($true = $false) | ($true = ((subset @ X0 @ sK2))) | ($false = ((in @ (sK3 @ sK2 @ X0) @ sK1)))) )),
% 0.20/0.29 inference(constrained_superposition,[],[f33,f145])).
% 0.20/0.29 thf(f152,plain,(
% 0.20/0.29 ( ! [X0 : $i] : (($false = ((in @ (sK3 @ sK2 @ X0) @ sK1))) | ($true = ((subset @ X0 @ sK2)))) )),
% 0.20/0.29 inference(trivial_inequality_removal,[],[f151])).
% 0.20/0.29 thf(f435,plain,(
% 0.20/0.29 ($true = $false) | ($true = ((subset @ sK1 @ sK2))) | ($true = ((subset @ sK1 @ sK2)))),
% 0.20/0.29 inference(constrained_superposition,[],[f34,f152])).
% 0.20/0.29 thf(f436,plain,(
% 0.20/0.29 ($true = $false) | ($true = ((subset @ sK1 @ sK2)))),
% 0.20/0.29 inference(duplicate_literal_removal,[],[f435])).
% 0.20/0.29 thf(f437,plain,(
% 0.20/0.29 ($true = ((subset @ sK1 @ sK2)))),
% 0.20/0.29 inference(trivial_inequality_removal,[],[f436])).
% 0.20/0.29 thf(f447,plain,(
% 0.20/0.29 $false),
% 0.20/0.29 inference(forward_subsumption_resolution,[],[f437,f21])).
% 0.20/0.29 % SZS output end Proof for theBenchmark
% 0.20/0.29 % (1349596)------------------------------
% 0.20/0.29 % (1349596)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (1349596)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (1349596)CaDiCaL version: 2.1.3
% 0.20/0.29 % (1349596)Termination reason: Refutation
% 0.20/0.29 % (1349596)Time elapsed: 0.022 s
% 0.20/0.29 % (1349596)Peak memory usage: 12 MB
% 0.20/0.29 % (1349596)Instructions burned: 45 (million)
% 0.20/0.29 % (1349581)Success in time 0.059 s
% 0.20/0.29 % Vampire exiting
%------------------------------------------------------------------------------