%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV385^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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:39:26 AM UTC 2026
% Result : Theorem 0.61s 0.38s
% Output : Refutation 0.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV385^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.25 % Computer : n008.cluster.edu
% 0.10/0.25 % Model : x86_64 x86_64
% 0.10/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.25 % Memory : 8046.5625MB
% 0.10/0.25 % OS : Linux 6.8.0-71-generic
% 0.10/0.25 % CPULimit : 300
% 0.10/0.25 % WCLimit : 300
% 0.10/0.25 % DateTime : Tue Sep 29 15:44:09 UTC 2026
% 0.10/0.26 % CPUTime :
% 0.10/0.26 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.25/0.30 Running first-order model finding
% 0.25/0.30 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.61/0.38 % (3319107)Will run a generic schedule for satisfiability detection.
% 0.61/0.38 % (3319116)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2897170236:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.61/0.38 % (3319116)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.61/0.38 % (3319112)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=850454456_2999 on theBenchmark for (2999ds/0Mi)
% 0.61/0.38 % Exception at run slice level
% 0.61/0.38 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.61/0.38 % (3319113)% WARNING: option uhcvi not known.
% 0.61/0.38 % (3319118)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3840897099:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.61/0.38 % (3319114)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3040984245:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.61/0.38 % (3319115)dis+10_1_sil=32000:sp=arity:random_seed=3826562606:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.61/0.38 % (3319117)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2033790599:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.61/0.38 % (3319113)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3117711008:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.61/0.38 % (3319113)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.61/0.38 % (3319113)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.61/0.38 % (3319122)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=912098441:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.61/0.38 % Exception at run slice level
% 0.61/0.38 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.61/0.38 % (3319118) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3319107-3319118"...
% 0.61/0.38 % (3319118)...printing done.
% 0.61/0.38 % (3319118)Refutation found. Thanks to Tanya!
% 0.61/0.38 % SZS status Theorem for theBenchmark
% 0.61/0.38 % SZS output start Proof for theBenchmark
% 0.61/0.38 thf(type_def_5, type, b: $tType).
% 0.61/0.38 thf(type_def_6, type, a: $tType).
% 0.61/0.38 thf(type_def_7, type, sTfun: ($tType * $tType) > $tType).
% 0.61/0.38 thf(func_def_0, type, x: b).
% 0.61/0.38 thf(func_def_1, type, y: a).
% 0.61/0.38 thf(func_def_3, type, vAND: ($o > $o > $o)).
% 0.61/0.38 thf(func_def_4, type, db0: !>[X0: $tType]:(X0)).
% 0.61/0.38 thf(func_def_5, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.61/0.38 thf(func_def_6, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.61/0.38 thf(func_def_7, type, db1: !>[X0: $tType]:(X0)).
% 0.61/0.38 thf(func_def_8, type, sK0: ((b > a) > a)).
% 0.61/0.38 thf(func_def_9, type, sK1: ((b > a) > b)).
% 0.61/0.38 thf(func_def_12, type, sK2: ((b > a) > b > b)).
% 0.61/0.38 thf(func_def_14, type, sK4: ((b > b > a) > b)).
% 0.61/0.38 thf(func_def_15, type, db2: !>[X0: $tType]:(X0)).
% 0.61/0.38 thf(func_def_16, type, db3: !>[X0: $tType]:(X0)).
% 0.61/0.38 thf(func_def_17, type, sK5: (b > b)).
% 0.61/0.38 thf(f1,conjecture,(
% 0.61/0.38 ? [X0 : (b > a)] : (! [X2 : a] : ((y = X2) => ? [X3 : b] : ((^[X4 : b] : ((X2 = ((X0 @ X4))) & (x = X4))) = (((^[X5 : b, X6 : b] : ((X5 = X6))) @ X3)))) & ! [X1 : b] : ((x = X1) => (y = ((X0 @ X1)))))),
% 0.61/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cX6004_pme)).
% 0.61/0.39 thf(f2,negated_conjecture,(
% 0.61/0.39 ~ ? [X0 : (b > a)] : (! [X2 : a] : ((y = X2) => ? [X3 : b] : ((^[X4 : b] : ((X2 = ((X0 @ X4))) & (x = X4))) = (((^[X5 : b, X6 : b] : ((X5 = X6))) @ X3)))) & ! [X1 : b] : ((x = X1) => (y = ((X0 @ X1)))))),
% 0.61/0.39 inference(negated_conjecture,[status(cth)],[f1])).
% 0.61/0.39 thf(f3,plain,(
% 0.61/0.39 ~ ? [X0 : (b > a)] : (! [X1 : a] : ((y = X1) => ? [X2 : b] : ((^[X3 : b] : ((((X0 @ X3)) = X1) & (x = X3))) = (((^[X4 : b, X5 : b] : ((X4 = X5))) @ X2)))) & ! [X6 : b] : ((x = X6) => (y = ((X0 @ X6)))))),
% 0.61/0.39 inference(rectify,[],[f2])).
% 0.61/0.39 thf(f4,plain,(
% 0.61/0.39 ~ ? [X0 : (b > a)] : (! [X1 : a] : ((y = X1) => ? [X2 : b] : ((^[Y0 : b]: ((x = Y0) & ((X0 @ Y0) = X1))) = (((^[Y0 : b]: ((^[Y1 : b]: (Y0 = Y1)))) @ X2)))) & ! [X6 : b] : ((x = X6) => (y = ((X0 @ X6)))))),
% 0.61/0.39 inference(fool_elimination,[],[f3])).
% 0.61/0.39 thf(f5,plain,(
% 0.61/0.39 ~ ? [X0 : (b > a)] : (! [X1 : a] : ((y = X1) => ? [X2 : b] : ((^[Y0 : b]: ((x = Y0) & ((X0 @ Y0) = X1))) = (((^[Y0 : b]: ((^[Y1 : b]: (Y0 = Y1)))) @ X2)))) & ! [X3 : b] : ((x = X3) => (y = ((X0 @ X3)))))),
% 0.61/0.39 inference(rectify,[],[f4])).
% 0.61/0.39 thf(f6,plain,(
% 0.61/0.39 ! [X0 : (b > a)] : (? [X1 : a] : (! [X2 : b] : ((^[Y0 : b]: ((x = Y0) & ((X0 @ Y0) = X1))) != (((^[Y0 : b]: ((^[Y1 : b]: (Y0 = Y1)))) @ X2))) & (y = X1)) | ? [X3 : b] : ((y != ((X0 @ X3))) & (x = X3)))),
% 0.61/0.39 inference(ennf_transformation,[],[f5])).
% 0.61/0.39 thf(f7,plain,(
% 0.61/0.39 ! [X0 : (b > a)] : ((! [X2 : b] : ((((^[Y0 : b]: ((^[Y1 : b]: (Y0 = Y1)))) @ X2)) != (^[Y0 : b]: ((x = Y0) & ((X0 @ Y0) = (sK0 @ X0))))) & (y = ((sK0 @ X0)))) | ((y != ((X0 @ (sK1 @ X0)))) & (x = ((sK1 @ X0)))))),
% 0.61/0.39 inference(skolemize,[status(esa),new_symbols(skolem,[vAPP,vAPP]),skolemize(X3,sK1 @ X0),skolemize(X3,sK1 @ X0)],[f6])).
% 0.61/0.39 thf(f9,plain,(
% 0.61/0.39 ( ! [X0 : (b > a)] : ((y != ((X0 @ (sK1 @ X0)))) | (y = ((sK0 @ X0)))) )),
% 0.61/0.39 inference(cnf_transformation,[],[f7])).
% 0.61/0.39 thf(f11,plain,(
% 0.61/0.39 ( ! [X2 : b,X0 : (b > a)] : (((((^[Y0 : b]: ((^[Y1 : b]: (Y0 = Y1)))) @ X2)) != (^[Y0 : b]: ((x = Y0) & ((X0 @ Y0) = (sK0 @ X0))))) | (y != ((X0 @ (sK1 @ X0))))) )),
% 0.61/0.39 inference(cnf_transformation,[],[f7])).
% 0.61/0.39 thf(f15,plain,(
% 0.61/0.39 ( ! [X2 : b,X0 : (b > a)] : ((y != ((X0 @ (sK1 @ X0)))) | ((^[Y0 : b]: ((x = Y0) & ((X0 @ Y0) = (sK0 @ X0)))) != ((= @ X2)))) )),
% 0.61/0.39 inference(beta-eta_normalization,[],[f11])).
% 0.61/0.39 thf(f17,plain,(
% 0.61/0.39 (y = ((sK0 @ (^[Y0 : b]: (y)))))),
% 0.61/0.39 inference(equality_resolution,[],[f9])).
% 0.61/0.39 thf(f121,plain,(
% 0.61/0.39 ( ! [X0 : b] : ((((= @ X0)) != (^[Y0 : b]: ((x = Y0) & (((^[Y1 : b]: (y)) @ Y0) = (sK0 @ (^[Y1 : b]: (y)))))))) )),
% 0.61/0.39 inference(equality_resolution,[],[f15])).
% 0.61/0.39 thf(f122,plain,(
% 0.61/0.39 ( ! [X0 : b] : ((((= @ X0)) != (^[Y0 : b]: ((x = Y0) & (y = (sK0 @ (^[Y1 : b]: (y)))))))) )),
% 0.61/0.39 inference(beta-eta_normalization,[],[f121])).
% 0.61/0.39 thf(f190,plain,(
% 0.61/0.39 ( ! [X0 : b] : ((((X0 = (sK5 @ X0))) != (((^[Y0 : b]: ((x = Y0) & (y = (sK0 @ (^[Y1 : b]: (y)))))) @ (sK5 @ X0))))) )),
% 0.61/0.39 inference(negative_extensionality,[],[f122])).
% 0.61/0.39 thf(f191,plain,(
% 0.61/0.39 ( ! [X0 : b] : (($true = ((X0 = (sK5 @ X0)))) | ($true = (((^[Y0 : b]: ((x = Y0) & (y = (sK0 @ (^[Y1 : b]: (y)))))) @ (sK5 @ X0))))) )),
% 0.61/0.39 inference(xor_proxy_clausification,[],[f190])).
% 0.61/0.39 thf(f192,plain,(
% 0.61/0.39 ( ! [X0 : b] : (($false = ((X0 = (sK5 @ X0)))) | ($false = (((^[Y0 : b]: ((x = Y0) & (y = (sK0 @ (^[Y1 : b]: (y)))))) @ (sK5 @ X0))))) )),
% 0.61/0.39 inference(xor_proxy_clausification,[],[f190])).
% 0.61/0.39 thf(f193,plain,(
% 0.61/0.39 ( ! [X0 : b] : ((((sK5 @ X0)) != X0) | ($false = (((^[Y0 : b]: ((x = Y0) & (y = (sK0 @ (^[Y1 : b]: (y)))))) @ (sK5 @ X0))))) )),
% 0.61/0.39 inference(equality_proxy_clausification,[],[f192])).
% 0.61/0.39 thf(f194,plain,(
% 0.61/0.39 ( ! [X0 : b] : ((((sK5 @ X0)) != X0) | ($false = (((x = (sK5 @ X0)) & (y = (sK0 @ (^[Y0 : b]: (y)))))))) )),
% 0.61/0.39 inference(beta-eta_normalization,[],[f193])).
% 0.61/0.39 thf(f195,plain,(
% 0.61/0.39 ( ! [X0 : b] : ((((sK5 @ X0)) != X0) | ($false = ((y = (sK0 @ (^[Y0 : b]: (y)))))) | ($false = ((x = (sK5 @ X0))))) )),
% 0.61/0.39 inference(and_proxy_clausification,[],[f194])).
% 0.61/0.39 thf(f196,plain,(
% 0.61/0.39 ( ! [X0 : b] : ((((sK5 @ X0)) != X0) | (y != ((sK0 @ (^[Y0 : b]: (y))))) | ($false = ((x = (sK5 @ X0))))) )),
% 0.61/0.39 inference(equality_proxy_clausification,[],[f195])).
% 0.61/0.39 thf(f197,plain,(
% 0.61/0.39 ( ! [X0 : b] : ((((sK5 @ X0)) != X0) | (y != ((sK0 @ (^[Y0 : b]: (y))))) | (x != ((sK5 @ X0)))) )),
% 0.61/0.39 inference(equality_proxy_clausification,[],[f196])).
% 0.61/0.39 thf(f198,plain,(
% 0.61/0.39 ( ! [X0 : b] : ((((sK5 @ X0)) = X0) | ($true = (((^[Y0 : b]: ((x = Y0) & (y = (sK0 @ (^[Y1 : b]: (y)))))) @ (sK5 @ X0))))) )),
% 0.61/0.39 inference(equality_proxy_clausification,[],[f191])).
% 0.61/0.39 thf(f199,plain,(
% 0.61/0.39 ( ! [X0 : b] : ((((sK5 @ X0)) = X0) | ($true = (((x = (sK5 @ X0)) & (y = (sK0 @ (^[Y0 : b]: (y)))))))) )),
% 0.61/0.39 inference(beta-eta_normalization,[],[f198])).
% 0.61/0.39 thf(f201,plain,(
% 0.61/0.39 ( ! [X0 : b] : ((((sK5 @ X0)) = X0) | ($true = ((x = (sK5 @ X0))))) )),
% 0.61/0.39 inference(and_proxy_clausification,[],[f199])).
% 0.61/0.39 thf(f202,plain,(
% 0.61/0.39 ( ! [X0 : b] : ((((sK5 @ X0)) = X0) | (x = ((sK5 @ X0)))) )),
% 0.61/0.39 inference(equality_proxy_clausification,[],[f201])).
% 0.61/0.39 thf(f205,definition,(
% 0.61/0.39 spl3_4 <=> (y = ((sK0 @ (^[Y0 : b]: (y)))))),
% 0.61/0.39 introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition])).
% 0.61/0.39 thf(f207,plain,(
% 0.61/0.39 (y != ((sK0 @ (^[Y0 : b]: (y))))) | spl3_4),
% 0.61/0.39 inference(avatar_component_clause,[],[f205])).
% 0.61/0.39 thf(f209,definition,(
% 0.61/0.39 spl3_5 <=> ! [X0 : b] : ((((sK5 @ X0)) != X0) | (x != ((sK5 @ X0))))),
% 0.61/0.39 introduced(definition,[new_symbols(definition,[spl3_5])],[avatar_definition])).
% 0.61/0.39 thf(f210,plain,(
% 0.61/0.39 ( ! [X0 : b] : ((x != ((sK5 @ X0))) | (((sK5 @ X0)) != X0)) ) | ~spl3_5),
% 0.61/0.39 inference(avatar_component_clause,[],[f209])).
% 0.61/0.39 thf(f211,plain,(
% 0.61/0.39 ~spl3_4 | spl3_5),
% 0.61/0.39 inference(avatar_split_clause,[],[f197,f209,f205])).
% 0.61/0.39 thf(f213,plain,(
% 0.61/0.39 (y != y) | spl3_4),
% 0.61/0.39 inference(constrained_superposition,[],[f207,f17])).
% 0.61/0.39 thf(f214,plain,(
% 0.61/0.39 $false | spl3_4),
% 0.61/0.39 inference(trivial_inequality_removal,[],[f213])).
% 0.61/0.39 thf(f215,plain,(
% 0.61/0.39 spl3_4),
% 0.61/0.39 inference(avatar_contradiction_clause,[],[f214])).
% 0.61/0.39 thf(f217,plain,(
% 0.61/0.39 ( ! [X0 : b] : ((x != X0) | (x = ((sK5 @ X0)))) )),
% 0.61/0.39 inference(equality_factoring,[],[f202])).
% 0.61/0.39 thf(f219,plain,(
% 0.61/0.39 (x = ((sK5 @ x)))),
% 0.61/0.39 inference(equality_resolution,[],[f217])).
% 0.61/0.39 thf(f223,plain,(
% 0.61/0.39 (x != x) | (x != x) | ~spl3_5),
% 0.61/0.39 inference(constrained_superposition,[],[f210,f219])).
% 0.61/0.39 thf(f224,plain,(
% 0.61/0.39 (x != x) | ~spl3_5),
% 0.61/0.39 inference(duplicate_literal_removal,[],[f223])).
% 0.61/0.39 thf(f225,plain,(
% 0.61/0.39 $false | ~spl3_5),
% 0.61/0.39 inference(trivial_inequality_removal,[],[f224])).
% 0.61/0.39 thf(f226,plain,(
% 0.61/0.39 ~spl3_5),
% 0.61/0.39 inference(avatar_contradiction_clause,[],[f225])).
% 0.61/0.39 cnf(s4, plain, ~spl3_4 | spl3_5, inference(sat_conversion,[],[f211])).
% 0.61/0.39 cnf(s5, plain, spl3_4, inference(sat_conversion,[],[f215])).
% 0.61/0.39 cnf(s6, plain, ~spl3_5, inference(sat_conversion,[],[f226])).
% 0.61/0.39 cnf(s7, plain, $false, inference(rat,[],[s4,s6,s5])).
% 0.61/0.39 thf(f229,plain,(
% 0.61/0.39 $false),
% 0.61/0.39 inference(avatar_sat_refutation,[],[s7])).
% 0.61/0.39 % SZS output end Proof for theBenchmark
% 0.61/0.39 % (3319118)------------------------------
% 0.61/0.39 % (3319118)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.61/0.39 % (3319118)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.61/0.39 % (3319118)CaDiCaL version: 2.1.3
% 0.61/0.39 % (3319118)Termination reason: Refutation
% 0.61/0.39 % (3319118)Time elapsed: 0.028 s
% 0.61/0.39 % (3319118)Peak memory usage: 13 MB
% 0.61/0.39 % (3319118)Instructions burned: 26 (million)
% 0.61/0.39 % (3319107)Success in time 0.066 s
% 0.61/0.39 % Vampire exiting
%------------------------------------------------------------------------------