%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM995_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 : n015.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:46 PM UTC 2026
% Result : Theorem 3.66s 1.44s
% Output : Refutation 4.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 11
% Syntax : Number of formulae : 51 ( 43 unt; 0 typ; 0 def)
% Number of atoms : 63 ( 44 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 26 ~; 9 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of FOOLs : 1 ( 1 fml; 0 var)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 9 con; 0-3 aty)
% Number of variables : 31 ( 31 !; 0 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
int: $tType ).
tff(type_def_7,type,
nat: $tType ).
tff(func_def_0,type,
one_one:
!>[X0: $tType] : X0 ).
tff(func_def_1,type,
plus_plus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_2,type,
times_times:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_3,type,
bit0: int > int ).
tff(func_def_4,type,
bit1: int > int ).
tff(func_def_5,type,
pls: int ).
tff(func_def_6,type,
number_number_of:
!>[X0: $tType] : ( int > X0 ) ).
tff(func_def_7,type,
semiring_1_of_nat:
!>[X0: $tType] : ( nat > X0 ) ).
tff(func_def_8,type,
power_power:
!>[X0: $tType] : ( ( X0 * nat ) > X0 ) ).
tff(func_def_9,type,
fFalse: bool ).
tff(func_def_10,type,
fTrue: bool ).
tff(func_def_11,type,
m1: int ).
tff(func_def_12,type,
n: nat ).
tff(func_def_13,type,
t: int ).
tff(func_def_14,type,
v: int ).
tff(func_def_15,type,
w: int ).
tff(func_def_16,type,
sK0: int ).
tff(pred_def_1,type,
number:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
semiring:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
number_ring:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
ring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
monoid_mult:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
number_semiring:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_10,type,
dvd_dvd:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_11,type,
pp: bool > $o ).
tff(f1,axiom,
plus_plus(int,power_power(int,v,number_number_of(nat,bit0(bit1(pls)))),power_power(int,w,number_number_of(nat,bit0(bit1(pls))))) = times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),m1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_m1) ).
tff(f4,axiom,
! [X0: $tType] :
( ( monoid_mult(X0)
& number(X0) )
=> ! [X1: int] : ( power_power(X0,number_number_of(X0,X1),number_number_of(nat,bit0(bit1(pls)))) = times_times(X0,number_number_of(X0,X1),number_number_of(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_power2__eq__square__number__of) ).
tff(f31,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_30_mult__Bit0) ).
tff(f69,axiom,
! [X0: int] : ( number_number_of(int,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_68_number__of__is__id) ).
tff(f77,axiom,
! [X0: int,X1: int,X2: int] : ( times_times(int,X2,plus_plus(int,X1,X0)) = plus_plus(int,times_times(int,X2,X1),times_times(int,X2,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_76_int__distrib_I2_J) ).
tff(f86,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_85_mult__numeral__1) ).
tff(f90,axiom,
one_one(int) = number_number_of(int,bit1(pls)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_89_one__is__num__one) ).
tff(f101,axiom,
monoid_mult(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Groups_Omonoid__mult) ).
tff(f104,axiom,
number_ring(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Int_Onumber__ring) ).
tff(f106,axiom,
number(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Int_Onumber) ).
tff(f114,conjecture,
times_times(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),m1) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),power_power(int,v,number_number_of(nat,bit0(bit1(pls))))),times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),power_power(int,w,number_number_of(nat,bit0(bit1(pls)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f115,negated_conjecture,
( ( ~ times_times(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),m1) ) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),power_power(int,v,number_number_of(nat,bit0(bit1(pls))))),times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),power_power(int,w,number_number_of(nat,bit0(bit1(pls)))))) ),
inference(negated_conjecture,[status(cth)],[f114]) ).
tff(f116,plain,
times_times(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),m1) != plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),power_power(int,v,number_number_of(nat,bit0(bit1(pls))))),times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),power_power(int,w,number_number_of(nat,bit0(bit1(pls)))))),
inference(flattening,[],[f115]) ).
tff(f118,plain,
! [X0: $tType] :
( ! [X1: int] : ( power_power(X0,number_number_of(X0,X1),number_number_of(nat,bit0(bit1(pls)))) = times_times(X0,number_number_of(X0,X1),number_number_of(X0,X1)) )
| ~ monoid_mult(X0)
| ~ number(X0) ),
inference(ennf_transformation,[],[f4]) ).
tff(f119,plain,
! [X0: $tType] :
( ! [X1: int] : ( power_power(X0,number_number_of(X0,X1),number_number_of(nat,bit0(bit1(pls)))) = times_times(X0,number_number_of(X0,X1),number_number_of(X0,X1)) )
| ~ monoid_mult(X0)
| ~ number(X0) ),
inference(flattening,[],[f118]) ).
tff(f152,plain,
! [X0: $tType] :
( ! [X1: X0] : ( times_times(X0,number_number_of(X0,bit1(pls)),X1) = X1 )
| ~ number_ring(X0) ),
inference(ennf_transformation,[],[f86]) ).
tff(f188,plain,
plus_plus(int,power_power(int,v,number_number_of(nat,bit0(bit1(pls)))),power_power(int,w,number_number_of(nat,bit0(bit1(pls))))) = times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),m1),
inference(cnf_transformation,[],[f1]) ).
tff(f191,plain,
! [X0: $tType,X1: int] :
( ~ monoid_mult(X0)
| ( power_power(X0,number_number_of(X0,X1),number_number_of(nat,bit0(bit1(pls)))) = times_times(X0,number_number_of(X0,X1),number_number_of(X0,X1)) )
| ~ number(X0) ),
inference(cnf_transformation,[],[f119]) ).
tff(f225,plain,
! [X0: int,X1: int] : ( bit0(times_times(int,X1,X0)) = times_times(int,bit0(X1),X0) ),
inference(cnf_transformation,[],[f31]) ).
tff(f281,plain,
! [X0: int] : ( number_number_of(int,X0) = X0 ),
inference(cnf_transformation,[],[f69]) ).
tff(f290,plain,
! [X2: int,X0: int,X1: int] : ( times_times(int,X2,plus_plus(int,X1,X0)) = plus_plus(int,times_times(int,X2,X1),times_times(int,X2,X0)) ),
inference(cnf_transformation,[],[f77]) ).
tff(f299,plain,
! [X0: $tType,X1: X0] :
( ~ number_ring(X0)
| ( times_times(X0,number_number_of(X0,bit1(pls)),X1) = X1 ) ),
inference(cnf_transformation,[],[f152]) ).
tff(f303,plain,
one_one(int) = number_number_of(int,bit1(pls)),
inference(cnf_transformation,[],[f90]) ).
tff(f314,plain,
monoid_mult(int),
inference(cnf_transformation,[],[f101]) ).
tff(f317,plain,
number_ring(int),
inference(cnf_transformation,[],[f104]) ).
tff(f319,plain,
number(int),
inference(cnf_transformation,[],[f106]) ).
tff(f327,plain,
times_times(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),m1) != plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),power_power(int,v,number_number_of(nat,bit0(bit1(pls))))),times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),power_power(int,w,number_number_of(nat,bit0(bit1(pls)))))),
inference(cnf_transformation,[],[f116]) ).
tff(f338,plain,
times_times(int,times_times(int,bit0(bit0(bit1(pls))),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),m1) != plus_plus(int,times_times(int,bit0(bit0(bit1(pls))),power_power(int,v,number_number_of(nat,bit0(bit1(pls))))),times_times(int,bit0(bit0(bit1(pls))),power_power(int,w,number_number_of(nat,bit0(bit1(pls)))))),
inference(superposition,[],[f327,f281]) ).
tff(f343,plain,
bit1(pls) = one_one(int),
inference(forward_demodulation,[],[f303,f281]) ).
tff(f407,plain,
! [X0: int] : ( times_times(int,number_number_of(int,bit1(pls)),X0) = X0 ),
inference(resolution,[],[f299,f317]) ).
tff(f408,plain,
! [X0: int] : ( times_times(int,bit1(pls),X0) = X0 ),
inference(forward_demodulation,[],[f407,f281]) ).
tff(f953,plain,
! [X0: int] :
( ( power_power(int,number_number_of(int,X0),number_number_of(nat,bit0(bit1(pls)))) = times_times(int,number_number_of(int,X0),number_number_of(int,X0)) )
| ~ number(int) ),
inference(resolution,[],[f191,f314]) ).
tff(f956,plain,
! [X0: int] : ( power_power(int,number_number_of(int,X0),number_number_of(nat,bit0(bit1(pls)))) = times_times(int,number_number_of(int,X0),number_number_of(int,X0)) ),
inference(forward_subsumption_resolution,[],[f953,f319]) ).
tff(f957,plain,
! [X0: int] : ( power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))) = times_times(int,X0,X0) ),
inference(forward_demodulation,[],[f956,f281]) ).
tff(f990,plain,
times_times(int,times_times(int,bit0(bit0(bit1(pls))),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),m1) != plus_plus(int,times_times(int,bit0(bit0(bit1(pls))),power_power(int,v,number_number_of(nat,bit0(bit1(pls))))),times_times(int,bit0(bit0(bit1(pls))),times_times(int,w,w))),
inference(superposition,[],[f338,f957]) ).
tff(f1005,plain,
times_times(int,times_times(int,bit0(bit0(bit1(pls))),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),m1) != times_times(int,bit0(bit0(bit1(pls))),plus_plus(int,power_power(int,v,number_number_of(nat,bit0(bit1(pls)))),times_times(int,w,w))),
inference(forward_demodulation,[],[f990,f290]) ).
tff(f1017,plain,
times_times(int,times_times(int,bit0(bit0(bit1(pls))),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),m1) != bit0(times_times(int,bit0(bit1(pls)),plus_plus(int,power_power(int,v,number_number_of(nat,bit0(bit1(pls)))),times_times(int,w,w)))),
inference(forward_demodulation,[],[f1005,f225]) ).
tff(f1025,plain,
times_times(int,times_times(int,bit0(bit0(bit1(pls))),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),m1) != bit0(bit0(times_times(int,bit1(pls),plus_plus(int,power_power(int,v,number_number_of(nat,bit0(bit1(pls)))),times_times(int,w,w))))),
inference(forward_demodulation,[],[f1017,f225]) ).
tff(f1033,plain,
times_times(int,times_times(int,bit0(bit0(bit1(pls))),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),m1) != bit0(bit0(plus_plus(int,power_power(int,v,number_number_of(nat,bit0(bit1(pls)))),times_times(int,w,w)))),
inference(forward_demodulation,[],[f1025,f408]) ).
tff(f1039,plain,
times_times(int,times_times(int,bit0(bit0(bit1(pls))),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),m1) != bit0(bit0(plus_plus(int,times_times(int,v,v),times_times(int,w,w)))),
inference(forward_demodulation,[],[f1033,f957]) ).
tff(f1045,plain,
times_times(int,bit0(times_times(int,bit0(bit1(pls)),plus_plus(int,one_one(int),semiring_1_of_nat(int,n)))),m1) != bit0(bit0(plus_plus(int,times_times(int,v,v),times_times(int,w,w)))),
inference(forward_demodulation,[],[f1039,f225]) ).
tff(f1051,plain,
bit0(times_times(int,times_times(int,bit0(bit1(pls)),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),m1)) != bit0(bit0(plus_plus(int,times_times(int,v,v),times_times(int,w,w)))),
inference(forward_demodulation,[],[f1045,f225]) ).
tff(f1055,plain,
bit0(times_times(int,bit0(times_times(int,bit1(pls),plus_plus(int,one_one(int),semiring_1_of_nat(int,n)))),m1)) != bit0(bit0(plus_plus(int,times_times(int,v,v),times_times(int,w,w)))),
inference(forward_demodulation,[],[f1051,f225]) ).
tff(f1059,plain,
bit0(bit0(times_times(int,times_times(int,bit1(pls),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),m1))) != bit0(bit0(plus_plus(int,times_times(int,v,v),times_times(int,w,w)))),
inference(forward_demodulation,[],[f1055,f225]) ).
tff(f1063,plain,
bit0(bit0(times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),m1))) != bit0(bit0(plus_plus(int,times_times(int,v,v),times_times(int,w,w)))),
inference(forward_demodulation,[],[f1059,f408]) ).
tff(f1067,plain,
bit0(bit0(times_times(int,plus_plus(int,bit1(pls),semiring_1_of_nat(int,n)),m1))) != bit0(bit0(plus_plus(int,times_times(int,v,v),times_times(int,w,w)))),
inference(forward_demodulation,[],[f1063,f343]) ).
tff(f1134,plain,
plus_plus(int,power_power(int,v,number_number_of(nat,bit0(bit1(pls)))),power_power(int,w,number_number_of(nat,bit0(bit1(pls))))) = times_times(int,plus_plus(int,bit1(pls),semiring_1_of_nat(int,n)),m1),
inference(forward_demodulation,[],[f188,f343]) ).
tff(f1135,plain,
times_times(int,plus_plus(int,bit1(pls),semiring_1_of_nat(int,n)),m1) = plus_plus(int,power_power(int,v,number_number_of(nat,bit0(bit1(pls)))),times_times(int,w,w)),
inference(forward_demodulation,[],[f1134,f957]) ).
tff(f1136,plain,
times_times(int,plus_plus(int,bit1(pls),semiring_1_of_nat(int,n)),m1) = plus_plus(int,times_times(int,v,v),times_times(int,w,w)),
inference(forward_demodulation,[],[f1135,f957]) ).
tff(f1137,plain,
bit0(bit0(plus_plus(int,times_times(int,v,v),times_times(int,w,w)))) != bit0(bit0(plus_plus(int,times_times(int,v,v),times_times(int,w,w)))),
inference(superposition,[],[f1067,f1136]) ).
tff(f1143,plain,
$false,
inference(trivial_inequality_removal,[],[f1137]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM995_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.09/0.36 % Computer : n015.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 27 21:53:01 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/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
% 3.66/1.44 % (2041831)Detected formulas, will run a generic FOF schedule.
% 3.66/1.44 % (2041851)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=3373881411:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.66/1.44 % (2041851)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.66/1.44 % (2041849)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=3905525959:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.66/1.44 % (2041852)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1136306823:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.66/1.44 % (2041854)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=412176037:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.66/1.44 % (2041850)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=1500271590:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.66/1.44 % (2041852)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.66/1.44 % (2041853)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2655700685:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.66/1.44 % (2041854)First to succeed.
% 3.66/1.44 % (2041854)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2041831"
% 3.66/1.44 % (2041855)dis-21_1_sil=8000:lcm=predicate:random_seed=508295833: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)
% 3.66/1.44 % (2041852)Instruction limit reached!
% 3.66/1.44 % (2041852)------------------------------
% 3.66/1.44 % (2041852)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.66/1.44 % (2041852)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.66/1.44 % (2041852)CaDiCaL version: 2.1.3
% 3.66/1.44 % (2041852)Termination reason: Instruction limit
% 3.66/1.44 % (2041852)Termination phase: Saturation
% 3.66/1.44 % (2041852)Time elapsed: 0.098 s
% 3.66/1.44 % (2041852)Peak memory usage: 89 MB
% 3.66/1.44 % (2041852)Instructions burned: 109 (million)
% 3.66/1.44 % (2041853)Instruction limit reached!
% 3.66/1.44 % (2041853)------------------------------
% 3.66/1.44 % (2041853)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.66/1.44 % (2041853)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.66/1.44 % (2041853)CaDiCaL version: 2.1.3
% 3.66/1.44 % (2041853)Termination reason: Instruction limit
% 3.66/1.44 % (2041853)Termination phase: Saturation
% 3.66/1.44 % (2041853)Time elapsed: 0.113 s
% 3.66/1.44 % (2041853)Peak memory usage: 88 MB
% 3.66/1.44 % (2041853)Instructions burned: 120 (million)
% 3.66/1.44 % (2041855)Instruction limit reached!
% 3.66/1.44 % (2041855)------------------------------
% 3.66/1.44 % (2041855)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.66/1.44 % (2041855)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.66/1.44 % (2041855)CaDiCaL version: 2.1.3
% 3.66/1.44 % (2041855)Termination reason: Instruction limit
% 3.66/1.44 % (2041855)Termination phase: Saturation
% 3.66/1.44 % (2041855)Time elapsed: 0.110 s
% 3.66/1.44 % (2041855)Peak memory usage: 89 MB
% 3.66/1.44 % (2041855)Instructions burned: 129 (million)
% 3.66/1.44 % (2041851)Aborted by signal SIGSEGV on /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.66/1.44 % (2041851)------------------------------
% 3.66/1.44 % (2041851)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.66/1.44 % (2041851)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.66/1.44 % (2041851)CaDiCaL version: 2.1.3
% 3.66/1.44 % (2041851)Termination reason: Unknown
% 3.66/1.44 % (2041851)Termination phase: Saturation
% 3.66/1.44 % (2041851)Time elapsed: 0.303 s
% 3.66/1.44 % (2041851)Peak memory usage: 113 MB
% 3.66/1.44 % (2041851)Instructions burned: 542 (million)
% 3.66/1.44 % (2041878)lrs+10_1_sil=8000:sp=occurrence:random_seed=4090284605:i=285:sd=3:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/285Mi)
% 3.66/1.44 % (2041879)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3623912887:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/157Mi)
% 3.66/1.44 % (2041881)lrs+1011_1_sil=32000:sp=occurrence:random_seed=445244972:i=325:sd=1:ss=axioms:sgt=32_2996 on theBenchmark for (2996ds/325Mi)
% 3.66/1.44 % (2041854)Refutation found. Thanks to Tanya!
% 3.66/1.44 % SZS status Theorem for theBenchmark
% 3.66/1.44 % SZS output start Proof for theBenchmark
% See solution above
% 4.61/1.54 % (2041854)------------------------------
% 4.61/1.54 % (2041854)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.61/1.54 % (2041854)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.61/1.54 % (2041854)CaDiCaL version: 2.1.3
% 4.61/1.54 % (2041854)Termination reason: Refutation
% 4.61/1.54 % (2041854)Time elapsed: 0.050 s
% 4.61/1.54 % (2041854)Peak memory usage: 89 MB
% 4.61/1.54 % (2041854)Instructions burned: 53 (million)
% 4.61/1.54 % (2041854)------------------------------
% 4.61/1.54 % (2041854)------------------------------
% 4.61/1.54 % (2041831)Success in time 0.586 s
% 4.61/1.54 % Vampire exiting
%------------------------------------------------------------------------------