%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL806_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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 11:56:40 AM UTC 2026
% Result : Theorem 2.92s 1.34s
% Output : Refutation 3.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 61 ( 27 ~; 21 |; 10 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 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 : 58 ( 58 usr; 33 con; 0-5 aty)
% Number of variables : 36 ( 29 !; 7 ?; 36 :)
% 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: fun(nat,type) ).
tff(func_def_52,type,
sK1: type ).
tff(func_def_53,type,
sK2: dB ).
tff(func_def_54,type,
sK3: nat ).
tff(func_def_55,type,
sK4: 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] : ( ( 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/sandbox/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/sandbox/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(f121,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(f127,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(f128,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,[],[f127]) ).
tff(f129,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),sK0),sK3),t)),b),sK1))
& pp(aa(dB,bool,it,sK2))
& pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,sK0),sK2),t))
& ~ pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),sK2),sK3))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f121]) ).
tff(f130,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),sK4)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X4,sK4)],[f128]) ).
tff(f131,plain,
~ pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),sK2),sK3))),
inference(cnf_transformation,[],[f129]) ).
tff(f132,plain,
pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,sK0),sK2),t)),
inference(cnf_transformation,[],[f129]) ).
tff(f133,plain,
pp(aa(dB,bool,it,sK2)),
inference(cnf_transformation,[],[f129]) ).
tff(f134,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),sK0),sK3),t)),b),sK1)),
inference(cnf_transformation,[],[f129]) ).
tff(f143,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(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(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,[],[f130]) ).
tff(f146,plain,
! [X0: dB] :
( pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),X0),sK3)))
| ~ pp(aa(dB,bool,it,X0))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,sK0),X0),t)) ),
inference(resolution,[],[f134,f143]) ).
tff(f148,plain,
( ~ pp(aa(dB,bool,it,sK2))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,sK0),sK2),t)) ),
inference(resolution,[],[f146,f131]) ).
tff(f149,plain,
~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,sK0),sK2),t)),
inference(forward_subsumption_resolution,[],[f148,f133]) ).
tff(f150,plain,
$false,
inference(forward_subsumption_resolution,[],[f149,f132]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL806_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 % Computer : n008.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 16:53:54 UTC 2026
% 0.12/0.40 % CPUTime :
% 0.12/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.92/1.34 % (1449565)Detected formulas, will run a generic FOF schedule.
% 2.92/1.34 % (1449570)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2517016235:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.92/1.34 % (1449574)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3935516980:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.92/1.34 % (1449576)dis-21_1_sil=8000:lcm=predicate:random_seed=1490976435:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.92/1.34 % (1449571)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=433905603:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.92/1.34 % (1449575)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=753038753:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.92/1.34 % (1449572)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=2498421620:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.92/1.34 % (1449573)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=178582939:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.92/1.34 % (1449573)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.92/1.34 % (1449573)First to succeed.
% 2.92/1.34 % (1449573)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1449565"
% 2.92/1.34 % (1449574)Also succeeded, but the first one will report.
% 2.92/1.34 % (1449572)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.92/1.34 % (1449576)Instruction limit reached!
% 2.92/1.34 % (1449576)------------------------------
% 2.92/1.34 % (1449576)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.92/1.34 % (1449576)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.34 % (1449576)CaDiCaL version: 2.1.3
% 2.92/1.34 % (1449576)Termination reason: Instruction limit
% 2.92/1.34 % (1449576)Termination phase: Saturation
% 2.92/1.34 % (1449576)Time elapsed: 0.064 s
% 2.92/1.34 % (1449576)Peak memory usage: 89 MB
% 2.92/1.34 % (1449576)Instructions burned: 130 (million)
% 2.92/1.34 % (1449575)Instruction limit reached!
% 2.92/1.34 % (1449575)------------------------------
% 2.92/1.34 % (1449575)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.92/1.34 % (1449575)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.34 % (1449575)CaDiCaL version: 2.1.3
% 2.92/1.34 % (1449575)Termination reason: Instruction limit
% 2.92/1.34 % (1449575)Termination phase: Saturation
% 2.92/1.34 % (1449575)Time elapsed: 0.079 s
% 2.92/1.34 % (1449575)Peak memory usage: 89 MB
% 2.92/1.34 % (1449575)Instructions burned: 139 (million)
% 2.92/1.34 % Exception at run slice level
% 2.92/1.34 User error: GNN currently only supports monomorphic FOL.
% 2.92/1.34 % (1449584)lrs+10_1_sil=8000:sp=occurrence:random_seed=2287873575:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.92/1.34 % (1449584)Also succeeded, but the first one will report.
% 2.92/1.34 % (1449585)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2893295434:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.92/1.34 % (1449585)Also succeeded, but the first one will report.
% 2.92/1.34 % (1449573)Refutation found. Thanks to Tanya!
% 2.92/1.34 % SZS status Theorem for theBenchmark
% 2.92/1.34 % SZS output start Proof for theBenchmark
% See solution above
% 3.62/1.44 % (1449573)------------------------------
% 3.62/1.44 % (1449573)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.62/1.44 % (1449573)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.62/1.44 % (1449573)CaDiCaL version: 2.1.3
% 3.62/1.44 % (1449573)Termination reason: Refutation
% 3.62/1.44 % (1449573)Time elapsed: 0.006 s
% 3.62/1.44 % (1449573)Peak memory usage: 89 MB
% 3.62/1.44 % (1449573)Instructions burned: 8 (million)
% 3.62/1.44 % (1449573)------------------------------
% 3.62/1.44 % (1449573)------------------------------
% 3.62/1.44 % (1449565)Success in time 0.464 s
% 3.62/1.44 % Vampire exiting
%------------------------------------------------------------------------------