%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO094^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 : n011.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:36 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO094^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.18 % Computer : n011.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 16:33:46 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running higher-order theorem proving
% 0.09/0.22 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.20/0.27 % (305471)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.27 % (305477)lrs+10_16_si=on:nwc=1.5:random_seed=2778388022:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.20/0.27 % (305477) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-305471-305477"...
% 0.20/0.27 % (305477)...printing done.
% 0.20/0.27 % (305477)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Theorem for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% 0.20/0.27 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.20/0.27 thf(func_def_0, type, cR: ($i > $i > $o)).
% 0.20/0.27 thf(func_def_4, type, sK0: ($i > $i)).
% 0.20/0.27 thf(f1,conjecture,(
% 0.20/0.27 (? [X0 : $i] : (cR @ X0 @ X0) => ! [X1 : $i] : (cR @ X1 @ X1)) => ? [X2 : $i] : ! [X3 : $i] : ((cR @ X2 @ X2) => (cR @ X3 @ X3))),
% 0.20/0.27 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM55A)).
% 0.20/0.27 thf(f2,negated_conjecture,(
% 0.20/0.27 ~((? [X0 : $i] : (cR @ X0 @ X0) => ! [X1 : $i] : (cR @ X1 @ X1)) => ? [X2 : $i] : ! [X3 : $i] : ((cR @ X2 @ X2) => (cR @ X3 @ X3)))),
% 0.20/0.27 inference(negated_conjecture,[status(cth)],[f1])).
% 0.20/0.27 thf(f3,plain,(
% 0.20/0.27 ~((? [X0 : $i] : (cR @ X0 @ X0) => ! [X1 : $i] : (cR @ X1 @ X1)) => ? [X2 : $i] : ! [X3 : $i] : ((cR @ X2 @ X2) => (cR @ X3 @ X3)))),
% 0.20/0.27 inference(rectify,[],[f2])).
% 0.20/0.27 thf(f4,plain,(
% 0.20/0.27 ~((? [X0 : $i] : (((cR @ X0 @ X0)) = $true) => ! [X1 : $i] : (((cR @ X1 @ X1)) = $true)) => ? [X2 : $i] : ! [X3 : $i] : ((((cR @ X2 @ X2)) = $true) => (((cR @ X3 @ X3)) = $true)))),
% 0.20/0.27 inference(fool_elimination,[],[f3])).
% 0.20/0.27 thf(f5,plain,(
% 0.20/0.27 ! [X2 : $i] : ? [X3 : $i] : ((((cR @ X2 @ X2)) = $true) & (((cR @ X3 @ X3)) != $true)) & (! [X0 : $i] : (((cR @ X0 @ X0)) != $true) | ! [X1 : $i] : (((cR @ X1 @ X1)) = $true))),
% 0.20/0.27 inference(ennf_transformation,[],[f4])).
% 0.20/0.27 thf(f6,plain,(
% 0.20/0.27 ! [X0 : $i] : ? [X1 : $i] : ((((cR @ X0 @ X0)) = $true) & (((cR @ X1 @ X1)) != $true)) & (! [X2 : $i] : (((cR @ X2 @ X2)) != $true) | ! [X3 : $i] : (((cR @ X3 @ X3)) = $true))),
% 0.20/0.27 inference(rectify,[],[f5])).
% 0.20/0.27 thf(f7,plain,(
% 0.20/0.27 ! [X0 : $i] : ((((cR @ X0 @ X0)) = $true) & (((cR @ (sK0 @ X0) @ (sK0 @ X0))) != $true)) & (! [X2 : $i] : (((cR @ X2 @ X2)) != $true) | ! [X3 : $i] : (((cR @ X3 @ X3)) = $true))),
% 0.20/0.27 inference(skolemize,[status(esa),new_symbols(skolem,[vAPP]),skolemize(X1,sK0 @ X0)],[f6])).
% 0.20/0.27 thf(f9,plain,(
% 0.20/0.27 ( ! [X0 : $i] : ((((cR @ (sK0 @ X0) @ (sK0 @ X0))) != $true)) )),
% 0.20/0.27 inference(cnf_transformation,[],[f7])).
% 0.20/0.27 thf(f10,plain,(
% 0.20/0.27 ( ! [X0 : $i] : ((((cR @ X0 @ X0)) = $true)) )),
% 0.20/0.27 inference(cnf_transformation,[],[f7])).
% 0.20/0.27 thf(f14,definition,(
% 0.20/0.27 spl1_1 <=> ! [X3 : $i] : (((cR @ X3 @ X3)) = $true)),
% 0.20/0.27 introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition])).
% 0.20/0.27 thf(f15,plain,(
% 0.20/0.27 ( ! [X3 : $i] : ((((cR @ X3 @ X3)) = $true)) ) | ~spl1_1),
% 0.20/0.27 inference(avatar_component_clause,[],[f14])).
% 0.20/0.27 thf(f20,plain,(
% 0.20/0.27 spl1_1),
% 0.20/0.27 inference(avatar_split_clause,[],[f10,f14])).
% 0.20/0.27 thf(f21,plain,(
% 0.20/0.27 ($true != $true) | ~spl1_1),
% 0.20/0.27 inference(constrained_superposition,[],[f9,f15])).
% 0.20/0.27 thf(f22,plain,(
% 0.20/0.27 $false | ~spl1_1),
% 0.20/0.27 inference(trivial_inequality_removal,[],[f21])).
% 0.20/0.27 thf(f23,plain,(
% 0.20/0.27 ~spl1_1),
% 0.20/0.27 inference(avatar_contradiction_clause,[],[f22])).
% 0.20/0.27 cnf(s2, plain, spl1_1, inference(sat_conversion,[],[f20])).
% 0.20/0.27 cnf(s3, plain, ~spl1_1, inference(sat_conversion,[],[f23])).
% 0.20/0.27 cnf(s4, plain, $false, inference(rat,[],[s2,s3])).
% 0.20/0.27 thf(f24,plain,(
% 0.20/0.27 $false),
% 0.20/0.27 inference(avatar_sat_refutation,[],[s4])).
% 0.20/0.27 % SZS output end Proof for theBenchmark
% 0.20/0.27 % (305477)------------------------------
% 0.20/0.27 % (305477)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (305477)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (305477)CaDiCaL version: 2.1.3
% 0.20/0.27 % (305477)Termination reason: Refutation
% 0.20/0.27 % (305477)Time elapsed: 0.001 s
% 0.20/0.27 % (305477)Peak memory usage: 13 MB
% 0.20/0.27 % (305477)Instructions burned: 1 (million)
% 0.20/0.27 % (305471)Success in time 0.034 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------