%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM926^3 : 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 : n013.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:39 AM UTC 2026
% Result : Theorem 12.96s 2.24s
% Output : Refutation 12.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 69 ( 27 unt; 0 typ; 4 def)
% Number of atoms : 175 ( 77 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 694 ( 44 ~; 38 |; 7 &; 594 @)
% ( 7 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 113 ( 110 usr; 26 con; 0-4 aty)
% Number of variables : 40 ( 0 sgn 24 !; 16 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
int: $tType ).
thf(type_def_6,type,
nat: $tType ).
thf(type_def_7,type,
real: $tType ).
thf(type_def_8,type,
product_prod_int_int: $tType ).
thf(type_def_9,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
div_mod_int: int > int > int ).
thf(func_def_1,type,
div_mod_nat: nat > nat > nat ).
thf(func_def_2,type,
minus_minus_int: int > int > int ).
thf(func_def_3,type,
minus_minus_nat: nat > nat > nat ).
thf(func_def_4,type,
minus_minus_real: real > real > real ).
thf(func_def_5,type,
one_one_int: int ).
thf(func_def_6,type,
one_one_nat: nat ).
thf(func_def_7,type,
one_one_real: real ).
thf(func_def_8,type,
plus_plus_int: int > int > int ).
thf(func_def_9,type,
plus_plus_nat: nat > nat > nat ).
thf(func_def_10,type,
plus_plus_real: real > real > real ).
thf(func_def_11,type,
times_times_int: int > int > int ).
thf(func_def_12,type,
times_times_nat: nat > nat > nat ).
thf(func_def_13,type,
times_times_real: real > real > real ).
thf(func_def_14,type,
zero_zero_int: int ).
thf(func_def_15,type,
zero_zero_nat: nat ).
thf(func_def_16,type,
zero_zero_real: real ).
thf(func_def_17,type,
multInv: int > int > int ).
thf(func_def_18,type,
d22set: int > int > $o ).
thf(func_def_19,type,
zfact: int > int ).
thf(func_def_20,type,
zcong: int > int > int > $o ).
thf(func_def_21,type,
zprime: int > $o ).
thf(func_def_22,type,
bit0: int > int ).
thf(func_def_23,type,
bit1: int > int ).
thf(func_def_24,type,
min: int ).
thf(func_def_25,type,
pls: int ).
thf(func_def_26,type,
number_number_of_int: int > int ).
thf(func_def_27,type,
number_number_of_nat: int > nat ).
thf(func_def_28,type,
number267125858f_real: int > real ).
thf(func_def_29,type,
ord_less_int: int > int > $o ).
thf(func_def_30,type,
ord_less_nat: nat > nat > $o ).
thf(func_def_31,type,
ord_less_real: real > real > $o ).
thf(func_def_32,type,
ord_less_eq_int: int > int > $o ).
thf(func_def_33,type,
ord_less_eq_nat: nat > nat > $o ).
thf(func_def_34,type,
ord_less_eq_real: real > real > $o ).
thf(func_def_35,type,
power_power_int: int > nat > int ).
thf(func_def_36,type,
power_power_nat: nat > nat > nat ).
thf(func_def_37,type,
power_power_real: real > nat > real ).
thf(func_def_38,type,
product_Pair_int_int: int > int > product_prod_int_int ).
thf(func_def_39,type,
legendre: int > int > int ).
thf(func_def_40,type,
quadRes: int > int > $o ).
thf(func_def_41,type,
sr: int > int > $o ).
thf(func_def_42,type,
standardRes: int > int > int ).
thf(func_def_43,type,
dvd_dvd_int: int > int > $o ).
thf(func_def_44,type,
dvd_dvd_nat: nat > nat > $o ).
thf(func_def_45,type,
dvd_dvd_real: real > real > $o ).
thf(func_def_46,type,
collect_int: ( int > $o ) > int > $o ).
thf(func_def_47,type,
twoSqu919416604sum2sq: int > $o ).
thf(func_def_48,type,
twoSqu2057625106sum2sq: product_prod_int_int > int ).
thf(func_def_49,type,
inv: int > int > int ).
thf(func_def_50,type,
wset: int > int > int > $o ).
thf(func_def_51,type,
member_int: int > ( int > $o ) > $o ).
thf(func_def_52,type,
m: int ).
thf(func_def_53,type,
s1: int ).
thf(func_def_54,type,
s: int ).
thf(func_def_55,type,
t: int ).
thf(func_def_57,type,
vAND: $o > $o > $o ).
thf(func_def_60,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_61,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_62,type,
sP0: int > int > ( int > $o ) > $o ).
thf(func_def_63,type,
sP1: int > int > ( int > $o ) > $o ).
thf(func_def_64,type,
sP2: nat > nat > ( nat > $o ) > $o ).
thf(func_def_65,type,
sK3: int ).
thf(func_def_66,type,
sK4: int ).
thf(func_def_67,type,
sK5: int ).
thf(func_def_68,type,
sK6: int ).
thf(func_def_69,type,
sK7: int ).
thf(func_def_70,type,
sK8: int ).
thf(func_def_71,type,
sK9: int ).
thf(func_def_72,type,
sK10: int > int ).
thf(func_def_73,type,
sK11: int ).
thf(func_def_74,type,
sK12: int > int > int > int ).
thf(func_def_75,type,
sK13: int > int > int ).
thf(func_def_76,type,
sK14: nat > real > real ).
thf(func_def_77,type,
sK15: nat > real > real ).
thf(func_def_78,type,
sK16: nat > nat > nat ).
thf(func_def_79,type,
sK17: nat > nat > ( nat > $o ) > nat ).
thf(func_def_80,type,
sK18: nat > nat > ( nat > $o ) > nat ).
thf(func_def_81,type,
sK19: ( nat > $o ) > nat > nat ).
thf(func_def_82,type,
sK20: int > int ).
thf(func_def_83,type,
sK21: int > int ).
thf(func_def_84,type,
sK22: int > ( int > $o ) > int ).
thf(func_def_85,type,
sK23: int > ( int > $o ) > int ).
thf(func_def_86,type,
sK24: int > int ).
thf(func_def_87,type,
sK25: int > int > int ).
thf(func_def_88,type,
sK26: int > ( int > $o ) > int ).
thf(func_def_89,type,
sK27: int > ( int > $o ) > int ).
thf(func_def_90,type,
sK28: ( int > $o ) > int ).
thf(func_def_91,type,
sK29: int > ( int > $o ) > int ).
thf(func_def_92,type,
sK30: int > ( int > $o ) > int ).
thf(func_def_93,type,
sK31: ( nat > nat ) > nat ).
thf(func_def_94,type,
sK32: ( nat > nat ) > nat ).
thf(func_def_95,type,
sK33: ( nat > $o ) > nat > nat ).
thf(func_def_96,type,
sK34: nat > nat > nat ).
thf(func_def_97,type,
sK35: int > int > int ).
thf(func_def_98,type,
sK36: int > int > ( int > $o ) > int ).
thf(func_def_99,type,
sK37: int > int > ( int > $o ) > int ).
thf(func_def_100,type,
sK38: int > int > ( int > $o ) > int ).
thf(func_def_101,type,
sK39: int > int > ( int > $o ) > int ).
thf(func_def_102,type,
sK40: int > int > int ).
thf(func_def_103,type,
sK41: nat > nat > nat ).
thf(func_def_104,type,
sK42: nat > nat > ( nat > $o ) > nat ).
thf(func_def_105,type,
sK43: nat > nat > ( nat > $o ) > nat ).
thf(func_def_106,type,
vNOT: $o > $o ).
thf(func_def_108,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $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 )
=> ? [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',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 )
=> ? [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',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(f38,axiom,
! [X0: int,X1: int] :
( ( ord_less_int @ X0 @ X1 )
<=> ( ( X0 != X1 )
& ( ord_less_eq_int @ X0 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_37_zless__le) ).
thf(f145,axiom,
! [X0: int] :
( ( number_number_of_int @ X0 )
= X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_144_number__of__is__id) ).
thf(f261,axiom,
( ( number_number_of_int @ ( bit1 @ pls ) )
= one_one_int ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_260_semiring__numeral__1__eq__1) ).
thf(f359,axiom,
pls = zero_zero_int,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_358_Pls__def) ).
thf(f1199,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(f1200,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)],[f1199]) ).
thf(f1201,plain,
ord_less_eq_int @ one_one_int @ t,
inference(rectify,[],[f1]) ).
thf(f1202,plain,
( ( ord_less_eq_int @ one_one_int @ t )
= $true ),
inference(fool_elimination,[],[f1201]) ).
thf(f1203,plain,
( ( ord_less_int @ one_one_int @ t )
=> ? [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(rectify,[],[f3]) ).
thf(f1204,plain,
( ( ( ord_less_int @ one_one_int @ t )
= $true )
=> ? [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(fool_elimination,[],[f1203]) ).
thf(f1215,plain,
! [X0: int,X1: int] :
( ( ord_less_int @ X0 @ X1 )
<=> ( ( X0 != X1 )
& ( ord_less_eq_int @ X0 @ X1 ) ) ),
inference(rectify,[],[f38]) ).
thf(f1216,plain,
! [X0: int,X1: int] :
( ( ( ord_less_int @ X0 @ X1 )
= $true )
<=> ( ( X0 != X1 )
& ( ( ord_less_eq_int @ X0 @ X1 )
= $true ) ) ),
inference(fool_elimination,[],[f1215]) ).
thf(f2809,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 ) )
| ( one_one_int != t ) ),
inference(ennf_transformation,[],[f2]) ).
thf(f2810,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 ) )
| ( ( ord_less_int @ one_one_int @ t )
!= $true ) ),
inference(ennf_transformation,[],[f1204]) ).
thf(f3682,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,[],[f1200]) ).
thf(f3688,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 @ sK3 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ sK4 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) )
| ( one_one_int != t ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4]),skolemize(X0,sK3),skolemize(X1,sK4)],[f2809]) ).
thf(f3689,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 @ sK5 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ sK6 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) )
| ( ( ord_less_int @ one_one_int @ t )
!= $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6]),skolemize(X0,sK5),skolemize(X1,sK6)],[f2810]) ).
thf(f3691,plain,
! [X0: int,X1: int] :
( ( ( ( ord_less_int @ X0 @ X1 )
= $true )
| ( X0 = X1 )
| ( ( ord_less_eq_int @ X0 @ X1 )
!= $true ) )
& ( ( ( X0 != X1 )
& ( ( ord_less_eq_int @ X0 @ X1 )
= $true ) )
| ( ( ord_less_int @ X0 @ X1 )
!= $true ) ) ),
inference(nnf_transformation,[],[f1216]) ).
thf(f3692,plain,
! [X0: int,X1: int] :
( ( ( ( ord_less_int @ X0 @ X1 )
= $true )
| ( X0 = X1 )
| ( ( ord_less_eq_int @ X0 @ X1 )
!= $true ) )
& ( ( ( X0 != X1 )
& ( ( ord_less_eq_int @ X0 @ X1 )
= $true ) )
| ( ( ord_less_int @ X0 @ X1 )
!= $true ) ) ),
inference(flattening,[],[f3691]) ).
thf(f3966,plain,
( ( ord_less_eq_int @ one_one_int @ t )
= $true ),
inference(cnf_transformation,[],[f1202]) ).
thf(f3967,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 @ sK3 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ sK4 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) )
| ( one_one_int != t ) ),
inference(cnf_transformation,[],[f3688]) ).
thf(f3968,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 @ sK5 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ sK6 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) )
| ( ( ord_less_int @ one_one_int @ t )
!= $true ) ),
inference(cnf_transformation,[],[f3689]) ).
thf(f4005,plain,
! [X0: int,X1: int] :
( ( ( ord_less_eq_int @ X0 @ X1 )
!= $true )
| ( X0 = X1 )
| ( ( ord_less_int @ X0 @ X1 )
= $true ) ),
inference(cnf_transformation,[],[f3692]) ).
thf(f4124,plain,
! [X0: int] :
( ( number_number_of_int @ X0 )
= X0 ),
inference(cnf_transformation,[],[f145]) ).
thf(f4256,plain,
( one_one_int
= ( number_number_of_int @ ( bit1 @ pls ) ) ),
inference(cnf_transformation,[],[f261]) ).
thf(f4375,plain,
pls = zero_zero_int,
inference(cnf_transformation,[],[f359]) ).
thf(f5541,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,[],[f3682]) ).
thf(f5544,plain,
( ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK3 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ ( power_power_int @ sK4 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) ) )
| ( one_one_int != t ) ),
inference(definition_unfolding,[],[f3967,f4375,f4375,f4375]) ).
thf(f5545,plain,
( ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK5 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ ( power_power_int @ sK6 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) ) )
| ( ( ord_less_int @ one_one_int @ t )
!= $true ) ),
inference(definition_unfolding,[],[f3968,f4375,f4375,f4375]) ).
thf(f5633,plain,
( one_one_int
= ( number_number_of_int @ ( bit1 @ zero_zero_int ) ) ),
inference(definition_unfolding,[],[f4256,f4375]) ).
thf(f5823,plain,
! [X0: int,X1: int] :
( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ m ) @ one_one_int )
!= ( plus_plus_int @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) ) ),
inference(definition_unfolding,[],[f5541,f4375,f4375,f4375]) ).
thf(f6289,definition,
( spl44_5
<=> ( ( ord_less_int @ one_one_int @ t )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl44_5])],[avatar_definition]) ).
thf(f6291,plain,
( ( ( ord_less_int @ one_one_int @ t )
!= $true )
| spl44_5 ),
inference(avatar_component_clause,[],[f6289]) ).
thf(f6293,definition,
( spl44_6
<=> ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK5 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ ( power_power_int @ sK6 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl44_6])],[avatar_definition]) ).
thf(f6295,plain,
( ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK5 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ ( power_power_int @ sK6 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) ) )
| ~ spl44_6 ),
inference(avatar_component_clause,[],[f6293]) ).
thf(f6296,plain,
( ~ spl44_5
| spl44_6 ),
inference(avatar_split_clause,[],[f5545,f6293,f6289]) ).
thf(f6298,definition,
( spl44_7
<=> ( one_one_int = t ) ),
introduced(definition,[new_symbols(definition,[spl44_7])],[avatar_definition]) ).
thf(f6300,plain,
( ( one_one_int != t )
| spl44_7 ),
inference(avatar_component_clause,[],[f6298]) ).
thf(f6302,definition,
( spl44_8
<=> ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK3 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ ( power_power_int @ sK4 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl44_8])],[avatar_definition]) ).
thf(f6304,plain,
( ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK3 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ ( power_power_int @ sK4 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) ) )
| ~ spl44_8 ),
inference(avatar_component_clause,[],[f6302]) ).
thf(f6305,plain,
( ~ spl44_7
| spl44_8 ),
inference(avatar_split_clause,[],[f5544,f6302,f6298]) ).
thf(f6315,plain,
! [X0: int,X1: int] :
( ( plus_plus_int @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) )
!= ( plus_plus_int @ ( times_times_int @ ( bit0 @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) @ m ) @ one_one_int ) ),
inference(forward_demodulation,[],[f5823,f4124]) ).
thf(f6317,plain,
( one_one_int
= ( bit1 @ zero_zero_int ) ),
inference(forward_demodulation,[],[f5633,f4124]) ).
thf(f6321,plain,
! [X0: int,X1: int] :
( ( plus_plus_int @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ one_one_int ) ) ) @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ one_one_int ) ) ) )
!= ( plus_plus_int @ ( times_times_int @ ( bit0 @ ( bit0 @ one_one_int ) ) @ m ) @ one_one_int ) ),
inference(constrained_superposition,[],[f6315,f6317]) ).
thf(f6436,plain,
( ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ one_one_int ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK5 @ ( number_number_of_nat @ ( bit0 @ one_one_int ) ) ) @ ( power_power_int @ sK6 @ ( number_number_of_nat @ ( bit0 @ one_one_int ) ) ) ) )
| ~ spl44_6 ),
inference(forward_demodulation,[],[f6295,f6317]) ).
thf(f6437,plain,
( ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ one_one_int ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK3 @ ( number_number_of_nat @ ( bit0 @ one_one_int ) ) ) @ ( power_power_int @ sK4 @ ( number_number_of_nat @ ( bit0 @ one_one_int ) ) ) ) )
| ~ spl44_8 ),
inference(forward_demodulation,[],[f6304,f6317]) ).
thf(f6438,plain,
( ( ( plus_plus_int @ ( times_times_int @ ( bit0 @ ( bit0 @ one_one_int ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK5 @ ( number_number_of_nat @ ( bit0 @ one_one_int ) ) ) @ ( power_power_int @ sK6 @ ( number_number_of_nat @ ( bit0 @ one_one_int ) ) ) ) )
| ~ spl44_6 ),
inference(forward_demodulation,[],[f6436,f4124]) ).
thf(f6439,plain,
( ( ( plus_plus_int @ ( times_times_int @ ( bit0 @ ( bit0 @ one_one_int ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK3 @ ( number_number_of_nat @ ( bit0 @ one_one_int ) ) ) @ ( power_power_int @ sK4 @ ( number_number_of_nat @ ( bit0 @ one_one_int ) ) ) ) )
| ~ spl44_8 ),
inference(forward_demodulation,[],[f6437,f4124]) ).
thf(f6440,plain,
( $false
| ~ spl44_6 ),
inference(forward_subsumption_resolution,[],[f6438,f6321]) ).
thf(f6441,plain,
~ spl44_6,
inference(avatar_contradiction_clause,[],[f6440]) ).
thf(f6442,plain,
( $false
| ~ spl44_8 ),
inference(forward_subsumption_resolution,[],[f6439,f6321]) ).
thf(f6443,plain,
~ spl44_8,
inference(avatar_contradiction_clause,[],[f6442]) ).
thf(f9838,plain,
( ( $true != $true )
| ( one_one_int = t )
| ( ( ord_less_int @ one_one_int @ t )
= $true ) ),
inference(constrained_superposition,[],[f4005,f3966]) ).
thf(f9860,plain,
( ( one_one_int = t )
| ( ( ord_less_int @ one_one_int @ t )
= $true ) ),
inference(trivial_inequality_removal,[],[f9838]) ).
thf(f9897,plain,
( ( ( ord_less_int @ one_one_int @ t )
= $true )
| spl44_7 ),
inference(forward_subsumption_resolution,[],[f9860,f6300]) ).
thf(f9898,plain,
( $false
| spl44_5
| spl44_7 ),
inference(forward_subsumption_resolution,[],[f9897,f6291]) ).
thf(f9899,plain,
( spl44_5
| spl44_7 ),
inference(avatar_contradiction_clause,[],[f9898]) ).
cnf(s6,plain,
( ~ spl44_5
| spl44_6 ),
inference(sat_conversion,[],[f6296]) ).
cnf(s7,plain,
( ~ spl44_7
| spl44_8 ),
inference(sat_conversion,[],[f6305]) ).
cnf(s13,plain,
~ spl44_6,
inference(sat_conversion,[],[f6441]) ).
cnf(s14,plain,
~ spl44_8,
inference(sat_conversion,[],[f6443]) ).
cnf(s103,plain,
( spl44_5
| spl44_7 ),
inference(sat_conversion,[],[f9899]) ).
cnf(s109,plain,
~ spl44_7,
inference(rat,[],[s7,s14]) ).
cnf(s110,plain,
spl44_5,
inference(rat,[],[s103,s109]) ).
cnf(s111,plain,
$false,
inference(rat,[],[s6,s13,s110]) ).
thf(f9900,plain,
$false,
inference(avatar_sat_refutation,[],[s111]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM926^3 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 % Computer : n013.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Sep 29 13:05:21 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.21 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.24 Running first-order model finding
% 0.09/0.24 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
% 7.54/1.72 % (2070938)Will run a generic schedule for satisfiability detection.
% 7.54/1.72 % (2070944)% WARNING: option uhcvi not known.
% 7.54/1.72 % (2070944)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2865841441:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 7.54/1.72 % (2070946)dis+10_1_sil=32000:sp=arity:random_seed=438142060:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 7.54/1.72 % (2070945)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1983154757:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 7.54/1.72 % (2070943)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1426861606_2999 on theBenchmark for (2999ds/0Mi)
% 7.54/1.72 % (2070947)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3885323391:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 7.54/1.72 % (2070949)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4169558727:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 7.54/1.72 % (2070948)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2174986620:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 7.54/1.72 % (2070946)Instruction limit reached!
% 7.54/1.72 % (2070946)------------------------------
% 7.54/1.72 % (2070946)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.54/1.72 % (2070946)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.54/1.72 % (2070946)CaDiCaL version: 2.1.3
% 7.54/1.72 % (2070946)Termination reason: Instruction limit
% 7.54/1.72 % (2070946)Termination phase: Property scanning
% 7.54/1.72 % (2070946)Time elapsed: 0.042 s
% 7.54/1.72 % (2070946)Peak memory usage: 11 MB
% 7.54/1.72 % (2070946)Instructions burned: 105 (million)
% 7.54/1.72 % (2070944)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 7.54/1.72 % (2070957)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3298543467:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 7.54/1.72 % (2070948)Instruction limit reached!
% 7.54/1.72 % (2070948)------------------------------
% 7.54/1.72 % (2070948)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.54/1.72 % (2070948)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.54/1.72 % (2070948)CaDiCaL version: 2.1.3
% 7.54/1.72 % (2070948)Termination reason: Instruction limit
% 7.54/1.72 % (2070948)Termination phase: Preprocessing 3
% 7.54/1.72 % (2070948)Time elapsed: 0.060 s
% 7.54/1.72 % (2070948)Peak memory usage: 12 MB
% 7.54/1.72 % (2070948)Instructions burned: 133 (million)
% 7.54/1.72 % (2070949)Instruction limit reached!
% 7.54/1.72 % (2070949)------------------------------
% 7.54/1.72 % (2070949)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.54/1.72 % (2070949)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.54/1.72 % (2070949)CaDiCaL version: 2.1.3
% 7.54/1.72 % (2070949)Termination reason: Instruction limit
% 7.54/1.72 % (2070949)Termination phase: Property scanning
% 7.54/1.72 % (2070949)Time elapsed: 0.066 s
% 7.54/1.72 % (2070949)Peak memory usage: 13 MB
% 7.54/1.72 % (2070949)Instructions burned: 160 (million)
% 7.54/1.72 % (2070959)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2295053909:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 7.54/1.72 % (2070947)Instruction limit reached!
% 7.54/1.72 % (2070947)------------------------------
% 7.54/1.72 % (2070947)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.54/1.72 % (2070947)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.54/1.72 % (2070947)CaDiCaL version: 2.1.3
% 7.54/1.72 % (2070947)Termination reason: Instruction limit
% 7.54/1.72 % (2070947)Termination phase: Preprocessing 1
% 7.54/1.72 % (2070947)Time elapsed: 0.090 s
% 7.54/1.72 % (2070947)Peak memory usage: 12 MB
% 7.54/1.72 % (2070947)Instructions burned: 116 (million)
% 7.54/1.72 % (2070960)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=1753571443:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 7.54/1.72 % (2070944)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 7.54/1.72 % (2070963)ott-21_1_sil=16000:fs=off:random_seed=2859114064:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 7.54/1.72 % (2070960)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 12.96/2.24 % (2070959)Instruction limit reached!
% 12.96/2.24 % (2070959)------------------------------
% 12.96/2.24 % (2070959)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 12.96/2.24 % (2070959)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.96/2.24 % (2070959)CaDiCaL version: 2.1.3
% 12.96/2.24 % (2070959)Termination reason: Instruction limit
% 12.96/2.24 % (2070959)Termination phase: Preprocessing 3
% 12.96/2.24 % (2070959)Time elapsed: 0.072 s
% 12.96/2.24 % (2070959)Peak memory usage: 13 MB
% 12.96/2.24 % (2070959)Instructions burned: 131 (million)
% 12.96/2.24 % Exception at run slice level
% 12.96/2.24 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 12.96/2.24 % (2070965)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2283351572:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 12.96/2.24 % (2070966)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2151685781:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 12.96/2.24 % Exception at run slice level
% 12.96/2.24 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 12.96/2.24 % (2070960)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 12.96/2.24 % (2070969)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3532968963:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 12.96/2.24 % (2070963)Instruction limit reached!
% 12.96/2.24 % (2070963)------------------------------
% 12.96/2.24 % (2070963)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 12.96/2.24 % (2070963)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.96/2.24 % (2070963)CaDiCaL version: 2.1.3
% 12.96/2.24 % (2070963)Termination reason: Instruction limit
% 12.96/2.24 % (2070963)Termination phase: Property scanning
% 12.96/2.24 % (2070963)Time elapsed: 0.143 s
% 12.96/2.24 % (2070963)Peak memory usage: 13 MB
% 12.96/2.24 % (2070963)Instructions burned: 181 (million)
% 12.96/2.24 % (2070971)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3440217841:i=889:ins=1_2996 on theBenchmark for (2996ds/889Mi)
% 12.96/2.24 % Exception at run slice level
% 12.96/2.24 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 12.96/2.24 % (2070973)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=3517208907:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2995 on theBenchmark for (2995ds/692Mi)
% 12.96/2.24 % (2070973)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 12.96/2.24 % (2070960)Instruction limit reached!
% 12.96/2.24 % (2070960)------------------------------
% 12.96/2.24 % (2070960)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 12.96/2.24 % (2070960)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.96/2.24 % (2070960)CaDiCaL version: 2.1.3
% 12.96/2.24 % (2070960)Termination reason: Instruction limit
% 12.96/2.24 % (2070960)Termination phase: Saturation
% 12.96/2.24 % (2070960)Time elapsed: 0.317 s
% 12.96/2.24 % (2070960)Peak memory usage: 17 MB
% 12.96/2.24 % (2070960)Instructions burned: 684 (million)
% 12.96/2.24 % (2070975)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=845594605:i=879:kws=inv_precedence:fsr=off_2994 on theBenchmark for (2994ds/879Mi)
% 12.96/2.24 % Exception at run slice level
% 12.96/2.24 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 12.96/2.24 % (2070975)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 12.96/2.24 % (2070977)fmb+10_1_sil=64000:random_seed=3358101948:i=22061:nm=2:gsp=on_2994 on theBenchmark for (2994ds/22061Mi)
% 12.96/2.24 % (2070965)Instruction limit reached!
% 12.96/2.24 % (2070965)------------------------------
% 12.96/2.24 % (2070965)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 12.96/2.24 % (2070965)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.96/2.24 % (2070965)CaDiCaL version: 2.1.3
% 12.96/2.24 % (2070965)Termination reason: Instruction limit
% 12.96/2.24 % (2070965)Termination phase: Saturation
% 12.96/2.24 % (2070965)Time elapsed: 0.391 s
% 12.96/2.24 % (2070965)Peak memory usage: 15 MB
% 12.96/2.24 % (2070965)Instructions burned: 477 (million)
% 12.96/2.24 % (2070977)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 12.96/2.24 % (2070979)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=3180725795:i=9515:nm=5_2993 on theBenchmark for (2993ds/9515Mi)
% 12.96/2.24 % Exception at run slice level
% 12.96/2.24 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 12.96/2.24 % (2070982)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=3715949096:fmbsr=1.7:i=920_2992 on theBenchmark for (2992ds/920Mi)
% 12.96/2.24 % Exception at run slice level
% 12.96/2.24 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 12.96/2.24 % (2070984)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=2318466902:i=5131_2991 on theBenchmark for (2991ds/5131Mi)
% 12.96/2.24 % (2070984)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 12.96/2.24 % (2070975)Instruction limit reached!
% 12.96/2.24 % (2070975)------------------------------
% 12.96/2.24 % (2070975)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 12.96/2.24 % (2070975)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.96/2.24 % (2070975)CaDiCaL version: 2.1.3
% 12.96/2.24 % (2070975)Termination reason: Instruction limit
% 12.96/2.24 % (2070975)Termination phase: Saturation
% 12.96/2.24 % (2070975)Time elapsed: 0.404 s
% 12.96/2.24 % (2070975)Peak memory usage: 18 MB
% 12.96/2.24 % (2070975)Instructions burned: 880 (million)
% 12.96/2.24 % (2070973)Instruction limit reached!
% 12.96/2.24 % (2070973)------------------------------
% 12.96/2.24 % (2070973)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 12.96/2.24 % (2070973)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.96/2.24 % (2070973)CaDiCaL version: 2.1.3
% 12.96/2.24 % (2070973)Termination reason: Instruction limit
% 12.96/2.24 % (2070973)Termination phase: Saturation
% 12.96/2.24 % (2070973)Time elapsed: 0.503 s
% 12.96/2.24 % (2070973)Peak memory usage: 19 MB
% 12.96/2.24 % (2070973)Instructions burned: 693 (million)
% 12.96/2.24 % (2070986)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=3654031999:i=1472:ins=7:fdi=8:gsp=on_2990 on theBenchmark for (2990ds/1472Mi)
% 12.96/2.24 % Exception at run slice level
% 12.96/2.24 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 12.96/2.24 % (2070987)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=3396055443:i=6324_2990 on theBenchmark for (2990ds/6324Mi)
% 12.96/2.24 % (2070989)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=2775080340:fmbsr=2.30978:i=2174_2990 on theBenchmark for (2990ds/2174Mi)
% 12.96/2.24 % (2070969)Instruction limit reached!
% 12.96/2.24 % (2070969)------------------------------
% 12.96/2.24 % (2070969)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 12.96/2.24 % (2070969)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.96/2.24 % (2070969)CaDiCaL version: 2.1.3
% 12.96/2.24 % (2070969)Termination reason: Instruction limit
% 12.96/2.24 % (2070969)Termination phase: Saturation
% 12.96/2.24 % (2070969)Time elapsed: 0.659 s
% 12.96/2.24 % (2070969)Peak memory usage: 19 MB
% 12.96/2.24 % (2070969)Instructions burned: 1179 (million)
% 12.96/2.24 % (2070992)ott-2_1_sil=16000:newcnf=on:random_seed=3002245353:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2989 on theBenchmark for (2989ds/869Mi)
% 12.96/2.24 % (2070986)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 12.96/2.24 % (2070986)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 12.96/2.24 % (2070992)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 12.96/2.24 % Exception at run slice level
% 12.96/2.24 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 12.96/2.24 % (2070994)ott+10_1_sil=32000:tgt=ground:random_seed=2742440937:i=5114:av=off_2988 on theBenchmark for (2988ds/5114Mi)
% 12.96/2.24 % Exception at run slice level
% 12.96/2.24 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 12.96/2.24 % (2070996)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=3226675477:i=54282_2987 on theBenchmark for (2987ds/54282Mi)
% 12.96/2.24 % (2070992)Instruction limit reached!
% 12.96/2.24 % (2070992)------------------------------
% 12.96/2.24 % (2070992)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 12.96/2.24 % (2070992)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.96/2.24 % (2070992)CaDiCaL version: 2.1.3
% 12.96/2.24 % (2070992)Termination reason: Instruction limit
% 12.96/2.24 % (2070992)Termination phase: Saturation
% 12.96/2.24 % (2070992)Time elapsed: 0.431 s
% 12.96/2.24 % (2070992)Peak memory usage: 20 MB
% 12.96/2.24 % (2070992)Instructions burned: 870 (million)
% 12.96/2.24 % Exception at run slice level
% 12.96/2.24 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 12.96/2.24 % (2070999)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=305247626:i=3512:aac=none_2985 on theBenchmark for (2985ds/3512Mi)
% 12.96/2.24 % (2071000)dis+21_1_sil=32000:sas=cadical:random_seed=24579549:i=3773:amm=off_2985 on theBenchmark for (2985ds/3773Mi)
% 12.96/2.24 % (2070999)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 12.96/2.24 % (2071000) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2070938-2071000"...
% 12.96/2.24 % (2071000)...printing done.
% 12.96/2.24 % (2071000)Refutation found. Thanks to Tanya!
% 12.96/2.24 % SZS status Theorem for theBenchmark
% 12.96/2.24 % SZS output start Proof for theBenchmark
% See solution above
% 12.96/2.24 % (2071000)------------------------------
% 12.96/2.24 % (2071000)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 12.96/2.24 % (2071000)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.96/2.24 % (2071000)CaDiCaL version: 2.1.3
% 12.96/2.24 % (2071000)Termination reason: Refutation
% 12.96/2.24 % (2071000)Time elapsed: 0.471 s
% 12.96/2.24 % (2071000)Peak memory usage: 18 MB
% 12.96/2.24 % (2071000)Instructions burned: 750 (million)
% 12.96/2.24 % (2070938)Success in time 1.989 s
% 12.96/2.24 % Vampire exiting
%------------------------------------------------------------------------------