%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU531_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 : n014.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:38 PM UTC 2026
% Result : Theorem 0.12s 0.44s
% Output : Refutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU531_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n014.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 28 05:42:16 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40 Running first-order model finding
% 0.12/0.40 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.12/0.44 % (1492191)Will run a generic schedule for satisfiability detection.
% 0.12/0.44 % (1492198)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=463938060:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.12/0.44 % (1492198) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1492191-1492198"...
% 0.12/0.44 % (1492198)...printing done.
% 0.12/0.44 % (1492198)Refutation found. Thanks to Tanya!
% 0.12/0.44 % SZS status Theorem for theBenchmark
% 0.12/0.44 % SZS output start Proof for theBenchmark
% 0.12/0.44 tff(f1,axiom,(
% 0.12/0.44 (setadjoinE = ! [X0 : $i,X1 : $i,X2 : $i] : (in(X2,setadjoin(X0,X1)) => ! [X3 : $o] : ((X2 = X0 => X3) => ((in(X2,X1) => X3) => X3))))),
% 0.12/0.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setadjoinE)).
% 0.12/0.44 tff(f2,axiom,(
% 0.12/0.44 (uniqinunit = ! [X0 : $i,X1 : $i] : (in(X0,setadjoin(X1,emptyset)) => X0 = X1))),
% 0.12/0.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',uniqinunit)).
% 0.12/0.44 tff(f3,conjecture,(
% 0.12/0.44 setadjoinE => (uniqinunit => ! [X0 : $i,X1 : $i,X2 : $i] : (in(X2,setadjoin(X0,setadjoin(X1,emptyset))) => (X2 = X0 | X2 = X1)))),
% 0.12/0.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',upairsetE)).
% 0.12/0.44 tff(f4,negated_conjecture,(
% 0.12/0.44 ~(setadjoinE => (uniqinunit => ! [X0 : $i,X1 : $i,X2 : $i] : (in(X2,setadjoin(X0,setadjoin(X1,emptyset))) => (X2 = X0 | X2 = X1))))),
% 0.12/0.44 inference(negated_conjecture,[status(cth)],[f3])).
% 0.12/0.44 tff(f5,plain,(
% 0.12/0.44 (setadjoinE = ! [X0 : $i,X1 : $i,X2 : $i] : (in(X2,setadjoin(X0,X1)) => ! [X3 : $o] : ((X2 = X0 => X3) => ((in(X2,X1) => X3) => X3))))),
% 0.12/0.44 inference(rectify,[],[f1])).
% 0.12/0.44 tff(f6,plain,(
% 0.12/0.44 setadjoinE <=> ! [X0 : $i,X1 : $i,X2 : $i] : (in(X2,setadjoin(X0,X1)) => ! [X3 : $o] : ((X0 = X2 => ($true = X3)) => ((in(X2,X1) => ($true = X3)) => ($true = X3))))),
% 0.12/0.44 inference(fool_elimination,[],[f5])).
% 0.12/0.44 tff(f7,plain,(
% 0.12/0.44 uniqinunit <=> ! [X0 : $i,X1 : $i] : (in(X0,setadjoin(X1,emptyset)) => X0 = X1)),
% 0.12/0.44 inference(fool_elimination,[],[f2])).
% 0.12/0.44 tff(f8,plain,(
% 0.12/0.44 uniqinunit => ! [X0 : $i,X1 : $i] : (in(X0,setadjoin(X1,emptyset)) => X0 = X1)),
% 0.12/0.44 inference(unused_predicate_definition_removal,[],[f7])).
% 0.12/0.44 tff(f9,plain,(
% 0.12/0.44 setadjoinE => ! [X0 : $i,X1 : $i,X2 : $i] : (in(X2,setadjoin(X0,X1)) => ! [X3 : $o] : ((X0 = X2 => ($true = X3)) => ((in(X2,X1) => ($true = X3)) => ($true = X3))))),
% 0.12/0.44 inference(unused_predicate_definition_removal,[],[f6])).
% 0.12/0.44 tff(f10,plain,(
% 0.12/0.44 ! [X0 : $i,X1 : $i,X2 : $i] : (! [X3 : $o] : ((($true = X3) | (($true != X3) & in(X2,X1))) | (($true != X3) & X0 = X2)) | ~in(X2,setadjoin(X0,X1))) | ~setadjoinE),
% 0.12/0.44 inference(ennf_transformation,[],[f9])).
% 0.12/0.44 tff(f11,plain,(
% 0.12/0.44 ! [X0 : $i,X1 : $i,X2 : $i] : (! [X3 : $o] : (($true = X3) | (($true != X3) & in(X2,X1)) | (($true != X3) & X0 = X2)) | ~in(X2,setadjoin(X0,X1))) | ~setadjoinE),
% 0.12/0.44 inference(flattening,[],[f10])).
% 0.12/0.44 tff(f12,plain,(
% 0.12/0.44 ! [X0 : $i,X1 : $i] : (X0 = X1 | ~in(X0,setadjoin(X1,emptyset))) | ~uniqinunit),
% 0.12/0.44 inference(ennf_transformation,[],[f8])).
% 0.12/0.44 tff(f13,plain,(
% 0.12/0.44 (? [X0 : $i,X1 : $i,X2 : $i] : ((X0 != X2 & X1 != X2) & in(X2,setadjoin(X0,setadjoin(X1,emptyset)))) & uniqinunit) & setadjoinE),
% 0.12/0.44 inference(ennf_transformation,[],[f4])).
% 0.12/0.44 tff(f14,plain,(
% 0.12/0.44 ? [X0 : $i,X1 : $i,X2 : $i] : (X0 != X2 & X1 != X2 & in(X2,setadjoin(X0,setadjoin(X1,emptyset)))) & uniqinunit & setadjoinE),
% 0.12/0.44 inference(flattening,[],[f13])).
% 0.12/0.44 tff(f15,plain,(
% 0.12/0.44 (sK0 != sK2 & sK1 != sK2 & in(sK2,setadjoin(sK0,setadjoin(sK1,emptyset)))) & uniqinunit & setadjoinE),
% 0.12/0.44 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f14])).
% 0.12/0.44 tff(f16,plain,(
% 0.12/0.44 ( ! [X2 : $i,X3 : $o,X0 : $i,X1 : $i] : (($true = X3) | in(X2,X1) | X0 = X2 | ~in(X2,setadjoin(X0,X1)) | ~setadjoinE) )),
% 0.12/0.44 inference(cnf_transformation,[],[f11])).
% 0.12/0.44 tff(f20,plain,(
% 0.12/0.44 ( ! [X0 : $i,X1 : $i] : (X0 = X1 | ~in(X0,setadjoin(X1,emptyset)) | ~uniqinunit) )),
% 0.12/0.44 inference(cnf_transformation,[],[f12])).
% 0.12/0.44 tff(f21,plain,(
% 0.12/0.44 setadjoinE),
% 0.12/0.44 inference(cnf_transformation,[],[f15])).
% 0.12/0.44 tff(f22,plain,(
% 0.12/0.44 uniqinunit),
% 0.12/0.44 inference(cnf_transformation,[],[f15])).
% 0.12/0.44 tff(f23,plain,(
% 0.12/0.44 in(sK2,setadjoin(sK0,setadjoin(sK1,emptyset)))),
% 0.12/0.44 inference(cnf_transformation,[],[f15])).
% 0.12/0.44 tff(f24,plain,(
% 0.12/0.44 sK1 != sK2),
% 0.12/0.44 inference(cnf_transformation,[],[f15])).
% 0.12/0.44 tff(f25,plain,(
% 0.12/0.44 sK0 != sK2),
% 0.12/0.44 inference(cnf_transformation,[],[f15])).
% 0.12/0.44 tff(f26,definition,(
% 0.12/0.44 ($true != $false)),
% 0.12/0.44 introduced(theory,[fool_distinctness_axiom])).
% 0.12/0.44 tff(f31,plain,(
% 0.12/0.44 ( ! [X0 : $i,X1 : $i] : (~in(X0,setadjoin(X1,emptyset)) | X0 = X1) )),
% 0.12/0.44 inference(global_subsumption,[],[f20,f22])).
% 0.12/0.44 tff(f32,plain,(
% 0.12/0.44 ( ! [X2 : $i,X3 : $o,X0 : $i,X1 : $i] : (($true = X3) | in(X2,X1) | X0 = X2 | ~in(X2,setadjoin(X0,X1))) )),
% 0.12/0.44 inference(global_subsumption,[],[f16,f21])).
% 0.12/0.44 tff(f72,definition,(
% 0.12/0.44 spl3_3 <=> ! [X0 : $o] : ($true = X0)),
% 0.12/0.44 introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition])).
% 0.12/0.44 tff(f73,plain,(
% 0.12/0.44 ( ! [X0 : $o] : (($true = X0)) ) | ~spl3_3),
% 0.12/0.44 inference(avatar_component_clause,[],[f72])).
% 0.12/0.44 tff(f87,definition,(
% 0.12/0.44 spl3_7 <=> ! [X2 : $i,X0 : $i,X1 : $i] : (in(X2,X1) | ~in(X2,setadjoin(X0,X1)) | X0 = X2)),
% 0.12/0.44 introduced(definition,[new_symbols(definition,[spl3_7])],[avatar_definition])).
% 0.12/0.44 tff(f88,plain,(
% 0.12/0.44 ( ! [X2 : $i,X0 : $i,X1 : $i] : (~in(X2,setadjoin(X0,X1)) | in(X2,X1) | X0 = X2) ) | ~spl3_7),
% 0.12/0.44 inference(avatar_component_clause,[],[f87])).
% 0.12/0.44 tff(f89,plain,(
% 0.12/0.44 spl3_7 | spl3_3),
% 0.12/0.44 inference(avatar_split_clause,[],[f32,f72,f87])).
% 0.12/0.44 tff(f95,plain,(
% 0.12/0.44 ( ! [X0 : $o] : (($false != X0)) ) | ~spl3_3),
% 0.12/0.44 inference(superposition,[],[f26,f73])).
% 0.12/0.44 tff(f98,plain,(
% 0.12/0.44 $false | ~spl3_3),
% 0.12/0.44 inference(equality_resolution,[],[f95])).
% 0.12/0.44 tff(f99,plain,(
% 0.12/0.44 ~spl3_3),
% 0.12/0.44 inference(avatar_contradiction_clause,[],[f98])).
% 0.12/0.44 tff(f103,plain,(
% 0.12/0.44 in(sK2,setadjoin(sK1,emptyset)) | sK0 = sK2 | ~spl3_7),
% 0.12/0.44 inference(resolution,[],[f88,f23])).
% 0.12/0.44 tff(f107,plain,(
% 0.12/0.44 in(sK2,setadjoin(sK1,emptyset)) | ~spl3_7),
% 0.12/0.44 inference(forward_subsumption_resolution,[],[f103,f25])).
% 0.12/0.44 tff(f108,plain,(
% 0.12/0.44 sK1 = sK2 | ~spl3_7),
% 0.12/0.44 inference(resolution,[],[f107,f31])).
% 0.12/0.44 tff(f111,plain,(
% 0.12/0.44 $false | ~spl3_7),
% 0.12/0.44 inference(forward_subsumption_resolution,[],[f108,f24])).
% 0.12/0.44 tff(f112,plain,(
% 0.12/0.44 ~spl3_7),
% 0.12/0.44 inference(avatar_contradiction_clause,[],[f111])).
% 0.12/0.44 cnf(s48, plain, spl3_3 | spl3_7, inference(sat_conversion,[],[f89])).
% 0.12/0.44 cnf(s61, plain, ~spl3_3, inference(sat_conversion,[],[f99])).
% 0.12/0.44 cnf(s70, plain, ~spl3_7, inference(sat_conversion,[],[f112])).
% 0.12/0.44 cnf(s72, plain, $false, inference(rat,[],[s48,s70,s61])).
% 0.12/0.44 tff(f113,plain,(
% 0.12/0.44 $false),
% 0.12/0.44 inference(avatar_sat_refutation,[],[s72])).
% 0.12/0.44 % SZS output end Proof for theBenchmark
% 0.12/0.44 % (1492198)------------------------------
% 0.12/0.44 % (1492198)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.44 % (1492198)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.44 % (1492198)CaDiCaL version: 2.1.3
% 0.12/0.44 % (1492198)Termination reason: Refutation
% 0.12/0.44 % (1492198)Time elapsed: 0.002 s
% 0.12/0.44 % (1492198)Peak memory usage: 12 MB
% 0.12/0.44 % (1492198)Instructions burned: 3 (million)
% 0.12/0.44 % (1492191)Success in time 0.028 s
% 0.12/0.44 % Vampire exiting
%------------------------------------------------------------------------------