%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET044^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n006.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:23:33 AM UTC 2026
% Result : Theorem 0.08s 0.24s
% Output : Refutation 0.08s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET044^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n006.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 13:35:54 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.24 % (715786)Will run a generic schedule for satisfiability detection.
% 0.08/0.24 % (715797)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3091475381:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.24 % (715797) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-715786-715797"...
% 0.08/0.24 % (715797)...printing done.
% 0.08/0.24 % (715797)Refutation found. Thanks to Tanya!
% 0.08/0.24 % SZS status Theorem for theBenchmark
% 0.08/0.24 % SZS output start Proof for theBenchmark
% 0.08/0.24 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.08/0.24 thf(func_def_0, type, cF: ($i > $i > $o)).
% 0.08/0.24 thf(func_def_4, type, sK0: ($i > $i)).
% 0.08/0.24 thf(f1,conjecture,(
% 0.08/0.24 ? [X0 : $i] : ! [X1 : $i] : ((cF @ X1 @ X0) <=> (cF @ X1 @ X1)) => ~ ! [X1 : $i] : ? [X0 : $i] : ! [X2 : $i] : ((cF @ X2 @ X0) <=> ~(cF @ X2 @ X1))),
% 0.08/0.24 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cPELL40)).
% 0.08/0.24 thf(f2,negated_conjecture,(
% 0.08/0.24 ~(? [X0 : $i] : ! [X1 : $i] : ((cF @ X1 @ X0) <=> (cF @ X1 @ X1)) => ~ ! [X1 : $i] : ? [X0 : $i] : ! [X2 : $i] : ((cF @ X2 @ X0) <=> ~(cF @ X2 @ X1)))),
% 0.08/0.24 inference(negated_conjecture,[status(cth)],[f1])).
% 0.08/0.24 thf(f3,plain,(
% 0.08/0.24 ~(? [X0 : $i] : ! [X1 : $i] : ((cF @ X1 @ X0) <=> (cF @ X1 @ X1)) => ~ ! [X2 : $i] : ? [X3 : $i] : ! [X4 : $i] : ((cF @ X4 @ X3) <=> ~(cF @ X4 @ X2)))),
% 0.08/0.24 inference(rectify,[],[f2])).
% 0.08/0.24 thf(f4,plain,(
% 0.08/0.24 ~(? [X0 : $i] : ! [X1 : $i] : (((cF @ X1 @ X0)) = ((cF @ X1 @ X1))) => ~ ! [X2 : $i] : ? [X3 : $i] : ! [X4 : $i] : ((((cF @ X4 @ X3)) = $true) <=> ~ (((cF @ X4 @ X2)) = $true)))),
% 0.08/0.24 inference(fool_elimination,[],[f3])).
% 0.08/0.24 thf(f5,plain,(
% 0.08/0.24 ~(? [X0 : $i] : ! [X1 : $i] : (((cF @ X1 @ X0)) = ((cF @ X1 @ X1))) => ~ ! [X2 : $i] : ? [X3 : $i] : ! [X4 : $i] : ((((cF @ X4 @ X3)) = $true) <=> (((cF @ X4 @ X2)) != $true)))),
% 0.08/0.24 inference(flattening,[],[f4])).
% 0.08/0.24 thf(f6,plain,(
% 0.08/0.24 ! [X2 : $i] : ? [X3 : $i] : ! [X4 : $i] : ((((cF @ X4 @ X3)) = $true) <=> (((cF @ X4 @ X2)) != $true)) & ? [X0 : $i] : ! [X1 : $i] : (((cF @ X1 @ X0)) = ((cF @ X1 @ X1)))),
% 0.08/0.24 inference(ennf_transformation,[],[f5])).
% 0.08/0.24 thf(f7,plain,(
% 0.08/0.24 ! [X2 : $i] : ? [X3 : $i] : ! [X4 : $i] : (((((cF @ X4 @ X3)) = $true) | (((cF @ X4 @ X2)) = $true)) & ((((cF @ X4 @ X2)) != $true) | (((cF @ X4 @ X3)) != $true))) & ? [X0 : $i] : ! [X1 : $i] : (((cF @ X1 @ X0)) = ((cF @ X1 @ X1)))),
% 0.08/0.24 inference(nnf_transformation,[],[f6])).
% 0.08/0.24 thf(f8,plain,(
% 0.08/0.24 ! [X0 : $i] : ? [X1 : $i] : ! [X2 : $i] : (((((cF @ X2 @ X1)) = $true) | (((cF @ X2 @ X0)) = $true)) & ((((cF @ X2 @ X0)) != $true) | (((cF @ X2 @ X1)) != $true))) & ? [X3 : $i] : ! [X4 : $i] : (((cF @ X4 @ X3)) = ((cF @ X4 @ X4)))),
% 0.08/0.24 inference(rectify,[],[f7])).
% 0.08/0.24 thf(f9,plain,(
% 0.08/0.24 ! [X0 : $i] : ! [X2 : $i] : ((($true = ((cF @ X2 @ (sK0 @ X0)))) | (((cF @ X2 @ X0)) = $true)) & ((((cF @ X2 @ X0)) != $true) | ($true != ((cF @ X2 @ (sK0 @ X0)))))) & ! [X4 : $i] : (((cF @ X4 @ X4)) = ((cF @ X4 @ sK1)))),
% 0.08/0.24 inference(skolemize,[status(esa),new_symbols(skolem,[vAPP,sK1]),skolemize(X1,sK0 @ X0),skolemize(X3,sK1)],[f8])).
% 0.08/0.24 thf(f10,plain,(
% 0.08/0.24 ( ! [X4 : $i] : ((((cF @ X4 @ X4)) = ((cF @ X4 @ sK1)))) )),
% 0.08/0.24 inference(cnf_transformation,[],[f9])).
% 0.08/0.24 thf(f11,plain,(
% 0.08/0.24 ( ! [X2 : $i,X0 : $i] : (($true != ((cF @ X2 @ (sK0 @ X0)))) | (((cF @ X2 @ X0)) != $true)) )),
% 0.08/0.24 inference(cnf_transformation,[],[f9])).
% 0.08/0.24 thf(f12,plain,(
% 0.08/0.24 ( ! [X2 : $i,X0 : $i] : (($true = ((cF @ X2 @ (sK0 @ X0)))) | (((cF @ X2 @ X0)) = $true)) )),
% 0.08/0.24 inference(cnf_transformation,[],[f9])).
% 0.08/0.24 thf(f15,plain,(
% 0.08/0.24 ( ! [X4 : $i] : (($true = ((cF @ X4 @ X4))) | (((cF @ X4 @ sK1)) = $false)) )),
% 0.08/0.24 inference(iff_proxy_clausification,[],[f10])).
% 0.08/0.24 thf(f16,plain,(
% 0.08/0.24 ( ! [X4 : $i] : ((((cF @ X4 @ X4)) = $false) | ($true = ((cF @ X4 @ sK1)))) )),
% 0.08/0.24 inference(iff_proxy_clausification,[],[f10])).
% 0.08/0.24 thf(f18,plain,(
% 0.08/0.24 ( ! [X0 : $i] : (($true != $true) | ($true != ((cF @ (sK0 @ X0) @ X0))) | ($false = ((cF @ (sK0 @ X0) @ sK1)))) )),
% 0.08/0.24 inference(constrained_superposition,[],[f11,f15])).
% 0.08/0.24 thf(f19,plain,(
% 0.08/0.24 ( ! [X0 : $i] : (($true != ((cF @ (sK0 @ X0) @ X0))) | ($false = ((cF @ (sK0 @ X0) @ sK1)))) )),
% 0.08/0.24 inference(trivial_inequality_removal,[],[f18])).
% 0.08/0.24 thf(f31,plain,(
% 0.08/0.24 ( ! [X0 : $i] : (($true = $false) | ($true = ((cF @ (sK0 @ X0) @ sK1))) | ($true = ((cF @ (sK0 @ X0) @ X0)))) )),
% 0.08/0.24 inference(constrained_superposition,[],[f16,f12])).
% 0.08/0.24 thf(f33,plain,(
% 0.08/0.24 ( ! [X0 : $i] : (($true = ((cF @ (sK0 @ X0) @ sK1))) | ($true = ((cF @ (sK0 @ X0) @ X0)))) )),
% 0.08/0.24 inference(trivial_inequality_removal,[],[f31])).
% 0.08/0.24 thf(f40,plain,(
% 0.08/0.24 ($true != $true) | ($true = ((cF @ (sK0 @ sK1) @ sK1)))),
% 0.08/0.24 inference(equality_factoring,[],[f33])).
% 0.08/0.24 thf(f41,plain,(
% 0.08/0.24 ($true = ((cF @ (sK0 @ sK1) @ sK1)))),
% 0.08/0.24 inference(trivial_inequality_removal,[],[f40])).
% 0.08/0.24 thf(f45,plain,(
% 0.08/0.24 ($true != $true) | ($true = $false)),
% 0.08/0.24 inference(constrained_superposition,[],[f19,f41])).
% 0.08/0.24 thf(f46,plain,(
% 0.08/0.24 $false),
% 0.08/0.24 inference(trivial_inequality_removal,[],[f45])).
% 0.08/0.24 % SZS output end Proof for theBenchmark
% 0.08/0.24 % (715797)------------------------------
% 0.08/0.24 % (715797)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.24 % (715797)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.24 % (715797)CaDiCaL version: 2.1.3
% 0.08/0.24 % (715797)Termination reason: Refutation
% 0.08/0.24 % (715797)Time elapsed: 0.002 s
% 0.08/0.24 % (715797)Peak memory usage: 12 MB
% 0.08/0.24 % (715797)Instructions burned: 4 (million)
% 0.08/0.24 % (715786)Success in time 0.024 s
% 0.08/0.24 % Vampire exiting
%------------------------------------------------------------------------------