%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ITP031^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n001.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:26 AM UTC 2026
% Result : Theorem 0.98s 0.38s
% Output : Refutation 0.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 113 ( 62 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 208 ( 24 ~; 8 |; 7 &; 162 @)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 168 ( 165 usr; 10 con; 0-4 aty)
% Number of variables : 46 ( 31 ^; 14 !; 1 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
binary1439146945Tree_a: $tType ).
thf(type_def_6,type,
set_a: $tType ).
thf(type_def_7,type,
int: $tType ).
thf(type_def_8,type,
a: $tType ).
thf(type_def_9,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
binary717961607le_T_a: binary1439146945Tree_a > a > binary1439146945Tree_a > binary1439146945Tree_a ).
thf(func_def_1,type,
binary476621312_Tip_a: binary1439146945Tree_a ).
thf(func_def_2,type,
binary256242811Tree_a: binary1439146945Tree_a > set_a ).
thf(func_def_3,type,
binary1226383794sert_a: ( a > int ) > a > binary1439146945Tree_a > binary1439146945Tree_a ).
thf(func_def_4,type,
binary504661350_eqs_a: ( a > int ) > a > set_a ).
thf(func_def_5,type,
binary2053421120memb_a: ( a > int ) > a > binary1439146945Tree_a > $o ).
thf(func_def_6,type,
binary945792244etOf_a: binary1439146945Tree_a > set_a ).
thf(func_def_7,type,
binary1721989714Tree_a: ( a > int ) > binary1439146945Tree_a > $o ).
thf(func_def_8,type,
binary670562003pred_a: ( a > int ) > a > a > binary1439146945Tree_a > $o ).
thf(func_def_9,type,
minus_minus_a_o: ( a > $o ) > ( a > $o ) > a > $o ).
thf(func_def_10,type,
minus_minus_o: $o > $o > $o ).
thf(func_def_11,type,
minus_minus_int: int > int > int ).
thf(func_def_12,type,
minus_minus_set_a: set_a > set_a > set_a ).
thf(func_def_13,type,
the_a: ( a > $o ) > a ).
thf(func_def_14,type,
if_a: $o > a > a > a ).
thf(func_def_15,type,
sup_sup_a_o: ( a > $o ) > ( a > $o ) > a > $o ).
thf(func_def_16,type,
sup_sup_o: $o > $o > $o ).
thf(func_def_17,type,
sup_sup_int: int > int > int ).
thf(func_def_18,type,
sup_sup_set_a: set_a > set_a > set_a ).
thf(func_def_19,type,
bot_bot_a_o: a > $o ).
thf(func_def_20,type,
bot_bot_o: $o ).
thf(func_def_21,type,
bot_bot_set_a: set_a ).
thf(func_def_22,type,
ord_less_a_o: ( a > $o ) > ( a > $o ) > $o ).
thf(func_def_23,type,
ord_less_int: int > int > $o ).
thf(func_def_24,type,
ord_less_set_a: set_a > set_a > $o ).
thf(func_def_25,type,
ord_less_eq_a_o: ( a > $o ) > ( a > $o ) > $o ).
thf(func_def_26,type,
ord_less_eq_int: int > int > $o ).
thf(func_def_27,type,
ord_less_eq_set_a: set_a > set_a > $o ).
thf(func_def_28,type,
collect_a: ( a > $o ) > set_a ).
thf(func_def_29,type,
insert_a: a > set_a > set_a ).
thf(func_def_30,type,
is_empty_a: set_a > $o ).
thf(func_def_31,type,
is_singleton_a: set_a > $o ).
thf(func_def_32,type,
pairwise_a: ( a > a > $o ) > set_a > $o ).
thf(func_def_33,type,
remove_a: a > set_a > set_a ).
thf(func_def_34,type,
the_elem_a: set_a > a ).
thf(func_def_35,type,
member_a: a > set_a > $o ).
thf(func_def_36,type,
e: a ).
thf(func_def_37,type,
h: a > int ).
thf(func_def_38,type,
t1: binary1439146945Tree_a ).
thf(func_def_39,type,
t2: binary1439146945Tree_a ).
thf(func_def_40,type,
x: a ).
thf(func_def_44,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_45,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_46,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_47,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_48,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_49,type,
vAND: $o > $o > $o ).
thf(func_def_50,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_51,type,
vIMP: $o > $o > $o ).
thf(func_def_52,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_53,type,
vNOT: $o > $o ).
thf(func_def_54,type,
vOR: $o > $o > $o ).
thf(func_def_55,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_56,type,
sK0: ( binary1439146945Tree_a > $o ) > binary1439146945Tree_a ).
thf(func_def_57,type,
sK1: ( binary1439146945Tree_a > $o ) > a ).
thf(func_def_58,type,
sK2: ( binary1439146945Tree_a > $o ) > binary1439146945Tree_a ).
thf(func_def_59,type,
sK3: binary1439146945Tree_a > binary1439146945Tree_a ).
thf(func_def_60,type,
sK4: binary1439146945Tree_a > a ).
thf(func_def_61,type,
sK5: binary1439146945Tree_a > binary1439146945Tree_a ).
thf(func_def_62,type,
sK6: ( a > $o ) > ( a > $o ) > a ).
thf(func_def_63,type,
sK7: set_a > a ).
thf(func_def_64,type,
sK8: set_a > a > set_a ).
thf(func_def_65,type,
sK9: set_a > a > set_a ).
thf(func_def_66,type,
sK10: set_a > set_a > a ).
thf(func_def_67,type,
sK11: set_a > a ).
thf(func_def_68,type,
sK12: set_a > a ).
thf(func_def_69,type,
sK13: ( int > int > $o ) > int ).
thf(func_def_70,type,
sK14: ( int > int > $o ) > int ).
thf(func_def_71,type,
sK15: ( int > int > $o ) > int ).
thf(func_def_72,type,
sK16: ( int > int > $o ) > int ).
thf(func_def_73,type,
sK17: ( int > int > $o ) > int ).
thf(func_def_74,type,
sK18: int > int ).
thf(func_def_75,type,
sK19: int > int ).
thf(func_def_76,type,
sK20: ( int > set_a ) > int ).
thf(func_def_77,type,
sK21: ( int > set_a ) > int ).
thf(func_def_78,type,
sK22: ( set_a > int ) > set_a ).
thf(func_def_79,type,
sK23: ( set_a > int ) > set_a ).
thf(func_def_80,type,
sK24: ( set_a > set_a ) > set_a ).
thf(func_def_81,type,
sK25: ( set_a > set_a ) > set_a ).
thf(func_def_82,type,
sK26: ( int > int ) > int ).
thf(func_def_83,type,
sK27: ( int > int ) > int ).
thf(func_def_84,type,
sK28: ( set_a > int ) > set_a ).
thf(func_def_85,type,
sK29: ( set_a > int ) > set_a ).
thf(func_def_86,type,
sK30: ( int > set_a ) > int ).
thf(func_def_87,type,
sK31: ( int > set_a ) > int ).
thf(func_def_88,type,
sK32: ( set_a > set_a ) > set_a ).
thf(func_def_89,type,
sK33: ( set_a > set_a ) > set_a ).
thf(func_def_90,type,
sK34: ( int > int ) > int ).
thf(func_def_91,type,
sK35: ( int > int ) > int ).
thf(func_def_92,type,
sK36: ( int > set_a ) > int ).
thf(func_def_93,type,
sK37: ( int > set_a ) > int ).
thf(func_def_94,type,
sK38: ( set_a > int ) > set_a ).
thf(func_def_95,type,
sK39: ( set_a > int ) > set_a ).
thf(func_def_96,type,
sK40: ( set_a > set_a ) > set_a ).
thf(func_def_97,type,
sK41: ( set_a > set_a ) > set_a ).
thf(func_def_98,type,
sK42: ( int > int ) > int ).
thf(func_def_99,type,
sK43: ( int > int ) > int ).
thf(func_def_100,type,
sK44: ( int > set_a ) > int ).
thf(func_def_101,type,
sK45: ( int > set_a ) > int ).
thf(func_def_102,type,
sK46: ( set_a > int ) > set_a ).
thf(func_def_103,type,
sK47: ( set_a > int ) > set_a ).
thf(func_def_104,type,
sK48: ( set_a > set_a ) > set_a ).
thf(func_def_105,type,
sK49: ( set_a > set_a ) > set_a ).
thf(func_def_106,type,
sK50: ( int > int ) > int ).
thf(func_def_107,type,
sK51: ( int > int ) > int ).
thf(func_def_108,type,
sK52: set_a > a ).
thf(func_def_109,type,
sK53: binary1439146945Tree_a > a > binary1439146945Tree_a ).
thf(func_def_110,type,
sK54: binary1439146945Tree_a > a > a ).
thf(func_def_111,type,
sK55: binary1439146945Tree_a > a > binary1439146945Tree_a ).
thf(func_def_112,type,
sK56: binary1439146945Tree_a > a > binary1439146945Tree_a ).
thf(func_def_113,type,
sK57: binary1439146945Tree_a > a > binary1439146945Tree_a ).
thf(func_def_114,type,
sK58: binary1439146945Tree_a > a > binary1439146945Tree_a ).
thf(func_def_115,type,
sK59: binary1439146945Tree_a > a > a ).
thf(func_def_116,type,
sK60: binary1439146945Tree_a > a > binary1439146945Tree_a ).
thf(func_def_117,type,
sK61: a > ( a > $o ) > a ).
thf(func_def_118,type,
sK62: a > ( a > $o ) > a ).
thf(func_def_119,type,
sK63: a > ( a > $o ) > a ).
thf(func_def_120,type,
sK64: ( a > $o ) > ( a > $o ) > a ).
thf(func_def_121,type,
sK65: a > ( a > $o ) > a ).
thf(func_def_122,type,
sK66: ( a > $o ) > ( a > $o ) > a ).
thf(func_def_123,type,
sK67: a > ( a > $o ) > a ).
thf(func_def_124,type,
sK68: a > ( a > $o ) > a ).
thf(func_def_125,type,
sK69: set_a > set_a > a ).
thf(func_def_126,type,
sK70: ( int > set_a ) > int ).
thf(func_def_127,type,
sK71: ( int > set_a ) > int ).
thf(func_def_128,type,
sK72: ( set_a > set_a ) > set_a ).
thf(func_def_129,type,
sK73: ( set_a > set_a ) > set_a ).
thf(func_def_130,type,
sK74: ( set_a > int ) > set_a ).
thf(func_def_131,type,
sK75: ( set_a > int ) > set_a ).
thf(func_def_132,type,
sK76: ( int > int ) > int ).
thf(func_def_133,type,
sK77: ( int > int ) > int ).
thf(func_def_134,type,
sK78: ( set_a > set_a ) > set_a ).
thf(func_def_135,type,
sK79: ( set_a > set_a ) > set_a ).
thf(func_def_136,type,
sK80: ( set_a > int ) > set_a ).
thf(func_def_137,type,
sK81: ( set_a > int ) > set_a ).
thf(func_def_138,type,
sK82: ( int > set_a ) > int ).
thf(func_def_139,type,
sK83: ( int > set_a ) > int ).
thf(func_def_140,type,
sK84: ( int > int ) > int ).
thf(func_def_141,type,
sK85: ( int > int ) > int ).
thf(func_def_142,type,
sK86: ( set_a > int ) > set_a ).
thf(func_def_143,type,
sK87: ( set_a > int ) > set_a ).
thf(func_def_144,type,
sK88: ( int > set_a ) > int ).
thf(func_def_145,type,
sK89: ( int > set_a ) > int ).
thf(func_def_146,type,
sK90: ( int > int ) > int ).
thf(func_def_147,type,
sK91: ( int > int ) > int ).
thf(func_def_148,type,
sK92: ( int > int ) > int ).
thf(func_def_149,type,
sK93: ( int > int ) > int ).
thf(func_def_150,type,
sK94: a ).
thf(func_def_151,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_152,type,
sK95: set_a > set_a > ( a > $o ) > a ).
thf(func_def_153,type,
sK96: set_a > set_a > ( a > $o ) > a ).
thf(func_def_154,type,
sK97: set_a > ( a > $o ) > a ).
thf(func_def_155,type,
sK98: set_a > ( a > $o ) > a ).
thf(func_def_156,type,
sK99: set_a > ( a > $o ) > a ).
thf(func_def_157,type,
sK100: set_a > ( a > $o ) > a ).
thf(func_def_158,type,
sK101: set_a > set_a > ( a > $o ) > a ).
thf(func_def_159,type,
sK102: set_a > set_a > ( a > $o ) > a ).
thf(func_def_160,type,
sK103: set_a > a > set_a > a > set_a ).
thf(func_def_161,type,
sK104: set_a > a ).
thf(func_def_162,type,
sK105: set_a > a ).
thf(func_def_163,type,
sK106: ( a > $o ) > a ).
thf(func_def_164,type,
sK107: ( a > $o ) > a ).
thf(func_def_165,type,
sK108: a > binary1439146945Tree_a > ( a > int ) > a ).
thf(func_def_166,type,
sK109: binary1439146945Tree_a > ( a > int ) > a > a ).
thf(f1,axiom,
! [X0: a] :
( ( member_a @ X0 @ ( binary504661350_eqs_a @ h @ e ) )
=> ( ord_less_int @ ( h @ X0 ) @ ( h @ x ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_eqsLessX) ).
thf(f10,axiom,
( binary504661350_eqs_a
= ( ^ [X0: a > int,X1: a] :
( collect_a
@ ^ [X2: a] :
( ( X0 @ X2 )
= ( X0 @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_9_eqs__def) ).
thf(f192,axiom,
( ord_less_int
= ( ^ [X0: int,X1: int] :
( ( X1 != X0 )
& ( X1
= ( sup_sup_int @ X1 @ X0 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_191_sup_Ostrict__order__iff) ).
thf(f359,conjecture,
! [X0: a] :
( ( member_a @ X0 @ ( binary504661350_eqs_a @ h @ e ) )
=> ( ( h @ X0 )
!= ( h @ x ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
thf(f360,negated_conjecture,
~ ! [X0: a] :
( ( member_a @ X0 @ ( binary504661350_eqs_a @ h @ e ) )
=> ( ( h @ X0 )
!= ( h @ x ) ) ),
inference(negated_conjecture,[status(cth)],[f359]) ).
thf(f361,plain,
! [X0: a] :
( ( member_a @ X0 @ ( binary504661350_eqs_a @ h @ e ) )
=> ( ord_less_int @ ( h @ X0 ) @ ( h @ x ) ) ),
inference(rectify,[],[f1]) ).
thf(f362,plain,
! [X0: a] :
( ( ( member_a @ X0 @ ( binary504661350_eqs_a @ h @ e ) )
= $true )
=> ( ( ord_less_int @ ( h @ X0 ) @ ( h @ x ) )
= $true ) ),
inference(fool_elimination,[],[f361]) ).
thf(f373,plain,
( binary504661350_eqs_a
= ( ^ [X0: a > int,X1: a] :
( collect_a
@ ^ [X2: a] :
( ( X0 @ X2 )
= ( X0 @ X1 ) ) ) ) ),
inference(rectify,[],[f10]) ).
thf(f374,plain,
( binary504661350_eqs_a
= ( ^ [Y0: a > int,Y1: a] :
( collect_a
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
= ( Y0 @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f373]) ).
thf(f546,plain,
( ord_less_int
= ( ^ [Y0: int,Y1: int] :
( ( ( sup_sup_int @ Y1 @ Y0 )
= Y1 )
& ( Y0 != Y1 ) ) ) ),
inference(fool_elimination,[],[f192]) ).
thf(f855,plain,
~ ! [X0: a] :
( ( member_a @ X0 @ ( binary504661350_eqs_a @ h @ e ) )
=> ( ( h @ X0 )
!= ( h @ x ) ) ),
inference(rectify,[],[f360]) ).
thf(f856,plain,
~ ! [X0: a] :
( ( ( member_a @ X0 @ ( binary504661350_eqs_a @ h @ e ) )
= $true )
=> ( ( h @ X0 )
!= ( h @ x ) ) ),
inference(fool_elimination,[],[f855]) ).
thf(f907,plain,
! [X0: a] :
( ( ( ord_less_int @ ( h @ X0 ) @ ( h @ x ) )
= $true )
| ( ( member_a @ X0 @ ( binary504661350_eqs_a @ h @ e ) )
!= $true ) ),
inference(ennf_transformation,[],[f362]) ).
thf(f1127,plain,
? [X0: a] :
( ( ( h @ X0 )
= ( h @ x ) )
& ( ( member_a @ X0 @ ( binary504661350_eqs_a @ h @ e ) )
= $true ) ),
inference(ennf_transformation,[],[f856]) ).
thf(f1180,plain,
( ( ( h @ x )
= ( h @ sK94 ) )
& ( $true
= ( member_a @ sK94 @ ( binary504661350_eqs_a @ h @ e ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK94]),skolemize(X0,sK94)],[f1127]) ).
thf(f1181,plain,
! [X0: a] :
( ( ( ord_less_int @ ( h @ X0 ) @ ( h @ x ) )
= $true )
| ( ( member_a @ X0 @ ( binary504661350_eqs_a @ h @ e ) )
!= $true ) ),
inference(cnf_transformation,[],[f907]) ).
thf(f1190,plain,
( binary504661350_eqs_a
= ( ^ [Y0: a > int,Y1: a] :
( collect_a
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
= ( Y0 @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f374]) ).
thf(f1387,plain,
( ord_less_int
= ( ^ [Y0: int,Y1: int] :
( ( ( sup_sup_int @ Y1 @ Y0 )
= Y1 )
& ( Y0 != Y1 ) ) ) ),
inference(cnf_transformation,[],[f546]) ).
thf(f1602,plain,
( $true
= ( member_a @ sK94 @ ( binary504661350_eqs_a @ h @ e ) ) ),
inference(cnf_transformation,[],[f1180]) ).
thf(f1603,plain,
( ( h @ x )
= ( h @ sK94 ) ),
inference(cnf_transformation,[],[f1180]) ).
thf(f1614,plain,
! [X0: a] :
( ( $true
= ( ^ [Y0: int,Y1: int] :
( ( ( sup_sup_int @ Y1 @ Y0 )
= Y1 )
& ( Y0 != Y1 ) )
@ ( h @ X0 )
@ ( h @ x ) ) )
| ( $true
!= ( member_a @ X0
@ ( ^ [Y0: a > int,Y1: a] :
( collect_a
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
= ( Y0 @ Y1 ) ) )
@ h
@ e ) ) ) ),
inference(definition_unfolding,[],[f1181,f1387,f1190]) ).
thf(f1936,plain,
( $true
= ( member_a @ sK94
@ ( ^ [Y0: a > int,Y1: a] :
( collect_a
@ ^ [Y2: a] :
( ( Y0 @ Y2 )
= ( Y0 @ Y1 ) ) )
@ h
@ e ) ) ),
inference(definition_unfolding,[],[f1602,f1190]) ).
thf(f1975,plain,
( $true
= ( member_a @ sK94
@ ( collect_a
@ ^ [Y0: a] :
( ( h @ Y0 )
= ( h @ e ) ) ) ) ),
inference(beta-eta_normalization,[],[f1936]) ).
thf(f7513,plain,
! [X0: a] :
( ( $true
= ( ( ( sup_sup_int @ ( h @ x ) @ ( h @ X0 ) )
= ( h @ x ) )
& ( ( h @ X0 )
!= ( h @ x ) ) ) )
| ( $true
!= ( member_a @ X0
@ ( collect_a
@ ^ [Y0: a] :
( ( h @ Y0 )
= ( h @ e ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f1614]) ).
thf(f7514,plain,
! [X0: a] :
( ( $true
= ( ( h @ X0 )
!= ( h @ x ) ) )
| ( $true
!= ( member_a @ X0
@ ( collect_a
@ ^ [Y0: a] :
( ( h @ Y0 )
= ( h @ e ) ) ) ) ) ),
inference(and_proxy_clausification,[],[f7513]) ).
thf(f7517,plain,
! [X0: a] :
( ( $false
= ( ( h @ X0 )
= ( h @ x ) ) )
| ( $true
!= ( member_a @ X0
@ ( collect_a
@ ^ [Y0: a] :
( ( h @ Y0 )
= ( h @ e ) ) ) ) ) ),
inference(not_proxy_clausification,[],[f7514]) ).
thf(f7518,plain,
! [X0: a] :
( ( $true
!= ( member_a @ X0
@ ( collect_a
@ ^ [Y0: a] :
( ( h @ Y0 )
= ( h @ e ) ) ) ) )
| ( ( h @ X0 )
!= ( h @ x ) ) ),
inference(equality_proxy_clausification,[],[f7517]) ).
thf(f7556,plain,
( ( $true != $true )
| ( ( h @ x )
!= ( h @ sK94 ) ) ),
inference(constrained_superposition,[],[f7518,f1975]) ).
thf(f7557,plain,
( ( h @ x )
!= ( h @ sK94 ) ),
inference(trivial_inequality_removal,[],[f7556]) ).
thf(f7558,plain,
$false,
inference(forward_subsumption_resolution,[],[f7557,f1603]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP031^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n001.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 19:44:37 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
% 0.98/0.38 % (1722007)Will run a generic schedule for satisfiability detection.
% 0.98/0.38 % (1722018)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2619746833_2999 on theBenchmark for (2999ds/0Mi)
% 0.98/0.38 % (1722019)% WARNING: option uhcvi not known.
% 0.98/0.38 % (1722020)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4121151816:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.98/0.38 % (1722019)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1121765139:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.98/0.38 % (1722021)dis+10_1_sil=32000:sp=arity:random_seed=2533626713:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.98/0.38 % (1722022)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3528714585:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.98/0.38 % (1722024)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=581685338:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.98/0.38 % (1722023)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3084046726:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.98/0.38 % (1722019)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.98/0.38 % (1722022)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.98/0.38 % Exception at run slice level
% 0.98/0.38 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.98/0.38 % (1722041)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=4046073723:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.98/0.38 % (1722021)Instruction limit reached!
% 0.98/0.38 % (1722021)------------------------------
% 0.98/0.38 % (1722021)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.38 % (1722021)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.38 % (1722021)CaDiCaL version: 2.1.3
% 0.98/0.38 % (1722021)Termination reason: Instruction limit
% 0.98/0.38 % (1722021)Termination phase: Property scanning
% 0.98/0.38 % (1722021)Time elapsed: 0.043 s
% 0.98/0.38 % (1722021)Peak memory usage: 11 MB
% 0.98/0.38 % (1722021)Instructions burned: 103 (million)
% 0.98/0.38 % (1722022)Instruction limit reached!
% 0.98/0.38 % (1722022)------------------------------
% 0.98/0.38 % (1722022)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.38 % (1722022)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.38 % (1722022)CaDiCaL version: 2.1.3
% 0.98/0.38 % (1722022)Termination reason: Instruction limit
% 0.98/0.38 % (1722022)Termination phase: Property scanning
% 0.98/0.38 % (1722022)Time elapsed: 0.047 s
% 0.98/0.38 % (1722022)Peak memory usage: 11 MB
% 0.98/0.38 % (1722022)Instructions burned: 116 (million)
% 0.98/0.38 % (1722023)Instruction limit reached!
% 0.98/0.38 % (1722023)------------------------------
% 0.98/0.38 % (1722023)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.38 % (1722023)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.38 % (1722023)CaDiCaL version: 2.1.3
% 0.98/0.38 % (1722023)Termination reason: Instruction limit
% 0.98/0.38 % (1722023)Termination phase: Property scanning
% 0.98/0.38 % (1722023)Time elapsed: 0.053 s
% 0.98/0.38 % (1722023)Peak memory usage: 11 MB
% 0.98/0.38 % (1722023)Instructions burned: 133 (million)
% 0.98/0.38 % (1722019)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.98/0.38 % (1722045)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=57442241:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.98/0.38 % Exception at run slice level
% 0.98/0.38 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.98/0.38 % (1722024)Instruction limit reached!
% 0.98/0.38 % (1722024)------------------------------
% 0.98/0.38 % (1722024)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.38 % (1722024)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.38 % (1722024)CaDiCaL version: 2.1.3
% 0.98/0.38 % (1722024)Termination reason: Instruction limit
% 0.98/0.38 % (1722024)Termination phase: Saturation
% 0.98/0.38 % (1722024)Time elapsed: 0.066 s
% 0.98/0.38 % (1722024)Peak memory usage: 13 MB
% 0.98/0.38 % (1722024)Instructions burned: 161 (million)
% 0.98/0.38 % (1722047)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=3167671229:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.98/0.38 % (1722049)ott-21_1_sil=16000:fs=off:random_seed=770655030:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 0.98/0.38 % (1722057)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=328697041:i=477:bd=all_2999 on theBenchmark for (2999ds/477Mi)
% 0.98/0.38 % (1722059)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2194302228:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 0.98/0.38 % (1722047)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.98/0.38 % (1722045)Instruction limit reached!
% 0.98/0.38 % (1722045)------------------------------
% 0.98/0.38 % (1722045)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.38 % (1722045)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.38 % (1722045)CaDiCaL version: 2.1.3
% 0.98/0.38 % (1722045)Termination reason: Instruction limit
% 0.98/0.38 % (1722045)Termination phase: Property scanning
% 0.98/0.38 % (1722045)Time elapsed: 0.056 s
% 0.98/0.38 % (1722045)Peak memory usage: 11 MB
% 0.98/0.38 % (1722045)Instructions burned: 132 (million)
% 0.98/0.38 % (1722020) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1722007-1722020"...
% 0.98/0.38 % (1722020)...printing done.
% 0.98/0.38 % (1722020)Refutation found. Thanks to Tanya!
% 0.98/0.38 % SZS status Theorem for theBenchmark
% 0.98/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.98/0.39 % (1722020)------------------------------
% 0.98/0.39 % (1722020)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.39 % (1722020)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.39 % (1722020)CaDiCaL version: 2.1.3
% 0.98/0.39 % (1722020)Termination reason: Refutation
% 0.98/0.39 % (1722020)Time elapsed: 0.123 s
% 0.98/0.39 % (1722020)Peak memory usage: 15 MB
% 0.98/0.39 % (1722020)Instructions burned: 287 (million)
% 0.98/0.39 % (1722007)Success in time 0.162 s
% 0.98/0.39 % Vampire exiting
%------------------------------------------------------------------------------