%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL769_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 : n020.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:31 AM UTC 2026
% Result : Theorem 2.26s 1.18s
% Output : Refutation 2.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 15 unt; 0 typ; 2 def)
% Number of atoms : 85 ( 19 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 90 ( 36 ~; 33 |; 18 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 3 prp; 0-3 aty)
% Number of functors : 62 ( 62 usr; 9 con; 0-5 aty)
% Number of variables : 47 ( 0 sgn 39 !; 8 ?; 47 :)
% 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,
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,
combc:
!>[X0: $tType,X1: $tType,X2: $tType] : ( fun(X0,fun(X1,X2)) > fun(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,
it: fun(dB,bool) ).
tff(func_def_4,type,
abs: dB > dB ).
tff(func_def_5,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_6,type,
var: nat > dB ).
tff(func_def_7,type,
dB_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,X0)) * fun(dB,X0) * dB ) > X0 ) ).
tff(func_def_8,type,
append:
!>[X0: $tType] : fun(list(X0),fun(list(X0),list(X0))) ).
tff(func_def_9,type,
butlast:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_10,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_11,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_12,type,
last:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_13,type,
cons:
!>[X0: $tType] : fun(X0,fun(list(X0),list(X0))) ).
tff(func_def_14,type,
nil:
!>[X0: $tType] : 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,
maps:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,list(X1)) * list(X0) ) > list(X1) ) ).
tff(func_def_17,type,
rev:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_18,type,
rotate1:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_19,type,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_20,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_21,type,
fFalse: bool ).
tff(func_def_22,type,
fNot: fun(bool,bool) ).
tff(func_def_23,type,
fTrue: bool ).
tff(func_def_24,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_25,type,
fdisj: fun(bool,fun(bool,bool)) ).
tff(func_def_26,type,
fequal:
!>[X0: $tType] : ( X0 > fun(X0,bool) ) ).
tff(func_def_27,type,
i: nat ).
tff(func_def_28,type,
rs: list(dB) ).
tff(func_def_29,type,
sK0:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > X0 ) ).
tff(func_def_30,type,
sK1:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > list(X0) ) ).
tff(func_def_31,type,
sK2:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_32,type,
sK3:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_33,type,
sK4:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_34,type,
sK5:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_35,type,
sK6:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_36,type,
sK7:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_37,type,
sK8:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(func_def_38,type,
sK9: ( list(dB) * dB * dB * dB ) > list(dB) ).
tff(func_def_39,type,
sK10:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_40,type,
sK11:
!>[X0: $tType] : ( fun(list(X0),bool) > list(X0) ) ).
tff(func_def_41,type,
sK12:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_42,type,
sK13:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_43,type,
sK14:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * X0 ) > list(X0) ) ).
tff(func_def_44,type,
sK15:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_45,type,
sK16:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_46,type,
sK17:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_47,type,
sK18:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_48,type,
sK19:
!>[X0: $tType] : ( fun(list(X0),bool) > list(X0) ) ).
tff(func_def_49,type,
sK20:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_50,type,
sK21:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_51,type,
sK22:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_52,type,
sK23: dB > dB ).
tff(func_def_53,type,
sK24: dB > dB ).
tff(func_def_54,type,
sK25: dB > dB ).
tff(func_def_55,type,
sK26: dB > nat ).
tff(func_def_56,type,
sK27: dB > list(dB) ).
tff(func_def_57,type,
sK28: dB > dB ).
tff(func_def_58,type,
sK29: dB > nat ).
tff(func_def_59,type,
sK30: dB > dB ).
tff(pred_def_1,type,
list_all:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_2,type,
list_ex1:
!>[X0: $tType] : ( ( fun(X0,bool) * 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,
sQ31_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f1,axiom,
! [X4: nat] : pp(aa(dB,bool,it,var(X4))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_Var__IT) ).
tff(f2,axiom,
! [X0: $tType,X1: fun(X0,bool)] : listsp(X0,X1,nil(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1_listsp_ONil) ).
tff(f11,axiom,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( listsp(X0,X2,X1)
<=> ( ( X1 = nil(X0) )
| ? [X3: X0,X4: list(X0)] :
( ( X1 = aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) )
& pp(aa(X0,bool,X2,X3))
& listsp(X0,X2,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_10_listsp_Osimps) ).
tff(f117,conjecture,
listsp(dB,it,aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),var(i)),nil(dB))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).
tff(f118,negated_conjecture,
~ listsp(dB,it,aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),var(i)),nil(dB))),
inference(negated_conjecture,[status(cth)],[f117]) ).
tff(f119,plain,
! [X0: nat] : pp(aa(dB,bool,it,var(X0))),
inference(rectify,[],[f1]) ).
tff(f121,plain,
~ listsp(dB,it,aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),var(i)),nil(dB))),
inference(flattening,[],[f118]) ).
tff(f158,plain,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( ( listsp(X0,X2,X1)
| ( ( nil(X0) != X1 )
& ! [X3: X0,X4: list(X0)] :
( ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) != X1 )
| ~ pp(aa(X0,bool,X2,X3))
| ~ listsp(X0,X2,X4) ) ) )
& ( ( X1 = nil(X0) )
| ? [X3: X0,X4: list(X0)] :
( ( X1 = aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) )
& pp(aa(X0,bool,X2,X3))
& listsp(X0,X2,X4) )
| ~ listsp(X0,X2,X1) ) ),
inference(nnf_transformation,[],[f11]) ).
tff(f159,plain,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( ( listsp(X0,X2,X1)
| ( ( nil(X0) != X1 )
& ! [X3: X0,X4: list(X0)] :
( ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) != X1 )
| ~ pp(aa(X0,bool,X2,X3))
| ~ listsp(X0,X2,X4) ) ) )
& ( ( X1 = nil(X0) )
| ? [X3: X0,X4: list(X0)] :
( ( X1 = aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) )
& pp(aa(X0,bool,X2,X3))
& listsp(X0,X2,X4) )
| ~ listsp(X0,X2,X1) ) ),
inference(flattening,[],[f158]) ).
tff(f160,plain,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( ( listsp(X0,X2,X1)
| ( ( nil(X0) != X1 )
& ! [X3: X0,X4: list(X0)] :
( ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) != X1 )
| ~ pp(aa(X0,bool,X2,X3))
| ~ listsp(X0,X2,X4) ) ) )
& ( ( X1 = nil(X0) )
| ? [X5: X0,X6: list(X0)] :
( ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X5),X6) = X1 )
& pp(aa(X0,bool,X2,X5))
& listsp(X0,X2,X6) )
| ~ listsp(X0,X2,X1) ) ),
inference(rectify,[],[f159]) ).
tff(f161,plain,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( ( listsp(X0,X2,X1)
| ( ( nil(X0) != X1 )
& ! [X3: X0,X4: list(X0)] :
( ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) != X1 )
| ~ pp(aa(X0,bool,X2,X3))
| ~ listsp(X0,X2,X4) ) ) )
& ( ( X1 = nil(X0) )
| ( ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),sK0(X0,X1,X2)),sK1(X0,X1,X2)) = X1 )
& pp(aa(X0,bool,X2,sK0(X0,X1,X2)))
& listsp(X0,X2,sK1(X0,X1,X2)) )
| ~ listsp(X0,X2,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X5,sK0(X0,X1,X2)),skolemize(X6,sK1(X0,X1,X2))],[f160]) ).
tff(f229,plain,
! [X0: nat] : pp(aa(dB,bool,it,var(X0))),
inference(cnf_transformation,[],[f119]) ).
tff(f230,plain,
! [X0: $tType,X1: fun(X0,bool)] : listsp(X0,X1,nil(X0)),
inference(cnf_transformation,[],[f2]) ).
tff(f249,plain,
! [X0: $tType,X2: fun(X0,bool),X3: X0,X1: list(X0),X4: list(X0)] :
( listsp(X0,X2,X1)
| ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) != X1 )
| ~ pp(aa(X0,bool,X2,X3))
| ~ listsp(X0,X2,X4) ),
inference(cnf_transformation,[],[f161]) ).
tff(f430,plain,
~ listsp(dB,it,aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),var(i)),nil(dB))),
inference(cnf_transformation,[],[f121]) ).
tff(f441,plain,
! [X0: $tType,X2: fun(X0,bool),X3: X0,X4: list(X0)] :
( listsp(X0,X2,aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4))
| ~ pp(aa(X0,bool,X2,X3))
| ~ listsp(X0,X2,X4) ),
inference(equality_resolution,[],[f249]) ).
tff(f1207,plain,
( ~ pp(aa(dB,bool,it,var(i)))
| ~ listsp(dB,it,nil(dB)) ),
inference(resolution,[],[f441,f430]) ).
tff(f1212,definition,
( spl32_3
<=> listsp(dB,it,nil(dB)) ),
introduced(definition,[new_symbols(definition,[spl32_3])],[avatar_definition]) ).
tff(f1213,plain,
( ~ listsp(dB,it,nil(dB))
| spl32_3 ),
inference(avatar_component_clause,[],[f1212]) ).
tff(f1215,definition,
( spl32_4
<=> pp(aa(dB,bool,it,var(i))) ),
introduced(definition,[new_symbols(definition,[spl32_4])],[avatar_definition]) ).
tff(f1216,plain,
( ~ pp(aa(dB,bool,it,var(i)))
| spl32_4 ),
inference(avatar_component_clause,[],[f1215]) ).
tff(f1217,plain,
( ~ spl32_3
| ~ spl32_4 ),
inference(avatar_split_clause,[],[f1207,f1215,f1212]) ).
tff(f1218,plain,
( $false
| spl32_3 ),
inference(resolution,[],[f1213,f230]) ).
tff(f1219,plain,
spl32_3,
inference(avatar_contradiction_clause,[],[f1218]) ).
tff(f1220,plain,
( $false
| spl32_4 ),
inference(resolution,[],[f1216,f229]) ).
tff(f1221,plain,
spl32_4,
inference(avatar_contradiction_clause,[],[f1220]) ).
cnf(s2,plain,
( ~ spl32_3
| ~ spl32_4 ),
inference(sat_conversion,[],[f1217]) ).
cnf(s3,plain,
spl32_3,
inference(sat_conversion,[],[f1219]) ).
cnf(s4,plain,
spl32_4,
inference(sat_conversion,[],[f1221]) ).
cnf(s5,plain,
$false,
inference(rat,[],[s2,s4,s3]) ).
tff(f1222,plain,
$false,
inference(avatar_sat_refutation,[],[s5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL769_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 % Computer : n020.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 27 16:47:04 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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.26/1.18 % (3599539)Detected formulas, will run a generic FOF schedule.
% 2.26/1.18 % (3599550)dis-21_1_sil=8000:lcm=predicate:random_seed=1401660874: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.26/1.18 % (3599550)First to succeed.
% 2.26/1.18 % (3599550)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3599539"
% 2.26/1.18 % (3599549)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1406874889:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.26/1.18 % (3599544)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=1298391589:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.26/1.18 % (3599545)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=2930129007:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.26/1.18 % (3599547)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3723134206:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.26/1.18 % (3599546)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=2819755942:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.26/1.18 % (3599548)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=740985283:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.26/1.18 % (3599547)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.26/1.18 % (3599547)Refutation not found, incomplete strategy
% 2.26/1.18 % (3599547)------------------------------
% 2.26/1.18 % (3599547)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.26/1.18 % (3599547)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.26/1.18 % (3599547)CaDiCaL version: 2.1.3
% 2.26/1.18 % (3599547)Termination reason: Refutation not found, incomplete strategy
% 2.26/1.18 % (3599547)Time elapsed: 0.007 s
% 2.26/1.18 % (3599547)Peak memory usage: 88 MB
% 2.26/1.18 % (3599547)Instructions burned: 10 (million)
% 2.26/1.18 % (3599546)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.26/1.18 % (3599548)Also succeeded, but the first one will report.
% 2.26/1.18 % (3599549)Instruction limit reached!
% 2.26/1.18 % (3599549)------------------------------
% 2.26/1.18 % (3599549)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.26/1.18 % (3599549)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.26/1.18 % (3599549)CaDiCaL version: 2.1.3
% 2.26/1.18 % (3599549)Termination reason: Instruction limit
% 2.26/1.18 % (3599549)Termination phase: Saturation
% 2.26/1.18 % (3599549)Time elapsed: 0.084 s
% 2.26/1.18 % (3599549)Peak memory usage: 89 MB
% 2.26/1.18 % (3599549)Instructions burned: 141 (million)
% 2.26/1.18 % (3599550)Refutation found. Thanks to Tanya!
% 2.26/1.18 % SZS status Theorem for theBenchmark
% 2.26/1.18 % SZS output start Proof for theBenchmark
% See solution above
% 2.76/1.38 % (3599550)------------------------------
% 2.76/1.38 % (3599550)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.76/1.38 % (3599550)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.76/1.38 % (3599550)CaDiCaL version: 2.1.3
% 2.76/1.38 % (3599550)Termination reason: Refutation
% 2.76/1.38 % (3599550)Time elapsed: 0.014 s
% 2.76/1.38 % (3599550)Peak memory usage: 90 MB
% 2.76/1.38 % (3599550)Instructions burned: 44 (million)
% 2.76/1.38 % (3599550)------------------------------
% 2.76/1.38 % (3599550)------------------------------
% 2.76/1.38 % (3599539)Success in time 0.316 s
% 2.76/1.38 % Vampire exiting
%------------------------------------------------------------------------------