%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO029^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:19 AM UTC 2026
% Result : Theorem 0.10s 0.26s
% Output : Refutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO029^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.18 % Computer : n008.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Tue Sep 29 16:23:14 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.22 Running higher-order theorem proving
% 0.10/0.23 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.26 % (3365255)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.10/0.26 % (3365269)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3345072146:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.10/0.26 % (3365269) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3365255-3365269"...
% 0.10/0.26 % (3365270)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.10/0.26 % (3365269)...printing done.
% 0.10/0.26 % (3365270)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.10/0.26 % (3365269)Refutation found. Thanks to Tanya!
% 0.10/0.26 % SZS status Theorem for theBenchmark
% 0.10/0.26 % SZS output start Proof for theBenchmark
% 0.10/0.26 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.10/0.26 thf(func_def_3, type, sK0: (($o > $o) > $o)).
% 0.10/0.26 thf(func_def_4, type, vNOT: ($o > $o)).
% 0.10/0.26 thf(func_def_5, type, db0: !>[X0: $tType]:(X0)).
% 0.10/0.26 thf(func_def_6, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.10/0.26 thf(func_def_7, type, db1: !>[X0: $tType]:(X0)).
% 0.10/0.26 thf(f1,conjecture,(
% 0.10/0.26 ? [X0 : ($o > $o)] : ! [X1 : $o] : (~X1 <=> (X0 @ X1))),
% 0.10/0.26 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)).
% 0.10/0.26 thf(f2,negated_conjecture,(
% 0.10/0.26 ~ ? [X0 : ($o > $o)] : ! [X1 : $o] : (~X1 <=> (X0 @ X1))),
% 0.10/0.26 inference(negated_conjecture,[status(cth)],[f1])).
% 0.10/0.26 thf(f3,plain,(
% 0.10/0.26 ~ ? [X0 : ($o > $o)] : ! [X1 : $o] : (~X1 <=> (X0 @ X1))),
% 0.10/0.26 inference(rectify,[],[f2])).
% 0.10/0.26 thf(f4,plain,(
% 0.10/0.26 ~ ? [X0 : ($o > $o)] : ! [X1 : $o] : (~ ($true = X1) <=> (((X0 @ X1)) = $true))),
% 0.10/0.26 inference(fool_elimination,[],[f3])).
% 0.10/0.26 thf(f5,plain,(
% 0.10/0.26 ~ ? [X0 : ($o > $o)] : ! [X1 : $o] : (($true != X1) <=> (((X0 @ X1)) = $true))),
% 0.10/0.26 inference(flattening,[],[f4])).
% 0.10/0.26 thf(f6,plain,(
% 0.10/0.26 ! [X0 : ($o > $o)] : ? [X1 : $o] : ((((X0 @ X1)) = $true) <~> ($true != X1))),
% 0.10/0.26 inference(ennf_transformation,[],[f5])).
% 0.10/0.26 thf(f7,plain,(
% 0.10/0.26 ! [X0 : ($o > $o)] : ? [X1 : $o] : ((($true = X1) | (((X0 @ X1)) != $true)) & (($true != X1) | (((X0 @ X1)) = $true)))),
% 0.10/0.26 inference(nnf_transformation,[],[f6])).
% 0.10/0.26 thf(f8,plain,(
% 0.10/0.26 ! [X0 : ($o > $o)] : ((($true = ((sK0 @ X0))) | ($true != ((X0 @ (sK0 @ X0))))) & (($true != ((sK0 @ X0))) | ($true = ((X0 @ (sK0 @ X0))))))),
% 0.10/0.26 inference(skolemize,[status(esa),new_symbols(skolem,[vAPP]),skolemize(X1,sK0 @ X0)],[f7])).
% 0.10/0.26 thf(f9,plain,(
% 0.10/0.26 ( ! [X0 : ($o > $o)] : (($true != ((sK0 @ X0))) | ($true = ((X0 @ (sK0 @ X0))))) )),
% 0.10/0.26 inference(cnf_transformation,[],[f8])).
% 0.10/0.26 thf(f10,plain,(
% 0.10/0.26 ( ! [X0 : ($o > $o)] : (($true != ((X0 @ (sK0 @ X0)))) | ($true = ((sK0 @ X0)))) )),
% 0.10/0.26 inference(cnf_transformation,[],[f8])).
% 0.10/0.26 thf(f16,plain,(
% 0.10/0.26 ( ! [X1 : ($o > $o)] : (($true != (((^[Y0 : $o]: (~ (X1 @ Y0))) @ (sK0 @ (^[Y0 : $o]: (~ (X1 @ Y0))))))) | (((sK0 @ (^[Y0 : $o]: (~ (X1 @ Y0))))) = $true)) )),
% 0.10/0.26 inference(primitive_instantiation,[],[f10])).
% 0.10/0.26 thf(f21,plain,(
% 0.10/0.26 ( ! [X1 : ($o > $o)] : ((((~ (X1 @ (sK0 @ (^[Y0 : $o]: (~ (X1 @ Y0))))))) != $true) | (((sK0 @ (^[Y0 : $o]: (~ (X1 @ Y0))))) = $true)) )),
% 0.10/0.26 inference(beta-eta_normalization,[],[f16])).
% 0.10/0.26 thf(f22,plain,(
% 0.10/0.26 ( ! [X1 : ($o > $o)] : (($true = ((X1 @ (sK0 @ (^[Y0 : $o]: (~ (X1 @ Y0))))))) | (((sK0 @ (^[Y0 : $o]: (~ (X1 @ Y0))))) = $true)) )),
% 0.10/0.26 inference(not_proxy_clausification,[],[f21])).
% 0.10/0.26 thf(f46,plain,(
% 0.10/0.26 ($true = ((sK0 @ (^[Y0 : $o]: (~ ((^[Y1 : $o]: (Y1)) @ Y0)))))) | ($true = (((^[Y0 : $o]: (Y0)) @ (sK0 @ (^[Y0 : $o]: (~ ((^[Y1 : $o]: (Y1)) @ Y0)))))))),
% 0.10/0.26 inference(primitive_instantiation,[],[f22])).
% 0.10/0.26 thf(f56,plain,(
% 0.10/0.26 ($true = ((sK0 @ ~))) | ($true = ((sK0 @ ~)))),
% 0.10/0.26 inference(beta-eta_normalization,[],[f46])).
% 0.10/0.26 thf(f57,plain,(
% 0.10/0.26 ($true = ((sK0 @ ~)))),
% 0.10/0.26 inference(duplicate_literal_removal,[],[f56])).
% 0.10/0.26 thf(f84,plain,(
% 0.10/0.26 ($true = ((~ $true))) | ($true != $true)),
% 0.10/0.26 inference(constrained_superposition,[],[f9,f57])).
% 0.10/0.26 thf(f88,plain,(
% 0.10/0.26 ($false = $true) | ($true != $true)),
% 0.10/0.26 inference(not_proxy_clausification,[],[f84])).
% 0.10/0.26 thf(f89,plain,(
% 0.10/0.26 $false),
% 0.10/0.26 inference(trivial_inequality_removal,[],[f88])).
% 0.10/0.26 % SZS output end Proof for theBenchmark
% 0.10/0.26 % (3365269)------------------------------
% 0.10/0.26 % (3365269)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.26 % (3365269)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.26 % (3365269)CaDiCaL version: 2.1.3
% 0.10/0.26 % (3365269)Termination reason: Refutation
% 0.10/0.26 % (3365269)Time elapsed: 0.003 s
% 0.10/0.26 % (3365269)Peak memory usage: 12 MB
% 0.10/0.26 % (3365269)Instructions burned: 6 (million)
% 0.10/0.26 % (3365255)Success in time 0.019 s
% 0.10/0.26 % Vampire exiting
%------------------------------------------------------------------------------