%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL806_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 : n003.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:40 PM UTC 2026
% Result : Theorem 1.58s 0.87s
% Output : Refutation 1.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 52 ( 22 ~; 21 |; 6 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 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 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 80 ( 80 usr; 35 con; 0-6 aty)
% Number of variables : 39 ( 32 !; 7 ?; 39 :)
% 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(fun(X0,fun(X1,X2)),fun(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(fun(nat,X0),fun(nat,fun(X0,fun(nat,X0)))) ).
tff(func_def_21,type,
fun1: fun(type,fun(type,type)) ).
tff(func_def_22,type,
typing: fun(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,
fAll:
!>[X0: $tType] : fun(fun(X0,bool),bool) ).
tff(func_def_26,type,
fEx:
!>[X0: $tType] : fun(fun(X0,bool),bool) ).
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,
fequal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_31,type,
fimplies: fun(bool,fun(bool,bool)) ).
tff(func_def_32,type,
member:
!>[X0: $tType] : fun(X0,fun(fun(X0,bool),bool)) ).
tff(func_def_33,type,
t2: type ).
tff(func_def_34,type,
t1: type ).
tff(func_def_35,type,
t_a: type ).
tff(func_def_36,type,
t: type ).
tff(func_def_37,type,
ts: list(type) ).
tff(func_def_38,type,
a: dB ).
tff(func_def_39,type,
as: list(dB) ).
tff(func_def_40,type,
b: dB ).
tff(func_def_41,type,
bs: 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,
t3: dB ).
tff(func_def_49,type,
u: dB ).
tff(func_def_50,type,
ua: dB ).
tff(func_def_51,type,
sK0: type ).
tff(func_def_52,type,
sK1: ( type * dB * dB * fun(nat,type) ) > type ).
tff(func_def_53,type,
sK2: list(type) ).
tff(func_def_54,type,
sK3: type ).
tff(func_def_55,type,
sK4: ( type * list(dB) * nat * fun(nat,type) ) > list(type) ).
tff(func_def_56,type,
sK5: ( type * type * list(dB) * fun(nat,type) ) > list(type) ).
tff(func_def_57,type,
sK6: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_58,type,
sK7: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_59,type,
sK8:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > X1 ) ).
tff(func_def_60,type,
sK9:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > list(X1) ) ).
tff(func_def_61,type,
sK10:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_62,type,
sK11:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > X0 ) ).
tff(func_def_63,type,
sK12:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > list(X0) ) ).
tff(func_def_64,type,
sK13: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_65,type,
sK14: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_66,type,
sK15: ( dB * fun(nat,type) ) > type ).
tff(func_def_67,type,
sK16: ( dB * fun(nat,type) ) > type ).
tff(func_def_68,type,
sK17: dB > dB ).
tff(func_def_69,type,
sK18: dB > dB ).
tff(func_def_70,type,
sK19: dB > list(dB) ).
tff(func_def_71,type,
sK20: dB > dB ).
tff(func_def_72,type,
sK21: dB > list(dB) ).
tff(func_def_73,type,
sK22: dB > nat ).
tff(func_def_74,type,
sK23: fun(nat,type) ).
tff(func_def_75,type,
sK24: type ).
tff(func_def_76,type,
sK25: dB ).
tff(func_def_77,type,
sK26: 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(f6,axiom,
( ! [X0: fun(nat,type),X1: type,X2: dB,X3: nat] :
( pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),X0),X3),t)),b),X1))
=> ( pp(aa(dB,bool,it,X2))
=> ( pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X0),X2),t))
=> pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),X2),X3))) ) ) )
& ? [X4: type] : pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t)),b),X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_5_Cons_I1_J) ).
tff(f119,conjecture,
! [X0: fun(nat,type),X1: type,X2: dB,X3: nat] :
( ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),X0),X3),t)),b),X1))
| ~ pp(aa(dB,bool,it,X2))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X0),X2),t))
| pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),X2),X3))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f120,negated_conjecture,
~ ! [X0: fun(nat,type),X1: type,X2: dB,X3: nat] :
( ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),X0),X3),t)),b),X1))
| ~ pp(aa(dB,bool,it,X2))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X0),X2),t))
| pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),X2),X3))) ),
inference(negated_conjecture,[status(cth)],[f119]) ).
tff(f123,plain,
( ! [X0: fun(nat,type),X1: type,X2: dB,X3: nat] :
( pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),X2),X3)))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X0),X2),t))
| ~ pp(aa(dB,bool,it,X2))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),X0),X3),t)),b),X1)) )
& ? [X4: type] : pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t)),b),X4)) ),
inference(ennf_transformation,[],[f6]) ).
tff(f124,plain,
( ! [X0: fun(nat,type),X1: type,X2: dB,X3: nat] :
( pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),X2),X3)))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X0),X2),t))
| ~ pp(aa(dB,bool,it,X2))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),X0),X3),t)),b),X1)) )
& ? [X4: type] : pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t)),b),X4)) ),
inference(flattening,[],[f123]) ).
tff(f166,plain,
? [X0: fun(nat,type),X1: type,X2: dB,X3: nat] :
( pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),X0),X3),t)),b),X1))
& pp(aa(dB,bool,it,X2))
& pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X0),X2),t))
& ~ pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),X2),X3))) ),
inference(ennf_transformation,[],[f120]) ).
tff(f172,plain,
! [X2: dB,X3: nat,X0: fun(nat,type),X1: type] :
( ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),X0),X3),t)),b),X1))
| ~ pp(aa(dB,bool,it,X2))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X0),X2),t))
| pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),X2),X3))) ),
inference(cnf_transformation,[],[f124]) ).
tff(f329,plain,
~ pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),sK25),sK26))),
inference(cnf_transformation,[],[f166]) ).
tff(f330,plain,
pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,sK23),sK25),t)),
inference(cnf_transformation,[],[f166]) ).
tff(f331,plain,
pp(aa(dB,bool,it,sK25)),
inference(cnf_transformation,[],[f166]) ).
tff(f332,plain,
pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),sK23),sK26),t)),b),sK24)),
inference(cnf_transformation,[],[f166]) ).
tff(f372,plain,
! [X2: dB,X3: nat,X0: fun(nat,type),X1: type] :
( ~ pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),X2),X3)))
| pp(aa(dB,bool,it,X2))
| pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X0),X2),t))
| pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),X0),X3),t)),b),X1)) ),
inference(consistent_polarity_flipping,[],[f172]) ).
tff(f453,plain,
~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),sK23),sK26),t)),b),sK24)),
inference(consistent_polarity_flipping,[],[f332]) ).
tff(f454,plain,
~ pp(aa(dB,bool,it,sK25)),
inference(consistent_polarity_flipping,[],[f331]) ).
tff(f455,plain,
~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,sK23),sK25),t)),
inference(consistent_polarity_flipping,[],[f330]) ).
tff(f456,plain,
pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),sK25),sK26))),
inference(consistent_polarity_flipping,[],[f329]) ).
tff(f2969,plain,
! [X0: fun(nat,type),X1: type] :
( pp(aa(dB,bool,it,sK25))
| pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X0),sK25),t))
| pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),X0),sK26),t)),b),X1)) ),
inference(resolution,[],[f372,f456]) ).
tff(f2987,plain,
! [X0: fun(nat,type),X1: type] :
( pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),X0),sK26),t)),b),X1))
| pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X0),sK25),t)) ),
inference(forward_subsumption_resolution,[],[f2969,f454]) ).
tff(f3609,plain,
pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,sK23),sK25),t)),
inference(resolution,[],[f2987,f453]) ).
tff(f3636,plain,
$false,
inference(forward_subsumption_resolution,[],[f3609,f455]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL806_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 : n003.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.39 % CPULimit : 300
% 0.10/0.39 % WCLimit : 300
% 0.10/0.39 % DateTime : Sun Sep 27 16:54:57 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.44 Running first-order model finding
% 0.10/0.44 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.58/0.87 % (778247)Will run a generic schedule for satisfiability detection.
% 1.58/0.87 % (778263)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2144467821:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.58/0.87 % (778258)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1721458003_2999 on theBenchmark for (2999ds/0Mi)
% 1.58/0.87 % (778259)% WARNING: option uhcvi not known.
% 1.58/0.87 % (778260)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3637813432:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.58/0.87 % (778259)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2572814829:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.58/0.87 % (778264)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4122988088:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.58/0.87 % (778261)dis+10_1_sil=32000:sp=arity:random_seed=2159302891:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.58/0.87 % (778262)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=747581811:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.58/0.87 % Exception at run slice level
% 1.58/0.87 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.58/0.87 % (778273)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=4097231356:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.58/0.87 % (778263)Instruction limit reached!
% 1.58/0.87 % (778263)------------------------------
% 1.58/0.87 % (778263)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.58/0.87 % (778263)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.58/0.87 % (778263)CaDiCaL version: 2.1.3
% 1.58/0.87 % (778263)Termination reason: Instruction limit
% 1.58/0.87 % (778263)Termination phase: Saturation
% 1.58/0.87 % (778263)Time elapsed: 0.052 s
% 1.58/0.87 % (778263)Peak memory usage: 12 MB
% 1.58/0.87 % (778263)Instructions burned: 133 (million)
% 1.58/0.87 % Exception at run slice level
% 1.58/0.87 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.58/0.87 % (778275)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1871470389:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.58/0.87 % (778276)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=102858879:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.58/0.87 % (778261)Instruction limit reached!
% 1.58/0.87 % (778261)------------------------------
% 1.58/0.87 % (778261)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.58/0.87 % (778261)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.58/0.87 % (778261)CaDiCaL version: 2.1.3
% 1.58/0.87 % (778261)Termination reason: Instruction limit
% 1.58/0.87 % (778261)Termination phase: Saturation
% 1.58/0.87 % (778261)Time elapsed: 0.096 s
% 1.58/0.87 % (778261)Peak memory usage: 12 MB
% 1.58/0.87 % (778261)Instructions burned: 104 (million)
% 1.58/0.87 % (778262)Instruction limit reached!
% 1.58/0.87 % (778262)------------------------------
% 1.58/0.87 % (778262)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.58/0.87 % (778262)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.58/0.87 % (778262)CaDiCaL version: 2.1.3
% 1.58/0.87 % (778262)Termination reason: Instruction limit
% 1.58/0.87 % (778262)Termination phase: Saturation
% 1.58/0.87 % (778262)Time elapsed: 0.101 s
% 1.58/0.87 % (778262)Peak memory usage: 12 MB
% 1.58/0.87 % (778262)Instructions burned: 117 (million)
% 1.58/0.87 % (778275)Instruction limit reached!
% 1.58/0.87 % (778275)------------------------------
% 1.58/0.87 % (778275)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.58/0.87 % (778275)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.58/0.87 % (778275)CaDiCaL version: 2.1.3
% 1.58/0.87 % (778275)Termination reason: Instruction limit
% 1.58/0.87 % (778275)Termination phase: Saturation
% 1.58/0.87 % (778275)Time elapsed: 0.062 s
% 1.58/0.87 % (778275)Peak memory usage: 14 MB
% 1.58/0.87 % (778275)Instructions burned: 132 (million)
% 1.58/0.87 % (778280)ott-21_1_sil=16000:fs=off:random_seed=4004455720:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.58/0.87 % (778281)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3450289664:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 1.58/0.87 % (778264)Instruction limit reached!
% 1.58/0.87 % (778264)------------------------------
% 1.58/0.87 % (778264)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.58/0.87 % (778264)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.58/0.87 % (778264)CaDiCaL version: 2.1.3
% 1.58/0.87 % (778264)Termination reason: Instruction limit
% 1.58/0.87 % (778264)Termination phase: Saturation
% 1.58/0.87 % (778264)Time elapsed: 0.141 s
% 1.58/0.87 % (778264)Peak memory usage: 12 MB
% 1.58/0.87 % (778264)Instructions burned: 159 (million)
% 1.58/0.87 % (778282)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=525663435:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.58/0.87 % Exception at run slice level
% 1.58/0.87 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.58/0.87 % (778285)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1485161036:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 1.58/0.87 % (778287)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1801229931:i=889:ins=1_2997 on theBenchmark for (2997ds/889Mi)
% 1.58/0.87 % Exception at run slice level
% 1.58/0.87 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.58/0.87 % (778290)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=1557636192:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2997 on theBenchmark for (2997ds/692Mi)
% 1.58/0.87 % (778280)Instruction limit reached!
% 1.58/0.87 % (778280)------------------------------
% 1.58/0.87 % (778280)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.58/0.87 % (778280)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.58/0.87 % (778280)CaDiCaL version: 2.1.3
% 1.58/0.87 % (778280)Termination reason: Instruction limit
% 1.58/0.87 % (778280)Termination phase: Saturation
% 1.58/0.87 % (778280)Time elapsed: 0.163 s
% 1.58/0.87 % (778280)Peak memory usage: 13 MB
% 1.58/0.87 % (778280)Instructions burned: 181 (million)
% 1.58/0.87 % (778259) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-778247-778259"...
% 1.58/0.87 % (778292)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1403669898:i=879:kws=inv_precedence:fsr=off_2996 on theBenchmark for (2996ds/879Mi)
% 1.58/0.87 % (778259)...printing done.
% 1.58/0.87 % (778259)Refutation found. Thanks to Tanya!
% 1.58/0.87 % SZS status Theorem for theBenchmark
% 1.58/0.87 % SZS output start Proof for theBenchmark
% See solution above
% 1.58/0.87 % (778259)------------------------------
% 1.58/0.87 % (778259)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.58/0.87 % (778259)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.58/0.87 % (778259)CaDiCaL version: 2.1.3
% 1.58/0.87 % (778259)Termination reason: Refutation
% 1.58/0.87 % (778259)Time elapsed: 0.330 s
% 1.58/0.87 % (778259)Peak memory usage: 15 MB
% 1.58/0.87 % (778259)Instructions burned: 367 (million)
% 1.58/0.87 % (778247)Success in time 0.415 s
% 1.58/0.87 % Vampire exiting
%------------------------------------------------------------------------------