%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUN025^2 : TPTP v9.3.1. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n020.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.20s 0.30s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUN025^2 : TPTP v9.3.1. Released v6.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n020.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 13:07:19 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23 Running first-order model finding
% 0.08/0.23 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.20/0.30 % (1019656)Will run a generic schedule for satisfiability detection.
% 0.20/0.30 % (1019674)dis+10_1_sil=32000:sp=arity:random_seed=15530628:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.30 % (1019672)% WARNING: option uhcvi not known.
% 0.20/0.30 % (1019671)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=127475950_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.30 % (1019672)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4114900759:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.30 % (1019676)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1608746296:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.30 % (1019673)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2468505546:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.30 % (1019677)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2870275282:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.30 % (1019675)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2163983510:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.30 % Exception at run slice level
% 0.20/0.30 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.30 % (1019672)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.30 % (1019672)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.30 % (1019675)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.30 % (1019677) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1019656-1019677"...
% 0.20/0.30 % (1019693)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3859614378:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.30 % (1019677)...printing done.
% 0.20/0.30 % Exception at run slice level
% 0.20/0.30 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.30 % (1019677)Refutation found. Thanks to Tanya!
% 0.20/0.30 % SZS status Theorem for theBenchmark
% 0.20/0.30 % SZS output start Proof for theBenchmark
% 0.20/0.30 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.20/0.30 thf(func_def_1, type, s: ($i > $i)).
% 0.20/0.30 thf(func_def_2, type, ite: ($o > $i > $i > $i)).
% 0.20/0.30 thf(func_def_3, type, h: ($i > $i)).
% 0.20/0.30 thf(func_def_7, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.20/0.30 thf(func_def_8, type, vNOT: ($o > $o)).
% 0.20/0.30 thf(func_def_9, type, db0: !>[X0: $tType]:(X0)).
% 0.20/0.30 thf(func_def_10, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.20/0.30 thf(f1,conjecture,(
% 0.20/0.30 (! [X3 : $i] : (((h @ X3)) = ((ite @ (X3 = ((s @ zero))) @ zero @ (s @ zero)))) & ! [X3 : $i] : (((s @ X3)) != X3) & ! [X0 : $o,X1 : $i,X2 : $i] : (~X0 => (((ite @ X0 @ X1 @ X2)) = X2)) & ! [X0 : $o,X1 : $i,X2 : $i] : (X0 => (((ite @ X0 @ X1 @ X2)) = X1))) => ? [X4 : ($i > $i)] : ((((X4 @ (s @ (s @ zero)))) = ((s @ zero))) & (((X4 @ (s @ zero))) = zero) & (((X4 @ zero)) = ((s @ zero))))),
% 0.20/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',n10)).
% 0.20/0.30 thf(f2,negated_conjecture,(
% 0.20/0.30 ~((! [X3 : $i] : (((h @ X3)) = ((ite @ (X3 = ((s @ zero))) @ zero @ (s @ zero)))) & ! [X3 : $i] : (((s @ X3)) != X3) & ! [X0 : $o,X1 : $i,X2 : $i] : (~X0 => (((ite @ X0 @ X1 @ X2)) = X2)) & ! [X0 : $o,X1 : $i,X2 : $i] : (X0 => (((ite @ X0 @ X1 @ X2)) = X1))) => ? [X4 : ($i > $i)] : ((((X4 @ (s @ (s @ zero)))) = ((s @ zero))) & (((X4 @ (s @ zero))) = zero) & (((X4 @ zero)) = ((s @ zero)))))),
% 0.20/0.30 inference(negated_conjecture,[status(cth)],[f1])).
% 0.20/0.30 thf(f3,plain,(
% 0.20/0.30 ~((! [X0 : $i] : (((h @ X0)) = ((ite @ (((s @ zero)) = X0) @ zero @ (s @ zero)))) & ! [X1 : $i] : (((s @ X1)) != X1) & ! [X2 : $o,X3 : $i,X4 : $i] : (~X2 => (((ite @ X2 @ X3 @ X4)) = X4)) & ! [X5 : $o,X6 : $i,X7 : $i] : (X5 => (((ite @ X5 @ X6 @ X7)) = X6))) => ? [X8 : ($i > $i)] : ((((s @ zero)) = ((X8 @ (s @ (s @ zero))))) & (zero = ((X8 @ (s @ zero)))) & (((s @ zero)) = ((X8 @ zero)))))),
% 0.20/0.30 inference(rectify,[],[f2])).
% 0.20/0.30 thf(f4,plain,(
% 0.20/0.30 ~((! [X0 : $i] : (((h @ X0)) = ((ite @ ((s @ zero) = X0) @ zero @ (s @ zero)))) & ! [X1 : $i] : (((s @ X1)) != X1) & ! [X2 : $o,X3 : $i,X4 : $i] : (~ ($true = X2) => (((ite @ X2 @ X3 @ X4)) = X4)) & ! [X5 : $o,X6 : $i,X7 : $i] : (($true = X5) => (((ite @ X5 @ X6 @ X7)) = X6))) => ? [X8 : ($i > $i)] : ((((s @ zero)) = ((X8 @ (s @ (s @ zero))))) & (zero = ((X8 @ (s @ zero)))) & (((s @ zero)) = ((X8 @ zero)))))),
% 0.20/0.30 inference(fool_elimination,[],[f3])).
% 0.20/0.30 thf(f5,plain,(
% 0.20/0.30 ~((! [X0 : $i] : (((h @ X0)) = ((ite @ ((s @ zero) = X0) @ zero @ (s @ zero)))) & ! [X1 : $i] : (((s @ X1)) != X1) & ! [X2 : $o,X3 : $i,X4 : $i] : (($true != X2) => (((ite @ X2 @ X3 @ X4)) = X4)) & ! [X5 : $o,X6 : $i,X7 : $i] : (($true = X5) => (((ite @ X5 @ X6 @ X7)) = X6))) => ? [X8 : ($i > $i)] : ((((s @ zero)) = ((X8 @ (s @ (s @ zero))))) & (zero = ((X8 @ (s @ zero)))) & (((s @ zero)) = ((X8 @ zero)))))),
% 0.20/0.30 inference(flattening,[],[f4])).
% 0.20/0.30 thf(f6,plain,(
% 0.20/0.30 ! [X8 : ($i > $i)] : ((((s @ zero)) != ((X8 @ (s @ (s @ zero))))) | (zero != ((X8 @ (s @ zero)))) | (((s @ zero)) != ((X8 @ zero)))) & (! [X0 : $i] : (((h @ X0)) = ((ite @ ((s @ zero) = X0) @ zero @ (s @ zero)))) & ! [X1 : $i] : (((s @ X1)) != X1) & ! [X2 : $o,X3 : $i,X4 : $i] : ((((ite @ X2 @ X3 @ X4)) = X4) | ($true = X2)) & ! [X5 : $o,X6 : $i,X7 : $i] : ((((ite @ X5 @ X6 @ X7)) = X6) | ($true != X5)))),
% 0.20/0.30 inference(ennf_transformation,[],[f5])).
% 0.20/0.30 thf(f7,plain,(
% 0.20/0.30 ! [X8 : ($i > $i)] : ((((s @ zero)) != ((X8 @ (s @ (s @ zero))))) | (zero != ((X8 @ (s @ zero)))) | (((s @ zero)) != ((X8 @ zero)))) & ! [X0 : $i] : (((h @ X0)) = ((ite @ ((s @ zero) = X0) @ zero @ (s @ zero)))) & ! [X1 : $i] : (((s @ X1)) != X1) & ! [X2 : $o,X3 : $i,X4 : $i] : ((((ite @ X2 @ X3 @ X4)) = X4) | ($true = X2)) & ! [X5 : $o,X6 : $i,X7 : $i] : ((((ite @ X5 @ X6 @ X7)) = X6) | ($true != X5))),
% 0.20/0.30 inference(flattening,[],[f6])).
% 0.20/0.30 thf(f8,plain,(
% 0.20/0.30 ! [X0 : ($i > $i)] : ((((s @ zero)) != ((X0 @ (s @ (s @ zero))))) | (zero != ((X0 @ (s @ zero)))) | (((s @ zero)) != ((X0 @ zero)))) & ! [X1 : $i] : (((h @ X1)) = ((ite @ ((s @ zero) = X1) @ zero @ (s @ zero)))) & ! [X2 : $i] : (((s @ X2)) != X2) & ! [X3 : $o,X4 : $i,X5 : $i] : ((((ite @ X3 @ X4 @ X5)) = X5) | ($true = X3)) & ! [X6 : $o,X7 : $i,X8 : $i] : ((((ite @ X6 @ X7 @ X8)) = X7) | ($true != X6))),
% 0.20/0.30 inference(rectify,[],[f7])).
% 0.20/0.30 thf(f9,plain,(
% 0.20/0.30 ( ! [X8 : $i,X6 : $o,X7 : $i] : ((((ite @ X6 @ X7 @ X8)) = X7) | ($true != X6)) )),
% 0.20/0.30 inference(cnf_transformation,[],[f8])).
% 0.20/0.30 thf(f10,plain,(
% 0.20/0.30 ( ! [X3 : $o,X4 : $i,X5 : $i] : ((((ite @ X3 @ X4 @ X5)) = X5) | ($true = X3)) )),
% 0.20/0.30 inference(cnf_transformation,[],[f8])).
% 0.20/0.30 thf(f11,plain,(
% 0.20/0.30 ( ! [X2 : $i] : ((((s @ X2)) != X2)) )),
% 0.20/0.30 inference(cnf_transformation,[],[f8])).
% 0.20/0.30 thf(f12,plain,(
% 0.20/0.30 ( ! [X1 : $i] : ((((h @ X1)) = ((ite @ ((s @ zero) = X1) @ zero @ (s @ zero))))) )),
% 0.20/0.30 inference(cnf_transformation,[],[f8])).
% 0.20/0.30 thf(f13,plain,(
% 0.20/0.30 ( ! [X0 : ($i > $i)] : ((((s @ zero)) != ((X0 @ (s @ (s @ zero))))) | (zero != ((X0 @ (s @ zero)))) | (((s @ zero)) != ((X0 @ zero)))) )),
% 0.20/0.30 inference(cnf_transformation,[],[f8])).
% 0.20/0.30 thf(f15,definition,(
% 0.20/0.30 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.20/0.30 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.20/0.30 thf(f16,plain,(
% 0.20/0.30 ( ! [X8 : $i,X7 : $i] : ((((ite @ $true @ X7 @ X8)) = X7)) )),
% 0.20/0.30 inference(equality_resolution,[],[f9])).
% 0.20/0.30 thf(f36,plain,(
% 0.20/0.30 ( ! [X0 : $i] : ((((s @ zero)) = ((h @ X0))) | ($true = (((s @ zero) = X0)))) )),
% 0.20/0.30 inference(constrained_superposition,[],[f10,f12])).
% 0.20/0.30 thf(f44,plain,(
% 0.20/0.30 ( ! [X0 : $i] : ((((s @ zero)) = ((h @ X0))) | (((s @ zero)) = X0)) )),
% 0.20/0.30 inference(equality_proxy_clausification,[],[f36])).
% 0.20/0.30 thf(f60,plain,(
% 0.20/0.30 ( ! [X0 : ($i > $i),X1 : $i] : ((((s @ zero)) != ((s @ zero))) | (zero != (((^[Y0 : $i]: (h @ (X0 @ Y0))) @ (s @ zero)))) | (((s @ zero)) != (((^[Y0 : $i]: (h @ (X0 @ Y0))) @ zero))) | (((s @ zero)) = X1) | (((X0 @ (s @ (s @ zero)))) != X1)) )),
% 0.20/0.30 inference(constrained_superposition,[],[f13,f44])).
% 0.20/0.30 thf(f61,plain,(
% 0.20/0.30 ( ! [X0 : ($i > $i),X1 : $i] : ((zero != (((^[Y0 : $i]: (h @ (X0 @ Y0))) @ (s @ zero)))) | (((s @ zero)) != (((^[Y0 : $i]: (h @ (X0 @ Y0))) @ zero))) | (((s @ zero)) = X1) | (((X0 @ (s @ (s @ zero)))) != X1)) )),
% 0.20/0.30 inference(trivial_inequality_removal,[],[f60])).
% 0.20/0.30 thf(f62,plain,(
% 0.20/0.30 ( ! [X0 : ($i > $i),X1 : $i] : ((((s @ zero)) != ((h @ (X0 @ zero)))) | (zero != ((h @ (X0 @ (s @ zero))))) | (((s @ zero)) = X1) | (((X0 @ (s @ (s @ zero)))) != X1)) )),
% 0.20/0.30 inference(beta-eta_normalization,[],[f61])).
% 0.20/0.30 thf(f67,plain,(
% 0.20/0.30 ( ! [X0 : ($i > $i),X1 : $i] : ((((s @ zero)) != ((s @ zero))) | (zero != ((h @ (X0 @ (s @ zero))))) | (((s @ zero)) = X1) | (((X0 @ (s @ (s @ zero)))) != X1) | (((s @ zero)) = ((X0 @ zero)))) )),
% 0.20/0.30 inference(constrained_superposition,[],[f62,f44])).
% 0.20/0.30 thf(f68,plain,(
% 0.20/0.30 ( ! [X0 : ($i > $i),X1 : $i] : ((zero != ((h @ (X0 @ (s @ zero))))) | (((s @ zero)) = X1) | (((s @ zero)) = ((X0 @ zero))) | (((X0 @ (s @ (s @ zero)))) != X1)) )),
% 0.20/0.30 inference(trivial_inequality_removal,[],[f67])).
% 0.20/0.30 thf(f137,definition,(
% 0.20/0.30 spl0_15 <=> (zero = ((h @ (s @ zero))))),
% 0.20/0.30 introduced(definition,[new_symbols(definition,[spl0_15])],[avatar_definition])).
% 0.20/0.30 thf(f138,plain,(
% 0.20/0.30 (zero = ((h @ (s @ zero)))) | ~spl0_15),
% 0.20/0.30 inference(avatar_component_clause,[],[f137])).
% 0.20/0.30 thf(f210,plain,(
% 0.20/0.30 ( ! [X2 : $i,X0 : $o,X1 : $i] : ((((ite @ X0 @ X1 @ X2)) = X1) | ($false = X0)) )),
% 0.20/0.30 inference(constrained_superposition,[],[f16,f15])).
% 0.20/0.30 thf(f223,plain,(
% 0.20/0.30 ( ! [X0 : $i] : ((zero = ((h @ X0))) | ((((s @ zero) = X0)) = $false)) )),
% 0.20/0.30 inference(constrained_superposition,[],[f12,f210])).
% 0.20/0.30 thf(f225,plain,(
% 0.20/0.30 ( ! [X0 : $i] : ((((s @ zero)) != X0) | (zero = ((h @ X0)))) )),
% 0.20/0.30 inference(equality_proxy_clausification,[],[f223])).
% 0.20/0.30 thf(f265,plain,(
% 0.20/0.30 (zero = ((h @ (s @ zero))))),
% 0.20/0.30 inference(equality_resolution,[],[f225])).
% 0.20/0.30 thf(f266,plain,(
% 0.20/0.30 spl0_15),
% 0.20/0.30 inference(avatar_split_clause,[],[f265,f137])).
% 0.20/0.30 thf(f279,plain,(
% 0.20/0.30 ( ! [X0 : $i] : ((zero != zero) | (((s @ zero)) = X0) | (((s @ zero)) = (((^[Y0 : $i]: (Y0)) @ zero))) | ((((^[Y0 : $i]: (Y0)) @ (s @ (s @ zero)))) != X0)) ) | ~spl0_15),
% 0.20/0.30 inference(constrained_superposition,[],[f68,f138])).
% 0.20/0.30 thf(f283,plain,(
% 0.20/0.30 ( ! [X0 : $i] : ((((s @ zero)) = X0) | (((s @ zero)) = (((^[Y0 : $i]: (Y0)) @ zero))) | ((((^[Y0 : $i]: (Y0)) @ (s @ (s @ zero)))) != X0)) ) | ~spl0_15),
% 0.20/0.30 inference(trivial_inequality_removal,[],[f279])).
% 0.20/0.30 thf(f284,plain,(
% 0.20/0.30 ( ! [X0 : $i] : ((((s @ zero)) = X0) | (zero = ((s @ zero))) | (((s @ (s @ zero))) != X0)) ) | ~spl0_15),
% 0.20/0.30 inference(beta-eta_normalization,[],[f283])).
% 0.20/0.30 thf(f293,definition,(
% 0.20/0.30 spl0_28 <=> (zero = ((s @ zero)))),
% 0.20/0.30 introduced(definition,[new_symbols(definition,[spl0_28])],[avatar_definition])).
% 0.20/0.30 thf(f295,plain,(
% 0.20/0.30 (zero = ((s @ zero))) | ~spl0_28),
% 0.20/0.30 inference(avatar_component_clause,[],[f293])).
% 0.20/0.30 thf(f297,definition,(
% 0.20/0.30 spl0_29 <=> ! [X0 : $i] : ((((s @ zero)) = X0) | (((s @ (s @ zero))) != X0))),
% 0.20/0.30 introduced(definition,[new_symbols(definition,[spl0_29])],[avatar_definition])).
% 0.20/0.30 thf(f298,plain,(
% 0.20/0.30 ( ! [X0 : $i] : ((((s @ (s @ zero))) != X0) | (((s @ zero)) = X0)) ) | ~spl0_29),
% 0.20/0.30 inference(avatar_component_clause,[],[f297])).
% 0.20/0.30 thf(f299,plain,(
% 0.20/0.30 spl0_28 | spl0_29 | ~spl0_15),
% 0.20/0.30 inference(avatar_split_clause,[],[f284,f137,f297,f293])).
% 0.20/0.30 thf(f313,plain,(
% 0.20/0.30 (zero != zero) | ~spl0_28),
% 0.20/0.30 inference(constrained_superposition,[],[f11,f295])).
% 0.20/0.30 thf(f321,plain,(
% 0.20/0.30 $false | ~spl0_28),
% 0.20/0.30 inference(trivial_inequality_removal,[],[f313])).
% 0.20/0.30 thf(f322,plain,(
% 0.20/0.30 ~spl0_28),
% 0.20/0.30 inference(avatar_contradiction_clause,[],[f321])).
% 0.20/0.30 thf(f353,plain,(
% 0.20/0.30 (((s @ zero)) = ((s @ (s @ zero)))) | ~spl0_29),
% 0.20/0.30 inference(equality_resolution,[],[f298])).
% 0.20/0.30 thf(f359,plain,(
% 0.20/0.30 (((s @ zero)) != ((s @ zero))) | ~spl0_29),
% 0.20/0.30 inference(constrained_superposition,[],[f11,f353])).
% 0.20/0.30 thf(f362,plain,(
% 0.20/0.30 $false | ~spl0_29),
% 0.20/0.30 inference(trivial_inequality_removal,[],[f359])).
% 0.20/0.30 thf(f363,plain,(
% 0.20/0.30 ~spl0_29),
% 0.20/0.30 inference(avatar_contradiction_clause,[],[f362])).
% 0.20/0.30 cnf(s19, plain, spl0_15, inference(sat_conversion,[],[f266])).
% 0.20/0.30 cnf(s21, plain, ~spl0_15 | spl0_28 | spl0_29, inference(sat_conversion,[],[f299])).
% 0.20/0.30 cnf(s23, plain, ~spl0_28, inference(sat_conversion,[],[f322])).
% 0.20/0.30 cnf(s25, plain, ~spl0_29, inference(sat_conversion,[],[f363])).
% 0.20/0.30 cnf(s29, plain, ~spl0_15, inference(rat,[],[s21,s25,s23])).
% 0.20/0.30 cnf(s30, plain, $false, inference(rat,[],[s19,s29])).
% 0.20/0.30 thf(f376,plain,(
% 0.20/0.30 $false),
% 0.20/0.30 inference(avatar_sat_refutation,[],[s30])).
% 0.20/0.30 % SZS output end Proof for theBenchmark
% 0.20/0.30 % (1019677)------------------------------
% 0.20/0.30 % (1019677)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (1019677)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (1019677)CaDiCaL version: 2.1.3
% 0.20/0.30 % (1019677)Termination reason: Refutation
% 0.20/0.30 % (1019677)Time elapsed: 0.018 s
% 0.20/0.30 % (1019677)Peak memory usage: 12 MB
% 0.20/0.30 % (1019677)Instructions burned: 30 (million)
% 0.20/0.30 % (1019656)Success in time 0.062 s
% 0.20/0.30 % Vampire exiting
%------------------------------------------------------------------------------