%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : DAT056^1 : TPTP v9.3.1. Released v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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 : Wed Sep 30 07:48:21 AM UTC 2026
% Result : Theorem 0.25s 0.34s
% Output : Refutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 61 ( 21 unt; 0 typ; 6 def)
% Number of atoms : 123 ( 60 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 632 ( 48 ~; 46 |; 4 &; 522 @)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 21 ( 19 usr; 17 con; 0-2 aty)
% Number of variables : 97 ( 0 sgn 75 !; 22 ?; 97 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
lst: $tType ).
thf(type_def_6,type,
a: $tType ).
thf(type_def_7,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
ap: lst > lst > lst ).
thf(func_def_1,type,
cns: a > lst > lst ).
thf(func_def_2,type,
nl: lst ).
thf(func_def_3,type,
xs: lst ).
thf(func_def_5,type,
sK0: lst ).
thf(func_def_6,type,
sK1: a ).
thf(func_def_7,type,
sK2: lst ).
thf(func_def_8,type,
sK3: lst ).
thf(func_def_9,type,
sK4: lst ).
thf(func_def_10,type,
sK5: lst ).
thf(func_def_11,type,
sK6: lst ).
thf(func_def_12,type,
sK7: lst ).
thf(f1,axiom,
! [X0: lst] :
( ! [X2: lst,X1: lst] :
( ( ap @ nl @ ( ap @ X1 @ X2 ) )
= ( ap @ ( ap @ nl @ X1 ) @ X2 ) )
=> ( ! [X3: a,X4: lst] :
( ! [X6: lst,X5: lst] :
( ( ap @ X4 @ ( ap @ X5 @ X6 ) )
= ( ap @ ( ap @ X4 @ X5 ) @ X6 ) )
=> ! [X2: lst,X1: lst] :
( ( ap @ ( cns @ X3 @ X4 ) @ ( ap @ X1 @ X2 ) )
= ( ap @ ( ap @ ( cns @ X3 @ X4 ) @ X1 ) @ X2 ) ) )
=> ! [X5: lst,X6: lst] :
( ( ap @ X0 @ ( ap @ X5 @ X6 ) )
= ( ap @ ( ap @ X0 @ X5 ) @ X6 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_lst_Oinduct_091where_AP_A_061_A_C_Fxs_O_AALL_Ays_Azs_O_Aap_Axs_A_Iap_Ays_Azs_J_A_061_Aap_A_Iap_Axs_Ays_J_Azs_C_093) ).
thf(f2,axiom,
! [X1: lst,X2: a,X0: lst] :
( ( ap @ ( cns @ X2 @ X1 ) @ X0 )
= ( cns @ X2 @ ( ap @ X1 @ X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1p_Osimps_I2_J) ).
thf(f3,axiom,
! [X0: lst] :
( ( ap @ nl @ X0 )
= X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2p_Osimps_I1_J) ).
thf(f4,conjecture,
! [X1: lst,X0: lst] :
( ( ap @ xs @ ( ap @ X0 @ X1 ) )
= ( ap @ ( ap @ xs @ X0 ) @ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
thf(f5,negated_conjecture,
~ ! [X1: lst,X0: lst] :
( ( ap @ xs @ ( ap @ X0 @ X1 ) )
= ( ap @ ( ap @ xs @ X0 ) @ X1 ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
! [X0: lst] :
( ! [X2: lst,X1: lst] :
( ( ap @ nl @ ( ap @ X2 @ X1 ) )
= ( ap @ ( ap @ nl @ X2 ) @ X1 ) )
=> ( ! [X4: lst,X3: a] :
( ! [X5: lst,X6: lst] :
( ( ap @ ( ap @ X4 @ X6 ) @ X5 )
= ( ap @ X4 @ ( ap @ X6 @ X5 ) ) )
=> ! [X8: lst,X7: lst] :
( ( ap @ ( ap @ ( cns @ X3 @ X4 ) @ X8 ) @ X7 )
= ( ap @ ( cns @ X3 @ X4 ) @ ( ap @ X8 @ X7 ) ) ) )
=> ! [X10: lst,X9: lst] :
( ( ap @ ( ap @ X0 @ X9 ) @ X10 )
= ( ap @ X0 @ ( ap @ X9 @ X10 ) ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f7,plain,
! [X0: lst,X1: a,X2: lst] :
( ( ap @ ( cns @ X1 @ X0 ) @ X2 )
= ( cns @ X1 @ ( ap @ X0 @ X2 ) ) ),
inference(rectify,[],[f2]) ).
thf(f8,plain,
? [X1: lst,X0: lst] :
( ( ap @ xs @ ( ap @ X0 @ X1 ) )
!= ( ap @ ( ap @ xs @ X0 ) @ X1 ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f9,plain,
! [X0: lst] :
( ! [X10: lst,X9: lst] :
( ( ap @ ( ap @ X0 @ X9 ) @ X10 )
= ( ap @ X0 @ ( ap @ X9 @ X10 ) ) )
| ? [X4: lst,X3: a] :
( ? [X8: lst,X7: lst] :
( ( ap @ ( ap @ ( cns @ X3 @ X4 ) @ X8 ) @ X7 )
!= ( ap @ ( cns @ X3 @ X4 ) @ ( ap @ X8 @ X7 ) ) )
& ! [X5: lst,X6: lst] :
( ( ap @ ( ap @ X4 @ X6 ) @ X5 )
= ( ap @ X4 @ ( ap @ X6 @ X5 ) ) ) )
| ? [X2: lst,X1: lst] :
( ( ap @ nl @ ( ap @ X2 @ X1 ) )
!= ( ap @ ( ap @ nl @ X2 ) @ X1 ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f10,plain,
! [X0: lst] :
( ? [X4: lst,X3: a] :
( ? [X8: lst,X7: lst] :
( ( ap @ ( ap @ ( cns @ X3 @ X4 ) @ X8 ) @ X7 )
!= ( ap @ ( cns @ X3 @ X4 ) @ ( ap @ X8 @ X7 ) ) )
& ! [X5: lst,X6: lst] :
( ( ap @ ( ap @ X4 @ X6 ) @ X5 )
= ( ap @ X4 @ ( ap @ X6 @ X5 ) ) ) )
| ? [X2: lst,X1: lst] :
( ( ap @ nl @ ( ap @ X2 @ X1 ) )
!= ( ap @ ( ap @ nl @ X2 ) @ X1 ) )
| ! [X10: lst,X9: lst] :
( ( ap @ ( ap @ X0 @ X9 ) @ X10 )
= ( ap @ X0 @ ( ap @ X9 @ X10 ) ) ) ),
inference(flattening,[],[f9]) ).
thf(f11,plain,
! [X0: lst] :
( ? [X1: lst,X2: a] :
( ? [X3: lst,X4: lst] :
( ( ap @ ( cns @ X2 @ X1 ) @ ( ap @ X3 @ X4 ) )
!= ( ap @ ( ap @ ( cns @ X2 @ X1 ) @ X3 ) @ X4 ) )
& ! [X5: lst,X6: lst] :
( ( ap @ X1 @ ( ap @ X6 @ X5 ) )
= ( ap @ ( ap @ X1 @ X6 ) @ X5 ) ) )
| ? [X7: lst,X8: lst] :
( ( ap @ nl @ ( ap @ X7 @ X8 ) )
!= ( ap @ ( ap @ nl @ X7 ) @ X8 ) )
| ! [X9: lst,X10: lst] :
( ( ap @ ( ap @ X0 @ X10 ) @ X9 )
= ( ap @ X0 @ ( ap @ X10 @ X9 ) ) ) ),
inference(rectify,[],[f10]) ).
thf(f12,plain,
! [X0: lst] :
( ( ( ( ap @ ( ap @ ( cns @ sK1 @ sK0 ) @ sK2 ) @ sK3 )
!= ( ap @ ( cns @ sK1 @ sK0 ) @ ( ap @ sK2 @ sK3 ) ) )
& ! [X5: lst,X6: lst] :
( ( ap @ sK0 @ ( ap @ X6 @ X5 ) )
= ( ap @ ( ap @ sK0 @ X6 ) @ X5 ) ) )
| ( ( ap @ ( ap @ nl @ sK4 ) @ sK5 )
!= ( ap @ nl @ ( ap @ sK4 @ sK5 ) ) )
| ! [X9: lst,X10: lst] :
( ( ap @ ( ap @ X0 @ X10 ) @ X9 )
= ( ap @ X0 @ ( ap @ X10 @ X9 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(X1,sK0),skolemize(X2,sK1),skolemize(X3,sK2),skolemize(X4,sK3),skolemize(X7,sK4),skolemize(X8,sK5)],[f11]) ).
thf(f13,plain,
? [X0: lst,X1: lst] :
( ( ap @ xs @ ( ap @ X1 @ X0 ) )
!= ( ap @ ( ap @ xs @ X1 ) @ X0 ) ),
inference(rectify,[],[f8]) ).
thf(f14,plain,
( ( ap @ xs @ ( ap @ sK7 @ sK6 ) )
!= ( ap @ ( ap @ xs @ sK7 ) @ sK6 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X0,sK6),skolemize(X1,sK7)],[f13]) ).
thf(f15,plain,
! [X10: lst,X0: lst,X6: lst,X9: lst,X5: lst] :
( ( ( ap @ sK0 @ ( ap @ X6 @ X5 ) )
= ( ap @ ( ap @ sK0 @ X6 ) @ X5 ) )
| ( ( ap @ ( ap @ X0 @ X10 ) @ X9 )
= ( ap @ X0 @ ( ap @ X10 @ X9 ) ) )
| ( ( ap @ ( ap @ nl @ sK4 ) @ sK5 )
!= ( ap @ nl @ ( ap @ sK4 @ sK5 ) ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f16,plain,
! [X10: lst,X0: lst,X9: lst] :
( ( ( ap @ ( ap @ X0 @ X10 ) @ X9 )
= ( ap @ X0 @ ( ap @ X10 @ X9 ) ) )
| ( ( ap @ ( ap @ nl @ sK4 ) @ sK5 )
!= ( ap @ nl @ ( ap @ sK4 @ sK5 ) ) )
| ( ( ap @ ( ap @ ( cns @ sK1 @ sK0 ) @ sK2 ) @ sK3 )
!= ( ap @ ( cns @ sK1 @ sK0 ) @ ( ap @ sK2 @ sK3 ) ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f17,plain,
! [X0: lst] :
( ( ap @ nl @ X0 )
= X0 ),
inference(cnf_transformation,[],[f3]) ).
thf(f18,plain,
( ( ap @ xs @ ( ap @ sK7 @ sK6 ) )
!= ( ap @ ( ap @ xs @ sK7 ) @ sK6 ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f19,plain,
! [X2: lst,X0: lst,X1: a] :
( ( ap @ ( cns @ X1 @ X0 ) @ X2 )
= ( cns @ X1 @ ( ap @ X0 @ X2 ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f21,definition,
( spl8_1
<=> ( ( ap @ ( ap @ ( cns @ sK1 @ sK0 ) @ sK2 ) @ sK3 )
= ( ap @ ( cns @ sK1 @ sK0 ) @ ( ap @ sK2 @ sK3 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl8_1])],[avatar_definition]) ).
thf(f23,plain,
( ( ( ap @ ( ap @ ( cns @ sK1 @ sK0 ) @ sK2 ) @ sK3 )
!= ( ap @ ( cns @ sK1 @ sK0 ) @ ( ap @ sK2 @ sK3 ) ) )
| spl8_1 ),
inference(avatar_component_clause,[],[f21]) ).
thf(f25,definition,
( spl8_2
<=> ( ( ap @ ( ap @ nl @ sK4 ) @ sK5 )
= ( ap @ nl @ ( ap @ sK4 @ sK5 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl8_2])],[avatar_definition]) ).
thf(f27,plain,
( ( ( ap @ ( ap @ nl @ sK4 ) @ sK5 )
!= ( ap @ nl @ ( ap @ sK4 @ sK5 ) ) )
| spl8_2 ),
inference(avatar_component_clause,[],[f25]) ).
thf(f29,definition,
( spl8_3
<=> ! [X9: lst,X0: lst,X10: lst] :
( ( ap @ ( ap @ X0 @ X10 ) @ X9 )
= ( ap @ X0 @ ( ap @ X10 @ X9 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl8_3])],[avatar_definition]) ).
thf(f30,plain,
( ! [X10: lst,X0: lst,X9: lst] :
( ( ap @ ( ap @ X0 @ X10 ) @ X9 )
= ( ap @ X0 @ ( ap @ X10 @ X9 ) ) )
| ~ spl8_3 ),
inference(avatar_component_clause,[],[f29]) ).
thf(f31,plain,
( ~ spl8_1
| ~ spl8_2
| spl8_3 ),
inference(avatar_split_clause,[],[f16,f29,f25,f21]) ).
thf(f33,definition,
( spl8_4
<=> ! [X6: lst,X5: lst] :
( ( ap @ sK0 @ ( ap @ X6 @ X5 ) )
= ( ap @ ( ap @ sK0 @ X6 ) @ X5 ) ) ),
introduced(definition,[new_symbols(definition,[spl8_4])],[avatar_definition]) ).
thf(f34,plain,
( ! [X6: lst,X5: lst] :
( ( ap @ sK0 @ ( ap @ X6 @ X5 ) )
= ( ap @ ( ap @ sK0 @ X6 ) @ X5 ) )
| ~ spl8_4 ),
inference(avatar_component_clause,[],[f33]) ).
thf(f35,plain,
( ~ spl8_2
| spl8_3
| spl8_4 ),
inference(avatar_split_clause,[],[f15,f33,f29,f25]) ).
thf(f37,definition,
( spl8_5
<=> ( ( ap @ xs @ ( ap @ sK7 @ sK6 ) )
= ( ap @ ( ap @ xs @ sK7 ) @ sK6 ) ) ),
introduced(definition,[new_symbols(definition,[spl8_5])],[avatar_definition]) ).
thf(f39,plain,
( ( ( ap @ xs @ ( ap @ sK7 @ sK6 ) )
!= ( ap @ ( ap @ xs @ sK7 ) @ sK6 ) )
| spl8_5 ),
inference(avatar_component_clause,[],[f37]) ).
thf(f40,plain,
~ spl8_5,
inference(avatar_split_clause,[],[f18,f37]) ).
thf(f41,plain,
( ( ( ap @ ( ap @ nl @ sK4 ) @ sK5 )
!= ( ap @ sK4 @ sK5 ) )
| spl8_2 ),
inference(forward_demodulation,[],[f27,f17]) ).
thf(f42,plain,
( ( ( ap @ sK4 @ sK5 )
!= ( ap @ sK4 @ sK5 ) )
| spl8_2 ),
inference(forward_demodulation,[],[f41,f17]) ).
thf(f43,plain,
( $false
| spl8_2 ),
inference(trivial_inequality_removal,[],[f42]) ).
thf(f44,plain,
spl8_2,
inference(avatar_contradiction_clause,[],[f43]) ).
thf(f49,plain,
( ( ( ap @ xs @ ( ap @ sK7 @ sK6 ) )
!= ( ap @ xs @ ( ap @ sK7 @ sK6 ) ) )
| ~ spl8_3
| spl8_5 ),
inference(superposition,[],[f39,f30]) ).
thf(f50,plain,
( $false
| ~ spl8_3
| spl8_5 ),
inference(trivial_inequality_removal,[],[f49]) ).
thf(f51,plain,
( ~ spl8_3
| spl8_5 ),
inference(avatar_contradiction_clause,[],[f50]) ).
thf(f56,plain,
( ( ( cns @ sK1 @ ( ap @ sK0 @ ( ap @ sK2 @ sK3 ) ) )
!= ( ap @ ( ap @ ( cns @ sK1 @ sK0 ) @ sK2 ) @ sK3 ) )
| spl8_1 ),
inference(forward_demodulation,[],[f23,f19]) ).
thf(f57,plain,
( ( ( cns @ sK1 @ ( ap @ sK0 @ ( ap @ sK2 @ sK3 ) ) )
!= ( ap @ ( cns @ sK1 @ ( ap @ sK0 @ sK2 ) ) @ sK3 ) )
| spl8_1 ),
inference(forward_demodulation,[],[f56,f19]) ).
thf(f58,plain,
( ( ( cns @ sK1 @ ( ap @ ( ap @ sK0 @ sK2 ) @ sK3 ) )
!= ( cns @ sK1 @ ( ap @ sK0 @ ( ap @ sK2 @ sK3 ) ) ) )
| spl8_1 ),
inference(forward_demodulation,[],[f57,f19]) ).
thf(f60,definition,
( spl8_6
<=> ( ( cns @ sK1 @ ( ap @ ( ap @ sK0 @ sK2 ) @ sK3 ) )
= ( cns @ sK1 @ ( ap @ sK0 @ ( ap @ sK2 @ sK3 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl8_6])],[avatar_definition]) ).
thf(f62,plain,
( ( ( cns @ sK1 @ ( ap @ ( ap @ sK0 @ sK2 ) @ sK3 ) )
!= ( cns @ sK1 @ ( ap @ sK0 @ ( ap @ sK2 @ sK3 ) ) ) )
| spl8_6 ),
inference(avatar_component_clause,[],[f60]) ).
thf(f63,plain,
( ~ spl8_6
| spl8_1 ),
inference(avatar_split_clause,[],[f58,f21,f60]) ).
thf(f64,plain,
( ( ( cns @ sK1 @ ( ap @ sK0 @ ( ap @ sK2 @ sK3 ) ) )
!= ( cns @ sK1 @ ( ap @ sK0 @ ( ap @ sK2 @ sK3 ) ) ) )
| ~ spl8_4
| spl8_6 ),
inference(forward_demodulation,[],[f62,f34]) ).
thf(f65,plain,
( $false
| ~ spl8_4
| spl8_6 ),
inference(trivial_inequality_removal,[],[f64]) ).
thf(f66,plain,
( ~ spl8_4
| spl8_6 ),
inference(avatar_contradiction_clause,[],[f65]) ).
cnf(s1,plain,
( ~ spl8_1
| ~ spl8_2
| spl8_3 ),
inference(sat_conversion,[],[f31]) ).
cnf(s2,plain,
( ~ spl8_2
| spl8_3
| spl8_4 ),
inference(sat_conversion,[],[f35]) ).
cnf(s3,plain,
~ spl8_5,
inference(sat_conversion,[],[f40]) ).
cnf(s4,plain,
spl8_2,
inference(sat_conversion,[],[f44]) ).
cnf(s5,plain,
( ~ spl8_3
| spl8_5 ),
inference(sat_conversion,[],[f51]) ).
cnf(s6,plain,
( spl8_1
| ~ spl8_6 ),
inference(sat_conversion,[],[f63]) ).
cnf(s7,plain,
( ~ spl8_4
| spl8_6 ),
inference(sat_conversion,[],[f66]) ).
cnf(s8,plain,
~ spl8_3,
inference(rat,[],[s5,s3]) ).
cnf(s9,plain,
spl8_4,
inference(rat,[],[s2,s8,s4]) ).
cnf(s10,plain,
spl8_6,
inference(rat,[],[s7,s9]) ).
cnf(s11,plain,
spl8_1,
inference(rat,[],[s6,s10]) ).
cnf(s12,plain,
$false,
inference(rat,[],[s1,s8,s4,s11]) ).
thf(f67,plain,
$false,
inference(avatar_sat_refutation,[],[s12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT056^1 : TPTP v9.3.1. Released v5.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.24 % Computer : n009.cluster.edu
% 0.10/0.24 % Model : x86_64 x86_64
% 0.10/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.24 % Memory : 8046.5625MB
% 0.10/0.24 % OS : Linux 6.8.0-71-generic
% 0.10/0.24 % CPULimit : 300
% 0.10/0.24 % WCLimit : 300
% 0.10/0.24 % DateTime : Tue Sep 29 17:58:15 UTC 2026
% 0.10/0.24 % CPUTime :
% 0.10/0.24 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.29 Running higher-order theorem proving
% 0.25/0.31 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.25/0.34 % (149350)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.25/0.34 % (149358)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=3180052958:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.25/0.34 % (149358) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-149350-149358"...
% 0.25/0.34 % (149355)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3750040782:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.25/0.34 % (149358)...printing done.
% 0.25/0.34 % (149358)Refutation found. Thanks to Tanya!
% 0.25/0.34 % SZS status Theorem for theBenchmark
% 0.25/0.34 % SZS output start Proof for theBenchmark
% See solution above
% 0.25/0.35 % (149358)------------------------------
% 0.25/0.35 % (149358)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.35 % (149358)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.35 % (149358)CaDiCaL version: 2.1.3
% 0.25/0.35 % (149358)Termination reason: Refutation
% 0.25/0.35 % (149358)Time elapsed: 0.005 s
% 0.25/0.35 % (149358)Peak memory usage: 13 MB
% 0.25/0.35 % (149358)Instructions burned: 8 (million)
% 0.25/0.35 % (149350)Success in time 0.029 s
% 0.25/0.35 % Vampire exiting
%------------------------------------------------------------------------------