%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU527^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 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:32:19 AM UTC 2026
% Result : Theorem 0.21s 0.28s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU527^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 % Computer : n013.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 13:47:36 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.28 % (2140533)Will run a generic schedule for satisfiability detection.
% 0.21/0.28 % (2140539)% WARNING: option uhcvi not known.
% 0.21/0.28 % (2140539)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=750411813:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.28 % (2140538)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2731510518_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.28 % (2140540)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1741640657:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.28 % (2140539)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.21/0.28 % (2140539)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.21/0.28 % Exception at run slice level
% 0.21/0.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.21/0.28 % (2140539) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2140533-2140539"...
% 0.21/0.28 % (2140540) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2140533-2140540"...
% 0.21/0.28 % (2140539)...printing done.
% 0.21/0.28 % (2140539)Refutation found. Thanks to Tanya!
% 0.21/0.28 % SZS status Theorem for theBenchmark
% 0.21/0.28 % SZS output start Proof for theBenchmark
% 0.21/0.28 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.21/0.28 thf(func_def_0, type, in: ($i > $i > $o)).
% 0.21/0.28 thf(func_def_2, type, setadjoin: ($i > $i > $i)).
% 0.21/0.28 thf(func_def_3, type, emptysetE: $o).
% 0.21/0.28 thf(func_def_5, type, setadjoinE: $o).
% 0.21/0.28 thf(func_def_6, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.21/0.28 thf(func_def_7, type, vIMP: ($o > $o > $o)).
% 0.21/0.28 thf(func_def_8, type, db0: !>[X0: $tType]:(X0)).
% 0.21/0.28 thf(func_def_9, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.21/0.28 thf(func_def_10, type, db2: !>[X0: $tType]:(X0)).
% 0.21/0.28 thf(func_def_11, type, db1: !>[X0: $tType]:(X0)).
% 0.21/0.28 thf(func_def_12, type, db3: !>[X0: $tType]:(X0)).
% 0.21/0.28 thf(func_def_13, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.21/0.28 thf(func_def_18, type, vNOT: ($o > $o)).
% 0.21/0.28 thf(f1,axiom,(
% 0.21/0.28 (emptysetE = ! [X0 : $i] : ((in @ X0 @ emptyset) => ! [X1 : $o] : X1))),
% 0.21/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',emptysetE)).
% 0.21/0.28 thf(f2,axiom,(
% 0.21/0.28 (setadjoinE = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X2 @ (setadjoin @ X0 @ X1)) => ! [X3 : $o] : (((X2 = X0) => X3) => (((in @ X2 @ X1) => X3) => X3))))),
% 0.21/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setadjoinE)).
% 0.21/0.28 thf(f3,conjecture,(
% 0.21/0.28 emptysetE => (setadjoinE => ! [X0 : $i,X1 : $i] : ((in @ X0 @ (setadjoin @ X1 @ emptyset)) => (X0 = X1)))),
% 0.21/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',uniqinunit)).
% 0.21/0.28 thf(f4,negated_conjecture,(
% 0.21/0.28 ~(emptysetE => (setadjoinE => ! [X0 : $i,X1 : $i] : ((in @ X0 @ (setadjoin @ X1 @ emptyset)) => (X0 = X1))))),
% 0.21/0.28 inference(negated_conjecture,[status(cth)],[f3])).
% 0.21/0.28 thf(f5,plain,(
% 0.21/0.28 (emptysetE = ! [X0 : $i] : ((in @ X0 @ emptyset) => ! [X1 : $o] : X1))),
% 0.21/0.28 inference(rectify,[],[f1])).
% 0.21/0.28 thf(f6,plain,(
% 0.21/0.28 (emptysetE = ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ emptyset) => (!! @ $o @ (^[Y1 : $o]: (Y1))))))))),
% 0.21/0.28 inference(fool_elimination,[],[f5])).
% 0.21/0.28 thf(f7,plain,(
% 0.21/0.28 (setadjoinE = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X2 @ (setadjoin @ X0 @ X1)) => ! [X3 : $o] : (((X2 = X0) => X3) => (((in @ X2 @ X1) => X3) => X3))))),
% 0.21/0.28 inference(rectify,[],[f2])).
% 0.21/0.28 thf(f8,plain,(
% 0.21/0.28 (setadjoinE = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (setadjoin @ Y2 @ Y1)) => (!! @ $o @ (^[Y3 : $o]: (((Y2 = Y0) => Y3) => (((in @ Y0 @ Y1) => Y3) => Y3)))))))))))))),
% 0.21/0.28 inference(fool_elimination,[],[f7])).
% 0.21/0.28 thf(f9,plain,(
% 0.21/0.28 ~(emptysetE => (setadjoinE => ! [X0 : $i,X1 : $i] : ((in @ X0 @ (setadjoin @ X1 @ emptyset)) => (X0 = X1))))),
% 0.21/0.28 inference(rectify,[],[f4])).
% 0.21/0.28 thf(f10,plain,(
% 0.21/0.28 ~((emptysetE = $true) => ((setadjoinE = $true) => ! [X0 : $i,X1 : $i] : ((((in @ X0 @ (setadjoin @ X1 @ emptyset))) = $true) => (X0 = X1))))),
% 0.21/0.28 inference(fool_elimination,[],[f9])).
% 0.21/0.28 thf(f11,plain,(
% 0.21/0.28 (? [X0 : $i,X1 : $i] : ((X0 != X1) & (((in @ X0 @ (setadjoin @ X1 @ emptyset))) = $true)) & (setadjoinE = $true)) & (emptysetE = $true)),
% 0.21/0.28 inference(ennf_transformation,[],[f10])).
% 0.21/0.29 thf(f12,plain,(
% 0.21/0.29 ? [X0 : $i,X1 : $i] : ((X0 != X1) & (((in @ X0 @ (setadjoin @ X1 @ emptyset))) = $true)) & (setadjoinE = $true) & (emptysetE = $true)),
% 0.21/0.29 inference(flattening,[],[f11])).
% 0.21/0.29 thf(f13,plain,(
% 0.21/0.29 ((sK0 != sK1) & ($true = ((in @ sK0 @ (setadjoin @ sK1 @ emptyset))))) & (setadjoinE = $true) & (emptysetE = $true)),
% 0.21/0.29 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f12])).
% 0.21/0.29 thf(f14,plain,(
% 0.21/0.29 (emptysetE = ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ emptyset) => (!! @ $o @ (^[Y1 : $o]: (Y1))))))))),
% 0.21/0.29 inference(cnf_transformation,[],[f6])).
% 0.21/0.29 thf(f15,plain,(
% 0.21/0.29 (setadjoinE = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (setadjoin @ Y2 @ Y1)) => (!! @ $o @ (^[Y3 : $o]: (((Y2 = Y0) => Y3) => (((in @ Y0 @ Y1) => Y3) => Y3)))))))))))))),
% 0.21/0.29 inference(cnf_transformation,[],[f8])).
% 0.21/0.29 thf(f16,plain,(
% 0.21/0.29 (emptysetE = $true)),
% 0.21/0.29 inference(cnf_transformation,[],[f13])).
% 0.21/0.29 thf(f17,plain,(
% 0.21/0.29 (setadjoinE = $true)),
% 0.21/0.29 inference(cnf_transformation,[],[f13])).
% 0.21/0.29 thf(f18,plain,(
% 0.21/0.29 ($true = ((in @ sK0 @ (setadjoin @ sK1 @ emptyset))))),
% 0.21/0.29 inference(cnf_transformation,[],[f13])).
% 0.21/0.29 thf(f19,plain,(
% 0.21/0.29 (sK0 != sK1)),
% 0.21/0.29 inference(cnf_transformation,[],[f13])).
% 0.21/0.29 thf(f20,definition,(
% 0.21/0.29 ($true != $false)),
% 0.21/0.29 introduced(theory,[fool_distinctness_axiom])).
% 0.21/0.29 thf(f22,plain,(
% 0.21/0.29 (((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ emptyset) => (!! @ $o @ (^[Y1 : $o]: (Y1))))))) = $true)),
% 0.21/0.29 inference(definition_unfolding,[],[f14,f16])).
% 0.21/0.29 thf(f23,plain,(
% 0.21/0.29 (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (setadjoin @ Y2 @ Y1)) => (!! @ $o @ (^[Y3 : $o]: (((Y2 = Y0) => Y3) => (((in @ Y0 @ Y1) => Y3) => Y3)))))))))))) = $true)),
% 0.21/0.29 inference(definition_unfolding,[],[f15,f17])).
% 0.21/0.29 thf(f24,plain,(
% 0.21/0.29 ( ! [X1 : $i] : (($true = (((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ (setadjoin @ Y2 @ Y1)) => (!! @ $o @ (^[Y3 : $o]: (((Y2 = Y0) => Y3) => (((in @ Y0 @ Y1) => Y3) => Y3)))))))))) @ X1)))) )),
% 0.21/0.29 inference(pi_proxy_clausification,[],[f23])).
% 0.21/0.29 thf(f25,plain,(
% 0.21/0.29 ( ! [X1 : $i] : (($true = ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ X1 @ (setadjoin @ Y1 @ Y0)) => (!! @ $o @ (^[Y2 : $o]: (((Y1 = X1) => Y2) => (((in @ X1 @ Y0) => Y2) => Y2)))))))))))) )),
% 0.21/0.29 inference(beta-eta_normalization,[],[f24])).
% 0.21/0.29 thf(f26,plain,(
% 0.21/0.29 ( ! [X2 : $i,X1 : $i] : (($true = (((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ X1 @ (setadjoin @ Y1 @ Y0)) => (!! @ $o @ (^[Y2 : $o]: (((Y1 = X1) => Y2) => (((in @ X1 @ Y0) => Y2) => Y2)))))))) @ X2)))) )),
% 0.21/0.29 inference(pi_proxy_clausification,[],[f25])).
% 0.21/0.29 thf(f27,plain,(
% 0.21/0.29 ( ! [X2 : $i,X1 : $i] : (($true = ((!! @ $i @ (^[Y0 : $i]: ((in @ X1 @ (setadjoin @ Y0 @ X2)) => (!! @ $o @ (^[Y1 : $o]: (((Y0 = X1) => Y1) => (((in @ X1 @ X2) => Y1) => Y1)))))))))) )),
% 0.21/0.29 inference(beta-eta_normalization,[],[f26])).
% 0.21/0.29 thf(f28,plain,(
% 0.21/0.29 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = (((^[Y0 : $i]: ((in @ X1 @ (setadjoin @ Y0 @ X2)) => (!! @ $o @ (^[Y1 : $o]: (((Y0 = X1) => Y1) => (((in @ X1 @ X2) => Y1) => Y1)))))) @ X3)))) )),
% 0.21/0.29 inference(pi_proxy_clausification,[],[f27])).
% 0.21/0.29 thf(f29,plain,(
% 0.21/0.29 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = (((in @ X1 @ (setadjoin @ X3 @ X2)) => (!! @ $o @ (^[Y0 : $o]: (((X3 = X1) => Y0) => (((in @ X1 @ X2) => Y0) => Y0)))))))) )),
% 0.21/0.29 inference(beta-eta_normalization,[],[f28])).
% 0.21/0.29 thf(f30,plain,(
% 0.21/0.29 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($false = ((in @ X1 @ (setadjoin @ X3 @ X2)))) | ($true = ((!! @ $o @ (^[Y0 : $o]: (((X3 = X1) => Y0) => (((in @ X1 @ X2) => Y0) => Y0))))))) )),
% 0.21/0.29 inference(imp_proxy_clausification,[],[f29])).
% 0.21/0.29 thf(f31,plain,(
% 0.21/0.29 ( ! [X2 : $i,X3 : $i,X1 : $i,X4 : $o] : (($false = ((in @ X1 @ (setadjoin @ X3 @ X2)))) | ($true = (((^[Y0 : $o]: (((X3 = X1) => Y0) => (((in @ X1 @ X2) => Y0) => Y0))) @ X4)))) )),
% 0.21/0.29 inference(pi_proxy_clausification,[],[f30])).
% 0.21/0.29 thf(f32,plain,(
% 0.21/0.29 ( ! [X2 : $i,X3 : $i,X1 : $i,X4 : $o] : (($false = ((in @ X1 @ (setadjoin @ X3 @ X2)))) | ($true = ((((X3 = X1) => X4) => (((in @ X1 @ X2) => X4) => X4))))) )),
% 0.21/0.29 inference(beta-eta_normalization,[],[f31])).
% 0.21/0.29 thf(f33,plain,(
% 0.21/0.29 ( ! [X2 : $i,X3 : $i,X1 : $i,X4 : $o] : (($false = ((in @ X1 @ (setadjoin @ X3 @ X2)))) | ($false = (((X3 = X1) => X4))) | ($true = ((((in @ X1 @ X2) => X4) => X4)))) )),
% 0.21/0.29 inference(imp_proxy_clausification,[],[f32])).
% 0.21/0.29 thf(f35,plain,(
% 0.21/0.29 ( ! [X2 : $i,X3 : $i,X1 : $i,X4 : $o] : (($false = ((in @ X1 @ (setadjoin @ X3 @ X2)))) | ($true = ((X3 = X1))) | ($true = ((((in @ X1 @ X2) => X4) => X4)))) )),
% 0.21/0.29 inference(imp_proxy_clausification,[],[f33])).
% 0.21/0.29 thf(f36,plain,(
% 0.21/0.29 ( ! [X2 : $i,X3 : $i,X1 : $i,X4 : $o] : (($false = ((in @ X1 @ (setadjoin @ X3 @ X2)))) | (X1 = X3) | ($true = ((((in @ X1 @ X2) => X4) => X4)))) )),
% 0.21/0.29 inference(equality_proxy_clausification,[],[f35])).
% 0.21/0.29 thf(f37,plain,(
% 0.21/0.29 ( ! [X2 : $i,X3 : $i,X1 : $i,X4 : $o] : (($false = ((in @ X1 @ (setadjoin @ X3 @ X2)))) | (X1 = X3) | ($false = (((in @ X1 @ X2) => X4))) | ($true = X4)) )),
% 0.21/0.29 inference(imp_proxy_clausification,[],[f36])).
% 0.21/0.29 thf(f39,plain,(
% 0.21/0.29 ( ! [X2 : $i,X3 : $i,X1 : $i,X4 : $o] : (($false = ((in @ X1 @ (setadjoin @ X3 @ X2)))) | (X1 = X3) | ($true = ((in @ X1 @ X2))) | ($true = X4)) )),
% 0.21/0.29 inference(imp_proxy_clausification,[],[f37])).
% 0.21/0.29 thf(f44,plain,(
% 0.21/0.29 ( ! [X1 : $i] : (($true = (((^[Y0 : $i]: ((in @ Y0 @ emptyset) => (!! @ $o @ (^[Y1 : $o]: (Y1))))) @ X1)))) )),
% 0.21/0.29 inference(pi_proxy_clausification,[],[f22])).
% 0.21/0.29 thf(f45,plain,(
% 0.21/0.29 ( ! [X1 : $i] : (($true = (((in @ X1 @ emptyset) => (!! @ $o @ (^[Y0 : $o]: (Y0))))))) )),
% 0.21/0.29 inference(beta-eta_normalization,[],[f44])).
% 0.21/0.29 thf(f46,plain,(
% 0.21/0.29 ( ! [X1 : $i] : (($false = ((in @ X1 @ emptyset))) | (((!! @ $o @ (^[Y0 : $o]: (Y0)))) = $true)) )),
% 0.21/0.29 inference(imp_proxy_clausification,[],[f45])).
% 0.21/0.29 thf(f47,plain,(
% 0.21/0.29 ( ! [X2 : $o,X1 : $i] : (($false = ((in @ X1 @ emptyset))) | ($true = (((^[Y0 : $o]: (Y0)) @ X2)))) )),
% 0.21/0.29 inference(pi_proxy_clausification,[],[f46])).
% 0.21/0.29 thf(f48,plain,(
% 0.21/0.29 ( ! [X2 : $o,X1 : $i] : (($false = ((in @ X1 @ emptyset))) | ($true = X2)) )),
% 0.21/0.29 inference(beta-eta_normalization,[],[f47])).
% 0.21/0.29 thf(f50,definition,(
% 0.21/0.29 spl2_1 <=> ! [X4 : $o] : ($true = X4)),
% 0.21/0.29 introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition])).
% 0.21/0.29 thf(f51,plain,(
% 0.21/0.29 ( ! [X4 : $o] : (($true = X4)) ) | ~spl2_1),
% 0.21/0.29 inference(avatar_component_clause,[],[f50])).
% 0.21/0.29 thf(f53,definition,(
% 0.21/0.29 spl2_2 <=> ! [X2 : $i,X1 : $i,X3 : $i] : (($false = ((in @ X1 @ (setadjoin @ X3 @ X2)))) | ($true = ((in @ X1 @ X2))) | (X1 = X3))),
% 0.21/0.29 introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition])).
% 0.21/0.29 thf(f54,plain,(
% 0.21/0.29 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($false = ((in @ X1 @ (setadjoin @ X3 @ X2)))) | ($true = ((in @ X1 @ X2))) | (X1 = X3)) ) | ~spl2_2),
% 0.21/0.29 inference(avatar_component_clause,[],[f53])).
% 0.21/0.29 thf(f55,plain,(
% 0.21/0.29 spl2_1 | spl2_2),
% 0.21/0.29 inference(avatar_split_clause,[],[f39,f53,f50])).
% 0.21/0.29 thf(f72,definition,(
% 0.21/0.29 spl2_7 <=> ! [X1 : $i] : ($false = ((in @ X1 @ emptyset)))),
% 0.21/0.29 introduced(definition,[new_symbols(definition,[spl2_7])],[avatar_definition])).
% 0.21/0.29 thf(f73,plain,(
% 0.21/0.29 ( ! [X1 : $i] : (($false = ((in @ X1 @ emptyset)))) ) | ~spl2_7),
% 0.21/0.29 inference(avatar_component_clause,[],[f72])).
% 0.21/0.29 thf(f74,plain,(
% 0.21/0.29 spl2_1 | spl2_7),
% 0.21/0.29 inference(avatar_split_clause,[],[f48,f72,f50])).
% 0.21/0.29 thf(f85,plain,(
% 0.21/0.29 ($true = $false) | ($true = ((in @ sK0 @ emptyset))) | (sK0 = sK1) | ~spl2_2),
% 0.21/0.29 inference(constrained_superposition,[],[f54,f18])).
% 0.21/0.29 thf(f90,plain,(
% 0.21/0.29 ($true = ((in @ sK0 @ emptyset))) | (sK0 = sK1) | ~spl2_2),
% 0.21/0.29 inference(trivial_inequality_removal,[],[f85])).
% 0.21/0.29 thf(f92,plain,(
% 0.21/0.29 ($true = ((in @ sK0 @ emptyset))) | ~spl2_2),
% 0.21/0.29 inference(forward_subsumption_resolution,[],[f90,f19])).
% 0.21/0.29 thf(f96,plain,(
% 0.21/0.29 ($true = $false) | (~spl2_2 | ~spl2_7)),
% 0.21/0.29 inference(forward_demodulation,[],[f92,f73])).
% 0.21/0.29 thf(f97,plain,(
% 0.21/0.29 $false | (~spl2_2 | ~spl2_7)),
% 0.21/0.29 inference(trivial_inequality_removal,[],[f96])).
% 0.21/0.29 thf(f98,plain,(
% 0.21/0.29 ~spl2_2 | ~spl2_7),
% 0.21/0.29 inference(avatar_contradiction_clause,[],[f97])).
% 0.21/0.29 thf(f99,plain,(
% 0.21/0.29 $false | ~spl2_1),
% 0.21/0.29 inference(backward_subsumption_resolution,[],[f20,f51])).
% 0.21/0.29 thf(f113,plain,(
% 0.21/0.29 ~spl2_1),
% 0.21/0.29 inference(avatar_contradiction_clause,[],[f99])).
% 0.21/0.29 cnf(s1, plain, spl2_1 | spl2_2, inference(sat_conversion,[],[f55])).
% 0.21/0.29 cnf(s5, plain, spl2_1 | spl2_7, inference(sat_conversion,[],[f74])).
% 0.21/0.29 cnf(s8, plain, ~spl2_2 | ~spl2_7, inference(sat_conversion,[],[f98])).
% 0.21/0.29 cnf(s9, plain, ~spl2_1, inference(sat_conversion,[],[f113])).
% 0.21/0.29 cnf(s10, plain, spl2_7, inference(rat,[],[s5,s9])).
% 0.21/0.29 cnf(s11, plain, ~spl2_2, inference(rat,[],[s8,s10])).
% 0.21/0.29 cnf(s12, plain, $false, inference(rat,[],[s1,s11,s9])).
% 0.21/0.29 thf(f114,plain,(
% 0.21/0.29 $false),
% 0.21/0.29 inference(avatar_sat_refutation,[],[s12])).
% 0.21/0.29 % SZS output end Proof for theBenchmark
% 0.21/0.29 % (2140539)------------------------------
% 0.21/0.29 % (2140539)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29 % (2140539)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29 % (2140539)CaDiCaL version: 2.1.3
% 0.21/0.29 % (2140539)Termination reason: Refutation
% 0.21/0.29 % (2140539)Time elapsed: 0.005 s
% 0.21/0.29 % (2140539)Peak memory usage: 12 MB
% 0.21/0.29 % (2140539)Instructions burned: 6 (million)
% 0.21/0.29 % (2140533)Success in time 0.042 s
% 0.21/0.29 % Vampire exiting
%------------------------------------------------------------------------------