%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL787_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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 11:56:35 AM UTC 2026
% Result : Theorem 2.67s 1.29s
% Output : Refutation 3.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 44 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 42 ( 22 ~; 14 |; 2 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 2 prp; 0-3 aty)
% Number of functors : 63 ( 63 usr; 24 con; 0-5 aty)
% Number of variables : 29 ( 28 !; 1 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
dB: $tType ).
tff(type_def_7,type,
list: $tType > $tType ).
tff(type_def_8,type,
nat: $tType ).
tff(type_def_9,type,
type: $tType ).
tff(type_def_10,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
combb:
!>[X0: $tType,X1: $tType,X2: $tType] : fun(fun(X0,X1),fun(fun(X2,X0),fun(X2,X1))) ).
tff(func_def_1,type,
combc:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * X1 ) > fun(X0,X2) ) ).
tff(func_def_2,type,
combi:
!>[X0: $tType] : fun(X0,X0) ).
tff(func_def_3,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : fun(fun(X0,fun(X1,X2)),fun(fun(X0,X1),fun(X0,X2))) ).
tff(func_def_4,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_5,type,
it: fun(dB,bool) ).
tff(func_def_6,type,
abs: dB > dB ).
tff(func_def_7,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_8,type,
var: nat > dB ).
tff(func_def_9,type,
dB_size: dB > nat ).
tff(func_def_10,type,
lift: fun(dB,fun(nat,dB)) ).
tff(func_def_11,type,
subst: fun(dB,fun(dB,fun(nat,dB))) ).
tff(func_def_12,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_13,type,
foldr:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X1)) * list(X0) * X1 ) > X1 ) ).
tff(func_def_14,type,
cons:
!>[X0: $tType] : fun(X0,fun(list(X0),list(X0))) ).
tff(func_def_15,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_16,type,
listset:
!>[X0: $tType] : ( list(fun(X0,bool)) > fun(list(X0),bool) ) ).
tff(func_def_17,type,
map:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * list(X0) ) > list(X1) ) ).
tff(func_def_18,type,
set_Cons:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(list(X0),bool) ) > fun(list(X0),bool) ) ).
tff(func_def_19,type,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_20,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_21,type,
collect:
!>[X0: $tType] : ( fun(X0,bool) > fun(X0,bool) ) ).
tff(func_def_22,type,
shift:
!>[X0: $tType] : ( ( fun(nat,X0) * nat * X0 ) > fun(nat,X0) ) ).
tff(func_def_23,type,
atom: nat > type ).
tff(func_def_24,type,
fun1: fun(type,fun(type,type)) ).
tff(func_def_25,type,
type_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(type,fun(type,X0)) * type ) > X0 ) ).
tff(func_def_26,type,
type_size: type > nat ).
tff(func_def_27,type,
typing: fun(nat,type) > fun(dB,fun(type,bool)) ).
tff(func_def_28,type,
typings: ( fun(nat,type) * list(dB) ) > fun(list(type),bool) ).
tff(func_def_29,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_30,type,
fEx:
!>[X0: $tType] : fun(fun(X0,bool),bool) ).
tff(func_def_31,type,
fFalse: bool ).
tff(func_def_32,type,
fTrue: bool ).
tff(func_def_33,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_34,type,
fequal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_35,type,
member:
!>[X0: $tType] : fun(X0,fun(fun(X0,bool),bool)) ).
tff(func_def_36,type,
t1: type ).
tff(func_def_37,type,
t_a: type ).
tff(func_def_38,type,
t: type ).
tff(func_def_39,type,
ts: list(type) ).
tff(func_def_40,type,
a: dB ).
tff(func_def_41,type,
as: list(dB) ).
tff(func_def_42,type,
e: fun(nat,type) ).
tff(func_def_43,type,
ea: fun(nat,type) ).
tff(func_def_44,type,
i: nat ).
tff(func_def_45,type,
ia: nat ).
tff(func_def_46,type,
n: nat ).
tff(func_def_47,type,
rs: list(dB) ).
tff(func_def_48,type,
t2: dB ).
tff(func_def_49,type,
u: dB ).
tff(func_def_50,type,
ua: dB ).
tff(func_def_51,type,
sK0: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_52,type,
sK1: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_53,type,
sK2: ( type * list(dB) * nat * fun(nat,type) ) > list(type) ).
tff(func_def_54,type,
sK3: ( type * type * list(dB) * fun(nat,type) ) > list(type) ).
tff(func_def_55,type,
sK4: ( type * dB * dB * fun(nat,type) ) > type ).
tff(func_def_56,type,
sK5:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_57,type,
sK6:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_58,type,
sK7:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_59,type,
sK8:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(func_def_60,type,
sK9: list(type) ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
beta: ( dB * dB ) > $o ).
tff(pred_def_3,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_4,type,
pp: bool > $o ).
tff(f2,axiom,
n = i,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_True) ).
tff(f4,axiom,
pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),aa(dB,dB,aa(dB,fun(dB,dB),app,var(n)),a)),foldr(type,type,fun1,ts,t1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_headT) ).
tff(f31,axiom,
! [X0: type,X1: dB,X2: dB,X3: fun(nat,type)] :
( pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),aa(dB,dB,aa(dB,fun(dB,dB),app,X2),X1)),X0))
=> ~ ! [X4: type] :
( pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),X2),aa(type,type,aa(type,fun(type,type),fun1,X4),X0)))
=> ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),X1),X4)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_30_typing__elims_I2_J) ).
tff(f115,axiom,
! [X0: type] :
( pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),var(n)),aa(type,type,aa(type,fun(type,type),fun1,X0),foldr(type,type,fun1,ts,t1))))
=> ( pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),a),X0))
=> thesis ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f116,conjecture,
thesis,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).
tff(f117,negated_conjecture,
~ thesis,
inference(negated_conjecture,[status(cth)],[f116]) ).
tff(f118,plain,
~ thesis,
inference(flattening,[],[f117]) ).
tff(f119,plain,
! [X0: type] :
( thesis
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),a),X0))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),var(n)),aa(type,type,aa(type,fun(type,type),fun1,X0),foldr(type,type,fun1,ts,t1)))) ),
inference(ennf_transformation,[],[f115]) ).
tff(f120,plain,
! [X0: type] :
( thesis
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),a),X0))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),var(n)),aa(type,type,aa(type,fun(type,type),fun1,X0),foldr(type,type,fun1,ts,t1)))) ),
inference(flattening,[],[f119]) ).
tff(f131,plain,
! [X0: type,X1: dB,X2: dB,X3: fun(nat,type)] :
( ? [X4: type] :
( pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),X1),X4))
& pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),X2),aa(type,type,aa(type,fun(type,type),fun1,X4),X0))) )
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),aa(dB,dB,aa(dB,fun(dB,dB),app,X2),X1)),X0)) ),
inference(ennf_transformation,[],[f31]) ).
tff(f153,plain,
! [X0: type,X1: dB,X2: dB,X3: fun(nat,type)] :
( ( pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),X1),sK4(X0,X1,X2,X3)))
& pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),X2),aa(type,type,aa(type,fun(type,type),fun1,sK4(X0,X1,X2,X3)),X0))) )
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),aa(dB,dB,aa(dB,fun(dB,dB),app,X2),X1)),X0)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X4,sK4(X0,X1,X2,X3))],[f131]) ).
tff(f169,plain,
! [X0: type] :
( thesis
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),a),X0))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),var(n)),aa(type,type,aa(type,fun(type,type),fun1,X0),foldr(type,type,fun1,ts,t1)))) ),
inference(cnf_transformation,[],[f120]) ).
tff(f170,plain,
~ thesis,
inference(cnf_transformation,[],[f118]) ).
tff(f188,plain,
! [X2: dB,X3: fun(nat,type),X0: type,X1: dB] :
( pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),X2),aa(type,type,aa(type,fun(type,type),fun1,sK4(X0,X1,X2,X3)),X0)))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),aa(dB,dB,aa(dB,fun(dB,dB),app,X2),X1)),X0)) ),
inference(cnf_transformation,[],[f153]) ).
tff(f189,plain,
! [X2: dB,X3: fun(nat,type),X0: type,X1: dB] :
( ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),aa(dB,dB,aa(dB,fun(dB,dB),app,X2),X1)),X0))
| pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),X1),sK4(X0,X1,X2,X3))) ),
inference(cnf_transformation,[],[f153]) ).
tff(f197,plain,
pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),aa(dB,dB,aa(dB,fun(dB,dB),app,var(n)),a)),foldr(type,type,fun1,ts,t1))),
inference(cnf_transformation,[],[f4]) ).
tff(f198,plain,
n = i,
inference(cnf_transformation,[],[f2]) ).
tff(f237,plain,
! [X0: type] :
( thesis
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),a),X0))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),var(i)),aa(type,type,aa(type,fun(type,type),fun1,X0),foldr(type,type,fun1,ts,t1)))) ),
inference(definition_unfolding,[],[f169,f198]) ).
tff(f238,plain,
pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),aa(dB,dB,aa(dB,fun(dB,dB),app,var(i)),a)),foldr(type,type,fun1,ts,t1))),
inference(definition_unfolding,[],[f197,f198]) ).
tff(f325,plain,
pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),a),sK4(foldr(type,type,fun1,ts,t1),a,var(i),shift(type,e,i,t)))),
inference(resolution,[],[f189,f238]) ).
tff(f357,plain,
! [X0: type] :
( ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),var(i)),aa(type,type,aa(type,fun(type,type),fun1,X0),foldr(type,type,fun1,ts,t1))))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),a),X0)) ),
inference(forward_subsumption_resolution,[],[f237,f170]) ).
tff(f358,plain,
! [X0: dB] :
( ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),aa(dB,dB,aa(dB,fun(dB,dB),app,var(i)),X0)),foldr(type,type,fun1,ts,t1)))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),a),sK4(foldr(type,type,fun1,ts,t1),X0,var(i),shift(type,e,i,t)))) ),
inference(resolution,[],[f357,f188]) ).
tff(f360,plain,
~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),a),sK4(foldr(type,type,fun1,ts,t1),a,var(i),shift(type,e,i,t)))),
inference(resolution,[],[f358,f238]) ).
tff(f362,plain,
$false,
inference(forward_subsumption_resolution,[],[f360,f325]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL787_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n013.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 16:50:07 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.67/1.29 % (413342)Detected formulas, will run a generic FOF schedule.
% 2.67/1.29 % (413350)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1563671388:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.67/1.29 % (413350)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.67/1.29 % (413350)Refutation not found, incomplete strategy
% 2.67/1.29 % (413350)------------------------------
% 2.67/1.29 % (413350)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.67/1.29 % (413350)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.67/1.29 % (413350)CaDiCaL version: 2.1.3
% 2.67/1.29 % (413350)Termination reason: Refutation not found, incomplete strategy
% 2.67/1.29 % (413350)Time elapsed: 0.003 s
% 2.67/1.29 % (413350)Peak memory usage: 88 MB
% 2.67/1.29 % (413350)Instructions burned: 6 (million)
% 2.67/1.29 % (413352)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2319165218:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.67/1.29 % (413351)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1958383859:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.67/1.29 % (413347)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1806467270:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.67/1.29 % (413348)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3530491656:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.67/1.29 % (413353)dis-21_1_sil=8000:lcm=predicate:random_seed=2528473023:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.67/1.29 % (413349)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=3971947286:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.67/1.29 % (413349)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.67/1.29 % (413351)First to succeed.
% 2.67/1.29 % (413351)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-413342"
% 2.67/1.29 % (413353)Also succeeded, but the first one will report.
% 2.67/1.29 % (413352)Instruction limit reached!
% 2.67/1.29 % (413352)------------------------------
% 2.67/1.29 % (413352)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.67/1.29 % (413352)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.67/1.29 % (413352)CaDiCaL version: 2.1.3
% 2.67/1.29 % (413352)Termination reason: Instruction limit
% 2.67/1.29 % (413352)Termination phase: Saturation
% 2.67/1.29 % (413352)Time elapsed: 0.083 s
% 2.67/1.29 % (413352)Peak memory usage: 89 MB
% 2.67/1.29 % (413352)Instructions burned: 141 (million)
% 2.67/1.29 % (413350)------------------------------
% 2.67/1.29 % (413350)------------------------------
% 2.67/1.29 % (413361)lrs+10_1_sil=8000:sp=occurrence:random_seed=3947912654:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.67/1.29 % (413362)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3054895461:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.67/1.29 % (413362)Refutation not found, incomplete strategy
% 2.67/1.29 % (413362)------------------------------
% 2.67/1.29 % (413362)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.67/1.29 % (413362)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.67/1.29 % (413362)CaDiCaL version: 2.1.3
% 2.67/1.29 % (413362)Termination reason: Refutation not found, incomplete strategy
% 2.67/1.29 % (413362)Time elapsed: 0.001 s
% 2.67/1.29 % (413362)Peak memory usage: 87 MB
% 2.67/1.29 % (413362)Instructions burned: 4 (million)
% 2.67/1.29 % (413361)Also succeeded, but the first one will report.
% 2.67/1.29 % (413351)Refutation found. Thanks to Tanya!
% 2.67/1.29 % SZS status Theorem for theBenchmark
% 2.67/1.29 % SZS output start Proof for theBenchmark
% See solution above
% 3.61/1.48 % (413351)------------------------------
% 3.61/1.48 % (413351)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.61/1.48 % (413351)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.61/1.48 % (413351)CaDiCaL version: 2.1.3
% 3.61/1.48 % (413351)Termination reason: Refutation
% 3.61/1.48 % (413351)Time elapsed: 0.018 s
% 3.61/1.48 % (413351)Peak memory usage: 89 MB
% 3.61/1.48 % (413351)Instructions burned: 27 (million)
% 3.61/1.48 % (413351)------------------------------
% 3.61/1.48 % (413351)------------------------------
% 3.61/1.48 % (413342)Success in time 0.441 s
% 3.61/1.48 % Vampire exiting
%------------------------------------------------------------------------------