%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUN023^1 : TPTP v9.3.1. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n012.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:20:01 AM UTC 2026
% Result : Theorem 0.08s 0.18s
% Output : Refutation 0.08s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUN023^1 : TPTP v9.3.1. Released v6.4.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.00/0.12 % Computer : n012.cluster.edu
% 0.00/0.12 % Model : x86_64 x86_64
% 0.00/0.12 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.12 % Memory : 8046.5625MB
% 0.00/0.12 % OS : Linux 6.8.0-71-generic
% 0.00/0.12 % CPULimit : 300
% 0.00/0.12 % WCLimit : 300
% 0.00/0.12 % DateTime : Tue Sep 29 13:05:49 UTC 2026
% 0.08/0.13 % CPUTime :
% 0.08/0.13 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.14 Running first-order model finding
% 0.08/0.14 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.08/0.18 % (75092)Will run a generic schedule for satisfiability detection.
% 0.08/0.18 % (75098)% WARNING: option uhcvi not known.
% 0.08/0.18 % (75099)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=436428548:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.18 % (75097)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3755187485_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.18 % (75100)dis+10_1_sil=32000:sp=arity:random_seed=3116069158:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.18 % (75102)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=176287426:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.18 % (75098)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=932745659:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.18 % (75098)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.18 % (75103)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2863395482:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.18 % (75098)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.08/0.18 % Exception at run slice level
% 0.08/0.18 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.08/0.18 % (75101)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3932447242:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.18 % (75101)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.18 % (75102) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-75092-75102"...
% 0.08/0.18 % (75102)...printing done.
% 0.08/0.18 % (75102)Refutation found. Thanks to Tanya!
% 0.08/0.18 % SZS status Theorem for theBenchmark
% 0.08/0.18 % SZS output start Proof for theBenchmark
% 0.08/0.18 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.08/0.18 thf(func_def_1, type, s: ($i > $i)).
% 0.08/0.18 thf(func_def_2, type, ite: ($o > $i > $i > $i)).
% 0.08/0.18 thf(func_def_6, type, vNOT: ($o > $o)).
% 0.08/0.18 thf(func_def_7, type, db0: !>[X0: $tType]:(X0)).
% 0.08/0.18 thf(func_def_8, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.08/0.18 thf(func_def_10, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.08/0.18 thf(f1,conjecture,(
% 0.08/0.18 (! [X0 : $o,X1 : $i,X2 : $i] : (~X0 => (((ite @ X0 @ X1 @ X2)) = X2)) & ! [X0 : $o,X1 : $i,X2 : $i] : (X0 => (((ite @ X0 @ X1 @ X2)) = X1))) => ? [X3 : ($i > $i)] : ((((X3 @ (s @ zero))) = zero) & (((X3 @ zero)) = ((s @ zero))))),
% 0.08/0.18 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n8)).
% 0.08/0.18 thf(f2,negated_conjecture,(
% 0.08/0.18 ~((! [X0 : $o,X1 : $i,X2 : $i] : (~X0 => (((ite @ X0 @ X1 @ X2)) = X2)) & ! [X0 : $o,X1 : $i,X2 : $i] : (X0 => (((ite @ X0 @ X1 @ X2)) = X1))) => ? [X3 : ($i > $i)] : ((((X3 @ (s @ zero))) = zero) & (((X3 @ zero)) = ((s @ zero)))))),
% 0.08/0.18 inference(negated_conjecture,[status(cth)],[f1])).
% 0.08/0.18 thf(f3,plain,(
% 0.08/0.18 ~((! [X0 : $o,X1 : $i,X2 : $i] : (~X0 => (((ite @ X0 @ X1 @ X2)) = X2)) & ! [X3 : $o,X4 : $i,X5 : $i] : (X3 => (((ite @ X3 @ X4 @ X5)) = X4))) => ? [X6 : ($i > $i)] : ((zero = ((X6 @ (s @ zero)))) & (((s @ zero)) = ((X6 @ zero)))))),
% 0.08/0.18 inference(rectify,[],[f2])).
% 0.08/0.18 thf(f4,plain,(
% 0.08/0.18 ~((! [X0 : $o,X1 : $i,X2 : $i] : (~ ($true = X0) => (((ite @ X0 @ X1 @ X2)) = X2)) & ! [X3 : $o,X4 : $i,X5 : $i] : (($true = X3) => (((ite @ X3 @ X4 @ X5)) = X4))) => ? [X6 : ($i > $i)] : ((zero = ((X6 @ (s @ zero)))) & (((s @ zero)) = ((X6 @ zero)))))),
% 0.08/0.18 inference(fool_elimination,[],[f3])).
% 0.08/0.18 thf(f5,plain,(
% 0.08/0.18 ~((! [X0 : $o,X1 : $i,X2 : $i] : (($true != X0) => (((ite @ X0 @ X1 @ X2)) = X2)) & ! [X3 : $o,X4 : $i,X5 : $i] : (($true = X3) => (((ite @ X3 @ X4 @ X5)) = X4))) => ? [X6 : ($i > $i)] : ((zero = ((X6 @ (s @ zero)))) & (((s @ zero)) = ((X6 @ zero)))))),
% 0.08/0.18 inference(flattening,[],[f4])).
% 0.08/0.18 thf(f6,plain,(
% 0.08/0.18 ! [X6 : ($i > $i)] : ((zero != ((X6 @ (s @ zero)))) | (((s @ zero)) != ((X6 @ zero)))) & (! [X0 : $o,X1 : $i,X2 : $i] : ((((ite @ X0 @ X1 @ X2)) = X2) | ($true = X0)) & ! [X3 : $o,X4 : $i,X5 : $i] : ((((ite @ X3 @ X4 @ X5)) = X4) | ($true != X3)))),
% 0.08/0.18 inference(ennf_transformation,[],[f5])).
% 0.08/0.18 thf(f7,plain,(
% 0.08/0.18 ! [X6 : ($i > $i)] : ((zero != ((X6 @ (s @ zero)))) | (((s @ zero)) != ((X6 @ zero)))) & ! [X0 : $o,X1 : $i,X2 : $i] : ((((ite @ X0 @ X1 @ X2)) = X2) | ($true = X0)) & ! [X3 : $o,X4 : $i,X5 : $i] : ((((ite @ X3 @ X4 @ X5)) = X4) | ($true != X3))),
% 0.08/0.18 inference(flattening,[],[f6])).
% 0.08/0.18 thf(f8,plain,(
% 0.08/0.18 ! [X0 : ($i > $i)] : ((zero != ((X0 @ (s @ zero)))) | (((s @ zero)) != ((X0 @ zero)))) & ! [X1 : $o,X2 : $i,X3 : $i] : ((((ite @ X1 @ X2 @ X3)) = X3) | ($true = X1)) & ! [X4 : $o,X5 : $i,X6 : $i] : ((((ite @ X4 @ X5 @ X6)) = X5) | ($true != X4))),
% 0.08/0.18 inference(rectify,[],[f7])).
% 0.08/0.18 thf(f9,plain,(
% 0.08/0.18 ( ! [X6 : $i,X4 : $o,X5 : $i] : (($true != X4) | (((ite @ X4 @ X5 @ X6)) = X5)) )),
% 0.08/0.18 inference(cnf_transformation,[],[f8])).
% 0.08/0.18 thf(f10,plain,(
% 0.08/0.18 ( ! [X2 : $i,X3 : $i,X1 : $o] : ((((ite @ X1 @ X2 @ X3)) = X3) | ($true = X1)) )),
% 0.08/0.18 inference(cnf_transformation,[],[f8])).
% 0.08/0.18 thf(f11,plain,(
% 0.08/0.18 ( ! [X0 : ($i > $i)] : ((zero != ((X0 @ (s @ zero)))) | (((s @ zero)) != ((X0 @ zero)))) )),
% 0.08/0.18 inference(cnf_transformation,[],[f8])).
% 0.08/0.18 thf(f12,definition,(
% 0.08/0.18 ($true != $false)),
% 0.08/0.18 introduced(theory,[fool_distinctness_axiom])).
% 0.08/0.18 thf(f13,definition,(
% 0.08/0.18 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.08/0.18 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.08/0.18 thf(f14,plain,(
% 0.08/0.18 (((s @ zero)) != (((^[Y0 : $i]: (zero)) @ zero)))),
% 0.08/0.18 inference(equality_resolution,[],[f11])).
% 0.08/0.18 thf(f15,plain,(
% 0.08/0.18 (zero != ((s @ zero)))),
% 0.08/0.18 inference(beta-eta_normalization,[],[f14])).
% 0.08/0.18 thf(f16,plain,(
% 0.08/0.18 ( ! [X0 : $i,X1 : $i] : ((((ite @ $true @ X0 @ X1)) = X0)) )),
% 0.08/0.18 inference(equality_resolution,[],[f9])).
% 0.08/0.18 thf(f17,plain,(
% 0.08/0.18 ( ! [X2 : ($i > $i),X3 : ($i > $i),X0 : $i,X1 : ($i > $o),X4 : $o,X5 : $i] : ((zero != X0) | (((s @ zero)) != (((^[Y0 : $i]: (ite @ (X1 @ Y0) @ (X2 @ Y0) @ (X3 @ Y0))) @ zero))) | ($true = X4) | (((X1 @ (s @ zero))) != X4) | (((X2 @ (s @ zero))) != X5) | (((X3 @ (s @ zero))) != X0)) )),
% 0.08/0.18 inference(constrained_superposition,[],[f11,f10])).
% 0.08/0.18 thf(f18,plain,(
% 0.08/0.18 ( ! [X2 : ($i > $i),X3 : ($i > $i),X0 : $i,X1 : ($i > $o),X4 : $o,X5 : $i] : ((zero != X0) | (((s @ zero)) != (((^[Y0 : $i]: (ite @ (X1 @ Y0) @ (X2 @ Y0) @ (X3 @ Y0))) @ zero))) | ($true = X4) | ($true = ((X1 @ (s @ zero)))) | (((X2 @ (s @ zero))) != X5) | (((X3 @ (s @ zero))) != X0) | ($true = X4)) )),
% 0.08/0.18 inference(xor_proxy_clausification,[],[f17])).
% 0.08/0.18 thf(f21,plain,(
% 0.08/0.18 ( ! [X2 : ($i > $i),X3 : ($i > $i),X0 : $i,X1 : ($i > $o),X4 : $o,X5 : $i] : ((zero != X0) | (((s @ zero)) != (((^[Y0 : $i]: (ite @ (X1 @ Y0) @ (X2 @ Y0) @ (X3 @ Y0))) @ zero))) | ($true = X4) | ($true = ((X1 @ (s @ zero)))) | (((X2 @ (s @ zero))) != X5) | (((X3 @ (s @ zero))) != X0)) )),
% 0.08/0.18 inference(duplicate_literal_removal,[],[f18])).
% 0.08/0.18 thf(f22,plain,(
% 0.08/0.18 ( ! [X2 : ($i > $i),X3 : ($i > $i),X0 : $i,X1 : ($i > $o),X4 : $o,X5 : $i] : ((zero != X0) | (((s @ zero)) != ((ite @ (X1 @ zero) @ (X2 @ zero) @ (X3 @ zero)))) | ($true = X4) | ($true = ((X1 @ (s @ zero)))) | (((X2 @ (s @ zero))) != X5) | (((X3 @ (s @ zero))) != X0)) )),
% 0.08/0.18 inference(beta-eta_normalization,[],[f21])).
% 0.08/0.18 thf(f24,definition,(
% 0.08/0.18 spl0_1 <=> ! [X4 : $o] : ($true = X4)),
% 0.08/0.18 introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition])).
% 0.08/0.18 thf(f25,plain,(
% 0.08/0.18 ( ! [X4 : $o] : (($true = X4)) ) | ~spl0_1),
% 0.08/0.18 inference(avatar_component_clause,[],[f24])).
% 0.08/0.18 thf(f27,definition,(
% 0.08/0.18 spl0_2 <=> ! [X5 : $i,X0 : $i,X3 : ($i > $i),X2 : ($i > $i),X1 : ($i > $o)] : ((zero != X0) | (((s @ zero)) != ((ite @ (X1 @ zero) @ (X2 @ zero) @ (X3 @ zero)))) | (((X3 @ (s @ zero))) != X0) | (((X2 @ (s @ zero))) != X5) | ($true = ((X1 @ (s @ zero)))))),
% 0.08/0.18 introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition])).
% 0.08/0.18 thf(f28,plain,(
% 0.08/0.18 ( ! [X2 : ($i > $i),X3 : ($i > $i),X0 : $i,X1 : ($i > $o),X5 : $i] : ((zero != X0) | (((s @ zero)) != ((ite @ (X1 @ zero) @ (X2 @ zero) @ (X3 @ zero)))) | ($true = ((X1 @ (s @ zero)))) | (((X2 @ (s @ zero))) != X5) | (((X3 @ (s @ zero))) != X0)) ) | ~spl0_2),
% 0.08/0.18 inference(avatar_component_clause,[],[f27])).
% 0.08/0.18 thf(f29,plain,(
% 0.08/0.18 spl0_1 | spl0_2),
% 0.08/0.18 inference(avatar_split_clause,[],[f22,f27,f24])).
% 0.08/0.18 thf(f91,plain,(
% 0.08/0.18 ( ! [X0 : $o] : (($false != X0)) ) | ~spl0_1),
% 0.08/0.18 inference(constrained_superposition,[],[f12,f25])).
% 0.08/0.18 thf(f124,plain,(
% 0.08/0.18 $false | ~spl0_1),
% 0.08/0.18 inference(equality_resolution,[],[f91])).
% 0.08/0.18 thf(f125,plain,(
% 0.08/0.18 ~spl0_1),
% 0.08/0.18 inference(avatar_contradiction_clause,[],[f124])).
% 0.08/0.18 thf(f134,plain,(
% 0.08/0.18 ( ! [X2 : ($i > $i),X3 : $i,X0 : ($i > $o),X1 : ($i > $i)] : ((((s @ zero)) != ((ite @ (X0 @ zero) @ (X1 @ zero) @ (X2 @ zero)))) | ($true = ((X0 @ (s @ zero)))) | (zero != ((X2 @ (s @ zero)))) | (((X1 @ (s @ zero))) != X3)) ) | ~spl0_2),
% 0.08/0.18 inference(equality_resolution,[],[f28])).
% 0.08/0.18 thf(f146,plain,(
% 0.08/0.18 ( ! [X2 : ($i > $i),X3 : $i,X0 : ($i > $o),X1 : ($i > $i)] : ((((s @ zero)) != ((ite @ $true @ (X1 @ zero) @ (X2 @ zero)))) | ($true = ((X0 @ (s @ zero)))) | (zero != ((X2 @ (s @ zero)))) | (((X1 @ (s @ zero))) != X3) | ($false = ((X0 @ zero)))) ) | ~spl0_2),
% 0.08/0.18 inference(constrained_superposition,[],[f134,f13])).
% 0.08/0.18 thf(f175,definition,(
% 0.08/0.18 spl0_12 <=> ! [X2 : ($i > $i)] : (zero != ((X2 @ (s @ zero))))),
% 0.08/0.18 introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition])).
% 0.08/0.18 thf(f176,plain,(
% 0.08/0.18 ( ! [X2 : ($i > $i)] : ((zero != ((X2 @ (s @ zero))))) ) | ~spl0_12),
% 0.08/0.18 inference(avatar_component_clause,[],[f175])).
% 0.08/0.18 thf(f178,definition,(
% 0.08/0.18 spl0_13 <=> ! [X1 : ($i > $o)] : (($true = ((X1 @ (s @ zero)))) | ($false = ((X1 @ zero))))),
% 0.08/0.18 introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition])).
% 0.08/0.18 thf(f179,plain,(
% 0.08/0.18 ( ! [X1 : ($i > $o)] : (($true = ((X1 @ (s @ zero)))) | ($false = ((X1 @ zero)))) ) | ~spl0_13),
% 0.08/0.18 inference(avatar_component_clause,[],[f178])).
% 0.08/0.18 thf(f181,definition,(
% 0.08/0.18 spl0_14 <=> ! [X0 : ($i > $i),X3 : $i] : ((((s @ zero)) != ((X0 @ zero))) | (((X0 @ (s @ zero))) != X3))),
% 0.08/0.18 introduced(definition,[new_symbols(definition,[spl0_14])],[avatar_definition])).
% 0.08/0.18 thf(f182,plain,(
% 0.08/0.18 ( ! [X3 : $i,X0 : ($i > $i)] : ((((s @ zero)) != ((X0 @ zero))) | (((X0 @ (s @ zero))) != X3)) ) | ~spl0_14),
% 0.08/0.18 inference(avatar_component_clause,[],[f181])).
% 0.08/0.18 thf(f184,plain,(
% 0.08/0.18 ( ! [X2 : ($i > $i),X3 : $i,X0 : ($i > $o),X1 : ($i > $i)] : ((((s @ zero)) != ((X1 @ zero))) | ($true = ((X0 @ (s @ zero)))) | (zero != ((X2 @ (s @ zero)))) | (((X1 @ (s @ zero))) != X3) | ($false = ((X0 @ zero)))) ) | ~spl0_2),
% 0.08/0.18 inference(forward_demodulation,[],[f146,f16])).
% 0.08/0.18 thf(f203,plain,(
% 0.08/0.18 spl0_12 | spl0_13 | spl0_14 | ~spl0_2),
% 0.08/0.18 inference(avatar_split_clause,[],[f184,f27,f181,f178,f175])).
% 0.08/0.18 thf(f215,plain,(
% 0.08/0.18 $false | ~spl0_12),
% 0.08/0.18 inference(equality_resolution,[],[f176])).
% 0.08/0.18 thf(f216,plain,(
% 0.08/0.18 ~spl0_12),
% 0.08/0.18 inference(avatar_contradiction_clause,[],[f215])).
% 0.08/0.18 thf(f235,plain,(
% 0.08/0.18 (zero = ((s @ zero))) | ~spl0_13),
% 0.08/0.18 inference(leibniz_equality_elimination,[],[f179])).
% 0.08/0.18 thf(f259,plain,(
% 0.08/0.18 $false | ~spl0_13),
% 0.08/0.18 inference(forward_subsumption_resolution,[],[f235,f15])).
% 0.08/0.18 thf(f260,plain,(
% 0.08/0.18 ~spl0_13),
% 0.08/0.18 inference(avatar_contradiction_clause,[],[f259])).
% 0.08/0.18 thf(f265,plain,(
% 0.08/0.18 ( ! [X0 : $i] : (((((^[Y0 : $i]: (s @ ((^[Y1 : $i]: (zero)) @ Y0))) @ (s @ zero))) != X0)) ) | ~spl0_14),
% 0.08/0.18 inference(equality_resolution,[],[f182])).
% 0.08/0.18 thf(f266,plain,(
% 0.08/0.18 ( ! [X0 : $i] : ((((s @ zero)) != X0)) ) | ~spl0_14),
% 0.08/0.18 inference(beta-eta_normalization,[],[f265])).
% 0.08/0.18 thf(f280,plain,(
% 0.08/0.18 $false | ~spl0_14),
% 0.08/0.18 inference(equality_resolution,[],[f266])).
% 0.08/0.18 thf(f281,plain,(
% 0.08/0.18 ~spl0_14),
% 0.08/0.18 inference(avatar_contradiction_clause,[],[f280])).
% 0.08/0.18 cnf(s1, plain, spl0_1 | spl0_2, inference(sat_conversion,[],[f29])).
% 0.08/0.18 cnf(s9, plain, ~spl0_1, inference(sat_conversion,[],[f125])).
% 0.08/0.18 cnf(s17, plain, ~spl0_2 | spl0_12 | spl0_13 | spl0_14, inference(sat_conversion,[],[f203])).
% 0.08/0.18 cnf(s20, plain, ~spl0_12, inference(sat_conversion,[],[f216])).
% 0.08/0.18 cnf(s25, plain, ~spl0_13, inference(sat_conversion,[],[f260])).
% 0.08/0.18 cnf(s26, plain, ~spl0_14, inference(sat_conversion,[],[f281])).
% 0.08/0.18 cnf(s27, plain, ~spl0_2, inference(rat,[],[s17,s26,s25,s20])).
% 0.08/0.18 cnf(s33, plain, $false, inference(rat,[],[s1,s27,s9])).
% 0.08/0.18 thf(f282,plain,(
% 0.08/0.18 $false),
% 0.08/0.18 inference(avatar_sat_refutation,[],[s33])).
% 0.08/0.18 % SZS output end Proof for theBenchmark
% 0.08/0.18 % (75102)------------------------------
% 0.08/0.18 % (75102)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.18 % (75102)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.18 % (75102)CaDiCaL version: 2.1.3
% 0.08/0.18 % (75102)Termination reason: Refutation
% 0.08/0.18 % (75102)Time elapsed: 0.007 s
% 0.08/0.18 % (75102)Peak memory usage: 13 MB
% 0.08/0.18 % (75102)Instructions burned: 20 (million)
% 0.08/0.18 % (75092)Success in time 0.033 s
% 0.08/0.18 % Vampire exiting
%------------------------------------------------------------------------------