%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN365^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 : n007.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:41:51 AM UTC 2026
% Result : Theorem 0.19s 0.28s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN365^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20 % Computer : n007.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % OS : Linux 6.8.0-71-generic
% 0.08/0.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Tue Sep 29 16:13:11 UTC 2026
% 0.08/0.21 % CPUTime :
% 0.08/0.21 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23 Running first-order model finding
% 0.08/0.23 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.19/0.28 % (3567084)Will run a generic schedule for satisfiability detection.
% 0.19/0.28 % (3567091)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3594266321:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.28 % (3567090)% WARNING: option uhcvi not known.
% 0.19/0.28 % (3567091) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3567084-3567091"...
% 0.19/0.28 % (3567091)...printing done.
% 0.19/0.28 % (3567091)Refutation found. Thanks to Tanya!
% 0.19/0.28 % SZS status Theorem for theBenchmark
% 0.19/0.28 % SZS output start Proof for theBenchmark
% 0.19/0.28 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.19/0.28 thf(func_def_0, type, cP: ($i > $o)).
% 0.19/0.28 thf(func_def_1, type, cR: ($i > $i > $o)).
% 0.19/0.28 thf(func_def_2, type, h: ($i > $i)).
% 0.19/0.28 thf(func_def_3, type, g: ($i > $i)).
% 0.19/0.28 thf(func_def_8, type, sK1: ($i > $i)).
% 0.19/0.28 thf(f1,conjecture,(
% 0.19/0.28 (! [X2 : $i] : ((cP @ X2) => ((cP @ (h @ X2)) & (cP @ (g @ X2)))) & ! [X0 : $i] : ? [X1 : $i] : ((cP @ X0) => ((cP @ X1) & (cR @ X0 @ (g @ (h @ X1)))))) => ! [X0 : $i] : ((cP @ X0) => ? [X1 : $i] : ((cP @ X1) & (cR @ X0 @ X1)))),
% 0.19/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX2116)).
% 0.19/0.28 thf(f2,negated_conjecture,(
% 0.19/0.28 ~((! [X2 : $i] : ((cP @ X2) => ((cP @ (h @ X2)) & (cP @ (g @ X2)))) & ! [X0 : $i] : ? [X1 : $i] : ((cP @ X0) => ((cP @ X1) & (cR @ X0 @ (g @ (h @ X1)))))) => ! [X0 : $i] : ((cP @ X0) => ? [X1 : $i] : ((cP @ X1) & (cR @ X0 @ X1))))),
% 0.19/0.28 inference(negated_conjecture,[status(cth)],[f1])).
% 0.19/0.28 thf(f3,plain,(
% 0.19/0.28 ~((! [X0 : $i] : ((cP @ X0) => ((cP @ (h @ X0)) & (cP @ (g @ X0)))) & ! [X1 : $i] : ? [X2 : $i] : ((cP @ X1) => ((cP @ X2) & (cR @ X1 @ (g @ (h @ X2)))))) => ! [X3 : $i] : ((cP @ X3) => ? [X4 : $i] : ((cP @ X4) & (cR @ X3 @ X4))))),
% 0.19/0.28 inference(rectify,[],[f2])).
% 0.19/0.28 thf(f4,plain,(
% 0.19/0.28 ~((! [X0 : $i] : ((((cP @ X0)) = $true) => ((((cP @ (h @ X0))) = $true) & (((cP @ (g @ X0))) = $true))) & ! [X1 : $i] : ? [X2 : $i] : ((((cP @ X1)) = $true) => ((((cP @ X2)) = $true) & (((cR @ X1 @ (g @ (h @ X2)))) = $true)))) => ! [X3 : $i] : ((((cP @ X3)) = $true) => ? [X4 : $i] : ((((cP @ X4)) = $true) & (((cR @ X3 @ X4)) = $true))))),
% 0.19/0.28 inference(fool_elimination,[],[f3])).
% 0.19/0.28 thf(f5,plain,(
% 0.19/0.28 ? [X3 : $i] : (! [X4 : $i] : ((((cP @ X4)) != $true) | (((cR @ X3 @ X4)) != $true)) & (((cP @ X3)) = $true)) & (! [X0 : $i] : (((((cP @ (h @ X0))) = $true) & (((cP @ (g @ X0))) = $true)) | (((cP @ X0)) != $true)) & ! [X1 : $i] : ? [X2 : $i] : (((((cP @ X2)) = $true) & (((cR @ X1 @ (g @ (h @ X2)))) = $true)) | (((cP @ X1)) != $true)))),
% 0.19/0.28 inference(ennf_transformation,[],[f4])).
% 0.19/0.28 thf(f6,plain,(
% 0.19/0.28 ? [X3 : $i] : (! [X4 : $i] : ((((cP @ X4)) != $true) | (((cR @ X3 @ X4)) != $true)) & (((cP @ X3)) = $true)) & ! [X0 : $i] : (((((cP @ (h @ X0))) = $true) & (((cP @ (g @ X0))) = $true)) | (((cP @ X0)) != $true)) & ! [X1 : $i] : ? [X2 : $i] : (((((cP @ X2)) = $true) & (((cR @ X1 @ (g @ (h @ X2)))) = $true)) | (((cP @ X1)) != $true))),
% 0.19/0.28 inference(flattening,[],[f5])).
% 0.19/0.28 thf(f7,plain,(
% 0.19/0.28 ? [X0 : $i] : (! [X1 : $i] : ((((cP @ X1)) != $true) | (((cR @ X0 @ X1)) != $true)) & (((cP @ X0)) = $true)) & ! [X2 : $i] : (((((cP @ (h @ X2))) = $true) & (((cP @ (g @ X2))) = $true)) | (((cP @ X2)) != $true)) & ! [X3 : $i] : ? [X4 : $i] : (((((cP @ X4)) = $true) & ($true = ((cR @ X3 @ (g @ (h @ X4)))))) | (((cP @ X3)) != $true))),
% 0.19/0.28 inference(rectify,[],[f6])).
% 0.19/0.28 thf(f8,plain,(
% 0.19/0.28 (! [X1 : $i] : ((((cP @ X1)) != $true) | ($true != ((cR @ sK0 @ X1)))) & ($true = ((cP @ sK0)))) & ! [X2 : $i] : (((((cP @ (h @ X2))) = $true) & (((cP @ (g @ X2))) = $true)) | (((cP @ X2)) != $true)) & ! [X3 : $i] : ((($true = ((cP @ (sK1 @ X3)))) & ($true = ((cR @ X3 @ (g @ (h @ (sK1 @ X3))))))) | (((cP @ X3)) != $true))),
% 0.19/0.28 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,vAPP]),skolemize(X0,sK0),skolemize(X4,sK1 @ X3)],[f7])).
% 0.19/0.28 thf(f9,plain,(
% 0.19/0.28 ( ! [X3 : $i] : ((((cP @ X3)) != $true) | ($true = ((cR @ X3 @ (g @ (h @ (sK1 @ X3))))))) )),
% 0.19/0.28 inference(cnf_transformation,[],[f8])).
% 0.19/0.28 thf(f10,plain,(
% 0.19/0.28 ( ! [X3 : $i] : ((((cP @ X3)) != $true) | ($true = ((cP @ (sK1 @ X3))))) )),
% 0.19/0.28 inference(cnf_transformation,[],[f8])).
% 0.19/0.28 thf(f11,plain,(
% 0.19/0.28 ( ! [X2 : $i] : ((((cP @ X2)) != $true) | (((cP @ (g @ X2))) = $true)) )),
% 0.19/0.28 inference(cnf_transformation,[],[f8])).
% 0.19/0.28 thf(f12,plain,(
% 0.19/0.28 ( ! [X2 : $i] : ((((cP @ X2)) != $true) | (((cP @ (h @ X2))) = $true)) )),
% 0.19/0.28 inference(cnf_transformation,[],[f8])).
% 0.19/0.28 thf(f13,plain,(
% 0.19/0.28 ($true = ((cP @ sK0)))),
% 0.19/0.28 inference(cnf_transformation,[],[f8])).
% 0.19/0.28 thf(f14,plain,(
% 0.19/0.28 ( ! [X1 : $i] : (($true != ((cR @ sK0 @ X1))) | (((cP @ X1)) != $true)) )),
% 0.19/0.28 inference(cnf_transformation,[],[f8])).
% 0.19/0.28 thf(f28,plain,(
% 0.19/0.28 ($true != $true) | ($true = ((cP @ (sK1 @ sK0))))),
% 0.19/0.28 inference(constrained_superposition,[],[f10,f13])).
% 0.19/0.28 thf(f29,plain,(
% 0.19/0.28 ($true = ((cP @ (sK1 @ sK0))))),
% 0.19/0.28 inference(trivial_inequality_removal,[],[f28])).
% 0.19/0.28 thf(f61,plain,(
% 0.19/0.28 ($true != $true) | ($true = ((cR @ sK0 @ (g @ (h @ (sK1 @ sK0))))))),
% 0.19/0.28 inference(constrained_superposition,[],[f9,f13])).
% 0.19/0.28 thf(f68,plain,(
% 0.19/0.28 ($true = ((cR @ sK0 @ (g @ (h @ (sK1 @ sK0))))))),
% 0.19/0.28 inference(trivial_inequality_removal,[],[f61])).
% 0.19/0.28 thf(f75,plain,(
% 0.19/0.28 ($true != $true) | ($true != ((cP @ (g @ (h @ (sK1 @ sK0))))))),
% 0.19/0.28 inference(constrained_superposition,[],[f14,f68])).
% 0.19/0.28 thf(f76,plain,(
% 0.19/0.28 ($true != ((cP @ (g @ (h @ (sK1 @ sK0))))))),
% 0.19/0.28 inference(trivial_inequality_removal,[],[f75])).
% 0.19/0.28 thf(f182,plain,(
% 0.19/0.28 ($true != $true) | ($true = ((cP @ (h @ (sK1 @ sK0)))))),
% 0.19/0.28 inference(constrained_superposition,[],[f12,f29])).
% 0.19/0.28 thf(f187,plain,(
% 0.19/0.28 ($true = ((cP @ (h @ (sK1 @ sK0)))))),
% 0.19/0.28 inference(trivial_inequality_removal,[],[f182])).
% 0.19/0.28 thf(f223,plain,(
% 0.19/0.28 ($true != $true) | ($true = ((cP @ (g @ (h @ (sK1 @ sK0))))))),
% 0.19/0.28 inference(constrained_superposition,[],[f11,f187])).
% 0.19/0.28 thf(f226,plain,(
% 0.19/0.28 ($true = ((cP @ (g @ (h @ (sK1 @ sK0))))))),
% 0.19/0.28 inference(trivial_inequality_removal,[],[f223])).
% 0.19/0.28 thf(f229,plain,(
% 0.19/0.28 $false),
% 0.19/0.28 inference(forward_subsumption_resolution,[],[f226,f76])).
% 0.19/0.28 % SZS output end Proof for theBenchmark
% 0.19/0.28 % (3567091)------------------------------
% 0.19/0.28 % (3567091)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.28 % (3567091)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.28 % (3567091)CaDiCaL version: 2.1.3
% 0.19/0.28 % (3567091)Termination reason: Refutation
% 0.19/0.28 % (3567091)Time elapsed: 0.005 s
% 0.19/0.28 % (3567091)Peak memory usage: 12 MB
% 0.19/0.28 % (3567091)Instructions burned: 16 (million)
% 0.19/0.28 % (3567084)Success in time 0.039 s
% 0.19/0.28 % Vampire exiting
%------------------------------------------------------------------------------