%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU502_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n009.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 : Tue Sep 29 12:53:29 PM UTC 2026
% Result : Theorem 0.12s 0.46s
% Output : Refutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU502_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39 % Computer : n009.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Mon Sep 28 05:41:00 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.46 % (2736377)Will run a generic schedule for satisfiability detection.
% 0.12/0.46 % (2736385)dis+10_1_sil=32000:sp=arity:random_seed=3696278174:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.12/0.46 % (2736385) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2736377-2736385"...
% 0.12/0.46 % (2736385)...printing done.
% 0.12/0.46 % (2736385)Refutation found. Thanks to Tanya!
% 0.12/0.46 % SZS status Theorem for theBenchmark
% 0.12/0.46 % SZS output start Proof for theBenchmark
% 0.12/0.46 tff(f1,axiom,(
% 0.12/0.46 (emptysetE = ! [X0 : $i] : (in(X0,emptyset) => ! [X1 : $o] : X1))),
% 0.12/0.46 file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptysetE)).
% 0.12/0.46 tff(f2,conjecture,(
% 0.12/0.46 emptysetE => ! [X0 : $i] : (in(X0,emptyset) => $false)),
% 0.12/0.46 file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptysetimpfalse)).
% 0.12/0.46 tff(f3,negated_conjecture,(
% 0.12/0.46 ~(emptysetE => ! [X0 : $i] : (in(X0,emptyset) => $false))),
% 0.12/0.46 inference(negated_conjecture,[status(cth)],[f2])).
% 0.12/0.46 tff(f4,plain,(
% 0.12/0.46 (emptysetE = ! [X0 : $i] : (in(X0,emptyset) => ! [X1 : $o] : X1))),
% 0.12/0.46 inference(rectify,[],[f1])).
% 0.12/0.46 tff(f5,plain,(
% 0.12/0.46 emptysetE <=> ! [X0 : $i] : (in(X0,emptyset) => ! [X1 : $o] : ($true = X1))),
% 0.12/0.46 inference(fool_elimination,[],[f4])).
% 0.12/0.46 tff(f6,plain,(
% 0.12/0.46 ~(emptysetE => ! [X0 : $i] : ~ in(X0,emptyset))),
% 0.12/0.46 inference(true_and_false_elimination,[],[f3])).
% 0.12/0.46 tff(f7,plain,(
% 0.12/0.46 ~(emptysetE => ! [X0 : $i] : ~in(X0,emptyset))),
% 0.12/0.46 inference(flattening,[],[f6])).
% 0.12/0.46 tff(f8,plain,(
% 0.12/0.46 emptysetE => ! [X0 : $i] : (in(X0,emptyset) => ! [X1 : $o] : ($true = X1))),
% 0.12/0.46 inference(unused_predicate_definition_removal,[],[f5])).
% 0.12/0.46 tff(f9,plain,(
% 0.12/0.46 ! [X0 : $i] : (! [X1 : $o] : ($true = X1) | ~in(X0,emptyset)) | ~emptysetE),
% 0.12/0.46 inference(ennf_transformation,[],[f8])).
% 0.12/0.46 tff(f10,plain,(
% 0.12/0.46 ? [X0 : $i] : in(X0,emptyset) & emptysetE),
% 0.12/0.46 inference(ennf_transformation,[],[f7])).
% 0.12/0.46 tff(f11,plain,(
% 0.12/0.46 in(sK0,emptyset) & emptysetE),
% 0.12/0.46 inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f10])).
% 0.12/0.46 tff(f12,plain,(
% 0.12/0.46 ( ! [X0 : $i,X1 : $o] : (($true = X1) | ~in(X0,emptyset) | ~emptysetE) )),
% 0.12/0.46 inference(cnf_transformation,[],[f9])).
% 0.12/0.46 tff(f13,plain,(
% 0.12/0.46 emptysetE),
% 0.12/0.46 inference(cnf_transformation,[],[f11])).
% 0.12/0.46 tff(f14,plain,(
% 0.12/0.46 in(sK0,emptyset)),
% 0.12/0.46 inference(cnf_transformation,[],[f11])).
% 0.12/0.46 tff(f15,definition,(
% 0.12/0.46 ($true != $false)),
% 0.12/0.46 introduced(theory,[fool_distinctness_axiom])).
% 0.12/0.46 tff(f18,definition,(
% 0.12/0.46 spl1_1 <=> emptysetE),
% 0.12/0.46 introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition])).
% 0.12/0.46 tff(f22,definition,(
% 0.12/0.46 spl1_2 <=> ! [X0 : $i] : ~in(X0,emptyset)),
% 0.12/0.46 introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition])).
% 0.12/0.46 tff(f23,plain,(
% 0.12/0.46 ( ! [X0 : $i] : (~in(X0,emptyset)) ) | ~spl1_2),
% 0.12/0.46 inference(avatar_component_clause,[],[f22])).
% 0.12/0.46 tff(f25,definition,(
% 0.12/0.46 spl1_3 <=> ! [X1 : $o] : ($true = X1)),
% 0.12/0.46 introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition])).
% 0.12/0.46 tff(f26,plain,(
% 0.12/0.46 ( ! [X1 : $o] : (($true = X1)) ) | ~spl1_3),
% 0.12/0.46 inference(avatar_component_clause,[],[f25])).
% 0.12/0.46 tff(f27,plain,(
% 0.12/0.46 ~spl1_1 | spl1_2 | spl1_3),
% 0.12/0.46 inference(avatar_split_clause,[],[f12,f25,f22,f18])).
% 0.12/0.46 tff(f28,plain,(
% 0.12/0.46 spl1_1),
% 0.12/0.46 inference(avatar_split_clause,[],[f13,f18])).
% 0.12/0.46 tff(f29,plain,(
% 0.12/0.46 ( ! [X0 : $o,X1 : $o] : ((X0 = X1)) ) | ~spl1_3),
% 0.12/0.46 inference(superposition,[],[f26,f26])).
% 0.12/0.46 tff(f32,plain,(
% 0.12/0.46 ( ! [X0 : $o] : (($false != X0)) ) | ~spl1_3),
% 0.12/0.46 inference(superposition,[],[f15,f29])).
% 0.12/0.46 tff(f37,plain,(
% 0.12/0.46 $false | ~spl1_3),
% 0.12/0.46 inference(forward_subsumption_resolution,[],[f32,f29])).
% 0.12/0.46 tff(f38,plain,(
% 0.12/0.46 ~spl1_3),
% 0.12/0.46 inference(avatar_contradiction_clause,[],[f37])).
% 0.12/0.46 tff(f39,plain,(
% 0.12/0.46 $false | ~spl1_2),
% 0.12/0.46 inference(resolution,[],[f23,f14])).
% 0.12/0.46 tff(f40,plain,(
% 0.12/0.46 ~spl1_2),
% 0.12/0.46 inference(avatar_contradiction_clause,[],[f39])).
% 0.12/0.46 cnf(s1, plain, ~spl1_1 | spl1_2 | spl1_3, inference(sat_conversion,[],[f27])).
% 0.12/0.46 cnf(s2, plain, spl1_1, inference(sat_conversion,[],[f28])).
% 0.12/0.46 cnf(s4, plain, ~spl1_3, inference(sat_conversion,[],[f38])).
% 0.12/0.46 cnf(s5, plain, ~spl1_2, inference(sat_conversion,[],[f40])).
% 0.12/0.46 cnf(s6, plain, $false, inference(rat,[],[s1,s4,s5,s2])).
% 0.12/0.46 tff(f41,plain,(
% 0.12/0.46 $false),
% 0.12/0.46 inference(avatar_sat_refutation,[],[s6])).
% 0.12/0.46 % SZS output end Proof for theBenchmark
% 0.12/0.46 % (2736385)------------------------------
% 0.12/0.46 % (2736385)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.46 % (2736385)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.46 % (2736385)CaDiCaL version: 2.1.3
% 0.12/0.46 % (2736385)Termination reason: Refutation
% 0.12/0.46 % (2736385)Time elapsed: 0.001 s
% 0.12/0.46 % (2736385)Peak memory usage: 12 MB
% 0.12/0.46 % (2736385)Instructions burned: 1 (million)
% 0.12/0.46 % (2736377)Success in time 0.025 s
% 0.12/0.46 % Vampire exiting
%------------------------------------------------------------------------------