%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV053^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 : n005.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:38:55 AM UTC 2026
% Result : Theorem 0.09s 0.24s
% Output : Refutation 0.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV053^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.09/0.17 % Computer : n005.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Tue Sep 29 15:05:31 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 Running first-order model finding
% 0.09/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.09/0.24 % (1777191)Will run a generic schedule for satisfiability detection.
% 0.09/0.24 % (1777201)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1690668978:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.24 % (1777201) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1777191-1777201"...
% 0.09/0.24 % (1777201)...printing done.
% 0.09/0.24 % (1777201)Refutation found. Thanks to Tanya!
% 0.09/0.24 % SZS status Theorem for theBenchmark
% 0.09/0.24 % SZS output start Proof for theBenchmark
% 0.09/0.24 thf(type_def_5, type, b: $tType).
% 0.09/0.24 thf(type_def_6, type, a: $tType).
% 0.09/0.24 thf(type_def_7, type, sTfun: ($tType * $tType) > $tType).
% 0.09/0.24 thf(func_def_0, type, cF: (b > b)).
% 0.09/0.24 thf(func_def_1, type, cA: (b > a)).
% 0.09/0.24 thf(func_def_2, type, cL: (a > a > $o)).
% 0.09/0.24 thf(func_def_6, type, sK0: b).
% 0.09/0.24 thf(f1,conjecture,(
% 0.09/0.24 (! [X3 : b] : (cL @ (cA @ X3) @ (cA @ (cF @ X3))) & ! [X0 : a,X1 : a,X2 : a] : (((cL @ X1 @ X2) & (cL @ X0 @ X1)) => (cL @ X0 @ X2))) => ! [X4 : b] : (cL @ (cA @ X4) @ (cA @ (cF @ (cF @ X4))))),
% 0.09/0.24 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM89B_pme)).
% 0.09/0.24 thf(f2,negated_conjecture,(
% 0.09/0.24 ~((! [X3 : b] : (cL @ (cA @ X3) @ (cA @ (cF @ X3))) & ! [X0 : a,X1 : a,X2 : a] : (((cL @ X1 @ X2) & (cL @ X0 @ X1)) => (cL @ X0 @ X2))) => ! [X4 : b] : (cL @ (cA @ X4) @ (cA @ (cF @ (cF @ X4)))))),
% 0.09/0.24 inference(negated_conjecture,[status(cth)],[f1])).
% 0.09/0.24 thf(f3,plain,(
% 0.09/0.24 ~((! [X0 : b] : (cL @ (cA @ X0) @ (cA @ (cF @ X0))) & ! [X1 : a,X2 : a,X3 : a] : (((cL @ X2 @ X3) & (cL @ X1 @ X2)) => (cL @ X1 @ X3))) => ! [X4 : b] : (cL @ (cA @ X4) @ (cA @ (cF @ (cF @ X4)))))),
% 0.09/0.24 inference(rectify,[],[f2])).
% 0.09/0.24 thf(f4,plain,(
% 0.09/0.24 ~((! [X0 : b] : (((cL @ (cA @ X0) @ (cA @ (cF @ X0)))) = $true) & ! [X1 : a,X2 : a,X3 : a] : (((((cL @ X2 @ X3)) = $true) & (((cL @ X1 @ X2)) = $true)) => (((cL @ X1 @ X3)) = $true))) => ! [X4 : b] : (((cL @ (cA @ X4) @ (cA @ (cF @ (cF @ X4))))) = $true))),
% 0.09/0.24 inference(fool_elimination,[],[f3])).
% 0.09/0.24 thf(f5,plain,(
% 0.09/0.24 ? [X4 : b] : (((cL @ (cA @ X4) @ (cA @ (cF @ (cF @ X4))))) != $true) & (! [X0 : b] : (((cL @ (cA @ X0) @ (cA @ (cF @ X0)))) = $true) & ! [X1 : a,X2 : a,X3 : a] : ((((cL @ X1 @ X3)) = $true) | ((((cL @ X2 @ X3)) != $true) | (((cL @ X1 @ X2)) != $true))))),
% 0.09/0.24 inference(ennf_transformation,[],[f4])).
% 0.09/0.24 thf(f6,plain,(
% 0.09/0.24 ? [X4 : b] : (((cL @ (cA @ X4) @ (cA @ (cF @ (cF @ X4))))) != $true) & ! [X0 : b] : (((cL @ (cA @ X0) @ (cA @ (cF @ X0)))) = $true) & ! [X1 : a,X2 : a,X3 : a] : ((((cL @ X1 @ X3)) = $true) | (((cL @ X2 @ X3)) != $true) | (((cL @ X1 @ X2)) != $true))),
% 0.09/0.24 inference(flattening,[],[f5])).
% 0.09/0.24 thf(f7,plain,(
% 0.09/0.24 ? [X0 : b] : ($true != ((cL @ (cA @ X0) @ (cA @ (cF @ (cF @ X0)))))) & ! [X1 : b] : ($true = ((cL @ (cA @ X1) @ (cA @ (cF @ X1))))) & ! [X2 : a,X3 : a,X4 : a] : (($true = ((cL @ X2 @ X4))) | ($true != ((cL @ X3 @ X4))) | (((cL @ X2 @ X3)) != $true))),
% 0.09/0.24 inference(rectify,[],[f6])).
% 0.09/0.24 thf(f8,plain,(
% 0.09/0.24 ($true != ((cL @ (cA @ sK0) @ (cA @ (cF @ (cF @ sK0)))))) & ! [X1 : b] : ($true = ((cL @ (cA @ X1) @ (cA @ (cF @ X1))))) & ! [X2 : a,X3 : a,X4 : a] : (($true = ((cL @ X2 @ X4))) | ($true != ((cL @ X3 @ X4))) | (((cL @ X2 @ X3)) != $true))),
% 0.09/0.24 inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f7])).
% 0.09/0.24 thf(f9,plain,(
% 0.09/0.24 ( ! [X2 : a,X3 : a,X4 : a] : (($true != ((cL @ X3 @ X4))) | ($true = ((cL @ X2 @ X4))) | (((cL @ X2 @ X3)) != $true)) )),
% 0.09/0.24 inference(cnf_transformation,[],[f8])).
% 0.09/0.24 thf(f10,plain,(
% 0.09/0.24 ( ! [X1 : b] : (($true = ((cL @ (cA @ X1) @ (cA @ (cF @ X1)))))) )),
% 0.09/0.24 inference(cnf_transformation,[],[f8])).
% 0.09/0.24 thf(f11,plain,(
% 0.09/0.24 ($true != ((cL @ (cA @ sK0) @ (cA @ (cF @ (cF @ sK0))))))),
% 0.09/0.24 inference(cnf_transformation,[],[f8])).
% 0.09/0.24 thf(f13,definition,(
% 0.09/0.24 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.09/0.24 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.09/0.24 thf(f14,plain,(
% 0.09/0.24 ( ! [X0 : b,X1 : a] : (($true != $true) | ($true = ((cL @ X1 @ (cA @ (cF @ X0))))) | ($true != ((cL @ X1 @ (cA @ X0))))) )),
% 0.09/0.24 inference(constrained_superposition,[],[f9,f10])).
% 0.09/0.24 thf(f15,plain,(
% 0.09/0.24 ( ! [X0 : b,X1 : a] : (($true != ((cL @ X1 @ (cA @ X0)))) | ($true = ((cL @ X1 @ (cA @ (cF @ X0)))))) )),
% 0.09/0.24 inference(trivial_inequality_removal,[],[f14])).
% 0.09/0.24 thf(f16,plain,(
% 0.09/0.24 ( ! [X0 : b] : (($true != $true) | ($true = ((cL @ (cA @ X0) @ (cA @ (cF @ (cF @ X0))))))) )),
% 0.09/0.24 inference(constrained_superposition,[],[f15,f10])).
% 0.09/0.24 thf(f17,plain,(
% 0.09/0.24 ( ! [X0 : b] : (($true = ((cL @ (cA @ X0) @ (cA @ (cF @ (cF @ X0))))))) )),
% 0.09/0.24 inference(trivial_inequality_removal,[],[f16])).
% 0.09/0.24 thf(f20,plain,(
% 0.09/0.24 ($true != $true) | (((cL @ (cA @ sK0) @ (cA @ (cF @ (cF @ sK0))))) = $false)),
% 0.09/0.24 inference(constrained_superposition,[],[f11,f13])).
% 0.09/0.24 thf(f26,plain,(
% 0.09/0.24 (((cL @ (cA @ sK0) @ (cA @ (cF @ (cF @ sK0))))) = $false)),
% 0.09/0.24 inference(trivial_inequality_removal,[],[f20])).
% 0.09/0.24 thf(f31,plain,(
% 0.09/0.24 ($true = $false)),
% 0.09/0.24 inference(forward_demodulation,[],[f26,f17])).
% 0.09/0.24 thf(f32,plain,(
% 0.09/0.24 $false),
% 0.09/0.24 inference(trivial_inequality_removal,[],[f31])).
% 0.09/0.24 % SZS output end Proof for theBenchmark
% 0.09/0.24 % (1777201)------------------------------
% 0.09/0.24 % (1777201)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.24 % (1777201)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.24 % (1777201)CaDiCaL version: 2.1.3
% 0.09/0.24 % (1777201)Termination reason: Refutation
% 0.09/0.24 % (1777201)Time elapsed: 0.002 s
% 0.09/0.24 % (1777201)Peak memory usage: 12 MB
% 0.09/0.24 % (1777201)Instructions burned: 3 (million)
% 0.09/0.24 % (1777191)Success in time 0.029 s
% 0.09/0.24 % Vampire exiting
%------------------------------------------------------------------------------