%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM957_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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 12:17:41 PM UTC 2026
% Result : Theorem 2.58s 1.24s
% Output : Refutation 3.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of formulae : 66 ( 57 unt; 0 typ; 0 def)
% Number of atoms : 80 ( 22 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 24 ~; 11 |; 0 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-3 aty)
% Number of variables : 43 ( 43 !; 0 ?; 43 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
int: $tType ).
tff(func_def_0,type,
minus_minus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_1,type,
one_one:
!>[X0: $tType] : X0 ).
tff(func_def_2,type,
plus_plus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_3,type,
times_times:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_4,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_5,type,
bit0: int > int ).
tff(func_def_6,type,
bit1: int > int ).
tff(func_def_7,type,
pls: int ).
tff(func_def_8,type,
number_number_of:
!>[X0: $tType] : ( int > X0 ) ).
tff(func_def_9,type,
fFalse: bool ).
tff(func_def_10,type,
fTrue: bool ).
tff(func_def_11,type,
m: int ).
tff(func_def_12,type,
t: int ).
tff(pred_def_1,type,
number:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
ring:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
semiring:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
number_ring:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
ring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
number_semiring:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
linord219039673up_add:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
zprime: int > $o ).
tff(pred_def_10,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_11,type,
twoSqu1567020053sum2sq: int > $o ).
tff(pred_def_12,type,
pp: bool > $o ).
tff(f1,axiom,
ord_less(int,zero_zero(int),plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_p0) ).
tff(f2,axiom,
ord_less(int,minus_minus(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),one_one(int)),t),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1__0964_A_K_Am_A_L_A1_A_N_A1_A_060_At_096) ).
tff(f15,axiom,
! [X0: int,X1: int] : ( minus_minus(int,bit1(X1),bit1(X0)) = bit0(minus_minus(int,X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_14_diff__bin__simps_I10_J) ).
tff(f16,axiom,
! [X0: int,X1: int] : ( plus_plus(int,bit0(X1),bit1(X0)) = bit1(plus_plus(int,X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_15_add__Bit0__Bit1) ).
tff(f33,axiom,
! [X0: int,X1: int] : ( times_times(int,bit0(X1),X0) = bit0(times_times(int,X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_32_mult__Bit0) ).
tff(f52,axiom,
pls = zero_zero(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_51_Pls__def) ).
tff(f55,axiom,
! [X0: int] : ( number_number_of(int,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_54_number__of__is__id) ).
tff(f62,axiom,
! [X0: int,X1: int,X2: int] :
( ord_less(int,X2,X1)
=> ( ord_less(int,zero_zero(int),X0)
=> ord_less(int,times_times(int,X0,X2),times_times(int,X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_61_zmult__zless__mono2) ).
tff(f70,axiom,
! [X0: int] : ( plus_plus(int,X0,pls) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_69_add__Pls__right) ).
tff(f75,axiom,
! [X0: int] : ( minus_minus(int,X0,pls) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_74_diff__bin__simps_I1_J) ).
tff(f90,axiom,
! [X0: $tType] :
( number_ring(X0)
=> ! [X1: X0] : ( times_times(X0,number_number_of(X0,bit1(pls)),X1) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_89_mult__numeral__1) ).
tff(f94,axiom,
one_one(int) = number_number_of(int,bit1(pls)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_93_one__is__num__one) ).
tff(f103,axiom,
number_ring(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Int_Onumber__ring) ).
tff(f109,conjecture,
ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),minus_minus(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),one_one(int))),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f110,negated_conjecture,
~ ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),minus_minus(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),one_one(int))),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t)),
inference(negated_conjecture,[status(cth)],[f109]) ).
tff(f111,plain,
~ ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),minus_minus(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),one_one(int))),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t)),
inference(flattening,[],[f110]) ).
tff(f148,plain,
! [X0: int,X1: int,X2: int] :
( ord_less(int,times_times(int,X0,X2),times_times(int,X0,X1))
| ~ ord_less(int,zero_zero(int),X0)
| ~ ord_less(int,X2,X1) ),
inference(ennf_transformation,[],[f62]) ).
tff(f149,plain,
! [X0: int,X1: int,X2: int] :
( ord_less(int,times_times(int,X0,X2),times_times(int,X0,X1))
| ~ ord_less(int,zero_zero(int),X0)
| ~ ord_less(int,X2,X1) ),
inference(flattening,[],[f148]) ).
tff(f158,plain,
! [X0: $tType] :
( ! [X1: X0] : ( times_times(X0,number_number_of(X0,bit1(pls)),X1) = X1 )
| ~ number_ring(X0) ),
inference(ennf_transformation,[],[f90]) ).
tff(f197,plain,
ord_less(int,zero_zero(int),plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),
inference(cnf_transformation,[],[f1]) ).
tff(f198,plain,
ord_less(int,minus_minus(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),one_one(int)),t),
inference(cnf_transformation,[],[f2]) ).
tff(f212,plain,
! [X0: int,X1: int] : ( minus_minus(int,bit1(X1),bit1(X0)) = bit0(minus_minus(int,X1,X0)) ),
inference(cnf_transformation,[],[f15]) ).
tff(f213,plain,
! [X0: int,X1: int] : ( plus_plus(int,bit0(X1),bit1(X0)) = bit1(plus_plus(int,X1,X0)) ),
inference(cnf_transformation,[],[f16]) ).
tff(f238,plain,
! [X0: int,X1: int] : ( bit0(times_times(int,X1,X0)) = times_times(int,bit0(X1),X0) ),
inference(cnf_transformation,[],[f33]) ).
tff(f264,plain,
zero_zero(int) = pls,
inference(cnf_transformation,[],[f52]) ).
tff(f268,plain,
! [X0: int] : ( number_number_of(int,X0) = X0 ),
inference(cnf_transformation,[],[f55]) ).
tff(f278,plain,
! [X2: int,X0: int,X1: int] :
( ord_less(int,times_times(int,X0,X2),times_times(int,X0,X1))
| ~ ord_less(int,zero_zero(int),X0)
| ~ ord_less(int,X2,X1) ),
inference(cnf_transformation,[],[f149]) ).
tff(f292,plain,
! [X0: int] : ( plus_plus(int,X0,pls) = X0 ),
inference(cnf_transformation,[],[f70]) ).
tff(f298,plain,
! [X0: int] : ( minus_minus(int,X0,pls) = X0 ),
inference(cnf_transformation,[],[f75]) ).
tff(f316,plain,
! [X0: $tType,X1: X0] :
( ~ number_ring(X0)
| ( times_times(X0,number_number_of(X0,bit1(pls)),X1) = X1 ) ),
inference(cnf_transformation,[],[f158]) ).
tff(f320,plain,
one_one(int) = number_number_of(int,bit1(pls)),
inference(cnf_transformation,[],[f94]) ).
tff(f329,plain,
number_ring(int),
inference(cnf_transformation,[],[f103]) ).
tff(f335,plain,
~ ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),minus_minus(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),one_one(int))),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t)),
inference(cnf_transformation,[],[f111]) ).
tff(f364,plain,
bit1(pls) = one_one(int),
inference(forward_demodulation,[],[f320,f268]) ).
tff(f367,plain,
~ ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),bit1(pls)),minus_minus(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),bit1(pls)),bit1(pls))),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),bit1(pls)),t)),
inference(superposition,[],[f335,f364]) ).
tff(f368,plain,
~ ord_less(int,times_times(int,plus_plus(int,times_times(int,bit0(bit0(bit1(pls))),m),bit1(pls)),minus_minus(int,plus_plus(int,times_times(int,bit0(bit0(bit1(pls))),m),bit1(pls)),bit1(pls))),times_times(int,plus_plus(int,times_times(int,bit0(bit0(bit1(pls))),m),bit1(pls)),t)),
inference(forward_demodulation,[],[f367,f268]) ).
tff(f411,plain,
~ ord_less(int,times_times(int,plus_plus(int,bit0(times_times(int,bit0(bit1(pls)),m)),bit1(pls)),minus_minus(int,plus_plus(int,bit0(times_times(int,bit0(bit1(pls)),m)),bit1(pls)),bit1(pls))),times_times(int,plus_plus(int,bit0(times_times(int,bit0(bit1(pls)),m)),bit1(pls)),t)),
inference(superposition,[],[f368,f238]) ).
tff(f414,plain,
~ ord_less(int,times_times(int,plus_plus(int,bit0(bit0(times_times(int,bit1(pls),m))),bit1(pls)),minus_minus(int,plus_plus(int,bit0(bit0(times_times(int,bit1(pls),m))),bit1(pls)),bit1(pls))),times_times(int,plus_plus(int,bit0(bit0(times_times(int,bit1(pls),m))),bit1(pls)),t)),
inference(forward_demodulation,[],[f411,f238]) ).
tff(f433,plain,
! [X0: int] : ( times_times(int,number_number_of(int,bit1(pls)),X0) = X0 ),
inference(resolution,[],[f316,f329]) ).
tff(f434,plain,
! [X0: int] : ( times_times(int,bit1(pls),X0) = X0 ),
inference(forward_demodulation,[],[f433,f268]) ).
tff(f456,plain,
~ ord_less(int,times_times(int,bit1(plus_plus(int,bit0(times_times(int,bit1(pls),m)),pls)),minus_minus(int,bit1(plus_plus(int,bit0(times_times(int,bit1(pls),m)),pls)),bit1(pls))),times_times(int,bit1(plus_plus(int,bit0(times_times(int,bit1(pls),m)),pls)),t)),
inference(superposition,[],[f414,f213]) ).
tff(f463,plain,
~ ord_less(int,times_times(int,bit1(bit0(times_times(int,bit1(pls),m))),minus_minus(int,bit1(bit0(times_times(int,bit1(pls),m))),bit1(pls))),times_times(int,bit1(bit0(times_times(int,bit1(pls),m))),t)),
inference(forward_demodulation,[],[f456,f292]) ).
tff(f466,plain,
~ ord_less(int,times_times(int,bit1(bit0(m)),minus_minus(int,bit1(bit0(m)),bit1(pls))),times_times(int,bit1(bit0(m)),t)),
inference(forward_demodulation,[],[f463,f434]) ).
tff(f468,plain,
~ ord_less(int,times_times(int,bit1(bit0(m)),bit0(minus_minus(int,bit0(m),pls))),times_times(int,bit1(bit0(m)),t)),
inference(forward_demodulation,[],[f466,f212]) ).
tff(f469,plain,
~ ord_less(int,times_times(int,bit1(bit0(m)),bit0(bit0(m))),times_times(int,bit1(bit0(m)),t)),
inference(forward_demodulation,[],[f468,f298]) ).
tff(f752,plain,
ord_less(int,zero_zero(int),plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),bit1(pls))),
inference(forward_demodulation,[],[f197,f364]) ).
tff(f753,plain,
ord_less(int,zero_zero(int),plus_plus(int,times_times(int,bit0(bit0(bit1(pls))),m),bit1(pls))),
inference(forward_demodulation,[],[f752,f268]) ).
tff(f754,plain,
ord_less(int,zero_zero(int),plus_plus(int,bit0(times_times(int,bit0(bit1(pls)),m)),bit1(pls))),
inference(forward_demodulation,[],[f753,f238]) ).
tff(f755,plain,
ord_less(int,zero_zero(int),bit1(plus_plus(int,times_times(int,bit0(bit1(pls)),m),pls))),
inference(forward_demodulation,[],[f754,f213]) ).
tff(f756,plain,
ord_less(int,zero_zero(int),bit1(times_times(int,bit0(bit1(pls)),m))),
inference(forward_demodulation,[],[f755,f292]) ).
tff(f757,plain,
ord_less(int,zero_zero(int),bit1(bit0(times_times(int,bit1(pls),m)))),
inference(forward_demodulation,[],[f756,f238]) ).
tff(f758,plain,
ord_less(int,zero_zero(int),bit1(bit0(m))),
inference(forward_demodulation,[],[f757,f434]) ).
tff(f759,plain,
ord_less(int,pls,bit1(bit0(m))),
inference(forward_demodulation,[],[f758,f264]) ).
tff(f1061,plain,
! [X2: int,X0: int,X1: int] :
( ~ ord_less(int,pls,X0)
| ord_less(int,times_times(int,X0,X2),times_times(int,X0,X1))
| ~ ord_less(int,X2,X1) ),
inference(forward_demodulation,[],[f278,f264]) ).
tff(f1071,plain,
! [X0: int,X1: int] :
( ord_less(int,times_times(int,bit1(bit0(m)),X0),times_times(int,bit1(bit0(m)),X1))
| ~ ord_less(int,X0,X1) ),
inference(resolution,[],[f1061,f759]) ).
tff(f1142,plain,
ord_less(int,minus_minus(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),bit1(pls)),bit1(pls)),t),
inference(forward_demodulation,[],[f198,f364]) ).
tff(f1143,plain,
ord_less(int,minus_minus(int,plus_plus(int,times_times(int,bit0(bit0(bit1(pls))),m),bit1(pls)),bit1(pls)),t),
inference(forward_demodulation,[],[f1142,f268]) ).
tff(f1144,plain,
ord_less(int,minus_minus(int,plus_plus(int,bit0(times_times(int,bit0(bit1(pls)),m)),bit1(pls)),bit1(pls)),t),
inference(forward_demodulation,[],[f1143,f238]) ).
tff(f1145,plain,
ord_less(int,minus_minus(int,bit1(plus_plus(int,times_times(int,bit0(bit1(pls)),m),pls)),bit1(pls)),t),
inference(forward_demodulation,[],[f1144,f213]) ).
tff(f1146,plain,
ord_less(int,bit0(minus_minus(int,plus_plus(int,times_times(int,bit0(bit1(pls)),m),pls),pls)),t),
inference(forward_demodulation,[],[f1145,f212]) ).
tff(f1147,plain,
ord_less(int,bit0(plus_plus(int,times_times(int,bit0(bit1(pls)),m),pls)),t),
inference(forward_demodulation,[],[f1146,f298]) ).
tff(f1148,plain,
ord_less(int,bit0(times_times(int,bit0(bit1(pls)),m)),t),
inference(forward_demodulation,[],[f1147,f292]) ).
tff(f1149,plain,
ord_less(int,bit0(bit0(times_times(int,bit1(pls),m))),t),
inference(forward_demodulation,[],[f1148,f238]) ).
tff(f1150,plain,
ord_less(int,bit0(bit0(m)),t),
inference(forward_demodulation,[],[f1149,f434]) ).
tff(f1832,plain,
~ ord_less(int,bit0(bit0(m)),t),
inference(resolution,[],[f1071,f469]) ).
tff(f1854,plain,
$false,
inference(forward_subsumption_resolution,[],[f1832,f1150]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM957_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n001.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 27 21:53:46 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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
% 2.58/1.24 % (3993506)Detected formulas, will run a generic FOF schedule.
% 2.58/1.24 % (3993617)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4273297952:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.58/1.24 % (3993617)First to succeed.
% 2.58/1.24 % (3993617)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3993506"
% 2.58/1.24 % (3993614)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=681835694:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.58/1.24 % (3993615)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=870028646:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.58/1.24 % (3993613)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=3919025218:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.58/1.24 % (3993612)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=1405109268:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.58/1.24 % (3993616)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1724824442:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.58/1.24 % (3993618)dis-21_1_sil=8000:lcm=predicate:random_seed=1567114931: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.58/1.24 % (3993615)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.58/1.24 % (3993614)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.58/1.24 % (3993615)Refutation not found, incomplete strategy
% 2.58/1.24 % (3993615)------------------------------
% 2.58/1.24 % (3993615)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.58/1.24 % (3993615)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.58/1.24 % (3993615)CaDiCaL version: 2.1.3
% 2.58/1.24 % (3993615)Termination reason: Refutation not found, incomplete strategy
% 2.58/1.24 % (3993615)Time elapsed: 0.010 s
% 2.58/1.24 % (3993615)Peak memory usage: 89 MB
% 2.58/1.24 % (3993615)Instructions burned: 15 (million)
% 2.58/1.24 % (3993616)Instruction limit reached!
% 2.58/1.24 % (3993616)------------------------------
% 2.58/1.24 % (3993616)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.58/1.24 % (3993616)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.58/1.24 % (3993616)CaDiCaL version: 2.1.3
% 2.58/1.24 % (3993616)Termination reason: Instruction limit
% 2.58/1.24 % (3993616)Termination phase: Saturation
% 2.58/1.24 % (3993616)Time elapsed: 0.067 s
% 2.58/1.24 % (3993616)Peak memory usage: 88 MB
% 2.58/1.24 % (3993616)Instructions burned: 121 (million)
% 2.58/1.24 % (3993618)Instruction limit reached!
% 2.58/1.24 % (3993618)------------------------------
% 2.58/1.24 % (3993618)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.58/1.24 % (3993618)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.58/1.24 % (3993618)CaDiCaL version: 2.1.3
% 2.58/1.24 % (3993618)Termination reason: Instruction limit
% 2.58/1.24 % (3993618)Termination phase: Saturation
% 2.58/1.24 % (3993618)Time elapsed: 0.071 s
% 2.58/1.24 % (3993618)Peak memory usage: 89 MB
% 2.58/1.24 % (3993618)Instructions burned: 130 (million)
% 2.58/1.24 % (3993617)Refutation found. Thanks to Tanya!
% 2.58/1.24 % SZS status Theorem for theBenchmark
% 2.58/1.24 % SZS output start Proof for theBenchmark
% See solution above
% 3.22/1.44 % (3993617)------------------------------
% 3.22/1.44 % (3993617)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.22/1.44 % (3993617)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.22/1.44 % (3993617)CaDiCaL version: 2.1.3
% 3.22/1.44 % (3993617)Termination reason: Refutation
% 3.22/1.44 % (3993617)Time elapsed: 0.026 s
% 3.22/1.44 % (3993617)Peak memory usage: 89 MB
% 3.22/1.44 % (3993617)Instructions burned: 71 (million)
% 3.22/1.44 % (3993617)------------------------------
% 3.22/1.44 % (3993617)------------------------------
% 3.22/1.44 % (3993506)Success in time 0.37 s
% 3.22/1.44 % Vampire exiting
%------------------------------------------------------------------------------