%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL788_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n014.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:36 PM UTC 2026
% Result : Theorem 1.37s 0.78s
% Output : Refutation 1.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 35 ( 28 unt; 0 typ; 3 def)
% Number of atoms : 42 ( 31 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 16 ( 9 ~; 5 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of FOOLs : 1 ( 1 fml; 0 var)
% Number of types : 5 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 80 ( 80 usr; 29 con; 0-6 aty)
% Number of variables : 44 ( 44 !; 0 ?; 44 :)
% 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,
fun1: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
combb:
!>[X0: $tType,X1: $tType,X2: $tType] : fun1(fun1(X0,X1),fun1(fun1(X2,X0),fun1(X2,X1))) ).
tff(func_def_1,type,
combc:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun1(X0,fun1(X1,X2)) * X1 ) > fun1(X0,X2) ) ).
tff(func_def_2,type,
combi:
!>[X0: $tType] : fun1(X0,X0) ).
tff(func_def_3,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : fun1(fun1(X0,fun1(X1,X2)),fun1(fun1(X0,X1),fun1(X0,X2))) ).
tff(func_def_4,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_5,type,
it: fun1(dB,bool) ).
tff(func_def_6,type,
abs: dB > dB ).
tff(func_def_7,type,
app: fun1(dB,fun1(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: fun1(dB,fun1(nat,dB)) ).
tff(func_def_11,type,
subst: fun1(dB,fun1(dB,fun1(nat,dB))) ).
tff(func_def_12,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun1(X0,fun1(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_13,type,
foldr:
!>[X0: $tType,X1: $tType] : ( ( fun1(X0,fun1(X1,X1)) * list(X0) * X1 ) > X1 ) ).
tff(func_def_14,type,
cons:
!>[X0: $tType] : fun1(X0,fun1(list(X0),list(X0))) ).
tff(func_def_15,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun1(X1,fun1(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_16,type,
listset:
!>[X0: $tType] : ( list(fun1(X0,bool)) > fun1(list(X0),bool) ) ).
tff(func_def_17,type,
map:
!>[X0: $tType,X1: $tType] : ( ( fun1(X0,X1) * list(X0) ) > list(X1) ) ).
tff(func_def_18,type,
set_Cons:
!>[X0: $tType] : ( ( fun1(X0,bool) * fun1(list(X0),bool) ) > fun1(list(X0),bool) ) ).
tff(func_def_19,type,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_20,type,
collect:
!>[X0: $tType] : ( fun1(X0,bool) > fun1(X0,bool) ) ).
tff(func_def_21,type,
shift:
!>[X0: $tType] : ( ( fun1(nat,X0) * nat * X0 ) > fun1(nat,X0) ) ).
tff(func_def_22,type,
fun: fun1(type,fun1(type,type)) ).
tff(func_def_23,type,
type_case:
!>[X0: $tType] : ( ( fun1(nat,X0) * fun1(type,fun1(type,X0)) * type ) > X0 ) ).
tff(func_def_24,type,
type_rec:
!>[X0: $tType] : ( ( fun1(nat,X0) * fun1(type,fun1(type,fun1(X0,fun1(X0,X0)))) * type ) > X0 ) ).
tff(func_def_25,type,
typing: fun1(nat,type) > fun1(dB,fun1(type,bool)) ).
tff(func_def_26,type,
typings: ( fun1(nat,type) * list(dB) ) > fun1(list(type),bool) ).
tff(func_def_27,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun1(X0,X1) * X0 ) > X1 ) ).
tff(func_def_28,type,
fEx:
!>[X0: $tType] : fun1(fun1(X0,bool),bool) ).
tff(func_def_29,type,
fFalse: bool ).
tff(func_def_30,type,
fTrue: bool ).
tff(func_def_31,type,
fconj: fun1(bool,fun1(bool,bool)) ).
tff(func_def_32,type,
fequal:
!>[X0: $tType] : fun1(X0,fun1(X0,bool)) ).
tff(func_def_33,type,
member:
!>[X0: $tType] : fun1(X0,fun1(fun1(X0,bool),bool)) ).
tff(func_def_34,type,
t1: type ).
tff(func_def_35,type,
t: type ).
tff(func_def_36,type,
t_a: type ).
tff(func_def_37,type,
t2: type ).
tff(func_def_38,type,
ts: list(type) ).
tff(func_def_39,type,
a: dB ).
tff(func_def_40,type,
as: list(dB) ).
tff(func_def_41,type,
e: fun1(nat,type) ).
tff(func_def_42,type,
ea: fun1(nat,type) ).
tff(func_def_43,type,
i: nat ).
tff(func_def_44,type,
ia: nat ).
tff(func_def_45,type,
n: nat ).
tff(func_def_46,type,
rs: list(dB) ).
tff(func_def_47,type,
t3: dB ).
tff(func_def_48,type,
u: dB ).
tff(func_def_49,type,
ua: dB ).
tff(func_def_50,type,
sK1: type ).
tff(func_def_51,type,
sK2: list(type) ).
tff(func_def_52,type,
sK3: ( type * dB * dB * fun1(nat,type) ) > type ).
tff(func_def_53,type,
sK4: ( type * list(dB) * nat * fun1(nat,type) ) > list(type) ).
tff(func_def_54,type,
sK5: ( type * type * list(dB) * fun1(nat,type) ) > list(type) ).
tff(func_def_55,type,
sK6: ( type * list(dB) * dB * fun1(nat,type) ) > list(type) ).
tff(func_def_56,type,
sK7: ( type * list(dB) * dB * fun1(nat,type) ) > list(type) ).
tff(func_def_57,type,
sK8:
!>[X0: $tType,X1: $tType] : ( fun1(X0,fun1(X1,X0)) > X1 ) ).
tff(func_def_58,type,
sK9:
!>[X0: $tType,X1: $tType] : ( fun1(X0,fun1(X1,X0)) > X1 ) ).
tff(func_def_59,type,
sK10:
!>[X0: $tType,X1: $tType] : ( fun1(X0,fun1(X1,X0)) > X0 ) ).
tff(func_def_60,type,
sK11:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun1(X1,X0) * list(X0) * X0 ) > X1 ) ).
tff(func_def_61,type,
sK12:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun1(X1,X0) * list(X0) * X0 ) > list(X1) ) ).
tff(func_def_62,type,
sK13:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun1(X0,X1) ) > X0 ) ).
tff(func_def_63,type,
sK14:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun1(X0,X1) ) > list(X0) ) ).
tff(func_def_64,type,
sK15:
!>[X0: $tType,X1: $tType] : ( ( fun1(X1,X0) * fun1(X1,X0) ) > X1 ) ).
tff(func_def_65,type,
sK16: ( type * dB * fun1(nat,type) ) > type ).
tff(func_def_66,type,
sK17: ( type * dB * fun1(nat,type) ) > type ).
tff(func_def_67,type,
sK18: ( dB * fun1(nat,type) ) > type ).
tff(func_def_68,type,
sK19: ( dB * fun1(nat,type) ) > type ).
tff(func_def_69,type,
sK20: dB > dB ).
tff(func_def_70,type,
sK21: dB > dB ).
tff(func_def_71,type,
sK22: dB > list(dB) ).
tff(func_def_72,type,
sK23: dB > list(dB) ).
tff(func_def_73,type,
sK24: dB > nat ).
tff(func_def_74,type,
sK25: dB > dB ).
tff(func_def_75,type,
sF26: fun1(type,type) ).
tff(func_def_76,type,
sF27: type ).
tff(func_def_77,type,
sF28: 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] : ( ( fun1(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_4,type,
pp: bool > $o ).
tff(pred_def_5,type,
sP0: dB > $o ).
tff(f3,axiom,
pp(aa(type,bool,aa(dB,fun1(type,bool),typing(shift(type,e,i,t2)),var(n)),aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2_varT) ).
tff(f16,axiom,
n = i,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_15_True) ).
tff(f18,axiom,
! [X0: type,X1: nat,X2: fun1(nat,type)] :
( pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X2),var(X1)),X0))
=> ( aa(nat,type,X2,X1) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_17_typing__elims_I1_J) ).
tff(f23,axiom,
! [X0: $tType,X1: X0,X2: fun1(nat,X0),X3: nat,X4: nat] :
( ( X4 = X3 )
=> ( aa(nat,X0,shift(X0,X2,X4,X1),X3) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_22_shift__eq) ).
tff(f105,axiom,
! [X0: $tType,X1: $tType,X2: $tType,X3: X0,X4: X2,X5: fun1(X0,fun1(X2,X1))] : ( aa(X0,X1,combc(X0,X2,X1,X5,X4),X3) = aa(X2,X1,aa(X0,fun1(X2,X1),X5,X3),X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',help_COMBC_1_1_U) ).
tff(f115,conjecture,
t2 = aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f116,negated_conjecture,
( ( ~ t2 ) = aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)) ),
inference(negated_conjecture,[status(cth)],[f115]) ).
tff(f118,plain,
t2 != aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)),
inference(flattening,[],[f116]) ).
tff(f126,plain,
! [X0: type,X1: nat,X2: fun1(nat,type)] :
( ( aa(nat,type,X2,X1) = X0 )
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X2),var(X1)),X0)) ),
inference(ennf_transformation,[],[f18]) ).
tff(f131,plain,
! [X0: $tType,X1: X0,X2: fun1(nat,X0),X3: nat,X4: nat] :
( ( aa(nat,X0,shift(X0,X2,X4,X1),X3) = X1 )
| ( X3 != X4 ) ),
inference(ennf_transformation,[],[f23]) ).
tff(f214,plain,
pp(aa(type,bool,aa(dB,fun1(type,bool),typing(shift(type,e,i,t2)),var(n)),aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)))),
inference(cnf_transformation,[],[f3]) ).
tff(f231,plain,
i = n,
inference(cnf_transformation,[],[f16]) ).
tff(f233,plain,
! [X2: fun1(nat,type),X0: type,X1: nat] :
( ( aa(nat,type,X2,X1) = X0 )
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X2),var(X1)),X0)) ),
inference(cnf_transformation,[],[f126]) ).
tff(f238,plain,
! [X0: $tType,X2: fun1(nat,X0),X3: nat,X1: X0,X4: nat] :
( ( aa(nat,X0,shift(X0,X2,X4,X1),X3) = X1 )
| ( X3 != X4 ) ),
inference(cnf_transformation,[],[f131]) ).
tff(f358,plain,
! [X1: $tType,X0: $tType,X2: $tType,X3: X0,X4: X2,X5: fun1(X0,fun1(X2,X1))] : ( aa(X0,X1,combc(X0,X2,X1,X5,X4),X3) = aa(X2,X1,aa(X0,fun1(X2,X1),X5,X3),X4) ),
inference(cnf_transformation,[],[f105]) ).
tff(f368,plain,
t2 != aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)),
inference(cnf_transformation,[],[f118]) ).
tff(f369,plain,
pp(aa(type,bool,aa(dB,fun1(type,bool),typing(shift(type,e,n,t2)),var(n)),aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)))),
inference(definition_unfolding,[],[f214,f231]) ).
tff(f383,plain,
! [X0: $tType,X2: fun1(nat,X0),X1: X0,X4: nat] : ( aa(nat,X0,shift(X0,X2,X4,X1),X4) = X1 ),
inference(equality_resolution,[],[f238]) ).
tff(f408,definition,
sF26 = aa(type,fun1(type,type),fun,t1),
introduced(definition,[new_symbols(definition,[sF26])],[function_definition]) ).
tff(f409,plain,
aa(type,fun1(type,type),fun,t1) = sF26,
inference(reorient_equations,[],[f408]) ).
tff(f410,definition,
sF27 = foldr(type,type,fun,ts,t),
introduced(definition,[new_symbols(definition,[sF27])],[function_definition]) ).
tff(f411,plain,
foldr(type,type,fun,ts,t) = sF27,
inference(reorient_equations,[],[f410]) ).
tff(f412,definition,
sF28 = aa(type,type,sF26,sF27),
introduced(definition,[new_symbols(definition,[sF28])],[function_definition]) ).
tff(f413,plain,
aa(type,type,sF26,sF27) = sF28,
inference(reorient_equations,[],[f412]) ).
tff(f414,plain,
t2 != sF28,
inference(definition_folding,[],[f368,f413,f411,f409]) ).
tff(f479,plain,
! [X2: fun1(nat,type),X0: type,X1: nat] :
( ~ pp(aa(dB,bool,combc(dB,type,bool,typing(X2),X0),var(X1)))
| ( aa(nat,type,X2,X1) = X0 ) ),
inference(forward_demodulation,[],[f233,f358]) ).
tff(f489,plain,
pp(aa(dB,bool,combc(dB,type,bool,typing(shift(type,e,n,t2)),aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t))),var(n))),
inference(forward_demodulation,[],[f369,f358]) ).
tff(f534,plain,
pp(aa(dB,bool,combc(dB,type,bool,typing(shift(type,e,n,t2)),aa(type,type,aa(type,fun1(type,type),fun,t1),sF27)),var(n))),
inference(forward_demodulation,[],[f489,f411]) ).
tff(f549,plain,
pp(aa(dB,bool,combc(dB,type,bool,typing(shift(type,e,n,t2)),aa(type,type,combc(type,type,type,fun,sF27),t1)),var(n))),
inference(forward_demodulation,[],[f534,f358]) ).
tff(f2881,plain,
! [X0: type] : ( aa(type,type,combc(type,type,type,fun,X0),t1) = aa(type,type,sF26,X0) ),
inference(superposition,[],[f358,f409]) ).
tff(f4551,plain,
aa(type,type,combc(type,type,type,fun,sF27),t1) = aa(nat,type,shift(type,e,n,t2),n),
inference(resolution,[],[f549,f479]) ).
tff(f4603,plain,
t2 = aa(type,type,combc(type,type,type,fun,sF27),t1),
inference(forward_demodulation,[],[f4551,f383]) ).
tff(f4622,plain,
t2 = aa(type,type,sF26,sF27),
inference(forward_demodulation,[],[f4603,f2881]) ).
tff(f4634,plain,
t2 = sF28,
inference(superposition,[],[f413,f4622]) ).
tff(f4635,plain,
$false,
inference(forward_subsumption_resolution,[],[f4634,f414]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL788_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39 % Computer : n014.cluster.edu
% 0.10/0.39 % Model : x86_64 x86_64
% 0.10/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39 % Memory : 8046.5625MB
% 0.10/0.39 % OS : Linux 6.8.0-71-generic
% 0.10/0.39 % CPULimit : 300
% 0.10/0.39 % WCLimit : 300
% 0.10/0.39 % DateTime : Sun Sep 27 16:50:16 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42 Running first-order model finding
% 0.10/0.42 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
% 1.37/0.78 % (1006327)Will run a generic schedule for satisfiability detection.
% 1.37/0.78 % (1006332)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3398250822_2999 on theBenchmark for (2999ds/0Mi)
% 1.37/0.78 % (1006333)% WARNING: option uhcvi not known.
% 1.37/0.78 % Exception at run slice level
% 1.37/0.78 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.37/0.78 % (1006333)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4269111371:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.37/0.78 % (1006334)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=930807327:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.37/0.78 % (1006335)dis+10_1_sil=32000:sp=arity:random_seed=1383922514:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.37/0.78 % (1006336)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=545595430:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.37/0.78 % (1006337)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3405937450:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.37/0.78 % (1006338)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2020038107:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.37/0.78 % (1006340)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=350585962:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.37/0.78 % Exception at run slice level
% 1.37/0.78 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.37/0.78 % (1006348)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2060548558:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.37/0.78 % (1006336)Instruction limit reached!
% 1.37/0.78 % (1006336)------------------------------
% 1.37/0.78 % (1006336)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.37/0.78 % (1006336)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.37/0.78 % (1006336)CaDiCaL version: 2.1.3
% 1.37/0.78 % (1006336)Termination reason: Instruction limit
% 1.37/0.78 % (1006336)Termination phase: Saturation
% 1.37/0.78 % (1006336)Time elapsed: 0.058 s
% 1.37/0.78 % (1006336)Peak memory usage: 12 MB
% 1.37/0.78 % (1006336)Instructions burned: 116 (million)
% 1.37/0.78 % (1006335)Instruction limit reached!
% 1.37/0.78 % (1006335)------------------------------
% 1.37/0.78 % (1006335)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.37/0.78 % (1006335)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.37/0.78 % (1006335)CaDiCaL version: 2.1.3
% 1.37/0.78 % (1006335)Termination reason: Instruction limit
% 1.37/0.78 % (1006335)Termination phase: Saturation
% 1.37/0.78 % (1006335)Time elapsed: 0.059 s
% 1.37/0.78 % (1006335)Peak memory usage: 12 MB
% 1.37/0.78 % (1006335)Instructions burned: 104 (million)
% 1.37/0.78 % (1006348)Instruction limit reached!
% 1.37/0.78 % (1006348)------------------------------
% 1.37/0.78 % (1006348)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.37/0.78 % (1006348)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.37/0.78 % (1006348)CaDiCaL version: 2.1.3
% 1.37/0.78 % (1006348)Termination reason: Instruction limit
% 1.37/0.78 % (1006348)Termination phase: Saturation
% 1.37/0.78 % (1006348)Time elapsed: 0.041 s
% 1.37/0.78 % (1006348)Peak memory usage: 13 MB
% 1.37/0.78 % (1006348)Instructions burned: 134 (million)
% 1.37/0.78 % (1006337)Instruction limit reached!
% 1.37/0.78 % (1006337)------------------------------
% 1.37/0.78 % (1006337)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.37/0.78 % (1006337)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.37/0.78 % (1006337)CaDiCaL version: 2.1.3
% 1.37/0.78 % (1006337)Termination reason: Instruction limit
% 1.37/0.78 % (1006337)Termination phase: Saturation
% 1.37/0.78 % (1006337)Time elapsed: 0.072 s
% 1.37/0.78 % (1006337)Peak memory usage: 12 MB
% 1.37/0.78 % (1006337)Instructions burned: 131 (million)
% 1.37/0.78 % (1006352)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=460886227:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 1.37/0.78 % (1006350)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=3837280972:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.37/0.78 % (1006351)ott-21_1_sil=16000:fs=off:random_seed=1257507299:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.37/0.78 % (1006338)Instruction limit reached!
% 1.37/0.78 % (1006338)------------------------------
% 1.37/0.78 % (1006338)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.37/0.78 % (1006338)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.37/0.78 % (1006338)CaDiCaL version: 2.1.3
% 1.37/0.78 % (1006338)Termination reason: Instruction limit
% 1.37/0.78 % (1006338)Termination phase: Saturation
% 1.37/0.78 % (1006338)Time elapsed: 0.085 s
% 1.37/0.78 % (1006338)Peak memory usage: 13 MB
% 1.37/0.78 % (1006338)Instructions burned: 160 (million)
% 1.37/0.78 % (1006354)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3213678905:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 1.37/0.78 % Exception at run slice level
% 1.37/0.78 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.37/0.78 % (1006357)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3333258499:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 1.37/0.78 % (1006359)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2342262933:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 1.37/0.78 % Exception at run slice level
% 1.37/0.78 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.37/0.78 % (1006362)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=4273842649:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2998 on theBenchmark for (2998ds/692Mi)
% 1.37/0.78 % (1006351)Instruction limit reached!
% 1.37/0.78 % (1006351)------------------------------
% 1.37/0.78 % (1006351)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.37/0.78 % (1006351)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.37/0.78 % (1006351)CaDiCaL version: 2.1.3
% 1.37/0.78 % (1006351)Termination reason: Instruction limit
% 1.37/0.78 % (1006351)Termination phase: Saturation
% 1.37/0.78 % (1006351)Time elapsed: 0.089 s
% 1.37/0.78 % (1006351)Peak memory usage: 13 MB
% 1.37/0.78 % (1006351)Instructions burned: 181 (million)
% 1.37/0.78 % (1006364)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=929907086:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 1.37/0.78 % (1006352)Instruction limit reached!
% 1.37/0.78 % (1006352)------------------------------
% 1.37/0.78 % (1006352)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.37/0.78 % (1006352)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.37/0.78 % (1006352)CaDiCaL version: 2.1.3
% 1.37/0.78 % (1006352)Termination reason: Instruction limit
% 1.37/0.78 % (1006352)Termination phase: Saturation
% 1.37/0.78 % (1006352)Time elapsed: 0.133 s
% 1.37/0.78 % (1006352)Peak memory usage: 13 MB
% 1.37/0.78 % (1006352)Instructions burned: 479 (million)
% 1.37/0.78 % (1006366)fmb+10_1_sil=64000:random_seed=3097760317:i=22061:nm=2:gsp=on_2997 on theBenchmark for (2997ds/22061Mi)
% 1.37/0.78 % (1006366)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 1.37/0.78 % Exception at run slice level
% 1.37/0.78 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.37/0.78 % (1006368)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=1983308111:i=9515:nm=5_2997 on theBenchmark for (2997ds/9515Mi)
% 1.37/0.78 % Exception at run slice level
% 1.37/0.78 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.37/0.78 % (1006370)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=1423831058:fmbsr=1.7:i=920_2997 on theBenchmark for (2997ds/920Mi)
% 1.37/0.78 % Exception at run slice level
% 1.37/0.78 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.37/0.78 % (1006372)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=449509364:i=5131_2997 on theBenchmark for (2997ds/5131Mi)
% 1.37/0.78 % (1006357) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1006327-1006357"...
% 1.37/0.78 % (1006357)...printing done.
% 1.37/0.78 % (1006357)Refutation found. Thanks to Tanya!
% 1.37/0.78 % SZS status Theorem for theBenchmark
% 1.37/0.78 % SZS output start Proof for theBenchmark
% See solution above
% 1.37/0.78 % (1006357)------------------------------
% 1.37/0.78 % (1006357)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.37/0.78 % (1006357)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.37/0.78 % (1006357)CaDiCaL version: 2.1.3
% 1.37/0.78 % (1006357)Termination reason: Refutation
% 1.37/0.78 % (1006357)Time elapsed: 0.190 s
% 1.37/0.78 % (1006357)Peak memory usage: 13 MB
% 1.37/0.78 % (1006357)Instructions burned: 408 (million)
% 1.37/0.78 % (1006327)Success in time 0.349 s
% 1.37/0.78 % Vampire exiting
%------------------------------------------------------------------------------