%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV434^1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n016.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:39:30 AM UTC 2026
% Result : Theorem 0.11s 0.28s
% Output : Refutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV434^1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.19 % Computer : n016.cluster.edu
% 0.11/0.19 % Model : x86_64 x86_64
% 0.11/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.19 % Memory : 8046.5625MB
% 0.11/0.19 % OS : Linux 6.8.0-71-generic
% 0.11/0.19 % CPULimit : 300
% 0.11/0.19 % WCLimit : 300
% 0.11/0.19 % DateTime : Tue Sep 29 15:51:50 UTC 2026
% 0.11/0.20 % CPUTime :
% 0.11/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.23 Running first-order model finding
% 0.11/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.28 % (513022)Will run a generic schedule for satisfiability detection.
% 0.11/0.28 % (513030)dis+10_1_sil=32000:sp=arity:random_seed=2639833792:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.28 % (513028)% WARNING: option uhcvi not known.
% 0.11/0.28 % (513031)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4122106457:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.28 % (513028)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=317644864:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.28 % (513029)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3556813594:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.28 % (513031)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.11/0.28 % (513028)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.11/0.28 % (513028)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.11/0.28 % (513032)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3778569402:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.28 % (513027)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1238993460_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.28 % Exception at run slice level
% 0.11/0.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.11/0.28 % (513032) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-513022-513032"...
% 0.11/0.28 % (513032)...printing done.
% 0.11/0.28 % (513032)Refutation found. Thanks to Tanya!
% 0.11/0.28 % SZS status Theorem for theBenchmark
% 0.11/0.28 % SZS output start Proof for theBenchmark
% 0.11/0.28 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.11/0.28 thf(func_def_0, type, f: ($o > $i)).
% 0.11/0.28 thf(func_def_2, type, sK0: ($i > $o)).
% 0.11/0.28 thf(f1,axiom,(
% 0.11/0.28 ! [X0 : $i] : ? [X1 : $o] : (((f @ X1)) = X0)),
% 0.11/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fsurj)).
% 0.11/0.28 thf(f2,conjecture,(
% 0.11/0.28 ! [X0 : $i,X1 : $i,X2 : $i] : ((X1 = X2) | (X0 = X2) | (X0 = X1))),
% 0.11/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less3)).
% 0.11/0.28 thf(f3,negated_conjecture,(
% 0.11/0.28 ~ ! [X0 : $i,X1 : $i,X2 : $i] : ((X1 = X2) | (X0 = X2) | (X0 = X1))),
% 0.11/0.28 inference(negated_conjecture,[status(cth)],[f2])).
% 0.11/0.28 thf(f4,plain,(
% 0.11/0.28 ? [X0 : $i,X1 : $i,X2 : $i] : ((X1 != X2) & (X0 != X2) & (X0 != X1))),
% 0.11/0.28 inference(ennf_transformation,[],[f3])).
% 0.11/0.28 thf(f5,plain,(
% 0.11/0.28 ! [X0 : $i] : (((f @ (sK0 @ X0))) = X0)),
% 0.11/0.28 inference(skolemize,[status(esa),new_symbols(skolem,[vAPP]),skolemize(X1,sK0 @ X0)],[f1])).
% 0.11/0.28 thf(f6,plain,(
% 0.11/0.28 (sK2 != sK3) & (sK1 != sK3) & (sK1 != sK2)),
% 0.11/0.28 inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3)],[f4])).
% 0.11/0.28 thf(f7,plain,(
% 0.11/0.28 ( ! [X0 : $i] : ((((f @ (sK0 @ X0))) = X0)) )),
% 0.11/0.28 inference(cnf_transformation,[],[f5])).
% 0.11/0.28 thf(f8,plain,(
% 0.11/0.28 (sK1 != sK2)),
% 0.11/0.28 inference(cnf_transformation,[],[f6])).
% 0.11/0.28 thf(f9,plain,(
% 0.11/0.28 (sK1 != sK3)),
% 0.11/0.28 inference(cnf_transformation,[],[f6])).
% 0.11/0.28 thf(f10,plain,(
% 0.11/0.28 (sK2 != sK3)),
% 0.11/0.28 inference(cnf_transformation,[],[f6])).
% 0.11/0.28 thf(f12,definition,(
% 0.11/0.28 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.11/0.28 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.11/0.28 thf(f20,plain,(
% 0.11/0.28 ( ! [X0 : $i] : ((((sK0 @ X0)) = $false) | (((f @ $true)) = X0)) )),
% 0.11/0.28 inference(constrained_superposition,[],[f7,f12])).
% 0.11/0.28 thf(f22,plain,(
% 0.11/0.28 ( ! [X0 : $i] : ((((f @ $true)) = X0) | (((f @ $false)) = X0)) )),
% 0.11/0.28 inference(constrained_superposition,[],[f7,f20])).
% 0.11/0.28 thf(f26,plain,(
% 0.11/0.28 (sK1 != ((f @ $true))) | (sK2 = ((f @ $false)))),
% 0.11/0.28 inference(constrained_superposition,[],[f8,f22])).
% 0.11/0.28 thf(f27,plain,(
% 0.11/0.28 (sK2 != ((f @ $true))) | (sK3 = ((f @ $false)))),
% 0.11/0.28 inference(constrained_superposition,[],[f10,f22])).
% 0.11/0.28 thf(f28,plain,(
% 0.11/0.28 (sK1 != ((f @ $true))) | (sK3 = ((f @ $false)))),
% 0.11/0.28 inference(constrained_superposition,[],[f9,f22])).
% 0.11/0.28 thf(f41,definition,(
% 0.11/0.28 spl4_3 <=> (sK3 = ((f @ $false)))),
% 0.11/0.28 introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition])).
% 0.11/0.28 thf(f43,plain,(
% 0.11/0.28 (sK3 = ((f @ $false))) | ~spl4_3),
% 0.11/0.28 inference(avatar_component_clause,[],[f41])).
% 0.11/0.28 thf(f45,definition,(
% 0.11/0.28 spl4_4 <=> (sK1 = ((f @ $true)))),
% 0.11/0.28 introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition])).
% 0.11/0.28 thf(f47,plain,(
% 0.11/0.28 (sK1 != ((f @ $true))) | spl4_4),
% 0.11/0.28 inference(avatar_component_clause,[],[f45])).
% 0.11/0.28 thf(f48,plain,(
% 0.11/0.28 spl4_3 | ~spl4_4),
% 0.11/0.28 inference(avatar_split_clause,[],[f28,f45,f41])).
% 0.11/0.28 thf(f50,definition,(
% 0.11/0.28 spl4_5 <=> (sK2 = ((f @ $true)))),
% 0.11/0.28 introduced(definition,[new_symbols(definition,[spl4_5])],[avatar_definition])).
% 0.11/0.28 thf(f52,plain,(
% 0.11/0.28 (sK2 != ((f @ $true))) | spl4_5),
% 0.11/0.28 inference(avatar_component_clause,[],[f50])).
% 0.11/0.28 thf(f53,plain,(
% 0.11/0.28 spl4_3 | ~spl4_5),
% 0.11/0.28 inference(avatar_split_clause,[],[f27,f50,f41])).
% 0.11/0.28 thf(f55,definition,(
% 0.11/0.28 spl4_6 <=> (sK2 = ((f @ $false)))),
% 0.11/0.28 introduced(definition,[new_symbols(definition,[spl4_6])],[avatar_definition])).
% 0.11/0.28 thf(f57,plain,(
% 0.11/0.28 (sK2 = ((f @ $false))) | ~spl4_6),
% 0.11/0.28 inference(avatar_component_clause,[],[f55])).
% 0.11/0.28 thf(f58,plain,(
% 0.11/0.28 spl4_6 | ~spl4_4),
% 0.11/0.28 inference(avatar_split_clause,[],[f26,f45,f55])).
% 0.11/0.28 thf(f59,plain,(
% 0.11/0.28 (((f @ $true)) != ((f @ $true))) | (sK1 = ((f @ $false))) | spl4_4),
% 0.11/0.28 inference(constrained_superposition,[],[f47,f22])).
% 0.11/0.28 thf(f60,plain,(
% 0.11/0.28 (sK1 = ((f @ $false))) | spl4_4),
% 0.11/0.28 inference(trivial_inequality_removal,[],[f59])).
% 0.11/0.28 thf(f61,plain,(
% 0.11/0.28 (((f @ $true)) != ((f @ $true))) | (sK2 = ((f @ $false))) | spl4_5),
% 0.11/0.28 inference(constrained_superposition,[],[f52,f22])).
% 0.11/0.28 thf(f62,plain,(
% 0.11/0.28 (sK2 = ((f @ $false))) | spl4_5),
% 0.11/0.28 inference(trivial_inequality_removal,[],[f61])).
% 0.11/0.28 thf(f63,plain,(
% 0.11/0.28 spl4_6 | spl4_5),
% 0.11/0.28 inference(avatar_split_clause,[],[f62,f50,f55])).
% 0.11/0.28 thf(f66,plain,(
% 0.11/0.28 (sK1 != ((f @ $false))) | ~spl4_6),
% 0.11/0.28 inference(constrained_superposition,[],[f8,f57])).
% 0.11/0.28 thf(f67,plain,(
% 0.11/0.28 $false | (spl4_4 | ~spl4_6)),
% 0.11/0.28 inference(forward_subsumption_resolution,[],[f66,f60])).
% 0.11/0.28 thf(f68,plain,(
% 0.11/0.28 spl4_4 | ~spl4_6),
% 0.11/0.28 inference(avatar_contradiction_clause,[],[f67])).
% 0.11/0.28 thf(f71,plain,(
% 0.11/0.28 (sK2 != ((f @ $false))) | ~spl4_3),
% 0.11/0.28 inference(constrained_superposition,[],[f10,f43])).
% 0.11/0.28 thf(f72,plain,(
% 0.11/0.28 (sK1 != ((f @ $false))) | ~spl4_3),
% 0.11/0.28 inference(constrained_superposition,[],[f9,f43])).
% 0.11/0.28 thf(f74,plain,(
% 0.11/0.28 $false | (~spl4_3 | ~spl4_6)),
% 0.11/0.28 inference(forward_subsumption_resolution,[],[f71,f57])).
% 0.11/0.28 thf(f75,plain,(
% 0.11/0.28 ~spl4_3 | ~spl4_6),
% 0.11/0.28 inference(avatar_contradiction_clause,[],[f74])).
% 0.11/0.28 thf(f78,plain,(
% 0.11/0.28 $false | (~spl4_3 | spl4_4)),
% 0.11/0.28 inference(forward_subsumption_resolution,[],[f72,f60])).
% 0.11/0.28 thf(f79,plain,(
% 0.11/0.28 ~spl4_3 | spl4_4),
% 0.11/0.28 inference(avatar_contradiction_clause,[],[f78])).
% 0.11/0.28 cnf(s2, plain, spl4_3 | ~spl4_4, inference(sat_conversion,[],[f48])).
% 0.11/0.28 cnf(s3, plain, spl4_3 | ~spl4_5, inference(sat_conversion,[],[f53])).
% 0.11/0.28 cnf(s4, plain, ~spl4_4 | spl4_6, inference(sat_conversion,[],[f58])).
% 0.11/0.28 cnf(s5, plain, spl4_5 | spl4_6, inference(sat_conversion,[],[f63])).
% 0.11/0.28 cnf(s6, plain, spl4_4 | ~spl4_6, inference(sat_conversion,[],[f68])).
% 0.11/0.28 cnf(s7, plain, ~spl4_3 | ~spl4_6, inference(sat_conversion,[],[f75])).
% 0.11/0.28 cnf(s8, plain, ~spl4_3 | spl4_4, inference(sat_conversion,[],[f79])).
% 0.11/0.28 cnf(s9, plain, spl4_3, inference(rat,[],[s6,s5,s2,s3])).
% 0.11/0.28 cnf(s10, plain, spl4_4, inference(rat,[],[s8,s9])).
% 0.11/0.28 cnf(s11, plain, ~spl4_6, inference(rat,[],[s7,s9])).
% 0.11/0.28 cnf(s12, plain, $false, inference(rat,[],[s4,s11,s10])).
% 0.11/0.28 thf(f80,plain,(
% 0.11/0.28 $false),
% 0.11/0.28 inference(avatar_sat_refutation,[],[s12])).
% 0.11/0.28 % SZS output end Proof for theBenchmark
% 0.11/0.28 % (513032)------------------------------
% 0.11/0.28 % (513032)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.28 % (513032)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.28 % (513032)CaDiCaL version: 2.1.3
% 0.11/0.28 % (513032)Termination reason: Refutation
% 0.11/0.28 % (513032)Time elapsed: 0.003 s
% 0.11/0.28 % (513032)Peak memory usage: 13 MB
% 0.11/0.28 % (513032)Instructions burned: 3 (million)
% 0.11/0.28 % (513022)Success in time 0.04 s
% 0.11/0.28 % Vampire exiting
%------------------------------------------------------------------------------