%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL835_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 : n015.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:48 PM UTC 2026
% Result : Theorem 1.24s 0.65s
% Output : Refutation 1.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 20 unt; 0 typ; 0 def)
% Number of atoms : 40 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 29 ( 16 ~; 11 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 78 ( 78 usr; 19 con; 0-5 aty)
% Number of variables : 49 ( 49 !; 0 ?; 49 :)
% 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,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * fun(X0,X1) ) > fun(X0,X2) ) ).
tff(func_def_3,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_4,type,
it: fun(dB,bool) ).
tff(func_def_5,type,
beta: fun(dB,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,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_11,type,
subst: ( dB * dB * nat ) > dB ).
tff(func_def_12,type,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_13,type,
append:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_14,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_15,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_16,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_17,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_18,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_19,type,
sublist:
!>[X0: $tType] : ( ( list(X0) * fun(nat,bool) ) > list(X0) ) ).
tff(func_def_20,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_21,type,
shift:
!>[X0: $tType] : ( ( fun(nat,X0) * nat * X0 ) > fun(nat,X0) ) ).
tff(func_def_22,type,
fun1: ( type * type ) > type ).
tff(func_def_23,type,
type_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(type,fun(type,X0)) * type ) > X0 ) ).
tff(func_def_24,type,
typing: ( fun(nat,type) * dB ) > fun(type,bool) ).
tff(func_def_25,type,
typings: ( fun(nat,type) * list(dB) ) > fun(list(type),bool) ).
tff(func_def_26,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_27,type,
fFalse: bool ).
tff(func_def_28,type,
fTrue: bool ).
tff(func_def_29,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_30,type,
t: type ).
tff(func_def_31,type,
t_a: type ).
tff(func_def_32,type,
t1: type ).
tff(func_def_33,type,
a: dB ).
tff(func_def_34,type,
as: list(dB) ).
tff(func_def_35,type,
e: fun(nat,type) ).
tff(func_def_36,type,
ea: fun(nat,type) ).
tff(func_def_37,type,
i: nat ).
tff(func_def_38,type,
ia: nat ).
tff(func_def_39,type,
r: dB ).
tff(func_def_40,type,
t2: dB ).
tff(func_def_41,type,
u: dB ).
tff(func_def_42,type,
ua: dB ).
tff(func_def_43,type,
sK0: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_44,type,
sK1: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_45,type,
sK2: ( type * dB * dB * fun(nat,type) ) > type ).
tff(func_def_46,type,
sK3: ( dB * dB ) > dB ).
tff(func_def_47,type,
sK4: ( dB * fun(nat,type) ) > type ).
tff(func_def_48,type,
sK5: ( dB * fun(nat,type) ) > type ).
tff(func_def_49,type,
sK6: ( dB * dB * dB ) > dB ).
tff(func_def_50,type,
sK7: ( dB * dB * dB ) > dB ).
tff(func_def_51,type,
sK8: ( dB * dB * dB ) > dB ).
tff(func_def_52,type,
sK9:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_53,type,
sK10:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_54,type,
sK11:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(func_def_55,type,
sK12: ( dB * list(dB) * dB ) > dB ).
tff(func_def_56,type,
sK13: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_57,type,
sK14: ( dB * list(dB) * dB ) > dB ).
tff(func_def_58,type,
sK15: ( dB * list(dB) * dB ) > dB ).
tff(func_def_59,type,
sK16: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_60,type,
sK17:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_61,type,
sK18: ( dB * list(dB) * nat ) > list(dB) ).
tff(func_def_62,type,
sK19:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_63,type,
sK20:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_64,type,
sK21:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_65,type,
sK22:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_66,type,
sK23:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > X0 ) ).
tff(func_def_67,type,
sK24:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > list(X0) ) ).
tff(func_def_68,type,
sK25: dB > dB ).
tff(func_def_69,type,
sK26: dB > dB ).
tff(func_def_70,type,
sK27: dB > list(dB) ).
tff(func_def_71,type,
sK28: dB > dB ).
tff(func_def_72,type,
sK29: dB > list(dB) ).
tff(func_def_73,type,
sK30: dB > nat ).
tff(func_def_74,type,
sK31:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > X0 ) ).
tff(func_def_75,type,
sK32:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > list(X0) ) ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
step1:
!>[X0: $tType] : ( ( fun(X0,fun(X0,bool)) * list(X0) * list(X0) ) > $o ) ).
tff(pred_def_3,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_4,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_5,type,
pp: bool > $o ).
tff(f4,axiom,
pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),as)),foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3__096Abs_Ar_A_092_060degree_062_Aa_A_092_060degree_062_092_060degree_062_Aas_A_092_060rightarrow_062_092_060_094sub_062_092_060beta_062r_091a_P0_093_A_092_060degree_062_092_060degree_062_Aas_096) ).
tff(f5,axiom,
pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),as)),t)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_4_T) ).
tff(f30,axiom,
! [X0: dB,X1: type,X2: dB,X3: fun(nat,type)] :
( pp(aa(type,bool,typing(X3,X2),X1))
=> ( pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,X2),X0))
=> pp(aa(type,bool,typing(X3,X0),X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_29_subject__reduction) ).
tff(f67,axiom,
! [X0: $tType,X1: $tType,X2: list(X1),X3: X1,X4: X0,X5: fun(X0,fun(X1,X0))] : ( foldl(X0,X1,X5,X4,cons(X1,X3,X2)) = foldl(X0,X1,X5,aa(X1,X0,aa(X0,fun(X1,X0),X5,X4),X3),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_66_foldl__Cons) ).
tff(f104,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(f111,conjecture,
pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as)),t)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f112,negated_conjecture,
~ pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as)),t)),
inference(negated_conjecture,[status(cth)],[f111]) ).
tff(f115,plain,
~ pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as)),t)),
inference(flattening,[],[f112]) ).
tff(f132,plain,
! [X0: dB,X1: type,X2: dB,X3: fun(nat,type)] :
( pp(aa(type,bool,typing(X3,X0),X1))
| ~ pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,X2),X0))
| ~ pp(aa(type,bool,typing(X3,X2),X1)) ),
inference(ennf_transformation,[],[f30]) ).
tff(f133,plain,
! [X0: dB,X1: type,X2: dB,X3: fun(nat,type)] :
( pp(aa(type,bool,typing(X3,X0),X1))
| ~ pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,X2),X0))
| ~ pp(aa(type,bool,typing(X3,X2),X1)) ),
inference(flattening,[],[f132]) ).
tff(f167,plain,
pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),as)),foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as))),
inference(cnf_transformation,[],[f4]) ).
tff(f168,plain,
pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),as)),t)),
inference(cnf_transformation,[],[f5]) ).
tff(f201,plain,
! [X2: dB,X3: fun(nat,type),X0: dB,X1: type] :
( ~ pp(aa(type,bool,typing(X3,X2),X1))
| ~ pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,X2),X0))
| pp(aa(type,bool,typing(X3,X0),X1)) ),
inference(cnf_transformation,[],[f133]) ).
tff(f274,plain,
! [X1: $tType,X0: $tType,X2: list(X1),X3: X1,X4: X0,X5: fun(X0,fun(X1,X0))] : ( foldl(X0,X1,X5,X4,cons(X1,X3,X2)) = foldl(X0,X1,X5,aa(X1,X0,aa(X0,fun(X1,X0),X5,X4),X3),X2) ),
inference(cnf_transformation,[],[f67]) ).
tff(f339,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,[],[f104]) ).
tff(f346,plain,
~ pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as)),t)),
inference(cnf_transformation,[],[f115]) ).
tff(f382,plain,
~ pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),as)),foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as))),
inference(consistent_polarity_flipping,[],[f167]) ).
tff(f383,plain,
~ pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),as)),t)),
inference(consistent_polarity_flipping,[],[f168]) ).
tff(f400,plain,
! [X2: dB,X3: fun(nat,type),X0: dB,X1: type] :
( pp(aa(type,bool,typing(X3,X2),X1))
| pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,X2),X0))
| ~ pp(aa(type,bool,typing(X3,X0),X1)) ),
inference(consistent_polarity_flipping,[],[f201]) ).
tff(f483,plain,
pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as)),t)),
inference(consistent_polarity_flipping,[],[f346]) ).
tff(f1338,plain,
~ pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,abs(r),cons(dB,a,as))),t)),
inference(forward_demodulation,[],[f383,f274]) ).
tff(f1371,plain,
! [X2: dB,X3: fun(nat,type),X0: dB,X1: type] :
( ~ pp(aa(type,bool,typing(X3,X0),X1))
| pp(aa(type,bool,typing(X3,X2),X1))
| pp(aa(dB,bool,combc(dB,dB,bool,beta,X0),X2)) ),
inference(forward_demodulation,[],[f400,f339]) ).
tff(f1372,plain,
! [X0: dB] :
( pp(aa(dB,bool,combc(dB,dB,bool,beta,foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as)),X0))
| pp(aa(type,bool,typing(shift(type,e,i,t1),X0),t)) ),
inference(resolution,[],[f1371,f483]) ).
tff(f1764,plain,
~ pp(aa(dB,bool,combc(dB,dB,bool,beta,foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as)),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),as))),
inference(forward_demodulation,[],[f382,f339]) ).
tff(f1765,plain,
~ pp(aa(dB,bool,combc(dB,dB,bool,beta,foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as)),foldl(dB,dB,app,abs(r),cons(dB,a,as)))),
inference(forward_demodulation,[],[f1764,f274]) ).
tff(f4261,plain,
pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,abs(r),cons(dB,a,as))),t)),
inference(resolution,[],[f1372,f1765]) ).
tff(f4288,plain,
$false,
inference(forward_subsumption_resolution,[],[f4261,f1338]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL835_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n015.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 17:02:00 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/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
% 1.24/0.65 % (1857900)Will run a generic schedule for satisfiability detection.
% 1.24/0.65 % (1857909)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1735583161:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.24/0.65 % (1857906)% WARNING: option uhcvi not known.
% 1.24/0.65 % (1857906)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1200860761:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.24/0.65 % (1857905)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2688910331_2999 on theBenchmark for (2999ds/0Mi)
% 1.24/0.65 % (1857907)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2075987166:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.24/0.65 % (1857908)dis+10_1_sil=32000:sp=arity:random_seed=189835642:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.24/0.65 % (1857910)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4134864222:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.24/0.65 % (1857911)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3439993929:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.24/0.65 % Exception at run slice level
% 1.24/0.65 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.24/0.65 % (1857909)Instruction limit reached!
% 1.24/0.65 % (1857909)------------------------------
% 1.24/0.65 % (1857909)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.24/0.65 % (1857909)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.24/0.65 % (1857909)CaDiCaL version: 2.1.3
% 1.24/0.65 % (1857909)Termination reason: Instruction limit
% 1.24/0.65 % (1857909)Termination phase: Saturation
% 1.24/0.65 % (1857909)Time elapsed: 0.031 s
% 1.24/0.65 % (1857909)Peak memory usage: 12 MB
% 1.24/0.65 % (1857909)Instructions burned: 118 (million)
% 1.24/0.65 % (1857919)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1890893752:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.24/0.65 % Exception at run slice level
% 1.24/0.65 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.24/0.65 % (1857920)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1073588700:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.24/0.65 % (1857922)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=1861125553:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 1.24/0.65 % (1857908)Instruction limit reached!
% 1.24/0.65 % (1857908)------------------------------
% 1.24/0.65 % (1857908)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.24/0.65 % (1857908)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.24/0.65 % (1857908)CaDiCaL version: 2.1.3
% 1.24/0.65 % (1857908)Termination reason: Instruction limit
% 1.24/0.65 % (1857908)Termination phase: Saturation
% 1.24/0.65 % (1857908)Time elapsed: 0.061 s
% 1.24/0.65 % (1857908)Peak memory usage: 12 MB
% 1.24/0.65 % (1857908)Instructions burned: 104 (million)
% 1.24/0.65 % (1857920)Instruction limit reached!
% 1.24/0.65 % (1857920)------------------------------
% 1.24/0.65 % (1857920)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.24/0.65 % (1857920)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.24/0.65 % (1857920)CaDiCaL version: 2.1.3
% 1.24/0.65 % (1857920)Termination reason: Instruction limit
% 1.24/0.65 % (1857920)Termination phase: Saturation
% 1.24/0.65 % (1857920)Time elapsed: 0.040 s
% 1.24/0.65 % (1857920)Peak memory usage: 13 MB
% 1.24/0.65 % (1857920)Instructions burned: 132 (million)
% 1.24/0.65 % (1857925)ott-21_1_sil=16000:fs=off:random_seed=2926300819:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.24/0.65 % (1857910)Instruction limit reached!
% 1.24/0.65 % (1857910)------------------------------
% 1.24/0.65 % (1857910)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.24/0.65 % (1857910)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.24/0.65 % (1857910)CaDiCaL version: 2.1.3
% 1.24/0.65 % (1857910)Termination reason: Instruction limit
% 1.24/0.65 % (1857910)Termination phase: Saturation
% 1.24/0.65 % (1857910)Time elapsed: 0.080 s
% 1.24/0.65 % (1857910)Peak memory usage: 13 MB
% 1.24/0.65 % (1857910)Instructions burned: 132 (million)
% 1.24/0.65 % (1857926)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2473848014:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 1.24/0.65 % (1857911)Instruction limit reached!
% 1.24/0.65 % (1857911)------------------------------
% 1.24/0.65 % (1857911)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.24/0.65 % (1857911)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.24/0.65 % (1857911)CaDiCaL version: 2.1.3
% 1.24/0.65 % (1857911)Termination reason: Instruction limit
% 1.24/0.65 % (1857911)Termination phase: Saturation
% 1.24/0.65 % (1857911)Time elapsed: 0.093 s
% 1.24/0.65 % (1857911)Peak memory usage: 13 MB
% 1.24/0.65 % (1857911)Instructions burned: 160 (million)
% 1.24/0.65 % (1857928)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3481684020:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 1.24/0.65 % Exception at run slice level
% 1.24/0.65 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.24/0.65 % (1857930)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3232255997:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 1.24/0.65 % (1857932)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3660256766:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 1.24/0.65 % Exception at run slice level
% 1.24/0.65 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.24/0.65 % (1857935)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=1173195704: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.24/0.65 % (1857925)Instruction limit reached!
% 1.24/0.65 % (1857925)------------------------------
% 1.24/0.65 % (1857925)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.24/0.65 % (1857925)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.24/0.65 % (1857925)CaDiCaL version: 2.1.3
% 1.24/0.65 % (1857925)Termination reason: Instruction limit
% 1.24/0.65 % (1857925)Termination phase: Saturation
% 1.24/0.65 % (1857925)Time elapsed: 0.096 s
% 1.24/0.65 % (1857925)Peak memory usage: 12 MB
% 1.24/0.65 % (1857925)Instructions burned: 181 (million)
% 1.24/0.65 % (1857906) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1857900-1857906"...
% 1.24/0.65 % (1857906)...printing done.
% 1.24/0.65 % (1857906)Refutation found. Thanks to Tanya!
% 1.24/0.65 % SZS status Theorem for theBenchmark
% 1.24/0.65 % SZS output start Proof for theBenchmark
% See solution above
% 1.24/0.65 % (1857906)------------------------------
% 1.24/0.65 % (1857906)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.24/0.65 % (1857906)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.24/0.65 % (1857906)CaDiCaL version: 2.1.3
% 1.24/0.65 % (1857906)Termination reason: Refutation
% 1.24/0.65 % (1857906)Time elapsed: 0.180 s
% 1.24/0.65 % (1857906)Peak memory usage: 14 MB
% 1.24/0.65 % (1857906)Instructions burned: 314 (million)
% 1.24/0.65 % (1857900)Success in time 0.226 s
% 1.24/0.65 % Vampire exiting
%------------------------------------------------------------------------------