%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL799_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 : n013.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:38 AM UTC 2026
% Result : Theorem 2.25s 1.16s
% Output : Refutation 2.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 41 ( 20 unt; 0 typ; 0 def)
% Number of atoms : 80 ( 42 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 71 ( 32 ~; 25 |; 7 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 5 ( 1 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-4 aty)
% Number of functors : 59 ( 59 usr; 25 con; 0-5 aty)
% Number of variables : 83 ( 82 !; 1 ?; 83 :)
% 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,
lift: fun(dB,fun(nat,dB)) ).
tff(func_def_11,type,
subst: ( dB * dB * 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] : ( ( X0 * 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,
map:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * list(X0) ) > list(X1) ) ).
tff(func_def_17,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_18,type,
shift:
!>[X0: $tType] : ( ( fun(nat,X0) * nat * X0 ) > fun(nat,X0) ) ).
tff(func_def_19,type,
fun1: fun(type,fun(type,type)) ).
tff(func_def_20,type,
type_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(type,fun(type,X0)) * type ) > X0 ) ).
tff(func_def_21,type,
typing: ( fun(nat,type) * dB ) > fun(type,bool) ).
tff(func_def_22,type,
typings: ( fun(nat,type) * list(dB) ) > fun(list(type),bool) ).
tff(func_def_23,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_24,type,
fFalse: bool ).
tff(func_def_25,type,
fTrue: bool ).
tff(func_def_26,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_27,type,
t: type ).
tff(func_def_28,type,
t2: type ).
tff(func_def_29,type,
t_a: type ).
tff(func_def_30,type,
t1: type ).
tff(func_def_31,type,
ts: list(type) ).
tff(func_def_32,type,
a: dB ).
tff(func_def_33,type,
as: list(dB) ).
tff(func_def_34,type,
e: fun(nat,type) ).
tff(func_def_35,type,
ea: fun(nat,type) ).
tff(func_def_36,type,
i: nat ).
tff(func_def_37,type,
ia: nat ).
tff(func_def_38,type,
n: nat ).
tff(func_def_39,type,
rs: list(dB) ).
tff(func_def_40,type,
t3: dB ).
tff(func_def_41,type,
u: dB ).
tff(func_def_42,type,
ua: dB ).
tff(func_def_43,type,
sK0:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_44,type,
sK1: ( dB * fun(nat,type) ) > type ).
tff(func_def_45,type,
sK2: ( dB * fun(nat,type) ) > type ).
tff(func_def_46,type,
sK3: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_47,type,
sK4: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_48,type,
sK5: ( type * dB * dB * fun(nat,type) ) > type ).
tff(func_def_49,type,
sK6: type ).
tff(func_def_50,type,
sK7:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_51,type,
sK8:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_52,type,
sK9:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(func_def_53,type,
sK10: ( dB * dB * dB ) > dB ).
tff(func_def_54,type,
sK11: ( dB * dB * dB ) > dB ).
tff(func_def_55,type,
sK12: ( dB * dB * dB ) > dB ).
tff(func_def_56,type,
sK13: ( dB * dB ) > dB ).
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,
pp: bool > $o ).
tff(f1,axiom,
pp(aa(type,bool,typing(e,u),t1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_uT) ).
tff(f3,axiom,
n = i,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2_True) ).
tff(f9,axiom,
! [X0: nat,X1: type,X2: dB,X3: fun(nat,type),X4: type,X5: dB,X6: fun(nat,type)] :
( pp(aa(type,bool,typing(X6,X5),X4))
=> ( pp(aa(type,bool,typing(X3,X2),X1))
=> ( ( X6 = shift(type,X3,X0,X1) )
=> pp(aa(type,bool,typing(X3,subst(X5,X2,X0)),X4)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_8_subst__lemma) ).
tff(f16,axiom,
~ ! [X0: type] :
( pp(aa(type,bool,typing(shift(type,e,i,t1),var(n)),aa(type,type,aa(type,fun(type,type),fun1,X0),foldr(type,type,fun1,ts,t2))))
=> ~ pp(aa(type,bool,typing(shift(type,e,i,t1),a),X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_15__096_B_Bthesis_O_A_I_B_BT_H_H_O_A_091_124_Ae_060i_058T_062_A_092_060turnstile_062_AVar_An_A_058_AT_H_H_A_092_060Rightarrow_062_ATs_A_061_062_062_AT_H_059_Ae_060i_058T_062_A_092_060turnstile_062_Aa_A_058_AT_H_H_A_124_093_A_061_061_062_Athesis_J_A_061_061_062_Athesis_096) ).
tff(f18,axiom,
! [X0: type,X1: type,X2: type,X3: type] :
( ( aa(type,type,aa(type,fun(type,type),fun1,X3),X2) = aa(type,type,aa(type,fun(type,type),fun1,X1),X0) )
<=> ( ( X3 = X1 )
& ( X2 = X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_17_type_Osimps_I2_J) ).
tff(f19,axiom,
! [X0: type,X1: nat,X2: fun(nat,type)] :
( pp(aa(type,bool,typing(X2,var(X1)),X0))
=> ( aa(nat,type,X2,X1) = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_18_typing__elims_I1_J) ).
tff(f23,axiom,
t1 = aa(type,type,aa(type,fun(type,type),fun1,t),foldr(type,type,fun1,ts,t2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_22_T) ).
tff(f28,axiom,
! [X0: $tType,X1: X0,X2: fun(nat,X0),X3: nat,X4: nat] :
( ( X4 = X3 )
=> ( aa(nat,X0,shift(X0,X2,X4,X1),X3) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_27_shift__eq) ).
tff(f111,conjecture,
pp(aa(type,bool,typing(e,subst(a,u,i)),t)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f112,negated_conjecture,
~ pp(aa(type,bool,typing(e,subst(a,u,i)),t)),
inference(negated_conjecture,[status(cth)],[f111]) ).
tff(f113,plain,
~ pp(aa(type,bool,typing(e,subst(a,u,i)),t)),
inference(flattening,[],[f112]) ).
tff(f116,plain,
! [X0: nat,X1: type,X2: dB,X3: fun(nat,type),X4: type,X5: dB,X6: fun(nat,type)] :
( pp(aa(type,bool,typing(X3,subst(X5,X2,X0)),X4))
| ( shift(type,X3,X0,X1) != X6 )
| ~ pp(aa(type,bool,typing(X3,X2),X1))
| ~ pp(aa(type,bool,typing(X6,X5),X4)) ),
inference(ennf_transformation,[],[f9]) ).
tff(f117,plain,
! [X0: nat,X1: type,X2: dB,X3: fun(nat,type),X4: type,X5: dB,X6: fun(nat,type)] :
( pp(aa(type,bool,typing(X3,subst(X5,X2,X0)),X4))
| ( shift(type,X3,X0,X1) != X6 )
| ~ pp(aa(type,bool,typing(X3,X2),X1))
| ~ pp(aa(type,bool,typing(X6,X5),X4)) ),
inference(flattening,[],[f116]) ).
tff(f123,plain,
! [X0: $tType,X1: X0,X2: fun(nat,X0),X3: nat,X4: nat] :
( ( aa(nat,X0,shift(X0,X2,X4,X1),X3) = X1 )
| ( X3 != X4 ) ),
inference(ennf_transformation,[],[f28]) ).
tff(f130,plain,
! [X0: type,X1: nat,X2: fun(nat,type)] :
( ( aa(nat,type,X2,X1) = X0 )
| ~ pp(aa(type,bool,typing(X2,var(X1)),X0)) ),
inference(ennf_transformation,[],[f19]) ).
tff(f137,plain,
? [X0: type] :
( pp(aa(type,bool,typing(shift(type,e,i,t1),a),X0))
& pp(aa(type,bool,typing(shift(type,e,i,t1),var(n)),aa(type,type,aa(type,fun(type,type),fun1,X0),foldr(type,type,fun1,ts,t2)))) ),
inference(ennf_transformation,[],[f16]) ).
tff(f162,plain,
! [X0: type,X1: type,X2: type,X3: type] :
( ( ( aa(type,type,aa(type,fun(type,type),fun1,X3),X2) = aa(type,type,aa(type,fun(type,type),fun1,X1),X0) )
| ( X1 != X3 )
| ( X0 != X2 ) )
& ( ( ( X3 = X1 )
& ( X2 = X0 ) )
| ( aa(type,type,aa(type,fun(type,type),fun1,X3),X2) != aa(type,type,aa(type,fun(type,type),fun1,X1),X0) ) ) ),
inference(nnf_transformation,[],[f18]) ).
tff(f163,plain,
! [X0: type,X1: type,X2: type,X3: type] :
( ( ( aa(type,type,aa(type,fun(type,type),fun1,X3),X2) = aa(type,type,aa(type,fun(type,type),fun1,X1),X0) )
| ( X1 != X3 )
| ( X0 != X2 ) )
& ( ( ( X3 = X1 )
& ( X2 = X0 ) )
| ( aa(type,type,aa(type,fun(type,type),fun1,X3),X2) != aa(type,type,aa(type,fun(type,type),fun1,X1),X0) ) ) ),
inference(flattening,[],[f162]) ).
tff(f164,plain,
( pp(aa(type,bool,typing(shift(type,e,i,t1),a),sK6))
& pp(aa(type,bool,typing(shift(type,e,i,t1),var(n)),aa(type,type,aa(type,fun(type,type),fun1,sK6),foldr(type,type,fun1,ts,t2)))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(X0,sK6)],[f137]) ).
tff(f175,plain,
~ pp(aa(type,bool,typing(e,subst(a,u,i)),t)),
inference(cnf_transformation,[],[f113]) ).
tff(f179,plain,
! [X2: dB,X3: fun(nat,type),X0: nat,X1: type,X6: fun(nat,type),X4: type,X5: dB] :
( pp(aa(type,bool,typing(X3,subst(X5,X2,X0)),X4))
| ( shift(type,X3,X0,X1) != X6 )
| ~ pp(aa(type,bool,typing(X3,X2),X1))
| ~ pp(aa(type,bool,typing(X6,X5),X4)) ),
inference(cnf_transformation,[],[f117]) ).
tff(f181,plain,
t1 = aa(type,type,aa(type,fun(type,type),fun1,t),foldr(type,type,fun1,ts,t2)),
inference(cnf_transformation,[],[f23]) ).
tff(f190,plain,
pp(aa(type,bool,typing(e,u),t1)),
inference(cnf_transformation,[],[f1]) ).
tff(f202,plain,
! [X0: $tType,X2: fun(nat,X0),X3: nat,X1: X0,X4: nat] :
( ( aa(nat,X0,shift(X0,X2,X4,X1),X3) = X1 )
| ( X3 != X4 ) ),
inference(cnf_transformation,[],[f123]) ).
tff(f209,plain,
! [X2: fun(nat,type),X0: type,X1: nat] :
( ~ pp(aa(type,bool,typing(X2,var(X1)),X0))
| ( aa(nat,type,X2,X1) = X0 ) ),
inference(cnf_transformation,[],[f130]) ).
tff(f219,plain,
! [X2: type,X3: type,X0: type,X1: type] :
( ( aa(type,type,aa(type,fun(type,type),fun1,X3),X2) != aa(type,type,aa(type,fun(type,type),fun1,X1),X0) )
| ( X1 = X3 ) ),
inference(cnf_transformation,[],[f163]) ).
tff(f222,plain,
pp(aa(type,bool,typing(shift(type,e,i,t1),var(n)),aa(type,type,aa(type,fun(type,type),fun1,sK6),foldr(type,type,fun1,ts,t2)))),
inference(cnf_transformation,[],[f164]) ).
tff(f223,plain,
pp(aa(type,bool,typing(shift(type,e,i,t1),a),sK6)),
inference(cnf_transformation,[],[f164]) ).
tff(f226,plain,
n = i,
inference(cnf_transformation,[],[f3]) ).
tff(f265,plain,
pp(aa(type,bool,typing(shift(type,e,i,t1),var(i)),aa(type,type,aa(type,fun(type,type),fun1,sK6),foldr(type,type,fun1,ts,t2)))),
inference(definition_unfolding,[],[f222,f226]) ).
tff(f266,plain,
! [X2: dB,X3: fun(nat,type),X0: nat,X1: type,X4: type,X5: dB] :
( ~ pp(aa(type,bool,typing(shift(type,X3,X0,X1),X5),X4))
| ~ pp(aa(type,bool,typing(X3,X2),X1))
| pp(aa(type,bool,typing(X3,subst(X5,X2,X0)),X4)) ),
inference(equality_resolution,[],[f179]) ).
tff(f270,plain,
! [X0: $tType,X2: fun(nat,X0),X1: X0,X4: nat] : ( aa(nat,X0,shift(X0,X2,X4,X1),X4) = X1 ),
inference(equality_resolution,[],[f202]) ).
tff(f302,plain,
! [X0: type,X1: type] :
( ( t1 != aa(type,type,aa(type,fun(type,type),fun1,X0),X1) )
| ( t = X0 ) ),
inference(superposition,[],[f219,f181]) ).
tff(f339,plain,
aa(type,type,aa(type,fun(type,type),fun1,sK6),foldr(type,type,fun1,ts,t2)) = aa(nat,type,shift(type,e,i,t1),i),
inference(resolution,[],[f265,f209]) ).
tff(f340,plain,
t1 = aa(type,type,aa(type,fun(type,type),fun1,sK6),foldr(type,type,fun1,ts,t2)),
inference(forward_demodulation,[],[f339,f270]) ).
tff(f342,plain,
( ( t1 != t1 )
| ( t = sK6 ) ),
inference(superposition,[],[f302,f340]) ).
tff(f347,plain,
t = sK6,
inference(trivial_inequality_removal,[],[f342]) ).
tff(f350,plain,
~ pp(aa(type,bool,typing(e,subst(a,u,i)),sK6)),
inference(superposition,[],[f175,f347]) ).
tff(f379,plain,
! [X0: dB] :
( pp(aa(type,bool,typing(e,subst(a,X0,i)),sK6))
| ~ pp(aa(type,bool,typing(e,X0),t1)) ),
inference(resolution,[],[f266,f223]) ).
tff(f385,plain,
~ pp(aa(type,bool,typing(e,u),t1)),
inference(resolution,[],[f379,f350]) ).
tff(f386,plain,
$false,
inference(forward_subsumption_resolution,[],[f385,f190]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL799_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.39 % Computer : n013.cluster.edu
% 0.10/0.39 % Model : x86_64 x86_64
% 0.10/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39 % Memory : 8046.5625MB
% 0.10/0.39 % 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:51:52 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.25/1.16 % (415530)Detected formulas, will run a generic FOF schedule.
% 2.25/1.16 % (415539)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1512517437:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.25/1.16 % (415539)First to succeed.
% 2.25/1.16 % (415539)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-415530"
% 2.25/1.16 % (415538)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2664612535:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.25/1.16 % (415536)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=798357800:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.25/1.16 % (415537)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=728081126:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.25/1.16 % (415541)dis-21_1_sil=8000:lcm=predicate:random_seed=2117111543: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.25/1.16 % (415535)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=2325822010:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.25/1.16 % (415540)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1518287277:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.25/1.16 % (415538)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.25/1.16 % (415538)Refutation not found, incomplete strategy
% 2.25/1.16 % (415538)------------------------------
% 2.25/1.16 % (415538)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.25/1.16 % (415538)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/1.16 % (415538)CaDiCaL version: 2.1.3
% 2.25/1.16 % (415538)Termination reason: Refutation not found, incomplete strategy
% 2.25/1.16 % (415538)Time elapsed: 0.003 s
% 2.25/1.16 % (415538)Peak memory usage: 88 MB
% 2.25/1.16 % (415538)Instructions burned: 2 (million)
% 2.25/1.16 % (415537)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.25/1.16 % (415541)Also succeeded, but the first one will report.
% 2.25/1.16 % (415540)Instruction limit reached!
% 2.25/1.16 % (415540)------------------------------
% 2.25/1.16 % (415540)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.25/1.16 % (415540)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/1.16 % (415540)CaDiCaL version: 2.1.3
% 2.25/1.16 % (415540)Termination reason: Instruction limit
% 2.25/1.16 % (415540)Termination phase: Saturation
% 2.25/1.16 % (415540)Time elapsed: 0.086 s
% 2.25/1.16 % (415540)Peak memory usage: 89 MB
% 2.25/1.16 % (415540)Instructions burned: 141 (million)
% 2.25/1.16 % (415539)Refutation found. Thanks to Tanya!
% 2.25/1.16 % SZS status Theorem for theBenchmark
% 2.25/1.16 % SZS output start Proof for theBenchmark
% See solution above
% 2.65/1.32 % (415539)------------------------------
% 2.65/1.32 % (415539)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.65/1.32 % (415539)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.65/1.32 % (415539)CaDiCaL version: 2.1.3
% 2.65/1.32 % (415539)Termination reason: Refutation
% 2.65/1.32 % (415539)Time elapsed: 0.008 s
% 2.65/1.32 % (415539)Peak memory usage: 89 MB
% 2.65/1.32 % (415539)Instructions burned: 23 (million)
% 2.65/1.32 % (415539)------------------------------
% 2.65/1.32 % (415539)------------------------------
% 2.65/1.32 % (415530)Success in time 0.295 s
% 2.65/1.32 % Vampire exiting
%------------------------------------------------------------------------------