%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU610_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n004.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:59 PM UTC 2026
% Result : Theorem 0.23s 0.51s
% Output : Refutation 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU610_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.17/0.43 % Computer : n004.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Mon Sep 28 05:45:22 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.17/0.48 Running first-order model finding
% 0.17/0.48 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.23/0.51 % (66926)Will run a generic schedule for satisfiability detection.
% 0.23/0.51 % (66935)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3412457755:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.23/0.51 % (66935) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-66926-66935"...
% 0.23/0.51 % (66935)...printing done.
% 0.23/0.51 % (66935)Refutation found. Thanks to Tanya!
% 0.23/0.51 % SZS status Theorem for theBenchmark
% 0.23/0.51 % SZS output start Proof for theBenchmark
% 0.23/0.51 fof(f1,axiom,(
% 0.23/0.51 (emptysetE = ! [X0] : (in(X0,emptyset) => ! [X1 : $o] : X1))),
% 0.23/0.51 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',emptysetE)).
% 0.23/0.51 fof(f3,axiom,(
% 0.23/0.51 (subsetI2 = ! [X0,X1] : (! [X2] : (in(X2,X0) => in(X2,X1)) => subset(X0,X1)))),
% 0.23/0.51 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetI2)).
% 0.23/0.51 fof(f4,axiom,(
% 0.23/0.51 (setminusI = ! [X0,X1,X2] : (in(X2,X0) => (~in(X2,X1) => in(X2,setminus(X0,X1)))))),
% 0.23/0.51 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setminusI)).
% 0.23/0.51 fof(f5,conjecture,(
% 0.23/0.51 emptysetE => (in__Cong => (subsetI2 => (setminusI => ! [X0,X1] : (setminus(X0,X1) = emptyset => subset(X0,X1)))))),
% 0.23/0.51 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setminusSubset1)).
% 0.23/0.51 fof(f6,negated_conjecture,(
% 0.23/0.51 ~(emptysetE => (in__Cong => (subsetI2 => (setminusI => ! [X0,X1] : (setminus(X0,X1) = emptyset => subset(X0,X1))))))),
% 0.23/0.51 inference(negated_conjecture,[status(cth)],[f5])).
% 0.23/0.51 fof(f7,plain,(
% 0.23/0.51 (emptysetE = ! [X0] : (in(X0,emptyset) => ! [X1 : $o] : X1))),
% 0.23/0.51 inference(rectify,[],[f1])).
% 0.23/0.51 fof(f8,plain,(
% 0.23/0.51 emptysetE <=> ! [X0] : (in(X0,emptyset) => ! [X1 : $o] : X1)),
% 0.23/0.51 inference(flattening,[],[f7])).
% 0.23/0.51 fof(f10,plain,(
% 0.23/0.51 subsetI2 <=> ! [X0,X1] : (! [X2] : (in(X2,X0) => in(X2,X1)) => subset(X0,X1))),
% 0.23/0.51 inference(flattening,[],[f3])).
% 0.23/0.51 fof(f11,plain,(
% 0.23/0.51 setminusI <=> ! [X0,X1,X2] : (in(X2,X0) => (~in(X2,X1) => in(X2,setminus(X0,X1))))),
% 0.23/0.51 inference(flattening,[],[f4])).
% 0.23/0.51 fof(f12,plain,(
% 0.23/0.51 setminusI => ! [X0,X1,X2] : (in(X2,X0) => (~in(X2,X1) => in(X2,setminus(X0,X1))))),
% 0.23/0.51 inference(unused_predicate_definition_removal,[],[f11])).
% 0.23/0.51 fof(f13,plain,(
% 0.23/0.51 subsetI2 => ! [X0,X1] : (! [X2] : (in(X2,X0) => in(X2,X1)) => subset(X0,X1))),
% 0.23/0.51 inference(unused_predicate_definition_removal,[],[f10])).
% 0.23/0.51 fof(f15,plain,(
% 0.23/0.51 emptysetE => ! [X0] : (in(X0,emptyset) => ! [X1 : $o] : X1)),
% 0.23/0.51 inference(unused_predicate_definition_removal,[],[f8])).
% 0.23/0.51 fof(f16,plain,(
% 0.23/0.51 ! [X0] : (! [X1 : $o] : X1 | ~in(X0,emptyset)) | ~emptysetE),
% 0.23/0.51 inference(ennf_transformation,[],[f15])).
% 0.23/0.51 fof(f18,plain,(
% 0.23/0.51 ! [X0,X1] : (subset(X0,X1) | ? [X2] : (~in(X2,X1) & in(X2,X0))) | ~subsetI2),
% 0.23/0.51 inference(ennf_transformation,[],[f13])).
% 0.23/0.51 fof(f19,plain,(
% 0.23/0.51 ! [X0,X1,X2] : ((in(X2,setminus(X0,X1)) | in(X2,X1)) | ~in(X2,X0)) | ~setminusI),
% 0.23/0.51 inference(ennf_transformation,[],[f12])).
% 0.23/0.51 fof(f20,plain,(
% 0.23/0.51 ! [X0,X1,X2] : (in(X2,setminus(X0,X1)) | in(X2,X1) | ~in(X2,X0)) | ~setminusI),
% 0.23/0.51 inference(flattening,[],[f19])).
% 0.23/0.51 fof(f21,plain,(
% 0.23/0.51 (((? [X0,X1] : (~subset(X0,X1) & setminus(X0,X1) = emptyset) & setminusI) & subsetI2) & in__Cong) & emptysetE),
% 0.23/0.51 inference(ennf_transformation,[],[f6])).
% 0.23/0.51 fof(f22,plain,(
% 0.23/0.51 ? [X0,X1] : (~subset(X0,X1) & setminus(X0,X1) = emptyset) & setminusI & subsetI2 & in__Cong & emptysetE),
% 0.23/0.51 inference(flattening,[],[f21])).
% 0.23/0.51 fof(f23,plain,(
% 0.23/0.51 ( ! [X0] : (~emptysetE | ~in(X0,emptyset)) )),
% 0.23/0.51 inference(cnf_transformation,[],[f16])).
% 0.23/0.51 fof(f26,plain,(
% 0.23/0.51 ( ! [X0,X1] : (~subsetI2 | in(sK0(X0,X1),X0) | subset(X0,X1)) )),
% 0.23/0.51 inference(cnf_transformation,[],[f18])).
% 0.23/0.51 fof(f27,plain,(
% 0.23/0.51 ( ! [X0,X1] : (~subsetI2 | ~in(sK0(X0,X1),X1) | subset(X0,X1)) )),
% 0.23/0.51 inference(cnf_transformation,[],[f18])).
% 0.23/0.51 fof(f28,plain,(
% 0.23/0.51 ( ! [X2,X0,X1] : (~setminusI | ~in(X2,X0) | in(X2,X1) | in(X2,setminus(X0,X1))) )),
% 0.23/0.51 inference(cnf_transformation,[],[f20])).
% 0.23/0.51 fof(f29,plain,(
% 0.23/0.51 emptyset = setminus(sK1,sK2)),
% 0.23/0.51 inference(cnf_transformation,[],[f22])).
% 0.23/0.51 fof(f30,plain,(
% 0.23/0.51 ~subset(sK1,sK2)),
% 0.23/0.51 inference(cnf_transformation,[],[f22])).
% 0.23/0.51 fof(f31,plain,(
% 0.23/0.51 emptysetE),
% 0.23/0.51 inference(cnf_transformation,[],[f22])).
% 0.23/0.51 fof(f33,plain,(
% 0.23/0.51 subsetI2),
% 0.23/0.51 inference(cnf_transformation,[],[f22])).
% 0.23/0.51 fof(f34,plain,(
% 0.23/0.51 setminusI),
% 0.23/0.51 inference(cnf_transformation,[],[f22])).
% 0.23/0.51 fof(f39,plain,(
% 0.23/0.51 ( ! [X2,X0,X1] : (in(X2,setminus(X0,X1)) | in(X2,X1) | ~in(X2,X0)) )),
% 0.23/0.51 inference(forward_subsumption_resolution,[],[f28,f34])).
% 0.23/0.51 fof(f40,plain,(
% 0.23/0.51 ( ! [X0,X1] : (subset(X0,X1) | in(sK0(X0,X1),X0)) )),
% 0.23/0.51 inference(forward_subsumption_resolution,[],[f26,f33])).
% 0.23/0.51 fof(f41,plain,(
% 0.23/0.51 ( ! [X0,X1] : (subset(X0,X1) | ~in(sK0(X0,X1),X1)) )),
% 0.23/0.51 inference(forward_subsumption_resolution,[],[f27,f33])).
% 0.23/0.51 fof(f42,plain,(
% 0.23/0.51 ( ! [X0] : (~in(X0,emptyset)) )),
% 0.23/0.51 inference(forward_subsumption_resolution,[],[f23,f31])).
% 0.23/0.51 fof(f43,plain,(
% 0.23/0.51 in(sK0(sK1,sK2),sK1)),
% 0.23/0.51 inference(resolution,[],[f40,f30])).
% 0.23/0.51 fof(f44,plain,(
% 0.23/0.51 ~in(sK0(sK1,sK2),sK2)),
% 0.23/0.51 inference(resolution,[],[f41,f30])).
% 0.23/0.51 fof(f45,plain,(
% 0.23/0.51 ( ! [X0] : (in(X0,emptyset) | in(X0,sK2) | ~in(X0,sK1)) )),
% 0.23/0.51 inference(superposition,[],[f39,f29])).
% 0.23/0.51 fof(f46,plain,(
% 0.23/0.51 ( ! [X0] : (in(X0,sK2) | ~in(X0,sK1)) )),
% 0.23/0.51 inference(forward_subsumption_resolution,[],[f45,f42])).
% 0.23/0.51 fof(f47,plain,(
% 0.23/0.51 ~in(sK0(sK1,sK2),sK1)),
% 0.23/0.51 inference(resolution,[],[f46,f44])).
% 0.23/0.51 fof(f48,plain,(
% 0.23/0.51 $false),
% 0.23/0.51 inference(forward_subsumption_resolution,[],[f47,f43])).
% 0.23/0.51 % SZS output end Proof for theBenchmark
% 0.23/0.51 % (66935)------------------------------
% 0.23/0.51 % (66935)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.51 % (66935)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.51 % (66935)CaDiCaL version: 2.1.3
% 0.23/0.51 % (66935)Termination reason: Refutation
% 0.23/0.51 % (66935)Time elapsed: 0.002 s
% 0.23/0.51 % (66935)Peak memory usage: 12 MB
% 0.23/0.51 % (66935)Instructions burned: 1 (million)
% 0.23/0.51 % (66926)Success in time 0.024 s
% 0.23/0.51 % Vampire exiting
%------------------------------------------------------------------------------