%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM924^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 : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:19:37 AM UTC 2026
% Result : Theorem 8.30s 1.82s
% Output : Refutation 8.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 52 ( 52 unt; 0 typ; 0 def)
% Number of atoms : 90 ( 46 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 491 ( 10 ~; 0 |; 0 &; 481 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 151 ( 148 usr; 18 con; 0-4 aty)
% Number of variables : 32 ( 0 ^; 32 !; 0 ?; 32 :)
% 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 > $o ).
thf(func_def_63,type,
sP1: int > int > $o ).
thf(func_def_64,type,
sP2: int > int > $o ).
thf(func_def_65,type,
sP3: int > $o ).
thf(func_def_66,type,
sP4: int > int > $o ).
thf(func_def_67,type,
sP5: int > int > $o ).
thf(func_def_68,type,
sP6: real > real > $o ).
thf(func_def_69,type,
sP7: real > real > $o ).
thf(func_def_70,type,
sP8: int > int > $o ).
thf(func_def_71,type,
sP9: int > int > $o ).
thf(func_def_72,type,
sP10: real > real > $o ).
thf(func_def_73,type,
sP11: real > real > $o ).
thf(func_def_74,type,
sP12: int > int > $o ).
thf(func_def_75,type,
sP13: int > int > $o ).
thf(func_def_76,type,
sP14: real > real > real > $o ).
thf(func_def_77,type,
sP15: real > real > real > $o ).
thf(func_def_78,type,
sP16: int > int > int > $o ).
thf(func_def_79,type,
sP17: int > int > int > $o ).
thf(func_def_80,type,
sP18: real > real > real > $o ).
thf(func_def_81,type,
sP19: real > real > real > $o ).
thf(func_def_82,type,
sP20: int > int > int > $o ).
thf(func_def_83,type,
sP21: int > int > int > $o ).
thf(func_def_84,type,
sP22: nat > real > $o ).
thf(func_def_85,type,
sP23: ( nat > nat > $o ) > nat > nat > $o ).
thf(func_def_86,type,
sP24: ( nat > nat > $o ) > nat > nat > $o ).
thf(func_def_87,type,
sP25: nat > nat > $o ).
thf(func_def_88,type,
sP26: nat > nat > ( nat > $o ) > $o ).
thf(func_def_89,type,
sP27: nat > nat > ( nat > $o ) > $o ).
thf(func_def_90,type,
sP28: nat > nat > ( nat > $o ) > $o ).
thf(func_def_91,type,
sP29: nat > nat > ( nat > $o ) > $o ).
thf(func_def_92,type,
sP30: nat > ( nat > $o ) > $o ).
thf(func_def_93,type,
sP31: int > $o > $o ).
thf(func_def_94,type,
sP32: int > $o > $o ).
thf(func_def_95,type,
sP33: int > $o > $o > $o ).
thf(func_def_96,type,
sP34: int > $o > $o ).
thf(func_def_97,type,
sP35: int > $o > $o ).
thf(func_def_98,type,
sP36: int > $o > $o > $o ).
thf(func_def_99,type,
sP37: int > int > $o ).
thf(func_def_100,type,
sP38: int > ( int > $o ) > $o ).
thf(func_def_101,type,
sP39: int > ( int > $o ) > $o ).
thf(func_def_102,type,
sP40: int > ( int > $o ) > $o ).
thf(func_def_103,type,
sP41: int > ( int > $o ) > $o ).
thf(func_def_104,type,
sP42: nat > ( nat > $o ) > $o ).
thf(func_def_105,type,
sP43: int > int > $o ).
thf(func_def_106,type,
sP44: int > int > ( int > $o ) > $o ).
thf(func_def_107,type,
sP45: int > int > ( int > $o ) > $o ).
thf(func_def_108,type,
sP46: int > int > ( int > $o ) > $o ).
thf(func_def_109,type,
sP47: nat > nat > ( nat > $o ) > $o ).
thf(func_def_110,type,
sP48: nat > nat > ( nat > $o ) > $o ).
thf(func_def_111,type,
sK49: int ).
thf(func_def_112,type,
sK50: int ).
thf(func_def_113,type,
sK51: int ).
thf(func_def_114,type,
sK52: int > int ).
thf(func_def_115,type,
sK53: int ).
thf(func_def_116,type,
sK54: int > int > int > int ).
thf(func_def_117,type,
sK55: int > int > int ).
thf(func_def_118,type,
sK56: nat > real > real ).
thf(func_def_119,type,
sK57: nat > real > real ).
thf(func_def_120,type,
sK58: nat > nat > nat ).
thf(func_def_121,type,
sK59: nat > nat > ( nat > $o ) > nat ).
thf(func_def_122,type,
sK60: nat > nat > ( nat > $o ) > nat ).
thf(func_def_123,type,
sK61: nat > ( nat > $o ) > nat ).
thf(func_def_124,type,
sK62: int > int ).
thf(func_def_125,type,
sK63: int > ( int > $o ) > int ).
thf(func_def_126,type,
sK64: int > ( int > $o ) > int ).
thf(func_def_127,type,
sK65: int > int > int ).
thf(func_def_128,type,
sK66: int > int ).
thf(func_def_129,type,
sK67: int > int ).
thf(func_def_130,type,
sK68: int > ( int > $o ) > int ).
thf(func_def_131,type,
sK69: ( int > $o ) > int ).
thf(func_def_132,type,
sK70: int > ( int > $o ) > int ).
thf(func_def_133,type,
sK71: int > ( int > $o ) > int ).
thf(func_def_134,type,
sK72: int > ( int > $o ) > int ).
thf(func_def_135,type,
sK73: ( nat > nat ) > nat ).
thf(func_def_136,type,
sK74: ( nat > nat ) > nat ).
thf(func_def_137,type,
sK75: nat > ( nat > $o ) > nat ).
thf(func_def_138,type,
sK76: nat > nat > nat ).
thf(func_def_139,type,
sK77: int > int > int ).
thf(func_def_140,type,
sK78: int > int > ( int > $o ) > int ).
thf(func_def_141,type,
sK79: int > int > ( int > $o ) > int ).
thf(func_def_142,type,
sK80: int > int > ( int > $o ) > int ).
thf(func_def_143,type,
sK81: int > int > ( int > $o ) > int ).
thf(func_def_144,type,
sK82: int > int > int ).
thf(func_def_145,type,
sK83: nat > nat > nat ).
thf(func_def_146,type,
sK84: nat > nat > ( nat > $o ) > nat ).
thf(func_def_147,type,
sK85: nat > nat > ( nat > $o ) > nat ).
thf(func_def_148,type,
vNOT: $o > $o ).
thf(func_def_150,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $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(f173,axiom,
pls = zero_zero_int,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_172_Pls__def) ).
thf(f286,axiom,
! [X0: int] :
( ( times_times_int @ X0 @ X0 )
= ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_285_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J) ).
thf(f325,axiom,
! [X0: int,X1: int,X2: int] :
( ( times_times_int @ X0 @ ( times_times_int @ X1 @ X2 ) )
= ( times_times_int @ ( times_times_int @ X0 @ X1 ) @ X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_324_comm__semiring__1__class_Onormalizing__semiring__rules_I18_J) ).
thf(f328,axiom,
! [X0: int,X1: int,X2: int] :
( ( times_times_int @ X0 @ ( times_times_int @ X1 @ X2 ) )
= ( times_times_int @ X1 @ ( times_times_int @ X0 @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_327_comm__semiring__1__class_Onormalizing__semiring__rules_I19_J) ).
thf(f331,axiom,
! [X0: int,X1: int] :
( ( times_times_int @ X0 @ X1 )
= ( times_times_int @ X1 @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_330_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J) ).
thf(f334,axiom,
! [X0: int,X1: int] :
( ( plus_plus_int @ X0 @ X1 )
= ( plus_plus_int @ X1 @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_333_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J) ).
thf(f371,axiom,
! [X0: int] :
( ( plus_plus_int @ zero_zero_int @ X0 )
= X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_370_comm__semiring__1__class_Onormalizing__semiring__rules_I5_J) ).
thf(f419,axiom,
! [X0: int,X1: int] :
( ( plus_plus_int @ X0 @ ( times_times_int @ X1 @ X0 ) )
= ( times_times_int @ ( plus_plus_int @ X1 @ one_one_int ) @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_418_comm__semiring__1__class_Onormalizing__semiring__rules_I3_J) ).
thf(f510,axiom,
! [X0: int] :
( ( times_times_int @ zero_zero_int @ X0 )
= zero_zero_int ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_509_mult__zero__left) ).
thf(f1069,axiom,
( ( twoSqu2057625106sum2sq @ ( product_Pair_int_int @ s @ 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_1068__096sum2sq_A_Is_M_A1_J_A_061_A_I4_A_K_Am_A_L_A1_J_A_K_At_096) ).
thf(f1199,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(f1200,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)],[f1199]) ).
thf(f1205,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(f1206,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,[],[f1205]) ).
thf(f2743,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,[],[f1200]) ).
thf(f2744,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,[],[f2743]) ).
thf(f2848,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,[],[f2744]) ).
thf(f4178,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,[],[f1206]) ).
thf(f4179,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(f4406,plain,
zero_zero_int = pls,
inference(cnf_transformation,[],[f173]) ).
thf(f4523,plain,
! [X0: int] :
( ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) )
= ( times_times_int @ X0 @ X0 ) ),
inference(cnf_transformation,[],[f286]) ).
thf(f4571,plain,
! [X2: int,X0: int,X1: int] :
( ( times_times_int @ ( times_times_int @ X0 @ X1 ) @ X2 )
= ( times_times_int @ X0 @ ( times_times_int @ X1 @ X2 ) ) ),
inference(cnf_transformation,[],[f325]) ).
thf(f4574,plain,
! [X2: int,X0: int,X1: int] :
( ( times_times_int @ X0 @ ( times_times_int @ X1 @ X2 ) )
= ( times_times_int @ X1 @ ( times_times_int @ X0 @ X2 ) ) ),
inference(cnf_transformation,[],[f328]) ).
thf(f4577,plain,
! [X0: int,X1: int] :
( ( times_times_int @ X0 @ X1 )
= ( times_times_int @ X1 @ X0 ) ),
inference(cnf_transformation,[],[f331]) ).
thf(f4580,plain,
! [X0: int,X1: int] :
( ( plus_plus_int @ X0 @ X1 )
= ( plus_plus_int @ X1 @ X0 ) ),
inference(cnf_transformation,[],[f334]) ).
thf(f4621,plain,
! [X0: int] :
( ( plus_plus_int @ zero_zero_int @ X0 )
= X0 ),
inference(cnf_transformation,[],[f371]) ).
thf(f4684,plain,
! [X0: int,X1: int] :
( ( plus_plus_int @ X0 @ ( times_times_int @ X1 @ X0 ) )
= ( times_times_int @ ( plus_plus_int @ X1 @ one_one_int ) @ X0 ) ),
inference(cnf_transformation,[],[f419]) ).
thf(f4805,plain,
! [X0: int] :
( zero_zero_int
= ( times_times_int @ zero_zero_int @ X0 ) ),
inference(cnf_transformation,[],[f510]) ).
thf(f5606,plain,
( ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ t )
= ( twoSqu2057625106sum2sq @ ( product_Pair_int_int @ s @ one_one_int ) ) ),
inference(cnf_transformation,[],[f1069]) ).
thf(f5805,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,[],[f2848]) ).
thf(f5809,plain,
( $true
= ( 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 ) @ pls ) ) ),
inference(definition_unfolding,[],[f4178,f4406]) ).
thf(f5884,plain,
! [X0: int] :
( ( plus_plus_int @ pls @ X0 )
= X0 ),
inference(definition_unfolding,[],[f4621,f4406]) ).
thf(f5921,plain,
! [X0: int] :
( pls
= ( times_times_int @ pls @ X0 ) ),
inference(definition_unfolding,[],[f4805,f4406,f4406]) ).
thf(f6126,plain,
( $true
!= ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int ) @ pls ) ),
inference(definition_unfolding,[],[f5805,f4406]) ).
thf(f6728,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,[],[f4179,f4580]) ).
thf(f6729,plain,
( $true
= ( ord_less_int @ ( twoSqu2057625106sum2sq @ ( product_Pair_int_int @ s @ one_one_int ) ) @ ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ pls ) ) ),
inference(forward_demodulation,[],[f5809,f5606]) ).
thf(f6788,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 @ ( times_times_int @ s @ s ) ) ),
inference(forward_demodulation,[],[f6728,f4523]) ).
thf(f6789,plain,
( $true
= ( ord_less_int @ ( twoSqu2057625106sum2sq @ ( product_Pair_int_int @ s @ one_one_int ) ) @ ( plus_plus_int @ pls @ ( times_times_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ pls ) ) ) ),
inference(forward_demodulation,[],[f6729,f4684]) ).
thf(f6832,plain,
( ( twoSqu2057625106sum2sq @ ( product_Pair_int_int @ s @ one_one_int ) )
= ( plus_plus_int @ one_one_int @ ( times_times_int @ s @ s ) ) ),
inference(forward_demodulation,[],[f6788,f5606]) ).
thf(f6833,plain,
( $true
= ( ord_less_int @ ( twoSqu2057625106sum2sq @ ( product_Pair_int_int @ s @ one_one_int ) ) @ ( times_times_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ pls ) ) ),
inference(forward_demodulation,[],[f6789,f5884]) ).
thf(f6851,plain,
( $true
= ( ord_less_int @ ( twoSqu2057625106sum2sq @ ( product_Pair_int_int @ s @ one_one_int ) ) @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( times_times_int @ m @ pls ) ) ) ),
inference(forward_demodulation,[],[f6833,f4571]) ).
thf(f6867,plain,
( $true
= ( ord_less_int @ ( twoSqu2057625106sum2sq @ ( product_Pair_int_int @ s @ one_one_int ) ) @ ( times_times_int @ ( times_times_int @ m @ pls ) @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ) ),
inference(forward_demodulation,[],[f6851,f4577]) ).
thf(f6879,plain,
( $true
= ( ord_less_int @ ( twoSqu2057625106sum2sq @ ( product_Pair_int_int @ s @ one_one_int ) ) @ ( times_times_int @ m @ ( times_times_int @ pls @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ) ) ),
inference(forward_demodulation,[],[f6867,f4571]) ).
thf(f6887,plain,
( $true
= ( ord_less_int @ ( twoSqu2057625106sum2sq @ ( product_Pair_int_int @ s @ one_one_int ) ) @ ( times_times_int @ pls @ ( times_times_int @ m @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ) ) ),
inference(forward_demodulation,[],[f6879,f4574]) ).
thf(f6891,plain,
( $true
= ( ord_less_int @ ( twoSqu2057625106sum2sq @ ( product_Pair_int_int @ s @ one_one_int ) ) @ pls ) ),
inference(forward_demodulation,[],[f6887,f5921]) ).
thf(f7168,plain,
( $true
!= ( ord_less_int @ ( plus_plus_int @ one_one_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) @ pls ) ),
inference(constrained_superposition,[],[f6126,f4580]) ).
thf(f7171,plain,
( $true
!= ( ord_less_int @ ( plus_plus_int @ one_one_int @ ( times_times_int @ s @ s ) ) @ pls ) ),
inference(forward_demodulation,[],[f7168,f4523]) ).
thf(f7173,plain,
( $true
!= ( ord_less_int @ ( twoSqu2057625106sum2sq @ ( product_Pair_int_int @ s @ one_one_int ) ) @ pls ) ),
inference(forward_demodulation,[],[f7171,f6832]) ).
thf(f7175,plain,
$true != $true,
inference(forward_demodulation,[],[f7173,f6891]) ).
thf(f7176,plain,
$false,
inference(trivial_inequality_removal,[],[f7175]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM924^3 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.09 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.25 % Computer : n026.cluster.edu
% 0.12/0.25 % Model : x86_64 x86_64
% 0.12/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.25 % Memory : 8046.5625MB
% 0.12/0.25 % OS : Linux 6.8.0-71-generic
% 0.12/0.25 % CPULimit : 300
% 0.12/0.25 % WCLimit : 300
% 0.12/0.25 % DateTime : Tue Sep 29 13:08:13 UTC 2026
% 0.12/0.25 % CPUTime :
% 0.12/0.25 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.29 Running first-order model finding
% 0.12/0.29 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
% 5.89/1.23 % (557164)Will run a generic schedule for satisfiability detection.
% 5.89/1.23 % (557191)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4034098199:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 5.89/1.23 % (557188)% WARNING: option uhcvi not known.
% 5.89/1.23 % (557187)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4001346086_2999 on theBenchmark for (2999ds/0Mi)
% 5.89/1.23 % (557188)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2575106167:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 5.89/1.23 % (557189)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3825111087:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 5.89/1.23 % (557192)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1612154607:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 5.89/1.23 % (557190)dis+10_1_sil=32000:sp=arity:random_seed=3667894088:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 5.89/1.23 % (557193)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2895347449:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 5.89/1.23 % (557191)Instruction limit reached!
% 5.89/1.23 % (557191)------------------------------
% 5.89/1.23 % (557191)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.89/1.23 % (557191)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.89/1.23 % (557191)CaDiCaL version: 2.1.3
% 5.89/1.23 % (557191)Termination reason: Instruction limit
% 5.89/1.23 % (557191)Termination phase: Preprocessing 1
% 5.89/1.23 % (557191)Time elapsed: 0.026 s
% 5.89/1.23 % (557191)Peak memory usage: 12 MB
% 5.89/1.23 % (557191)Instructions burned: 118 (million)
% 5.89/1.23 % (557217)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2019367185:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 5.89/1.23 % (557190)Instruction limit reached!
% 5.89/1.23 % (557190)------------------------------
% 5.89/1.23 % (557190)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.89/1.23 % (557190)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.89/1.23 % (557190)CaDiCaL version: 2.1.3
% 5.89/1.23 % (557190)Termination reason: Instruction limit
% 5.89/1.23 % (557190)Termination phase: Property scanning
% 5.89/1.23 % (557190)Time elapsed: 0.044 s
% 5.89/1.23 % (557190)Peak memory usage: 11 MB
% 5.89/1.23 % (557190)Instructions burned: 111 (million)
% 5.89/1.23 % (557188)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 5.89/1.23 % (557192)Instruction limit reached!
% 5.89/1.23 % (557192)------------------------------
% 5.89/1.23 % (557192)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.89/1.23 % (557192)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.89/1.23 % (557192)CaDiCaL version: 2.1.3
% 5.89/1.23 % (557192)Termination reason: Instruction limit
% 5.89/1.23 % (557192)Termination phase: Preprocessing 3
% 5.89/1.23 % (557192)Time elapsed: 0.054 s
% 5.89/1.23 % (557192)Peak memory usage: 12 MB
% 5.89/1.23 % (557192)Instructions burned: 131 (million)
% 5.89/1.23 % (557224)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2112491188:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 5.89/1.23 % (557193)Instruction limit reached!
% 5.89/1.23 % (557193)------------------------------
% 5.89/1.24 % (557193)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.89/1.24 % (557193)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.89/1.24 % (557193)CaDiCaL version: 2.1.3
% 5.89/1.24 % (557193)Termination reason: Instruction limit
% 5.89/1.24 % (557193)Termination phase: Property scanning
% 5.89/1.24 % (557193)Time elapsed: 0.066 s
% 5.89/1.24 % (557193)Peak memory usage: 13 MB
% 5.89/1.24 % (557193)Instructions burned: 160 (million)
% 5.89/1.24 % (557228)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=2403606608:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 5.89/1.24 % (557233)ott-21_1_sil=16000:fs=off:random_seed=1697011653:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 5.89/1.24 % Exception at run slice level
% 5.89/1.24 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 5.89/1.24 % (557244)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=473050531:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 8.30/1.82 % Exception at run slice level
% 8.30/1.82 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.30/1.82 % (557188)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 8.30/1.82 % (557224)Instruction limit reached!
% 8.30/1.82 % (557224)------------------------------
% 8.30/1.82 % (557224)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.30/1.82 % (557224)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.30/1.82 % (557224)CaDiCaL version: 2.1.3
% 8.30/1.82 % (557224)Termination reason: Instruction limit
% 8.30/1.82 % (557224)Termination phase: Preprocessing 3
% 8.30/1.82 % (557224)Time elapsed: 0.055 s
% 8.30/1.82 % (557224)Peak memory usage: 13 MB
% 8.30/1.82 % (557224)Instructions burned: 133 (million)
% 8.30/1.82 % (557258)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3572608839:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 8.30/1.82 % (557228)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 8.30/1.82 % (557261)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=645843850:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 8.30/1.82 % (557233)Instruction limit reached!
% 8.30/1.82 % (557233)------------------------------
% 8.30/1.82 % (557233)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.30/1.82 % (557233)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.30/1.82 % (557233)CaDiCaL version: 2.1.3
% 8.30/1.82 % (557233)Termination reason: Instruction limit
% 8.30/1.82 % (557233)Termination phase: Property scanning
% 8.30/1.82 % (557233)Time elapsed: 0.074 s
% 8.30/1.82 % (557233)Peak memory usage: 13 MB
% 8.30/1.82 % (557233)Instructions burned: 181 (million)
% 8.30/1.82 % (557270)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=232804207:i=889:ins=1_2997 on theBenchmark for (2997ds/889Mi)
% 8.30/1.82 % (557228)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 8.30/1.82 % (557244)Instruction limit reached!
% 8.30/1.82 % (557244)------------------------------
% 8.30/1.82 % (557244)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.30/1.82 % (557244)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.30/1.82 % (557244)CaDiCaL version: 2.1.3
% 8.30/1.82 % (557244)Termination reason: Instruction limit
% 8.30/1.82 % (557244)Termination phase: Saturation
% 8.30/1.82 % (557244)Time elapsed: 0.118 s
% 8.30/1.82 % (557244)Peak memory usage: 15 MB
% 8.30/1.82 % (557244)Instructions burned: 478 (million)
% 8.30/1.82 % (557285)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=4167074378:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2996 on theBenchmark for (2996ds/692Mi)
% 8.30/1.82 % Exception at run slice level
% 8.30/1.82 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.30/1.82 % (557285)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 8.30/1.82 % (557294)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=3165797549:i=879:kws=inv_precedence:fsr=off_2996 on theBenchmark for (2996ds/879Mi)
% 8.30/1.82 % Exception at run slice level
% 8.30/1.82 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.30/1.82 % (557294)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 8.30/1.82 % (557313)fmb+10_1_sil=64000:random_seed=1043641223:i=22061:nm=2:gsp=on_2995 on theBenchmark for (2995ds/22061Mi)
% 8.30/1.82 % (557228)Instruction limit reached!
% 8.30/1.82 % (557228)------------------------------
% 8.30/1.82 % (557228)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.30/1.82 % (557228)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.30/1.82 % (557228)CaDiCaL version: 2.1.3
% 8.30/1.82 % (557228)Termination reason: Instruction limit
% 8.30/1.82 % (557228)Termination phase: Saturation
% 8.30/1.82 % (557228)Time elapsed: 0.319 s
% 8.30/1.82 % (557228)Peak memory usage: 17 MB
% 8.30/1.82 % (557228)Instructions burned: 684 (million)
% 8.30/1.82 % (557285)Instruction limit reached!
% 8.30/1.82 % (557285)------------------------------
% 8.30/1.82 % (557285)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.30/1.82 % (557285)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.30/1.82 % (557285)CaDiCaL version: 2.1.3
% 8.30/1.82 % (557285)Termination reason: Instruction limit
% 8.30/1.82 % (557285)Termination phase: Saturation
% 8.30/1.82 % (557285)Time elapsed: 0.173 s
% 8.30/1.82 % (557285)Peak memory usage: 18 MB
% 8.30/1.82 % (557285)Instructions burned: 695 (million)
% 8.30/1.82 % (557346)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=2103171712:i=9515:nm=5_2995 on theBenchmark for (2995ds/9515Mi)
% 8.30/1.82 % (557352)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=27794545:fmbsr=1.7:i=920_2995 on theBenchmark for (2995ds/920Mi)
% 8.30/1.82 % (557313)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 8.30/1.82 % Exception at run slice level
% 8.30/1.82 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.30/1.82 % (557361)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=471545554:i=5131_2994 on theBenchmark for (2994ds/5131Mi)
% 8.30/1.82 % Exception at run slice level
% 8.30/1.82 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.30/1.82 % (557363)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=373735571:i=1472:ins=7:fdi=8:gsp=on_2994 on theBenchmark for (2994ds/1472Mi)
% 8.30/1.82 % (557361)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 8.30/1.82 % Exception at run slice level
% 8.30/1.82 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.30/1.82 % (557363)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 8.30/1.82 % (557363)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 8.30/1.82 % (557365)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=3578245178:i=6324_2993 on theBenchmark for (2993ds/6324Mi)
% 8.30/1.82 % Exception at run slice level
% 8.30/1.82 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.30/1.82 % (557294)Instruction limit reached!
% 8.30/1.82 % (557294)------------------------------
% 8.30/1.82 % (557294)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.30/1.82 % (557294)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.30/1.82 % (557294)CaDiCaL version: 2.1.3
% 8.30/1.82 % (557294)Termination reason: Instruction limit
% 8.30/1.82 % (557294)Termination phase: Saturation
% 8.30/1.82 % (557294)Time elapsed: 0.403 s
% 8.30/1.82 % (557294)Peak memory usage: 18 MB
% 8.30/1.82 % (557294)Instructions burned: 880 (million)
% 8.30/1.82 % (557261)Instruction limit reached!
% 8.30/1.82 % (557261)------------------------------
% 8.30/1.82 % (557261)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.30/1.82 % (557261)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.30/1.82 % (557261)CaDiCaL version: 2.1.3
% 8.30/1.82 % (557261)Termination reason: Instruction limit
% 8.30/1.82 % (557261)Termination phase: Saturation
% 8.30/1.82 % (557261)Time elapsed: 0.539 s
% 8.30/1.82 % (557261)Peak memory usage: 20 MB
% 8.30/1.82 % (557261)Instructions burned: 1180 (million)
% 8.30/1.82 % (557367)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=1713011851:fmbsr=2.30978:i=2174_2992 on theBenchmark for (2992ds/2174Mi)
% 8.30/1.82 % (557368)ott-2_1_sil=16000:newcnf=on:random_seed=414817614:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2992 on theBenchmark for (2992ds/869Mi)
% 8.30/1.82 % (557369)ott+10_1_sil=32000:tgt=ground:random_seed=342138955:i=5114:av=off_2992 on theBenchmark for (2992ds/5114Mi)
% 8.30/1.82 % (557368)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 8.30/1.82 % Exception at run slice level
% 8.30/1.82 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.30/1.82 % (557373)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=1483050612:i=54282_2991 on theBenchmark for (2991ds/54282Mi)
% 8.30/1.82 % (557363)Instruction limit reached!
% 8.30/1.82 % (557363)------------------------------
% 8.30/1.82 % (557363)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.30/1.82 % (557363)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.30/1.82 % (557363)CaDiCaL version: 2.1.3
% 8.30/1.82 % (557363)Termination reason: Instruction limit
% 8.30/1.82 % (557363)Termination phase: Saturation
% 8.30/1.82 % (557363)Time elapsed: 0.359 s
% 8.30/1.82 % (557363)Peak memory usage: 20 MB
% 8.30/1.82 % (557363)Instructions burned: 1472 (million)
% 8.30/1.82 % (557375)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=717637899:i=3512:aac=none_2990 on theBenchmark for (2990ds/3512Mi)
% 8.30/1.82 % (557375)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 8.30/1.82 % Exception at run slice level
% 8.30/1.82 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 8.30/1.82 % (557377)dis+21_1_sil=32000:sas=cadical:random_seed=790281619:i=3773:amm=off_2989 on theBenchmark for (2989ds/3773Mi)
% 8.30/1.82 % (557368)Instruction limit reached!
% 8.30/1.82 % (557368)------------------------------
% 8.30/1.82 % (557368)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.30/1.82 % (557368)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.30/1.82 % (557368)CaDiCaL version: 2.1.3
% 8.30/1.82 % (557368)Termination reason: Instruction limit
% 8.30/1.82 % (557368)Termination phase: Saturation
% 8.30/1.82 % (557368)Time elapsed: 0.389 s
% 8.30/1.82 % (557368)Peak memory usage: 19 MB
% 8.30/1.82 % (557368)Instructions burned: 871 (million)
% 8.30/1.82 % (557379)ott+11_1_sil=16000:gs=on:random_seed=4089469033:s2a=on:i=2251:s2at=3:kws=inv_arity_squared:nm=2:fsr=off:fsd=on_2988 on theBenchmark for (2988ds/2251Mi)
% 8.30/1.82 % (557379)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 8.30/1.82 % (557379) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-557164-557379"...
% 8.30/1.82 % (557379)...printing done.
% 8.30/1.82 % (557379)Refutation found. Thanks to Tanya!
% 8.30/1.82 % SZS status Theorem for theBenchmark
% 8.30/1.82 % SZS output start Proof for theBenchmark
% See solution above
% 8.30/1.82 % (557379)------------------------------
% 8.30/1.82 % (557379)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.30/1.82 % (557379)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.30/1.82 % (557379)CaDiCaL version: 2.1.3
% 8.30/1.82 % (557379)Termination reason: Refutation
% 8.30/1.82 % (557379)Time elapsed: 0.316 s
% 8.30/1.82 % (557379)Peak memory usage: 18 MB
% 8.30/1.82 % (557379)Instructions burned: 685 (million)
% 8.30/1.82 % (557164)Success in time 1.523 s
% 8.30/1.82 % Vampire exiting
%------------------------------------------------------------------------------