%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU901^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 : n026.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:22 AM UTC 2026
% Result : Theorem 0.07s 0.24s
% Output : Refutation 0.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU901^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.16 % Computer : n026.cluster.edu
% 0.07/0.16 % Model : x86_64 x86_64
% 0.07/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.16 % Memory : 8046.5625MB
% 0.07/0.16 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Tue Sep 29 14:47:12 UTC 2026
% 0.07/0.17 % CPUTime :
% 0.07/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.20 Running first-order model finding
% 0.07/0.20 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.07/0.24 % (692365)Will run a generic schedule for satisfiability detection.
% 0.07/0.24 % (692380)dis+10_1_sil=32000:sp=arity:random_seed=362282142:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.07/0.24 % (692378)% WARNING: option uhcvi not known.
% 0.07/0.24 % (692380) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-692365-692380"...
% 0.07/0.24 % (692380)...printing done.
% 0.07/0.24 % (692380)Refutation found. Thanks to Tanya!
% 0.07/0.24 % SZS status Theorem for theBenchmark
% 0.07/0.24 % SZS output start Proof for theBenchmark
% 0.07/0.24 thf(type_def_5, type, g: $tType).
% 0.07/0.24 thf(type_def_6, type, b: $tType).
% 0.07/0.24 thf(type_def_7, type, a: $tType).
% 0.07/0.24 thf(type_def_8, type, sTfun: ($tType * $tType) > $tType).
% 0.07/0.24 thf(func_def_3, type, sK0: (g > b)).
% 0.07/0.24 thf(func_def_4, type, sK1: (b > a)).
% 0.07/0.24 thf(func_def_5, type, sK2: (g > $o)).
% 0.07/0.24 thf(func_def_6, type, sK3: (g > g)).
% 0.07/0.24 thf(func_def_7, type, sK4: (b > $o)).
% 0.07/0.24 thf(func_def_8, type, sK5: (b > b)).
% 0.07/0.24 thf(func_def_9, type, sK6: (a > $o)).
% 0.07/0.24 thf(func_def_10, type, sK7: (a > a)).
% 0.07/0.24 thf(func_def_11, type, sK8: g).
% 0.07/0.24 thf(f1,conjecture,(
% 0.07/0.24 ! [X0 : (g > b),X1 : (b > a),X2 : (g > $o),X3 : (g > g),X4 : (b > $o),X5 : (b > b),X6 : (a > $o),X7 : (a > a)] : ((! [X8 : b] : ((X4 @ X8) => (((X1 @ (X5 @ X8))) = ((X7 @ (X1 @ X8))))) & ! [X8 : b] : ((X4 @ X8) => (X6 @ (X1 @ X8))) & ! [X8 : a] : ((X6 @ X8) => (X6 @ (X7 @ X8))) & ! [X8 : b] : ((X4 @ X8) => (X4 @ (X5 @ X8))) & ! [X8 : g] : ((X2 @ X8) => (((X0 @ (X3 @ X8))) = ((X5 @ (X0 @ X8))))) & ! [X8 : g] : ((X2 @ X8) => (X4 @ (X0 @ X8))) & ! [X8 : b] : ((X4 @ X8) => (X4 @ (X5 @ X8))) & ! [X8 : g] : ((X2 @ X8) => (X2 @ (X3 @ X8)))) => ! [X8 : g] : ((X2 @ X8) => (((X1 @ (X0 @ (X3 @ X8)))) = ((X7 @ (X1 @ (X0 @ X8)))))))),
% 0.07/0.24 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM131D_pme)).
% 0.07/0.24 thf(f2,negated_conjecture,(
% 0.07/0.24 ~ ! [X0 : (g > b),X1 : (b > a),X2 : (g > $o),X3 : (g > g),X4 : (b > $o),X5 : (b > b),X6 : (a > $o),X7 : (a > a)] : ((! [X8 : b] : ((X4 @ X8) => (((X1 @ (X5 @ X8))) = ((X7 @ (X1 @ X8))))) & ! [X8 : b] : ((X4 @ X8) => (X6 @ (X1 @ X8))) & ! [X8 : a] : ((X6 @ X8) => (X6 @ (X7 @ X8))) & ! [X8 : b] : ((X4 @ X8) => (X4 @ (X5 @ X8))) & ! [X8 : g] : ((X2 @ X8) => (((X0 @ (X3 @ X8))) = ((X5 @ (X0 @ X8))))) & ! [X8 : g] : ((X2 @ X8) => (X4 @ (X0 @ X8))) & ! [X8 : b] : ((X4 @ X8) => (X4 @ (X5 @ X8))) & ! [X8 : g] : ((X2 @ X8) => (X2 @ (X3 @ X8)))) => ! [X8 : g] : ((X2 @ X8) => (((X1 @ (X0 @ (X3 @ X8)))) = ((X7 @ (X1 @ (X0 @ X8)))))))),
% 0.07/0.24 inference(negated_conjecture,[status(cth)],[f1])).
% 0.07/0.24 thf(f3,plain,(
% 0.07/0.24 ~ ! [X0 : (g > b),X1 : (b > a),X2 : (g > $o),X3 : (g > g),X4 : (b > $o),X5 : (b > b),X6 : (a > $o),X7 : (a > a)] : ((! [X8 : b] : ((X4 @ X8) => (((X1 @ (X5 @ X8))) = ((X7 @ (X1 @ X8))))) & ! [X9 : b] : ((X4 @ X9) => (X6 @ (X1 @ X9))) & ! [X10 : a] : ((X6 @ X10) => (X6 @ (X7 @ X10))) & ! [X11 : b] : ((X4 @ X11) => (X4 @ (X5 @ X11))) & ! [X12 : g] : ((X2 @ X12) => (((X0 @ (X3 @ X12))) = ((X5 @ (X0 @ X12))))) & ! [X13 : g] : ((X2 @ X13) => (X4 @ (X0 @ X13))) & ! [X14 : b] : ((X4 @ X14) => (X4 @ (X5 @ X14))) & ! [X15 : g] : ((X2 @ X15) => (X2 @ (X3 @ X15)))) => ! [X16 : g] : ((X2 @ X16) => (((X1 @ (X0 @ (X3 @ X16)))) = ((X7 @ (X1 @ (X0 @ X16)))))))),
% 0.07/0.24 inference(rectify,[],[f2])).
% 0.07/0.24 thf(f4,plain,(
% 0.07/0.24 ~ ! [X0 : (g > b),X1 : (b > a),X2 : (g > $o),X3 : (g > g),X4 : (b > $o),X5 : (b > b),X6 : (a > $o),X7 : (a > a)] : ((! [X8 : b] : ((((X4 @ X8)) = $true) => (((X1 @ (X5 @ X8))) = ((X7 @ (X1 @ X8))))) & ! [X9 : b] : ((((X4 @ X9)) = $true) => (((X6 @ (X1 @ X9))) = $true)) & ! [X10 : a] : ((((X6 @ X10)) = $true) => (((X6 @ (X7 @ X10))) = $true)) & ! [X11 : b] : ((((X4 @ X11)) = $true) => (((X4 @ (X5 @ X11))) = $true)) & ! [X12 : g] : ((((X2 @ X12)) = $true) => (((X0 @ (X3 @ X12))) = ((X5 @ (X0 @ X12))))) & ! [X13 : g] : ((((X2 @ X13)) = $true) => (((X4 @ (X0 @ X13))) = $true)) & ! [X14 : b] : ((((X4 @ X14)) = $true) => (((X4 @ (X5 @ X14))) = $true)) & ! [X15 : g] : ((((X2 @ X15)) = $true) => (((X2 @ (X3 @ X15))) = $true))) => ! [X16 : g] : ((((X2 @ X16)) = $true) => (((X1 @ (X0 @ (X3 @ X16)))) = ((X7 @ (X1 @ (X0 @ X16)))))))),
% 0.07/0.24 inference(fool_elimination,[],[f3])).
% 0.07/0.24 thf(f5,plain,(
% 0.07/0.24 ? [X0 : (g > b),X1 : (b > a),X2 : (g > $o),X3 : (g > g),X4 : (b > $o),X5 : (b > b),X6 : (a > $o),X7 : (a > a)] : (? [X16 : g] : ((((X1 @ (X0 @ (X3 @ X16)))) != ((X7 @ (X1 @ (X0 @ X16))))) & (((X2 @ X16)) = $true)) & (! [X8 : b] : ((((X1 @ (X5 @ X8))) = ((X7 @ (X1 @ X8)))) | (((X4 @ X8)) != $true)) & ! [X9 : b] : ((((X6 @ (X1 @ X9))) = $true) | (((X4 @ X9)) != $true)) & ! [X10 : a] : ((((X6 @ (X7 @ X10))) = $true) | (((X6 @ X10)) != $true)) & ! [X11 : b] : ((((X4 @ (X5 @ X11))) = $true) | (((X4 @ X11)) != $true)) & ! [X12 : g] : ((((X0 @ (X3 @ X12))) = ((X5 @ (X0 @ X12)))) | (((X2 @ X12)) != $true)) & ! [X13 : g] : ((((X4 @ (X0 @ X13))) = $true) | (((X2 @ X13)) != $true)) & ! [X14 : b] : ((((X4 @ (X5 @ X14))) = $true) | (((X4 @ X14)) != $true)) & ! [X15 : g] : ((((X2 @ (X3 @ X15))) = $true) | (((X2 @ X15)) != $true))))),
% 0.07/0.24 inference(ennf_transformation,[],[f4])).
% 0.07/0.24 thf(f6,plain,(
% 0.07/0.24 ? [X0 : (g > b),X1 : (b > a),X2 : (g > $o),X3 : (g > g),X4 : (b > $o),X5 : (b > b),X6 : (a > $o),X7 : (a > a)] : (? [X16 : g] : ((((X1 @ (X0 @ (X3 @ X16)))) != ((X7 @ (X1 @ (X0 @ X16))))) & (((X2 @ X16)) = $true)) & ! [X8 : b] : ((((X1 @ (X5 @ X8))) = ((X7 @ (X1 @ X8)))) | (((X4 @ X8)) != $true)) & ! [X9 : b] : ((((X6 @ (X1 @ X9))) = $true) | (((X4 @ X9)) != $true)) & ! [X10 : a] : ((((X6 @ (X7 @ X10))) = $true) | (((X6 @ X10)) != $true)) & ! [X11 : b] : ((((X4 @ (X5 @ X11))) = $true) | (((X4 @ X11)) != $true)) & ! [X12 : g] : ((((X0 @ (X3 @ X12))) = ((X5 @ (X0 @ X12)))) | (((X2 @ X12)) != $true)) & ! [X13 : g] : ((((X4 @ (X0 @ X13))) = $true) | (((X2 @ X13)) != $true)) & ! [X14 : b] : ((((X4 @ (X5 @ X14))) = $true) | (((X4 @ X14)) != $true)) & ! [X15 : g] : ((((X2 @ (X3 @ X15))) = $true) | (((X2 @ X15)) != $true)))),
% 0.07/0.24 inference(flattening,[],[f5])).
% 0.07/0.24 thf(f7,plain,(
% 0.07/0.24 ? [X0 : (g > b),X1 : (b > a),X2 : (g > $o),X3 : (g > g),X4 : (b > $o),X5 : (b > b),X6 : (a > $o),X7 : (a > a)] : (? [X8 : g] : ((((X1 @ (X0 @ (X3 @ X8)))) != ((X7 @ (X1 @ (X0 @ X8))))) & (((X2 @ X8)) = $true)) & ! [X9 : b] : ((((X1 @ (X5 @ X9))) = ((X7 @ (X1 @ X9)))) | (((X4 @ X9)) != $true)) & ! [X10 : b] : (($true = ((X6 @ (X1 @ X10)))) | ($true != ((X4 @ X10)))) & ! [X11 : a] : (($true = ((X6 @ (X7 @ X11)))) | ($true != ((X6 @ X11)))) & ! [X12 : b] : (($true = ((X4 @ (X5 @ X12)))) | ($true != ((X4 @ X12)))) & ! [X13 : g] : ((((X0 @ (X3 @ X13))) = ((X5 @ (X0 @ X13)))) | (((X2 @ X13)) != $true)) & ! [X14 : g] : (($true = ((X4 @ (X0 @ X14)))) | ($true != ((X2 @ X14)))) & ! [X15 : b] : (($true = ((X4 @ (X5 @ X15)))) | ($true != ((X4 @ X15)))) & ! [X16 : g] : (($true = ((X2 @ (X3 @ X16)))) | (((X2 @ X16)) != $true)))),
% 0.07/0.24 inference(rectify,[],[f6])).
% 0.07/0.24 thf(f8,plain,(
% 0.07/0.24 ((((sK1 @ (sK0 @ (sK3 @ sK8)))) != ((sK7 @ (sK1 @ (sK0 @ sK8))))) & ($true = ((sK2 @ sK8)))) & ! [X9 : b] : ((((sK1 @ (sK5 @ X9))) = ((sK7 @ (sK1 @ X9)))) | ($true != ((sK4 @ X9)))) & ! [X10 : b] : (($true = ((sK6 @ (sK1 @ X10)))) | ($true != ((sK4 @ X10)))) & ! [X11 : a] : (($true = ((sK6 @ (sK7 @ X11)))) | ($true != ((sK6 @ X11)))) & ! [X12 : b] : (($true = ((sK4 @ (sK5 @ X12)))) | ($true != ((sK4 @ X12)))) & ! [X13 : g] : ((((sK0 @ (sK3 @ X13))) = ((sK5 @ (sK0 @ X13)))) | ($true != ((sK2 @ X13)))) & ! [X14 : g] : (($true = ((sK4 @ (sK0 @ X14)))) | ($true != ((sK2 @ X14)))) & ! [X15 : b] : (($true = ((sK4 @ (sK5 @ X15)))) | ($true != ((sK4 @ X15)))) & ! [X16 : g] : (($true = ((sK2 @ (sK3 @ X16)))) | ($true != ((sK2 @ X16))))),
% 0.07/0.24 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5),skolemize(X6,sK6),skolemize(X7,sK7),skolemize(X8,sK8)],[f7])).
% 0.07/0.24 thf(f11,plain,(
% 0.07/0.24 ( ! [X14 : g] : (($true != ((sK2 @ X14))) | ($true = ((sK4 @ (sK0 @ X14))))) )),
% 0.07/0.24 inference(cnf_transformation,[],[f8])).
% 0.07/0.24 thf(f12,plain,(
% 0.07/0.24 ( ! [X13 : g] : (($true != ((sK2 @ X13))) | (((sK0 @ (sK3 @ X13))) = ((sK5 @ (sK0 @ X13))))) )),
% 0.07/0.24 inference(cnf_transformation,[],[f8])).
% 0.07/0.24 thf(f16,plain,(
% 0.07/0.24 ( ! [X9 : b] : (($true != ((sK4 @ X9))) | (((sK1 @ (sK5 @ X9))) = ((sK7 @ (sK1 @ X9))))) )),
% 0.07/0.24 inference(cnf_transformation,[],[f8])).
% 0.07/0.24 thf(f17,plain,(
% 0.07/0.24 ($true = ((sK2 @ sK8)))),
% 0.07/0.24 inference(cnf_transformation,[],[f8])).
% 0.07/0.24 thf(f18,plain,(
% 0.07/0.24 (((sK1 @ (sK0 @ (sK3 @ sK8)))) != ((sK7 @ (sK1 @ (sK0 @ sK8)))))),
% 0.07/0.24 inference(cnf_transformation,[],[f8])).
% 0.07/0.24 thf(f20,definition,(
% 0.07/0.24 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.07/0.24 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.07/0.24 thf(f27,plain,(
% 0.07/0.24 ($true != $true) | ($true = ((sK4 @ (sK0 @ sK8))))),
% 0.07/0.24 inference(constrained_superposition,[],[f11,f17])).
% 0.07/0.24 thf(f32,plain,(
% 0.07/0.24 ($true = ((sK4 @ (sK0 @ sK8))))),
% 0.07/0.24 inference(trivial_inequality_removal,[],[f27])).
% 0.07/0.24 thf(f47,plain,(
% 0.07/0.24 ($true != $true) | (((sK0 @ (sK3 @ sK8))) = ((sK5 @ (sK0 @ sK8))))),
% 0.07/0.24 inference(constrained_superposition,[],[f12,f17])).
% 0.07/0.24 thf(f52,plain,(
% 0.07/0.24 (((sK0 @ (sK3 @ sK8))) = ((sK5 @ (sK0 @ sK8))))),
% 0.07/0.24 inference(trivial_inequality_removal,[],[f47])).
% 0.07/0.24 thf(f85,plain,(
% 0.07/0.24 ( ! [X0 : b] : (($true != $true) | (((sK1 @ (sK5 @ X0))) = ((sK7 @ (sK1 @ X0)))) | ($false = ((sK4 @ X0)))) )),
% 0.07/0.24 inference(constrained_superposition,[],[f16,f20])).
% 0.07/0.24 thf(f93,plain,(
% 0.07/0.24 ( ! [X0 : b] : ((((sK1 @ (sK5 @ X0))) = ((sK7 @ (sK1 @ X0)))) | ($false = ((sK4 @ X0)))) )),
% 0.07/0.24 inference(trivial_inequality_removal,[],[f85])).
% 0.07/0.24 thf(f124,plain,(
% 0.07/0.24 (((sK1 @ (sK0 @ (sK3 @ sK8)))) != ((sK1 @ (sK5 @ (sK0 @ sK8))))) | ($false = ((sK4 @ (sK0 @ sK8))))),
% 0.07/0.24 inference(constrained_superposition,[],[f18,f93])).
% 0.07/0.24 thf(f126,plain,(
% 0.07/0.24 (((sK1 @ (sK0 @ (sK3 @ sK8)))) != ((sK1 @ (sK0 @ (sK3 @ sK8))))) | ($false = ((sK4 @ (sK0 @ sK8))))),
% 0.07/0.24 inference(forward_demodulation,[],[f124,f52])).
% 0.07/0.24 thf(f127,plain,(
% 0.07/0.24 ($false = ((sK4 @ (sK0 @ sK8))))),
% 0.07/0.24 inference(trivial_inequality_removal,[],[f126])).
% 0.07/0.24 thf(f134,plain,(
% 0.07/0.24 ($true = $false)),
% 0.07/0.24 inference(constrained_superposition,[],[f32,f127])).
% 0.07/0.24 thf(f137,plain,(
% 0.07/0.24 $false),
% 0.07/0.24 inference(trivial_inequality_removal,[],[f134])).
% 0.07/0.24 % SZS output end Proof for theBenchmark
% 0.07/0.24 % (692380)------------------------------
% 0.07/0.24 % (692380)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.24 % (692380)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.24 % (692380)CaDiCaL version: 2.1.3
% 0.07/0.24 % (692380)Termination reason: Refutation
% 0.07/0.24 % (692380)Time elapsed: 0.005 s
% 0.07/0.24 % (692380)Peak memory usage: 12 MB
% 0.07/0.24 % (692380)Instructions burned: 13 (million)
% 0.07/0.24 % (692365)Success in time 0.032 s
% 0.07/0.24 % Vampire exiting
%------------------------------------------------------------------------------