%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU945^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:00 AM UTC 2026
% Result : Theorem 0.22s 0.29s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU945^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 % Computer : n001.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 14:55:36 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.24 Running higher-order theorem proving
% 0.09/0.25 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.29 % (1346579)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.29 % (1346588)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2663806619:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.22/0.29 % (1346588) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1346579-1346588"...
% 0.22/0.29 % (1346588)...printing done.
% 0.22/0.29 % (1346588)Refutation found. Thanks to Tanya!
% 0.22/0.29 % SZS status Theorem for theBenchmark
% 0.22/0.29 % SZS output start Proof for theBenchmark
% 0.22/0.29 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.22/0.29 thf(func_def_1, type, sK0: (($i > $i > $o) > $i)).
% 0.22/0.29 thf(func_def_2, type, sK1: (($i > $i > $o) > $i)).
% 0.22/0.29 thf(func_def_5, type, vNOT: ($o > $o)).
% 0.22/0.29 thf(func_def_6, type, db0: !>[X0: $tType]:(X0)).
% 0.22/0.29 thf(func_def_7, type, db1: !>[X0: $tType]:(X0)).
% 0.22/0.29 thf(func_def_8, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.22/0.29 thf(func_def_9, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.22/0.29 thf(f1,conjecture,(
% 0.22/0.29 ? [X0 : ($i > $i > $o)] : ! [X2 : $i,X1 : $i] : ((((X0 @ X1)) = ((X0 @ X2))) => (X1 = X2))),
% 0.22/0.29 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM3_pme)).
% 0.22/0.29 thf(f2,negated_conjecture,(
% 0.22/0.29 ~ ? [X0 : ($i > $i > $o)] : ! [X2 : $i,X1 : $i] : ((((X0 @ X1)) = ((X0 @ X2))) => (X1 = X2))),
% 0.22/0.29 inference(negated_conjecture,[status(cth)],[f1])).
% 0.22/0.29 thf(f3,plain,(
% 0.22/0.29 ! [X0 : ($i > $i > $o)] : ? [X1 : $i,X2 : $i] : ((X1 != X2) & (((X0 @ X1)) = ((X0 @ X2))))),
% 0.22/0.29 inference(ennf_transformation,[],[f2])).
% 0.22/0.29 thf(f4,plain,(
% 0.22/0.29 ! [X0 : ($i > $i > $o)] : ((((sK0 @ X0)) != ((sK1 @ X0))) & (((X0 @ (sK1 @ X0))) = ((X0 @ (sK0 @ X0)))))),
% 0.22/0.29 inference(skolemize,[status(esa),new_symbols(skolem,[vAPP,vAPP]),skolemize(X2,sK1 @ X0),skolemize(X2,sK1 @ X0)],[f3])).
% 0.22/0.29 thf(f5,plain,(
% 0.22/0.29 ( ! [X0 : ($i > $i > $o)] : ((((X0 @ (sK1 @ X0))) = ((X0 @ (sK0 @ X0))))) )),
% 0.22/0.29 inference(cnf_transformation,[],[f4])).
% 0.22/0.29 thf(f6,plain,(
% 0.22/0.29 ( ! [X0 : ($i > $i > $o)] : ((((sK0 @ X0)) != ((sK1 @ X0)))) )),
% 0.22/0.29 inference(cnf_transformation,[],[f4])).
% 0.22/0.29 thf(f8,plain,(
% 0.22/0.29 ( ! [X0 : ($i > $i > $o),X1 : $i] : ((((X0 @ (sK1 @ X0) @ X1)) = ((X0 @ (sK0 @ X0) @ X1)))) )),
% 0.22/0.29 inference(argument_congruence,[],[f5])).
% 0.22/0.29 thf(f9,plain,(
% 0.22/0.29 ( ! [X0 : ($i > $i > $o),X1 : $i] : (($true = ((X0 @ (sK1 @ X0) @ X1))) | (((X0 @ (sK0 @ X0) @ X1)) = $false)) )),
% 0.22/0.29 inference(iff_proxy_clausification,[],[f8])).
% 0.22/0.29 thf(f11,plain,(
% 0.22/0.29 ( ! [X1 : $i] : (($true = (((^[Y0 : $i]: ((^[Y1 : $i]: (Y0 = Y1)))) @ (sK1 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y0 = Y1))))) @ X1))) | ((((^[Y0 : $i]: ((^[Y1 : $i]: (Y0 = Y1)))) @ (sK0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (Y0 = Y1))))) @ X1)) = $false)) )),
% 0.22/0.29 inference(primitive_instantiation,[],[f9])).
% 0.22/0.29 thf(f16,plain,(
% 0.22/0.29 ( ! [X1 : $i] : (($true = (((sK1 @ =) = X1))) | ((((sK0 @ =) = X1)) = $false)) )),
% 0.22/0.29 inference(beta-eta_normalization,[],[f11])).
% 0.22/0.29 thf(f17,plain,(
% 0.22/0.29 ( ! [X1 : $i] : (((((sK0 @ =) = X1)) = $false) | (((sK1 @ =)) = X1)) )),
% 0.22/0.29 inference(equality_proxy_clausification,[],[f16])).
% 0.22/0.29 thf(f18,plain,(
% 0.22/0.29 ( ! [X1 : $i] : ((((sK1 @ =)) = X1) | (((sK0 @ =)) != X1)) )),
% 0.22/0.29 inference(equality_proxy_clausification,[],[f17])).
% 0.22/0.29 thf(f32,plain,(
% 0.22/0.29 ( ! [X0 : $i] : ((((sK0 @ =)) != X0) | (((sK0 @ =)) != X0)) )),
% 0.22/0.29 inference(superposition,[],[f6,f18])).
% 0.22/0.29 thf(f36,plain,(
% 0.22/0.29 ( ! [X0 : $i] : ((((sK0 @ =)) != X0)) )),
% 0.22/0.29 inference(duplicate_literal_removal,[],[f32])).
% 0.22/0.29 thf(f40,plain,(
% 0.22/0.29 $false),
% 0.22/0.29 inference(equality_resolution,[],[f36])).
% 0.22/0.29 % SZS output end Proof for theBenchmark
% 0.22/0.29 % (1346588)------------------------------
% 0.22/0.29 % (1346588)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29 % (1346588)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29 % (1346588)CaDiCaL version: 2.1.3
% 0.22/0.29 % (1346588)Termination reason: Refutation
% 0.22/0.29 % (1346588)Time elapsed: 0.001 s
% 0.22/0.29 % (1346588)Peak memory usage: 12 MB
% 0.22/0.29 % (1346588)Instructions burned: 3 (million)
% 0.22/0.29 % (1346579)Success in time 0.029 s
% 0.22/0.29 % Vampire exiting
%------------------------------------------------------------------------------