%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO159^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 : n001.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:49:04 AM UTC 2026
% Result : Theorem 0.23s 0.34s
% Output : Refutation 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SYO159^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.25 % Computer : n001.cluster.edu
% 0.09/0.25 % Model : x86_64 x86_64
% 0.09/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.25 % Memory : 8046.5625MB
% 0.09/0.25 % OS : Linux 6.8.0-71-generic
% 0.09/0.25 % CPULimit : 300
% 0.09/0.25 % WCLimit : 300
% 0.09/0.25 % DateTime : Tue Sep 29 16:41:51 UTC 2026
% 0.09/0.25 % CPUTime :
% 0.09/0.25 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.23/0.30 Running first-order model finding
% 0.23/0.30 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.23/0.34 % (1470965)Will run a generic schedule for satisfiability detection.
% 0.23/0.34 % (1470972)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1095473218:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.23/0.34 % (1470975)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1227825083:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.23/0.34 % (1470971)% WARNING: option uhcvi not known.
% 0.23/0.34 % (1470975) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1470965-1470975"...
% 0.23/0.34 % (1470973)dis+10_1_sil=32000:sp=arity:random_seed=2761810736:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.23/0.34 % (1470972) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1470965-1470972"...
% 0.23/0.34 % (1470975)...printing done.
% 0.23/0.34 % (1470972)...printing done.
% 0.23/0.34 % (1470974)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2577433630:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.23/0.34 % (1470975)Refutation found. Thanks to Tanya!
% 0.23/0.34 % SZS status Theorem for theBenchmark
% 0.23/0.34 % SZS output start Proof for theBenchmark
% 0.23/0.34 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.23/0.34 thf(func_def_0, type, cC: ($i > $o)).
% 0.23/0.34 thf(func_def_1, type, cB: ($i > $i > $o)).
% 0.23/0.34 thf(func_def_2, type, cA: ($i > $o)).
% 0.23/0.34 thf(func_def_6, type, sK0: ($i > $i)).
% 0.23/0.34 thf(f1,conjecture,(
% 0.23/0.34 ~ ! [X0 : $i] : ((cA @ X0) => ? [X1 : $i] : ((cC @ X1) & (cB @ X0 @ X1))) => ? [X2 : $i] : (~ ? [X3 : $i] : ~((cB @ X2 @ X3) => ~(cC @ X3)) & (cA @ X2))),
% 0.23/0.34 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cNNF_EXAMPLE)).
% 0.23/0.34 thf(f2,negated_conjecture,(
% 0.23/0.34 ~(~ ! [X0 : $i] : ((cA @ X0) => ? [X1 : $i] : ((cC @ X1) & (cB @ X0 @ X1))) => ? [X2 : $i] : (~ ? [X3 : $i] : ~((cB @ X2 @ X3) => ~(cC @ X3)) & (cA @ X2)))),
% 0.23/0.34 inference(negated_conjecture,[status(cth)],[f1])).
% 0.23/0.34 thf(f3,plain,(
% 0.23/0.34 ~(~ ! [X0 : $i] : ((cA @ X0) => ? [X1 : $i] : ((cC @ X1) & (cB @ X0 @ X1))) => ? [X2 : $i] : (~ ? [X3 : $i] : ~((cB @ X2 @ X3) => ~(cC @ X3)) & (cA @ X2)))),
% 0.23/0.34 inference(rectify,[],[f2])).
% 0.23/0.34 thf(f4,plain,(
% 0.23/0.34 ~(~ ! [X0 : $i] : ((((cA @ X0)) = $true) => ? [X1 : $i] : ((((cC @ X1)) = $true) & (((cB @ X0 @ X1)) = $true))) => ? [X2 : $i] : (~ ? [X3 : $i] : ~((((cB @ X2 @ X3)) = $true) => ~ (((cC @ X3)) = $true)) & (((cA @ X2)) = $true)))),
% 0.23/0.34 inference(fool_elimination,[],[f3])).
% 0.23/0.34 thf(f5,plain,(
% 0.23/0.34 ~(~ ! [X0 : $i] : ((((cA @ X0)) = $true) => ? [X1 : $i] : ((((cC @ X1)) = $true) & (((cB @ X0 @ X1)) = $true))) => ? [X2 : $i] : (~ ? [X3 : $i] : ~((((cB @ X2 @ X3)) = $true) => (((cC @ X3)) != $true)) & (((cA @ X2)) = $true)))),
% 0.23/0.34 inference(flattening,[],[f4])).
% 0.23/0.34 thf(f6,plain,(
% 0.23/0.34 ! [X2 : $i] : (? [X3 : $i] : ((((cC @ X3)) = $true) & (((cB @ X2 @ X3)) = $true)) | (((cA @ X2)) != $true)) & ? [X0 : $i] : (! [X1 : $i] : ((((cC @ X1)) != $true) | (((cB @ X0 @ X1)) != $true)) & (((cA @ X0)) = $true))),
% 0.23/0.34 inference(ennf_transformation,[],[f5])).
% 0.23/0.34 thf(f7,plain,(
% 0.23/0.34 ! [X0 : $i] : (? [X1 : $i] : ((((cC @ X1)) = $true) & (((cB @ X0 @ X1)) = $true)) | (((cA @ X0)) != $true)) & ? [X2 : $i] : (! [X3 : $i] : ((((cC @ X3)) != $true) | (((cB @ X2 @ X3)) != $true)) & (((cA @ X2)) = $true))),
% 0.23/0.34 inference(rectify,[],[f6])).
% 0.23/0.34 thf(f8,plain,(
% 0.23/0.34 ! [X0 : $i] : ((($true = ((cC @ (sK0 @ X0)))) & ($true = ((cB @ X0 @ (sK0 @ X0))))) | (((cA @ X0)) != $true)) & (! [X3 : $i] : ((((cC @ X3)) != $true) | ($true != ((cB @ sK1 @ X3)))) & ($true = ((cA @ sK1))))),
% 0.23/0.34 inference(skolemize,[status(esa),new_symbols(skolem,[vAPP,sK1]),skolemize(X1,sK0 @ X0),skolemize(X2,sK1)],[f7])).
% 0.23/0.34 thf(f9,plain,(
% 0.23/0.34 ($true = ((cA @ sK1)))),
% 0.23/0.34 inference(cnf_transformation,[],[f8])).
% 0.23/0.34 thf(f10,plain,(
% 0.23/0.34 ( ! [X3 : $i] : (($true != ((cB @ sK1 @ X3))) | (((cC @ X3)) != $true)) )),
% 0.23/0.34 inference(cnf_transformation,[],[f8])).
% 0.23/0.34 thf(f11,plain,(
% 0.23/0.34 ( ! [X0 : $i] : ((((cA @ X0)) != $true) | ($true = ((cB @ X0 @ (sK0 @ X0))))) )),
% 0.23/0.34 inference(cnf_transformation,[],[f8])).
% 0.23/0.34 thf(f12,plain,(
% 0.23/0.34 ( ! [X0 : $i] : ((((cA @ X0)) != $true) | ($true = ((cC @ (sK0 @ X0))))) )),
% 0.23/0.34 inference(cnf_transformation,[],[f8])).
% 0.23/0.34 thf(f15,plain,(
% 0.23/0.34 ($true != $true) | ($true = ((cC @ (sK0 @ sK1))))),
% 0.23/0.34 inference(constrained_superposition,[],[f12,f9])).
% 0.23/0.34 thf(f16,plain,(
% 0.23/0.34 ($true = ((cC @ (sK0 @ sK1))))),
% 0.23/0.34 inference(trivial_inequality_removal,[],[f15])).
% 0.23/0.34 thf(f17,plain,(
% 0.23/0.34 ($true != $true) | ($true = ((cB @ sK1 @ (sK0 @ sK1))))),
% 0.23/0.34 inference(constrained_superposition,[],[f11,f9])).
% 0.23/0.34 thf(f18,plain,(
% 0.23/0.34 ($true = ((cB @ sK1 @ (sK0 @ sK1))))),
% 0.23/0.34 inference(trivial_inequality_removal,[],[f17])).
% 0.23/0.34 thf(f19,plain,(
% 0.23/0.34 ($true != $true) | ($true != ((cC @ (sK0 @ sK1))))),
% 0.23/0.34 inference(constrained_superposition,[],[f10,f18])).
% 0.23/0.34 thf(f20,plain,(
% 0.23/0.34 ($true != ((cC @ (sK0 @ sK1))))),
% 0.23/0.34 inference(trivial_inequality_removal,[],[f19])).
% 0.23/0.34 thf(f21,plain,(
% 0.23/0.34 $false),
% 0.23/0.34 inference(forward_subsumption_resolution,[],[f20,f16])).
% 0.23/0.34 % SZS output end Proof for theBenchmark
% 0.23/0.34 % (1470975)------------------------------
% 0.23/0.34 % (1470975)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.34 % (1470975)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.34 % (1470975)CaDiCaL version: 2.1.3
% 0.23/0.34 % (1470975)Termination reason: Refutation
% 0.23/0.34 % (1470975)Time elapsed: 0.002 s
% 0.23/0.34 % (1470975)Peak memory usage: 12 MB
% 0.23/0.34 % (1470975)Instructions burned: 2 (million)
% 0.23/0.34 % (1470965)Success in time 0.032 s
% 0.23/0.34 % Vampire exiting
%------------------------------------------------------------------------------