%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYN731^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 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:44 AM UTC 2026
% Result : Theorem 0.19s 0.30s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN731^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 % Computer : n007.cluster.edu
% 0.08/0.22 % Model : x86_64 x86_64
% 0.08/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.22 % Memory : 8046.5625MB
% 0.08/0.22 % OS : Linux 6.8.0-71-generic
% 0.08/0.22 % CPULimit : 300
% 0.08/0.22 % WCLimit : 300
% 0.08/0.22 % DateTime : Tue Sep 29 16:16:34 UTC 2026
% 0.08/0.22 % CPUTime :
% 0.08/0.22 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.26 Running higher-order theorem proving
% 0.19/0.27 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.19/0.30 % (3570075)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.19/0.30 % (3570086)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.19/0.30 % (3570086)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.19/0.30 % (3570086)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=2347262223:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.19/0.30 % (3570086) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3570075-3570086"...
% 0.19/0.30 % (3570086)...printing done.
% 0.19/0.30 % (3570086)Refutation found. Thanks to Tanya!
% 0.19/0.30 % SZS status Theorem for theBenchmark
% 0.19/0.30 % SZS output start Proof for theBenchmark
% 0.19/0.30 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.19/0.30 thf(func_def_0, type, cP: ($i > $i > $i > $o)).
% 0.19/0.30 thf(func_def_4, type, sK0: ($i > $i > $i)).
% 0.19/0.30 thf(func_def_5, type, sF1: ($i > $i > $i)).
% 0.19/0.30 thf(func_def_6, type, sF2: ($i > $i > $o)).
% 0.19/0.30 thf(func_def_7, type, sF3: ($i > $i > $o)).
% 0.19/0.30 thf(f1,conjecture,(
% 0.19/0.30 ? [X0 : $i] : (! [X1 : $i] : ? [X2 : $i] : (cP @ X0 @ X1 @ X2) => ? [X3 : $i] : (cP @ X3 @ X3 @ X0))),
% 0.19/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX2150)).
% 0.19/0.30 thf(f2,negated_conjecture,(
% 0.19/0.30 ~ ? [X0 : $i] : (! [X1 : $i] : ? [X2 : $i] : (cP @ X0 @ X1 @ X2) => ? [X3 : $i] : (cP @ X3 @ X3 @ X0))),
% 0.19/0.30 inference(negated_conjecture,[status(cth)],[f1])).
% 0.19/0.30 thf(f3,plain,(
% 0.19/0.30 ~ ? [X0 : $i] : (! [X1 : $i] : ? [X2 : $i] : (cP @ X0 @ X1 @ X2) => ? [X3 : $i] : (cP @ X3 @ X3 @ X0))),
% 0.19/0.30 inference(rectify,[],[f2])).
% 0.19/0.30 thf(f4,plain,(
% 0.19/0.30 ~ ? [X0 : $i] : (! [X1 : $i] : ? [X2 : $i] : (((cP @ X0 @ X1 @ X2)) = $true) => ? [X3 : $i] : (((cP @ X3 @ X3 @ X0)) = $true))),
% 0.19/0.30 inference(fool_elimination,[],[f3])).
% 0.19/0.30 thf(f5,plain,(
% 0.19/0.30 ! [X0 : $i] : (! [X1 : $i] : ? [X2 : $i] : (((cP @ X0 @ X1 @ X2)) = $true) & ! [X3 : $i] : (((cP @ X3 @ X3 @ X0)) != $true))),
% 0.19/0.30 inference(ennf_transformation,[],[f4])).
% 0.19/0.30 thf(f6,plain,(
% 0.19/0.30 ! [X0 : $i] : (! [X1 : $i] : ($true = ((cP @ X0 @ X1 @ (sK0 @ X1 @ X0)))) & ! [X3 : $i] : (((cP @ X3 @ X3 @ X0)) != $true))),
% 0.19/0.30 inference(skolemize,[status(esa),new_symbols(skolem,[vAPP]),skolemize(X2,sK0 @ X1 @ X0)],[f5])).
% 0.19/0.30 thf(f7,plain,(
% 0.19/0.30 ( ! [X3 : $i,X0 : $i] : ((((cP @ X3 @ X3 @ X0)) != $true)) )),
% 0.19/0.30 inference(cnf_transformation,[],[f6])).
% 0.19/0.30 thf(f8,plain,(
% 0.19/0.30 ( ! [X0 : $i,X1 : $i] : (($true = ((cP @ X0 @ X1 @ (sK0 @ X1 @ X0))))) )),
% 0.19/0.30 inference(cnf_transformation,[],[f6])).
% 0.19/0.30 thf(f11,definition,(
% 0.19/0.30 ( ! [X0 : $i,X1 : $i] : ((((sF1 @ X0 @ X1)) = ((sK0 @ X1 @ X0)))) )),
% 0.19/0.30 introduced(definition,[new_symbols(definition,[sF1])],[function_definition])).
% 0.19/0.30 thf(f12,definition,(
% 0.19/0.30 ( ! [X0 : $i,X1 : $i] : ((((sF2 @ X1 @ X0)) = ((cP @ X0 @ X1 @ (sF1 @ X0 @ X1))))) )),
% 0.19/0.30 introduced(definition,[new_symbols(definition,[sF2])],[function_definition])).
% 0.19/0.30 thf(f13,plain,(
% 0.19/0.30 ( ! [X0 : $i,X1 : $i] : (($true = ((sF2 @ X1 @ X0)))) )),
% 0.19/0.30 inference(definition_folding,[],[f8,f12,f11])).
% 0.19/0.30 thf(f14,definition,(
% 0.19/0.30 ( ! [X3 : $i,X0 : $i] : ((((sF3 @ X0 @ X3)) = ((cP @ X3 @ X3 @ X0)))) )),
% 0.19/0.30 introduced(definition,[new_symbols(definition,[sF3])],[function_definition])).
% 0.19/0.30 thf(f15,plain,(
% 0.19/0.30 ( ! [X3 : $i,X0 : $i] : ((((cP @ X3 @ X3 @ X0)) = ((sF3 @ X0 @ X3)))) )),
% 0.19/0.30 inference(reorient_equations,[],[f14])).
% 0.19/0.30 thf(f16,plain,(
% 0.19/0.30 ( ! [X3 : $i,X0 : $i] : (($true != ((sF3 @ X0 @ X3)))) )),
% 0.19/0.30 inference(definition_folding,[],[f7,f15])).
% 0.19/0.30 thf(f18,plain,(
% 0.19/0.30 ( ! [X3 : $i,X0 : $i] : (($true = ((sF3 @ X0 @ X3))) | (((cP @ X3 @ X3 @ X0)) = $false)) )),
% 0.19/0.30 inference(iff_proxy_clausification,[],[f15])).
% 0.19/0.30 thf(f20,plain,(
% 0.19/0.30 ( ! [X0 : $i,X1 : $i] : (($true = ((cP @ X0 @ X1 @ (sF1 @ X0 @ X1)))) | (((sF2 @ X1 @ X0)) = $false)) )),
% 0.19/0.30 inference(iff_proxy_clausification,[],[f12])).
% 0.19/0.30 thf(f33,plain,(
% 0.19/0.30 ( ! [X3 : $i,X0 : $i] : ((((cP @ X3 @ X3 @ X0)) = $false)) )),
% 0.19/0.30 inference(forward_subsumption_resolution,[],[f18,f16])).
% 0.19/0.30 thf(f36,plain,(
% 0.19/0.30 ( ! [X0 : $i,X1 : $i] : (($true = $false) | ($true = ((cP @ X0 @ X1 @ (sF1 @ X0 @ X1))))) )),
% 0.19/0.30 inference(forward_demodulation,[],[f20,f13])).
% 0.19/0.30 thf(f37,plain,(
% 0.19/0.30 ( ! [X0 : $i,X1 : $i] : (($true = ((cP @ X0 @ X1 @ (sF1 @ X0 @ X1))))) )),
% 0.19/0.30 inference(trivial_inequality_removal,[],[f36])).
% 0.19/0.30 thf(f39,plain,(
% 0.19/0.30 ($true = $false)),
% 0.19/0.30 inference(constrained_superposition,[],[f37,f33])).
% 0.19/0.30 thf(f41,plain,(
% 0.19/0.30 $false),
% 0.19/0.30 inference(trivial_inequality_removal,[],[f39])).
% 0.19/0.30 % SZS output end Proof for theBenchmark
% 0.19/0.30 % (3570086)------------------------------
% 0.19/0.30 % (3570086)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.30 % (3570086)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.30 % (3570086)CaDiCaL version: 2.1.3
% 0.19/0.30 % (3570086)Termination reason: Refutation
% 0.19/0.30 % (3570086)Time elapsed: 0.002 s
% 0.19/0.30 % (3570086)Peak memory usage: 12 MB
% 0.19/0.30 % (3570086)Instructions burned: 3 (million)
% 0.19/0.30 % (3570075)Success in time 0.024 s
% 0.19/0.30 % Vampire exiting
%------------------------------------------------------------------------------