%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL807_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n004.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:41 PM UTC 2026
% Result : Theorem 0.21s 0.54s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 45 ( 6 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 40 ( 18 ~; 14 |; 4 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 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 : 7 ( 5 usr; 2 prp; 0-3 aty)
% Number of functors : 76 ( 76 usr; 31 con; 0-6 aty)
% Number of variables : 27 ( 24 !; 3 ?; 27 :)
% 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,
sK1: type ).
tff(func_def_52,type,
sK2: type ).
tff(func_def_53,type,
sK3: list(type) ).
tff(func_def_54,type,
sK4: ( type * dB * dB * fun(nat,type) ) > type ).
tff(func_def_55,type,
sK5: ( type * list(dB) * nat * fun(nat,type) ) > list(type) ).
tff(func_def_56,type,
sK6: ( type * type * list(dB) * fun(nat,type) ) > list(type) ).
tff(func_def_57,type,
sK7: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_58,type,
sK8: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_59,type,
sK9:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_60,type,
sK10:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > X1 ) ).
tff(func_def_61,type,
sK11:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > list(X1) ) ).
tff(func_def_62,type,
sK12:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > X0 ) ).
tff(func_def_63,type,
sK13:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > list(X0) ) ).
tff(func_def_64,type,
sK14: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_65,type,
sK15: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_66,type,
sK16: ( dB * fun(nat,type) ) > type ).
tff(func_def_67,type,
sK17: ( dB * fun(nat,type) ) > type ).
tff(func_def_68,type,
sK18: dB > dB ).
tff(func_def_69,type,
sK19: dB > dB ).
tff(func_def_70,type,
sK20: dB > list(dB) ).
tff(func_def_71,type,
sK21: dB > list(dB) ).
tff(func_def_72,type,
sK22: dB > nat ).
tff(func_def_73,type,
sK23: dB > dB ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_3,type,
pp: bool > $o ).
tff(pred_def_5,type,
sP0: dB > $o ).
tff(f3,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/sandbox/benchmark/theBenchmark.p',fact_2_Cons_I1_J) ).
tff(f102,axiom,
pp(fTrue),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_pp_2_1_U) ).
tff(f112,axiom,
~ pp(fFalse),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_fFalse_1_1_U) ).
tff(f113,axiom,
! [X0: bool] :
( ( X0 = fTrue )
| ( X0 = fFalse ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_fFalse_1_1_T) ).
tff(f119,axiom,
! [X0: 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),X0))
=> thesis ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f120,conjecture,
thesis,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).
tff(f121,negated_conjecture,
~ thesis,
inference(negated_conjecture,[status(cth)],[f120]) ).
tff(f123,plain,
~ thesis,
inference(flattening,[],[f121]) ).
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(ennf_transformation,[],[f3]) ).
tff(f125,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,[],[f124]) ).
tff(f169,plain,
! [X0: type] :
( thesis
| ~ 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),X0)) ),
inference(ennf_transformation,[],[f119]) ).
tff(f172,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)) )
& 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),sK1)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X4,sK1)],[f125]) ).
tff(f216,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),e),i),t)),b),sK1)),
inference(cnf_transformation,[],[f172]) ).
tff(f358,plain,
pp(fTrue),
inference(cnf_transformation,[],[f102]) ).
tff(f368,plain,
~ pp(fFalse),
inference(cnf_transformation,[],[f112]) ).
tff(f369,plain,
! [X0: bool] :
( ( fTrue = X0 )
| ( fFalse = X0 ) ),
inference(cnf_transformation,[],[f113]) ).
tff(f375,plain,
! [X0: type] :
( thesis
| ~ 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),X0)) ),
inference(cnf_transformation,[],[f169]) ).
tff(f376,plain,
~ thesis,
inference(cnf_transformation,[],[f123]) ).
tff(f413,plain,
! [X0: 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),X0)),
inference(forward_subsumption_resolution,[],[f375,f376]) ).
tff(f419,plain,
! [X0: type] :
( ~ pp(fTrue)
| ( fFalse = 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),X0) ) ),
inference(superposition,[],[f413,f369]) ).
tff(f432,plain,
! [X0: type] : ( fFalse = 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),X0) ),
inference(forward_subsumption_resolution,[],[f419,f358]) ).
tff(f434,plain,
pp(fFalse),
inference(backward_demodulation,[],[f216,f432]) ).
tff(f435,plain,
$false,
inference(forward_subsumption_resolution,[],[f434,f368]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL807_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.37 % Computer : n004.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 27 16:53:22 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40 Running first-order model finding
% 0.12/0.40 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.54 % (3739131)Will run a generic schedule for satisfiability detection.
% 0.21/0.54 % (3739140)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4151187781:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.54 % (3739137)% WARNING: option uhcvi not known.
% 0.21/0.54 % (3739136)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1656414201_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.54 % (3739137)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2856109883:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.54 % (3739138)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=238268894:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.54 % (3739139)dis+10_1_sil=32000:sp=arity:random_seed=3203360708:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.54 % (3739141)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2083692414:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.54 % (3739142)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=428041190:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.54 % Exception at run slice level
% 0.21/0.54 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.21/0.54 % (3739140)Instruction limit reached!
% 0.21/0.54 % (3739140)------------------------------
% 0.21/0.54 % (3739140)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.54 % (3739140)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.54 % (3739140)CaDiCaL version: 2.1.3
% 0.21/0.54 % (3739140)Termination reason: Instruction limit
% 0.21/0.54 % (3739140)Termination phase: Saturation
% 0.21/0.54 % (3739140)Time elapsed: 0.032 s
% 0.21/0.54 % (3739140)Peak memory usage: 12 MB
% 0.21/0.54 % (3739140)Instructions burned: 118 (million)
% 0.21/0.54 % (3739150)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1653278982:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.21/0.54 % (3739151)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3371053950:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.54 % Exception at run slice level
% 0.21/0.54 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.21/0.54 % (3739154)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=2871658112:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.21/0.54 % (3739139)Instruction limit reached!
% 0.21/0.54 % (3739139)------------------------------
% 0.21/0.54 % (3739139)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.54 % (3739139)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.54 % (3739139)CaDiCaL version: 2.1.3
% 0.21/0.54 % (3739139)Termination reason: Instruction limit
% 0.21/0.54 % (3739139)Termination phase: Saturation
% 0.21/0.54 % (3739139)Time elapsed: 0.061 s
% 0.21/0.54 % (3739139)Peak memory usage: 12 MB
% 0.21/0.54 % (3739139)Instructions burned: 109 (million)
% 0.21/0.54 % (3739151) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3739131-3739151"...
% 0.21/0.54 % (3739151)...printing done.
% 0.21/0.54 % (3739151)Refutation found. Thanks to Tanya!
% 0.21/0.54 % SZS status Theorem for theBenchmark
% 0.21/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.54 % (3739151)------------------------------
% 0.21/0.54 % (3739151)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.54 % (3739151)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.54 % (3739151)CaDiCaL version: 2.1.3
% 0.21/0.54 % (3739151)Termination reason: Refutation
% 0.21/0.54 % (3739151)Time elapsed: 0.027 s
% 0.21/0.54 % (3739151)Peak memory usage: 13 MB
% 0.21/0.54 % (3739151)Instructions burned: 100 (million)
% 0.21/0.54 % (3739131)Success in time 0.124 s
% 0.21/0.54 % Vampire exiting
%------------------------------------------------------------------------------