%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU957^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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:34:28 AM UTC 2026
% Result : Theorem 0.30s 0.26s
% Output : Refutation 0.30s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU957^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n003.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 14:52:43 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.30/0.26 % (2610804)Will run a generic schedule for satisfiability detection.
% 0.30/0.26 % (2610812)dis+10_1_sil=32000:sp=arity:random_seed=3923596415:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.30/0.26 % (2610811)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3430867290:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.30/0.26 % (2610809)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=597695610_2999 on theBenchmark for (2999ds/0Mi)
% 0.30/0.26 % Exception at run slice level
% 0.30/0.26 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.30/0.26 % (2610812) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2610804-2610812"...
% 0.30/0.26 % (2610812)...printing done.
% 0.30/0.26 % (2610812)Refutation found. Thanks to Tanya!
% 0.30/0.26 % SZS status Theorem for theBenchmark
% 0.30/0.26 % SZS output start Proof for theBenchmark
% 0.30/0.26 thf(type_def_5, type, a: $tType).
% 0.30/0.26 thf(type_def_6, type, b: $tType).
% 0.30/0.26 thf(type_def_7, type, sTfun: ($tType * $tType) > $tType).
% 0.30/0.26 thf(func_def_3, type, sK0: ((b > a) > b)).
% 0.30/0.26 thf(func_def_4, type, sK1: ((b > a) > b)).
% 0.30/0.26 thf(func_def_5, type, sK2: (a > b)).
% 0.30/0.26 thf(func_def_6, type, sK3: (b > a)).
% 0.30/0.26 thf(func_def_7, type, sK4: ((a > $o) > a)).
% 0.30/0.26 thf(func_def_8, type, vNOT: ($o > $o)).
% 0.30/0.26 thf(func_def_9, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.30/0.26 thf(func_def_10, type, db0: !>[X0: $tType]:(X0)).
% 0.30/0.26 thf(func_def_11, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.30/0.26 thf(func_def_12, type, db1: !>[X0: $tType]:(X0)).
% 0.30/0.26 thf(f1,conjecture,(
% 0.30/0.26 ? [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)] : ! [X6 : b,X7 : b] : ((((X5 @ X6)) = ((X5 @ X7))) => (X6 = X7)))),
% 0.30/0.26 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM607_pme)).
% 0.30/0.26 thf(f2,negated_conjecture,(
% 0.30/0.26 ~(? [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)] : ! [X6 : b,X7 : b] : ((((X5 @ X6)) = ((X5 @ X7))) => (X6 = X7))))),
% 0.30/0.26 inference(negated_conjecture,[status(cth)],[f1])).
% 0.30/0.26 thf(f3,plain,(
% 0.30/0.26 ~(? [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 @ X7)) = ((X6 @ X8))) => (X7 = X8))))),
% 0.30/0.26 inference(rectify,[],[f2])).
% 0.30/0.26 thf(f4,plain,(
% 0.30/0.26 ~(? [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)] : ! [X7 : b,X8 : b] : ((((X6 @ X7)) = ((X6 @ X8))) => (X7 = X8))))),
% 0.30/0.26 inference(fool_elimination,[],[f3])).
% 0.30/0.26 thf(f5,plain,(
% 0.30/0.26 (! [X6 : (b > a)] : ? [X7 : b,X8 : b] : ((X7 != X8) & (((X6 @ X7)) = ((X6 @ X8)))) & ? [X3 : (a > b)] : ! [X4 : b] : ? [X5 : a] : (((X3 @ X5)) = X4)) & ? [X0 : ((a > $o) > a)] : ! [X1 : (a > $o)] : ((((X1 @ (X0 @ X1))) = $true) | ! [X2 : a] : (((X1 @ X2)) != $true))),
% 0.30/0.26 inference(ennf_transformation,[],[f4])).
% 0.30/0.26 thf(f6,plain,(
% 0.30/0.26 ! [X6 : (b > a)] : ? [X7 : b,X8 : b] : ((X7 != X8) & (((X6 @ X7)) = ((X6 @ X8)))) & ? [X3 : (a > b)] : ! [X4 : b] : ? [X5 : a] : (((X3 @ X5)) = X4) & ? [X0 : ((a > $o) > a)] : ! [X1 : (a > $o)] : ((((X1 @ (X0 @ X1))) = $true) | ! [X2 : a] : (((X1 @ X2)) != $true))),
% 0.30/0.26 inference(flattening,[],[f5])).
% 0.30/0.26 thf(f7,plain,(
% 0.30/0.26 ! [X0 : (b > a)] : ? [X1 : b,X2 : b] : ((X1 != X2) & (((X0 @ X1)) = ((X0 @ X2)))) & ? [X3 : (a > b)] : ! [X4 : b] : ? [X5 : a] : (((X3 @ X5)) = X4) & ? [X6 : ((a > $o) > a)] : ! [X7 : (a > $o)] : (($true = ((X7 @ (X6 @ X7)))) | ! [X8 : a] : ($true != ((X7 @ X8))))),
% 0.30/0.26 inference(rectify,[],[f6])).
% 0.30/0.26 thf(f8,plain,(
% 0.30/0.26 ! [X0 : (b > a)] : ((((sK0 @ X0)) != ((sK1 @ X0))) & (((X0 @ (sK0 @ X0))) = ((X0 @ (sK1 @ X0))))) & ! [X4 : b] : (((sK2 @ (sK3 @ X4))) = X4) & ! [X7 : (a > $o)] : (($true = ((X7 @ (sK4 @ X7)))) | ! [X8 : a] : ($true != ((X7 @ X8))))),
% 0.30/0.26 inference(skolemize,[status(esa),new_symbols(skolem,[vAPP,vAPP,sK2,vAPP,sK4]),skolemize(X5,sK3 @ X4),skolemize(X5,sK3 @ X4),skolemize(X3,sK2),skolemize(X5,sK3 @ X4),skolemize(X6,sK4)],[f7])).
% 0.30/0.26 thf(f10,plain,(
% 0.30/0.26 ( ! [X4 : b] : ((((sK2 @ (sK3 @ X4))) = X4)) )),
% 0.30/0.26 inference(cnf_transformation,[],[f8])).
% 0.30/0.26 thf(f11,plain,(
% 0.30/0.26 ( ! [X0 : (b > a)] : ((((X0 @ (sK0 @ X0))) = ((X0 @ (sK1 @ X0))))) )),
% 0.30/0.26 inference(cnf_transformation,[],[f8])).
% 0.30/0.26 thf(f12,plain,(
% 0.30/0.26 ( ! [X0 : (b > a)] : ((((sK0 @ X0)) != ((sK1 @ X0)))) )),
% 0.30/0.26 inference(cnf_transformation,[],[f8])).
% 0.30/0.26 thf(f27,plain,(
% 0.30/0.26 ( ! [X0 : (b > b),X1 : b] : ((((sK2 @ ((^[Y0 : b]: (sK3 @ (X0 @ Y0))) @ (sK0 @ (^[Y0 : b]: (sK3 @ (X0 @ Y0))))))) = X1) | (((X0 @ (sK1 @ (^[Y0 : b]: (sK3 @ (X0 @ Y0)))))) != X1)) )),
% 0.30/0.26 inference(constrained_superposition,[],[f10,f11])).
% 0.30/0.26 thf(f28,plain,(
% 0.30/0.26 ( ! [X0 : (b > b),X1 : b] : ((((sK2 @ (sK3 @ (X0 @ (sK0 @ (^[Y0 : b]: (sK3 @ (X0 @ Y0)))))))) = X1) | (((X0 @ (sK1 @ (^[Y0 : b]: (sK3 @ (X0 @ Y0)))))) != X1)) )),
% 0.30/0.26 inference(beta-eta_normalization,[],[f27])).
% 0.30/0.26 thf(f29,plain,(
% 0.30/0.26 ( ! [X0 : (b > b),X1 : b] : ((((X0 @ (sK0 @ (^[Y0 : b]: (sK3 @ (X0 @ Y0)))))) = X1) | (((X0 @ (sK1 @ (^[Y0 : b]: (sK3 @ (X0 @ Y0)))))) != X1)) )),
% 0.30/0.26 inference(forward_demodulation,[],[f28,f10])).
% 0.30/0.26 thf(f222,plain,(
% 0.30/0.26 ( ! [X0 : (b > b),X1 : (b > a)] : ((((sK1 @ X1)) != ((X0 @ (sK1 @ (^[Y0 : b]: (sK3 @ (X0 @ Y0))))))) | (((sK0 @ X1)) != ((X0 @ (sK0 @ (^[Y0 : b]: (sK3 @ (X0 @ Y0)))))))) )),
% 0.30/0.26 inference(constrained_superposition,[],[f12,f29])).
% 0.30/0.26 thf(f362,plain,(
% 0.30/0.26 ( ! [X0 : (b > b)] : ((((sK0 @ (^[Y0 : b]: (sK3 @ (X0 @ Y0))))) != (((^[Y0 : b]: (Y0)) @ (sK0 @ (^[Y0 : b]: (sK3 @ ((^[Y1 : b]: (Y1)) @ Y0))))))) | ((^[Y0 : b]: (Y0)) != X0)) )),
% 0.30/0.26 inference(equality_resolution,[],[f222])).
% 0.30/0.26 thf(f365,plain,(
% 0.30/0.26 ( ! [X0 : (b > b)] : ((((sK0 @ (^[Y0 : b]: (sK3 @ (X0 @ Y0))))) != ((sK0 @ sK3))) | ((^[Y0 : b]: (Y0)) != X0)) )),
% 0.30/0.26 inference(beta-eta_normalization,[],[f362])).
% 0.30/0.26 thf(f373,plain,(
% 0.30/0.26 ((^[Y0 : b]: (Y0)) != (^[Y0 : b]: (Y0)))),
% 0.30/0.26 inference(equality_resolution,[],[f365])).
% 0.30/0.26 thf(f374,plain,(
% 0.30/0.26 $false),
% 0.30/0.26 inference(trivial_inequality_removal,[],[f373])).
% 0.30/0.26 % SZS output end Proof for theBenchmark
% 0.30/0.26 % (2610812)------------------------------
% 0.30/0.26 % (2610812)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.26 % (2610812)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.26 % (2610812)CaDiCaL version: 2.1.3
% 0.30/0.26 % (2610812)Termination reason: Refutation
% 0.30/0.26 % (2610812)Time elapsed: 0.010 s
% 0.30/0.26 % (2610812)Peak memory usage: 12 MB
% 0.30/0.26 % (2610812)Instructions burned: 26 (million)
% 0.30/0.26 % (2610804)Success in time 0.033 s
% 0.30/0.26 % Vampire exiting
%------------------------------------------------------------------------------