%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU527^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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 : Wed Sep 30 08:29:56 AM UTC 2026
% Result : Theorem 0.34s 0.44s
% Output : Refutation 0.34s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU527^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.09 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.30 % Computer : n008.cluster.edu
% 0.24/0.30 % Model : x86_64 x86_64
% 0.24/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.24/0.30 % Memory : 8046.5625MB
% 0.24/0.30 % OS : Linux 6.8.0-71-generic
% 0.24/0.30 % CPULimit : 300
% 0.24/0.30 % WCLimit : 300
% 0.24/0.30 % DateTime : Tue Sep 29 13:48:54 UTC 2026
% 0.24/0.30 % CPUTime :
% 0.24/0.30 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.36 Running higher-order theorem proving
% 0.24/0.37 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.34/0.44 % (3179822)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.34/0.44 % (3179830)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=3075805438:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.34/0.44 % (3179830)Refutation not found, incomplete strategy
% 0.34/0.44 % (3179830)------------------------------
% 0.34/0.44 % (3179830)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.34/0.44 % (3179830)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.34/0.44 % (3179830)CaDiCaL version: 2.1.3
% 0.34/0.44 % (3179830)Termination reason: Refutation not found, incomplete strategy
% 0.34/0.44 % (3179830)Time elapsed: 0.002 s
% 0.34/0.44 % (3179830)Peak memory usage: 12 MB
% 0.34/0.44 % (3179830)Instructions burned: 2 (million)
% 0.34/0.44 % (3179830)------------------------------
% 0.34/0.44 % (3179830)------------------------------
% 0.34/0.44 % (3179833)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.34/0.44 % (3179833)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.34/0.44 % (3179831)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3524553369:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.34/0.44 % (3179828)lrs+10_16_si=on:nwc=1.5:random_seed=382466354:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.34/0.44 % (3179827)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=309606786:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.34/0.44 % (3179829)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=831965391:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.34/0.44 % (3179832)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2739274817:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.34/0.44 % (3179833)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=612839325:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.34/0.44 % (3179829)Refutation not found, incomplete strategy
% 0.34/0.44 % (3179829)------------------------------
% 0.34/0.44 % (3179829)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.34/0.44 % (3179829)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.34/0.44 % (3179829)CaDiCaL version: 2.1.3
% 0.34/0.44 % (3179829)Termination reason: Refutation not found, incomplete strategy
% 0.34/0.44 % (3179829)Time elapsed: 0.003 s
% 0.34/0.44 % (3179829)Peak memory usage: 12 MB
% 0.34/0.44 % (3179829)Instructions burned: 1 (million)
% 0.34/0.44 % (3179831) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3179822-3179831"...
% 0.34/0.44 % (3179828)Refutation not found, incomplete strategy
% 0.34/0.44 % (3179828)------------------------------
% 0.34/0.44 % (3179828)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.34/0.44 % (3179827)Refutation not found, incomplete strategy
% 0.34/0.44 % (3179827)------------------------------
% 0.34/0.44 % (3179827)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.34/0.44 % (3179828)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.34/0.44 % (3179828)CaDiCaL version: 2.1.3
% 0.34/0.44 % (3179827)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.34/0.44 % (3179828)Termination reason: Refutation not found, incomplete strategy
% 0.34/0.44 % (3179828)Time elapsed: 0.004 s
% 0.34/0.44 % (3179828)Peak memory usage: 12 MB
% 0.34/0.44 % (3179827)CaDiCaL version: 2.1.3
% 0.34/0.44 % (3179828)Instructions burned: 3 (million)
% 0.34/0.44 % (3179827)Termination reason: Refutation not found, incomplete strategy
% 0.34/0.44 % (3179827)Time elapsed: 0.003 s
% 0.34/0.44 % (3179827)Peak memory usage: 12 MB
% 0.34/0.44 % (3179827)Instructions burned: 2 (million)
% 0.34/0.44 % (3179829)------------------------------
% 0.34/0.44 % (3179829)------------------------------
% 0.34/0.44 % (3179828)------------------------------
% 0.34/0.44 % (3179828)------------------------------
% 0.34/0.44 % (3179827)------------------------------
% 0.34/0.44 % (3179827)------------------------------
% 0.34/0.44 % (3179832) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3179822-3179832"...
% 0.34/0.44 % (3179831)...printing done.
% 0.34/0.44 % (3179831)Refutation found. Thanks to Tanya!
% 0.34/0.44 % SZS status Theorem for theBenchmark
% 0.34/0.44 % SZS output start Proof for theBenchmark
% 0.34/0.44 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.34/0.44 thf(func_def_0, type, in: ($i > $i > $o)).
% 0.34/0.44 thf(func_def_2, type, setadjoin: ($i > $i > $i)).
% 0.34/0.44 thf(func_def_3, type, emptysetE: $o).
% 0.34/0.44 thf(func_def_5, type, setadjoinE: $o).
% 0.34/0.44 thf(func_def_9, type, sK1: $o).
% 0.34/0.44 thf(func_def_13, type, sK5: $o).
% 0.34/0.44 thf(func_def_16, type, vNOT: ($o > $o)).
% 0.34/0.44 thf(f1,axiom,(
% 0.34/0.44 (emptysetE = ! [X0 : $i] : ((in @ X0 @ emptyset) => ! [X1 : $o] : X1))),
% 0.34/0.44 file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptysetE)).
% 0.34/0.44 thf(f2,axiom,(
% 0.34/0.44 (setadjoinE = ! [X1 : $i,X0 : $i,X2 : $i] : ((in @ X2 @ (setadjoin @ X0 @ X1)) => ! [X3 : $o] : (((X2 = X0) => X3) => (((in @ X2 @ X1) => X3) => X3))))),
% 0.34/0.44 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinE)).
% 0.34/0.44 thf(f3,conjecture,(
% 0.34/0.44 emptysetE => (setadjoinE => ! [X1 : $i,X0 : $i] : ((in @ X0 @ (setadjoin @ X1 @ emptyset)) => (X0 = X1)))),
% 0.34/0.44 file('/export/starexec/sandbox/benchmark/theBenchmark.p',uniqinunit)).
% 0.34/0.44 thf(f4,negated_conjecture,(
% 0.34/0.44 ~(emptysetE => (setadjoinE => ! [X1 : $i,X0 : $i] : ((in @ X0 @ (setadjoin @ X1 @ emptyset)) => (X0 = X1))))),
% 0.34/0.44 inference(negated_conjecture,[status(cth)],[f3])).
% 0.34/0.44 thf(f5,plain,(
% 0.34/0.44 (emptysetE = ! [X0 : $i] : ((in @ X0 @ emptyset) => ! [X1 : $o] : X1))),
% 0.34/0.44 inference(rectify,[],[f1])).
% 0.34/0.44 thf(f6,plain,(
% 0.34/0.44 (emptysetE = $true) <=> ! [X0 : $i] : ((((in @ X0 @ emptyset)) = $true) => ! [X1 : $o] : ($true = X1))),
% 0.34/0.44 inference(fool_elimination,[],[f5])).
% 0.34/0.44 thf(f7,plain,(
% 0.34/0.44 (setadjoinE = ! [X0 : $i,X1 : $i,X2 : $i] : ((in @ X2 @ (setadjoin @ X1 @ X0)) => ! [X3 : $o] : (((X1 = X2) => X3) => (((in @ X2 @ X0) => X3) => X3))))),
% 0.34/0.44 inference(rectify,[],[f2])).
% 0.34/0.44 thf(f8,plain,(
% 0.34/0.44 ! [X1 : $i,X2 : $i,X0 : $i] : ((((in @ X2 @ (setadjoin @ X1 @ X0))) = $true) => ! [X3 : $o] : (((X1 = X2) => ($true = X3)) => ((($true = ((in @ X2 @ X0))) => ($true = X3)) => ($true = X3)))) <=> (setadjoinE = $true)),
% 0.34/0.44 inference(fool_elimination,[],[f7])).
% 0.34/0.44 thf(f9,plain,(
% 0.34/0.44 ~(emptysetE => (setadjoinE => ! [X0 : $i,X1 : $i] : ((in @ X1 @ (setadjoin @ X0 @ emptyset)) => (X0 = X1))))),
% 0.34/0.44 inference(rectify,[],[f4])).
% 0.34/0.44 thf(f10,plain,(
% 0.34/0.44 ~((emptysetE = $true) => ((setadjoinE = $true) => ! [X0 : $i,X1 : $i] : (($true = ((in @ X1 @ (setadjoin @ X0 @ emptyset)))) => (X0 = X1))))),
% 0.34/0.44 inference(fool_elimination,[],[f9])).
% 0.34/0.44 thf(f11,plain,(
% 0.34/0.44 (emptysetE = $true) <=> ! [X0 : $i] : ((((in @ X0 @ emptyset)) != $true) | ! [X1 : $o] : ($true = X1))),
% 0.34/0.44 inference(ennf_transformation,[],[f6])).
% 0.34/0.44 thf(f12,plain,(
% 0.34/0.44 (? [X1 : $i,X0 : $i] : (($true = ((in @ X1 @ (setadjoin @ X0 @ emptyset)))) & (X0 != X1)) & (setadjoinE = $true)) & (emptysetE = $true)),
% 0.34/0.44 inference(ennf_transformation,[],[f10])).
% 0.34/0.44 thf(f13,plain,(
% 0.34/0.44 ? [X1 : $i,X0 : $i] : (($true = ((in @ X1 @ (setadjoin @ X0 @ emptyset)))) & (X0 != X1)) & (setadjoinE = $true) & (emptysetE = $true)),
% 0.34/0.44 inference(flattening,[],[f12])).
% 0.34/0.44 thf(f14,plain,(
% 0.34/0.44 ! [X1 : $i,X2 : $i,X0 : $i] : (! [X3 : $o] : ((($true = X3) | (($true != X3) & ($true = ((in @ X2 @ X0))))) | ((X1 = X2) & ($true != X3))) | (((in @ X2 @ (setadjoin @ X1 @ X0))) != $true)) <=> (setadjoinE = $true)),
% 0.34/0.44 inference(ennf_transformation,[],[f8])).
% 0.34/0.44 thf(f15,plain,(
% 0.34/0.44 ! [X0 : $i,X2 : $i,X1 : $i] : ((((in @ X2 @ (setadjoin @ X1 @ X0))) != $true) | ! [X3 : $o] : ((($true != X3) & ($true = ((in @ X2 @ X0)))) | ((X1 = X2) & ($true != X3)) | ($true = X3))) <=> (setadjoinE = $true)),
% 0.34/0.44 inference(flattening,[],[f14])).
% 0.34/0.44 thf(f16,plain,(
% 0.34/0.44 ((emptysetE = $true) | ? [X0 : $i] : ((((in @ X0 @ emptyset)) = $true) & ? [X1 : $o] : ($true != X1))) & (! [X0 : $i] : ((((in @ X0 @ emptyset)) != $true) | ! [X1 : $o] : ($true = X1)) | (emptysetE != $true))),
% 0.34/0.44 inference(nnf_transformation,[],[f11])).
% 0.34/0.44 thf(f17,plain,(
% 0.34/0.44 ((emptysetE = $true) | ? [X0 : $i] : ((((in @ X0 @ emptyset)) = $true) & ? [X1 : $o] : ($true != X1))) & (! [X2 : $i] : (($true != ((in @ X2 @ emptyset))) | ! [X3 : $o] : ($true = X3)) | (emptysetE != $true))),
% 0.34/0.44 inference(rectify,[],[f16])).
% 0.34/0.44 thf(f18,plain,(
% 0.34/0.44 ((emptysetE = $true) | (($true = ((in @ sK0 @ emptyset))) & (sK1 != $true))) & (! [X2 : $i] : (($true != ((in @ X2 @ emptyset))) | ! [X3 : $o] : ($true = X3)) | (emptysetE != $true))),
% 0.34/0.44 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f17])).
% 0.34/0.44 thf(f19,plain,(
% 0.34/0.44 (! [X0 : $i,X2 : $i,X1 : $i] : ((((in @ X2 @ (setadjoin @ X1 @ X0))) != $true) | ! [X3 : $o] : ((($true != X3) & ($true = ((in @ X2 @ X0)))) | ((X1 = X2) & ($true != X3)) | ($true = X3))) | (setadjoinE != $true)) & ((setadjoinE = $true) | ? [X0 : $i,X2 : $i,X1 : $i] : ((((in @ X2 @ (setadjoin @ X1 @ X0))) = $true) & ? [X3 : $o] : ((($true = X3) | ($true != ((in @ X2 @ X0)))) & ((X1 != X2) | ($true = X3)) & ($true != X3))))),
% 0.34/0.44 inference(nnf_transformation,[],[f15])).
% 0.34/0.44 thf(f20,plain,(
% 0.34/0.44 (! [X0 : $i,X1 : $i,X2 : $i] : (($true != ((in @ X1 @ (setadjoin @ X2 @ X0)))) | ! [X3 : $o] : ((($true != X3) & ($true = ((in @ X1 @ X0)))) | ((X1 = X2) & ($true != X3)) | ($true = X3))) | (setadjoinE != $true)) & ((setadjoinE = $true) | ? [X4 : $i,X5 : $i,X6 : $i] : (($true = ((in @ X5 @ (setadjoin @ X6 @ X4)))) & ? [X7 : $o] : ((($true = X7) | ($true != ((in @ X5 @ X4)))) & ((X5 != X6) | ($true = X7)) & ($true != X7))))),
% 0.34/0.44 inference(rectify,[],[f19])).
% 0.34/0.44 thf(f21,plain,(
% 0.34/0.44 (! [X0 : $i,X1 : $i,X2 : $i] : (($true != ((in @ X1 @ (setadjoin @ X2 @ X0)))) | ! [X3 : $o] : ((($true != X3) & ($true = ((in @ X1 @ X0)))) | ((X1 = X2) & ($true != X3)) | ($true = X3))) | (setadjoinE != $true)) & ((setadjoinE = $true) | (($true = ((in @ sK3 @ (setadjoin @ sK4 @ sK2)))) & ((($true = sK5) | (((in @ sK3 @ sK2)) != $true)) & ((sK3 != sK4) | ($true = sK5)) & ($true != sK5))))),
% 0.34/0.44 inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5]),skolemize(X4,sK2),skolemize(X5,sK3),skolemize(X6,sK4),skolemize(X7,sK5)],[f20])).
% 0.34/0.44 thf(f22,plain,(
% 0.34/0.44 ? [X0 : $i,X1 : $i] : ((((in @ X0 @ (setadjoin @ X1 @ emptyset))) = $true) & (X0 != X1)) & (setadjoinE = $true) & (emptysetE = $true)),
% 0.34/0.44 inference(rectify,[],[f13])).
% 0.34/0.44 thf(f23,plain,(
% 0.34/0.44 (($true = ((in @ sK6 @ (setadjoin @ sK7 @ emptyset)))) & (sK7 != sK6)) & (setadjoinE = $true) & (emptysetE = $true)),
% 0.34/0.44 inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X0,sK6),skolemize(X1,sK7)],[f22])).
% 0.34/0.44 thf(f24,plain,(
% 0.34/0.44 ( ! [X2 : $i,X3 : $o] : ((emptysetE != $true) | ($true != ((in @ X2 @ emptyset))) | ($true = X3)) )),
% 0.34/0.44 inference(cnf_transformation,[],[f18])).
% 0.34/0.44 thf(f32,plain,(
% 0.34/0.44 ( ! [X2 : $i,X3 : $o,X0 : $i,X1 : $i] : (($true = X3) | (setadjoinE != $true) | ($true != ((in @ X1 @ (setadjoin @ X2 @ X0)))) | (X1 = X2) | ($true = ((in @ X1 @ X0)))) )),
% 0.34/0.44 inference(cnf_transformation,[],[f21])).
% 0.34/0.44 thf(f35,plain,(
% 0.34/0.44 (emptysetE = $true)),
% 0.34/0.44 inference(cnf_transformation,[],[f23])).
% 0.34/0.44 thf(f36,plain,(
% 0.34/0.44 (setadjoinE = $true)),
% 0.34/0.44 inference(cnf_transformation,[],[f23])).
% 0.34/0.44 thf(f37,plain,(
% 0.34/0.44 (sK7 != sK6)),
% 0.34/0.44 inference(cnf_transformation,[],[f23])).
% 0.34/0.44 thf(f38,plain,(
% 0.34/0.44 ($true = ((in @ sK6 @ (setadjoin @ sK7 @ emptyset))))),
% 0.34/0.44 inference(cnf_transformation,[],[f23])).
% 0.34/0.44 thf(f39,definition,(
% 0.34/0.44 ($false != $true)),
% 0.34/0.44 introduced(theory,[fool_distinctness_axiom])).
% 0.34/0.44 thf(f45,plain,(
% 0.34/0.44 ( ! [X2 : $i,X3 : $o] : (($true != ((in @ X2 @ emptyset))) | ($true = X3)) )),
% 0.34/0.44 inference(forward_subsumption_resolution,[],[f24,f35])).
% 0.34/0.44 thf(f46,plain,(
% 0.34/0.44 ( ! [X2 : $i,X3 : $o,X0 : $i,X1 : $i] : (($true != ((in @ X1 @ (setadjoin @ X2 @ X0)))) | (X1 = X2) | ($true = ((in @ X1 @ X0))) | ($true = X3)) )),
% 0.34/0.44 inference(forward_subsumption_resolution,[],[f32,f36])).
% 0.34/0.44 thf(f47,plain,(
% 0.34/0.44 ( ! [X0 : $o] : (($true = X0) | ($true != $true) | (sK7 = sK6) | ($true = ((in @ sK6 @ emptyset)))) )),
% 0.34/0.44 inference(superposition,[],[f46,f38])).
% 0.34/0.44 thf(f48,plain,(
% 0.34/0.44 ( ! [X0 : $o] : ((sK7 = sK6) | ($true = X0) | ($true = ((in @ sK6 @ emptyset)))) )),
% 0.34/0.44 inference(trivial_inequality_removal,[],[f47])).
% 0.34/0.44 thf(f49,plain,(
% 0.34/0.44 ( ! [X0 : $o] : ((sK7 = sK6) | ($true = X0)) )),
% 0.34/0.44 inference(forward_subsumption_resolution,[],[f48,f45])).
% 0.34/0.44 thf(f50,plain,(
% 0.34/0.44 ( ! [X0 : $o] : (($true = X0)) )),
% 0.34/0.44 inference(forward_subsumption_resolution,[],[f49,f37])).
% 0.34/0.44 thf(f52,plain,(
% 0.34/0.44 ( ! [X0 : $o] : (($false != X0)) )),
% 0.34/0.44 inference(superposition,[],[f39,f50])).
% 0.34/0.44 thf(f60,plain,(
% 0.34/0.44 $false),
% 0.34/0.44 inference(equality_resolution,[],[f52])).
% 0.34/0.44 % SZS output end Proof for theBenchmark
% 0.34/0.44 % (3179831)------------------------------
% 0.34/0.44 % (3179831)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.34/0.44 % (3179831)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.34/0.44 % (3179831)CaDiCaL version: 2.1.3
% 0.34/0.44 % (3179831)Termination reason: Refutation
% 0.34/0.44 % (3179831)Time elapsed: 0.006 s
% 0.34/0.44 % (3179831)Peak memory usage: 12 MB
% 0.34/0.44 % (3179831)Instructions burned: 4 (million)
% 0.34/0.44 % (3179822)Success in time 0.053 s
% 0.34/0.44 % Vampire exiting
%------------------------------------------------------------------------------