%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM926^2 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n006.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:38 AM UTC 2026
% Result : Theorem 2.70s 0.66s
% Output : Refutation 2.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 19
% Syntax : Number of formulae : 112 ( 56 unt; 0 typ; 4 def)
% Number of atoms : 227 ( 121 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 1133 ( 69 ~; 51 |; 7 &; 995 @)
% ( 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 : 66 ( 63 usr; 26 con; 0-3 aty)
% Number of variables : 87 ( 0 sgn 71 !; 16 ?; 87 :)
% 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,
minus_minus_int: int > int > int ).
thf(func_def_1,type,
minus_minus_nat: nat > nat > nat ).
thf(func_def_2,type,
minus_minus_real: real > real > real ).
thf(func_def_3,type,
one_one_int: int ).
thf(func_def_4,type,
one_one_nat: nat ).
thf(func_def_5,type,
one_one_real: real ).
thf(func_def_6,type,
plus_plus_int: int > int > int ).
thf(func_def_7,type,
plus_plus_nat: nat > nat > nat ).
thf(func_def_8,type,
plus_plus_real: real > real > real ).
thf(func_def_9,type,
times_times_int: int > int > int ).
thf(func_def_10,type,
times_times_nat: nat > nat > nat ).
thf(func_def_11,type,
times_times_real: real > real > real ).
thf(func_def_12,type,
zero_zero_int: int ).
thf(func_def_13,type,
zero_zero_nat: nat ).
thf(func_def_14,type,
zero_zero_real: real ).
thf(func_def_15,type,
zcong: int > int > int > $o ).
thf(func_def_16,type,
zprime: int > $o ).
thf(func_def_17,type,
bit0: int > int ).
thf(func_def_18,type,
bit1: int > int ).
thf(func_def_19,type,
min: int ).
thf(func_def_20,type,
pls: int ).
thf(func_def_21,type,
number_number_of_int: int > int ).
thf(func_def_22,type,
number_number_of_nat: int > nat ).
thf(func_def_23,type,
number267125858f_real: int > real ).
thf(func_def_24,type,
ord_less_int: int > int > $o ).
thf(func_def_25,type,
ord_less_nat: nat > nat > $o ).
thf(func_def_26,type,
ord_less_real: real > real > $o ).
thf(func_def_27,type,
ord_less_eq_int: int > int > $o ).
thf(func_def_28,type,
ord_less_eq_nat: nat > nat > $o ).
thf(func_def_29,type,
ord_less_eq_real: real > real > $o ).
thf(func_def_30,type,
power_power_int: int > nat > int ).
thf(func_def_31,type,
power_power_nat: nat > nat > nat ).
thf(func_def_32,type,
power_power_real: real > nat > real ).
thf(func_def_33,type,
product_Pair_int_int: int > int > product_prod_int_int ).
thf(func_def_34,type,
legendre: int > int > int ).
thf(func_def_35,type,
quadRes: int > int > $o ).
thf(func_def_36,type,
dvd_dvd_int: int > int > $o ).
thf(func_def_37,type,
dvd_dvd_nat: nat > nat > $o ).
thf(func_def_38,type,
dvd_dvd_real: real > real > $o ).
thf(func_def_39,type,
twoSqu362149276sum2sq: int > $o ).
thf(func_def_40,type,
twoSqu1078207634sum2sq: product_prod_int_int > int ).
thf(func_def_41,type,
m: int ).
thf(func_def_42,type,
s1: int ).
thf(func_def_43,type,
s: int ).
thf(func_def_44,type,
t: int ).
thf(func_def_48,type,
sK0: int ).
thf(func_def_49,type,
sK1: int ).
thf(func_def_50,type,
sK2: int ).
thf(func_def_51,type,
sK3: int ).
thf(func_def_52,type,
sK4: int ).
thf(func_def_53,type,
sK5: int ).
thf(func_def_54,type,
sK6: int ).
thf(func_def_55,type,
sK7: int > int ).
thf(func_def_56,type,
sK8: int ).
thf(func_def_57,type,
sK9: int > int > int > int ).
thf(func_def_58,type,
sK10: int > int > int ).
thf(func_def_59,type,
sK11: nat > real > real ).
thf(func_def_60,type,
vNOT: $o > $o ).
thf(f1,axiom,
ord_less_eq_int @ one_one_int @ t,
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/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(f22,axiom,
! [X0: int] :
( ( times_times_int @ X0 @ X0 )
= ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_21_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J) ).
thf(f38,axiom,
! [X0: int,X1: int] :
( ( ord_less_int @ X0 @ X1 )
<=> ( ( X0 != X1 )
& ( ord_less_eq_int @ X0 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_37_zless__le) ).
thf(f115,axiom,
! [X0: int,X1: int] :
( ( times_times_int @ X0 @ X1 )
= ( times_times_int @ X1 @ X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_114_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J) ).
thf(f133,axiom,
! [X0: int,X1: int] :
( ( plus_plus_int @ X0 @ X1 )
= ( plus_plus_int @ X1 @ X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_132_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J) ).
thf(f143,axiom,
! [X0: int] :
( ( number_number_of_int @ X0 )
= X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_142_number__of__is__id) ).
thf(f189,axiom,
! [X0: int] :
( ( times_times_int @ one_one_int @ X0 )
= X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_188_comm__semiring__1__class_Onormalizing__semiring__rules_I11_J) ).
thf(f201,axiom,
! [X0: int,X1: int] :
( ( times_times_int @ ( bit0 @ X0 ) @ X1 )
= ( bit0 @ ( times_times_int @ X0 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_200_mult__Bit0) ).
thf(f203,axiom,
! [X0: int] :
( ( plus_plus_int @ pls @ X0 )
= X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_202_add__Pls) ).
thf(f250,axiom,
! [X0: int,X1: int] :
( ( plus_plus_int @ ( bit1 @ X0 ) @ ( bit0 @ X1 ) )
= ( bit1 @ ( plus_plus_int @ X0 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_249_add__Bit1__Bit0) ).
thf(f261,axiom,
( ( number_number_of_int @ ( bit1 @ pls ) )
= one_one_int ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_260_semiring__numeral__1__eq__1) ).
thf(f357,axiom,
pls = zero_zero_int,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_356_Pls__def) ).
thf(f699,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/sandbox2/benchmark/theBenchmark.p',conj_0) ).
thf(f700,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)],[f699]) ).
thf(f701,plain,
ord_less_eq_int @ one_one_int @ t,
inference(rectify,[],[f1]) ).
thf(f702,plain,
( ( ord_less_eq_int @ one_one_int @ t )
= $true ),
inference(fool_elimination,[],[f701]) ).
thf(f703,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(f704,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,[],[f703]) ).
thf(f715,plain,
! [X0: int,X1: int] :
( ( ord_less_int @ X0 @ X1 )
<=> ( ( X0 != X1 )
& ( ord_less_eq_int @ X0 @ X1 ) ) ),
inference(rectify,[],[f38]) ).
thf(f716,plain,
! [X0: int,X1: int] :
( ( ( ord_less_int @ X0 @ X1 )
= $true )
<=> ( ( X0 != X1 )
& ( ( ord_less_eq_int @ X0 @ X1 )
= $true ) ) ),
inference(fool_elimination,[],[f715]) ).
thf(f1432,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(f1433,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,[],[f704]) ).
thf(f1777,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,[],[f700]) ).
thf(f1778,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 @ sK0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ sK1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) )
| ( one_one_int != t ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f1432]) ).
thf(f1779,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 @ sK2 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ sK3 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) )
| ( ( ord_less_int @ one_one_int @ t )
!= $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f1433]) ).
thf(f1781,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,[],[f716]) ).
thf(f1782,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,[],[f1781]) ).
thf(f1911,plain,
( ( ord_less_eq_int @ one_one_int @ t )
= $true ),
inference(cnf_transformation,[],[f702]) ).
thf(f1912,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 @ sK0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ sK1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) )
| ( one_one_int != t ) ),
inference(cnf_transformation,[],[f1778]) ).
thf(f1913,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 @ sK2 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ sK3 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) )
| ( ( ord_less_int @ one_one_int @ t )
!= $true ) ),
inference(cnf_transformation,[],[f1779]) ).
thf(f1932,plain,
! [X0: int] :
( ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) )
= ( times_times_int @ X0 @ X0 ) ),
inference(cnf_transformation,[],[f22]) ).
thf(f1950,plain,
! [X0: int,X1: int] :
( ( ( ord_less_eq_int @ X0 @ X1 )
!= $true )
| ( X0 = X1 )
| ( ( ord_less_int @ X0 @ X1 )
= $true ) ),
inference(cnf_transformation,[],[f1782]) ).
thf(f2032,plain,
! [X0: int,X1: int] :
( ( times_times_int @ X1 @ X0 )
= ( times_times_int @ X0 @ X1 ) ),
inference(cnf_transformation,[],[f115]) ).
thf(f2050,plain,
! [X0: int,X1: int] :
( ( plus_plus_int @ X0 @ X1 )
= ( plus_plus_int @ X1 @ X0 ) ),
inference(cnf_transformation,[],[f133]) ).
thf(f2067,plain,
! [X0: int] :
( ( number_number_of_int @ X0 )
= X0 ),
inference(cnf_transformation,[],[f143]) ).
thf(f2127,plain,
! [X0: int] :
( ( times_times_int @ one_one_int @ X0 )
= X0 ),
inference(cnf_transformation,[],[f189]) ).
thf(f2141,plain,
! [X0: int,X1: int] :
( ( times_times_int @ ( bit0 @ X0 ) @ X1 )
= ( bit0 @ ( times_times_int @ X0 @ X1 ) ) ),
inference(cnf_transformation,[],[f201]) ).
thf(f2143,plain,
! [X0: int] :
( ( plus_plus_int @ pls @ X0 )
= X0 ),
inference(cnf_transformation,[],[f203]) ).
thf(f2190,plain,
! [X0: int,X1: int] :
( ( plus_plus_int @ ( bit1 @ X0 ) @ ( bit0 @ X1 ) )
= ( bit1 @ ( plus_plus_int @ X0 @ X1 ) ) ),
inference(cnf_transformation,[],[f250]) ).
thf(f2201,plain,
( one_one_int
= ( number_number_of_int @ ( bit1 @ pls ) ) ),
inference(cnf_transformation,[],[f261]) ).
thf(f2318,plain,
pls = zero_zero_int,
inference(cnf_transformation,[],[f357]) ).
thf(f2761,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,[],[f1777]) ).
thf(f2764,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 @ sK0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ ( power_power_int @ sK1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) ) )
| ( one_one_int != t ) ),
inference(definition_unfolding,[],[f1912,f2318,f2318,f2318]) ).
thf(f2765,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 @ sK2 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ ( power_power_int @ sK3 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) ) )
| ( ( ord_less_int @ one_one_int @ t )
!= $true ) ),
inference(definition_unfolding,[],[f1913,f2318,f2318,f2318]) ).
thf(f2784,plain,
! [X0: int] :
( ( times_times_int @ X0 @ X0 )
= ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) ),
inference(definition_unfolding,[],[f1932,f2318]) ).
thf(f2837,plain,
! [X0: int] :
( ( plus_plus_int @ zero_zero_int @ X0 )
= X0 ),
inference(definition_unfolding,[],[f2143,f2318]) ).
thf(f2855,plain,
( one_one_int
= ( number_number_of_int @ ( bit1 @ zero_zero_int ) ) ),
inference(definition_unfolding,[],[f2201,f2318]) ).
thf(f3014,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,[],[f2761,f2318,f2318,f2318]) ).
thf(f3317,definition,
( spl12_5
<=> ( ( ord_less_int @ one_one_int @ t )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl12_5])],[avatar_definition]) ).
thf(f3321,definition,
( spl12_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 @ sK2 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ ( power_power_int @ sK3 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl12_6])],[avatar_definition]) ).
thf(f3323,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 @ sK2 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ ( power_power_int @ sK3 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) ) )
| ~ spl12_6 ),
inference(avatar_component_clause,[],[f3321]) ).
thf(f3324,plain,
( ~ spl12_5
| spl12_6 ),
inference(avatar_split_clause,[],[f2765,f3321,f3317]) ).
thf(f3326,definition,
( spl12_7
<=> ( one_one_int = t ) ),
introduced(definition,[new_symbols(definition,[spl12_7])],[avatar_definition]) ).
thf(f3330,definition,
( spl12_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 @ sK0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ ( power_power_int @ sK1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl12_8])],[avatar_definition]) ).
thf(f3332,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 @ sK0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ ( power_power_int @ sK1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) ) )
| ~ spl12_8 ),
inference(avatar_component_clause,[],[f3330]) ).
thf(f3333,plain,
( ~ spl12_7
| spl12_8 ),
inference(avatar_split_clause,[],[f2764,f3330,f3326]) ).
thf(f3334,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,[],[f3014,f2067]) ).
thf(f3345,plain,
( one_one_int
= ( bit1 @ zero_zero_int ) ),
inference(forward_demodulation,[],[f2855,f2067]) ).
thf(f3347,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,[],[f3334,f3345]) ).
thf(f3611,plain,
! [X0: int,X1: int] :
( ( times_times_int @ X0 @ ( bit0 @ X1 ) )
= ( bit0 @ ( times_times_int @ X1 @ X0 ) ) ),
inference(constrained_superposition,[],[f2141,f2032]) ).
thf(f3880,plain,
! [X0: int] :
( ( bit1 @ ( plus_plus_int @ zero_zero_int @ X0 ) )
= ( plus_plus_int @ one_one_int @ ( bit0 @ X0 ) ) ),
inference(constrained_superposition,[],[f2190,f3345]) ).
thf(f3888,plain,
! [X0: int] :
( ( bit1 @ X0 )
= ( plus_plus_int @ one_one_int @ ( bit0 @ X0 ) ) ),
inference(forward_demodulation,[],[f3880,f2837]) ).
thf(f4212,plain,
! [X0: int] :
( ( times_times_int @ X0 @ X0 )
= ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ one_one_int ) ) ) ),
inference(forward_demodulation,[],[f2784,f3345]) ).
thf(f4228,plain,
! [X0: int,X1: int] :
( ( plus_plus_int @ ( times_times_int @ ( bit0 @ ( bit0 @ one_one_int ) ) @ m ) @ one_one_int )
!= ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ one_one_int ) ) ) @ ( times_times_int @ X0 @ X0 ) ) ),
inference(constrained_superposition,[],[f3347,f4212]) ).
thf(f4254,plain,
! [X0: int,X1: int] :
( ( plus_plus_int @ one_one_int @ ( times_times_int @ ( bit0 @ ( bit0 @ one_one_int ) ) @ m ) )
!= ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ one_one_int ) ) ) @ ( times_times_int @ X0 @ X0 ) ) ),
inference(forward_demodulation,[],[f4228,f2050]) ).
thf(f4269,plain,
! [X0: int,X1: int] :
( ( plus_plus_int @ one_one_int @ ( times_times_int @ m @ ( bit0 @ ( bit0 @ one_one_int ) ) ) )
!= ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ one_one_int ) ) ) @ ( times_times_int @ X0 @ X0 ) ) ),
inference(forward_demodulation,[],[f4254,f2032]) ).
thf(f4279,plain,
! [X0: int,X1: int] :
( ( plus_plus_int @ one_one_int @ ( bit0 @ ( times_times_int @ ( bit0 @ one_one_int ) @ m ) ) )
!= ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ one_one_int ) ) ) @ ( times_times_int @ X0 @ X0 ) ) ),
inference(forward_demodulation,[],[f4269,f3611]) ).
thf(f4287,plain,
! [X0: int,X1: int] :
( ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ one_one_int ) ) ) @ ( times_times_int @ X0 @ X0 ) )
!= ( bit1 @ ( times_times_int @ ( bit0 @ one_one_int ) @ m ) ) ),
inference(forward_demodulation,[],[f4279,f3888]) ).
thf(f4294,plain,
! [X0: int,X1: int] :
( ( bit1 @ ( times_times_int @ m @ ( bit0 @ one_one_int ) ) )
!= ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ one_one_int ) ) ) @ ( times_times_int @ X0 @ X0 ) ) ),
inference(forward_demodulation,[],[f4287,f2032]) ).
thf(f4299,plain,
! [X0: int,X1: int] :
( ( bit1 @ ( bit0 @ ( times_times_int @ one_one_int @ m ) ) )
!= ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ one_one_int ) ) ) @ ( times_times_int @ X0 @ X0 ) ) ),
inference(forward_demodulation,[],[f4294,f3611]) ).
thf(f4303,plain,
! [X0: int,X1: int] :
( ( bit1 @ ( bit0 @ m ) )
!= ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ one_one_int ) ) ) @ ( times_times_int @ X0 @ X0 ) ) ),
inference(forward_demodulation,[],[f4299,f2127]) ).
thf(f4497,plain,
! [X0: int,X1: int] :
( ( plus_plus_int @ ( times_times_int @ X0 @ X0 ) @ ( times_times_int @ X1 @ X1 ) )
!= ( bit1 @ ( bit0 @ m ) ) ),
inference(constrained_superposition,[],[f4303,f4212]) ).
thf(f6672,plain,
( ( $true != $true )
| ( one_one_int = t )
| ( ( ord_less_int @ one_one_int @ t )
= $true ) ),
inference(constrained_superposition,[],[f1950,f1911]) ).
thf(f6683,plain,
( ( one_one_int = t )
| ( ( ord_less_int @ one_one_int @ t )
= $true ) ),
inference(trivial_inequality_removal,[],[f6672]) ).
thf(f6730,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 @ sK2 @ ( number_number_of_nat @ ( bit0 @ one_one_int ) ) ) @ ( power_power_int @ sK3 @ ( number_number_of_nat @ ( bit0 @ one_one_int ) ) ) ) )
| ~ spl12_6 ),
inference(forward_demodulation,[],[f3323,f3345]) ).
thf(f6731,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 @ sK0 @ ( number_number_of_nat @ ( bit0 @ one_one_int ) ) ) @ ( power_power_int @ sK1 @ ( number_number_of_nat @ ( bit0 @ one_one_int ) ) ) ) )
| ~ spl12_8 ),
inference(forward_demodulation,[],[f3332,f3345]) ).
thf(f6736,plain,
( spl12_5
| spl12_7 ),
inference(avatar_split_clause,[],[f6683,f3326,f3317]) ).
thf(f6738,plain,
( ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ one_one_int ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( times_times_int @ sK2 @ sK2 ) @ ( power_power_int @ sK3 @ ( number_number_of_nat @ ( bit0 @ one_one_int ) ) ) ) )
| ~ spl12_6 ),
inference(forward_demodulation,[],[f6730,f4212]) ).
thf(f6739,plain,
( ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ one_one_int ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( times_times_int @ sK0 @ sK0 ) @ ( power_power_int @ sK1 @ ( number_number_of_nat @ ( bit0 @ one_one_int ) ) ) ) )
| ~ spl12_8 ),
inference(forward_demodulation,[],[f6731,f4212]) ).
thf(f6741,plain,
( ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ one_one_int ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( times_times_int @ sK2 @ sK2 ) @ ( times_times_int @ sK3 @ sK3 ) ) )
| ~ spl12_6 ),
inference(forward_demodulation,[],[f6738,f4212]) ).
thf(f6742,plain,
( ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ one_one_int ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( times_times_int @ sK0 @ sK0 ) @ ( times_times_int @ sK1 @ sK1 ) ) )
| ~ spl12_8 ),
inference(forward_demodulation,[],[f6739,f4212]) ).
thf(f6744,plain,
( ( ( plus_plus_int @ ( times_times_int @ sK2 @ sK2 ) @ ( times_times_int @ sK3 @ sK3 ) )
= ( plus_plus_int @ one_one_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ one_one_int ) ) ) @ m ) ) )
| ~ spl12_6 ),
inference(forward_demodulation,[],[f6741,f2050]) ).
thf(f6745,plain,
( ( ( plus_plus_int @ ( times_times_int @ sK0 @ sK0 ) @ ( times_times_int @ sK1 @ sK1 ) )
= ( plus_plus_int @ one_one_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ one_one_int ) ) ) @ m ) ) )
| ~ spl12_8 ),
inference(forward_demodulation,[],[f6742,f2050]) ).
thf(f6747,plain,
( ( ( plus_plus_int @ ( times_times_int @ sK2 @ sK2 ) @ ( times_times_int @ sK3 @ sK3 ) )
= ( plus_plus_int @ one_one_int @ ( times_times_int @ m @ ( number_number_of_int @ ( bit0 @ ( bit0 @ one_one_int ) ) ) ) ) )
| ~ spl12_6 ),
inference(forward_demodulation,[],[f6744,f2032]) ).
thf(f6748,plain,
( ( ( plus_plus_int @ ( times_times_int @ sK0 @ sK0 ) @ ( times_times_int @ sK1 @ sK1 ) )
= ( plus_plus_int @ one_one_int @ ( times_times_int @ m @ ( number_number_of_int @ ( bit0 @ ( bit0 @ one_one_int ) ) ) ) ) )
| ~ spl12_8 ),
inference(forward_demodulation,[],[f6745,f2032]) ).
thf(f6750,plain,
( ( ( plus_plus_int @ one_one_int @ ( times_times_int @ m @ ( bit0 @ ( bit0 @ one_one_int ) ) ) )
= ( plus_plus_int @ ( times_times_int @ sK2 @ sK2 ) @ ( times_times_int @ sK3 @ sK3 ) ) )
| ~ spl12_6 ),
inference(forward_demodulation,[],[f6747,f2067]) ).
thf(f6751,plain,
( ( ( plus_plus_int @ one_one_int @ ( times_times_int @ m @ ( bit0 @ ( bit0 @ one_one_int ) ) ) )
= ( plus_plus_int @ ( times_times_int @ sK0 @ sK0 ) @ ( times_times_int @ sK1 @ sK1 ) ) )
| ~ spl12_8 ),
inference(forward_demodulation,[],[f6748,f2067]) ).
thf(f6753,plain,
( ( ( plus_plus_int @ one_one_int @ ( bit0 @ ( times_times_int @ ( bit0 @ one_one_int ) @ m ) ) )
= ( plus_plus_int @ ( times_times_int @ sK2 @ sK2 ) @ ( times_times_int @ sK3 @ sK3 ) ) )
| ~ spl12_6 ),
inference(forward_demodulation,[],[f6750,f3611]) ).
thf(f6754,plain,
( ( ( plus_plus_int @ one_one_int @ ( bit0 @ ( times_times_int @ ( bit0 @ one_one_int ) @ m ) ) )
= ( plus_plus_int @ ( times_times_int @ sK0 @ sK0 ) @ ( times_times_int @ sK1 @ sK1 ) ) )
| ~ spl12_8 ),
inference(forward_demodulation,[],[f6751,f3611]) ).
thf(f6756,plain,
( ( ( bit1 @ ( times_times_int @ ( bit0 @ one_one_int ) @ m ) )
= ( plus_plus_int @ ( times_times_int @ sK2 @ sK2 ) @ ( times_times_int @ sK3 @ sK3 ) ) )
| ~ spl12_6 ),
inference(forward_demodulation,[],[f6753,f3888]) ).
thf(f6757,plain,
( ( ( bit1 @ ( times_times_int @ ( bit0 @ one_one_int ) @ m ) )
= ( plus_plus_int @ ( times_times_int @ sK0 @ sK0 ) @ ( times_times_int @ sK1 @ sK1 ) ) )
| ~ spl12_8 ),
inference(forward_demodulation,[],[f6754,f3888]) ).
thf(f6759,plain,
( ( ( bit1 @ ( times_times_int @ m @ ( bit0 @ one_one_int ) ) )
= ( plus_plus_int @ ( times_times_int @ sK2 @ sK2 ) @ ( times_times_int @ sK3 @ sK3 ) ) )
| ~ spl12_6 ),
inference(forward_demodulation,[],[f6756,f2032]) ).
thf(f6760,plain,
( ( ( bit1 @ ( times_times_int @ m @ ( bit0 @ one_one_int ) ) )
= ( plus_plus_int @ ( times_times_int @ sK0 @ sK0 ) @ ( times_times_int @ sK1 @ sK1 ) ) )
| ~ spl12_8 ),
inference(forward_demodulation,[],[f6757,f2032]) ).
thf(f6762,plain,
( ( ( bit1 @ ( bit0 @ ( times_times_int @ one_one_int @ m ) ) )
= ( plus_plus_int @ ( times_times_int @ sK2 @ sK2 ) @ ( times_times_int @ sK3 @ sK3 ) ) )
| ~ spl12_6 ),
inference(forward_demodulation,[],[f6759,f3611]) ).
thf(f6763,plain,
( ( ( bit1 @ ( bit0 @ ( times_times_int @ one_one_int @ m ) ) )
= ( plus_plus_int @ ( times_times_int @ sK0 @ sK0 ) @ ( times_times_int @ sK1 @ sK1 ) ) )
| ~ spl12_8 ),
inference(forward_demodulation,[],[f6760,f3611]) ).
thf(f6765,plain,
( ( ( bit1 @ ( bit0 @ m ) )
= ( plus_plus_int @ ( times_times_int @ sK2 @ sK2 ) @ ( times_times_int @ sK3 @ sK3 ) ) )
| ~ spl12_6 ),
inference(forward_demodulation,[],[f6762,f2127]) ).
thf(f6766,plain,
( ( ( bit1 @ ( bit0 @ m ) )
= ( plus_plus_int @ ( times_times_int @ sK0 @ sK0 ) @ ( times_times_int @ sK1 @ sK1 ) ) )
| ~ spl12_8 ),
inference(forward_demodulation,[],[f6763,f2127]) ).
thf(f6767,plain,
( $false
| ~ spl12_6 ),
inference(forward_subsumption_resolution,[],[f6765,f4497]) ).
thf(f6768,plain,
~ spl12_6,
inference(avatar_contradiction_clause,[],[f6767]) ).
thf(f6769,plain,
( $false
| ~ spl12_8 ),
inference(forward_subsumption_resolution,[],[f6766,f4497]) ).
thf(f6770,plain,
~ spl12_8,
inference(avatar_contradiction_clause,[],[f6769]) ).
cnf(s3,plain,
( ~ spl12_5
| spl12_6 ),
inference(sat_conversion,[],[f3324]) ).
cnf(s4,plain,
( ~ spl12_7
| spl12_8 ),
inference(sat_conversion,[],[f3333]) ).
cnf(s14,plain,
( spl12_5
| spl12_7 ),
inference(sat_conversion,[],[f6736]) ).
cnf(s15,plain,
~ spl12_6,
inference(sat_conversion,[],[f6768]) ).
cnf(s16,plain,
~ spl12_8,
inference(sat_conversion,[],[f6770]) ).
cnf(s17,plain,
~ spl12_7,
inference(rat,[],[s4,s16]) ).
cnf(s18,plain,
spl12_5,
inference(rat,[],[s14,s17]) ).
cnf(s20,plain,
$false,
inference(rat,[],[s3,s15,s18]) ).
thf(f6771,plain,
$false,
inference(avatar_sat_refutation,[],[s20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM926^2 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n006.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 13:05:24 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 Running first-order model finding
% 0.09/0.21 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.70/0.66 % (679242)Will run a generic schedule for satisfiability detection.
% 2.70/0.66 % (679250)dis+10_1_sil=32000:sp=arity:random_seed=3146809030:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.70/0.66 % (679248)% WARNING: option uhcvi not known.
% 2.70/0.66 % (679248)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3668241919:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.70/0.66 % (679247)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3503525285_2999 on theBenchmark for (2999ds/0Mi)
% 2.70/0.66 % (679249)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1349532593:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.70/0.66 % (679251)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2103977791:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.70/0.66 % (679252)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2589119924:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.70/0.66 % (679250)Instruction limit reached!
% 2.70/0.66 % (679250)------------------------------
% 2.70/0.66 % (679250)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.70/0.66 % (679250)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.70/0.66 % (679250)CaDiCaL version: 2.1.3
% 2.70/0.66 % (679250)Termination reason: Instruction limit
% 2.70/0.66 % (679250)Termination phase: Property scanning
% 2.70/0.66 % (679250)Time elapsed: 0.022 s
% 2.70/0.66 % (679250)Peak memory usage: 11 MB
% 2.70/0.66 % (679250)Instructions burned: 103 (million)
% 2.70/0.66 % (679253)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1514785606:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.70/0.66 % (679261)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=228112094:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.70/0.66 % (679248)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.70/0.66 % (679251)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.70/0.66 % Exception at run slice level
% 2.70/0.66 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.70/0.66 % (679251)Instruction limit reached!
% 2.70/0.66 % (679251)------------------------------
% 2.70/0.66 % (679251)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.70/0.66 % (679251)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.70/0.66 % (679251)CaDiCaL version: 2.1.3
% 2.70/0.66 % (679251)Termination reason: Instruction limit
% 2.70/0.66 % (679251)Termination phase: Property scanning
% 2.70/0.66 % (679251)Time elapsed: 0.047 s
% 2.70/0.66 % (679251)Peak memory usage: 11 MB
% 2.70/0.66 % (679251)Instructions burned: 117 (million)
% 2.70/0.66 % Exception at run slice level
% 2.70/0.66 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.70/0.66 % (679248)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 2.70/0.66 % (679265)ott-21_1_sil=16000:fs=off:random_seed=1037734767:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.70/0.66 % (679263)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1190292687:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.70/0.66 % (679264)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=866619332:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.70/0.66 % (679264)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.70/0.66 % (679265)Instruction limit reached!
% 2.70/0.66 % (679265)------------------------------
% 2.70/0.66 % (679265)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.70/0.66 % (679265)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.70/0.66 % (679265)CaDiCaL version: 2.1.3
% 2.70/0.66 % (679265)Termination reason: Instruction limit
% 2.70/0.66 % (679265)Termination phase: Saturation
% 2.70/0.66 % (679265)Time elapsed: 0.039 s
% 2.70/0.66 % (679265)Peak memory usage: 13 MB
% 2.70/0.66 % (679265)Instructions burned: 180 (million)
% 2.70/0.66 % (679252)Instruction limit reached!
% 2.70/0.66 % (679252)------------------------------
% 2.70/0.66 % (679252)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.70/0.66 % (679252)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.70/0.66 % (679252)CaDiCaL version: 2.1.3
% 2.70/0.66 % (679252)Termination reason: Instruction limit
% 2.70/0.66 % (679252)Termination phase: Property scanning
% 2.70/0.66 % (679252)Time elapsed: 0.101 s
% 2.70/0.66 % (679252)Peak memory usage: 11 MB
% 2.70/0.66 % (679252)Instructions burned: 131 (million)
% 2.70/0.66 % (679269)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2826456810:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 2.70/0.66 % (679263)Instruction limit reached!
% 2.70/0.66 % (679263)------------------------------
% 2.70/0.66 % (679263)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.70/0.66 % (679263)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.70/0.66 % (679263)CaDiCaL version: 2.1.3
% 2.70/0.66 % (679263)Termination reason: Instruction limit
% 2.70/0.66 % (679263)Termination phase: Property scanning
% 2.70/0.66 % (679263)Time elapsed: 0.053 s
% 2.70/0.66 % (679263)Peak memory usage: 11 MB
% 2.70/0.66 % (679263)Instructions burned: 131 (million)
% 2.70/0.66 % (679264)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 2.70/0.66 % (679271)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1927912684:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 2.70/0.66 % (679272)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=461186122:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 2.70/0.66 % (679253)Instruction limit reached!
% 2.70/0.66 % (679253)------------------------------
% 2.70/0.66 % (679253)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.70/0.66 % (679253)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.70/0.66 % (679253)CaDiCaL version: 2.1.3
% 2.70/0.66 % (679253)Termination reason: Instruction limit
% 2.70/0.66 % (679253)Termination phase: Saturation
% 2.70/0.66 % (679253)Time elapsed: 0.124 s
% 2.70/0.66 % (679253)Peak memory usage: 13 MB
% 2.70/0.66 % (679253)Instructions burned: 159 (million)
% 2.70/0.66 % (679275)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3723740049:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 2.70/0.66 % Exception at run slice level
% 2.70/0.66 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.70/0.66 % (679277)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=4012949660:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2997 on theBenchmark for (2997ds/692Mi)
% 2.70/0.66 % (679269)Instruction limit reached!
% 2.70/0.66 % (679269)------------------------------
% 2.70/0.66 % (679269)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.70/0.66 % (679269)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.70/0.66 % (679269)CaDiCaL version: 2.1.3
% 2.70/0.66 % (679269)Termination reason: Instruction limit
% 2.70/0.66 % (679269)Termination phase: Saturation
% 2.70/0.66 % (679269)Time elapsed: 0.130 s
% 2.70/0.66 % (679269)Peak memory usage: 14 MB
% 2.70/0.66 % (679269)Instructions burned: 479 (million)
% 2.70/0.66 % (679279)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=3443953817:i=879:kws=inv_precedence:fsr=off_2996 on theBenchmark for (2996ds/879Mi)
% 2.70/0.66 % (679279)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.70/0.66 % Exception at run slice level
% 2.70/0.66 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.70/0.66 % (679277)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.70/0.66 % (679281)fmb+10_1_sil=64000:random_seed=1805911020:i=22061:nm=2:gsp=on_2996 on theBenchmark for (2996ds/22061Mi)
% 2.70/0.66 % (679264) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-679242-679264"...
% 2.70/0.66 % (679264)...printing done.
% 2.70/0.66 % (679264)Refutation found. Thanks to Tanya!
% 2.70/0.66 % SZS status Theorem for theBenchmark
% 2.70/0.66 % SZS output start Proof for theBenchmark
% See solution above
% 2.70/0.66 % (679264)------------------------------
% 2.70/0.66 % (679264)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.70/0.66 % (679264)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.70/0.66 % (679264)CaDiCaL version: 2.1.3
% 2.70/0.66 % (679264)Termination reason: Refutation
% 2.70/0.66 % (679264)Time elapsed: 0.306 s
% 2.70/0.66 % (679264)Peak memory usage: 16 MB
% 2.70/0.66 % (679264)Instructions burned: 666 (million)
% 2.70/0.66 % (679242)Success in time 0.44 s
% 2.70/0.66 % Vampire exiting
%------------------------------------------------------------------------------