%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV176^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 : n010.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:37:58 AM UTC 2026
% Result : Theorem 0.34s 0.40s
% Output : Refutation 0.34s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEV176^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.28 % Computer : n010.cluster.edu
% 0.23/0.28 % Model : x86_64 x86_64
% 0.23/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.23/0.28 % Memory : 8046.5625MB
% 0.23/0.28 % OS : Linux 6.8.0-71-generic
% 0.23/0.28 % CPULimit : 300
% 0.23/0.28 % WCLimit : 300
% 0.23/0.28 % DateTime : Tue Sep 29 15:19:03 UTC 2026
% 0.23/0.28 % CPUTime :
% 0.23/0.28 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.33 Running higher-order theorem proving
% 0.23/0.35 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.34/0.40 % (2984751)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.34/0.40 % (2984757)lrs+10_16_si=on:nwc=1.5:random_seed=1127815838:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.34/0.40 % (2984757) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2984751-2984757"...
% 0.34/0.40 % (2984757)...printing done.
% 0.34/0.40 % (2984757)Refutation found. Thanks to Tanya!
% 0.34/0.40 % SZS status Theorem for theBenchmark
% 0.34/0.40 % SZS output start Proof for theBenchmark
% 0.34/0.40 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.34/0.40 thf(func_def_0, type, cR: ($i > $i > $o)).
% 0.34/0.40 thf(func_def_5, type, sK1: ($i > $i)).
% 0.34/0.40 thf(f1,conjecture,(
% 0.34/0.40 ~ ? [X0 : $i] : ! [X1 : $i] : ((cR @ X1 @ X0) <=> ~ ? [X2 : $i] : ((cR @ X1 @ X2) & (cR @ X2 @ X1)))),
% 0.34/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM25)).
% 0.34/0.40 thf(f2,negated_conjecture,(
% 0.34/0.40 ~ ~ ? [X0 : $i] : ! [X1 : $i] : ((cR @ X1 @ X0) <=> ~ ? [X2 : $i] : ((cR @ X1 @ X2) & (cR @ X2 @ X1)))),
% 0.34/0.40 inference(negated_conjecture,[status(cth)],[f1])).
% 0.34/0.40 thf(f3,plain,(
% 0.34/0.40 ~ ~ ? [X0 : $i] : ! [X1 : $i] : ((cR @ X1 @ X0) <=> ~ ? [X2 : $i] : ((cR @ X1 @ X2) & (cR @ X2 @ X1)))),
% 0.34/0.40 inference(rectify,[],[f2])).
% 0.34/0.40 thf(f4,plain,(
% 0.34/0.40 ~ ~ ? [X0 : $i] : ! [X1 : $i] : ((((cR @ X1 @ X0)) = $true) <=> ~ ? [X2 : $i] : ((((cR @ X1 @ X2)) = $true) & (((cR @ X2 @ X1)) = $true)))),
% 0.34/0.40 inference(fool_elimination,[],[f3])).
% 0.34/0.40 thf(f5,plain,(
% 0.34/0.40 ? [X0 : $i] : ! [X1 : $i] : ((((cR @ X1 @ X0)) = $true) <=> ~ ? [X2 : $i] : ((((cR @ X1 @ X2)) = $true) & (((cR @ X2 @ X1)) = $true)))),
% 0.34/0.40 inference(flattening,[],[f4])).
% 0.34/0.40 thf(f6,plain,(
% 0.34/0.40 ? [X0 : $i] : ! [X1 : $i] : (! [X2 : $i] : ((((cR @ X2 @ X1)) != $true) | (((cR @ X1 @ X2)) != $true)) <=> (((cR @ X1 @ X0)) = $true))),
% 0.34/0.40 inference(ennf_transformation,[],[f5])).
% 0.34/0.40 thf(f7,plain,(
% 0.34/0.40 ? [X0 : $i] : ! [X1 : $i] : ((! [X2 : $i] : ((((cR @ X2 @ X1)) != $true) | (((cR @ X1 @ X2)) != $true)) | (((cR @ X1 @ X0)) != $true)) & ((((cR @ X1 @ X0)) = $true) | ? [X2 : $i] : ((((cR @ X2 @ X1)) = $true) & (((cR @ X1 @ X2)) = $true))))),
% 0.34/0.40 inference(nnf_transformation,[],[f6])).
% 0.34/0.40 thf(f8,plain,(
% 0.34/0.40 ? [X0 : $i] : ! [X1 : $i] : ((! [X2 : $i] : ((((cR @ X2 @ X1)) != $true) | (((cR @ X1 @ X2)) != $true)) | (((cR @ X1 @ X0)) != $true)) & ((((cR @ X1 @ X0)) = $true) | ? [X3 : $i] : (($true = ((cR @ X3 @ X1))) & ($true = ((cR @ X1 @ X3))))))),
% 0.34/0.40 inference(rectify,[],[f7])).
% 0.34/0.40 thf(f9,plain,(
% 0.34/0.40 ! [X1 : $i] : ((! [X2 : $i] : ((((cR @ X2 @ X1)) != $true) | (((cR @ X1 @ X2)) != $true)) | ($true != ((cR @ X1 @ sK0)))) & (($true = ((cR @ X1 @ sK0))) | (($true = ((cR @ (sK1 @ X1) @ X1))) & ($true = ((cR @ X1 @ (sK1 @ X1)))))))),
% 0.34/0.40 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,vAPP]),skolemize(X0,sK0),skolemize(X3,sK1 @ X1)],[f8])).
% 0.34/0.40 thf(f10,plain,(
% 0.34/0.40 ( ! [X1 : $i] : (($true = ((cR @ X1 @ (sK1 @ X1)))) | ($true = ((cR @ X1 @ sK0)))) )),
% 0.34/0.40 inference(cnf_transformation,[],[f9])).
% 0.34/0.40 thf(f11,plain,(
% 0.34/0.40 ( ! [X1 : $i] : (($true = ((cR @ (sK1 @ X1) @ X1))) | ($true = ((cR @ X1 @ sK0)))) )),
% 0.34/0.40 inference(cnf_transformation,[],[f9])).
% 0.34/0.40 thf(f12,plain,(
% 0.34/0.40 ( ! [X2 : $i,X1 : $i] : (($true != ((cR @ X1 @ sK0))) | (((cR @ X2 @ X1)) != $true) | (((cR @ X1 @ X2)) != $true)) )),
% 0.34/0.40 inference(cnf_transformation,[],[f9])).
% 0.34/0.40 thf(f15,plain,(
% 0.34/0.40 ( ! [X0 : $i] : ((((cR @ sK0 @ sK0)) = $true) | ($true != ((cR @ (sK1 @ sK0) @ X0))) | ($true != ((cR @ X0 @ (sK1 @ sK0)))) | ($true != $true)) )),
% 0.34/0.40 inference(constrained_superposition,[],[f12,f11])).
% 0.34/0.40 thf(f16,plain,(
% 0.34/0.40 ( ! [X0 : $i] : ((((cR @ sK0 @ sK0)) = $true) | ($true != ((cR @ X0 @ (sK1 @ sK0)))) | ($true != ((cR @ (sK1 @ sK0) @ X0)))) )),
% 0.34/0.40 inference(trivial_inequality_removal,[],[f15])).
% 0.34/0.40 thf(f18,definition,(
% 0.34/0.40 spl2_1 <=> ! [X0 : $i] : (($true != ((cR @ X0 @ (sK1 @ sK0)))) | ($true != ((cR @ (sK1 @ sK0) @ X0))))),
% 0.34/0.40 introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition])).
% 0.34/0.40 thf(f19,plain,(
% 0.34/0.40 ( ! [X0 : $i] : (($true != ((cR @ (sK1 @ sK0) @ X0))) | ($true != ((cR @ X0 @ (sK1 @ sK0))))) ) | ~spl2_1),
% 0.34/0.40 inference(avatar_component_clause,[],[f18])).
% 0.34/0.40 thf(f21,definition,(
% 0.34/0.40 spl2_2 <=> (((cR @ sK0 @ sK0)) = $true)),
% 0.34/0.40 introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition])).
% 0.34/0.40 thf(f22,plain,(
% 0.34/0.40 (((cR @ sK0 @ sK0)) != $true) | spl2_2),
% 0.34/0.40 inference(avatar_component_clause,[],[f21])).
% 0.34/0.40 thf(f23,plain,(
% 0.34/0.40 (((cR @ sK0 @ sK0)) = $true) | ~spl2_2),
% 0.34/0.40 inference(avatar_component_clause,[],[f21])).
% 0.34/0.40 thf(f24,plain,(
% 0.34/0.40 spl2_1 | spl2_2),
% 0.34/0.40 inference(avatar_split_clause,[],[f16,f21,f18])).
% 0.34/0.40 thf(f25,plain,(
% 0.34/0.40 ( ! [X0 : $i] : (($true != ((cR @ sK0 @ X0))) | ($true != $true) | ($true != ((cR @ X0 @ sK0)))) ) | ~spl2_2),
% 0.34/0.40 inference(constrained_superposition,[],[f12,f23])).
% 0.34/0.40 thf(f26,plain,(
% 0.34/0.40 ( ! [X0 : $i] : (($true != ((cR @ sK0 @ X0))) | ($true != ((cR @ X0 @ sK0)))) ) | ~spl2_2),
% 0.34/0.40 inference(trivial_inequality_removal,[],[f25])).
% 0.34/0.40 thf(f28,plain,(
% 0.34/0.40 ($true != $true) | ($true != $true) | ~spl2_2),
% 0.34/0.40 inference(constrained_superposition,[],[f26,f23])).
% 0.34/0.40 thf(f30,plain,(
% 0.34/0.40 ($true != $true) | ~spl2_2),
% 0.34/0.40 inference(duplicate_literal_removal,[],[f28])).
% 0.34/0.40 thf(f31,plain,(
% 0.34/0.40 $false | ~spl2_2),
% 0.34/0.40 inference(trivial_inequality_removal,[],[f30])).
% 0.34/0.40 thf(f32,plain,(
% 0.34/0.40 ~spl2_2),
% 0.34/0.40 inference(avatar_contradiction_clause,[],[f31])).
% 0.34/0.40 thf(f34,plain,(
% 0.34/0.40 (((cR @ sK0 @ sK0)) = $true) | ($true != ((cR @ sK0 @ (sK1 @ sK0)))) | ($true != $true) | ~spl2_1),
% 0.34/0.40 inference(constrained_superposition,[],[f19,f11])).
% 0.34/0.40 thf(f35,plain,(
% 0.34/0.40 (((cR @ sK0 @ sK0)) = $true) | ($true != ((cR @ sK0 @ (sK1 @ sK0)))) | ~spl2_1),
% 0.34/0.40 inference(trivial_inequality_removal,[],[f34])).
% 0.34/0.40 thf(f37,plain,(
% 0.34/0.40 ($true != ((cR @ sK0 @ (sK1 @ sK0)))) | (~spl2_1 | spl2_2)),
% 0.34/0.40 inference(forward_subsumption_resolution,[],[f35,f22])).
% 0.34/0.40 thf(f39,plain,(
% 0.34/0.40 (((cR @ sK0 @ sK0)) = $true) | ($true != $true) | (~spl2_1 | spl2_2)),
% 0.34/0.40 inference(constrained_superposition,[],[f37,f10])).
% 0.34/0.40 thf(f40,plain,(
% 0.34/0.40 (((cR @ sK0 @ sK0)) = $true) | (~spl2_1 | spl2_2)),
% 0.34/0.40 inference(trivial_inequality_removal,[],[f39])).
% 0.34/0.40 thf(f41,plain,(
% 0.34/0.40 $false | (~spl2_1 | spl2_2)),
% 0.34/0.40 inference(forward_subsumption_resolution,[],[f40,f22])).
% 0.34/0.40 thf(f42,plain,(
% 0.34/0.40 ~spl2_1 | spl2_2),
% 0.34/0.40 inference(avatar_contradiction_clause,[],[f41])).
% 0.34/0.40 cnf(s1, plain, spl2_1 | spl2_2, inference(sat_conversion,[],[f24])).
% 0.34/0.40 cnf(s2, plain, ~spl2_2, inference(sat_conversion,[],[f32])).
% 0.34/0.40 cnf(s3, plain, ~spl2_1 | spl2_2, inference(sat_conversion,[],[f42])).
% 0.34/0.40 cnf(s4, plain, ~spl2_1, inference(rat,[],[s3,s2])).
% 0.34/0.40 cnf(s5, plain, $false, inference(rat,[],[s1,s2,s4])).
% 0.34/0.40 thf(f43,plain,(
% 0.34/0.40 $false),
% 0.34/0.40 inference(avatar_sat_refutation,[],[s5])).
% 0.34/0.40 % SZS output end Proof for theBenchmark
% 0.34/0.40 % (2984757)------------------------------
% 0.34/0.40 % (2984757)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.34/0.40 % (2984757)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.34/0.40 % (2984757)CaDiCaL version: 2.1.3
% 0.34/0.40 % (2984757)Termination reason: Refutation
% 0.34/0.40 % (2984757)Time elapsed: 0.003 s
% 0.34/0.40 % (2984757)Peak memory usage: 13 MB
% 0.34/0.40 % (2984757)Instructions burned: 3 (million)
% 0.34/0.40 % (2984751)Success in time 0.028 s
% 0.34/0.40 % Vampire exiting
%------------------------------------------------------------------------------