%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU506_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 : n001.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:31 PM UTC 2026
% Result : Theorem 0.10s 0.44s
% Output : Refutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU506_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n001.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 05:47:09 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 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.10/0.44 % (66618)Will run a generic schedule for satisfiability detection.
% 0.10/0.44 % (66627)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1774382939:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.44 % (66627) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-66618-66627"...
% 0.10/0.44 % (66627)...printing done.
% 0.10/0.44 % (66627)Refutation found. Thanks to Tanya!
% 0.10/0.44 % SZS status Theorem for theBenchmark
% 0.10/0.44 % SZS output start Proof for theBenchmark
% 0.10/0.44 fof(f1,axiom,(
% 0.10/0.44 (emptysetE = ! [X0] : (in(X0,emptyset) => ! [X1 : $o] : X1))),
% 0.10/0.44 file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptysetE)).
% 0.10/0.44 fof(f2,axiom,(
% 0.10/0.44 (setext = ! [X0,X1] : (! [X2] : (in(X2,X0) => in(X2,X1)) => (! [X2] : (in(X2,X1) => in(X2,X0)) => X0 = X1)))),
% 0.10/0.44 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setext)).
% 0.10/0.44 fof(f3,conjecture,(
% 0.10/0.44 emptysetE => (setext => ! [X0] : (! [X1] : ~in(X1,X0) => X0 = emptyset))),
% 0.10/0.44 file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptyI)).
% 0.10/0.44 fof(f4,negated_conjecture,(
% 0.10/0.44 ~(emptysetE => (setext => ! [X0] : (! [X1] : ~in(X1,X0) => X0 = emptyset)))),
% 0.10/0.44 inference(negated_conjecture,[status(cth)],[f3])).
% 0.10/0.44 fof(f5,plain,(
% 0.10/0.44 (emptysetE = ! [X0] : (in(X0,emptyset) => ! [X1 : $o] : X1))),
% 0.10/0.44 inference(rectify,[],[f1])).
% 0.10/0.44 fof(f6,plain,(
% 0.10/0.44 emptysetE <=> ! [X0] : (in(X0,emptyset) => ! [X1 : $o] : X1)),
% 0.10/0.44 inference(flattening,[],[f5])).
% 0.10/0.44 fof(f7,plain,(
% 0.10/0.44 (setext = ! [X0,X1] : (! [X2] : (in(X2,X0) => in(X2,X1)) => (! [X3] : (in(X3,X1) => in(X3,X0)) => X0 = X1)))),
% 0.10/0.44 inference(rectify,[],[f2])).
% 0.10/0.44 fof(f8,plain,(
% 0.10/0.44 setext <=> ! [X0,X1] : (! [X2] : (in(X2,X0) => in(X2,X1)) => (! [X3] : (in(X3,X1) => in(X3,X0)) => X0 = X1))),
% 0.10/0.44 inference(flattening,[],[f7])).
% 0.10/0.44 fof(f9,plain,(
% 0.10/0.44 setext => ! [X0,X1] : (! [X2] : (in(X2,X0) => in(X2,X1)) => (! [X3] : (in(X3,X1) => in(X3,X0)) => X0 = X1))),
% 0.10/0.44 inference(unused_predicate_definition_removal,[],[f8])).
% 0.10/0.44 fof(f10,plain,(
% 0.10/0.44 emptysetE => ! [X0] : (in(X0,emptyset) => ! [X1 : $o] : X1)),
% 0.10/0.44 inference(unused_predicate_definition_removal,[],[f6])).
% 0.10/0.44 fof(f11,plain,(
% 0.10/0.44 ! [X0] : (! [X1 : $o] : X1 | ~in(X0,emptyset)) | ~emptysetE),
% 0.10/0.44 inference(ennf_transformation,[],[f10])).
% 0.10/0.44 fof(f12,plain,(
% 0.10/0.44 ! [X0,X1] : ((X0 = X1 | ? [X3] : (~in(X3,X0) & in(X3,X1))) | ? [X2] : (~in(X2,X1) & in(X2,X0))) | ~setext),
% 0.10/0.44 inference(ennf_transformation,[],[f9])).
% 0.10/0.44 fof(f13,plain,(
% 0.10/0.44 ! [X0,X1] : (X0 = X1 | ? [X3] : (~in(X3,X0) & in(X3,X1)) | ? [X2] : (~in(X2,X1) & in(X2,X0))) | ~setext),
% 0.10/0.44 inference(flattening,[],[f12])).
% 0.10/0.44 fof(f14,plain,(
% 0.10/0.44 (? [X0] : (emptyset != X0 & ! [X1] : ~in(X1,X0)) & setext) & emptysetE),
% 0.10/0.44 inference(ennf_transformation,[],[f4])).
% 0.10/0.44 fof(f15,plain,(
% 0.10/0.44 ? [X0] : (emptyset != X0 & ! [X1] : ~in(X1,X0)) & setext & emptysetE),
% 0.10/0.44 inference(flattening,[],[f14])).
% 0.10/0.44 fof(f16,plain,(
% 0.10/0.44 ( ! [X0] : (~emptysetE | ~in(X0,emptyset)) )),
% 0.10/0.44 inference(cnf_transformation,[],[f11])).
% 0.10/0.44 fof(f19,plain,(
% 0.10/0.44 ( ! [X0,X1] : (~setext | in(sK0(X0,X1),X0) | in(sK1(X0,X1),X1) | X0 = X1) )),
% 0.10/0.44 inference(cnf_transformation,[],[f13])).
% 0.10/0.44 fof(f21,plain,(
% 0.10/0.44 ( ! [X1] : (~in(X1,sK2)) )),
% 0.10/0.44 inference(cnf_transformation,[],[f15])).
% 0.10/0.44 fof(f22,plain,(
% 0.10/0.44 emptyset != sK2),
% 0.10/0.44 inference(cnf_transformation,[],[f15])).
% 0.10/0.44 fof(f23,plain,(
% 0.10/0.44 emptysetE),
% 0.10/0.44 inference(cnf_transformation,[],[f15])).
% 0.10/0.44 fof(f24,plain,(
% 0.10/0.44 setext),
% 0.10/0.44 inference(cnf_transformation,[],[f15])).
% 0.10/0.44 fof(f27,plain,(
% 0.10/0.44 ( ! [X0,X1] : (in(sK0(X0,X1),X0) | in(sK1(X0,X1),X1) | X0 = X1) )),
% 0.10/0.44 inference(forward_subsumption_resolution,[],[f19,f24])).
% 0.10/0.44 fof(f29,plain,(
% 0.10/0.44 ( ! [X0] : (~in(X0,emptyset)) )),
% 0.10/0.44 inference(forward_subsumption_resolution,[],[f16,f23])).
% 0.10/0.44 fof(f35,plain,(
% 0.10/0.44 ( ! [X0] : (in(sK0(X0,sK2),X0) | sK2 = X0) )),
% 0.10/0.44 inference(resolution,[],[f27,f21])).
% 0.10/0.44 fof(f39,plain,(
% 0.10/0.44 emptyset = sK2),
% 0.10/0.44 inference(resolution,[],[f35,f29])).
% 0.10/0.44 fof(f40,plain,(
% 0.10/0.44 $false),
% 0.10/0.44 inference(forward_subsumption_resolution,[],[f39,f22])).
% 0.10/0.44 % SZS output end Proof for theBenchmark
% 0.10/0.44 % (66627)------------------------------
% 0.10/0.44 % (66627)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.44 % (66627)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.44 % (66627)CaDiCaL version: 2.1.3
% 0.10/0.44 % (66627)Termination reason: Refutation
% 0.10/0.44 % (66627)Time elapsed: 0.001 s
% 0.10/0.44 % (66627)Peak memory usage: 11 MB
% 0.10/0.44 % (66627)Instructions burned: 1 (million)
% 0.10/0.44 % (66618)Success in time 0.028 s
% 0.10/0.44 % Vampire exiting
%------------------------------------------------------------------------------