%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO159^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:46:45 AM UTC 2026
% Result : Theorem 0.34s 0.38s
% Output : Refutation 0.34s
% 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/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.26 % Computer : n013.cluster.edu
% 0.10/0.26 % Model : x86_64 x86_64
% 0.10/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.26 % Memory : 8046.5625MB
% 0.10/0.26 % OS : Linux 6.8.0-71-generic
% 0.10/0.26 % CPULimit : 300
% 0.10/0.26 % WCLimit : 300
% 0.10/0.26 % DateTime : Tue Sep 29 16:35:21 UTC 2026
% 0.10/0.27 % CPUTime :
% 0.10/0.27 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.28/0.32 Running higher-order theorem proving
% 0.28/0.34 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.34/0.38 % (2345313)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.34/0.38 % (2345318)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=543840284:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.34/0.38 % (2345318) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2345313-2345318"...
% 0.34/0.38 % (2345318)...printing done.
% 0.34/0.38 % (2345318)Refutation found. Thanks to Tanya!
% 0.34/0.38 % SZS status Theorem for theBenchmark
% 0.34/0.38 % SZS output start Proof for theBenchmark
% 0.34/0.38 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.34/0.38 thf(func_def_0, type, cC: ($i > $o)).
% 0.34/0.38 thf(func_def_1, type, cB: ($i > $i > $o)).
% 0.34/0.38 thf(func_def_2, type, cA: ($i > $o)).
% 0.34/0.38 thf(func_def_7, type, sK1: ($i > $i)).
% 0.34/0.38 thf(f1,conjecture,(
% 0.34/0.38 ~ ! [X0 : $i] : ((cA @ X0) => ? [X1 : $i] : ((cC @ X1) & (cB @ X0 @ X1))) => ? [X2 : $i] : (~ ? [X3 : $i] : ~((cB @ X2 @ X3) => ~(cC @ X3)) & (cA @ X2))),
% 0.34/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cNNF_EXAMPLE)).
% 0.34/0.38 thf(f2,negated_conjecture,(
% 0.34/0.38 ~(~ ! [X0 : $i] : ((cA @ X0) => ? [X1 : $i] : ((cC @ X1) & (cB @ X0 @ X1))) => ? [X2 : $i] : (~ ? [X3 : $i] : ~((cB @ X2 @ X3) => ~(cC @ X3)) & (cA @ X2)))),
% 0.34/0.38 inference(negated_conjecture,[status(cth)],[f1])).
% 0.34/0.38 thf(f3,plain,(
% 0.34/0.38 ~(~ ! [X0 : $i] : ((cA @ X0) => ? [X1 : $i] : ((cC @ X1) & (cB @ X0 @ X1))) => ? [X2 : $i] : (~ ? [X3 : $i] : ~((cB @ X2 @ X3) => ~(cC @ X3)) & (cA @ X2)))),
% 0.34/0.38 inference(rectify,[],[f2])).
% 0.34/0.38 thf(f4,plain,(
% 0.34/0.38 ~(~ ! [X0 : $i] : ((((cA @ X0)) = $true) => ? [X1 : $i] : ((((cB @ X0 @ X1)) = $true) & (((cC @ X1)) = $true))) => ? [X2 : $i] : (~ ? [X3 : $i] : ~((((cB @ X2 @ X3)) = $true) => ~ (((cC @ X3)) = $true)) & (((cA @ X2)) = $true)))),
% 0.34/0.38 inference(fool_elimination,[],[f3])).
% 0.34/0.38 thf(f5,plain,(
% 0.34/0.38 ~(~ ! [X0 : $i] : ((((cA @ X0)) = $true) => ? [X1 : $i] : ((((cB @ X0 @ X1)) = $true) & (((cC @ X1)) = $true))) => ? [X2 : $i] : (~ ? [X3 : $i] : ~((((cB @ X2 @ X3)) = $true) => (((cC @ X3)) != $true)) & (((cA @ X2)) = $true)))),
% 0.34/0.38 inference(flattening,[],[f4])).
% 0.34/0.38 thf(f6,plain,(
% 0.34/0.38 ? [X0 : $i] : (! [X1 : $i] : ((((cC @ X1)) != $true) | (((cB @ X0 @ X1)) != $true)) & (((cA @ X0)) = $true)) & ! [X2 : $i] : ((((cA @ X2)) != $true) | ? [X3 : $i] : ((((cC @ X3)) = $true) & (((cB @ X2 @ X3)) = $true)))),
% 0.34/0.38 inference(ennf_transformation,[],[f5])).
% 0.34/0.38 thf(f7,plain,(
% 0.34/0.38 (! [X1 : $i] : ((((cC @ X1)) != $true) | (((cB @ sK0 @ X1)) != $true)) & (((cA @ sK0)) = $true)) & ! [X2 : $i] : ((((cA @ X2)) != $true) | ((((cC @ (sK1 @ X2))) = $true) & (((cB @ X2 @ (sK1 @ X2))) = $true)))),
% 0.34/0.38 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,vAPP]),skolemize(X0,sK0),skolemize(X3,sK1 @ X2)],[f6])).
% 0.34/0.38 thf(f8,plain,(
% 0.34/0.38 ( ! [X2 : $i] : ((((cA @ X2)) != $true) | (((cB @ X2 @ (sK1 @ X2))) = $true)) )),
% 0.34/0.38 inference(cnf_transformation,[],[f7])).
% 0.34/0.38 thf(f9,plain,(
% 0.34/0.38 ( ! [X2 : $i] : ((((cA @ X2)) != $true) | (((cC @ (sK1 @ X2))) = $true)) )),
% 0.34/0.38 inference(cnf_transformation,[],[f7])).
% 0.34/0.38 thf(f10,plain,(
% 0.34/0.38 (((cA @ sK0)) = $true)),
% 0.34/0.38 inference(cnf_transformation,[],[f7])).
% 0.34/0.38 thf(f11,plain,(
% 0.34/0.38 ( ! [X1 : $i] : ((((cB @ sK0 @ X1)) != $true) | (((cC @ X1)) != $true)) )),
% 0.34/0.38 inference(cnf_transformation,[],[f7])).
% 0.34/0.38 thf(f14,plain,(
% 0.34/0.38 ($true != $true) | (((cC @ (sK1 @ sK0))) = $true)),
% 0.34/0.38 inference(constrained_superposition,[],[f9,f10])).
% 0.34/0.38 thf(f15,plain,(
% 0.34/0.38 (((cC @ (sK1 @ sK0))) = $true)),
% 0.34/0.38 inference(trivial_inequality_removal,[],[f14])).
% 0.34/0.38 thf(f16,plain,(
% 0.34/0.38 ($true != $true) | ($true = ((cB @ sK0 @ (sK1 @ sK0))))),
% 0.34/0.38 inference(constrained_superposition,[],[f8,f10])).
% 0.34/0.38 thf(f17,plain,(
% 0.34/0.38 ($true = ((cB @ sK0 @ (sK1 @ sK0))))),
% 0.34/0.38 inference(trivial_inequality_removal,[],[f16])).
% 0.34/0.38 thf(f18,plain,(
% 0.34/0.38 ($true != $true) | (((cC @ (sK1 @ sK0))) != $true)),
% 0.34/0.38 inference(constrained_superposition,[],[f11,f17])).
% 0.34/0.38 thf(f19,plain,(
% 0.34/0.38 (((cC @ (sK1 @ sK0))) != $true)),
% 0.34/0.38 inference(trivial_inequality_removal,[],[f18])).
% 0.34/0.38 thf(f20,plain,(
% 0.34/0.38 $false),
% 0.34/0.38 inference(forward_subsumption_resolution,[],[f19,f15])).
% 0.34/0.38 % SZS output end Proof for theBenchmark
% 0.34/0.38 % (2345318)------------------------------
% 0.34/0.38 % (2345318)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.34/0.38 % (2345318)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.34/0.38 % (2345318)CaDiCaL version: 2.1.3
% 0.34/0.38 % (2345318)Termination reason: Refutation
% 0.34/0.38 % (2345318)Time elapsed: 0.002 s
% 0.34/0.38 % (2345318)Peak memory usage: 12 MB
% 0.34/0.38 % (2345318)Instructions burned: 2 (million)
% 0.34/0.38 % (2345313)Success in time 0.024 s
% 0.34/0.38 % Vampire exiting
%------------------------------------------------------------------------------