%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL798_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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 3.69s 1.55s
% Output : Refutation 3.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 16 unt; 0 typ; 2 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 53 ( 28 ~; 20 |; 0 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 10 ( 9 usr; 3 prp; 0-4 aty)
% Number of functors : 79 ( 79 usr; 26 con; 0-5 aty)
% Number of variables : 22 ( 0 sgn 22 !; 0 ?; 22 :)
% 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,
combi:
!>[X0: $tType] : fun(X0,X0) ).
tff(func_def_3,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * 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,
beta: fun(dB,fun(dB,bool)) ).
tff(func_def_7,type,
abs: dB > dB ).
tff(func_def_8,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_9,type,
var: nat > dB ).
tff(func_def_10,type,
dB_size: dB > nat ).
tff(func_def_11,type,
lift: fun(dB,fun(nat,dB)) ).
tff(func_def_12,type,
subst: ( dB * dB * nat ) > dB ).
tff(func_def_13,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_14,type,
foldr:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X1)) * list(X0) * X1 ) > X1 ) ).
tff(func_def_15,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_16,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_17,type,
map:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * list(X0) ) > list(X1) ) ).
tff(func_def_18,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_19,type,
shift:
!>[X0: $tType] : ( ( fun(nat,X0) * nat * X0 ) > fun(nat,X0) ) ).
tff(func_def_20,type,
fun1: fun(type,fun(type,type)) ).
tff(func_def_21,type,
type_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(type,fun(type,X0)) * type ) > X0 ) ).
tff(func_def_22,type,
typing: ( fun(nat,type) * 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,
fFalse: bool ).
tff(func_def_26,type,
fTrue: bool ).
tff(func_def_27,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_28,type,
t2: type ).
tff(func_def_29,type,
t1: type ).
tff(func_def_30,type,
t_a: type ).
tff(func_def_31,type,
t: type ).
tff(func_def_32,type,
ts: list(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,
n: nat ).
tff(func_def_40,type,
rs: list(dB) ).
tff(func_def_41,type,
t3: dB ).
tff(func_def_42,type,
u: dB ).
tff(func_def_43,type,
ua: dB ).
tff(func_def_44,type,
sK2: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_45,type,
sK3: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_46,type,
sK4: ( type * dB * dB * fun(nat,type) ) > type ).
tff(func_def_47,type,
sK5: ( dB * fun(nat,type) ) > type ).
tff(func_def_48,type,
sK6: ( dB * fun(nat,type) ) > type ).
tff(func_def_49,type,
sK7: list(type) ).
tff(func_def_50,type,
sK8: type ).
tff(func_def_51,type,
sK9: ( type * type * list(dB) * fun(nat,type) ) > list(type) ).
tff(func_def_52,type,
sK10: ( type * list(dB) * nat * fun(nat,type) ) > list(type) ).
tff(func_def_53,type,
sK11: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_54,type,
sK12: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_55,type,
sK13: dB > dB ).
tff(func_def_56,type,
sK14: dB > dB ).
tff(func_def_57,type,
sK15: dB > list(dB) ).
tff(func_def_58,type,
sK16: dB > list(dB) ).
tff(func_def_59,type,
sK17: dB > nat ).
tff(func_def_60,type,
sK18: dB > dB ).
tff(func_def_61,type,
sK19:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_62,type,
sK20: ( dB * dB ) > dB ).
tff(func_def_63,type,
sK21: ( dB * dB * dB ) > dB ).
tff(func_def_64,type,
sK22: ( dB * dB * dB ) > dB ).
tff(func_def_65,type,
sK23: ( dB * dB * dB ) > dB ).
tff(func_def_66,type,
sK24: ( dB * list(dB) * dB ) > dB ).
tff(func_def_67,type,
sK25: ( dB * list(dB) * dB ) > dB ).
tff(func_def_68,type,
sK26: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_69,type,
sK27: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_70,type,
sK28: ( dB * list(dB) * dB ) > dB ).
tff(func_def_71,type,
sK29: ( dB * list(dB) * nat ) > list(dB) ).
tff(func_def_72,type,
sK30:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > list(X0) ) ).
tff(func_def_73,type,
sK31:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > X0 ) ).
tff(func_def_74,type,
sK32:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_75,type,
sK33:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_76,type,
sK34:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > 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,
pp: bool > $o ).
tff(pred_def_5,type,
sP0: dB > $o ).
tff(pred_def_6,type,
sP1: ( dB * list(dB) * dB ) > $o ).
tff(pred_def_7,type,
sQ35_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f3,axiom,
pp(aa(dB,bool,it,u)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2_uIT) ).
tff(f4,axiom,
pp(aa(type,bool,typing(e,u),t)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_uT) ).
tff(f5,axiom,
! [X0: fun(nat,type),X1: type,X2: dB,X3: nat] :
( pp(aa(type,bool,typing(shift(type,X0,X3,t),a),X1))
=> ( pp(aa(dB,bool,it,X2))
=> ( pp(aa(type,bool,typing(X0,X2),t))
=> pp(aa(dB,bool,it,subst(a,X2,X3))) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_4__096ALL_Ae_AT_H_Au_Ai_O_Ae_060i_058T_062_A_092_060turnstile_062_Aa_A_058_AT_H_A_N_N_062_AIT_Au_A_N_N_062_Ae_A_092_060turnstile_062_Au_A_058_AT_A_N_N_062_AIT_A_Ia_091u_Pi_093_J_096) ).
tff(f7,axiom,
pp(aa(type,bool,typing(shift(type,e,i,t),a),t2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_6_argT) ).
tff(f112,conjecture,
pp(aa(dB,bool,it,subst(a,u,i))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f113,negated_conjecture,
~ pp(aa(dB,bool,it,subst(a,u,i))),
inference(negated_conjecture,[status(cth)],[f112]) ).
tff(f116,plain,
~ pp(aa(dB,bool,it,subst(a,u,i))),
inference(flattening,[],[f113]) ).
tff(f117,plain,
! [X0: fun(nat,type),X1: type,X2: dB,X3: nat] :
( pp(aa(dB,bool,it,subst(a,X2,X3)))
| ~ pp(aa(type,bool,typing(X0,X2),t))
| ~ pp(aa(dB,bool,it,X2))
| ~ pp(aa(type,bool,typing(shift(type,X0,X3,t),a),X1)) ),
inference(ennf_transformation,[],[f5]) ).
tff(f118,plain,
! [X0: fun(nat,type),X1: type,X2: dB,X3: nat] :
( pp(aa(dB,bool,it,subst(a,X2,X3)))
| ~ pp(aa(type,bool,typing(X0,X2),t))
| ~ pp(aa(dB,bool,it,X2))
| ~ pp(aa(type,bool,typing(shift(type,X0,X3,t),a),X1)) ),
inference(flattening,[],[f117]) ).
tff(f228,plain,
pp(aa(dB,bool,it,u)),
inference(cnf_transformation,[],[f3]) ).
tff(f229,plain,
pp(aa(type,bool,typing(e,u),t)),
inference(cnf_transformation,[],[f4]) ).
tff(f230,plain,
! [X2: dB,X3: nat,X0: fun(nat,type),X1: type] :
( pp(aa(dB,bool,it,subst(a,X2,X3)))
| ~ pp(aa(type,bool,typing(X0,X2),t))
| ~ pp(aa(dB,bool,it,X2))
| ~ pp(aa(type,bool,typing(shift(type,X0,X3,t),a),X1)) ),
inference(cnf_transformation,[],[f118]) ).
tff(f232,plain,
pp(aa(type,bool,typing(shift(type,e,i,t),a),t2)),
inference(cnf_transformation,[],[f7]) ).
tff(f395,plain,
~ pp(aa(dB,bool,it,subst(a,u,i))),
inference(cnf_transformation,[],[f116]) ).
tff(f1005,plain,
! [X0: fun(nat,type),X1: type] :
( ~ pp(aa(type,bool,typing(X0,u),t))
| ~ pp(aa(dB,bool,it,u))
| ~ pp(aa(type,bool,typing(shift(type,X0,i,t),a),X1)) ),
inference(resolution,[],[f230,f395]) ).
tff(f1007,definition,
( spl36_1
<=> pp(aa(dB,bool,it,u)) ),
introduced(definition,[new_symbols(definition,[spl36_1])],[avatar_definition]) ).
tff(f1008,plain,
( ~ pp(aa(dB,bool,it,u))
| spl36_1 ),
inference(avatar_component_clause,[],[f1007]) ).
tff(f1010,definition,
( spl36_2
<=> ! [X0: fun(nat,type),X1: type] :
( ~ pp(aa(type,bool,typing(X0,u),t))
| ~ pp(aa(type,bool,typing(shift(type,X0,i,t),a),X1)) ) ),
introduced(definition,[new_symbols(definition,[spl36_2])],[avatar_definition]) ).
tff(f1011,plain,
( ! [X0: fun(nat,type),X1: type] :
( ~ pp(aa(type,bool,typing(shift(type,X0,i,t),a),X1))
| ~ pp(aa(type,bool,typing(X0,u),t)) )
| ~ spl36_2 ),
inference(avatar_component_clause,[],[f1010]) ).
tff(f1012,plain,
( ~ spl36_1
| spl36_2 ),
inference(avatar_split_clause,[],[f1005,f1010,f1007]) ).
tff(f1013,plain,
( $false
| spl36_1 ),
inference(resolution,[],[f1008,f228]) ).
tff(f1014,plain,
spl36_1,
inference(avatar_contradiction_clause,[],[f1013]) ).
tff(f1018,plain,
( ~ pp(aa(type,bool,typing(e,u),t))
| ~ spl36_2 ),
inference(resolution,[],[f1011,f232]) ).
tff(f1021,plain,
( $false
| ~ spl36_2 ),
inference(resolution,[],[f1018,f229]) ).
tff(f1023,plain,
~ spl36_2,
inference(avatar_contradiction_clause,[],[f1021]) ).
cnf(s1,plain,
( ~ spl36_1
| spl36_2 ),
inference(sat_conversion,[],[f1012]) ).
cnf(s2,plain,
spl36_1,
inference(sat_conversion,[],[f1014]) ).
cnf(s3,plain,
~ spl36_2,
inference(sat_conversion,[],[f1023]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s3,s2]) ).
tff(f1024,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL798_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n005.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 16:52:17 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.44 Running first-order theorem proving
% 0.12/0.44 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.85/1.36 % (11865)Detected formulas, will run a generic FOF schedule.
% 2.85/1.36 % (11879)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1706116414:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.85/1.36 % (11875)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=3381429713:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.85/1.36 % (11876)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=628252441:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.85/1.36 % (11879)Instruction limit reached!
% 2.85/1.36 % (11879)------------------------------
% 2.85/1.36 % (11879)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.85/1.36 % (11879)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.85/1.36 % (11879)CaDiCaL version: 2.1.3
% 2.85/1.36 % (11879)Termination reason: Instruction limit
% 2.85/1.36 % (11879)Termination phase: Saturation
% 2.85/1.36 % (11879)Time elapsed: 0.038 s
% 2.85/1.36 % (11879)Peak memory usage: 89 MB
% 2.85/1.36 % (11879)Instructions burned: 121 (million)
% 2.85/1.36 % (11881)dis-21_1_sil=8000:lcm=predicate:random_seed=1836646899: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.85/1.36 % (11880)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3452782256:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.85/1.36 % (11878)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3664916873:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.85/1.36 % (11877)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=1552161591:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.85/1.36 % (11878)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.85/1.36 % (11878)Refutation not found, incomplete strategy
% 2.85/1.36 % (11878)------------------------------
% 2.85/1.36 % (11878)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.85/1.36 % (11878)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.85/1.36 % (11878)CaDiCaL version: 2.1.3
% 2.85/1.36 % (11878)Termination reason: Refutation not found, incomplete strategy
% 2.85/1.36 % (11878)Time elapsed: 0.002 s
% 2.85/1.36 % (11878)Peak memory usage: 88 MB
% 2.85/1.36 % (11878)Instructions burned: 2 (million)
% 2.85/1.36 % (11877)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.85/1.36 % (11881)First to succeed.
% 2.85/1.36 % (11881)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-11865"
% 2.85/1.36 % (11880)Instruction limit reached!
% 2.85/1.36 % (11880)------------------------------
% 2.85/1.36 % (11880)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.85/1.36 % (11880)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.85/1.36 % (11880)CaDiCaL version: 2.1.3
% 2.85/1.36 % (11880)Termination reason: Instruction limit
% 2.85/1.36 % (11880)Termination phase: Saturation
% 2.85/1.36 % (11880)Time elapsed: 0.082 s
% 2.85/1.36 % (11880)Peak memory usage: 89 MB
% 2.85/1.36 % (11880)Instructions burned: 139 (million)
% 2.85/1.36 % (11909)lrs+10_1_sil=8000:sp=occurrence:random_seed=2735721602:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.85/1.36 % (11909)Instruction limit reached!
% 2.85/1.36 % (11909)------------------------------
% 2.85/1.36 % (11909)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.85/1.36 % (11909)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.85/1.36 % (11909)CaDiCaL version: 2.1.3
% 2.85/1.36 % (11909)Termination reason: Instruction limit
% 2.85/1.36 % (11909)Termination phase: Saturation
% 2.85/1.36 % (11909)Time elapsed: 0.072 s
% 2.85/1.36 % (11909)Peak memory usage: 89 MB
% 2.85/1.36 % (11909)Instructions burned: 287 (million)
% 2.85/1.36 % (11935)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2355141697:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.85/1.36 % (11935)Also succeeded, but the first one will report.
% 2.85/1.36 % (11878)------------------------------
% 2.85/1.36 % (11878)------------------------------
% 2.85/1.36 % (11959)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2780895961:i=325:sd=1:ss=axioms:sgt=32_2996 on theBenchmark for (2996ds/325Mi)
% 3.69/1.55 % (11959)Also succeeded, but the first one will report.
% 3.69/1.55 % (11881)Refutation found. Thanks to Tanya!
% 3.69/1.55 % SZS status Theorem for theBenchmark
% 3.69/1.55 % SZS output start Proof for theBenchmark
% See solution above
% 3.69/1.55 % (11881)------------------------------
% 3.69/1.55 % (11881)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.69/1.55 % (11881)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.69/1.55 % (11881)CaDiCaL version: 2.1.3
% 3.69/1.55 % (11881)Termination reason: Refutation
% 3.69/1.55 % (11881)Time elapsed: 0.026 s
% 3.69/1.55 % (11881)Peak memory usage: 90 MB
% 3.69/1.55 % (11881)Instructions burned: 42 (million)
% 3.69/1.55 % (11881)------------------------------
% 3.69/1.55 % (11881)------------------------------
% 3.69/1.55 % (11865)Success in time 0.425 s
% 3.69/1.55 % Vampire exiting
%------------------------------------------------------------------------------