%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU884^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 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:31:52 AM UTC 2026
% Result : Theorem 0.10s 0.25s
% Output : Refutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU884^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.17 % Computer : n015.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Tue Sep 29 14:47:18 UTC 2026
% 0.10/0.17 % CPUTime :
% 0.10/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.20 Running higher-order theorem proving
% 0.10/0.21 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.25 % (3617977)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.10/0.25 % (3617984)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=3888136788:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.10/0.25 % (3617984) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3617977-3617984"...
% 0.10/0.25 % (3617984)...printing done.
% 0.10/0.25 % (3617984)Refutation found. Thanks to Tanya!
% 0.10/0.25 % SZS status Theorem for theBenchmark
% 0.10/0.25 % SZS output start Proof for theBenchmark
% 0.10/0.25 thf(type_def_5, type, a: $tType).
% 0.10/0.25 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.10/0.25 thf(func_def_0, type, cS: (a > $o)).
% 0.10/0.25 thf(func_def_1, type, cR: (a > $o)).
% 0.10/0.25 thf(func_def_5, type, sK0: (a > a)).
% 0.10/0.25 thf(func_def_6, type, sK1: a).
% 0.10/0.25 thf(func_def_7, type, vNOT: ($o > $o)).
% 0.10/0.25 thf(f1,conjecture,(
% 0.10/0.25 ! [X0 : a] : (? [X1 : a] : ((cR @ X1) & (X0 = X1)) => ? [X1 : a] : ((X0 = X1) & (cS @ X1))) => ! [X0 : a] : ((cR @ X0) => (cS @ X0))),
% 0.10/0.25 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM30B_pme)).
% 0.10/0.25 thf(f2,negated_conjecture,(
% 0.10/0.25 ~(! [X0 : a] : (? [X1 : a] : ((cR @ X1) & (X0 = X1)) => ? [X1 : a] : ((X0 = X1) & (cS @ X1))) => ! [X0 : a] : ((cR @ X0) => (cS @ X0)))),
% 0.10/0.25 inference(negated_conjecture,[status(cth)],[f1])).
% 0.10/0.25 thf(f3,plain,(
% 0.10/0.25 ~(! [X0 : a] : (? [X1 : a] : ((cR @ X1) & (X0 = X1)) => ? [X2 : a] : ((X0 = X2) & (cS @ X2))) => ! [X3 : a] : ((cR @ X3) => (cS @ X3)))),
% 0.10/0.25 inference(rectify,[],[f2])).
% 0.10/0.25 thf(f4,plain,(
% 0.10/0.25 ~(! [X0 : a] : (? [X1 : a] : ((((cR @ X1)) = $true) & (X0 = X1)) => ? [X2 : a] : ((X0 = X2) & ($true = ((cS @ X2))))) => ! [X3 : a] : (($true = ((cR @ X3))) => ($true = ((cS @ X3)))))),
% 0.10/0.25 inference(fool_elimination,[],[f3])).
% 0.10/0.25 thf(f5,plain,(
% 0.10/0.25 ! [X0 : a] : (? [X2 : a] : ((X0 = X2) & ($true = ((cS @ X2)))) | ! [X1 : a] : ((((cR @ X1)) != $true) | (X0 != X1))) & ? [X3 : a] : (($true = ((cR @ X3))) & ($true != ((cS @ X3))))),
% 0.10/0.25 inference(ennf_transformation,[],[f4])).
% 0.10/0.25 thf(f6,plain,(
% 0.10/0.25 ! [X0 : a] : (? [X1 : a] : ((X0 = X1) & (((cS @ X1)) = $true)) | ! [X2 : a] : (($true != ((cR @ X2))) | (X0 != X2))) & ? [X3 : a] : (($true = ((cR @ X3))) & ($true != ((cS @ X3))))),
% 0.10/0.25 inference(rectify,[],[f5])).
% 0.10/0.25 thf(f7,plain,(
% 0.10/0.25 ! [X0 : a] : (((((sK0 @ X0)) = X0) & ($true = ((cS @ (sK0 @ X0))))) | ! [X2 : a] : (($true != ((cR @ X2))) | (X0 != X2))) & (($true = ((cR @ sK1))) & ($true != ((cS @ sK1))))),
% 0.10/0.25 inference(skolemize,[status(esa),new_symbols(skolem,[vAPP,sK1]),skolemize(X1,sK0 @ X0),skolemize(X3,sK1)],[f6])).
% 0.10/0.25 thf(f8,plain,(
% 0.10/0.25 ($true != ((cS @ sK1)))),
% 0.10/0.25 inference(cnf_transformation,[],[f7])).
% 0.10/0.25 thf(f9,plain,(
% 0.10/0.25 ($true = ((cR @ sK1)))),
% 0.10/0.25 inference(cnf_transformation,[],[f7])).
% 0.10/0.25 thf(f10,plain,(
% 0.10/0.25 ( ! [X2 : a,X0 : a] : (($true = ((cS @ (sK0 @ X0)))) | ($true != ((cR @ X2))) | (X0 != X2)) )),
% 0.10/0.25 inference(cnf_transformation,[],[f7])).
% 0.10/0.25 thf(f11,plain,(
% 0.10/0.25 ( ! [X2 : a,X0 : a] : ((((sK0 @ X0)) = X0) | ($true != ((cR @ X2))) | (X0 != X2)) )),
% 0.10/0.25 inference(cnf_transformation,[],[f7])).
% 0.10/0.25 thf(f14,plain,(
% 0.10/0.25 ( ! [X2 : a] : (($true != ((cR @ X2))) | (((sK0 @ X2)) = X2)) )),
% 0.10/0.25 inference(equality_resolution,[],[f11])).
% 0.10/0.25 thf(f15,plain,(
% 0.10/0.25 ( ! [X2 : a] : (($true != ((cR @ X2))) | ($true = ((cS @ (sK0 @ X2))))) )),
% 0.10/0.25 inference(equality_resolution,[],[f10])).
% 0.10/0.25 thf(f16,plain,(
% 0.10/0.25 ($true != $true) | (sK1 = ((sK0 @ sK1)))),
% 0.10/0.25 inference(constrained_superposition,[],[f14,f9])).
% 0.10/0.25 thf(f17,plain,(
% 0.10/0.25 (sK1 = ((sK0 @ sK1)))),
% 0.10/0.25 inference(trivial_inequality_removal,[],[f16])).
% 0.10/0.25 thf(f18,plain,(
% 0.10/0.25 ($true != $true) | ($true = ((cS @ (sK0 @ sK1))))),
% 0.10/0.25 inference(constrained_superposition,[],[f15,f9])).
% 0.10/0.25 thf(f19,plain,(
% 0.10/0.25 ($true = ((cS @ (sK0 @ sK1))))),
% 0.10/0.25 inference(trivial_inequality_removal,[],[f18])).
% 0.10/0.25 thf(f20,plain,(
% 0.10/0.25 ($true = ((cS @ sK1)))),
% 0.10/0.25 inference(forward_demodulation,[],[f19,f17])).
% 0.10/0.25 thf(f21,plain,(
% 0.10/0.25 $false),
% 0.10/0.25 inference(forward_subsumption_resolution,[],[f20,f8])).
% 0.10/0.25 % SZS output end Proof for theBenchmark
% 0.10/0.25 % (3617984)------------------------------
% 0.10/0.25 % (3617984)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.25 % (3617984)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.25 % (3617984)CaDiCaL version: 2.1.3
% 0.10/0.25 % (3617984)Termination reason: Refutation
% 0.10/0.25 % (3617984)Time elapsed: 0.001 s
% 0.10/0.25 % (3617984)Peak memory usage: 12 MB
% 0.10/0.25 % (3617984)Instructions burned: 1 (million)
% 0.10/0.25 % (3617977)Success in time 0.031 s
% 0.10/0.26 % Vampire exiting
%------------------------------------------------------------------------------