%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : COM047_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 : n002.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 09:40:13 AM UTC 2026
% Result : ContradictoryAxioms 0.95s 0.39s
% Output : Refutation 0.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 17 unt; 0 typ; 0 def)
% Number of atoms : 17 ( 7 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 16 ( 14 usr; 1 prp; 0-3 aty)
% Number of functors : 63 ( 63 usr; 10 con; 0-6 aty)
% Number of variables : 24 ( 24 !; 0 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
int: $tType ).
tff(type_def_7,type,
list: $tType > $tType ).
tff(type_def_8,type,
nat: $tType ).
tff(type_def_9,type,
atom: $tType ).
tff(type_def_10,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
combb:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,X1) * fun(X2,X0) ) > fun(X2,X1) ) ).
tff(func_def_1,type,
combk:
!>[X0: $tType,X1: $tType] : fun(X0,fun(X1,X0)) ).
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,
div_mod:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_4,type,
one_one:
!>[X0: $tType] : X0 ).
tff(func_def_5,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_6,type,
iprod:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > X0 ) ).
tff(func_def_7,type,
zipwith0:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * list(X0) * list(X1) ) > list(X2) ) ).
tff(func_def_8,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_9,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_10,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_11,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_12,type,
list_rec:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),fun(X0,X0))) * list(X1) ) > X0 ) ).
tff(func_def_13,type,
list_size:
!>[X0: $tType] : ( ( fun(X0,nat) * list(X0) ) > nat ) ).
tff(func_def_14,type,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_15,type,
sublist:
!>[X0: $tType] : ( ( list(X0) * fun(nat,bool) ) > list(X0) ) ).
tff(func_def_16,type,
tl:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_17,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_18,type,
asubst: ( int * list(int) * atom ) > atom ).
tff(func_def_19,type,
dvd: ( int * int * list(int) ) > atom ).
tff(func_def_20,type,
c_PresArith_Oatom_OLe: ( int * list(int) ) > atom ).
tff(func_def_21,type,
nDvd: ( int * int * list(int) ) > atom ).
tff(func_def_22,type,
atom_case:
!>[X0: $tType] : ( ( fun(int,fun(list(int),X0)) * fun(int,fun(int,fun(list(int),X0))) * fun(int,fun(int,fun(list(int),X0))) * atom ) > X0 ) ).
tff(func_def_23,type,
atom_rec:
!>[X0: $tType] : ( ( fun(int,fun(list(int),X0)) * fun(int,fun(int,fun(list(int),X0))) * fun(int,fun(int,fun(list(int),X0))) * atom ) > X0 ) ).
tff(func_def_24,type,
atom_size: atom > nat ).
tff(func_def_25,type,
decr_Z: atom > atom ).
tff(func_def_26,type,
divisor: atom > int ).
tff(func_def_27,type,
hd_coeff: atom > int ).
tff(func_def_28,type,
hd_coeff1: ( int * atom ) > atom ).
tff(func_def_29,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_30,type,
fFalse: bool ).
tff(func_def_31,type,
fNot: fun(bool,bool) ).
tff(func_def_32,type,
fTrue: bool ).
tff(func_def_33,type,
fdisj: fun(bool,fun(bool,bool)) ).
tff(func_def_34,type,
fequal:
!>[X0: $tType] : ( X0 > fun(X0,bool) ) ).
tff(func_def_35,type,
a: atom ).
tff(func_def_36,type,
e: list(int) ).
tff(func_def_37,type,
i: int ).
tff(func_def_38,type,
int1: int ).
tff(func_def_39,type,
j: int ).
tff(func_def_40,type,
list1: list(int) ).
tff(func_def_41,type,
sK0:
!>[X0: $tType] : ( ( list(X0) * X0 ) > X0 ) ).
tff(func_def_42,type,
sK1:
!>[X0: $tType] : ( ( list(X0) * X0 ) > list(X0) ) ).
tff(func_def_43,type,
sK2:
!>[X0: $tType] : ( ( list(X0) * X0 ) > X0 ) ).
tff(func_def_44,type,
sK3:
!>[X0: $tType] : ( ( list(X0) * X0 ) > X0 ) ).
tff(func_def_45,type,
sK4:
!>[X0: $tType] : ( ( list(X0) * X0 ) > list(X0) ) ).
tff(func_def_46,type,
sK5:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_47,type,
sK6:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_48,type,
sK7:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_49,type,
sK8:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_50,type,
sK9: atom > int ).
tff(func_def_51,type,
sK10: atom > list(int) ).
tff(func_def_52,type,
sK11: atom > int ).
tff(func_def_53,type,
sK12: atom > int ).
tff(func_def_54,type,
sK13: atom > list(int) ).
tff(func_def_55,type,
sK14: atom > int ).
tff(func_def_56,type,
sK15: atom > int ).
tff(func_def_57,type,
sK16: atom > list(int) ).
tff(func_def_58,type,
sK17:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_59,type,
sK18:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_60,type,
sK19:
!>[X0: $tType] : ( fun(list(X0),bool) > list(X0) ) ).
tff(pred_def_1,type,
one:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
ring:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
zero_neq_one:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
semiring_div:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
equal_equal:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_7,type,
listMem:
!>[X0: $tType] : ( ( X0 * list(X0) ) > $o ) ).
tff(pred_def_8,type,
list_all:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_9,type,
list_ex1:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_10,type,
member1:
!>[X0: $tType] : ( ( list(X0) * X0 ) > $o ) ).
tff(pred_def_11,type,
null:
!>[X0: $tType] : ( list(X0) > $o ) ).
tff(pred_def_12,type,
i_Z: ( atom * list(int) ) > $o ).
tff(pred_def_13,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_14,type,
pp: bool > $o ).
tff(f1,axiom,
a = c_PresArith_Oatom_OLe(int1,list1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_Le) ).
tff(f4,axiom,
pp(atom_case(bool,aa(fun(list(int),bool),fun(int,fun(list(int),bool)),combk(fun(list(int),bool),int),aa(bool,fun(list(int),bool),combk(bool,list(int)),fFalse)),aa(fun(int,fun(list(int),bool)),fun(int,fun(int,fun(list(int),bool))),combk(fun(int,fun(list(int),bool)),int),aa(fun(list(int),bool),fun(int,fun(list(int),bool)),combk(fun(list(int),bool),int),aa(bool,fun(list(int),bool),combk(bool,list(int)),fTrue))),aa(fun(int,fun(list(int),bool)),fun(int,fun(int,fun(list(int),bool))),combk(fun(int,fun(list(int),bool)),int),aa(fun(list(int),bool),fun(int,fun(list(int),bool)),combk(fun(list(int),bool),int),aa(bool,fun(list(int),bool),combk(bool,list(int)),fTrue))),a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_assms_I1_J) ).
tff(f17,axiom,
! [X0: $tType,X1: list(int),X2: int,X3: fun(int,fun(int,fun(list(int),X0))),X4: fun(int,fun(int,fun(list(int),X0))),X5: fun(int,fun(list(int),X0))] : ( atom_case(X0,X5,X4,X3,c_PresArith_Oatom_OLe(X2,X1)) = aa(list(int),X0,aa(int,fun(list(int),X0),X5,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_16_atom_Osimps_I10_J) ).
tff(f108,axiom,
~ pp(fFalse),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',help_pp_1_1_U) ).
tff(f113,axiom,
! [X0: $tType,X1: $tType,X2: X0,X3: X1] : ( aa(X0,X1,aa(X1,fun(X0,X1),combk(X1,X0),X3),X2) = X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',help_COMBK_1_1_U) ).
tff(f160,plain,
a = c_PresArith_Oatom_OLe(int1,list1),
inference(cnf_transformation,[],[f1]) ).
tff(f165,plain,
pp(atom_case(bool,aa(fun(list(int),bool),fun(int,fun(list(int),bool)),combk(fun(list(int),bool),int),aa(bool,fun(list(int),bool),combk(bool,list(int)),fFalse)),aa(fun(int,fun(list(int),bool)),fun(int,fun(int,fun(list(int),bool))),combk(fun(int,fun(list(int),bool)),int),aa(fun(list(int),bool),fun(int,fun(list(int),bool)),combk(fun(list(int),bool),int),aa(bool,fun(list(int),bool),combk(bool,list(int)),fTrue))),aa(fun(int,fun(list(int),bool)),fun(int,fun(int,fun(list(int),bool))),combk(fun(int,fun(list(int),bool)),int),aa(fun(list(int),bool),fun(int,fun(list(int),bool)),combk(fun(list(int),bool),int),aa(bool,fun(list(int),bool),combk(bool,list(int)),fTrue))),a)),
inference(cnf_transformation,[],[f4]) ).
tff(f180,plain,
! [X0: $tType,X2: int,X3: fun(int,fun(int,fun(list(int),X0))),X1: list(int),X4: fun(int,fun(int,fun(list(int),X0))),X5: fun(int,fun(list(int),X0))] : ( atom_case(X0,X5,X4,X3,c_PresArith_Oatom_OLe(X2,X1)) = aa(list(int),X0,aa(int,fun(list(int),X0),X5,X2),X1) ),
inference(cnf_transformation,[],[f17]) ).
tff(f300,plain,
~ pp(fFalse),
inference(cnf_transformation,[],[f108]) ).
tff(f305,plain,
! [X1: $tType,X0: $tType,X2: X0,X3: X1] : ( aa(X0,X1,aa(X1,fun(X0,X1),combk(X1,X0),X3),X2) = X3 ),
inference(cnf_transformation,[],[f113]) ).
tff(f338,plain,
~ pp(atom_case(bool,aa(fun(list(int),bool),fun(int,fun(list(int),bool)),combk(fun(list(int),bool),int),aa(bool,fun(list(int),bool),combk(bool,list(int)),fFalse)),aa(fun(int,fun(list(int),bool)),fun(int,fun(int,fun(list(int),bool))),combk(fun(int,fun(list(int),bool)),int),aa(fun(list(int),bool),fun(int,fun(list(int),bool)),combk(fun(list(int),bool),int),aa(bool,fun(list(int),bool),combk(bool,list(int)),fTrue))),aa(fun(int,fun(list(int),bool)),fun(int,fun(int,fun(list(int),bool))),combk(fun(int,fun(list(int),bool)),int),aa(fun(list(int),bool),fun(int,fun(list(int),bool)),combk(fun(list(int),bool),int),aa(bool,fun(list(int),bool),combk(bool,list(int)),fTrue))),a)),
inference(consistent_polarity_flipping,[],[f165]) ).
tff(f382,plain,
pp(fFalse),
inference(consistent_polarity_flipping,[],[f300]) ).
tff(f817,plain,
! [X0: $tType,X2: fun(int,fun(int,fun(list(int),X0))),X3: fun(int,fun(int,fun(list(int),X0))),X1: fun(int,fun(list(int),X0))] : ( aa(list(int),X0,aa(int,fun(list(int),X0),X1,int1),list1) = atom_case(X0,X1,X2,X3,a) ),
inference(superposition,[],[f180,f160]) ).
tff(f2868,plain,
~ pp(aa(list(int),bool,aa(int,fun(list(int),bool),aa(fun(list(int),bool),fun(int,fun(list(int),bool)),combk(fun(list(int),bool),int),aa(bool,fun(list(int),bool),combk(bool,list(int)),fFalse)),int1),list1)),
inference(superposition,[],[f338,f817]) ).
tff(f2869,plain,
~ pp(aa(list(int),bool,aa(bool,fun(list(int),bool),combk(bool,list(int)),fFalse),list1)),
inference(forward_demodulation,[],[f2868,f305]) ).
tff(f2882,plain,
~ pp(fFalse),
inference(forward_demodulation,[],[f2869,f305]) ).
tff(f2883,plain,
$false,
inference(forward_subsumption_resolution,[],[f2882,f382]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM047_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n002.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Mon Sep 28 21:53:52 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 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
% 0.95/0.39 % (810135)Will run a generic schedule for satisfiability detection.
% 0.95/0.39 % (810144)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3414428964:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.95/0.39 % (810141)% WARNING: option uhcvi not known.
% 0.95/0.39 % (810140)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1435758705_2999 on theBenchmark for (2999ds/0Mi)
% 0.95/0.39 % (810141)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=268768410:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.95/0.39 % (810143)dis+10_1_sil=32000:sp=arity:random_seed=1249003973:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.95/0.39 % (810142)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3796675279:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.95/0.39 % (810146)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3518623565:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.95/0.39 % (810145)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3794337001:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.95/0.39 % Exception at run slice level
% 0.95/0.39 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.95/0.39 % (810154)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1710403510:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.95/0.39 % Exception at run slice level
% 0.95/0.39 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.95/0.39 % (810144)Instruction limit reached!
% 0.95/0.39 % (810144)------------------------------
% 0.95/0.39 % (810144)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.95/0.39 % (810144)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.95/0.39 % (810144)CaDiCaL version: 2.1.3
% 0.95/0.39 % (810144)Termination reason: Instruction limit
% 0.95/0.39 % (810144)Termination phase: Saturation
% 0.95/0.39 % (810144)Time elapsed: 0.041 s
% 0.95/0.39 % (810144)Peak memory usage: 13 MB
% 0.95/0.39 % (810144)Instructions burned: 119 (million)
% 0.95/0.39 % (810157)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=440826979:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.95/0.39 % (810156)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3686159608:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.95/0.39 % (810143)Instruction limit reached!
% 0.95/0.39 % (810143)------------------------------
% 0.95/0.39 % (810143)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.95/0.39 % (810143)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.95/0.39 % (810143)CaDiCaL version: 2.1.3
% 0.95/0.39 % (810143)Termination reason: Instruction limit
% 0.95/0.39 % (810143)Termination phase: Saturation
% 0.95/0.39 % (810143)Time elapsed: 0.065 s
% 0.95/0.39 % (810143)Peak memory usage: 12 MB
% 0.95/0.39 % (810143)Instructions burned: 104 (million)
% 0.95/0.39 % (810145)Instruction limit reached!
% 0.95/0.39 % (810145)------------------------------
% 0.95/0.39 % (810145)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.95/0.39 % (810145)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.95/0.39 % (810145)CaDiCaL version: 2.1.3
% 0.95/0.39 % (810145)Termination reason: Instruction limit
% 0.95/0.39 % (810145)Termination phase: Saturation
% 0.95/0.39 % (810145)Time elapsed: 0.081 s
% 0.95/0.39 % (810145)Peak memory usage: 13 MB
% 0.95/0.39 % (810145)Instructions burned: 132 (million)
% 0.95/0.39 % (810160)ott-21_1_sil=16000:fs=off:random_seed=3502922180:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.95/0.39 % (810161)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2831948034:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 0.95/0.39 % (810146)Instruction limit reached!
% 0.95/0.39 % (810146)------------------------------
% 0.95/0.39 % (810146)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.95/0.39 % (810146)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.95/0.39 % (810146)CaDiCaL version: 2.1.3
% 0.95/0.39 % (810146)Termination reason: Instruction limit
% 0.95/0.39 % (810146)Termination phase: Saturation
% 0.95/0.39 % (810146)Time elapsed: 0.102 s
% 0.95/0.39 % (810146)Peak memory usage: 13 MB
% 0.95/0.39 % (810146)Instructions burned: 159 (million)
% 0.95/0.39 % (810141) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-810135-810141"...
% 0.95/0.39 % (810141)...printing done.
% 0.95/0.39 % (810141)Refutation found. Thanks to Tanya!
% 0.95/0.39 % SZS status ContradictoryAxioms for theBenchmark
% 0.95/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.95/0.39 % (810141)------------------------------
% 0.95/0.39 % (810141)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.95/0.39 % (810141)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.95/0.39 % (810141)CaDiCaL version: 2.1.3
% 0.95/0.39 % (810141)Termination reason: Refutation
% 0.95/0.39 % (810141)Time elapsed: 0.119 s
% 0.95/0.39 % (810141)Peak memory usage: 13 MB
% 0.95/0.39 % (810141)Instructions burned: 189 (million)
% 0.95/0.39 % (810135)Success in time 0.157 s
% 0.95/0.39 % Vampire exiting
%------------------------------------------------------------------------------