%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU503^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 : n010.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:13 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU503^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.19 % Computer : n010.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Tue Sep 29 13:47:18 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.22 Running first-order model finding
% 0.10/0.22 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.20/0.27 % (2877961)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (2877978)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=55648682_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.27 % Exception at run slice level
% 0.20/0.27 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.27 % (2877979)% WARNING: option uhcvi not known.
% 0.20/0.27 % (2877980)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1829549797:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.27 % (2877979)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3774574294:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.27 % (2877981)dis+10_1_sil=32000:sp=arity:random_seed=1278636313:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.27 % (2877983)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1463550560:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.27 % (2877979)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.27 % (2877982)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2397724445:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.27 % (2877979)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.27 % (2877982)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.27 % (2877984)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3000386803:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.27 % (2877979) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2877961-2877979"...
% 0.20/0.27 % (2877981) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2877961-2877981"...
% 0.20/0.27 % (2877980) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2877961-2877980"...
% 0.20/0.27 % (2877983) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2877961-2877983"...
% 0.20/0.27 % (2877982) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2877961-2877982"...
% 0.20/0.27 % (2877984) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2877961-2877984"...
% 0.20/0.27 % (2877988)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=400464069:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.27 % Exception at run slice level
% 0.20/0.27 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.27 % (2877979)...printing done.
% 0.20/0.27 % (2877980)...printing done.
% 0.20/0.27 % (2877981)...printing done.
% 0.20/0.27 % (2877983)...printing done.
% 0.20/0.27 % (2877982)...printing done.
% 0.20/0.27 % (2877984)...printing done.
% 0.20/0.27 % (2877979)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Theorem for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% 0.20/0.27 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.20/0.27 thf(func_def_0, type, in: ($i > $i > $o)).
% 0.20/0.27 thf(func_def_2, type, emptysetE: $o).
% 0.20/0.27 thf(func_def_4, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.20/0.27 thf(func_def_5, type, vIMP: ($o > $o > $o)).
% 0.20/0.27 thf(func_def_6, type, db0: !>[X0: $tType]:(X0)).
% 0.20/0.27 thf(func_def_7, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.20/0.27 thf(func_def_11, type, vNOT: ($o > $o)).
% 0.20/0.27 thf(f1,axiom,(
% 0.20/0.27 (emptysetE = ! [X0 : $i] : ((in @ X0 @ emptyset) => ! [X1 : $o] : X1))),
% 0.20/0.27 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',emptysetE)).
% 0.20/0.27 thf(f2,conjecture,(
% 0.20/0.27 emptysetE => ! [X0 : $i] : ~(in @ X0 @ emptyset)),
% 0.20/0.27 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',notinemptyset)).
% 0.20/0.27 thf(f3,negated_conjecture,(
% 0.20/0.27 ~(emptysetE => ! [X0 : $i] : ~(in @ X0 @ emptyset))),
% 0.20/0.27 inference(negated_conjecture,[status(cth)],[f2])).
% 0.20/0.27 thf(f4,plain,(
% 0.20/0.27 (emptysetE = ! [X0 : $i] : ((in @ X0 @ emptyset) => ! [X1 : $o] : X1))),
% 0.20/0.27 inference(rectify,[],[f1])).
% 0.20/0.27 thf(f5,plain,(
% 0.20/0.27 (emptysetE = ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ emptyset) => (!! @ $o @ (^[Y1 : $o]: (Y1))))))))),
% 0.20/0.27 inference(fool_elimination,[],[f4])).
% 0.20/0.27 thf(f6,plain,(
% 0.20/0.27 ~(emptysetE => ! [X0 : $i] : ~(in @ X0 @ emptyset))),
% 0.20/0.27 inference(rectify,[],[f3])).
% 0.20/0.27 thf(f7,plain,(
% 0.20/0.27 ~((emptysetE = $true) => ! [X0 : $i] : ~ (((in @ X0 @ emptyset)) = $true))),
% 0.20/0.27 inference(fool_elimination,[],[f6])).
% 0.20/0.27 thf(f8,plain,(
% 0.20/0.27 ~((emptysetE = $true) => ! [X0 : $i] : (((in @ X0 @ emptyset)) != $true))),
% 0.20/0.27 inference(flattening,[],[f7])).
% 0.20/0.27 thf(f9,plain,(
% 0.20/0.27 ? [X0 : $i] : (((in @ X0 @ emptyset)) = $true) & (emptysetE = $true)),
% 0.20/0.27 inference(ennf_transformation,[],[f8])).
% 0.20/0.27 thf(f10,plain,(
% 0.20/0.27 ($true = ((in @ sK0 @ emptyset))) & (emptysetE = $true)),
% 0.20/0.27 inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f9])).
% 0.20/0.27 thf(f11,plain,(
% 0.20/0.27 (emptysetE = ((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ emptyset) => (!! @ $o @ (^[Y1 : $o]: (Y1))))))))),
% 0.20/0.27 inference(cnf_transformation,[],[f5])).
% 0.20/0.27 thf(f12,plain,(
% 0.20/0.27 (emptysetE = $true)),
% 0.20/0.27 inference(cnf_transformation,[],[f10])).
% 0.20/0.27 thf(f13,plain,(
% 0.20/0.27 ($true = ((in @ sK0 @ emptyset)))),
% 0.20/0.27 inference(cnf_transformation,[],[f10])).
% 0.20/0.27 thf(f14,definition,(
% 0.20/0.27 ($true != $false)),
% 0.20/0.27 introduced(theory,[fool_distinctness_axiom])).
% 0.20/0.27 thf(f16,plain,(
% 0.20/0.27 (((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ emptyset) => (!! @ $o @ (^[Y1 : $o]: (Y1))))))) = $true)),
% 0.20/0.27 inference(definition_unfolding,[],[f11,f12])).
% 0.20/0.27 thf(f17,plain,(
% 0.20/0.27 ( ! [X1 : $i] : (($true = (((^[Y0 : $i]: ((in @ Y0 @ emptyset) => (!! @ $o @ (^[Y1 : $o]: (Y1))))) @ X1)))) )),
% 0.20/0.27 inference(pi_proxy_clausification,[],[f16])).
% 0.20/0.27 thf(f18,plain,(
% 0.20/0.27 ( ! [X1 : $i] : (($true = (((in @ X1 @ emptyset) => (!! @ $o @ (^[Y0 : $o]: (Y0))))))) )),
% 0.20/0.27 inference(beta-eta_normalization,[],[f17])).
% 0.20/0.27 thf(f19,plain,(
% 0.20/0.27 ( ! [X1 : $i] : (($false = ((in @ X1 @ emptyset))) | (((!! @ $o @ (^[Y0 : $o]: (Y0)))) = $true)) )),
% 0.20/0.27 inference(imp_proxy_clausification,[],[f18])).
% 0.20/0.27 thf(f20,plain,(
% 0.20/0.27 ( ! [X2 : $o,X1 : $i] : (($false = ((in @ X1 @ emptyset))) | ($true = (((^[Y0 : $o]: (Y0)) @ X2)))) )),
% 0.20/0.27 inference(pi_proxy_clausification,[],[f19])).
% 0.20/0.27 thf(f21,plain,(
% 0.20/0.27 ( ! [X2 : $o,X1 : $i] : (($false = ((in @ X1 @ emptyset))) | ($true = X2)) )),
% 0.20/0.27 inference(beta-eta_normalization,[],[f20])).
% 0.20/0.27 thf(f23,definition,(
% 0.20/0.27 spl1_1 <=> ! [X2 : $o] : ($true = X2)),
% 0.20/0.27 introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition])).
% 0.20/0.27 thf(f24,plain,(
% 0.20/0.27 ( ! [X2 : $o] : (($true = X2)) ) | ~spl1_1),
% 0.20/0.27 inference(avatar_component_clause,[],[f23])).
% 0.20/0.27 thf(f26,definition,(
% 0.20/0.27 spl1_2 <=> ! [X1 : $i] : ($false = ((in @ X1 @ emptyset)))),
% 0.20/0.27 introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition])).
% 0.20/0.27 thf(f27,plain,(
% 0.20/0.27 ( ! [X1 : $i] : (($false = ((in @ X1 @ emptyset)))) ) | ~spl1_2),
% 0.20/0.27 inference(avatar_component_clause,[],[f26])).
% 0.20/0.27 thf(f28,plain,(
% 0.20/0.27 spl1_1 | spl1_2),
% 0.20/0.27 inference(avatar_split_clause,[],[f21,f26,f23])).
% 0.20/0.27 thf(f29,plain,(
% 0.20/0.27 ($true = $false) | ~spl1_2),
% 0.20/0.27 inference(constrained_superposition,[],[f27,f13])).
% 0.20/0.27 thf(f33,plain,(
% 0.20/0.27 $false | ~spl1_2),
% 0.20/0.27 inference(trivial_inequality_removal,[],[f29])).
% 0.20/0.27 thf(f34,plain,(
% 0.20/0.27 ~spl1_2),
% 0.20/0.27 inference(avatar_contradiction_clause,[],[f33])).
% 0.20/0.27 thf(f38,plain,(
% 0.20/0.27 $false | ~spl1_1),
% 0.20/0.27 inference(forward_subsumption_resolution,[],[f14,f24])).
% 0.20/0.27 thf(f39,plain,(
% 0.20/0.27 ~spl1_1),
% 0.20/0.27 inference(avatar_contradiction_clause,[],[f38])).
% 0.20/0.27 cnf(s1, plain, spl1_1 | spl1_2, inference(sat_conversion,[],[f28])).
% 0.20/0.27 cnf(s3, plain, ~spl1_2, inference(sat_conversion,[],[f34])).
% 0.20/0.27 cnf(s4, plain, ~spl1_1, inference(sat_conversion,[],[f39])).
% 0.20/0.27 cnf(s5, plain, $false, inference(rat,[],[s1,s3,s4])).
% 0.20/0.27 thf(f40,plain,(
% 0.20/0.27 $false),
% 0.20/0.27 inference(avatar_sat_refutation,[],[s5])).
% 0.20/0.27 % SZS output end Proof for theBenchmark
% 0.20/0.27 % (2877979)------------------------------
% 0.20/0.27 % (2877979)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (2877979)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (2877979)CaDiCaL version: 2.1.3
% 0.20/0.27 % (2877979)Termination reason: Refutation
% 0.20/0.27 % (2877979)Time elapsed: 0.002 s
% 0.20/0.27 % (2877979)Peak memory usage: 12 MB
% 0.20/0.27 % (2877979)Instructions burned: 2 (million)
% 0.20/0.27 % (2877961)Success in time 0.038 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------