%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL775_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 : n004.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:33 AM UTC 2026
% Result : Theorem 2.97s 1.35s
% Output : Refutation 3.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 26 ( 19 unt; 0 typ; 0 def)
% Number of atoms : 38 ( 8 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 28 ( 16 ~; 9 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-4 aty)
% Number of functors : 67 ( 67 usr; 9 con; 0-5 aty)
% Number of variables : 43 ( 43 !; 0 ?; 43 :)
% 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,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_1,type,
it: fun(dB,bool) ).
tff(func_def_2,type,
beta: fun(dB,fun(dB,bool)) ).
tff(func_def_3,type,
abs: dB > dB ).
tff(func_def_4,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_5,type,
var: nat > dB ).
tff(func_def_6,type,
dB_size: dB > nat ).
tff(func_def_7,type,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_8,type,
subst: ( dB * dB * nat ) > dB ).
tff(func_def_9,type,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_10,type,
append:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_11,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_12,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_13,type,
cons:
!>[X0: $tType] : ( ( X0 * 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,
list_size:
!>[X0: $tType] : ( ( fun(X0,nat) * list(X0) ) > nat ) ).
tff(func_def_17,type,
rotate1:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_18,type,
sublist:
!>[X0: $tType] : ( ( list(X0) * fun(nat,bool) ) > list(X0) ) ).
tff(func_def_19,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
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,
fTrue: bool ).
tff(func_def_23,type,
i: nat ).
tff(func_def_24,type,
r: dB ).
tff(func_def_25,type,
s: dB ).
tff(func_def_26,type,
ss: list(dB) ).
tff(func_def_27,type,
sK2: dB > dB ).
tff(func_def_28,type,
sK3: dB > dB ).
tff(func_def_29,type,
sK4: dB > list(dB) ).
tff(func_def_30,type,
sK5: dB > list(dB) ).
tff(func_def_31,type,
sK6: dB > nat ).
tff(func_def_32,type,
sK7: dB > dB ).
tff(func_def_33,type,
sK8: ( dB * dB ) > dB ).
tff(func_def_34,type,
sK9: ( dB * dB * dB ) > dB ).
tff(func_def_35,type,
sK10: ( dB * dB * dB ) > dB ).
tff(func_def_36,type,
sK11: ( dB * dB * dB ) > dB ).
tff(func_def_37,type,
sK12:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_38,type,
sK13:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_39,type,
sK14:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(func_def_40,type,
sK15: ( dB * list(dB) * nat ) > list(dB) ).
tff(func_def_41,type,
sK16: ( dB * list(dB) * dB ) > dB ).
tff(func_def_42,type,
sK17: ( dB * list(dB) * dB ) > dB ).
tff(func_def_43,type,
sK18: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_44,type,
sK19: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_45,type,
sK20: ( dB * list(dB) * dB ) > dB ).
tff(func_def_46,type,
sK21:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > X0 ) ).
tff(func_def_47,type,
sK22:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > list(X0) ) ).
tff(func_def_48,type,
sK23:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_49,type,
sK24:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_50,type,
sK25:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_51,type,
sK26:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_52,type,
sK27:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > list(X0) ) ).
tff(func_def_53,type,
sK28:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > X0 ) ).
tff(func_def_54,type,
sK29: ( list(dB) * dB * dB * dB ) > list(dB) ).
tff(func_def_55,type,
sK30:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_56,type,
sK31:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_57,type,
sK32:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_58,type,
sK33:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * X0 ) > list(X0) ) ).
tff(func_def_59,type,
sK34:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_60,type,
sK35:
!>[X0: $tType] : ( fun(list(X0),bool) > list(X0) ) ).
tff(func_def_61,type,
sK36:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_62,type,
sK37:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_63,type,
sK38:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_64,type,
sK39:
!>[X0: $tType] : ( list(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,
list_ex1:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_4,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_5,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_6,type,
pp: bool > $o ).
tff(pred_def_7,type,
sP0: dB > $o ).
tff(pred_def_8,type,
sP1: ( dB * list(dB) * dB ) > $o ).
tff(f3,axiom,
! [X0: list(dB),X1: dB,X2: dB] :
( pp(aa(dB,bool,it,foldl(dB,dB,app,subst(X2,X1,zero_zero(nat)),X0)))
=> ( pp(aa(dB,bool,it,X1))
=> pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X2)),X1),X0))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2_Beta) ).
tff(f59,axiom,
! [X0: $tType,X1: $tType,X2: list(X1),X3: X1,X4: X0,X5: fun(X0,fun(X1,X0))] : ( foldl(X0,X1,X5,X4,cons(X1,X3,X2)) = foldl(X0,X1,X5,aa(X1,X0,aa(X0,fun(X1,X0),X5,X4),X3),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_58_foldl__Cons) ).
tff(f95,axiom,
! [X0: dB,X1: list(dB),X2: dB] : ( aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,X2,X1)),X0) = foldl(dB,dB,app,X2,append(dB,X1,cons(dB,X0,nil(dB)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_94_app__last) ).
tff(f99,axiom,
! [X0: $tType,X1: $tType,X2: list(X1),X3: X1] :
( ( rotate1(X0,nil(X0)) = nil(X0) )
& ( rotate1(X1,cons(X1,X3,X2)) = append(X1,X2,cons(X1,X3,nil(X1))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_98_rotate__simps) ).
tff(f104,axiom,
pp(aa(dB,bool,it,aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,subst(r,s,zero_zero(nat)),ss)),var(i)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).
tff(f105,axiom,
pp(aa(dB,bool,it,s)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_2) ).
tff(f107,conjecture,
pp(aa(dB,bool,it,aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),s),ss)),var(i)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_4) ).
tff(f108,negated_conjecture,
~ pp(aa(dB,bool,it,aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),s),ss)),var(i)))),
inference(negated_conjecture,[status(cth)],[f107]) ).
tff(f112,plain,
~ pp(aa(dB,bool,it,aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),s),ss)),var(i)))),
inference(flattening,[],[f108]) ).
tff(f115,plain,
! [X0: list(dB),X1: dB,X2: dB] :
( pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X2)),X1),X0)))
| ~ pp(aa(dB,bool,it,X1))
| ~ pp(aa(dB,bool,it,foldl(dB,dB,app,subst(X2,X1,zero_zero(nat)),X0))) ),
inference(ennf_transformation,[],[f3]) ).
tff(f116,plain,
! [X0: list(dB),X1: dB,X2: dB] :
( pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X2)),X1),X0)))
| ~ pp(aa(dB,bool,it,X1))
| ~ pp(aa(dB,bool,it,foldl(dB,dB,app,subst(X2,X1,zero_zero(nat)),X0))) ),
inference(flattening,[],[f115]) ).
tff(f238,plain,
! [X2: dB,X0: list(dB),X1: dB] :
( pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X2)),X1),X0)))
| ~ pp(aa(dB,bool,it,X1))
| ~ pp(aa(dB,bool,it,foldl(dB,dB,app,subst(X2,X1,zero_zero(nat)),X0))) ),
inference(cnf_transformation,[],[f116]) ).
tff(f341,plain,
! [X1: $tType,X0: $tType,X2: list(X1),X3: X1,X4: X0,X5: fun(X0,fun(X1,X0))] : ( foldl(X0,X1,X5,X4,cons(X1,X3,X2)) = foldl(X0,X1,X5,aa(X1,X0,aa(X0,fun(X1,X0),X5,X4),X3),X2) ),
inference(cnf_transformation,[],[f59]) ).
tff(f426,plain,
! [X2: dB,X0: dB,X1: list(dB)] : ( aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,X2,X1)),X0) = foldl(dB,dB,app,X2,append(dB,X1,cons(dB,X0,nil(dB)))) ),
inference(cnf_transformation,[],[f95]) ).
tff(f431,plain,
! [X1: $tType,X2: list(X1),X3: X1] : ( rotate1(X1,cons(X1,X3,X2)) = append(X1,X2,cons(X1,X3,nil(X1))) ),
inference(cnf_transformation,[],[f99]) ).
tff(f437,plain,
pp(aa(dB,bool,it,aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,subst(r,s,zero_zero(nat)),ss)),var(i)))),
inference(cnf_transformation,[],[f104]) ).
tff(f438,plain,
pp(aa(dB,bool,it,s)),
inference(cnf_transformation,[],[f105]) ).
tff(f440,plain,
~ pp(aa(dB,bool,it,aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),s),ss)),var(i)))),
inference(cnf_transformation,[],[f112]) ).
tff(f854,plain,
! [X2: dB,X0: dB,X1: list(dB)] : ( aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,X2,X1)),X0) = foldl(dB,dB,app,X2,rotate1(dB,cons(dB,X0,X1))) ),
inference(forward_demodulation,[],[f426,f431]) ).
tff(f864,plain,
~ pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),s),rotate1(dB,cons(dB,var(i),ss))))),
inference(superposition,[],[f440,f854]) ).
tff(f865,plain,
pp(aa(dB,bool,it,foldl(dB,dB,app,subst(r,s,zero_zero(nat)),rotate1(dB,cons(dB,var(i),ss))))),
inference(superposition,[],[f437,f854]) ).
tff(f871,plain,
~ pp(aa(dB,bool,it,foldl(dB,dB,app,abs(r),cons(dB,s,rotate1(dB,cons(dB,var(i),ss)))))),
inference(forward_demodulation,[],[f864,f341]) ).
tff(f1034,plain,
! [X2: dB,X0: list(dB),X1: dB] :
( pp(aa(dB,bool,it,foldl(dB,dB,app,abs(X2),cons(dB,X1,X0))))
| ~ pp(aa(dB,bool,it,X1))
| ~ pp(aa(dB,bool,it,foldl(dB,dB,app,subst(X2,X1,zero_zero(nat)),X0))) ),
inference(forward_demodulation,[],[f238,f341]) ).
tff(f1035,plain,
( ~ pp(aa(dB,bool,it,s))
| ~ pp(aa(dB,bool,it,foldl(dB,dB,app,subst(r,s,zero_zero(nat)),rotate1(dB,cons(dB,var(i),ss))))) ),
inference(resolution,[],[f1034,f871]) ).
tff(f1039,plain,
~ pp(aa(dB,bool,it,foldl(dB,dB,app,subst(r,s,zero_zero(nat)),rotate1(dB,cons(dB,var(i),ss))))),
inference(forward_subsumption_resolution,[],[f1035,f438]) ).
tff(f1349,plain,
$false,
inference(forward_subsumption_resolution,[],[f865,f1039]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL775_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.09/0.40 % Computer : n004.cluster.edu
% 0.09/0.40 % Model : x86_64 x86_64
% 0.09/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.40 % Memory : 8046.5625MB
% 0.09/0.40 % OS : Linux 6.8.0-71-generic
% 0.09/0.40 % CPULimit : 300
% 0.09/0.40 % WCLimit : 300
% 0.09/0.40 % DateTime : Sun Sep 27 16:46:52 UTC 2026
% 0.09/0.40 % CPUTime :
% 0.09/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.44 Running first-order theorem proving
% 0.09/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.97/1.35 % (3732430)Detected formulas, will run a generic FOF schedule.
% 2.97/1.35 % (3732439)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3026346657:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.97/1.35 % (3732439)Instruction limit reached!
% 2.97/1.35 % (3732439)------------------------------
% 2.97/1.35 % (3732439)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.97/1.35 % (3732439)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.97/1.35 % (3732439)CaDiCaL version: 2.1.3
% 2.97/1.35 % (3732439)Termination reason: Instruction limit
% 2.97/1.35 % (3732439)Termination phase: Saturation
% 2.97/1.35 % (3732439)Time elapsed: 0.036 s
% 2.97/1.35 % (3732439)Peak memory usage: 88 MB
% 2.97/1.35 % (3732439)Instructions burned: 120 (million)
% 2.97/1.35 % (3732437)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=3168450263:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.97/1.35 % (3732438)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2045833621:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.97/1.35 % (3732435)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=2083516098:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.97/1.35 % (3732436)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=1561732655:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.97/1.35 % (3732440)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1947314459:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.97/1.35 % (3732438)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.97/1.35 % (3732437)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.97/1.35 % (3732441)dis-21_1_sil=8000:lcm=predicate:random_seed=552955134: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.97/1.35 % (3732440)First to succeed.
% 2.97/1.35 % (3732438)Instruction limit reached!
% 2.97/1.35 % (3732438)------------------------------
% 2.97/1.35 % (3732438)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.97/1.35 % (3732438)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.97/1.35 % (3732438)CaDiCaL version: 2.1.3
% 2.97/1.35 % (3732438)Termination reason: Instruction limit
% 2.97/1.35 % (3732438)Termination phase: Saturation
% 2.97/1.35 % (3732438)Time elapsed: 0.065 s
% 2.97/1.35 % (3732438)Peak memory usage: 89 MB
% 2.97/1.35 % (3732438)Instructions burned: 110 (million)
% 2.97/1.35 % (3732440)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3732430"
% 2.97/1.35 % (3732443)lrs+10_1_sil=8000:sp=occurrence:random_seed=2740888470:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.97/1.35 % (3732441)Instruction limit reached!
% 2.97/1.35 % (3732441)------------------------------
% 2.97/1.35 % (3732441)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.97/1.35 % (3732441)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.97/1.35 % (3732441)CaDiCaL version: 2.1.3
% 2.97/1.35 % (3732441)Termination reason: Instruction limit
% 2.97/1.35 % (3732441)Termination phase: Saturation
% 2.97/1.35 % (3732441)Time elapsed: 0.072 s
% 2.97/1.35 % (3732441)Peak memory usage: 89 MB
% 2.97/1.35 % (3732441)Instructions burned: 130 (million)
% 2.97/1.35 % (3732443)Also succeeded, but the first one will report.
% 2.97/1.35 % (3732450)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1794715174:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.97/1.35 % (3732450)Also succeeded, but the first one will report.
% 2.97/1.35 % (3732452)lrs+1011_1_sil=32000:sp=occurrence:random_seed=846085965:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.97/1.35 % (3732452)Also succeeded, but the first one will report.
% 2.97/1.35 % (3732440)Refutation found. Thanks to Tanya!
% 2.97/1.35 % SZS status Theorem for theBenchmark
% 2.97/1.35 % SZS output start Proof for theBenchmark
% See solution above
% 3.80/1.44 % (3732440)------------------------------
% 3.80/1.44 % (3732440)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.80/1.44 % (3732440)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.80/1.44 % (3732440)CaDiCaL version: 2.1.3
% 3.80/1.44 % (3732440)Termination reason: Refutation
% 3.80/1.44 % (3732440)Time elapsed: 0.067 s
% 3.80/1.44 % (3732440)Peak memory usage: 90 MB
% 3.80/1.44 % (3732440)Instructions burned: 103 (million)
% 3.80/1.44 % (3732440)------------------------------
% 3.80/1.44 % (3732440)------------------------------
% 3.80/1.44 % (3732430)Success in time 0.475 s
% 3.80/1.44 % Vampire exiting
%------------------------------------------------------------------------------