%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV384^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:38:32 AM UTC 2026
% Result : Theorem 0.21s 0.30s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV384^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.19 % Computer : n005.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Tue Sep 29 15:43:01 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running higher-order theorem proving
% 0.07/0.23 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.21/0.30 % (1826914)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.30 % (1826931)lrs+10_16_si=on:nwc=1.5:random_seed=3370813190:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.21/0.30 % (1826936)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.21/0.30 % (1826936)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.21/0.30 % (1826930)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2593617669:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.30 % (1826931)Instruction limit reached!
% 0.21/0.30 % (1826931)------------------------------
% 0.21/0.30 % (1826931)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.30 % (1826931)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.30 % (1826932)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2550012154:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.21/0.30 % (1826931)CaDiCaL version: 2.1.3
% 0.21/0.30 % (1826931)Termination reason: Instruction limit
% 0.21/0.30 % (1826931)Termination phase: Saturation
% 0.21/0.30 % (1826931)Time elapsed: 0.007 s
% 0.21/0.30 % (1826931)Peak memory usage: 12 MB
% 0.21/0.30 % (1826931)Instructions burned: 21 (million)
% 0.21/0.30 % (1826935)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=4050998537:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.21/0.30 % (1826933)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=2807077069: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.21/0.30 % (1826934)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3239912577:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.30 % (1826936)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=748267038:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.21/0.30 % (1826932)Instruction limit reached!
% 0.21/0.30 % (1826932)------------------------------
% 0.21/0.30 % (1826932)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.30 % (1826932)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.30 % (1826932)CaDiCaL version: 2.1.3
% 0.21/0.30 % (1826932)Termination reason: Instruction limit
% 0.21/0.30 % (1826932)Termination phase: Saturation
% 0.21/0.30 % (1826932)Time elapsed: 0.003 s
% 0.21/0.30 % (1826932)Peak memory usage: 12 MB
% 0.21/0.30 % (1826932)Instructions burned: 4 (million)
% 0.21/0.30 % (1826947)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=97464138:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.21/0.30 % (1826947)Instruction limit reached!
% 0.21/0.30 % (1826947)------------------------------
% 0.21/0.30 % (1826947)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.30 % (1826947)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.30 % (1826947)CaDiCaL version: 2.1.3
% 0.21/0.30 % (1826947)Termination reason: Instruction limit
% 0.21/0.30 % (1826947)Termination phase: Saturation
% 0.21/0.30 % (1826947)Time elapsed: 0.001 s
% 0.21/0.30 % (1826947)Peak memory usage: 12 MB
% 0.21/0.30 % (1826947)Instructions burned: 2 (million)
% 0.21/0.30 % (1826936) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1826914-1826936"...
% 0.21/0.30 % (1826934) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1826914-1826934"...
% 0.21/0.30 % (1826934)...printing done.
% 0.21/0.30 % (1826936)...printing done.
% 0.21/0.30 % (1826934)Refutation found. Thanks to Tanya!
% 0.21/0.30 % SZS status Theorem for theBenchmark
% 0.21/0.30 % SZS output start Proof for theBenchmark
% 0.21/0.30 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.21/0.30 thf(func_def_0, type, cP: ($i > $o)).
% 0.21/0.30 thf(func_def_1, type, s: ($i > $o)).
% 0.21/0.30 thf(func_def_2, type, cR: ($i > $i > $o)).
% 0.21/0.30 thf(func_def_6, type, sK0: ($i > $i)).
% 0.21/0.30 thf(func_def_7, type, sK1: (($i > $o) > $i)).
% 0.21/0.30 thf(func_def_9, type, vNOT: ($o > $o)).
% 0.21/0.30 thf(func_def_10, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.21/0.30 thf(func_def_11, type, db0: !>[X0: $tType]:(X0)).
% 0.21/0.30 thf(func_def_12, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.21/0.30 thf(f1,conjecture,(
% 0.21/0.30 (! [X4 : $i] : (! [X5 : $i] : (((s @ X5) & (cR @ X4 @ X5)) => (cP @ X5)) => (cP @ X4)) & ! [X1 : $i,X0 : ($i > $o)] : ((X0 @ X1) => ? [X2 : $i] : (! [X3 : $i] : ((cR @ X2 @ X3) => ~(X0 @ X3)) & (X0 @ X2)))) => ! [X6 : $i] : ((s @ X6) => (cP @ X6))),
% 0.21/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM117B)).
% 0.21/0.30 thf(f2,negated_conjecture,(
% 0.21/0.30 ~((! [X4 : $i] : (! [X5 : $i] : (((s @ X5) & (cR @ X4 @ X5)) => (cP @ X5)) => (cP @ X4)) & ! [X1 : $i,X0 : ($i > $o)] : ((X0 @ X1) => ? [X2 : $i] : (! [X3 : $i] : ((cR @ X2 @ X3) => ~(X0 @ X3)) & (X0 @ X2)))) => ! [X6 : $i] : ((s @ X6) => (cP @ X6)))),
% 0.21/0.30 inference(negated_conjecture,[status(cth)],[f1])).
% 0.21/0.30 thf(f3,plain,(
% 0.21/0.30 ~((! [X0 : $i] : (! [X1 : $i] : (((s @ X1) & (cR @ X0 @ X1)) => (cP @ X1)) => (cP @ X0)) & ! [X2 : $i,X3 : ($i > $o)] : ((X3 @ X2) => ? [X4 : $i] : (! [X5 : $i] : ((cR @ X4 @ X5) => ~(X3 @ X5)) & (X3 @ X4)))) => ! [X6 : $i] : ((s @ X6) => (cP @ X6)))),
% 0.21/0.30 inference(rectify,[],[f2])).
% 0.21/0.30 thf(f4,plain,(
% 0.21/0.30 ~((! [X0 : $i] : (! [X1 : $i] : (((((cR @ X0 @ X1)) = $true) & (((s @ X1)) = $true)) => (((cP @ X1)) = $true)) => (((cP @ X0)) = $true)) & ! [X2 : $i,X3 : ($i > $o)] : ((((X3 @ X2)) = $true) => ? [X4 : $i] : (! [X5 : $i] : ((((cR @ X4 @ X5)) = $true) => ~ (((X3 @ X5)) = $true)) & (((X3 @ X4)) = $true)))) => ! [X6 : $i] : ((((s @ X6)) = $true) => (((cP @ X6)) = $true)))),
% 0.21/0.30 inference(fool_elimination,[],[f3])).
% 0.21/0.30 thf(f5,plain,(
% 0.21/0.30 ~((! [X0 : $i] : (! [X1 : $i] : (((((cR @ X0 @ X1)) = $true) & (((s @ X1)) = $true)) => (((cP @ X1)) = $true)) => (((cP @ X0)) = $true)) & ! [X3 : ($i > $o),X2 : $i] : ((((X3 @ X2)) = $true) => ? [X4 : $i] : (! [X5 : $i] : ((((cR @ X4 @ X5)) = $true) => (((X3 @ X5)) != $true)) & (((X3 @ X4)) = $true)))) => ! [X6 : $i] : ((((s @ X6)) = $true) => (((cP @ X6)) = $true)))),
% 0.21/0.30 inference(flattening,[],[f4])).
% 0.21/0.30 thf(f6,plain,(
% 0.21/0.30 ? [X6 : $i] : ((((cP @ X6)) != $true) & (((s @ X6)) = $true)) & (! [X0 : $i] : ((((cP @ X0)) = $true) | ? [X1 : $i] : ((((cP @ X1)) != $true) & ((((cR @ X0 @ X1)) = $true) & (((s @ X1)) = $true)))) & ! [X3 : ($i > $o),X2 : $i] : ((((X3 @ X2)) != $true) | ? [X4 : $i] : (! [X5 : $i] : ((((cR @ X4 @ X5)) != $true) | (((X3 @ X5)) != $true)) & (((X3 @ X4)) = $true))))),
% 0.21/0.30 inference(ennf_transformation,[],[f5])).
% 0.21/0.30 thf(f7,plain,(
% 0.21/0.30 ! [X0 : $i] : ((((cP @ X0)) = $true) | ? [X1 : $i] : ((((cP @ X1)) != $true) & (((cR @ X0 @ X1)) = $true) & (((s @ X1)) = $true))) & ! [X3 : ($i > $o),X2 : $i] : ((((X3 @ X2)) != $true) | ? [X4 : $i] : (! [X5 : $i] : ((((cR @ X4 @ X5)) != $true) | (((X3 @ X5)) != $true)) & (((X3 @ X4)) = $true))) & ? [X6 : $i] : ((((cP @ X6)) != $true) & (((s @ X6)) = $true))),
% 0.21/0.30 inference(flattening,[],[f6])).
% 0.21/0.30 thf(f8,plain,(
% 0.21/0.30 ! [X0 : $i] : ((((cP @ X0)) = $true) | ? [X1 : $i] : ((((cP @ X1)) != $true) & (((cR @ X0 @ X1)) = $true) & (((s @ X1)) = $true))) & ! [X2 : ($i > $o),X3 : $i] : ((((X2 @ X3)) != $true) | ? [X4 : $i] : (! [X5 : $i] : ((((cR @ X4 @ X5)) != $true) | (((X2 @ X5)) != $true)) & (((X2 @ X4)) = $true))) & ? [X6 : $i] : ((((cP @ X6)) != $true) & (((s @ X6)) = $true))),
% 0.21/0.30 inference(rectify,[],[f7])).
% 0.21/0.30 thf(f9,plain,(
% 0.21/0.30 ! [X0 : $i] : ((((cP @ X0)) = $true) | ((((cP @ (sK0 @ X0))) != $true) & (((cR @ X0 @ (sK0 @ X0))) = $true) & (((s @ (sK0 @ X0))) = $true))) & ! [X2 : ($i > $o),X3 : $i] : ((((X2 @ X3)) != $true) | (! [X5 : $i] : ((((cR @ (sK1 @ X2) @ X5)) != $true) | (((X2 @ X5)) != $true)) & (((X2 @ (sK1 @ X2))) = $true))) & ((((cP @ sK2)) != $true) & (((s @ sK2)) = $true))),
% 0.21/0.30 inference(skolemize,[status(esa),new_symbols(skolem,[vAPP,vAPP,sK2]),skolemize(X4,sK1 @ X2),skolemize(X4,sK1 @ X2),skolemize(X6,sK2)],[f8])).
% 0.21/0.30 thf(f11,plain,(
% 0.21/0.30 (((cP @ sK2)) != $true)),
% 0.21/0.30 inference(cnf_transformation,[],[f9])).
% 0.21/0.30 thf(f12,plain,(
% 0.21/0.30 ( ! [X2 : ($i > $o),X3 : $i] : ((((X2 @ X3)) != $true) | (((X2 @ (sK1 @ X2))) = $true)) )),
% 0.21/0.30 inference(cnf_transformation,[],[f9])).
% 0.21/0.30 thf(f13,plain,(
% 0.21/0.30 ( ! [X2 : ($i > $o),X3 : $i,X5 : $i] : ((((cR @ (sK1 @ X2) @ X5)) != $true) | (((X2 @ X3)) != $true) | (((X2 @ X5)) != $true)) )),
% 0.21/0.30 inference(cnf_transformation,[],[f9])).
% 0.21/0.30 thf(f15,plain,(
% 0.21/0.30 ( ! [X0 : $i] : ((((cR @ X0 @ (sK0 @ X0))) = $true) | (((cP @ X0)) = $true)) )),
% 0.21/0.30 inference(cnf_transformation,[],[f9])).
% 0.21/0.30 thf(f16,plain,(
% 0.21/0.30 ( ! [X0 : $i] : ((((cP @ (sK0 @ X0))) != $true) | (((cP @ X0)) = $true)) )),
% 0.21/0.30 inference(cnf_transformation,[],[f9])).
% 0.21/0.30 thf(f21,plain,(
% 0.21/0.30 ( ! [X3 : $i,X4 : ($i > $o)] : (((((^[Y0 : $i]: (~ (X4 @ Y0))) @ (sK1 @ (^[Y0 : $i]: (~ (X4 @ Y0)))))) = $true) | ($true != (((^[Y0 : $i]: (~ (X4 @ Y0))) @ X3)))) )),
% 0.21/0.30 inference(primitive_instantiation,[],[f12])).
% 0.21/0.30 thf(f30,plain,(
% 0.21/0.30 ( ! [X3 : $i,X4 : ($i > $o)] : ((((~ (X4 @ (sK1 @ (^[Y0 : $i]: (~ (X4 @ Y0))))))) = $true) | (((~ (X4 @ X3))) != $true)) )),
% 0.21/0.30 inference(beta-eta_normalization,[],[f21])).
% 0.21/0.30 thf(f31,plain,(
% 0.21/0.30 ( ! [X3 : $i,X4 : ($i > $o)] : ((((~ (X4 @ X3))) != $true) | ($false = ((X4 @ (sK1 @ (^[Y0 : $i]: (~ (X4 @ Y0)))))))) )),
% 0.21/0.30 inference(not_proxy_clausification,[],[f30])).
% 0.21/0.30 thf(f32,plain,(
% 0.21/0.30 ( ! [X3 : $i,X4 : ($i > $o)] : ((((X4 @ X3)) = $true) | ($false = ((X4 @ (sK1 @ (^[Y0 : $i]: (~ (X4 @ Y0)))))))) )),
% 0.21/0.30 inference(not_proxy_clausification,[],[f31])).
% 0.21/0.30 thf(f67,plain,(
% 0.21/0.30 ( ! [X0 : ($i > $o),X1 : $i] : ((((X0 @ (sK0 @ (sK1 @ X0)))) != $true) | (((cP @ (sK1 @ X0))) = $true) | ($true != $true) | (((X0 @ X1)) != $true)) )),
% 0.21/0.30 inference(superposition,[],[f13,f15])).
% 0.21/0.30 thf(f70,plain,(
% 0.21/0.30 ( ! [X0 : ($i > $o),X1 : $i] : ((((X0 @ (sK0 @ (sK1 @ X0)))) != $true) | (((cP @ (sK1 @ X0))) = $true) | (((X0 @ X1)) != $true)) )),
% 0.21/0.30 inference(trivial_inequality_removal,[],[f67])).
% 0.21/0.30 thf(f139,plain,(
% 0.21/0.30 ( ! [X2 : ($i > $o),X1 : $i] : (((((^[Y0 : $i]: (~ (X2 @ Y0))) @ (sK0 @ (sK1 @ (^[Y0 : $i]: (~ (X2 @ Y0))))))) != $true) | ((((^[Y0 : $i]: (~ (X2 @ Y0))) @ X1)) != $true) | (((cP @ (sK1 @ (^[Y0 : $i]: (~ (X2 @ Y0)))))) = $true)) )),
% 0.21/0.30 inference(primitive_instantiation,[],[f70])).
% 0.21/0.30 thf(f154,plain,(
% 0.21/0.30 ( ! [X2 : ($i > $o),X1 : $i] : ((((~ (X2 @ (sK0 @ (sK1 @ (^[Y0 : $i]: (~ (X2 @ Y0)))))))) != $true) | (((~ (X2 @ X1))) != $true) | (((cP @ (sK1 @ (^[Y0 : $i]: (~ (X2 @ Y0)))))) = $true)) )),
% 0.21/0.30 inference(beta-eta_normalization,[],[f139])).
% 0.21/0.30 thf(f155,plain,(
% 0.21/0.30 ( ! [X2 : ($i > $o),X1 : $i] : ((((X2 @ (sK0 @ (sK1 @ (^[Y0 : $i]: (~ (X2 @ Y0))))))) = $true) | (((~ (X2 @ X1))) != $true) | (((cP @ (sK1 @ (^[Y0 : $i]: (~ (X2 @ Y0)))))) = $true)) )),
% 0.21/0.30 inference(not_proxy_clausification,[],[f154])).
% 0.21/0.30 thf(f156,plain,(
% 0.21/0.30 ( ! [X2 : ($i > $o),X1 : $i] : ((((X2 @ (sK0 @ (sK1 @ (^[Y0 : $i]: (~ (X2 @ Y0))))))) = $true) | (((X2 @ X1)) = $true) | (((cP @ (sK1 @ (^[Y0 : $i]: (~ (X2 @ Y0)))))) = $true)) )),
% 0.21/0.30 inference(not_proxy_clausification,[],[f155])).
% 0.21/0.30 thf(f291,plain,(
% 0.21/0.30 ( ! [X0 : $i] : (($true != $true) | (((cP @ (sK1 @ (^[Y0 : $i]: (~ (cP @ Y0)))))) = $true) | (((cP @ (sK1 @ (^[Y0 : $i]: (~ (cP @ Y0)))))) = $true) | (((cP @ X0)) = $true)) )),
% 0.21/0.30 inference(superposition,[],[f16,f156])).
% 0.21/0.30 thf(f346,plain,(
% 0.21/0.30 ( ! [X0 : $i] : ((((cP @ X0)) = $true) | (((cP @ (sK1 @ (^[Y0 : $i]: (~ (cP @ Y0)))))) = $true) | ($true != $true)) )),
% 0.21/0.30 inference(duplicate_literal_removal,[],[f291])).
% 0.21/0.30 thf(f347,plain,(
% 0.21/0.30 ( ! [X0 : $i] : ((((cP @ (sK1 @ (^[Y0 : $i]: (~ (cP @ Y0)))))) = $true) | (((cP @ X0)) = $true)) )),
% 0.21/0.30 inference(trivial_inequality_removal,[],[f346])).
% 0.21/0.30 thf(f369,plain,(
% 0.21/0.30 ( ! [X0 : $i] : (($false = $true) | ($false = $true) | (((cP @ X0)) = $true)) )),
% 0.21/0.30 inference(superposition,[],[f347,f32])).
% 0.21/0.30 thf(f380,plain,(
% 0.21/0.30 ( ! [X0 : $i] : (($false = $true) | (((cP @ X0)) = $true)) )),
% 0.21/0.30 inference(duplicate_literal_removal,[],[f369])).
% 0.21/0.30 thf(f381,plain,(
% 0.21/0.30 ( ! [X0 : $i] : ((((cP @ X0)) = $true)) )),
% 0.21/0.30 inference(trivial_inequality_removal,[],[f380])).
% 0.21/0.30 thf(f401,plain,(
% 0.21/0.30 ($true != $true)),
% 0.21/0.30 inference(superposition,[],[f11,f381])).
% 0.21/0.30 thf(f403,plain,(
% 0.21/0.30 $false),
% 0.21/0.30 inference(trivial_inequality_removal,[],[f401])).
% 0.21/0.30 % SZS output end Proof for theBenchmark
% 0.21/0.30 % (1826934)------------------------------
% 0.21/0.30 % (1826934)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.30 % (1826934)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.30 % (1826934)CaDiCaL version: 2.1.3
% 0.21/0.30 % (1826934)Termination reason: Refutation
% 0.21/0.30 % (1826934)Time elapsed: 0.015 s
% 0.21/0.30 % (1826934)Peak memory usage: 12 MB
% 0.21/0.30 % (1826934)Instructions burned: 25 (million)
% 0.21/0.30 % (1826914)Success in time 0.056 s
% 0.21/0.30 % Vampire exiting
%------------------------------------------------------------------------------