%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU515_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 : n006.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:33 PM UTC 2026
% Result : Theorem 0.11s 0.44s
% Output : Refutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU515_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.11/0.37 % Computer : n006.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 05:41:25 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 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.11/0.44 % (3671651)Will run a generic schedule for satisfiability detection.
% 0.11/0.44 % (3671669)% WARNING: option uhcvi not known.
% 0.11/0.44 % (3671669)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1064239193:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.44 % (3671669) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3671651-3671669"...
% 0.11/0.44 % (3671669)...printing done.
% 0.11/0.44 % (3671669)Refutation found. Thanks to Tanya!
% 0.11/0.44 % SZS status Theorem for theBenchmark
% 0.11/0.44 % SZS output start Proof for theBenchmark
% 0.11/0.44 fof(f1,axiom,(
% 0.11/0.44 (setadjoinAx = ! [X0,X1,X2] : (in(X2,setadjoin(X0,X1)) <=> (X2 = X0 | in(X2,X1))))),
% 0.11/0.44 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinAx)).
% 0.11/0.44 fof(f2,conjecture,(
% 0.11/0.44 setadjoinAx => ! [X0,X1,X2] : (in(X2,setadjoin(X0,X1)) => ! [X3 : $o] : ((X2 = X0 => X3) => ((in(X2,X1) => X3) => X3)))),
% 0.11/0.44 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinE)).
% 0.11/0.44 fof(f3,negated_conjecture,(
% 0.11/0.44 ~(setadjoinAx => ! [X0,X1,X2] : (in(X2,setadjoin(X0,X1)) => ! [X3 : $o] : ((X2 = X0 => X3) => ((in(X2,X1) => X3) => X3))))),
% 0.11/0.44 inference(negated_conjecture,[status(cth)],[f2])).
% 0.11/0.44 fof(f4,plain,(
% 0.11/0.44 setadjoinAx <=> ! [X0,X1,X2] : (in(X2,setadjoin(X0,X1)) <=> (X2 = X0 | in(X2,X1)))),
% 0.11/0.44 inference(flattening,[],[f1])).
% 0.11/0.44 fof(f5,plain,(
% 0.11/0.44 ~(setadjoinAx => ! [X0,X1,X2] : (in(X2,setadjoin(X0,X1)) => ! [X3 : $o] : ((X2 = X0 => X3) => ((in(X2,X1) => X3) => X3))))),
% 0.11/0.44 inference(rectify,[],[f3])).
% 0.11/0.44 fof(f6,plain,(
% 0.11/0.44 setadjoinAx => ! [X0,X1,X2] : (in(X2,setadjoin(X0,X1)) <=> (X2 = X0 | in(X2,X1)))),
% 0.11/0.44 inference(unused_predicate_definition_removal,[],[f4])).
% 0.11/0.44 fof(f7,plain,(
% 0.11/0.44 ! [X0,X1,X2] : (in(X2,setadjoin(X0,X1)) <=> (X2 = X0 | in(X2,X1))) | ~setadjoinAx),
% 0.11/0.44 inference(ennf_transformation,[],[f6])).
% 0.11/0.44 fof(f8,plain,(
% 0.11/0.44 ? [X0,X1,X2] : (? [X3 : $o] : ((~X3 & (X3 | ~in(X2,X1))) & (X3 | X0 != X2)) & in(X2,setadjoin(X0,X1))) & setadjoinAx),
% 0.11/0.44 inference(ennf_transformation,[],[f5])).
% 0.11/0.44 fof(f9,plain,(
% 0.11/0.44 ? [X0,X1,X2] : (? [X3 : $o] : (~X3 & (X3 | ~in(X2,X1)) & (X3 | X0 != X2)) & in(X2,setadjoin(X0,X1))) & setadjoinAx),
% 0.11/0.44 inference(flattening,[],[f8])).
% 0.11/0.44 fof(f10,plain,(
% 0.11/0.44 ( ! [X2,X0,X1] : (~setadjoinAx | in(X2,X1) | X0 = X2 | ~in(X2,setadjoin(X0,X1))) )),
% 0.11/0.44 inference(cnf_transformation,[],[f7])).
% 0.11/0.44 fof(f13,plain,(
% 0.11/0.44 sK3 | ~in(sK2,sK1)),
% 0.11/0.44 inference(cnf_transformation,[],[f9])).
% 0.11/0.44 fof(f14,plain,(
% 0.11/0.44 sK3 | sK0 != sK2),
% 0.11/0.44 inference(cnf_transformation,[],[f9])).
% 0.11/0.44 fof(f15,plain,(
% 0.11/0.44 ~sK3),
% 0.11/0.44 inference(cnf_transformation,[],[f9])).
% 0.11/0.44 fof(f16,plain,(
% 0.11/0.44 in(sK2,setadjoin(sK0,sK1))),
% 0.11/0.44 inference(cnf_transformation,[],[f9])).
% 0.11/0.44 fof(f17,plain,(
% 0.11/0.44 setadjoinAx),
% 0.11/0.44 inference(cnf_transformation,[],[f9])).
% 0.11/0.44 fof(f21,plain,(
% 0.11/0.44 ( ! [X2,X0,X1] : (setadjoinAx | ~in(X2,X1) | X0 = X2 | in(X2,setadjoin(X0,X1))) )),
% 0.11/0.44 inference(consistent_polarity_flipping,[],[f10])).
% 0.11/0.44 fof(f22,plain,(
% 0.11/0.44 ~setadjoinAx),
% 0.11/0.44 inference(consistent_polarity_flipping,[],[f17])).
% 0.11/0.44 fof(f23,plain,(
% 0.11/0.44 ~in(sK2,setadjoin(sK0,sK1))),
% 0.11/0.44 inference(consistent_polarity_flipping,[],[f16])).
% 0.11/0.44 fof(f24,plain,(
% 0.11/0.44 sK3 | in(sK2,sK1)),
% 0.11/0.44 inference(consistent_polarity_flipping,[],[f13])).
% 0.11/0.44 fof(f26,definition,(
% 0.11/0.44 spl4_1 <=> in(sK2,sK1)),
% 0.11/0.44 introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition])).
% 0.11/0.44 fof(f28,plain,(
% 0.11/0.44 in(sK2,sK1) | ~spl4_1),
% 0.11/0.44 inference(avatar_component_clause,[],[f26])).
% 0.11/0.44 fof(f30,definition,(
% 0.11/0.44 spl4_2 <=> sK3),
% 0.11/0.44 introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition])).
% 0.11/0.44 fof(f33,plain,(
% 0.11/0.44 spl4_1 | spl4_2),
% 0.11/0.44 inference(avatar_split_clause,[],[f24,f30,f26])).
% 0.11/0.44 fof(f35,definition,(
% 0.11/0.44 spl4_3 <=> sK0 = sK2),
% 0.11/0.44 introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition])).
% 0.11/0.44 fof(f37,plain,(
% 0.11/0.44 sK0 != sK2 | spl4_3),
% 0.11/0.44 inference(avatar_component_clause,[],[f35])).
% 0.11/0.44 fof(f38,plain,(
% 0.11/0.44 ~spl4_3 | spl4_2),
% 0.11/0.44 inference(avatar_split_clause,[],[f14,f30,f35])).
% 0.11/0.44 fof(f39,plain,(
% 0.11/0.44 ~spl4_2),
% 0.11/0.44 inference(avatar_split_clause,[],[f15,f30])).
% 0.11/0.44 fof(f41,definition,(
% 0.11/0.44 spl4_4 <=> ! [X2,X0,X1] : (~in(X2,X1) | in(X2,setadjoin(X0,X1)) | X0 = X2)),
% 0.11/0.44 introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition])).
% 0.11/0.44 fof(f42,plain,(
% 0.11/0.44 ( ! [X2,X0,X1] : (in(X2,setadjoin(X0,X1)) | ~in(X2,X1) | X0 = X2) ) | ~spl4_4),
% 0.11/0.44 inference(avatar_component_clause,[],[f41])).
% 0.11/0.44 fof(f44,definition,(
% 0.11/0.44 spl4_5 <=> setadjoinAx),
% 0.11/0.44 introduced(definition,[new_symbols(definition,[spl4_5])],[avatar_definition])).
% 0.11/0.44 fof(f47,plain,(
% 0.11/0.44 spl4_4 | spl4_5),
% 0.11/0.44 inference(avatar_split_clause,[],[f21,f44,f41])).
% 0.11/0.44 fof(f56,plain,(
% 0.11/0.44 ~spl4_5),
% 0.11/0.44 inference(avatar_split_clause,[],[f22,f44])).
% 0.11/0.44 fof(f57,plain,(
% 0.11/0.44 ~in(sK2,sK1) | sK0 = sK2 | ~spl4_4),
% 0.11/0.44 inference(resolution,[],[f42,f23])).
% 0.11/0.44 fof(f60,plain,(
% 0.11/0.44 sK0 = sK2 | (~spl4_1 | ~spl4_4)),
% 0.11/0.44 inference(forward_subsumption_resolution,[],[f57,f28])).
% 0.11/0.44 fof(f61,plain,(
% 0.11/0.44 $false | (~spl4_1 | spl4_3 | ~spl4_4)),
% 0.11/0.44 inference(forward_subsumption_resolution,[],[f60,f37])).
% 0.11/0.44 fof(f62,plain,(
% 0.11/0.44 ~spl4_1 | spl4_3 | ~spl4_4),
% 0.11/0.44 inference(avatar_contradiction_clause,[],[f61])).
% 0.11/0.44 cnf(s1, plain, spl4_1 | spl4_2, inference(sat_conversion,[],[f33])).
% 0.11/0.44 cnf(s2, plain, spl4_2 | ~spl4_3, inference(sat_conversion,[],[f38])).
% 0.11/0.44 cnf(s3, plain, ~spl4_2, inference(sat_conversion,[],[f39])).
% 0.11/0.44 cnf(s4, plain, spl4_4 | spl4_5, inference(sat_conversion,[],[f47])).
% 0.11/0.44 cnf(s7, plain, ~spl4_5, inference(sat_conversion,[],[f56])).
% 0.11/0.44 cnf(s8, plain, ~spl4_1 | spl4_3 | ~spl4_4, inference(sat_conversion,[],[f62])).
% 0.11/0.44 cnf(s11, plain, spl4_4, inference(rat,[],[s4,s7])).
% 0.11/0.44 cnf(s12, plain, ~spl4_3, inference(rat,[],[s2,s3])).
% 0.11/0.44 cnf(s13, plain, ~spl4_1, inference(rat,[],[s8,s11,s12])).
% 0.11/0.44 cnf(s14, plain, $false, inference(rat,[],[s1,s3,s13])).
% 0.11/0.44 fof(f63,plain,(
% 0.11/0.44 $false),
% 0.11/0.44 inference(avatar_sat_refutation,[],[s14])).
% 0.11/0.44 % SZS output end Proof for theBenchmark
% 0.11/0.44 % (3671669)------------------------------
% 0.11/0.44 % (3671669)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.44 % (3671669)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.44 % (3671669)CaDiCaL version: 2.1.3
% 0.11/0.44 % (3671669)Termination reason: Refutation
% 0.11/0.44 % (3671669)Time elapsed: 0.001 s
% 0.11/0.44 % (3671669)Peak memory usage: 12 MB
% 0.11/0.44 % (3671669)Instructions burned: 1 (million)
% 0.11/0.44 % (3671651)Success in time 0.027 s
% 0.11/0.44 % Vampire exiting
%------------------------------------------------------------------------------