%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU957^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 : n002.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:02 AM UTC 2026
% Result : Theorem 0.26s 0.37s
% Output : Refutation 0.26s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU957^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.26 % Computer : n002.cluster.edu
% 0.12/0.26 % Model : x86_64 x86_64
% 0.12/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.26 % Memory : 8046.5625MB
% 0.12/0.26 % OS : Linux 6.8.0-71-generic
% 0.12/0.26 % CPULimit : 300
% 0.12/0.26 % WCLimit : 300
% 0.12/0.26 % DateTime : Tue Sep 29 14:53:38 UTC 2026
% 0.12/0.26 % CPUTime :
% 0.12/0.26 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.31 Running higher-order theorem proving
% 0.26/0.33 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.26/0.37 % (1396939)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.26/0.37 % (1396946)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1166860765:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.26/0.37 % (1396946) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1396939-1396946"...
% 0.26/0.37 % (1396946)...printing done.
% 0.26/0.37 % (1396946)Refutation found. Thanks to Tanya!
% 0.26/0.37 % SZS status Theorem for theBenchmark
% 0.26/0.37 % SZS output start Proof for theBenchmark
% 0.26/0.37 thf(type_def_5, type, a: $tType).
% 0.26/0.37 thf(type_def_6, type, b: $tType).
% 0.26/0.37 thf(type_def_7, type, sTfun: ($tType * $tType) > $tType).
% 0.26/0.37 thf(func_def_3, type, sK0: (a > b)).
% 0.26/0.37 thf(func_def_4, type, sK1: (b > a)).
% 0.26/0.37 thf(func_def_5, type, sK2: ((b > a) > b)).
% 0.26/0.37 thf(func_def_6, type, sK3: ((b > a) > b)).
% 0.26/0.37 thf(func_def_7, type, sK4: ((a > $o) > a)).
% 0.26/0.37 thf(func_def_8, type, vNOT: ($o > $o)).
% 0.26/0.37 thf(func_def_9, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.26/0.37 thf(func_def_10, type, db0: !>[X0: $tType]:(X0)).
% 0.26/0.37 thf(func_def_11, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.26/0.37 thf(f1,conjecture,(
% 0.26/0.37 ? [X0 : ((a > $o) > a)] : ! [X1 : (a > $o)] : (? [X2 : a] : (X1 @ X2) => (X1 @ (X0 @ X1))) => (? [X3 : (a > b)] : ! [X4 : b] : ? [X1 : a] : (((X3 @ X1)) = X4) => ? [X5 : (b > a)] : ! [X7 : b,X6 : b] : ((((X5 @ X6)) = ((X5 @ X7))) => (X6 = X7)))),
% 0.26/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM607_pme)).
% 0.26/0.37 thf(f2,negated_conjecture,(
% 0.26/0.37 ~(? [X0 : ((a > $o) > a)] : ! [X1 : (a > $o)] : (? [X2 : a] : (X1 @ X2) => (X1 @ (X0 @ X1))) => (? [X3 : (a > b)] : ! [X4 : b] : ? [X1 : a] : (((X3 @ X1)) = X4) => ? [X5 : (b > a)] : ! [X7 : b,X6 : b] : ((((X5 @ X6)) = ((X5 @ X7))) => (X6 = X7))))),
% 0.26/0.37 inference(negated_conjecture,[status(cth)],[f1])).
% 0.26/0.37 thf(f3,plain,(
% 0.26/0.37 ~(? [X0 : ((a > $o) > a)] : ! [X1 : (a > $o)] : (? [X2 : a] : (X1 @ X2) => (X1 @ (X0 @ X1))) => (? [X3 : (a > b)] : ! [X4 : b] : ? [X5 : a] : (((X3 @ X5)) = X4) => ? [X6 : (b > a)] : ! [X7 : b,X8 : b] : ((((X6 @ X8)) = ((X6 @ X7))) => (X7 = X8))))),
% 0.26/0.37 inference(rectify,[],[f2])).
% 0.26/0.37 thf(f4,plain,(
% 0.26/0.37 ~(? [X0 : ((a > $o) > a)] : ! [X1 : (a > $o)] : (? [X2 : a] : (((X1 @ X2)) = $true) => (((X1 @ (X0 @ X1))) = $true)) => (? [X3 : (a > b)] : ! [X4 : b] : ? [X5 : a] : (((X3 @ X5)) = X4) => ? [X6 : (b > a)] : ! [X8 : b,X7 : b] : ((((X6 @ X8)) = ((X6 @ X7))) => (X7 = X8))))),
% 0.26/0.37 inference(fool_elimination,[],[f3])).
% 0.26/0.37 thf(f5,plain,(
% 0.26/0.37 (! [X6 : (b > a)] : ? [X8 : b,X7 : b] : ((X7 != X8) & (((X6 @ X8)) = ((X6 @ X7)))) & ? [X3 : (a > b)] : ! [X4 : b] : ? [X5 : a] : (((X3 @ X5)) = X4)) & ? [X0 : ((a > $o) > a)] : ! [X1 : (a > $o)] : (! [X2 : a] : (((X1 @ X2)) != $true) | (((X1 @ (X0 @ X1))) = $true))),
% 0.26/0.37 inference(ennf_transformation,[],[f4])).
% 0.26/0.37 thf(f6,plain,(
% 0.26/0.37 ? [X3 : (a > b)] : ! [X4 : b] : ? [X5 : a] : (((X3 @ X5)) = X4) & ! [X6 : (b > a)] : ? [X8 : b,X7 : b] : ((X7 != X8) & (((X6 @ X8)) = ((X6 @ X7)))) & ? [X0 : ((a > $o) > a)] : ! [X1 : (a > $o)] : (! [X2 : a] : (((X1 @ X2)) != $true) | (((X1 @ (X0 @ X1))) = $true))),
% 0.26/0.37 inference(flattening,[],[f5])).
% 0.26/0.37 thf(f7,plain,(
% 0.26/0.37 ? [X0 : (a > b)] : ! [X1 : b] : ? [X2 : a] : (((X0 @ X2)) = X1) & ! [X3 : (b > a)] : ? [X4 : b,X5 : b] : ((X4 != X5) & (((X3 @ X5)) = ((X3 @ X4)))) & ? [X6 : ((a > $o) > a)] : ! [X7 : (a > $o)] : (! [X8 : a] : ($true != ((X7 @ X8))) | ($true = ((X7 @ (X6 @ X7)))))),
% 0.26/0.37 inference(rectify,[],[f6])).
% 0.26/0.37 thf(f8,plain,(
% 0.26/0.37 ! [X1 : b] : (((sK0 @ (sK1 @ X1))) = X1) & ! [X3 : (b > a)] : ((((sK3 @ X3)) != ((sK2 @ X3))) & (((X3 @ (sK2 @ X3))) = ((X3 @ (sK3 @ X3))))) & ! [X7 : (a > $o)] : (! [X8 : a] : ($true != ((X7 @ X8))) | (((X7 @ (sK4 @ X7))) = $true))),
% 0.26/0.37 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,vAPP,vAPP,vAPP,sK4]),skolemize(X0,sK0),skolemize(X5,sK3 @ X3),skolemize(X5,sK3 @ X3),skolemize(X5,sK3 @ X3),skolemize(X6,sK4)],[f7])).
% 0.26/0.37 thf(f10,plain,(
% 0.26/0.37 ( ! [X3 : (b > a)] : ((((X3 @ (sK2 @ X3))) = ((X3 @ (sK3 @ X3))))) )),
% 0.26/0.37 inference(cnf_transformation,[],[f8])).
% 0.26/0.37 thf(f11,plain,(
% 0.26/0.37 ( ! [X3 : (b > a)] : ((((sK3 @ X3)) != ((sK2 @ X3)))) )),
% 0.26/0.37 inference(cnf_transformation,[],[f8])).
% 0.26/0.37 thf(f12,plain,(
% 0.26/0.37 ( ! [X1 : b] : ((((sK0 @ (sK1 @ X1))) = X1)) )),
% 0.26/0.37 inference(cnf_transformation,[],[f8])).
% 0.26/0.37 thf(f24,plain,(
% 0.26/0.37 (((sK2 @ sK1)) = ((sK0 @ (sK1 @ (sK3 @ sK1)))))),
% 0.26/0.37 inference(constrained_superposition,[],[f12,f10])).
% 0.26/0.37 thf(f25,plain,(
% 0.26/0.37 (((sK2 @ sK1)) = ((sK3 @ sK1)))),
% 0.26/0.37 inference(forward_demodulation,[],[f24,f12])).
% 0.26/0.37 thf(f26,plain,(
% 0.26/0.37 $false),
% 0.26/0.37 inference(forward_subsumption_resolution,[],[f25,f11])).
% 0.26/0.37 % SZS output end Proof for theBenchmark
% 0.26/0.37 % (1396946)------------------------------
% 0.26/0.37 % (1396946)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.37 % (1396946)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.37 % (1396946)CaDiCaL version: 2.1.3
% 0.26/0.37 % (1396946)Termination reason: Refutation
% 0.26/0.37 % (1396946)Time elapsed: 0.002 s
% 0.26/0.37 % (1396946)Peak memory usage: 12 MB
% 0.26/0.37 % (1396946)Instructions burned: 2 (million)
% 0.26/0.37 % (1396939)Success in time 0.029 s
% 0.26/0.37 % Vampire exiting
%------------------------------------------------------------------------------