%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUN018_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 : 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 12:26:35 PM UTC 2026
% Result : ContradictoryAxioms 2.98s 1.32s
% Output : Refutation 3.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 15
% Syntax : Number of formulae : 61 ( 29 unt; 0 typ; 2 def)
% Number of atoms : 143 ( 49 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 158 ( 76 ~; 64 |; 10 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 22 ( 20 usr; 3 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 7 con; 0-4 aty)
% Number of variables : 23 ( 0 sgn 23 !; 0 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
int: $tType ).
tff(type_def_7,type,
nat: $tType ).
tff(type_def_8,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
plus_plus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_1,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_2,type,
bit0: int > int ).
tff(func_def_3,type,
bit1: int > int ).
tff(func_def_4,type,
pls: int ).
tff(func_def_5,type,
number_number_of:
!>[X0: $tType] : ( int > X0 ) ).
tff(func_def_6,type,
power_power:
!>[X0: $tType] : ( ( X0 * nat ) > X0 ) ).
tff(func_def_7,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_8,type,
fFalse: bool ).
tff(func_def_9,type,
fTrue: bool ).
tff(func_def_10,type,
n: nat ).
tff(func_def_11,type,
tn: nat ).
tff(func_def_12,type,
v: int ).
tff(func_def_13,type,
w: int ).
tff(pred_def_1,type,
number:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
power:
!>[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,
mult_zero:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
zero_neq_one:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
number_semiring:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
no_zero_divisors:
!>[X0: $tType] : $o ).
tff(pred_def_12,type,
linordered_semidom:
!>[X0: $tType] : $o ).
tff(pred_def_13,type,
cancel_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_14,type,
ring_11004092258visors:
!>[X0: $tType] : $o ).
tff(pred_def_15,type,
linord219039673up_add:
!>[X0: $tType] : $o ).
tff(pred_def_16,type,
ordere236663937imp_le:
!>[X0: $tType] : $o ).
tff(pred_def_17,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_18,type,
pp: bool > $o ).
tff(f1,axiom,
w != zero_zero(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0__096w_A_126_061_A0_096) ).
tff(f3,axiom,
! [X0: $tType] :
( semiring_1(X0)
=> ( power_power(X0,zero_zero(X0),number_number_of(nat,bit0(bit1(pls)))) = zero_zero(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2_zero__power2) ).
tff(f28,axiom,
~ ord_less(int,pls,pls),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_27_rel__simps_I2_J) ).
tff(f38,axiom,
pls = zero_zero(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_37_Pls__def) ).
tff(f48,axiom,
! [X0: $tType] :
( ( power(X0)
& mult_zero(X0)
& no_zero_divisors(X0)
& zero_neq_one(X0) )
=> ! [X1: nat,X2: X0] :
( ( power_power(X0,X2,X1) = zero_zero(X0) )
<=> ( ( X2 = zero_zero(X0) )
& ( X1 != zero_zero(nat) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_47_power__eq__0__iff) ).
tff(f51,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))))) = zero_zero(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_50_calculation_I1_J) ).
tff(f63,axiom,
( ( v != zero_zero(int) )
=> ord_less(int,zero_zero(int),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)))))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_62_calculation_I2_J) ).
tff(f74,axiom,
! [X0: int] : ( plus_plus(int,pls,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_73_add__Pls) ).
tff(f103,axiom,
no_zero_divisors(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Rings_Ono__zero__divisors) ).
tff(f106,axiom,
zero_neq_one(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Rings_Ozero__neq__one) ).
tff(f107,axiom,
semiring_1(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Rings_Osemiring__1) ).
tff(f108,axiom,
mult_zero(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Rings_Omult__zero) ).
tff(f111,axiom,
power(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Power_Opower) ).
tff(f133,plain,
! [X0: $tType] :
( ( power_power(X0,zero_zero(X0),number_number_of(nat,bit0(bit1(pls)))) = zero_zero(X0) )
| ~ semiring_1(X0) ),
inference(ennf_transformation,[],[f3]) ).
tff(f151,plain,
! [X0: $tType] :
( ! [X1: nat,X2: X0] :
( ( power_power(X0,X2,X1) = zero_zero(X0) )
<=> ( ( X2 = zero_zero(X0) )
& ( X1 != zero_zero(nat) ) ) )
| ~ power(X0)
| ~ mult_zero(X0)
| ~ no_zero_divisors(X0)
| ~ zero_neq_one(X0) ),
inference(ennf_transformation,[],[f48]) ).
tff(f152,plain,
! [X0: $tType] :
( ! [X1: nat,X2: X0] :
( ( power_power(X0,X2,X1) = zero_zero(X0) )
<=> ( ( X2 = zero_zero(X0) )
& ( X1 != zero_zero(nat) ) ) )
| ~ power(X0)
| ~ mult_zero(X0)
| ~ no_zero_divisors(X0)
| ~ zero_neq_one(X0) ),
inference(flattening,[],[f151]) ).
tff(f157,plain,
( ord_less(int,zero_zero(int),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))))))
| ( zero_zero(int) = v ) ),
inference(ennf_transformation,[],[f63]) ).
tff(f216,plain,
! [X0: $tType] :
( ! [X1: nat,X2: X0] :
( ( ( power_power(X0,X2,X1) = zero_zero(X0) )
| ( zero_zero(X0) != X2 )
| ( zero_zero(nat) = X1 ) )
& ( ( ( X2 = zero_zero(X0) )
& ( X1 != zero_zero(nat) ) )
| ( zero_zero(X0) != power_power(X0,X2,X1) ) ) )
| ~ power(X0)
| ~ mult_zero(X0)
| ~ no_zero_divisors(X0)
| ~ zero_neq_one(X0) ),
inference(nnf_transformation,[],[f152]) ).
tff(f217,plain,
! [X0: $tType] :
( ! [X1: nat,X2: X0] :
( ( ( power_power(X0,X2,X1) = zero_zero(X0) )
| ( zero_zero(X0) != X2 )
| ( zero_zero(nat) = X1 ) )
& ( ( ( X2 = zero_zero(X0) )
& ( X1 != zero_zero(nat) ) )
| ( zero_zero(X0) != power_power(X0,X2,X1) ) ) )
| ~ power(X0)
| ~ mult_zero(X0)
| ~ no_zero_divisors(X0)
| ~ zero_neq_one(X0) ),
inference(flattening,[],[f216]) ).
tff(f239,plain,
w != zero_zero(int),
inference(cnf_transformation,[],[f1]) ).
tff(f242,plain,
! [X0: $tType] :
( ~ semiring_1(X0)
| ( zero_zero(X0) = power_power(X0,zero_zero(X0),number_number_of(nat,bit0(bit1(pls)))) ) ),
inference(cnf_transformation,[],[f133]) ).
tff(f285,plain,
~ ord_less(int,pls,pls),
inference(cnf_transformation,[],[f28]) ).
tff(f304,plain,
zero_zero(int) = pls,
inference(cnf_transformation,[],[f38]) ).
tff(f320,plain,
! [X0: $tType,X2: X0,X1: nat] :
( ( zero_zero(X0) != power_power(X0,X2,X1) )
| ( zero_zero(X0) = X2 )
| ~ power(X0)
| ~ mult_zero(X0)
| ~ no_zero_divisors(X0)
| ~ zero_neq_one(X0) ),
inference(cnf_transformation,[],[f217]) ).
tff(f324,plain,
zero_zero(int) = 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))))),
inference(cnf_transformation,[],[f51]) ).
tff(f340,plain,
( ord_less(int,zero_zero(int),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))))))
| ( zero_zero(int) = v ) ),
inference(cnf_transformation,[],[f157]) ).
tff(f360,plain,
! [X0: int] : ( plus_plus(int,pls,X0) = X0 ),
inference(cnf_transformation,[],[f74]) ).
tff(f404,plain,
no_zero_divisors(int),
inference(cnf_transformation,[],[f103]) ).
tff(f407,plain,
zero_neq_one(int),
inference(cnf_transformation,[],[f106]) ).
tff(f408,plain,
semiring_1(int),
inference(cnf_transformation,[],[f107]) ).
tff(f409,plain,
mult_zero(int),
inference(cnf_transformation,[],[f108]) ).
tff(f412,plain,
power(int),
inference(cnf_transformation,[],[f111]) ).
tff(f462,definition,
( spl0_1
<=> ( zero_zero(int) = v ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
tff(f464,plain,
( ( zero_zero(int) = v )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f462]) ).
tff(f466,definition,
( spl0_2
<=> ord_less(int,zero_zero(int),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)))))) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
tff(f468,plain,
( ord_less(int,zero_zero(int),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))))))
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f466]) ).
tff(f469,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f340,f466,f462]) ).
tff(f628,plain,
zero_zero(int) = power_power(int,zero_zero(int),number_number_of(nat,bit0(bit1(pls)))),
inference(resolution,[],[f242,f408]) ).
tff(f630,plain,
pls = power_power(int,pls,number_number_of(nat,bit0(bit1(pls)))),
inference(forward_demodulation,[],[f628,f304]) ).
tff(f925,plain,
pls = 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))))),
inference(forward_demodulation,[],[f324,f304]) ).
tff(f931,plain,
( ord_less(int,zero_zero(int),pls)
| ~ spl0_2 ),
inference(forward_demodulation,[],[f468,f925]) ).
tff(f932,plain,
( ord_less(int,pls,pls)
| ~ spl0_2 ),
inference(forward_demodulation,[],[f931,f304]) ).
tff(f933,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f932,f285]) ).
tff(f934,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f933]) ).
tff(f935,plain,
( ( pls = v )
| ~ spl0_1 ),
inference(forward_demodulation,[],[f464,f304]) ).
tff(f938,plain,
( ( pls = plus_plus(int,power_power(int,pls,number_number_of(nat,bit0(bit1(pls)))),power_power(int,w,number_number_of(nat,bit0(bit1(pls))))) )
| ~ spl0_1 ),
inference(superposition,[],[f925,f935]) ).
tff(f939,plain,
( ( pls = plus_plus(int,pls,power_power(int,w,number_number_of(nat,bit0(bit1(pls))))) )
| ~ spl0_1 ),
inference(forward_demodulation,[],[f938,f630]) ).
tff(f940,plain,
( ( pls = power_power(int,w,number_number_of(nat,bit0(bit1(pls)))) )
| ~ spl0_1 ),
inference(forward_demodulation,[],[f939,f360]) ).
tff(f950,plain,
( ( zero_zero(int) != pls )
| ( w = zero_zero(int) )
| ~ power(int)
| ~ mult_zero(int)
| ~ no_zero_divisors(int)
| ~ zero_neq_one(int)
| ~ spl0_1 ),
inference(superposition,[],[f320,f940]) ).
tff(f953,plain,
( ( w = zero_zero(int) )
| ~ power(int)
| ~ mult_zero(int)
| ~ no_zero_divisors(int)
| ~ zero_neq_one(int)
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f950,f304]) ).
tff(f957,plain,
( ~ power(int)
| ~ mult_zero(int)
| ~ no_zero_divisors(int)
| ~ zero_neq_one(int)
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f953,f239]) ).
tff(f961,plain,
( ~ mult_zero(int)
| ~ no_zero_divisors(int)
| ~ zero_neq_one(int)
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f957,f412]) ).
tff(f962,plain,
( ~ no_zero_divisors(int)
| ~ zero_neq_one(int)
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f961,f409]) ).
tff(f963,plain,
( ~ zero_neq_one(int)
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f962,f404]) ).
tff(f964,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f963,f407]) ).
tff(f965,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f964]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f469]) ).
cnf(s2,plain,
~ spl0_2,
inference(sat_conversion,[],[f934]) ).
cnf(s4,plain,
~ spl0_1,
inference(sat_conversion,[],[f965]) ).
cnf(s5,plain,
$false,
inference(rat,[],[s1,s2,s4]) ).
tff(f966,plain,
$false,
inference(avatar_sat_refutation,[],[s5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUN018_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.38 % Computer : n004.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 21:50:52 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.98/1.32 % (3911721)Detected formulas, will run a generic FOF schedule.
% 2.98/1.32 % (3911830)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4048747929:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.98/1.32 % (3911830)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.98/1.32 % (3911830)Refutation not found, incomplete strategy
% 2.98/1.32 % (3911830)------------------------------
% 2.98/1.32 % (3911830)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.98/1.32 % (3911830)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.98/1.32 % (3911830)CaDiCaL version: 2.1.3
% 2.98/1.32 % (3911830)Termination reason: Refutation not found, incomplete strategy
% 2.98/1.32 % (3911830)Time elapsed: 0.003 s
% 2.98/1.32 % (3911830)Peak memory usage: 88 MB
% 2.98/1.32 % (3911830)Instructions burned: 5 (million)
% 2.98/1.32 % (3911833)dis-21_1_sil=8000:lcm=predicate:random_seed=3527144049: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.98/1.32 % (3911827)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=130218096:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.98/1.32 % (3911831)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2880679670:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.98/1.32 % (3911829)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=1075268736:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.98/1.32 % (3911828)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=2554853254:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.98/1.32 % (3911832)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1908633120:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.98/1.32 % (3911829)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.98/1.32 % (3911832)First to succeed.
% 2.98/1.32 % (3911832)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3911721"
% 2.98/1.32 % (3911833)Instruction limit reached!
% 2.98/1.32 % (3911833)------------------------------
% 2.98/1.32 % (3911833)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.98/1.32 % (3911833)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.98/1.32 % (3911833)CaDiCaL version: 2.1.3
% 2.98/1.32 % (3911833)Termination reason: Instruction limit
% 2.98/1.32 % (3911833)Termination phase: Saturation
% 2.98/1.32 % (3911833)Time elapsed: 0.078 s
% 2.98/1.32 % (3911833)Peak memory usage: 89 MB
% 2.98/1.32 % (3911833)Instructions burned: 129 (million)
% 2.98/1.32 % (3911831)Instruction limit reached!
% 2.98/1.32 % (3911831)------------------------------
% 2.98/1.32 % (3911831)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.98/1.32 % (3911831)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.98/1.32 % (3911831)CaDiCaL version: 2.1.3
% 2.98/1.32 % (3911831)Termination reason: Instruction limit
% 2.98/1.32 % (3911831)Termination phase: Saturation
% 2.98/1.32 % (3911831)Time elapsed: 0.087 s
% 2.98/1.32 % (3911831)Peak memory usage: 88 MB
% 2.98/1.32 % (3911831)Instructions burned: 119 (million)
% 2.98/1.32 % (3911830)------------------------------
% 2.98/1.32 % (3911830)------------------------------
% 2.98/1.32 % (3911856)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2896969065:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.98/1.32 % (3911854)lrs+10_1_sil=8000:sp=occurrence:random_seed=992798923:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.98/1.32 % (3911832)Refutation found. Thanks to Tanya!
% 2.98/1.32 % SZS status ContradictoryAxioms for theBenchmark
% 2.98/1.32 % SZS output start Proof for theBenchmark
% See solution above
% 3.79/1.52 % (3911832)------------------------------
% 3.79/1.52 % (3911832)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.79/1.52 % (3911832)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.79/1.52 % (3911832)CaDiCaL version: 2.1.3
% 3.79/1.52 % (3911832)Termination reason: Refutation
% 3.79/1.52 % (3911832)Time elapsed: 0.024 s
% 3.79/1.52 % (3911832)Peak memory usage: 90 MB
% 3.79/1.52 % (3911832)Instructions burned: 32 (million)
% 3.79/1.52 % (3911832)------------------------------
% 3.79/1.52 % (3911832)------------------------------
% 3.79/1.52 % (3911721)Success in time 0.456 s
% 3.79/1.52 % Vampire exiting
%------------------------------------------------------------------------------