%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL814_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 : n019.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:42 PM UTC 2026
% Result : Theorem 2.18s 1.04s
% Output : Refutation 2.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 30 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 25 ( 14 ~; 9 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 71 ( 71 usr; 26 con; 0-6 aty)
% Number of variables : 43 ( 43 !; 0 ?; 43 :)
% 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,
collect:
!>[X0: $tType] : ( fun(X0,bool) > fun(X0,bool) ) ).
tff(func_def_20,type,
shift:
!>[X0: $tType] : ( ( fun(nat,X0) * nat * X0 ) > fun(nat,X0) ) ).
tff(func_def_21,type,
fun1: fun(type,fun(type,type)) ).
tff(func_def_22,type,
typing: fun(nat,type) > fun(dB,fun(type,bool)) ).
tff(func_def_23,type,
typings: ( fun(nat,type) * list(dB) ) > fun(list(type),bool) ).
tff(func_def_24,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_25,type,
fEx:
!>[X0: $tType] : fun(fun(X0,bool),bool) ).
tff(func_def_26,type,
fFalse: bool ).
tff(func_def_27,type,
fTrue: bool ).
tff(func_def_28,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_29,type,
fequal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_30,type,
member:
!>[X0: $tType] : fun(X0,fun(fun(X0,bool),bool)) ).
tff(func_def_31,type,
t2: type ).
tff(func_def_32,type,
t1: type ).
tff(func_def_33,type,
t_a: type ).
tff(func_def_34,type,
t: type ).
tff(func_def_35,type,
ts: list(type) ).
tff(func_def_36,type,
a: dB ).
tff(func_def_37,type,
as: list(dB) ).
tff(func_def_38,type,
e: fun(nat,type) ).
tff(func_def_39,type,
ea: fun(nat,type) ).
tff(func_def_40,type,
i: nat ).
tff(func_def_41,type,
ia: nat ).
tff(func_def_42,type,
n: nat ).
tff(func_def_43,type,
rs: list(dB) ).
tff(func_def_44,type,
t3: dB ).
tff(func_def_45,type,
u: dB ).
tff(func_def_46,type,
ua: dB ).
tff(func_def_47,type,
sK0: type ).
tff(func_def_48,type,
sK1: list(type) ).
tff(func_def_49,type,
sK2: ( type * dB * dB * fun(nat,type) ) > type ).
tff(func_def_50,type,
sK3: ( type * list(dB) * nat * fun(nat,type) ) > list(type) ).
tff(func_def_51,type,
sK4: ( type * type * list(dB) * fun(nat,type) ) > list(type) ).
tff(func_def_52,type,
sK5: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_53,type,
sK6: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_54,type,
sK7:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > X0 ) ).
tff(func_def_55,type,
sK8:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > list(X0) ) ).
tff(func_def_56,type,
sK9:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > X1 ) ).
tff(func_def_57,type,
sK10:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > list(X1) ) ).
tff(func_def_58,type,
sK11:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_59,type,
sK12: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_60,type,
sK13: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_61,type,
sK14: ( dB * fun(nat,type) ) > type ).
tff(func_def_62,type,
sK15: ( dB * fun(nat,type) ) > type ).
tff(func_def_63,type,
sK16: dB > dB ).
tff(func_def_64,type,
sK17: dB > dB ).
tff(func_def_65,type,
sK18: dB > list(dB) ).
tff(func_def_66,type,
sK19: dB > dB ).
tff(func_def_67,type,
sK20: dB > list(dB) ).
tff(func_def_68,type,
sK21: dB > nat ).
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(f1,axiom,
pp(aa(type,bool,aa(dB,fun(type,bool),typing(e),u),t)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_uT) ).
tff(f5,axiom,
pp(aa(list(type),bool,typings(shift(type,e,i,t),as),ts)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_4_argsT) ).
tff(f7,axiom,
! [X0: list(type),X1: list(dB),X2: nat,X3: type,X4: dB,X5: fun(nat,type)] :
( pp(aa(type,bool,aa(dB,fun(type,bool),typing(X5),X4),X3))
=> ( pp(aa(list(type),bool,typings(shift(type,X5,X2,X3),X1),X0))
=> pp(aa(list(type),bool,typings(X5,map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,X4),X2),X1)),X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_6_substs__lemma) ).
tff(f105,axiom,
! [X0: $tType,X1: $tType,X2: $tType,X3: X0,X4: X2,X5: fun(X0,fun(X2,X1))] : ( aa(X0,X1,combc(X0,X2,X1,X5,X4),X3) = aa(X2,X1,aa(X0,fun(X2,X1),X5,X3),X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',help_COMBC_1_1_U) ).
tff(f115,conjecture,
pp(aa(list(type),bool,typings(e,map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),as)),ts)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f116,negated_conjecture,
~ pp(aa(list(type),bool,typings(e,map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),as)),ts)),
inference(negated_conjecture,[status(cth)],[f115]) ).
tff(f118,plain,
~ pp(aa(list(type),bool,typings(e,map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),as)),ts)),
inference(flattening,[],[f116]) ).
tff(f119,plain,
! [X0: list(type),X1: list(dB),X2: nat,X3: type,X4: dB,X5: fun(nat,type)] :
( pp(aa(list(type),bool,typings(X5,map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,X4),X2),X1)),X0))
| ~ pp(aa(list(type),bool,typings(shift(type,X5,X2,X3),X1),X0))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(X5),X4),X3)) ),
inference(ennf_transformation,[],[f7]) ).
tff(f120,plain,
! [X0: list(type),X1: list(dB),X2: nat,X3: type,X4: dB,X5: fun(nat,type)] :
( pp(aa(list(type),bool,typings(X5,map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,X4),X2),X1)),X0))
| ~ pp(aa(list(type),bool,typings(shift(type,X5,X2,X3),X1),X0))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(X5),X4),X3)) ),
inference(flattening,[],[f119]) ).
tff(f162,plain,
pp(aa(type,bool,aa(dB,fun(type,bool),typing(e),u),t)),
inference(cnf_transformation,[],[f1]) ).
tff(f166,plain,
pp(aa(list(type),bool,typings(shift(type,e,i,t),as),ts)),
inference(cnf_transformation,[],[f5]) ).
tff(f168,plain,
! [X2: nat,X3: type,X0: list(type),X1: list(dB),X4: dB,X5: fun(nat,type)] :
( ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(X5),X4),X3))
| ~ pp(aa(list(type),bool,typings(shift(type,X5,X2,X3),X1),X0))
| pp(aa(list(type),bool,typings(X5,map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,X4),X2),X1)),X0)) ),
inference(cnf_transformation,[],[f120]) ).
tff(f310,plain,
! [X1: $tType,X0: $tType,X2: $tType,X3: X0,X4: X2,X5: fun(X0,fun(X2,X1))] : ( aa(X0,X1,combc(X0,X2,X1,X5,X4),X3) = aa(X2,X1,aa(X0,fun(X2,X1),X5,X3),X4) ),
inference(cnf_transformation,[],[f105]) ).
tff(f320,plain,
~ pp(aa(list(type),bool,typings(e,map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),as)),ts)),
inference(cnf_transformation,[],[f118]) ).
tff(f1196,plain,
pp(aa(dB,bool,combc(dB,type,bool,typing(e),t),u)),
inference(superposition,[],[f162,f310]) ).
tff(f3613,plain,
! [X2: nat,X3: type,X0: list(type),X1: list(dB),X4: dB,X5: fun(nat,type)] :
( pp(aa(list(type),bool,typings(X5,map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,X4),X2),X1)),X0))
| ~ pp(aa(list(type),bool,typings(shift(type,X5,X2,X3),X1),X0))
| ~ pp(aa(dB,bool,combc(dB,type,bool,typing(X5),X3),X4)) ),
inference(forward_demodulation,[],[f168,f310]) ).
tff(f3614,plain,
! [X0: type] :
( ~ pp(aa(list(type),bool,typings(shift(type,e,i,X0),as),ts))
| ~ pp(aa(dB,bool,combc(dB,type,bool,typing(e),X0),u)) ),
inference(resolution,[],[f3613,f320]) ).
tff(f3647,plain,
~ pp(aa(dB,bool,combc(dB,type,bool,typing(e),t),u)),
inference(resolution,[],[f3614,f166]) ).
tff(f3675,plain,
$false,
inference(forward_subsumption_resolution,[],[f3647,f1196]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL814_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.38 % Computer : n019.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 16:54:49 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.41 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
% 2.68/1.03 % (3263208)Will run a generic schedule for satisfiability detection.
% 2.68/1.03 % (3263216)dis+10_1_sil=32000:sp=arity:random_seed=2713244673:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.68/1.03 % (3263214)% WARNING: option uhcvi not known.
% 2.68/1.03 % (3263213)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2208106745_2999 on theBenchmark for (2999ds/0Mi)
% 2.68/1.03 % (3263217)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=748063526:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.68/1.03 % (3263219)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2378903562:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.68/1.03 % (3263214)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1073918696:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.68/1.03 % (3263215)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1514314404:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.68/1.03 % (3263218)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=425237202:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.18/1.03 % Exception at run slice level
% 2.18/1.03 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.18/1.03 % (3263216)Instruction limit reached!
% 2.18/1.03 % (3263216)------------------------------
% 2.18/1.03 % (3263216)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.18/1.03 % (3263216)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.18/1.03 % (3263216)CaDiCaL version: 2.1.3
% 2.18/1.03 % (3263216)Termination reason: Instruction limit
% 2.18/1.03 % (3263216)Termination phase: Saturation
% 2.18/1.03 % (3263216)Time elapsed: 0.033 s
% 2.18/1.03 % (3263216)Peak memory usage: 12 MB
% 2.18/1.03 % (3263216)Instructions burned: 103 (million)
% 2.18/1.03 % (3263227)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1809371326:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.18/1.03 % Exception at run slice level
% 2.18/1.03 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.18/1.03 % (3263228)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2061094312:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 2.18/1.03 % (3263230)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=146461054:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 2.18/1.03 % (3263217)Instruction limit reached!
% 2.18/1.03 % (3263217)------------------------------
% 2.18/1.03 % (3263217)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.18/1.03 % (3263217)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.18/1.03 % (3263217)CaDiCaL version: 2.1.3
% 2.18/1.03 % (3263217)Termination reason: Instruction limit
% 2.18/1.03 % (3263217)Termination phase: Saturation
% 2.18/1.03 % (3263217)Time elapsed: 0.059 s
% 2.18/1.03 % (3263217)Peak memory usage: 12 MB
% 2.18/1.03 % (3263217)Instructions burned: 118 (million)
% 2.18/1.03 % (3263218)Instruction limit reached!
% 2.18/1.03 % (3263218)------------------------------
% 2.18/1.03 % (3263218)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.18/1.03 % (3263218)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.18/1.03 % (3263218)CaDiCaL version: 2.1.3
% 2.18/1.03 % (3263218)Termination reason: Instruction limit
% 2.18/1.03 % (3263218)Termination phase: Saturation
% 2.18/1.03 % (3263218)Time elapsed: 0.072 s
% 2.18/1.03 % (3263218)Peak memory usage: 12 MB
% 2.18/1.03 % (3263218)Instructions burned: 132 (million)
% 2.18/1.03 % (3263219)Instruction limit reached!
% 2.18/1.03 % (3263219)------------------------------
% 2.18/1.03 % (3263219)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.18/1.03 % (3263219)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.18/1.03 % (3263219)CaDiCaL version: 2.1.3
% 2.18/1.03 % (3263219)Termination reason: Instruction limit
% 2.18/1.03 % (3263219)Termination phase: Saturation
% 2.18/1.03 % (3263219)Time elapsed: 0.076 s
% 2.18/1.03 % (3263219)Peak memory usage: 13 MB
% 2.18/1.03 % (3263219)Instructions burned: 160 (million)
% 2.18/1.03 % (3263228)Instruction limit reached!
% 2.18/1.03 % (3263228)------------------------------
% 2.18/1.03 % (3263228)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.18/1.03 % (3263233)ott-21_1_sil=16000:fs=off:random_seed=2024277839:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.18/1.03 % (3263228)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.18/1.03 % (3263228)CaDiCaL version: 2.1.3
% 2.18/1.03 % (3263228)Termination reason: Instruction limit
% 2.18/1.03 % (3263228)Termination phase: Saturation
% 2.18/1.03 % (3263228)Time elapsed: 0.041 s
% 2.18/1.03 % (3263228)Peak memory usage: 13 MB
% 2.18/1.03 % (3263228)Instructions burned: 133 (million)
% 2.18/1.03 % (3263237)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1582738671:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 2.18/1.03 % (3263234)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=4203974189:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 2.18/1.03 % (3263235)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3970121951:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 2.18/1.03 % Exception at run slice level
% 2.18/1.03 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.18/1.03 % (3263241)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2905132427:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 2.18/1.03 % Exception at run slice level
% 2.18/1.03 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.18/1.03 % (3263243)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=2238923651: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)
% 2.18/1.03 % (3263233)Instruction limit reached!
% 2.18/1.03 % (3263233)------------------------------
% 2.18/1.03 % (3263233)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.18/1.03 % (3263233)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.18/1.03 % (3263233)CaDiCaL version: 2.1.3
% 2.18/1.03 % (3263233)Termination reason: Instruction limit
% 2.18/1.03 % (3263233)Termination phase: Saturation
% 2.18/1.03 % (3263233)Time elapsed: 0.092 s
% 2.18/1.03 % (3263233)Peak memory usage: 12 MB
% 2.18/1.03 % (3263233)Instructions burned: 180 (million)
% 2.18/1.03 % (3263245)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=3620528977:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 2.18/1.03 % (3263234)Instruction limit reached!
% 2.18/1.03 % (3263234)------------------------------
% 2.18/1.03 % (3263234)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.18/1.03 % (3263234)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.18/1.03 % (3263234)CaDiCaL version: 2.1.3
% 2.18/1.03 % (3263234)Termination reason: Instruction limit
% 2.18/1.03 % (3263234)Termination phase: Saturation
% 2.18/1.03 % (3263234)Time elapsed: 0.243 s
% 2.18/1.03 % (3263234)Peak memory usage: 13 MB
% 2.18/1.03 % (3263234)Instructions burned: 477 (million)
% 2.18/1.03 % (3263247)fmb+10_1_sil=64000:random_seed=73627927:i=22061:nm=2:gsp=on_2996 on theBenchmark for (2996ds/22061Mi)
% 2.18/1.03 % (3263247)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.18/1.03 % Exception at run slice level
% 2.18/1.03 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.18/1.04 % (3263249)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=594756071:i=9515:nm=5_2995 on theBenchmark for (2995ds/9515Mi)
% 2.18/1.04 % (3263230)Instruction limit reached!
% 2.18/1.04 % (3263230)------------------------------
% 2.18/1.04 % (3263230)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.18/1.04 % (3263230)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.18/1.04 % (3263230)CaDiCaL version: 2.1.3
% 2.18/1.04 % (3263230)Termination reason: Instruction limit
% 2.18/1.04 % (3263230)Termination phase: Saturation
% 2.18/1.04 % (3263230)Time elapsed: 0.335 s
% 2.18/1.04 % (3263230)Peak memory usage: 15 MB
% 2.18/1.04 % (3263230)Instructions burned: 685 (million)
% 2.18/1.04 % Exception at run slice level
% 2.18/1.04 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.18/1.04 % (3263237)Instruction limit reached!
% 2.18/1.04 % (3263237)------------------------------
% 2.18/1.04 % (3263237)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.18/1.04 % (3263237)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.18/1.04 % (3263237)CaDiCaL version: 2.1.3
% 2.18/1.04 % (3263237)Termination reason: Instruction limit
% 2.18/1.04 % (3263237)Termination phase: Saturation
% 2.18/1.04 % (3263237)Time elapsed: 0.308 s
% 2.18/1.04 % (3263237)Peak memory usage: 16 MB
% 2.18/1.04 % (3263237)Instructions burned: 1183 (million)
% 2.18/1.04 % (3263253)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=1649259476:i=1472:ins=7:fdi=8:gsp=on_2995 on theBenchmark for (2995ds/1472Mi)
% 2.18/1.04 % (3263251)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=2467015055:fmbsr=1.7:i=920_2995 on theBenchmark for (2995ds/920Mi)
% 2.18/1.04 % (3263253)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.18/1.04 % (3263252)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=3756642657:i=5131_2995 on theBenchmark for (2995ds/5131Mi)
% 2.18/1.04 % Exception at run slice level
% 2.18/1.04 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.18/1.04 % (3263257)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=1220957168:i=6324_2995 on theBenchmark for (2995ds/6324Mi)
% 2.18/1.04 % Exception at run slice level
% 2.18/1.04 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.18/1.04 % (3263259)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=3645948611:fmbsr=2.30978:i=2174_2995 on theBenchmark for (2995ds/2174Mi)
% 2.18/1.04 % Exception at run slice level
% 2.18/1.04 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.18/1.04 % (3263243)Instruction limit reached!
% 2.18/1.04 % (3263243)------------------------------
% 2.18/1.04 % (3263243)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.18/1.04 % (3263243)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.18/1.04 % (3263243)CaDiCaL version: 2.1.3
% 2.18/1.04 % (3263243)Termination reason: Instruction limit
% 2.18/1.04 % (3263243)Termination phase: Saturation
% 2.18/1.04 % (3263243)Time elapsed: 0.331 s
% 2.18/1.04 % (3263243)Peak memory usage: 16 MB
% 2.18/1.04 % (3263243)Instructions burned: 692 (million)
% 2.18/1.04 % (3263261)ott-2_1_sil=16000:newcnf=on:random_seed=3756449329:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2994 on theBenchmark for (2994ds/869Mi)
% 2.18/1.04 % (3263262)ott+10_1_sil=32000:tgt=ground:random_seed=3425638409:i=5114:av=off_2994 on theBenchmark for (2994ds/5114Mi)
% 2.18/1.04 % (3263252) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3263208-3263252"...
% 2.18/1.04 % (3263252)...printing done.
% 2.18/1.04 % (3263252)Refutation found. Thanks to Tanya!
% 2.18/1.04 % SZS status Theorem for theBenchmark
% 2.18/1.04 % SZS output start Proof for theBenchmark
% See solution above
% 2.18/1.04 % (3263252)------------------------------
% 2.18/1.04 % (3263252)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.18/1.04 % (3263252)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.18/1.04 % (3263252)CaDiCaL version: 2.1.3
% 2.18/1.04 % (3263252)Termination reason: Refutation
% 2.18/1.04 % (3263252)Time elapsed: 0.150 s
% 2.18/1.04 % (3263252)Peak memory usage: 13 MB
% 2.18/1.04 % (3263252)Instructions burned: 291 (million)
% 2.18/1.04 % (3263208)Success in time 0.611 s
% 2.18/1.04 % Vampire exiting
%------------------------------------------------------------------------------