%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL785_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 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 : Tue Sep 29 12:00:35 PM UTC 2026
% Result : Theorem 0.17s 0.52s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of formulae : 45 ( 28 unt; 0 typ; 1 def)
% Number of atoms : 66 ( 27 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 41 ( 20 ~; 20 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-3 aty)
% Number of functors : 70 ( 70 usr; 20 con; 0-5 aty)
% Number of variables : 31 ( 0 sgn 31 !; 0 ?; 31 :)
% 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)) > fun(X1,fun(X0,X2)) ) ).
tff(func_def_2,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * fun(X0,X1) ) > fun(X0,X2) ) ).
tff(func_def_3,type,
it: fun(dB,bool) ).
tff(func_def_4,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_5,type,
var: nat > dB ).
tff(func_def_6,type,
dB_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,X0)) * fun(dB,X0) * dB ) > X0 ) ).
tff(func_def_7,type,
subst: ( dB * dB * nat ) > dB ).
tff(func_def_8,type,
append:
!>[X0: $tType] : fun(list(X0),fun(list(X0),list(X0))) ).
tff(func_def_9,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_10,type,
foldr:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X1)) * list(X0) * X1 ) > X1 ) ).
tff(func_def_11,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_12,type,
cons:
!>[X0: $tType] : fun(X0,fun(list(X0),list(X0))) ).
tff(func_def_13,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_14,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_15,type,
maps:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,list(X1)) * list(X0) ) > list(X1) ) ).
tff(func_def_16,type,
rotate1:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_17,type,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_18,type,
shift:
!>[X0: $tType] : ( ( fun(nat,X0) * nat * X0 ) > fun(nat,X0) ) ).
tff(func_def_19,type,
fun1: fun(type,fun(type,type)) ).
tff(func_def_20,type,
type_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(type,fun(type,X0)) * type ) > X0 ) ).
tff(func_def_21,type,
typing: ( fun(nat,type) * dB ) > fun(type,bool) ).
tff(func_def_22,type,
typings: ( fun(nat,type) * list(dB) ) > fun(list(type),bool) ).
tff(func_def_23,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_24,type,
fFalse: bool ).
tff(func_def_25,type,
fTrue: bool ).
tff(func_def_26,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_27,type,
t: type ).
tff(func_def_28,type,
t_a: type ).
tff(func_def_29,type,
t1: type ).
tff(func_def_30,type,
a: dB ).
tff(func_def_31,type,
as: list(dB) ).
tff(func_def_32,type,
e: fun(nat,type) ).
tff(func_def_33,type,
ea: fun(nat,type) ).
tff(func_def_34,type,
i: nat ).
tff(func_def_35,type,
ia: nat ).
tff(func_def_36,type,
n: nat ).
tff(func_def_37,type,
rs: list(dB) ).
tff(func_def_38,type,
t2: dB ).
tff(func_def_39,type,
u: dB ).
tff(func_def_40,type,
ua: dB ).
tff(func_def_41,type,
sK0: ( type * dB * dB * fun(nat,type) ) > type ).
tff(func_def_42,type,
sK1:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > X0 ) ).
tff(func_def_43,type,
sK2:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > list(X0) ) ).
tff(func_def_44,type,
sK3:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_45,type,
sK4:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_46,type,
sK5:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_47,type,
sK6:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_48,type,
sK7:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_49,type,
sK8:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_50,type,
sK9:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(func_def_51,type,
sK10: ( list(dB) * dB * dB * dB ) > list(dB) ).
tff(func_def_52,type,
sK11:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_53,type,
sK12:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_54,type,
sK13:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * X0 ) > list(X0) ) ).
tff(func_def_55,type,
sK14:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_56,type,
sK15:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_57,type,
sK16:
!>[X0: $tType] : ( fun(list(X0),bool) > list(X0) ) ).
tff(func_def_58,type,
sK17:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_59,type,
sK18:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_60,type,
sK19:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_61,type,
sK20:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_62,type,
sK21: ( list(type) * dB * list(dB) * fun(nat,type) ) > list(type) ).
tff(func_def_63,type,
sK22: ( list(type) * dB * list(dB) * fun(nat,type) ) > type ).
tff(func_def_64,type,
sK23: ( type * type * list(dB) * fun(nat,type) ) > list(type) ).
tff(func_def_65,type,
sK24: ( type * list(dB) * nat * fun(nat,type) ) > list(type) ).
tff(func_def_66,type,
sK25: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_67,type,
sK26: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(pred_def_1,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_2,type,
pp: bool > $o ).
tff(f2,axiom,
n = i,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_True) ).
tff(f3,axiom,
rs = aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),a),as),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2_Cons) ).
tff(f5,axiom,
pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,var(n),rs)),t)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_4_nT) ).
tff(f23,axiom,
! [X0: $tType,X1: $tType,X2: list(X1),X3: X1,X4: X0,X5: fun(X0,fun(X1,X0))] : ( foldl(X0,X1,X5,X4,aa(list(X1),list(X1),aa(X1,fun(list(X1),list(X1)),cons(X1),X3),X2)) = foldl(X0,X1,X5,aa(X1,X0,aa(X0,fun(X1,X0),X5,X4),X3),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_22_foldl__Cons) ).
tff(f102,axiom,
pp(fTrue),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_pp_2_1_U) ).
tff(f106,axiom,
! [X0: bool,X1: bool] :
( ~ pp(X1)
| ~ pp(X0)
| pp(aa(bool,bool,aa(bool,fun(bool,bool),fconj,X1),X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_fconj_1_1_U) ).
tff(f109,axiom,
~ pp(fFalse),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_fFalse_1_1_U) ).
tff(f110,axiom,
! [X0: bool] :
( ( X0 = fTrue )
| ( X0 = fFalse ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_fFalse_1_1_T) ).
tff(f111,conjecture,
pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,var(n)),a),as)),t)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f112,negated_conjecture,
~ pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,var(n)),a),as)),t)),
inference(negated_conjecture,[status(cth)],[f111]) ).
tff(f113,plain,
~ pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,var(n)),a),as)),t)),
inference(flattening,[],[f112]) ).
tff(f223,plain,
n = i,
inference(cnf_transformation,[],[f2]) ).
tff(f224,plain,
rs = aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),a),as),
inference(cnf_transformation,[],[f3]) ).
tff(f226,plain,
pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,var(n),rs)),t)),
inference(cnf_transformation,[],[f5]) ).
tff(f252,plain,
! [X1: $tType,X0: $tType,X2: list(X1),X3: X1,X4: X0,X5: fun(X0,fun(X1,X0))] : ( foldl(X0,X1,X5,X4,aa(list(X1),list(X1),aa(X1,fun(list(X1),list(X1)),cons(X1),X3),X2)) = foldl(X0,X1,X5,aa(X1,X0,aa(X0,fun(X1,X0),X5,X4),X3),X2) ),
inference(cnf_transformation,[],[f23]) ).
tff(f391,plain,
pp(fTrue),
inference(cnf_transformation,[],[f102]) ).
tff(f395,plain,
! [X0: bool,X1: bool] :
( ~ pp(X1)
| ~ pp(X0)
| pp(aa(bool,bool,aa(bool,fun(bool,bool),fconj,X1),X0)) ),
inference(cnf_transformation,[],[f106]) ).
tff(f398,plain,
~ pp(fFalse),
inference(cnf_transformation,[],[f109]) ).
tff(f399,plain,
! [X0: bool] :
( ( fTrue = X0 )
| ( fFalse = X0 ) ),
inference(cnf_transformation,[],[f110]) ).
tff(f400,plain,
~ pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,var(n)),a),as)),t)),
inference(cnf_transformation,[],[f113]) ).
tff(f401,plain,
pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,var(i),rs)),t)),
inference(definition_unfolding,[],[f226,f223]) ).
tff(f407,plain,
~ pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,var(i)),a),as)),t)),
inference(definition_unfolding,[],[f400,f223]) ).
tff(f421,plain,
! [X0: bool,X1: bool] :
( ( X0 = X1 )
| ( fFalse = X1 )
| ( fFalse = X0 ) ),
inference(superposition,[],[f399,f399]) ).
tff(f423,plain,
( ~ pp(fTrue)
| ( fFalse = aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,var(i)),a),as)),t) ) ),
inference(superposition,[],[f407,f399]) ).
tff(f429,definition,
( spl27_1
<=> ! [X0: bool] : ( fFalse = X0 ) ),
introduced(definition,[new_symbols(definition,[spl27_1])],[avatar_definition]) ).
tff(f430,plain,
( ! [X0: bool] : ( fFalse = X0 )
| ~ spl27_1 ),
inference(avatar_component_clause,[],[f429]) ).
tff(f436,plain,
fFalse = aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,var(i)),a),as)),t),
inference(forward_subsumption_resolution,[],[f423,f391]) ).
tff(f437,plain,
fFalse = aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,var(i),aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),a),as))),t),
inference(forward_demodulation,[],[f436,f252]) ).
tff(f510,plain,
! [X0: bool,X1: bool] :
( ~ pp(X0)
| ( X0 = X1 )
| ( fFalse = X1 ) ),
inference(superposition,[],[f398,f421]) ).
tff(f1154,plain,
! [X0: bool] :
( ~ pp(X0)
| pp(aa(bool,bool,aa(bool,fun(bool,bool),fconj,aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,var(i),rs)),t)),X0)) ),
inference(resolution,[],[f401,f395]) ).
tff(f1155,plain,
! [X0: bool] :
( ( aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,var(i),rs)),t) = X0 )
| ( fFalse = X0 ) ),
inference(resolution,[],[f401,f510]) ).
tff(f1166,plain,
! [X0: bool] :
( ( aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,var(i),aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),a),as))),t) = X0 )
| ( fFalse = X0 ) ),
inference(forward_demodulation,[],[f1155,f224]) ).
tff(f1167,plain,
! [X0: bool] :
( pp(aa(bool,bool,aa(bool,fun(bool,bool),fconj,aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,var(i),aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),a),as))),t)),X0))
| ~ pp(X0) ),
inference(forward_demodulation,[],[f1154,f224]) ).
tff(f1172,plain,
! [X0: bool] :
( ( fFalse = X0 )
| ( fFalse = X0 ) ),
inference(forward_demodulation,[],[f1166,f437]) ).
tff(f1173,plain,
! [X0: bool] : ( fFalse = X0 ),
inference(duplicate_literal_removal,[],[f1172]) ).
tff(f1174,plain,
! [X0: bool] :
( ~ pp(X0)
| pp(aa(bool,bool,aa(bool,fun(bool,bool),fconj,fFalse),X0)) ),
inference(forward_demodulation,[],[f1167,f437]) ).
tff(f1179,plain,
spl27_1,
inference(avatar_split_clause,[],[f1173,f429]) ).
tff(f1180,plain,
pp(aa(bool,bool,aa(bool,fun(bool,bool),fconj,fFalse),fTrue)),
inference(resolution,[],[f1174,f391]) ).
tff(f1204,plain,
( pp(fFalse)
| ~ spl27_1 ),
inference(forward_demodulation,[],[f1180,f430]) ).
tff(f1227,plain,
( $false
| ~ spl27_1 ),
inference(forward_subsumption_resolution,[],[f1204,f398]) ).
tff(f1228,plain,
~ spl27_1,
inference(avatar_contradiction_clause,[],[f1227]) ).
cnf(s27,plain,
spl27_1,
inference(sat_conversion,[],[f1179]) ).
cnf(s41,plain,
~ spl27_1,
inference(sat_conversion,[],[f1228]) ).
cnf(s42,plain,
$false,
inference(rat,[],[s27,s41]) ).
tff(f1229,plain,
$false,
inference(avatar_sat_refutation,[],[s42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL785_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 % Computer : n005.cluster.edu
% 0.11/0.40 % Model : x86_64 x86_64
% 0.11/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.40 % Memory : 8046.5625MB
% 0.11/0.40 % OS : Linux 6.8.0-71-generic
% 0.11/0.40 % CPULimit : 300
% 0.11/0.40 % WCLimit : 300
% 0.11/0.40 % DateTime : Sun Sep 27 16:49:17 UTC 2026
% 0.11/0.41 % CPUTime :
% 0.11/0.41 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.44 Running first-order model finding
% 0.11/0.44 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.17/0.52 % (10123)Will run a generic schedule for satisfiability detection.
% 0.17/0.52 % (10134)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1932762168:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.52 % (10129)% WARNING: option uhcvi not known.
% 0.17/0.52 % (10128)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3133827687_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.52 % (10131)dis+10_1_sil=32000:sp=arity:random_seed=760073795:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.52 % (10130)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=868536167:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.52 % (10129)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3924193427:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.52 % (10132)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1390271599:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.52 % (10133)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2175400447:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.52 % Exception at run slice level
% 0.17/0.52 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.17/0.52 % (10142)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1838067229:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.17/0.52 % Exception at run slice level
% 0.17/0.52 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.17/0.52 % (10134)Instruction limit reached!
% 0.17/0.52 % (10134)------------------------------
% 0.17/0.52 % (10134)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.52 % (10134)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.52 % (10134)CaDiCaL version: 2.1.3
% 0.17/0.52 % (10134)Termination reason: Instruction limit
% 0.17/0.52 % (10134)Termination phase: Saturation
% 0.17/0.52 % (10134)Time elapsed: 0.042 s
% 0.17/0.52 % (10134)Peak memory usage: 13 MB
% 0.17/0.52 % (10134)Instructions burned: 162 (million)
% 0.17/0.52 % (10133) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-10123-10133"...
% 0.17/0.52 % (10133)...printing done.
% 0.17/0.52 % (10133)Refutation found. Thanks to Tanya!
% 0.17/0.52 % SZS status Theorem for theBenchmark
% 0.17/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.52 % (10133)------------------------------
% 0.17/0.52 % (10133)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.52 % (10133)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.52 % (10133)CaDiCaL version: 2.1.3
% 0.17/0.52 % (10133)Termination reason: Refutation
% 0.17/0.52 % (10133)Time elapsed: 0.037 s
% 0.17/0.52 % (10133)Peak memory usage: 13 MB
% 0.17/0.52 % (10133)Instructions burned: 66 (million)
% 0.17/0.52 % (10123)Success in time 0.074 s
% 0.17/0.52 % Vampire exiting
%------------------------------------------------------------------------------