%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV228^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 : n003.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:11 AM UTC 2026
% Result : Theorem 0.26s 0.35s
% Output : Refutation 0.26s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEV228^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.10/0.26 % Computer : n003.cluster.edu
% 0.10/0.26 % Model : x86_64 x86_64
% 0.10/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.26 % Memory : 8046.5625MB
% 0.10/0.26 % OS : Linux 6.8.0-71-generic
% 0.10/0.26 % CPULimit : 300
% 0.10/0.26 % WCLimit : 300
% 0.10/0.26 % DateTime : Tue Sep 29 15:24:59 UTC 2026
% 0.10/0.26 % CPUTime :
% 0.10/0.26 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.26/0.31 Running first-order model finding
% 0.26/0.31 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.26/0.35 % (2637443)Will run a generic schedule for satisfiability detection.
% 0.26/0.35 % (2637452)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=378862459:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.26/0.35 % (2637452)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.26/0.35 % (2637452) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2637443-2637452"...
% 0.26/0.35 % (2637452)...printing done.
% 0.26/0.35 % (2637452)Refutation found. Thanks to Tanya!
% 0.26/0.35 % SZS status Theorem for theBenchmark
% 0.26/0.35 % SZS output start Proof for theBenchmark
% 0.26/0.35 thf(type_def_5, type, a: $tType).
% 0.26/0.35 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.26/0.35 thf(func_def_0, type, cS: (a > $o)).
% 0.26/0.35 thf(func_def_4, type, sK0: a).
% 0.26/0.35 thf(func_def_5, type, sK1: ((a > $o) > a)).
% 0.26/0.35 thf(func_def_6, type, vNOT: ($o > $o)).
% 0.26/0.35 thf(func_def_7, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.26/0.35 thf(func_def_8, type, db0: !>[X0: $tType]:(X0)).
% 0.26/0.35 thf(func_def_9, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.26/0.35 thf(f1,conjecture,(
% 0.26/0.35 ! [X0 : a] : ((cS @ X0) => ? [X1 : (a > $o)] : ((X1 @ X0) & ! [X2 : a] : ((X1 @ X2) => (cS @ X2))))),
% 0.26/0.35 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM91A_pme)).
% 0.26/0.35 thf(f2,negated_conjecture,(
% 0.26/0.35 ~ ! [X0 : a] : ((cS @ X0) => ? [X1 : (a > $o)] : ((X1 @ X0) & ! [X2 : a] : ((X1 @ X2) => (cS @ X2))))),
% 0.26/0.35 inference(negated_conjecture,[status(cth)],[f1])).
% 0.26/0.35 thf(f3,plain,(
% 0.26/0.35 ~ ! [X0 : a] : ((cS @ X0) => ? [X1 : (a > $o)] : ((X1 @ X0) & ! [X2 : a] : ((X1 @ X2) => (cS @ X2))))),
% 0.26/0.35 inference(rectify,[],[f2])).
% 0.26/0.35 thf(f4,plain,(
% 0.26/0.35 ~ ! [X0 : a] : ((((cS @ X0)) = $true) => ? [X1 : (a > $o)] : ((((X1 @ X0)) = $true) & ! [X2 : a] : ((((X1 @ X2)) = $true) => (((cS @ X2)) = $true))))),
% 0.26/0.35 inference(fool_elimination,[],[f3])).
% 0.26/0.35 thf(f5,plain,(
% 0.26/0.35 ? [X0 : a] : (! [X1 : (a > $o)] : ((((X1 @ X0)) != $true) | ? [X2 : a] : ((((cS @ X2)) != $true) & (((X1 @ X2)) = $true))) & (((cS @ X0)) = $true))),
% 0.26/0.35 inference(ennf_transformation,[],[f4])).
% 0.26/0.35 thf(f6,plain,(
% 0.26/0.35 ! [X1 : (a > $o)] : (($true != ((X1 @ sK0))) | (($true != ((cS @ (sK1 @ X1)))) & ($true = ((X1 @ (sK1 @ X1)))))) & ($true = ((cS @ sK0)))),
% 0.26/0.35 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,vAPP]),skolemize(X0,sK0),skolemize(X2,sK1 @ X1)],[f5])).
% 0.26/0.35 thf(f7,plain,(
% 0.26/0.35 ($true = ((cS @ sK0)))),
% 0.26/0.35 inference(cnf_transformation,[],[f6])).
% 0.26/0.35 thf(f8,plain,(
% 0.26/0.35 ( ! [X1 : (a > $o)] : (($true = ((X1 @ (sK1 @ X1)))) | ($true != ((X1 @ sK0)))) )),
% 0.26/0.35 inference(cnf_transformation,[],[f6])).
% 0.26/0.35 thf(f9,plain,(
% 0.26/0.35 ( ! [X1 : (a > $o)] : (($true != ((cS @ (sK1 @ X1)))) | ($true != ((X1 @ sK0)))) )),
% 0.26/0.35 inference(cnf_transformation,[],[f6])).
% 0.26/0.35 thf(f12,plain,(
% 0.26/0.35 (sK0 = ((sK1 @ (= @ sK0))))),
% 0.26/0.35 inference(leibniz_equality_elimination,[],[f8])).
% 0.26/0.35 thf(f24,plain,(
% 0.26/0.35 ($true != ((cS @ sK0))) | ($true != ((sK0 = sK0)))),
% 0.26/0.35 inference(constrained_superposition,[],[f9,f12])).
% 0.26/0.35 thf(f31,plain,(
% 0.26/0.35 ($true != ((cS @ sK0))) | (sK0 != sK0)),
% 0.26/0.35 inference(equality_proxy_clausification,[],[f24])).
% 0.26/0.35 thf(f32,plain,(
% 0.26/0.35 ($true != ((cS @ sK0)))),
% 0.26/0.35 inference(trivial_inequality_removal,[],[f31])).
% 0.26/0.35 thf(f34,plain,(
% 0.26/0.35 $false),
% 0.26/0.35 inference(forward_subsumption_resolution,[],[f32,f7])).
% 0.26/0.35 % SZS output end Proof for theBenchmark
% 0.26/0.35 % (2637452)------------------------------
% 0.26/0.35 % (2637452)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.35 % (2637452)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.35 % (2637452)CaDiCaL version: 2.1.3
% 0.26/0.35 % (2637452)Termination reason: Refutation
% 0.26/0.35 % (2637452)Time elapsed: 0.002 s
% 0.26/0.35 % (2637452)Peak memory usage: 12 MB
% 0.26/0.35 % (2637452)Instructions burned: 2 (million)
% 0.26/0.35 % (2637443)Success in time 0.025 s
% 0.26/0.35 % Vampire exiting
%------------------------------------------------------------------------------