%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV290^5 : TPTP v9.3.1. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:38:12 AM UTC 2026
% Result : Theorem 0.11s 0.24s
% Output : Refutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV290^5 : TPTP v9.3.1. Bugfixed v5.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.16 % Computer : n007.cluster.edu
% 0.11/0.16 % Model : x86_64 x86_64
% 0.11/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.16 % Memory : 8046.5625MB
% 0.11/0.16 % OS : Linux 6.8.0-71-generic
% 0.11/0.16 % CPULimit : 300
% 0.11/0.16 % WCLimit : 300
% 0.11/0.16 % DateTime : Tue Sep 29 15:29:26 UTC 2026
% 0.11/0.16 % CPUTime :
% 0.11/0.16 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.19 Running higher-order theorem proving
% 0.11/0.20 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.11/0.24 % (3507956)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.11/0.24 % (3507963)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2559862519:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.11/0.24 % (3507963) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3507956-3507963"...
% 0.11/0.24 % (3507963)...printing done.
% 0.11/0.24 % (3507963)Refutation found. Thanks to Tanya!
% 0.11/0.24 % SZS status Theorem for theBenchmark
% 0.11/0.24 % SZS output start Proof for theBenchmark
% 0.11/0.24 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.11/0.24 thf(func_def_0, type, c0: (($i > $o) > $o)).
% 0.11/0.24 thf(func_def_1, type, cSUCC: ((($i > $o) > $o) > ($i > $o) > $o)).
% 0.11/0.24 thf(func_def_2, type, c_less__eq_: ((($i > $o) > $o) > (($i > $o) > $o) > $o)).
% 0.11/0.24 thf(func_def_4, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.11/0.24 thf(func_def_5, type, vIMP: ($o > $o > $o)).
% 0.11/0.24 thf(func_def_6, type, vAND: ($o > $o > $o)).
% 0.11/0.24 thf(func_def_7, type, db0: !>[X0: $tType]:(X0)).
% 0.11/0.24 thf(func_def_8, type, db2: !>[X0: $tType]:(X0)).
% 0.11/0.24 thf(func_def_9, type, db1: !>[X0: $tType]:(X0)).
% 0.11/0.24 thf(func_def_10, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.11/0.24 thf(func_def_11, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.11/0.24 thf(func_def_12, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.11/0.24 thf(func_def_13, type, vNOT: ($o > $o)).
% 0.11/0.24 thf(func_def_16, type, sK0: (((($i > $o) > $o) > $o) > ($i > $o) > $o)).
% 0.11/0.24 thf(f3,conjecture,(
% 0.11/0.24 ? [X0 : ((($i > $o) > $o) > $o)] : ! [X1 : (($i > $o) > $o)] : ((X0 @ X1) => (c_less__eq_ @ X1 @ c0))),
% 0.11/0.24 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBLEDSOE1)).
% 0.11/0.24 thf(f4,negated_conjecture,(
% 0.11/0.24 ~ ? [X0 : ((($i > $o) > $o) > $o)] : ! [X1 : (($i > $o) > $o)] : ((X0 @ X1) => (c_less__eq_ @ X1 @ c0))),
% 0.11/0.24 inference(negated_conjecture,[status(cth)],[f3])).
% 0.11/0.24 thf(f9,plain,(
% 0.11/0.24 ~ ? [X0 : ((($i > $o) > $o) > $o)] : ! [X1 : (($i > $o) > $o)] : ((X0 @ X1) => (c_less__eq_ @ X1 @ c0))),
% 0.11/0.24 inference(rectify,[],[f4])).
% 0.11/0.24 thf(f10,plain,(
% 0.11/0.24 ~ ? [X0 : ((($i > $o) > $o) > $o)] : ! [X1 : (($i > $o) > $o)] : ((((X0 @ X1)) = $true) => (((c_less__eq_ @ X1 @ c0)) = $true))),
% 0.11/0.24 inference(fool_elimination,[],[f9])).
% 0.11/0.24 thf(f11,plain,(
% 0.11/0.24 ! [X0 : ((($i > $o) > $o) > $o)] : ? [X1 : (($i > $o) > $o)] : ((((c_less__eq_ @ X1 @ c0)) != $true) & (((X0 @ X1)) = $true))),
% 0.11/0.24 inference(ennf_transformation,[],[f10])).
% 0.11/0.24 thf(f12,plain,(
% 0.11/0.24 ! [X0 : ((($i > $o) > $o) > $o)] : (($true != ((c_less__eq_ @ (sK0 @ X0) @ c0))) & (((X0 @ (sK0 @ X0))) = $true))),
% 0.11/0.24 inference(skolemize,[status(esa),new_symbols(skolem,[vAPP]),skolemize(X1,sK0 @ X0)],[f11])).
% 0.11/0.24 thf(f13,plain,(
% 0.11/0.24 ( ! [X0 : ((($i > $o) > $o) > $o)] : ((((X0 @ (sK0 @ X0))) = $true)) )),
% 0.11/0.24 inference(cnf_transformation,[],[f12])).
% 0.11/0.24 thf(f23,plain,(
% 0.11/0.24 ((((^[Y0 : ($i > $o) > $o]: ($false)) @ (sK0 @ (^[Y0 : ($i > $o) > $o]: ($false))))) = $true)),
% 0.11/0.24 inference(primitive_instantiation,[],[f13])).
% 0.11/0.24 thf(f26,plain,(
% 0.11/0.24 ($false = $true)),
% 0.11/0.24 inference(beta-eta_normalization,[],[f23])).
% 0.11/0.24 thf(f27,plain,(
% 0.11/0.24 $false),
% 0.11/0.24 inference(trivial_inequality_removal,[],[f26])).
% 0.11/0.24 % SZS output end Proof for theBenchmark
% 0.11/0.24 % (3507963)------------------------------
% 0.11/0.24 % (3507963)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.24 % (3507963)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.24 % (3507963)CaDiCaL version: 2.1.3
% 0.11/0.24 % (3507963)Termination reason: Refutation
% 0.11/0.24 % (3507963)Time elapsed: 0.001 s
% 0.11/0.24 % (3507963)Peak memory usage: 12 MB
% 0.11/0.24 % (3507963)Instructions burned: 2 (million)
% 0.11/0.24 % (3507956)Success in time 0.028 s
% 0.11/0.24 % Vampire exiting
%------------------------------------------------------------------------------