%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM924^1 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n019.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:37 AM UTC 2026
% Result : Theorem 0.90s 0.36s
% Output : Refutation 0.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 45 ( 45 unt; 0 typ; 0 def)
% Number of atoms : 75 ( 39 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 501 ( 7 ~; 0 |; 0 &; 494 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 30 ( 27 usr; 11 con; 0-2 aty)
% Number of variables : 13 ( 0 ^; 13 !; 0 ?; 13 :)
% 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,
zero_zero_int: int ).
thf(func_def_7,type,
zero_zero_nat: nat ).
thf(func_def_8,type,
zprime: int > $o ).
thf(func_def_9,type,
bit0: int > int ).
thf(func_def_10,type,
bit1: int > int ).
thf(func_def_11,type,
pls: int ).
thf(func_def_12,type,
number_number_of_int: int > int ).
thf(func_def_13,type,
number_number_of_nat: int > nat ).
thf(func_def_14,type,
ord_less_int: int > int > $o ).
thf(func_def_15,type,
ord_less_nat: nat > nat > $o ).
thf(func_def_16,type,
ord_less_eq_int: int > int > $o ).
thf(func_def_17,type,
ord_less_eq_nat: nat > nat > $o ).
thf(func_def_18,type,
power_power_int: int > nat > int ).
thf(func_def_19,type,
power_power_nat: nat > nat > nat ).
thf(func_def_20,type,
twoSqu1013291560sum2sq: int > $o ).
thf(func_def_21,type,
m: int ).
thf(func_def_22,type,
s: int ).
thf(func_def_23,type,
t: int ).
thf(func_def_27,type,
sK0: int ).
thf(func_def_28,type,
vNOT: $o > $o ).
thf(f3,axiom,
ord_less_int @ ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ t ) @ ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ zero_zero_int ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096) ).
thf(f4,axiom,
( ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ 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',fact_3_t) ).
thf(f25,axiom,
! [X0: int] :
( ( number_number_of_int @ X0 )
= X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_24_number__of__is__id) ).
thf(f26,axiom,
! [X0: int,X1: int] :
( ( times_times_int @ X0 @ X1 )
= ( times_times_int @ X1 @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_25_zmult__commute) ).
thf(f66,axiom,
( ( plus_plus_nat @ one_one_nat @ one_one_nat )
= ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_65_nat__1__add__1) ).
thf(f67,axiom,
! [X0: int] :
( ( times_times_int @ pls @ X0 )
= pls ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_66_mult__Pls) ).
thf(f105,axiom,
! [X0: int,X1: int] :
( ( plus_plus_int @ X0 @ X1 )
= ( plus_plus_int @ X1 @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_104_zadd__commute) ).
thf(f106,axiom,
( zero_zero_int
= ( number_number_of_int @ pls ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_105_zero__is__num__zero) ).
thf(f107,conjecture,
ord_less_int @ ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int ) @ zero_zero_int,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(f108,negated_conjecture,
~ ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int ) @ zero_zero_int ),
inference(negated_conjecture,[status(cth)],[f107]) ).
thf(f113,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 ) @ t ) @ ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ zero_zero_int ),
inference(rectify,[],[f3]) ).
thf(f114,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 ) @ t ) @ ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ zero_zero_int ) )
= $true ),
inference(fool_elimination,[],[f113]) ).
thf(f231,plain,
~ ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int ) @ zero_zero_int ),
inference(rectify,[],[f108]) ).
thf(f232,plain,
( ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int ) @ zero_zero_int )
!= $true ),
inference(fool_elimination,[],[f231]) ).
thf(f239,plain,
( ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int ) @ zero_zero_int )
!= $true ),
inference(flattening,[],[f232]) ).
thf(f287,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 ) @ t ) @ ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ zero_zero_int ) )
= $true ),
inference(cnf_transformation,[],[f114]) ).
thf(f288,plain,
( ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ t )
= ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int ) ),
inference(cnf_transformation,[],[f4]) ).
thf(f315,plain,
! [X0: int] :
( ( number_number_of_int @ X0 )
= X0 ),
inference(cnf_transformation,[],[f25]) ).
thf(f316,plain,
! [X0: int,X1: int] :
( ( times_times_int @ X0 @ X1 )
= ( times_times_int @ X1 @ X0 ) ),
inference(cnf_transformation,[],[f26]) ).
thf(f364,plain,
( ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) )
= ( plus_plus_nat @ one_one_nat @ one_one_nat ) ),
inference(cnf_transformation,[],[f66]) ).
thf(f365,plain,
! [X0: int] :
( pls
= ( times_times_int @ pls @ X0 ) ),
inference(cnf_transformation,[],[f67]) ).
thf(f415,plain,
! [X0: int,X1: int] :
( ( plus_plus_int @ X0 @ X1 )
= ( plus_plus_int @ X1 @ X0 ) ),
inference(cnf_transformation,[],[f105]) ).
thf(f416,plain,
( zero_zero_int
= ( number_number_of_int @ pls ) ),
inference(cnf_transformation,[],[f106]) ).
thf(f417,plain,
( ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int ) @ zero_zero_int )
!= $true ),
inference(cnf_transformation,[],[f239]) ).
thf(f493,plain,
( $true
!= ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ s @ ( plus_plus_nat @ one_one_nat @ one_one_nat ) ) @ one_one_int ) @ zero_zero_int ) ),
inference(backward_demodulation,[],[f417,f364]) ).
thf(f495,plain,
zero_zero_int = pls,
inference(backward_demodulation,[],[f416,f315]) ).
thf(f538,plain,
( ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ t )
= ( plus_plus_int @ one_one_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ),
inference(forward_demodulation,[],[f288,f415]) ).
thf(f539,plain,
( $true
= ( ord_less_int @ ( times_times_int @ t @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) ) @ ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ zero_zero_int ) ) ),
inference(forward_demodulation,[],[f287,f316]) ).
thf(f540,plain,
( $true
!= ( ord_less_int @ ( plus_plus_int @ one_one_int @ ( power_power_int @ s @ ( plus_plus_nat @ one_one_nat @ one_one_nat ) ) ) @ zero_zero_int ) ),
inference(forward_demodulation,[],[f493,f415]) ).
thf(f556,plain,
( ( plus_plus_nat @ one_one_nat @ one_one_nat )
= ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ),
inference(backward_demodulation,[],[f364,f495]) ).
thf(f557,plain,
! [X0: int] :
( zero_zero_int
= ( times_times_int @ zero_zero_int @ X0 ) ),
inference(backward_demodulation,[],[f365,f495]) ).
thf(f596,plain,
( ( plus_plus_int @ one_one_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) )
= ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ m ) @ one_one_int ) @ t ) ),
inference(forward_demodulation,[],[f538,f495]) ).
thf(f597,plain,
( $true
= ( ord_less_int @ ( times_times_int @ t @ ( plus_plus_int @ one_one_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) ) ) @ ( times_times_int @ ( plus_plus_int @ one_one_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) ) @ zero_zero_int ) ) ),
inference(forward_demodulation,[],[f539,f415]) ).
thf(f624,plain,
( ( plus_plus_int @ one_one_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) )
= ( times_times_int @ t @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ m ) @ one_one_int ) ) ),
inference(forward_demodulation,[],[f596,f316]) ).
thf(f625,plain,
( $true
= ( ord_less_int @ ( times_times_int @ t @ ( plus_plus_int @ one_one_int @ ( times_times_int @ m @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ) ) @ ( times_times_int @ ( plus_plus_int @ one_one_int @ ( times_times_int @ m @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ) @ zero_zero_int ) ) ),
inference(forward_demodulation,[],[f597,f316]) ).
thf(f643,plain,
( ( plus_plus_int @ one_one_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) )
= ( times_times_int @ t @ ( plus_plus_int @ one_one_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ m ) ) ) ),
inference(forward_demodulation,[],[f624,f415]) ).
thf(f644,plain,
( $true
= ( ord_less_int @ ( times_times_int @ t @ ( plus_plus_int @ one_one_int @ ( times_times_int @ m @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ) @ ( times_times_int @ ( plus_plus_int @ one_one_int @ ( times_times_int @ m @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) @ zero_zero_int ) ) ),
inference(forward_demodulation,[],[f625,f315]) ).
thf(f647,plain,
( ( plus_plus_int @ one_one_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) )
= ( times_times_int @ t @ ( plus_plus_int @ one_one_int @ ( times_times_int @ m @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) ) ) ) ),
inference(forward_demodulation,[],[f643,f316]) ).
thf(f648,plain,
( $true
= ( ord_less_int @ ( times_times_int @ t @ ( plus_plus_int @ one_one_int @ ( times_times_int @ m @ ( bit0 @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) ) ) @ ( times_times_int @ ( plus_plus_int @ one_one_int @ ( times_times_int @ m @ ( bit0 @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) ) @ zero_zero_int ) ) ),
inference(forward_demodulation,[],[f644,f495]) ).
thf(f650,plain,
( ( plus_plus_int @ one_one_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) )
= ( times_times_int @ t @ ( plus_plus_int @ one_one_int @ ( times_times_int @ m @ ( bit0 @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) ) ) ),
inference(forward_demodulation,[],[f647,f315]) ).
thf(f651,plain,
( $true
= ( ord_less_int @ ( times_times_int @ t @ ( plus_plus_int @ one_one_int @ ( times_times_int @ m @ ( bit0 @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) ) ) @ ( times_times_int @ zero_zero_int @ ( plus_plus_int @ one_one_int @ ( times_times_int @ m @ ( bit0 @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) ) ) ) ),
inference(forward_demodulation,[],[f648,f316]) ).
thf(f653,plain,
( ( plus_plus_int @ one_one_int @ ( power_power_int @ s @ ( plus_plus_nat @ one_one_nat @ one_one_nat ) ) )
= ( times_times_int @ t @ ( plus_plus_int @ one_one_int @ ( times_times_int @ m @ ( bit0 @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) ) ) ),
inference(forward_demodulation,[],[f650,f556]) ).
thf(f654,plain,
( $true
= ( ord_less_int @ ( times_times_int @ t @ ( plus_plus_int @ one_one_int @ ( times_times_int @ m @ ( bit0 @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) ) ) @ zero_zero_int ) ),
inference(forward_demodulation,[],[f651,f557]) ).
thf(f656,plain,
( $true
= ( ord_less_int @ ( plus_plus_int @ one_one_int @ ( power_power_int @ s @ ( plus_plus_nat @ one_one_nat @ one_one_nat ) ) ) @ zero_zero_int ) ),
inference(forward_demodulation,[],[f654,f653]) ).
thf(f657,plain,
$false,
inference(forward_subsumption_resolution,[],[f656,f540]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM924^1 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18 % Computer : n019.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 13:05:33 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21 Running first-order model finding
% 0.07/0.21 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.90/0.36 % (727910)Will run a generic schedule for satisfiability detection.
% 0.90/0.36 % (727916)% WARNING: option uhcvi not known.
% 0.90/0.36 % (727916)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=925820682:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.90/0.36 % (727916)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.90/0.36 % (727916)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.90/0.36 % (727915)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=686747502_2999 on theBenchmark for (2999ds/0Mi)
% 0.90/0.36 % (727917)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3784346097:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.90/0.36 % (727918)dis+10_1_sil=32000:sp=arity:random_seed=179566239:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.90/0.36 % (727919)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=466929385:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.90/0.36 % (727920)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2529724258:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.90/0.36 % (727921)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1511489542:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.90/0.36 % (727919)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.90/0.36 % Exception at run slice level
% 0.90/0.36 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.90/0.36 % (727929)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1485432616:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.90/0.36 % Exception at run slice level
% 0.90/0.36 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.90/0.36 % (727918)Instruction limit reached!
% 0.90/0.36 % (727918)------------------------------
% 0.90/0.36 % (727918)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.90/0.36 % (727918)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.90/0.36 % (727918)CaDiCaL version: 2.1.3
% 0.90/0.36 % (727918)Termination reason: Instruction limit
% 0.90/0.36 % (727918)Termination phase: Saturation
% 0.90/0.36 % (727918)Time elapsed: 0.051 s
% 0.90/0.36 % (727918)Peak memory usage: 12 MB
% 0.90/0.36 % (727918)Instructions burned: 104 (million)
% 0.90/0.36 % (727931)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3238925951:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.90/0.36 % (727919)Instruction limit reached!
% 0.90/0.36 % (727919)------------------------------
% 0.90/0.36 % (727919)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.90/0.36 % (727919)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.90/0.36 % (727919)CaDiCaL version: 2.1.3
% 0.90/0.36 % (727919)Termination reason: Instruction limit
% 0.90/0.36 % (727919)Termination phase: Saturation
% 0.90/0.36 % (727919)Time elapsed: 0.058 s
% 0.90/0.36 % (727919)Peak memory usage: 12 MB
% 0.90/0.36 % (727919)Instructions burned: 118 (million)
% 0.90/0.36 % (727920)Instruction limit reached!
% 0.90/0.36 % (727920)------------------------------
% 0.90/0.36 % (727920)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.90/0.36 % (727920)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.90/0.36 % (727920)CaDiCaL version: 2.1.3
% 0.90/0.36 % (727920)Termination reason: Instruction limit
% 0.90/0.36 % (727920)Termination phase: Saturation
% 0.90/0.36 % (727920)Time elapsed: 0.065 s
% 0.90/0.36 % (727920)Peak memory usage: 12 MB
% 0.90/0.36 % (727920)Instructions burned: 133 (million)
% 0.90/0.36 % (727933)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=1997505080:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.90/0.36 % (727933)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.90/0.36 % (727934)ott-21_1_sil=16000:fs=off:random_seed=2795661770:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.90/0.36 % (727921)Instruction limit reached!
% 0.90/0.36 % (727921)------------------------------
% 0.90/0.36 % (727921)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.90/0.36 % (727921)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.90/0.36 % (727921)CaDiCaL version: 2.1.3
% 0.90/0.36 % (727921)Termination reason: Instruction limit
% 0.90/0.36 % (727921)Termination phase: Saturation
% 0.90/0.36 % (727921)Time elapsed: 0.079 s
% 0.90/0.36 % (727921)Peak memory usage: 12 MB
% 0.90/0.36 % (727921)Instructions burned: 161 (million)
% 0.90/0.36 % (727933)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.90/0.36 % (727931) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-727910-727931"...
% 0.90/0.36 % (727935)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2849296816:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 0.90/0.36 % (727931)...printing done.
% 0.90/0.36 % (727931)Refutation found. Thanks to Tanya!
% 0.90/0.36 % SZS status Theorem for theBenchmark
% 0.90/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.90/0.36 % (727931)------------------------------
% 0.90/0.36 % (727931)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.90/0.36 % (727931)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.90/0.36 % (727931)CaDiCaL version: 2.1.3
% 0.90/0.36 % (727931)Termination reason: Refutation
% 0.90/0.36 % (727931)Time elapsed: 0.041 s
% 0.90/0.36 % (727931)Peak memory usage: 12 MB
% 0.90/0.36 % (727931)Instructions burned: 82 (million)
% 0.90/0.36 % (727910)Success in time 0.141 s
% 0.90/0.36 % Vampire exiting
%------------------------------------------------------------------------------