%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV195^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n019.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:08 AM UTC 2026
% Result : Theorem 0.36s 0.42s
% Output : Refutation 0.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEV195^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.28 % Computer : n019.cluster.edu
% 0.11/0.28 % Model : x86_64 x86_64
% 0.11/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.28 % Memory : 8046.5625MB
% 0.11/0.28 % OS : Linux 6.8.0-71-generic
% 0.11/0.28 % CPULimit : 300
% 0.11/0.28 % WCLimit : 300
% 0.11/0.28 % DateTime : Tue Sep 29 15:20:18 UTC 2026
% 0.11/0.29 % CPUTime :
% 0.11/0.29 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.29/0.34 Running first-order model finding
% 0.29/0.34 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.36/0.42 % (910306)Will run a generic schedule for satisfiability detection.
% 0.36/0.42 % (910311)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2356516384_2999 on theBenchmark for (2999ds/0Mi)
% 0.36/0.42 % Exception at run slice level
% 0.36/0.42 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.36/0.42 % (910312)% WARNING: option uhcvi not known.
% 0.36/0.42 % (910315)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2289859393:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.36/0.42 % (910312)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3185660515:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.36/0.42 % (910314)dis+10_1_sil=32000:sp=arity:random_seed=3135592791:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.36/0.42 % (910313)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3813592147:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.36/0.42 % (910315)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.36/0.42 % (910312)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.36/0.42 % (910316)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3233825156:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.36/0.42 % (910317)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4113395060:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.36/0.42 % (910312)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.36/0.42 % (910319)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=673275415:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.36/0.42 % Exception at run slice level
% 0.36/0.42 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.36/0.42 % (910314) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-910306-910314"...
% 0.36/0.42 % (910314)...printing done.
% 0.36/0.42 % (910314)Refutation found. Thanks to Tanya!
% 0.36/0.42 % SZS status Theorem for theBenchmark
% 0.36/0.42 % SZS output start Proof for theBenchmark
% 0.36/0.42 thf(type_def_5, type, a: $tType).
% 0.36/0.42 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.36/0.42 thf(func_def_0, type, cP: (a > a > a)).
% 0.36/0.42 thf(func_def_1, type, cZ: a).
% 0.36/0.42 thf(func_def_5, type, sK0: a).
% 0.36/0.42 thf(func_def_6, type, sK1: ((a > $o) > a)).
% 0.36/0.42 thf(func_def_7, type, sK2: ((a > $o) > a)).
% 0.36/0.42 thf(func_def_8, type, vNOT: ($o > $o)).
% 0.36/0.42 thf(func_def_9, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.36/0.42 thf(func_def_10, type, db0: !>[X0: $tType]:(X0)).
% 0.36/0.42 thf(func_def_11, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.36/0.42 thf(f1,conjecture,(
% 0.36/0.42 (! [X4 : (a > $o)] : ((! [X0 : a,X1 : a] : (((X4 @ X1) & (X4 @ X0)) => (X4 @ (cP @ X0 @ X1))) & (X4 @ cZ)) => ! [X0 : a] : (X4 @ X0)) & ! [X0 : a,X1 : a,X2 : a,X3 : a] : ((((cP @ X0 @ X2)) = ((cP @ X1 @ X3))) => ((X2 = X3) & (X0 = X1))) & ! [X0 : a,X1 : a] : (((cP @ X0 @ X1)) != cZ)) => ! [X0 : a] : (? [X1 : a,X5 : a] : (X0 = ((cP @ X1 @ X5))) | (X0 = cZ))),
% 0.36/0.42 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cS_LEM1D_pme)).
% 0.36/0.42 thf(f2,negated_conjecture,(
% 0.36/0.42 ~((! [X4 : (a > $o)] : ((! [X0 : a,X1 : a] : (((X4 @ X1) & (X4 @ X0)) => (X4 @ (cP @ X0 @ X1))) & (X4 @ cZ)) => ! [X0 : a] : (X4 @ X0)) & ! [X0 : a,X1 : a,X2 : a,X3 : a] : ((((cP @ X0 @ X2)) = ((cP @ X1 @ X3))) => ((X2 = X3) & (X0 = X1))) & ! [X0 : a,X1 : a] : (((cP @ X0 @ X1)) != cZ)) => ! [X0 : a] : (? [X1 : a,X5 : a] : (X0 = ((cP @ X1 @ X5))) | (X0 = cZ)))),
% 0.36/0.42 inference(negated_conjecture,[status(cth)],[f1])).
% 0.36/0.42 thf(f3,plain,(
% 0.36/0.42 ~((! [X0 : (a > $o)] : ((! [X1 : a,X2 : a] : (((X0 @ X2) & (X0 @ X1)) => (X0 @ (cP @ X1 @ X2))) & (X0 @ cZ)) => ! [X3 : a] : (X0 @ X3)) & ! [X4 : a,X5 : a,X6 : a,X7 : a] : ((((cP @ X4 @ X6)) = ((cP @ X5 @ X7))) => ((X6 = X7) & (X4 = X5))) & ! [X8 : a,X9 : a] : (cZ != ((cP @ X8 @ X9)))) => ! [X10 : a] : (? [X11 : a,X12 : a] : (((cP @ X11 @ X12)) = X10) | (cZ = X10)))),
% 0.36/0.42 inference(rectify,[],[f2])).
% 0.36/0.42 thf(f4,plain,(
% 0.36/0.42 ~((! [X0 : (a > $o)] : ((! [X1 : a,X2 : a] : (((((X0 @ X2)) = $true) & (((X0 @ X1)) = $true)) => (((X0 @ (cP @ X1 @ X2))) = $true)) & (((X0 @ cZ)) = $true)) => ! [X3 : a] : (((X0 @ X3)) = $true)) & ! [X4 : a,X5 : a,X6 : a,X7 : a] : ((((cP @ X4 @ X6)) = ((cP @ X5 @ X7))) => ((X6 = X7) & (X4 = X5))) & ! [X8 : a,X9 : a] : (cZ != ((cP @ X8 @ X9)))) => ! [X10 : a] : (? [X11 : a,X12 : a] : (((cP @ X11 @ X12)) = X10) | (cZ = X10)))),
% 0.36/0.42 inference(fool_elimination,[],[f3])).
% 0.36/0.42 thf(f5,plain,(
% 0.36/0.42 ? [X10 : a] : (! [X11 : a,X12 : a] : (((cP @ X11 @ X12)) != X10) & (cZ != X10)) & (! [X0 : (a > $o)] : (! [X3 : a] : (((X0 @ X3)) = $true) | (? [X1 : a,X2 : a] : ((((X0 @ (cP @ X1 @ X2))) != $true) & ((((X0 @ X2)) = $true) & (((X0 @ X1)) = $true))) | (((X0 @ cZ)) != $true))) & ! [X4 : a,X5 : a,X6 : a,X7 : a] : (((X6 = X7) & (X4 = X5)) | (((cP @ X4 @ X6)) != ((cP @ X5 @ X7)))) & ! [X8 : a,X9 : a] : (cZ != ((cP @ X8 @ X9))))),
% 0.36/0.42 inference(ennf_transformation,[],[f4])).
% 0.36/0.42 thf(f6,plain,(
% 0.36/0.42 ? [X10 : a] : (! [X11 : a,X12 : a] : (((cP @ X11 @ X12)) != X10) & (cZ != X10)) & ! [X0 : (a > $o)] : (! [X3 : a] : (((X0 @ X3)) = $true) | ? [X1 : a,X2 : a] : ((((X0 @ (cP @ X1 @ X2))) != $true) & (((X0 @ X2)) = $true) & (((X0 @ X1)) = $true)) | (((X0 @ cZ)) != $true)) & ! [X4 : a,X5 : a,X6 : a,X7 : a] : (((X6 = X7) & (X4 = X5)) | (((cP @ X4 @ X6)) != ((cP @ X5 @ X7)))) & ! [X8 : a,X9 : a] : (cZ != ((cP @ X8 @ X9)))),
% 0.36/0.42 inference(flattening,[],[f5])).
% 0.36/0.42 thf(f7,plain,(
% 0.36/0.42 ? [X0 : a] : (! [X1 : a,X2 : a] : (((cP @ X1 @ X2)) != X0) & (cZ != X0)) & ! [X3 : (a > $o)] : (! [X4 : a] : ($true = ((X3 @ X4))) | ? [X5 : a,X6 : a] : (($true != ((X3 @ (cP @ X5 @ X6)))) & ($true = ((X3 @ X6))) & ($true = ((X3 @ X5)))) | ($true != ((X3 @ cZ)))) & ! [X7 : a,X8 : a,X9 : a,X10 : a] : (((X9 = X10) & (X7 = X8)) | (((cP @ X7 @ X9)) != ((cP @ X8 @ X10)))) & ! [X11 : a,X12 : a] : (cZ != ((cP @ X11 @ X12)))),
% 0.36/0.42 inference(rectify,[],[f6])).
% 0.36/0.42 thf(f8,plain,(
% 0.36/0.42 (! [X1 : a,X2 : a] : (((cP @ X1 @ X2)) != sK0) & (cZ != sK0)) & ! [X3 : (a > $o)] : (! [X4 : a] : ($true = ((X3 @ X4))) | (($true != ((X3 @ (cP @ (sK1 @ X3) @ (sK2 @ X3))))) & ($true = ((X3 @ (sK2 @ X3)))) & ($true = ((X3 @ (sK1 @ X3))))) | ($true != ((X3 @ cZ)))) & ! [X7 : a,X8 : a,X9 : a,X10 : a] : (((X9 = X10) & (X7 = X8)) | (((cP @ X7 @ X9)) != ((cP @ X8 @ X10)))) & ! [X11 : a,X12 : a] : (cZ != ((cP @ X11 @ X12)))),
% 0.36/0.42 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,vAPP,vAPP]),skolemize(X0,sK0),skolemize(X6,sK2 @ X3),skolemize(X6,sK2 @ X3)],[f7])).
% 0.36/0.42 thf(f14,plain,(
% 0.36/0.42 ( ! [X3 : (a > $o),X4 : a] : (($true != ((X3 @ (cP @ (sK1 @ X3) @ (sK2 @ X3))))) | ($true = ((X3 @ X4))) | ($true != ((X3 @ cZ)))) )),
% 0.36/0.42 inference(cnf_transformation,[],[f8])).
% 0.36/0.42 thf(f15,plain,(
% 0.36/0.42 (cZ != sK0)),
% 0.36/0.42 inference(cnf_transformation,[],[f8])).
% 0.36/0.42 thf(f16,plain,(
% 0.36/0.42 ( ! [X2 : a,X1 : a] : ((((cP @ X1 @ X2)) != sK0)) )),
% 0.36/0.42 inference(cnf_transformation,[],[f8])).
% 0.36/0.42 thf(f84,plain,(
% 0.36/0.42 ( ! [X0 : a] : ((((cP @ (sK1 @ (^[Y0 : a]: (~ (Y0 = X0)))) @ (sK2 @ (^[Y0 : a]: (~ (Y0 = X0)))))) = X0) | ($true != (((^[Y0 : a]: (~ (Y0 = X0))) @ cZ)))) )),
% 0.36/0.42 inference(leibniz_equality_elimination,[],[f14])).
% 0.36/0.42 thf(f108,plain,(
% 0.36/0.42 ( ! [X0 : a] : ((((cP @ (sK1 @ (^[Y0 : a]: (~ (Y0 = X0)))) @ (sK2 @ (^[Y0 : a]: (~ (Y0 = X0)))))) = X0) | ($true != ((~ (cZ = X0))))) )),
% 0.36/0.42 inference(beta-eta_normalization,[],[f84])).
% 0.36/0.42 thf(f109,plain,(
% 0.36/0.42 ( ! [X0 : a] : ((((cP @ (sK1 @ (^[Y0 : a]: (~ (Y0 = X0)))) @ (sK2 @ (^[Y0 : a]: (~ (Y0 = X0)))))) = X0) | ($true = ((cZ = X0)))) )),
% 0.36/0.42 inference(not_proxy_clausification,[],[f108])).
% 0.36/0.42 thf(f110,plain,(
% 0.36/0.42 ( ! [X0 : a] : ((((cP @ (sK1 @ (^[Y0 : a]: (~ (Y0 = X0)))) @ (sK2 @ (^[Y0 : a]: (~ (Y0 = X0)))))) = X0) | (cZ = X0)) )),
% 0.36/0.42 inference(equality_proxy_clausification,[],[f109])).
% 0.36/0.42 thf(f545,plain,(
% 0.36/0.42 ( ! [X0 : a] : ((sK0 != X0) | (cZ = X0)) )),
% 0.36/0.42 inference(constrained_superposition,[],[f16,f110])).
% 0.36/0.42 thf(f557,plain,(
% 0.36/0.42 (cZ = sK0)),
% 0.36/0.42 inference(equality_resolution,[],[f545])).
% 0.36/0.42 thf(f558,plain,(
% 0.36/0.42 $false),
% 0.36/0.42 inference(forward_subsumption_resolution,[],[f557,f15])).
% 0.36/0.42 % SZS output end Proof for theBenchmark
% 0.36/0.42 % (910314)------------------------------
% 0.36/0.42 % (910314)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.42 % (910314)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.42 % (910314)CaDiCaL version: 2.1.3
% 0.36/0.42 % (910314)Termination reason: Refutation
% 0.36/0.42 % (910314)Time elapsed: 0.019 s
% 0.36/0.42 % (910314)Peak memory usage: 12 MB
% 0.36/0.42 % (910314)Instructions burned: 25 (million)
% 0.36/0.42 % (910306)Success in time 0.063 s
% 0.36/0.42 % Vampire exiting
%------------------------------------------------------------------------------