%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM926^1 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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 : Wed Sep 30 08:19:02 AM UTC 2026
% Result : Theorem 0.23s 0.31s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 49 ( 16 unt; 0 typ; 4 def)
% Number of atoms : 139 ( 57 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 518 ( 34 ~; 28 |; 7 &; 438 @)
% ( 7 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 36 ( 33 usr; 17 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 16 !; 18 ?; 34 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
int: $tType ).
thf(type_def_6,type,
nat: $tType ).
thf(type_def_7,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
one_one_int: int ).
thf(func_def_1,type,
one_one_nat: nat ).
thf(func_def_2,type,
plus_plus_int: int > int > int ).
thf(func_def_3,type,
plus_plus_nat: nat > nat > nat ).
thf(func_def_4,type,
times_times_int: int > int > int ).
thf(func_def_5,type,
times_times_nat: nat > nat > nat ).
thf(func_def_6,type,
zprime: int > $o ).
thf(func_def_7,type,
bit0: int > int ).
thf(func_def_8,type,
bit1: int > int ).
thf(func_def_9,type,
pls: int ).
thf(func_def_10,type,
number_number_of_int: int > int ).
thf(func_def_11,type,
number_number_of_nat: int > nat ).
thf(func_def_12,type,
ord_less_int: int > int > $o ).
thf(func_def_13,type,
ord_less_nat: nat > nat > $o ).
thf(func_def_14,type,
ord_less_eq_int: int > int > $o ).
thf(func_def_15,type,
ord_less_eq_nat: nat > nat > $o ).
thf(func_def_16,type,
power_power_int: int > nat > int ).
thf(func_def_17,type,
power_power_nat: nat > nat > nat ).
thf(func_def_18,type,
twoSqu1013291560sum2sq: int > $o ).
thf(func_def_19,type,
m: int ).
thf(func_def_20,type,
s: int ).
thf(func_def_21,type,
t: int ).
thf(func_def_25,type,
sK0: int ).
thf(func_def_26,type,
sK1: int ).
thf(func_def_27,type,
sK2: int ).
thf(func_def_28,type,
sK3: int ).
thf(func_def_29,type,
sK4: int ).
thf(func_def_30,type,
vNOT: $o > $o ).
thf(f1,axiom,
ord_less_eq_int @ one_one_int @ t,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_tpos) ).
thf(f2,axiom,
( ( t = one_one_int )
=> ? [X1: int,X0: int] :
( ( plus_plus_int @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
= ( 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_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
thf(f3,axiom,
( ( ord_less_int @ one_one_int @ t )
=> ? [X1: int,X0: int] :
( ( plus_plus_int @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
= ( 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_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
thf(f29,axiom,
! [X1: int,X0: int] :
( ( ( X0 != X1 )
& ( ord_less_eq_int @ X0 @ X1 ) )
<=> ( ord_less_int @ X0 @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_28_zless__le) ).
thf(f124,conjecture,
? [X0: int,X1: int] :
( ( plus_plus_int @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
= ( 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',conj_0) ).
thf(f125,negated_conjecture,
~ ? [X0: int,X1: int] :
( ( plus_plus_int @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
= ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) ),
inference(negated_conjecture,[status(cth)],[f124]) ).
thf(f142,plain,
( ( ord_less_int @ one_one_int @ t )
=> ? [X0: int,X1: int] :
( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f143,plain,
( ( ( ord_less_int @ one_one_int @ t )
= $true )
=> ? [X0: int,X1: int] :
( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ) ),
inference(fool_elimination,[],[f142]) ).
thf(f148,plain,
! [X0: int,X1: int] :
( ( ( X0 != X1 )
& ( ord_less_eq_int @ X1 @ X0 ) )
<=> ( ord_less_int @ X1 @ X0 ) ),
inference(rectify,[],[f29]) ).
thf(f149,plain,
! [X0: int,X1: int] :
( ( ( ( ord_less_eq_int @ X1 @ X0 )
= $true )
& ( X0 != X1 ) )
<=> ( ( ord_less_int @ X1 @ X0 )
= $true ) ),
inference(fool_elimination,[],[f148]) ).
thf(f154,plain,
ord_less_eq_int @ one_one_int @ t,
inference(rectify,[],[f1]) ).
thf(f155,plain,
( ( ord_less_eq_int @ one_one_int @ t )
= $true ),
inference(fool_elimination,[],[f154]) ).
thf(f271,plain,
( ( ( ord_less_int @ one_one_int @ t )
!= $true )
| ? [X0: int,X1: int] :
( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ) ),
inference(ennf_transformation,[],[f143]) ).
thf(f272,plain,
( ( one_one_int != t )
| ? [X1: int,X0: int] :
( ( plus_plus_int @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
= ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) ) ),
inference(ennf_transformation,[],[f2]) ).
thf(f276,plain,
! [X0: int,X1: int] :
( ( plus_plus_int @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
!= ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) ),
inference(ennf_transformation,[],[f125]) ).
thf(f281,plain,
! [X0: int,X1: int] :
( ( ( ( ( ord_less_eq_int @ X1 @ X0 )
= $true )
& ( X0 != X1 ) )
| ( ( ord_less_int @ X1 @ X0 )
!= $true ) )
& ( ( ( ord_less_int @ X1 @ X0 )
= $true )
| ( ( ord_less_eq_int @ X1 @ X0 )
!= $true )
| ( X0 = X1 ) ) ),
inference(nnf_transformation,[],[f149]) ).
thf(f282,plain,
! [X0: int,X1: int] :
( ( ( ( ( ord_less_eq_int @ X1 @ X0 )
= $true )
& ( X0 != X1 ) )
| ( ( ord_less_int @ X1 @ X0 )
!= $true ) )
& ( ( ( ord_less_int @ X1 @ X0 )
= $true )
| ( ( ord_less_eq_int @ X1 @ X0 )
!= $true )
| ( X0 = X1 ) ) ),
inference(flattening,[],[f281]) ).
thf(f306,plain,
( ( one_one_int != t )
| ? [X0: int,X1: int] :
( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ) ),
inference(rectify,[],[f272]) ).
thf(f307,plain,
( ( one_one_int != t )
| ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ sK0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f306]) ).
thf(f326,plain,
( ( ( ord_less_int @ one_one_int @ t )
!= $true )
| ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK4 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ sK3 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4]),skolemize(X0,sK3),skolemize(X1,sK4)],[f271]) ).
thf(f355,plain,
! [X0: int,X1: int] :
( ( ( ord_less_eq_int @ X1 @ X0 )
!= $true )
| ( ( ord_less_int @ X1 @ X0 )
= $true )
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f282]) ).
thf(f402,plain,
( ( one_one_int != t )
| ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ sK0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f307]) ).
thf(f435,plain,
( ( ( ord_less_int @ one_one_int @ t )
!= $true )
| ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK4 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ sK3 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f326]) ).
thf(f438,plain,
( ( ord_less_eq_int @ one_one_int @ t )
= $true ),
inference(cnf_transformation,[],[f155]) ).
thf(f457,plain,
! [X0: int,X1: int] :
( ( plus_plus_int @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
!= ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) ),
inference(cnf_transformation,[],[f276]) ).
thf(f557,definition,
( spl5_1
<=> ( ( ord_less_int @ one_one_int @ t )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition]) ).
thf(f561,definition,
( spl5_2
<=> ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK4 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ sK3 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition]) ).
thf(f563,plain,
( ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK4 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ sK3 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) )
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f561]) ).
thf(f564,plain,
( ~ spl5_1
| spl5_2 ),
inference(avatar_split_clause,[],[f435,f561,f557]) ).
thf(f567,definition,
( spl5_3
<=> ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ sK0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl5_3])],[avatar_definition]) ).
thf(f569,plain,
( ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ sK0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) )
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f567]) ).
thf(f571,definition,
( spl5_4
<=> ( one_one_int = t ) ),
introduced(definition,[new_symbols(definition,[spl5_4])],[avatar_definition]) ).
thf(f574,plain,
( spl5_3
| ~ spl5_4 ),
inference(avatar_split_clause,[],[f402,f571,f567]) ).
thf(f677,plain,
( ( one_one_int = t )
| ( $true != $true )
| ( ( ord_less_int @ one_one_int @ t )
= $true ) ),
inference(constrained_superposition,[],[f355,f438]) ).
thf(f682,plain,
( ( one_one_int = t )
| ( ( ord_less_int @ one_one_int @ t )
= $true ) ),
inference(trivial_inequality_removal,[],[f677]) ).
thf(f689,plain,
( $false
| ~ spl5_3 ),
inference(forward_subsumption_resolution,[],[f569,f457]) ).
thf(f690,plain,
~ spl5_3,
inference(avatar_contradiction_clause,[],[f689]) ).
thf(f691,plain,
( spl5_4
| spl5_1 ),
inference(avatar_split_clause,[],[f682,f557,f571]) ).
thf(f692,plain,
( $false
| ~ spl5_2 ),
inference(forward_subsumption_resolution,[],[f563,f457]) ).
thf(f693,plain,
~ spl5_2,
inference(avatar_contradiction_clause,[],[f692]) ).
cnf(s1,plain,
( ~ spl5_1
| spl5_2 ),
inference(sat_conversion,[],[f564]) ).
cnf(s2,plain,
( spl5_3
| ~ spl5_4 ),
inference(sat_conversion,[],[f574]) ).
cnf(s5,plain,
~ spl5_3,
inference(sat_conversion,[],[f690]) ).
cnf(s6,plain,
( spl5_1
| spl5_4 ),
inference(sat_conversion,[],[f691]) ).
cnf(s7,plain,
~ spl5_2,
inference(sat_conversion,[],[f693]) ).
cnf(s8,plain,
~ spl5_4,
inference(rat,[],[s2,s5]) ).
cnf(s9,plain,
spl5_1,
inference(rat,[],[s6,s8]) ).
cnf(s10,plain,
$false,
inference(rat,[],[s1,s7,s9]) ).
thf(f694,plain,
$false,
inference(avatar_sat_refutation,[],[s10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM926^1 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.18 % Computer : n026.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Tue Sep 29 13:08:27 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.21 Running higher-order theorem proving
% 0.10/0.23 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.23/0.31 % (558039)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.23/0.31 % (558046)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2901009027:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.23/0.31 % (558046)Instruction limit reached!
% 0.23/0.31 % (558046)------------------------------
% 0.23/0.31 % (558046)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.31 % (558046)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.31 % (558046)CaDiCaL version: 2.1.3
% 0.23/0.31 % (558046)Termination reason: Instruction limit
% 0.23/0.31 % (558046)Termination phase: shuffling
% 0.23/0.31 % (558046)Time elapsed: 0.001 s
% 0.23/0.31 % (558046)Peak memory usage: 10 MB
% 0.23/0.31 % (558046)Instructions burned: 7 (million)
% 0.23/0.31 % (558044)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=705049682:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.23/0.31 % (558047)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=1741779067:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.23/0.31 % (558048)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=4128356896:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.23/0.31 % (558045)lrs+10_16_si=on:nwc=1.5:random_seed=2263784896:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.23/0.31 % (558048)Instruction limit reached!
% 0.23/0.31 % (558048)------------------------------
% 0.23/0.31 % (558048)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.31 % (558048)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.31 % (558048)CaDiCaL version: 2.1.3
% 0.23/0.31 % (558048)Termination reason: Instruction limit
% 0.23/0.31 % (558048)Termination phase: Saturation
% 0.23/0.31 % (558048)Time elapsed: 0.011 s
% 0.23/0.31 % (558048)Peak memory usage: 11 MB
% 0.23/0.31 % (558048)Instructions burned: 25 (million)
% 0.23/0.31 % (558056)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=2896049624:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.23/0.31 % (558050)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.23/0.31 % (558050)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.23/0.31 % (558056)Instruction limit reached!
% 0.23/0.31 % (558056)------------------------------
% 0.23/0.31 % (558056)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.31 % (558056)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.31 % (558056)CaDiCaL version: 2.1.3
% 0.23/0.31 % (558056)Termination reason: Instruction limit
% 0.23/0.31 % (558056)Termination phase: Property scanning
% 0.23/0.31 % (558056)Time elapsed: 0.002 s
% 0.23/0.31 % (558056)Peak memory usage: 10 MB
% 0.23/0.31 % (558056)Instructions burned: 5 (million)
% 0.23/0.31 % (558045)Instruction limit reached!
% 0.23/0.31 % (558045)------------------------------
% 0.23/0.31 % (558045)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.31 % (558045)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.31 % (558045)CaDiCaL version: 2.1.3
% 0.23/0.31 % (558045)Termination reason: Instruction limit
% 0.23/0.31 % (558045)Termination phase: Property scanning
% 0.23/0.31 % (558045)Time elapsed: 0.014 s
% 0.23/0.31 % (558045)Peak memory usage: 11 MB
% 0.23/0.31 % (558045)Instructions burned: 18 (million)
% 0.23/0.31 % (558049)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1159801117:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.23/0.31 % (558050)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=3238533426:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.23/0.31 % (558044) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-558039-558044"...
% 0.23/0.31 % (558044)...printing done.
% 0.23/0.31 % (558044)Refutation found. Thanks to Tanya!
% 0.23/0.31 % SZS status Theorem for theBenchmark
% 0.23/0.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.31 % (558044)------------------------------
% 0.23/0.31 % (558044)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.31 % (558044)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.31 % (558044)CaDiCaL version: 2.1.3
% 0.23/0.31 % (558044)Termination reason: Refutation
% 0.23/0.31 % (558044)Time elapsed: 0.026 s
% 0.23/0.31 % (558044)Peak memory usage: 13 MB
% 0.23/0.31 % (558044)Instructions burned: 52 (million)
% 0.23/0.31 % (558039)Success in time 0.073 s
% 0.23/0.31 % Vampire exiting
%------------------------------------------------------------------------------