%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUN008_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 : 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:26:34 PM UTC 2026
% Result : Theorem 4.02s 1.81s
% Output : Refutation 6.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 19 unt; 0 typ; 0 def)
% Number of atoms : 19 ( 18 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 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 : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 19 ( 19 usr; 10 con; 0-3 aty)
% Number of variables : 10 ( 10 !; 0 ?; 10 :)
% 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,
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,
bit0: int > int ).
tff(func_def_5,type,
bit1: int > int ).
tff(func_def_6,type,
pls: int ).
tff(func_def_7,type,
number_number_of:
!>[X0: $tType] : ( int > X0 ) ).
tff(func_def_8,type,
semiring_1_of_nat:
!>[X0: $tType] : ( nat > X0 ) ).
tff(func_def_9,type,
power_power:
!>[X0: $tType] : ( ( X0 * nat ) > X0 ) ).
tff(func_def_10,type,
fFalse: bool ).
tff(func_def_11,type,
fTrue: bool ).
tff(func_def_12,type,
m1: int ).
tff(func_def_13,type,
n: nat ).
tff(func_def_14,type,
r: int ).
tff(func_def_15,type,
sa: int ).
tff(func_def_16,type,
v: int ).
tff(func_def_17,type,
w: int ).
tff(func_def_18,type,
sK0: 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,
semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
monoid_mult:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
number_semiring:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
dvd_dvd:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_10,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/sandbox2/benchmark/theBenchmark.p',fact_0_m1) ).
tff(f68,axiom,
! [X0: int] : ( plus_plus(int,X0,pls) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_67_add__Pls__right) ).
tff(f75,axiom,
! [X0: int,X1: int,X2: int] : ( times_times(int,X2,minus_minus(int,X1,X0)) = minus_minus(int,times_times(int,X2,X1),times_times(int,X2,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_74_int__distrib_I4_J) ).
tff(f81,axiom,
! [X0: int] : ( bit1(X0) = plus_plus(int,plus_plus(int,one_one(int),X0),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_80_Bit1__def) ).
tff(f114,conjecture,
plus_plus(int,power_power(int,plus_plus(int,plus_plus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,v)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,w))),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)))))),number_number_of(nat,bit0(bit1(pls)))),power_power(int,minus_minus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,w)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,v))),number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,power_power(int,plus_plus(int,plus_plus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,v)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,w))),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),m1)),number_number_of(nat,bit0(bit1(pls)))),power_power(int,minus_minus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,w)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,v))),number_number_of(nat,bit0(bit1(pls))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f115,negated_conjecture,
( ( ~ plus_plus(int,power_power(int,plus_plus(int,plus_plus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,v)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,w))),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)))))),number_number_of(nat,bit0(bit1(pls)))),power_power(int,minus_minus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,w)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,v))),number_number_of(nat,bit0(bit1(pls))))) ) = plus_plus(int,power_power(int,plus_plus(int,plus_plus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,v)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,w))),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),m1)),number_number_of(nat,bit0(bit1(pls)))),power_power(int,minus_minus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,w)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,v))),number_number_of(nat,bit0(bit1(pls))))) ),
inference(negated_conjecture,[status(cth)],[f114]) ).
tff(f116,plain,
plus_plus(int,power_power(int,plus_plus(int,plus_plus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,v)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,w))),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)))))),number_number_of(nat,bit0(bit1(pls)))),power_power(int,minus_minus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,w)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,v))),number_number_of(nat,bit0(bit1(pls))))) != plus_plus(int,power_power(int,plus_plus(int,plus_plus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,v)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,w))),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),m1)),number_number_of(nat,bit0(bit1(pls)))),power_power(int,minus_minus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,w)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,v))),number_number_of(nat,bit0(bit1(pls))))),
inference(flattening,[],[f115]) ).
tff(f176,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(f252,plain,
! [X0: int] : ( plus_plus(int,X0,pls) = X0 ),
inference(cnf_transformation,[],[f68]) ).
tff(f259,plain,
! [X2: int,X0: int,X1: int] : ( times_times(int,X2,minus_minus(int,X1,X0)) = minus_minus(int,times_times(int,X2,X1),times_times(int,X2,X0)) ),
inference(cnf_transformation,[],[f75]) ).
tff(f265,plain,
! [X0: int] : ( bit1(X0) = plus_plus(int,plus_plus(int,one_one(int),X0),X0) ),
inference(cnf_transformation,[],[f81]) ).
tff(f298,plain,
plus_plus(int,power_power(int,plus_plus(int,plus_plus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,v)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,w))),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)))))),number_number_of(nat,bit0(bit1(pls)))),power_power(int,minus_minus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,w)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,v))),number_number_of(nat,bit0(bit1(pls))))) != plus_plus(int,power_power(int,plus_plus(int,plus_plus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,v)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,w))),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),m1)),number_number_of(nat,bit0(bit1(pls)))),power_power(int,minus_minus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,w)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,v))),number_number_of(nat,bit0(bit1(pls))))),
inference(cnf_transformation,[],[f116]) ).
tff(f341,plain,
bit1(pls) = plus_plus(int,one_one(int),pls),
inference(superposition,[],[f252,f265]) ).
tff(f342,plain,
bit1(pls) = one_one(int),
inference(forward_demodulation,[],[f341,f252]) ).
tff(f1136,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,[],[f176,f342]) ).
tff(f1197,plain,
plus_plus(int,power_power(int,plus_plus(int,plus_plus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,v)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,w))),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),m1)),number_number_of(nat,bit0(bit1(pls)))),power_power(int,minus_minus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,w)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,v))),number_number_of(nat,bit0(bit1(pls))))) != plus_plus(int,power_power(int,plus_plus(int,plus_plus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,v)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,w))),times_times(int,plus_plus(int,bit1(pls),semiring_1_of_nat(int,n)),m1)),number_number_of(nat,bit0(bit1(pls)))),power_power(int,minus_minus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,w)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,v))),number_number_of(nat,bit0(bit1(pls))))),
inference(superposition,[],[f298,f1136]) ).
tff(f1200,plain,
plus_plus(int,power_power(int,plus_plus(int,plus_plus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,v)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,w))),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),m1)),number_number_of(nat,bit0(bit1(pls)))),power_power(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),minus_minus(int,times_times(int,r,w),times_times(int,sa,v))),number_number_of(nat,bit0(bit1(pls))))) != plus_plus(int,power_power(int,plus_plus(int,plus_plus(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,r,v)),times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),times_times(int,sa,w))),times_times(int,plus_plus(int,bit1(pls),semiring_1_of_nat(int,n)),m1)),number_number_of(nat,bit0(bit1(pls)))),power_power(int,times_times(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),minus_minus(int,times_times(int,r,w),times_times(int,sa,v))),number_number_of(nat,bit0(bit1(pls))))),
inference(forward_demodulation,[],[f1197,f259]) ).
tff(f1202,plain,
plus_plus(int,power_power(int,plus_plus(int,plus_plus(int,times_times(int,plus_plus(int,bit1(pls),semiring_1_of_nat(int,n)),times_times(int,r,v)),times_times(int,plus_plus(int,bit1(pls),semiring_1_of_nat(int,n)),times_times(int,sa,w))),times_times(int,plus_plus(int,bit1(pls),semiring_1_of_nat(int,n)),m1)),number_number_of(nat,bit0(bit1(pls)))),power_power(int,times_times(int,plus_plus(int,bit1(pls),semiring_1_of_nat(int,n)),minus_minus(int,times_times(int,r,w),times_times(int,sa,v))),number_number_of(nat,bit0(bit1(pls))))) != plus_plus(int,power_power(int,plus_plus(int,plus_plus(int,times_times(int,plus_plus(int,bit1(pls),semiring_1_of_nat(int,n)),times_times(int,r,v)),times_times(int,plus_plus(int,bit1(pls),semiring_1_of_nat(int,n)),times_times(int,sa,w))),times_times(int,plus_plus(int,bit1(pls),semiring_1_of_nat(int,n)),m1)),number_number_of(nat,bit0(bit1(pls)))),power_power(int,times_times(int,plus_plus(int,bit1(pls),semiring_1_of_nat(int,n)),minus_minus(int,times_times(int,r,w),times_times(int,sa,v))),number_number_of(nat,bit0(bit1(pls))))),
inference(forward_demodulation,[],[f1200,f342]) ).
tff(f1203,plain,
$false,
inference(trivial_inequality_removal,[],[f1202]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUN008_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.15/0.42 % Computer : n001.cluster.edu
% 0.15/0.42 % Model : x86_64 x86_64
% 0.15/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.42 % Memory : 8046.5625MB
% 0.15/0.42 % OS : Linux 6.8.0-71-generic
% 0.15/0.42 % CPULimit : 300
% 0.15/0.42 % WCLimit : 300
% 0.15/0.42 % DateTime : Sun Sep 27 21:56:01 UTC 2026
% 0.15/0.43 % CPUTime :
% 0.15/0.43 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.49 Running first-order theorem proving
% 0.24/0.49 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
% 4.02/1.81 % (3996968)Detected formulas, will run a generic FOF schedule.
% 4.02/1.81 % (3996973)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=212910819:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.02/1.81 % (3996979)dis-21_1_sil=8000:lcm=predicate:random_seed=2334859816: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)
% 4.02/1.81 % (3996974)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=723110640:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.02/1.81 % (3996979)Instruction limit reached!
% 4.02/1.81 % (3996979)------------------------------
% 4.02/1.81 % (3996979)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.02/1.81 % (3996979)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.02/1.81 % (3996979)CaDiCaL version: 2.1.3
% 4.02/1.81 % (3996979)Termination reason: Instruction limit
% 4.02/1.81 % (3996979)Termination phase: Saturation
% 4.02/1.81 % (3996979)Time elapsed: 0.071 s
% 4.02/1.81 % (3996979)Peak memory usage: 88 MB
% 4.02/1.81 % (3996979)Instructions burned: 131 (million)
% 4.02/1.81 % (3996977)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1784806879:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.02/1.81 % (3996976)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1057511847:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.02/1.81 % (3996978)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1837572350:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.02/1.81 % (3996975)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=131769648:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.02/1.81 % (3996976)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 4.02/1.81 % (3996975)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 4.02/1.81 % (3996976)Refutation not found, incomplete strategy
% 4.02/1.81 % (3996976)------------------------------
% 4.02/1.81 % (3996976)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.02/1.81 % (3996976)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.02/1.81 % (3996976)CaDiCaL version: 2.1.3
% 4.02/1.81 % (3996976)Termination reason: Refutation not found, incomplete strategy
% 4.02/1.81 % (3996976)Time elapsed: 0.011 s
% 4.02/1.81 % (3996976)Peak memory usage: 88 MB
% 4.02/1.81 % (3996976)Instructions burned: 10 (million)
% 4.02/1.81 % (3996978)First to succeed.
% 4.02/1.81 % (3996978)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3996968"
% 4.02/1.81 % (3996977)Instruction limit reached!
% 4.02/1.81 % (3996977)------------------------------
% 4.02/1.81 % (3996977)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.02/1.81 % (3996977)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.02/1.81 % (3996977)CaDiCaL version: 2.1.3
% 4.02/1.81 % (3996977)Termination reason: Instruction limit
% 4.02/1.81 % (3996977)Termination phase: Saturation
% 4.02/1.81 % (3996977)Time elapsed: 0.109 s
% 4.02/1.81 % (3996977)Peak memory usage: 89 MB
% 4.02/1.81 % (3996977)Instructions burned: 120 (million)
% 4.02/1.81 % (3996985)lrs+10_1_sil=8000:sp=occurrence:random_seed=2035915191:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 4.02/1.81 % (3996973)Aborted by signal SIGSEGV on /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.02/1.81 % (3996973)------------------------------
% 4.02/1.81 % (3996973)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.02/1.81 % (3996973)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.02/1.81 % (3996973)CaDiCaL version: 2.1.3
% 4.02/1.81 % (3996973)Termination reason: Unknown
% 4.02/1.81 % (3996973)Termination phase: Saturation
% 4.02/1.81 % (3996973)Time elapsed: 0.324 s
% 4.02/1.81 % (3996973)Peak memory usage: 113 MB
% 4.02/1.81 % (3996973)Instructions burned: 544 (million)
% 4.02/1.81 % (3996990)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1347699438:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/157Mi)
% 4.02/1.81 % (3996976)------------------------------
% 4.02/1.81 % (3996976)------------------------------
% 4.02/1.81 % (3996985)Instruction limit reached!
% 4.02/1.81 % (3996985)------------------------------
% 4.02/1.81 % (3996985)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.02/1.81 % (3996985)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.02/1.81 % (3996985)CaDiCaL version: 2.1.3
% 4.02/1.81 % (3996985)Termination reason: Instruction limit
% 4.02/1.81 % (3996985)Termination phase: Saturation
% 4.02/1.81 % (3996985)Time elapsed: 0.234 s
% 4.02/1.81 % (3996985)Peak memory usage: 91 MB
% 4.02/1.81 % (3996985)Instructions burned: 285 (million)
% 4.02/1.81 % (3996992)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2312501704:i=325:sd=1:ss=axioms:sgt=32_2994 on theBenchmark for (2994ds/325Mi)
% 4.02/1.81 % (3996978)Refutation found. Thanks to Tanya!
% 4.02/1.81 % SZS status Theorem for theBenchmark
% 4.02/1.81 % SZS output start Proof for theBenchmark
% See solution above
% 6.18/2.09 % (3996978)------------------------------
% 6.18/2.09 % (3996978)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.18/2.09 % (3996978)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.18/2.09 % (3996978)CaDiCaL version: 2.1.3
% 6.18/2.09 % (3996978)Termination reason: Refutation
% 6.18/2.09 % (3996978)Time elapsed: 0.063 s
% 6.18/2.09 % (3996978)Peak memory usage: 89 MB
% 6.18/2.09 % (3996978)Instructions burned: 62 (million)
% 6.18/2.09 % (3996978)------------------------------
% 6.18/2.09 % (3996978)------------------------------
% 6.18/2.09 % (3996968)Success in time 0.756 s
% 6.18/2.09 % Vampire exiting
%------------------------------------------------------------------------------