%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : DAT097_1 : TPTP v9.3.1. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:47:17 AM UTC 2026
% Result : Theorem 1.85s 0.77s
% Output : Refutation 2.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 10
% Syntax : Number of formulae : 63 ( 26 unt; 0 typ; 0 def)
% Number of atoms : 160 ( 82 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 147 ( 50 ~; 56 |; 30 &)
% ( 5 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 223 ( 22 atm; 32 fun; 52 num; 117 var)
% Number of types : 3 ( 1 usr; 1 ari; 0 dat; 0 cdt)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 13 usr; 3 con; 0-2 aty)
% Number of variables : 210 ( 190 !; 20 ?; 210 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
list: $tType ).
tff(func_def_0,type,
nil: list ).
tff(func_def_1,type,
cons: ( $int * list ) > list ).
tff(func_def_2,type,
head: list > $int ).
tff(func_def_3,type,
tail: list > list ).
tff(func_def_5,type,
length: list > $int ).
tff(func_def_8,type,
count: ( $int * list ) > $int ).
tff(func_def_9,type,
append: ( list * list ) > list ).
tff(func_def_11,type,
sK0: ( list * $int ) > $int ).
tff(func_def_12,type,
sK1: ( list * $int ) > list ).
tff(func_def_13,type,
sK2: ( list * $int ) > list ).
tff(func_def_14,type,
sK3: ( list * $int ) > $int ).
tff(func_def_15,type,
sK4: ( list * $int ) > $int ).
tff(func_def_16,type,
sK5: ( list * $int ) > list ).
tff(pred_def_1,type,
in: ( $int * list ) > $o ).
tff(pred_def_2,type,
inRange: ( $int * list ) > $o ).
tff(f5,axiom,
! [X1: list,X0: $int] :
( in(X0,X1)
<=> ( ? [X3: list,X2: $int] :
( ( X0 = X2 )
& ( X1 = cons(X2,X3) ) )
| ? [X3: list,X2: $int] :
( ( X1 = cons(X2,X3) )
& in(X0,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',in_conv) ).
tff(f9,axiom,
! [X0: $int] : ( count(X0,nil) = 0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a) ).
tff(f11,axiom,
! [X0: $int,X1: $int,X2: list,X3: $int] :
( ( X0 = X1 )
=> ( count(X0,cons(X1,X2)) = $sum(count(X0,X2),1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_4) ).
tff(f12,axiom,
! [X0: list] : ( append(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l_6) ).
tff(f13,axiom,
! [X1: list,X0: $int,X2: list] : ( append(cons(X0,X1),X2) = cons(X0,append(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l_7) ).
tff(f14,axiom,
! [X1: list,X0: $int] :
( in(X0,X1)
<=> $greater(count(X0,X1),0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_8) ).
tff(f15,conjecture,
~ ! [X1: $int,X0: $int,X2: list,X4: list,X3: list] :
( ( ( X4 = append(X3,cons(X0,X2)) )
& in(X1,X3)
& ~ in(X0,X2) )
=> ( count(X1,X4) = count(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c) ).
tff(f16,negated_conjecture,
~ ~ ! [X1: $int,X0: $int,X2: list,X4: list,X3: list] :
( ( ( X4 = append(X3,cons(X0,X2)) )
& in(X1,X3)
& ~ in(X0,X2) )
=> ( count(X1,X4) = count(X1,X3) ) ),
inference(negated_conjecture,[status(cth)],[f15]) ).
tff(f18,plain,
! [X1: list,X0: $int] :
( in(X0,X1)
<=> $less(0,count(X0,X1)) ),
inference(theory_normalization,[],[f14]) ).
tff(f19,plain,
! [X0: $int,X1: $int] : ( $sum(X1,X0) = $sum(X0,X1) ),
introduced(definition,[],[tha_commutativity]) ).
tff(f24,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(definition,[],[tha_non-reflexivity]) ).
tff(f28,plain,
! [X0: $int,X1: $int] :
( $less(X1,$sum(X0,1))
| $less(X0,X1) ),
introduced(definition,[],[tha_order_plus_one_dichotomy]) ).
tff(f34,plain,
! [X0: $int,X2: list,X1: $int] :
( ( X0 = X1 )
=> ( count(X0,cons(X1,X2)) = $sum(count(X0,X2),1) ) ),
inference(rectify,[],[f11]) ).
tff(f35,plain,
~ ~ ! [X4: list,X1: $int,X3: list,X2: list,X0: $int] :
( ( ( append(X4,cons(X1,X2)) = X3 )
& ~ in(X1,X2)
& in(X0,X4) )
=> ( count(X0,X3) = count(X0,X4) ) ),
inference(rectify,[],[f16]) ).
tff(f36,plain,
! [X4: list,X1: $int,X3: list,X2: list,X0: $int] :
( ( ( append(X4,cons(X1,X2)) = X3 )
& ~ in(X1,X2)
& in(X0,X4) )
=> ( count(X0,X3) = count(X0,X4) ) ),
inference(flattening,[],[f35]) ).
tff(f37,plain,
! [X0: list,X1: $int] :
( ( ? [X2: list,X3: $int] :
( ( cons(X3,X2) = X0 )
& ( X1 = X3 ) )
| ? [X5: $int,X4: list] :
( in(X1,X4)
& ( cons(X5,X4) = X0 ) ) )
<=> in(X1,X0) ),
inference(rectify,[],[f5]) ).
tff(f40,plain,
! [X1: $int,X0: list] :
( $less(0,count(X1,X0))
<=> in(X1,X0) ),
inference(rectify,[],[f18]) ).
tff(f41,plain,
! [X0: list,X2: list,X1: $int] : ( cons(X1,append(X0,X2)) = append(cons(X1,X0),X2) ),
inference(rectify,[],[f13]) ).
tff(f42,plain,
! [X4: list,X1: $int,X3: list,X2: list,X0: $int] :
( ( count(X0,X3) = count(X0,X4) )
| ( append(X4,cons(X1,X2)) != X3 )
| in(X1,X2)
| ~ in(X0,X4) ),
inference(ennf_transformation,[],[f36]) ).
tff(f43,plain,
! [X2: list,X0: $int,X4: list,X3: list,X1: $int] :
( ~ in(X0,X4)
| in(X1,X2)
| ( append(X4,cons(X1,X2)) != X3 )
| ( count(X0,X3) = count(X0,X4) ) ),
inference(flattening,[],[f42]) ).
tff(f44,plain,
! [X1: $int,X0: $int,X2: list] :
( ( X0 != X1 )
| ( count(X0,cons(X1,X2)) = $sum(count(X0,X2),1) ) ),
inference(ennf_transformation,[],[f34]) ).
tff(f51,plain,
! [X0: list,X1: list,X2: $int] : ( append(cons(X2,X0),X1) = cons(X2,append(X0,X1)) ),
inference(rectify,[],[f41]) ).
tff(f52,plain,
! [X0: list,X1: $int] :
( ( ? [X2: list,X3: $int] :
( ( cons(X3,X2) = X0 )
& ( X1 = X3 ) )
| ? [X5: $int,X4: list] :
( in(X1,X4)
& ( cons(X5,X4) = X0 ) )
| ~ in(X1,X0) )
& ( in(X1,X0)
| ( ! [X2: list,X3: $int] :
( ( cons(X3,X2) != X0 )
| ( X1 != X3 ) )
& ! [X5: $int,X4: list] :
( ~ in(X1,X4)
| ( cons(X5,X4) != X0 ) ) ) ) ),
inference(nnf_transformation,[],[f37]) ).
tff(f53,plain,
! [X0: list,X1: $int] :
( ( ? [X2: list,X3: $int] :
( ( cons(X3,X2) = X0 )
& ( X1 = X3 ) )
| ? [X5: $int,X4: list] :
( in(X1,X4)
& ( cons(X5,X4) = X0 ) )
| ~ in(X1,X0) )
& ( in(X1,X0)
| ( ! [X2: list,X3: $int] :
( ( cons(X3,X2) != X0 )
| ( X1 != X3 ) )
& ! [X5: $int,X4: list] :
( ~ in(X1,X4)
| ( cons(X5,X4) != X0 ) ) ) ) ),
inference(flattening,[],[f52]) ).
tff(f54,plain,
! [X0: list,X1: $int] :
( ( ? [X2: list,X3: $int] :
( ( cons(X3,X2) = X0 )
& ( X1 = X3 ) )
| ? [X4: $int,X5: list] :
( in(X1,X5)
& ( cons(X4,X5) = X0 ) )
| ~ in(X1,X0) )
& ( in(X1,X0)
| ( ! [X6: list,X7: $int] :
( ( cons(X7,X6) != X0 )
| ( X1 != X7 ) )
& ! [X8: $int,X9: list] :
( ~ in(X1,X9)
| ( cons(X8,X9) != X0 ) ) ) ) ),
inference(rectify,[],[f53]) ).
tff(f55,plain,
! [X0: list,X1: $int] :
( ( ( ( cons(sK3(X0,X1),sK2(X0,X1)) = X0 )
& ( sK3(X0,X1) = X1 ) )
| ( in(X1,sK5(X0,X1))
& ( cons(sK4(X0,X1),sK5(X0,X1)) = X0 ) )
| ~ in(X1,X0) )
& ( in(X1,X0)
| ( ! [X6: list,X7: $int] :
( ( cons(X7,X6) != X0 )
| ( X1 != X7 ) )
& ! [X8: $int,X9: list] :
( ~ in(X1,X9)
| ( cons(X8,X9) != X0 ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5]),skolemize(X2,sK2(X0,X1)),skolemize(X3,sK3(X0,X1)),skolemize(X4,sK4(X0,X1)),skolemize(X5,sK5(X0,X1))],[f54]) ).
tff(f56,plain,
! [X0: $int,X1: $int,X2: list] :
( ( X0 != X1 )
| ( count(X1,cons(X0,X2)) = $sum(count(X1,X2),1) ) ),
inference(rectify,[],[f44]) ).
tff(f60,plain,
! [X1: $int,X0: list] :
( ( $less(0,count(X1,X0))
| ~ in(X1,X0) )
& ( in(X1,X0)
| ~ $less(0,count(X1,X0)) ) ),
inference(nnf_transformation,[],[f40]) ).
tff(f61,plain,
! [X0: $int,X1: list] :
( ( $less(0,count(X0,X1))
| ~ in(X0,X1) )
& ( in(X0,X1)
| ~ $less(0,count(X0,X1)) ) ),
inference(rectify,[],[f60]) ).
tff(f62,plain,
! [X0: list,X1: $int,X2: list,X3: list,X4: $int] :
( ~ in(X1,X2)
| in(X4,X0)
| ( append(X2,cons(X4,X0)) != X3 )
| ( count(X1,X3) = count(X1,X2) ) ),
inference(rectify,[],[f43]) ).
tff(f71,plain,
! [X0: $int] : ( 0 = count(X0,nil) ),
inference(cnf_transformation,[],[f9]) ).
tff(f72,plain,
! [X2: $int,X0: list,X1: list] : ( append(cons(X2,X0),X1) = cons(X2,append(X0,X1)) ),
inference(cnf_transformation,[],[f51]) ).
tff(f74,plain,
! [X0: list,X1: $int,X6: list,X7: $int] :
( in(X1,X0)
| ( cons(X7,X6) != X0 )
| ( X1 != X7 ) ),
inference(cnf_transformation,[],[f55]) ).
tff(f79,plain,
! [X2: list,X0: $int,X1: $int] :
( ( X0 != X1 )
| ( count(X1,cons(X0,X2)) = $sum(count(X1,X2),1) ) ),
inference(cnf_transformation,[],[f56]) ).
tff(f85,plain,
! [X0: $int,X1: list] :
( ~ in(X0,X1)
| $less(0,count(X0,X1)) ),
inference(cnf_transformation,[],[f61]) ).
tff(f86,plain,
! [X2: list,X3: list,X0: list,X1: $int,X4: $int] :
( ~ in(X1,X2)
| in(X4,X0)
| ( append(X2,cons(X4,X0)) != X3 )
| ( count(X1,X3) = count(X1,X2) ) ),
inference(cnf_transformation,[],[f62]) ).
tff(f89,plain,
! [X0: list] : ( append(nil,X0) = X0 ),
inference(cnf_transformation,[],[f12]) ).
tff(f92,plain,
! [X1: $int,X6: list,X7: $int] :
( in(X1,cons(X7,X6))
| ( X1 != X7 ) ),
inference(equality_resolution,[],[f74]) ).
tff(f93,plain,
! [X6: list,X7: $int] : in(X7,cons(X7,X6)),
inference(equality_resolution,[],[f92]) ).
tff(f95,plain,
! [X2: list,X1: $int] : ( count(X1,cons(X1,X2)) = $sum(count(X1,X2),1) ),
inference(equality_resolution,[],[f79]) ).
tff(f96,plain,
! [X2: list,X0: list,X1: $int,X4: $int] :
( ~ in(X1,X2)
| ( count(X1,append(X2,cons(X4,X0))) = count(X1,X2) )
| in(X4,X0) ),
inference(equality_resolution,[],[f86]) ).
tff(f102,plain,
! [X2: $int,X3: list,X0: $int,X1: list] :
( in(X2,X3)
| ( count(X0,append(cons(X0,X1),cons(X2,X3))) = count(X0,cons(X0,X1)) ) ),
inference(resolution,[],[f93,f96]) ).
tff(f103,plain,
! [X2: $int,X3: list,X0: $int,X1: list] :
( ( count(X0,append(cons(X0,X1),cons(X2,X3))) = $sum(count(X0,X1),1) )
| in(X2,X3) ),
inference(forward_demodulation,[],[f102,f95]) ).
tff(f104,plain,
! [X2: $int,X3: list,X0: $int,X1: list] :
( in(X2,X3)
| ( count(X0,append(cons(X0,X1),cons(X2,X3))) = $sum(1,count(X0,X1)) ) ),
inference(forward_demodulation,[],[f103,f19]) ).
tff(f105,plain,
! [X2: $int,X3: list,X0: $int,X1: list] :
( in(X2,X3)
| ( count(X0,cons(X0,append(X1,cons(X2,X3)))) = $sum(1,count(X0,X1)) ) ),
inference(forward_demodulation,[],[f104,f72]) ).
tff(f106,plain,
! [X2: $int,X3: list,X0: $int,X1: list] :
( in(X2,X3)
| ( $sum(1,count(X0,X1)) = $sum(count(X0,append(X1,cons(X2,X3))),1) ) ),
inference(forward_demodulation,[],[f105,f95]) ).
tff(f107,plain,
! [X2: $int,X3: list,X0: $int,X1: list] :
( in(X2,X3)
| ( $sum(1,count(X0,X1)) = $sum(1,count(X0,append(X1,cons(X2,X3)))) ) ),
inference(forward_demodulation,[],[f106,f19]) ).
tff(f119,plain,
! [X0: $int] : $less(X0,$sum(X0,1)),
inference(resolution,[],[f28,f24]) ).
tff(f123,plain,
! [X0: $int] : $less(X0,$sum(1,X0)),
inference(superposition,[],[f119,f19]) ).
tff(f141,plain,
! [X2: $int,X3: list,X0: $int,X1: list] :
( $less(0,count(X0,X1))
| ( $sum(1,count(X2,append(X3,cons(X0,X1)))) = $sum(1,count(X2,X3)) ) ),
inference(resolution,[],[f85,f107]) ).
tff(f145,plain,
! [X2: list,X0: $int,X1: $int] :
( ( $sum(1,count(X1,append(X2,cons(X0,nil)))) = $sum(1,count(X1,X2)) )
| $less(0,0) ),
inference(superposition,[],[f141,f71]) ).
tff(f146,plain,
! [X2: list,X0: $int,X1: $int] : ( $sum(1,count(X1,append(X2,cons(X0,nil)))) = $sum(1,count(X1,X2)) ),
inference(evaluation,[],[f145]) ).
tff(f150,plain,
! [X0: $int,X1: $int] : ( $sum(1,count(X1,nil)) = $sum(1,count(X1,cons(X0,nil))) ),
inference(superposition,[],[f146,f89]) ).
tff(f151,plain,
! [X2: $int,X0: $int,X1: list] : $less(count(X0,append(X1,cons(X2,nil))),$sum(1,count(X0,X1))),
inference(superposition,[],[f123,f146]) ).
tff(f152,plain,
! [X0: $int,X1: $int] : ( $sum(1,0) = $sum(1,count(X1,cons(X0,nil))) ),
inference(forward_demodulation,[],[f150,f71]) ).
tff(f153,plain,
! [X0: $int,X1: $int] : ( 1 = $sum(1,count(X1,cons(X0,nil))) ),
inference(evaluation,[],[f152]) ).
tff(f184,plain,
! [X2: $int,X0: $int,X1: $int] : $less(count(X0,append(cons(X1,nil),cons(X2,nil))),1),
inference(superposition,[],[f151,f153]) ).
tff(f189,plain,
! [X2: $int,X0: $int,X1: $int] : $less(count(X0,cons(X1,append(nil,cons(X2,nil)))),1),
inference(forward_demodulation,[],[f184,f72]) ).
tff(f190,plain,
! [X2: $int,X0: $int,X1: $int] : $less(count(X0,cons(X1,cons(X2,nil))),1),
inference(forward_demodulation,[],[f189,f89]) ).
tff(f287,plain,
! [X0: $int,X1: $int] : $less($sum(count(X0,cons(X1,nil)),1),1),
inference(superposition,[],[f190,f95]) ).
tff(f298,plain,
! [X0: $int,X1: $int] : $less($sum(1,count(X0,cons(X1,nil))),1),
inference(forward_demodulation,[],[f287,f19]) ).
tff(f312,plain,
$less(1,1),
inference(forward_demodulation,[],[f298,f153]) ).
tff(f313,plain,
$false,
inference(evaluation,[],[f312]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : DAT097_1 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n018.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Tue Sep 29 00:10:40 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running first-order theorem proving
% 0.07/0.22 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.85/0.77 % (3914611)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 1.85/0.77 % (3914622)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=1158072946:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 1.85/0.77 % (3914622)First to succeed.
% 1.85/0.77 % (3914622)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3914611"
% 1.85/0.77 % (3914617)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=2255257327:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 1.85/0.77 % (3914621)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=2408729582:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 1.85/0.77 % (3914618)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=973308224:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 1.85/0.77 % (3914619)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=1334380328:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 1.85/0.77 % (3914616)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=3546394355:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 1.85/0.77 % (3914620)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=946940153:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 1.85/0.77 % (3914620)Instruction limit reached!
% 1.85/0.77 % (3914620)------------------------------
% 1.85/0.77 % (3914620)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.85/0.77 % (3914620)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.85/0.77 % (3914620)CaDiCaL version: 2.1.3
% 1.85/0.77 % (3914620)Termination reason: Instruction limit
% 1.85/0.77 % (3914620)Termination phase: Saturation
% 1.85/0.77 % (3914620)Time elapsed: 0.004 s
% 1.85/0.77 % (3914620)Peak memory usage: 88 MB
% 1.85/0.77 % (3914620)Instructions burned: 5 (million)
% 1.85/0.77 % (3914619)Instruction limit reached!
% 1.85/0.77 % (3914619)------------------------------
% 1.85/0.77 % (3914619)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.85/0.77 % (3914619)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.85/0.77 % (3914619)CaDiCaL version: 2.1.3
% 1.85/0.77 % (3914619)Termination reason: Instruction limit
% 1.85/0.77 % (3914619)Termination phase: Saturation
% 1.85/0.77 % (3914619)Time elapsed: 0.006 s
% 1.85/0.77 % (3914619)Peak memory usage: 88 MB
% 1.85/0.77 % (3914619)Instructions burned: 8 (million)
% 1.85/0.77 % (3914616)Refutation not found, incomplete strategy
% 1.85/0.77 % (3914616)------------------------------
% 1.85/0.77 % (3914616)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.85/0.77 % (3914616)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.85/0.77 % (3914616)CaDiCaL version: 2.1.3
% 1.85/0.77 % (3914616)Termination reason: Refutation not found, incomplete strategy
% 1.85/0.77 % (3914616)Time elapsed: 0.031 s
% 1.85/0.77 % (3914616)Peak memory usage: 112 MB
% 1.85/0.77 % (3914616)Instructions burned: 11 (million)
% 1.85/0.77 % (3914621)Also succeeded, but the first one will report.
% 1.85/0.77 % (3914617)Also succeeded, but the first one will report.
% 1.85/0.77 % (3914618)Also succeeded, but the first one will report.
% 1.85/0.77 % (3914622)Refutation found. Thanks to Tanya!
% 1.85/0.77 % SZS status Theorem for theBenchmark
% 1.85/0.77 % SZS output start Proof for theBenchmark
% See solution above
% 2.48/0.88 % (3914622)------------------------------
% 2.48/0.88 % (3914622)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.48/0.88 % (3914622)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.48/0.88 % (3914622)CaDiCaL version: 2.1.3
% 2.48/0.88 % (3914622)Termination reason: Refutation
% 2.48/0.88 % (3914622)Time elapsed: 0.024 s
% 2.48/0.88 % (3914622)Peak memory usage: 116 MB
% 2.48/0.88 % (3914622)Instructions burned: 23 (million)
% 2.48/0.88 % (3914622)------------------------------
% 2.48/0.88 % (3914622)------------------------------
% 2.48/0.88 % (3914611)Success in time 0.318 s
% 2.48/0.88 % Vampire exiting
%------------------------------------------------------------------------------