%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ITP044^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n010.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:10:29 AM UTC 2026
% Result : Theorem 0.20s 0.38s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 21 ( 20 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 69 ( 5 ~; 2 |; 0 &; 61 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Number of types : 10 ( 9 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 173 ( 171 usr; 18 con; 0-4 aty)
% Number of variables : 11 ( 0 ^; 11 !; 0 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
poly_poly_a: $tType ).
thf(type_def_6,type,
list_poly_a: $tType ).
thf(type_def_7,type,
list_list_a: $tType ).
thf(type_def_8,type,
poly_nat: $tType ).
thf(type_def_9,type,
list_nat: $tType ).
thf(type_def_10,type,
poly_a: $tType ).
thf(type_def_11,type,
list_a: $tType ).
thf(type_def_12,type,
nat: $tType ).
thf(type_def_13,type,
a: $tType ).
thf(type_def_14,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
descar226543321ms_nat: list_nat > list_nat ).
thf(func_def_1,type,
descar282223555poly_a: list_poly_a > list_poly_a ).
thf(func_def_2,type,
descar1375166517sums_a: list_a > list_a ).
thf(func_def_3,type,
descar434775507poly_a: poly_a > poly_poly_a > poly_poly_a ).
thf(func_def_4,type,
descar466059845root_a: a > poly_a > poly_a ).
thf(func_def_5,type,
descar357075861poly_a: list_poly_a > nat ).
thf(func_def_6,type,
descar2095969287nges_a: list_a > nat ).
thf(func_def_7,type,
one_one_nat: nat ).
thf(func_def_8,type,
one_one_poly_nat: poly_nat ).
thf(func_def_9,type,
one_one_poly_poly_a: poly_poly_a ).
thf(func_def_10,type,
one_one_poly_a: poly_a ).
thf(func_def_11,type,
one_one_a: a ).
thf(func_def_12,type,
times_times_nat: nat > nat > nat ).
thf(func_def_13,type,
times_times_poly_a: poly_a > poly_a > poly_a ).
thf(func_def_14,type,
times_times_a: a > a > a ).
thf(func_def_15,type,
uminus_uminus_poly_a: poly_a > poly_a ).
thf(func_def_16,type,
uminus_uminus_a: a > a ).
thf(func_def_17,type,
zero_zero_nat: nat ).
thf(func_def_18,type,
zero_zero_poly_nat: poly_nat ).
thf(func_def_19,type,
zero_z2096148049poly_a: poly_poly_a ).
thf(func_def_20,type,
zero_zero_poly_a: poly_a ).
thf(func_def_21,type,
zero_zero_a: a ).
thf(func_def_22,type,
append_nat: list_nat > list_nat > list_nat ).
thf(func_def_23,type,
append_poly_a: list_poly_a > list_poly_a > list_poly_a ).
thf(func_def_24,type,
append_a: list_a > list_a > list_a ).
thf(func_def_25,type,
cons_list_a: list_a > list_list_a > list_list_a ).
thf(func_def_26,type,
cons_nat: nat > list_nat > list_nat ).
thf(func_def_27,type,
cons_poly_a: poly_a > list_poly_a > list_poly_a ).
thf(func_def_28,type,
cons_a: a > list_a > list_a ).
thf(func_def_29,type,
nil_list_a: list_list_a ).
thf(func_def_30,type,
nil_nat: list_nat ).
thf(func_def_31,type,
nil_poly_a: list_poly_a ).
thf(func_def_32,type,
nil_a: list_a ).
thf(func_def_33,type,
null_poly_a: list_poly_a > $o ).
thf(func_def_34,type,
null_a: list_a > $o ).
thf(func_def_35,type,
ord_less_nat: nat > nat > $o ).
thf(func_def_36,type,
ord_less_poly_a: poly_a > poly_a > $o ).
thf(func_def_37,type,
ord_less_a: a > a > $o ).
thf(func_def_38,type,
poly_nat2: list_nat > poly_nat ).
thf(func_def_39,type,
poly_poly_a2: list_poly_a > poly_poly_a ).
thf(func_def_40,type,
poly_a2: list_a > poly_a ).
thf(func_def_41,type,
coeffs_nat: poly_nat > list_nat ).
thf(func_def_42,type,
coeffs_poly_a: poly_poly_a > list_poly_a ).
thf(func_def_43,type,
coeffs_a: poly_a > list_a ).
thf(func_def_44,type,
is_zero_poly_a: poly_poly_a > $o ).
thf(func_def_45,type,
is_zero_a: poly_a > $o ).
thf(func_def_46,type,
pCons_nat: nat > poly_nat > poly_nat ).
thf(func_def_47,type,
pCons_poly_a: poly_a > poly_poly_a > poly_poly_a ).
thf(func_def_48,type,
pCons_a: a > poly_a > poly_a ).
thf(func_def_49,type,
smult_nat: nat > poly_nat > poly_nat ).
thf(func_def_50,type,
smult_poly_a: poly_a > poly_poly_a > poly_poly_a ).
thf(func_def_51,type,
smult_a: a > poly_a > poly_a ).
thf(func_def_52,type,
g: poly_a ).
thf(func_def_53,type,
v: poly_a > nat ).
thf(func_def_54,type,
xs: list_a ).
thf(func_def_55,type,
ys: list_a ).
thf(func_def_57,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_58,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_59,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_60,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_63,type,
vAND: $o > $o > $o ).
thf(func_def_64,type,
vOR: $o > $o > $o ).
thf(func_def_65,type,
vNOT: $o > $o ).
thf(func_def_66,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_67,type,
sK0: poly_a > a ).
thf(func_def_68,type,
sK1: poly_a > poly_a ).
thf(func_def_69,type,
sK2: ( poly_poly_a > $o ) > poly_a ).
thf(func_def_70,type,
sK3: ( poly_poly_a > $o ) > poly_poly_a ).
thf(func_def_71,type,
sK4: ( poly_nat > $o ) > nat ).
thf(func_def_72,type,
sK5: ( poly_nat > $o ) > poly_nat ).
thf(func_def_73,type,
sK6: ( poly_a > $o ) > a ).
thf(func_def_74,type,
sK7: ( poly_a > $o ) > poly_a ).
thf(func_def_75,type,
sK8: poly_a > a ).
thf(func_def_76,type,
sK9: poly_a > poly_a ).
thf(func_def_77,type,
sK10: ( poly_a > poly_a > $o ) > a ).
thf(func_def_78,type,
sK11: ( poly_a > poly_a > $o ) > poly_a ).
thf(func_def_79,type,
sK12: ( poly_a > poly_a > $o ) > a ).
thf(func_def_80,type,
sK13: ( poly_a > poly_a > $o ) > poly_a ).
thf(func_def_81,type,
sK14: ( poly_a > $o ) > a ).
thf(func_def_82,type,
sK15: ( poly_a > $o ) > poly_a ).
thf(func_def_83,type,
sK16: ( list_a > list_a > $o ) > a ).
thf(func_def_84,type,
sK17: ( list_a > list_a > $o ) > list_a ).
thf(func_def_85,type,
sK18: ( list_a > list_a > $o ) > a ).
thf(func_def_86,type,
sK19: ( list_a > list_a > $o ) > list_a ).
thf(func_def_87,type,
sK20: ( list_a > list_a > $o ) > a ).
thf(func_def_88,type,
sK21: ( list_a > list_a > $o ) > list_a ).
thf(func_def_89,type,
sK22: ( list_a > list_a > $o ) > list_a ).
thf(func_def_90,type,
sK23: ( list_a > list_a > $o ) > a ).
thf(func_def_91,type,
sK24: ( list_a > list_a > $o ) > list_a ).
thf(func_def_92,type,
sK25: ( list_a > list_a > $o ) > list_a ).
thf(func_def_93,type,
sK26: ( list_a > list_a > $o ) > a ).
thf(func_def_94,type,
sK27: ( list_a > list_a > $o ) > list_a ).
thf(func_def_95,type,
sK28: ( list_a > list_a > $o ) > a ).
thf(func_def_96,type,
sK29: ( list_a > list_a > $o ) > list_a ).
thf(func_def_97,type,
sK30: list_a > a ).
thf(func_def_98,type,
sK31: list_a > a ).
thf(func_def_99,type,
sK32: list_a > list_a ).
thf(func_def_100,type,
sK33: list_a > a ).
thf(func_def_101,type,
sK34: ( list_a > $o ) > a ).
thf(func_def_102,type,
sK35: ( list_a > $o ) > list_a ).
thf(func_def_103,type,
sK36: list_a > a ).
thf(func_def_104,type,
sK37: list_a > list_a ).
thf(func_def_105,type,
sK38: ( ( a > a ) > list_a > list_a > $o ) > a > a ).
thf(func_def_106,type,
sK39: ( ( a > a ) > list_a > list_a > $o ) > a ).
thf(func_def_107,type,
sK40: ( ( a > a ) > list_a > list_a > $o ) > list_a ).
thf(func_def_108,type,
sK41: ( ( a > a ) > list_a > list_a > $o ) > list_a ).
thf(func_def_109,type,
sK42: ( ( a > a ) > list_a > list_a > $o ) > a > a ).
thf(func_def_110,type,
sK43: ( ( a > a ) > list_a > list_a > $o ) > list_a ).
thf(func_def_111,type,
sK44: ( list_a > $o ) > a ).
thf(func_def_112,type,
sK45: ( list_a > $o ) > list_a ).
thf(func_def_113,type,
sK46: ( list_a > $o ) > a ).
thf(func_def_114,type,
sK47: ( ( a > a > $o ) > list_a > $o ) > a > a > $o ).
thf(func_def_115,type,
sK48: ( ( a > a > $o ) > list_a > $o ) > a ).
thf(func_def_116,type,
sK49: ( ( a > a > $o ) > list_a > $o ) > a ).
thf(func_def_117,type,
sK50: ( ( a > a > $o ) > list_a > $o ) > list_a ).
thf(func_def_118,type,
sK51: ( ( a > a > $o ) > list_a > $o ) > a > a > $o ).
thf(func_def_119,type,
sK52: ( ( a > a > $o ) > list_a > $o ) > a ).
thf(func_def_120,type,
sK53: ( ( a > a > $o ) > list_a > $o ) > a > a > $o ).
thf(func_def_121,type,
sK54: ( list_a > $o ) > a ).
thf(func_def_122,type,
sK55: ( list_a > $o ) > a ).
thf(func_def_123,type,
sK56: ( list_a > $o ) > list_a ).
thf(func_def_124,type,
sK57: ( list_a > $o ) > a ).
thf(func_def_125,type,
sK58: ( ( a > a > $o ) > list_a > $o ) > a > a > $o ).
thf(func_def_126,type,
sK59: ( ( a > a > $o ) > list_a > $o ) > a ).
thf(func_def_127,type,
sK60: ( ( a > a > $o ) > list_a > $o ) > list_a ).
thf(func_def_128,type,
sK61: ( ( a > a > $o ) > list_a > $o ) > a > a > $o ).
thf(func_def_129,type,
sK62: list_a > a ).
thf(func_def_130,type,
sK63: list_a > a ).
thf(func_def_131,type,
sK64: list_a > list_a ).
thf(func_def_132,type,
sK65: list_a > a ).
thf(func_def_133,type,
sK66: list_list_a > a ).
thf(func_def_134,type,
sK67: list_list_a > list_a ).
thf(func_def_135,type,
sK68: list_list_a > list_list_a ).
thf(func_def_136,type,
sK69: list_list_a > list_list_a ).
thf(func_def_137,type,
sK70: ( list_a > list_a > $o ) > a ).
thf(func_def_138,type,
sK71: ( list_a > list_a > $o ) > list_a ).
thf(func_def_139,type,
sK72: ( list_a > list_a > $o ) > a ).
thf(func_def_140,type,
sK73: ( list_a > list_a > $o ) > list_a ).
thf(func_def_141,type,
sK74: ( list_a > list_a > $o ) > list_a ).
thf(func_def_142,type,
sK75: ( list_a > list_a > $o ) > list_a ).
thf(func_def_143,type,
sK76: ( list_a > $o ) > a ).
thf(func_def_144,type,
sK77: ( list_a > $o ) > list_a ).
thf(func_def_145,type,
sK78: list_a > a ).
thf(func_def_146,type,
sK79: list_a > list_a ).
thf(func_def_147,type,
sK80: ( list_a > $o ) > a ).
thf(func_def_148,type,
sK81: ( list_a > $o ) > a ).
thf(func_def_149,type,
sK82: ( list_a > $o ) > list_a ).
thf(func_def_150,type,
sK83: ( list_a > $o ) > a ).
thf(func_def_151,type,
sK84: ( list_a > list_a > $o ) > a ).
thf(func_def_152,type,
sK85: ( list_a > list_a > $o ) > list_a ).
thf(func_def_153,type,
sK86: ( list_a > list_a > $o ) > list_a ).
thf(func_def_154,type,
sK87: ( list_a > list_a > $o ) > list_a ).
thf(func_def_155,type,
sK88: ( list_a > list_a > $o ) > a ).
thf(func_def_156,type,
sK89: ( list_a > list_a > $o ) > list_a ).
thf(func_def_157,type,
sK90: ( list_a > list_a > $o ) > a ).
thf(func_def_158,type,
sK91: ( list_a > list_a > $o ) > list_a ).
thf(func_def_159,type,
sK92: ( list_a > list_a > $o ) > a ).
thf(func_def_160,type,
sK93: ( list_a > list_a > $o ) > list_a ).
thf(func_def_161,type,
sK94: ( list_a > list_a > $o ) > a ).
thf(func_def_162,type,
sK95: ( list_a > list_a > $o ) > list_a ).
thf(func_def_163,type,
sK96: ( list_a > $o ) > a ).
thf(func_def_164,type,
sK97: ( list_a > $o ) > list_a ).
thf(func_def_165,type,
sK98: list_a > a ).
thf(func_def_166,type,
sK99: list_a > list_a ).
thf(func_def_167,type,
sK100: ( nat > $o ) > nat ).
thf(func_def_168,type,
sK101: ( nat > $o ) > nat ).
thf(func_def_169,type,
sK102: ( nat > $o ) > nat ).
thf(func_def_170,type,
sK103: list_a > list_a ).
thf(func_def_171,type,
sK104: list_a > a ).
thf(func_def_172,type,
sK105: list_a > list_a > list_a > list_a > list_a ).
thf(f7,axiom,
! [X0: list_a,X1: poly_a] :
( ( ( poly_a2 @ X0 )
= X1 )
=> ( ( descar2095969287nges_a @ X0 )
= ( descar2095969287nges_a @ ( coeffs_a @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_6_sign__changes__coeff__sign__changes) ).
thf(f8,axiom,
( ys
= ( append_a @ ( coeffs_a @ g ) @ ( cons_a @ zero_zero_a @ nil_a ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_7_ys__def) ).
thf(f14,axiom,
! [X0: poly_a] :
( ( poly_a2 @ ( coeffs_a @ X0 ) )
= X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_13_Poly__coeffs) ).
thf(f67,axiom,
! [X0: list_a] :
( ( poly_a2 @ ( append_a @ X0 @ ( cons_a @ zero_zero_a @ nil_a ) ) )
= ( poly_a2 @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_66_Poly__snoc__zero) ).
thf(f347,conjecture,
( ( descar2095969287nges_a @ ys )
= ( descar2095969287nges_a @ ( coeffs_a @ g ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(f348,negated_conjecture,
( ( descar2095969287nges_a @ ys )
!= ( descar2095969287nges_a @ ( coeffs_a @ g ) ) ),
inference(negated_conjecture,[status(cth)],[f347]) ).
thf(f666,plain,
( ( descar2095969287nges_a @ ys )
!= ( descar2095969287nges_a @ ( coeffs_a @ g ) ) ),
inference(flattening,[],[f348]) ).
thf(f668,plain,
! [X0: list_a,X1: poly_a] :
( ( ( descar2095969287nges_a @ X0 )
= ( descar2095969287nges_a @ ( coeffs_a @ X1 ) ) )
| ( ( poly_a2 @ X0 )
!= X1 ) ),
inference(ennf_transformation,[],[f7]) ).
thf(f901,plain,
! [X0: list_a,X1: poly_a] :
( ( ( descar2095969287nges_a @ X0 )
= ( descar2095969287nges_a @ ( coeffs_a @ X1 ) ) )
| ( ( poly_a2 @ X0 )
!= X1 ) ),
inference(cnf_transformation,[],[f668]) ).
thf(f902,plain,
( ys
= ( append_a @ ( coeffs_a @ g ) @ ( cons_a @ zero_zero_a @ nil_a ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f908,plain,
! [X0: poly_a] :
( ( poly_a2 @ ( coeffs_a @ X0 ) )
= X0 ),
inference(cnf_transformation,[],[f14]) ).
thf(f961,plain,
! [X0: list_a] :
( ( poly_a2 @ X0 )
= ( poly_a2 @ ( append_a @ X0 @ ( cons_a @ zero_zero_a @ nil_a ) ) ) ),
inference(cnf_transformation,[],[f67]) ).
thf(f1284,plain,
( ( descar2095969287nges_a @ ys )
!= ( descar2095969287nges_a @ ( coeffs_a @ g ) ) ),
inference(cnf_transformation,[],[f666]) ).
thf(f1290,plain,
! [X0: list_a] :
( ( descar2095969287nges_a @ X0 )
= ( descar2095969287nges_a @ ( coeffs_a @ ( poly_a2 @ X0 ) ) ) ),
inference(equality_resolution,[],[f901]) ).
thf(f3488,plain,
( ( poly_a2 @ ( coeffs_a @ g ) )
= ( poly_a2 @ ys ) ),
inference(constrained_superposition,[],[f961,f902]) ).
thf(f3491,plain,
( g
= ( poly_a2 @ ys ) ),
inference(forward_demodulation,[],[f3488,f908]) ).
thf(f3493,plain,
( ( descar2095969287nges_a @ ys )
= ( descar2095969287nges_a @ ( coeffs_a @ g ) ) ),
inference(constrained_superposition,[],[f1290,f3491]) ).
thf(f3494,plain,
$false,
inference(forward_subsumption_resolution,[],[f3493,f1284]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP044^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n010.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % 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 19:41:03 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.38 % (3311477)Will run a generic schedule for satisfiability detection.
% 0.20/0.38 % (3311483)% WARNING: option uhcvi not known.
% 0.20/0.38 % (3311487)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1317530186:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.38 % (3311485)dis+10_1_sil=32000:sp=arity:random_seed=2455817608:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.38 % (3311482)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4196992310_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.38 % (3311486)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2194279316:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.38 % (3311484)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=430784739:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.38 % (3311483)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2024466492:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.38 % (3311488)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=449220943:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.38 % (3311486)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.38 % (3311483)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.38 % Exception at run slice level
% 0.20/0.38 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.38 % (3311483)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.38 % (3311487)Instruction limit reached!
% 0.20/0.38 % (3311487)------------------------------
% 0.20/0.38 % (3311487)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.38 % (3311487)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.38 % (3311487)CaDiCaL version: 2.1.3
% 0.20/0.38 % (3311487)Termination reason: Instruction limit
% 0.20/0.38 % (3311487)Termination phase: Saturation
% 0.20/0.38 % (3311487)Time elapsed: 0.032 s
% 0.20/0.38 % (3311487)Peak memory usage: 13 MB
% 0.20/0.38 % (3311487)Instructions burned: 132 (million)
% 0.20/0.38 % (3311497)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3850197278:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.38 % (3311485)Instruction limit reached!
% 0.20/0.38 % (3311485)------------------------------
% 0.20/0.38 % (3311485)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.38 % (3311485)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.38 % (3311485)CaDiCaL version: 2.1.3
% 0.20/0.38 % (3311485)Termination reason: Instruction limit
% 0.20/0.38 % (3311485)Termination phase: Saturation
% 0.20/0.38 % (3311485)Time elapsed: 0.047 s
% 0.20/0.38 % (3311485)Peak memory usage: 12 MB
% 0.20/0.38 % (3311485)Instructions burned: 103 (million)
% 0.20/0.38 % (3311496)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1302666723:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.38 % (3311486)Instruction limit reached!
% 0.20/0.38 % (3311486)------------------------------
% 0.20/0.38 % (3311486)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.38 % (3311486)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.38 % (3311486)CaDiCaL version: 2.1.3
% 0.20/0.38 % (3311486)Termination reason: Instruction limit
% 0.20/0.38 % (3311486)Termination phase: Saturation
% 0.20/0.38 % (3311486)Time elapsed: 0.051 s
% 0.20/0.38 % (3311486)Peak memory usage: 13 MB
% 0.20/0.38 % (3311486)Instructions burned: 116 (million)
% 0.20/0.38 % (3311500)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=930091845:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.20/0.38 % (3311501)ott-21_1_sil=16000:fs=off:random_seed=3943825418:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 0.20/0.38 % (3311497)Instruction limit reached!
% 0.20/0.38 % (3311497)------------------------------
% 0.20/0.38 % (3311497)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.38 % (3311497)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.38 % (3311497)CaDiCaL version: 2.1.3
% 0.20/0.38 % (3311497)Termination reason: Instruction limit
% 0.20/0.38 % (3311497)Termination phase: Saturation
% 0.20/0.38 % (3311497)Time elapsed: 0.031 s
% 0.20/0.38 % (3311497)Peak memory usage: 13 MB
% 0.20/0.38 % (3311497)Instructions burned: 132 (million)
% 0.20/0.38 % Exception at run slice level
% 0.20/0.38 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.38 % (3311500)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.38 % (3311504)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3625187512:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 0.20/0.38 % (3311505)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1081022779:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 0.20/0.38 % (3311500)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.38 % (3311488)Instruction limit reached!
% 0.20/0.38 % (3311488)------------------------------
% 0.20/0.38 % (3311488)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.38 % (3311488)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.38 % (3311488)CaDiCaL version: 2.1.3
% 0.20/0.38 % (3311488)Termination reason: Instruction limit
% 0.20/0.38 % (3311488)Termination phase: Saturation
% 0.20/0.38 % (3311488)Time elapsed: 0.095 s
% 0.20/0.38 % (3311488)Peak memory usage: 13 MB
% 0.20/0.38 % (3311488)Instructions burned: 160 (million)
% 0.20/0.38 % (3311483) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3311477-3311483"...
% 0.20/0.38 % (3311483)...printing done.
% 0.20/0.38 % (3311483)Refutation found. Thanks to Tanya!
% 0.20/0.38 % SZS status Theorem for theBenchmark
% 0.20/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.38 % (3311483)------------------------------
% 0.20/0.38 % (3311483)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.38 % (3311483)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.38 % (3311483)CaDiCaL version: 2.1.3
% 0.20/0.38 % (3311483)Termination reason: Refutation
% 0.20/0.38 % (3311483)Time elapsed: 0.103 s
% 0.20/0.38 % (3311483)Peak memory usage: 14 MB
% 0.20/0.38 % (3311483)Instructions burned: 208 (million)
% 0.20/0.38 % (3311477)Success in time 0.144 s
% 0.20/0.38 % Vampire exiting
%------------------------------------------------------------------------------