%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV410^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 : n015.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:28 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 : SEV410^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 % Computer : n015.cluster.edu
% 0.09/0.21 % Model : x86_64 x86_64
% 0.09/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.21 % Memory : 8046.5625MB
% 0.09/0.21 % OS : Linux 6.8.0-71-generic
% 0.09/0.21 % CPULimit : 300
% 0.09/0.21 % WCLimit : 300
% 0.09/0.21 % DateTime : Tue Sep 29 15:48:33 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.21 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.24 Running first-order model finding
% 0.09/0.24 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.21/0.28 % (3694797)Will run a generic schedule for satisfiability detection.
% 0.21/0.28 % (3694807)dis+10_1_sil=32000:sp=arity:random_seed=672959349:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.21/0.28 % (3694805)% WARNING: option uhcvi not known.
% 0.21/0.28 % (3694804)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3255003981_3000 on theBenchmark for (3000ds/0Mi)
% 0.21/0.28 % (3694806)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4035363626:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.21/0.28 % (3694805)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2033461170:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 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 % (3694808)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2478149499:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.21/0.28 % (3694805)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.21/0.28 % (3694809)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2807252404:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.21/0.28 % (3694805)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.21/0.28 % (3694810)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=10517319:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.21/0.28 % (3694808)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.21/0.28 % (3694807) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3694797-3694807"...
% 0.21/0.28 % (3694810) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3694797-3694810"...
% 0.21/0.28 % (3694807)...printing done.
% 0.21/0.28 % (3694807)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, cA: ($i > $o)).
% 0.21/0.28 thf(func_def_1, type, cP: (($i > $o) > $o)).
% 0.21/0.28 thf(func_def_2, type, cB: ($i > $o)).
% 0.21/0.28 thf(func_def_4, type, vOR: ($o > $o > $o)).
% 0.21/0.28 thf(func_def_5, type, db0: !>[X0: $tType]:(X0)).
% 0.21/0.28 thf(func_def_6, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.21/0.28 thf(func_def_9, type, sK0: (($i > $o) > $i)).
% 0.21/0.28 thf(func_def_10, type, vNOT: ($o > $o)).
% 0.21/0.28 thf(func_def_12, type, db1: !>[X0: $tType]:(X0)).
% 0.21/0.28 thf(func_def_13, type, sK2: (($i > $i > $o) > ($i > $i > $o) > $i)).
% 0.21/0.28 thf(func_def_14, type, db2: !>[X0: $tType]:(X0)).
% 0.21/0.28 thf(func_def_15, type, sK3: (($i > $i > $o) > $i)).
% 0.21/0.28 thf(func_def_16, type, sK4: (($i > $i > $o) > $i)).
% 0.21/0.28 thf(f1,conjecture,(
% 0.21/0.28 (cP @ (^[X0 : $i] : ((cB @ X0) | (cA @ X0)))) => ? [X1 : ($i > $o)] : (! [X0 : $i] : ((cA @ X0) => (X1 @ X0)) & (cP @ X1))),
% 0.21/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cSV1_pme)).
% 0.21/0.28 thf(f2,negated_conjecture,(
% 0.21/0.28 ~((cP @ (^[X0 : $i] : ((cB @ X0) | (cA @ X0)))) => ? [X1 : ($i > $o)] : (! [X0 : $i] : ((cA @ X0) => (X1 @ X0)) & (cP @ X1)))),
% 0.21/0.28 inference(negated_conjecture,[status(cth)],[f1])).
% 0.21/0.28 thf(f3,plain,(
% 0.21/0.28 ~((cP @ (^[X0 : $i] : ((cB @ X0) | (cA @ X0)))) => ? [X1 : ($i > $o)] : (! [X2 : $i] : ((cA @ X2) => (X1 @ X2)) & (cP @ X1)))),
% 0.21/0.28 inference(rectify,[],[f2])).
% 0.21/0.28 thf(f4,plain,(
% 0.21/0.28 ~((((cP @ (^[Y0 : $i]: ((cA @ Y0) | (cB @ Y0))))) = $true) => ? [X1 : ($i > $o)] : (! [X2 : $i] : ((((cA @ X2)) = $true) => (((X1 @ X2)) = $true)) & (((cP @ X1)) = $true)))),
% 0.21/0.28 inference(fool_elimination,[],[f3])).
% 0.21/0.28 thf(f5,plain,(
% 0.21/0.28 ~((((cP @ (^[Y0 : $i]: ((cA @ Y0) | (cB @ Y0))))) = $true) => ? [X0 : ($i > $o)] : (! [X1 : $i] : (($true = ((cA @ X1))) => ($true = ((X0 @ X1)))) & ($true = ((cP @ X0)))))),
% 0.21/0.28 inference(rectify,[],[f4])).
% 0.21/0.28 thf(f6,plain,(
% 0.21/0.28 ! [X0 : ($i > $o)] : (? [X1 : $i] : (($true != ((X0 @ X1))) & ($true = ((cA @ X1)))) | ($true != ((cP @ X0)))) & (((cP @ (^[Y0 : $i]: ((cA @ Y0) | (cB @ Y0))))) = $true)),
% 0.21/0.28 inference(ennf_transformation,[],[f5])).
% 0.21/0.28 thf(f7,plain,(
% 0.21/0.28 ! [X0 : ($i > $o)] : ((($true != ((X0 @ (sK0 @ X0)))) & ($true = ((cA @ (sK0 @ X0))))) | ($true != ((cP @ X0)))) & (((cP @ (^[Y0 : $i]: ((cA @ Y0) | (cB @ Y0))))) = $true)),
% 0.21/0.28 inference(skolemize,[status(esa),new_symbols(skolem,[vAPP]),skolemize(X1,sK0 @ X0)],[f6])).
% 0.21/0.28 thf(f8,plain,(
% 0.21/0.28 (((cP @ (^[Y0 : $i]: ((cA @ Y0) | (cB @ Y0))))) = $true)),
% 0.21/0.28 inference(cnf_transformation,[],[f7])).
% 0.21/0.28 thf(f9,plain,(
% 0.21/0.28 ( ! [X0 : ($i > $o)] : (($true != ((cP @ X0))) | ($true = ((cA @ (sK0 @ X0))))) )),
% 0.21/0.28 inference(cnf_transformation,[],[f7])).
% 0.21/0.28 thf(f10,plain,(
% 0.21/0.28 ( ! [X0 : ($i > $o)] : (($true != ((X0 @ (sK0 @ X0)))) | ($true != ((cP @ X0)))) )),
% 0.21/0.28 inference(cnf_transformation,[],[f7])).
% 0.21/0.28 thf(f12,definition,(
% 0.21/0.28 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.21/0.28 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.21/0.28 thf(f32,plain,(
% 0.21/0.28 ($true != $true) | ($true = ((cA @ (sK0 @ (^[Y0 : $i]: ((cA @ Y0) | (cB @ Y0)))))))),
% 0.21/0.28 inference(constrained_superposition,[],[f9,f8])).
% 0.21/0.28 thf(f36,plain,(
% 0.21/0.28 ($true = ((cA @ (sK0 @ (^[Y0 : $i]: ((cA @ Y0) | (cB @ Y0)))))))),
% 0.21/0.28 inference(trivial_inequality_removal,[],[f32])).
% 0.21/0.28 thf(f42,plain,(
% 0.21/0.28 ( ! [X0 : ($i > $o)] : (($true != $true) | ($true != ((cP @ X0))) | (((X0 @ (sK0 @ X0))) = $false)) )),
% 0.21/0.28 inference(constrained_superposition,[],[f10,f12])).
% 0.21/0.28 thf(f44,plain,(
% 0.21/0.28 ( ! [X0 : ($i > $o)] : (($true != ((cP @ X0))) | (((X0 @ (sK0 @ X0))) = $false)) )),
% 0.21/0.28 inference(trivial_inequality_removal,[],[f42])).
% 0.21/0.28 thf(f53,plain,(
% 0.21/0.28 ($true != $true) | ($false = (((^[Y0 : $i]: ((cA @ Y0) | (cB @ Y0))) @ (sK0 @ (^[Y0 : $i]: ((cA @ Y0) | (cB @ Y0)))))))),
% 0.21/0.28 inference(constrained_superposition,[],[f44,f8])).
% 0.21/0.28 thf(f56,plain,(
% 0.21/0.28 ($false = (((^[Y0 : $i]: ((cA @ Y0) | (cB @ Y0))) @ (sK0 @ (^[Y0 : $i]: ((cA @ Y0) | (cB @ Y0)))))))),
% 0.21/0.28 inference(trivial_inequality_removal,[],[f53])).
% 0.21/0.28 thf(f57,plain,(
% 0.21/0.28 ($false = (((cA @ (sK0 @ (^[Y0 : $i]: ((cA @ Y0) | (cB @ Y0))))) | (cB @ (sK0 @ (^[Y0 : $i]: ((cA @ Y0) | (cB @ Y0))))))))),
% 0.21/0.28 inference(beta-eta_normalization,[],[f56])).
% 0.21/0.28 thf(f59,plain,(
% 0.21/0.28 ($false = ((cA @ (sK0 @ (^[Y0 : $i]: ((cA @ Y0) | (cB @ Y0)))))))),
% 0.21/0.28 inference(or_proxy_clausification,[],[f57])).
% 0.21/0.28 thf(f313,plain,(
% 0.21/0.28 ($true = $false)),
% 0.21/0.28 inference(constrained_superposition,[],[f36,f59])).
% 0.21/0.28 thf(f317,plain,(
% 0.21/0.28 $false),
% 0.21/0.28 inference(trivial_inequality_removal,[],[f313])).
% 0.21/0.28 % SZS output end Proof for theBenchmark
% 0.21/0.28 % (3694807)------------------------------
% 0.21/0.28 % (3694807)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (3694807)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (3694807)CaDiCaL version: 2.1.3
% 0.21/0.28 % (3694807)Termination reason: Refutation
% 0.21/0.28 % (3694807)Time elapsed: 0.010 s
% 0.21/0.28 % (3694807)Peak memory usage: 12 MB
% 0.21/0.28 % (3694807)Instructions burned: 31 (million)
% 0.21/0.28 % (3694797)Success in time 0.025 s
% 0.21/0.28 % Vampire exiting
%------------------------------------------------------------------------------