%------------------------------------------------------------------------------
% File : Vampire---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 THM
% Computer : n016.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:08:02 AM UTC 2026
% Result : Theorem 0.54s 0.37s
% Output : Refutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 41 ( 16 unt; 0 typ; 3 def)
% Number of atoms : 118 ( 32 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 195 ( 36 ~; 19 |; 2 &; 128 @)
% ( 3 <=>; 7 =>; 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 : 168 ( 165 usr; 13 con; 0-4 aty)
% Number of variables : 16 ( 0 sgn 15 !; 1 ?; 16 :)
% 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,
vAND: $o > $o > $o ).
thf(func_def_45,type,
vIMP: $o > $o > $o ).
thf(func_def_46,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_47,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_48,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_49,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_50,type,
vNOT: $o > $o ).
thf(func_def_51,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_52,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_53,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_54,type,
vOR: $o > $o > $o ).
thf(func_def_55,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_56,type,
sK0: binary1439146945Tree_a > a ).
thf(func_def_57,type,
sK1: binary1439146945Tree_a > binary1439146945Tree_a ).
thf(func_def_58,type,
sK2: binary1439146945Tree_a > binary1439146945Tree_a ).
thf(func_def_59,type,
sK3: ( int > int ) > int ).
thf(func_def_60,type,
sK4: ( int > int ) > int ).
thf(func_def_61,type,
sK5: ( set_a > int ) > set_a ).
thf(func_def_62,type,
sK6: ( set_a > int ) > set_a ).
thf(func_def_63,type,
sK7: set_a > set_a > ( a > $o ) > a ).
thf(func_def_64,type,
sK8: set_a > ( a > $o ) > a ).
thf(func_def_65,type,
sK9: set_a > ( a > $o ) > a ).
thf(func_def_66,type,
sK10: ( set_a > int ) > set_a ).
thf(func_def_67,type,
sK11: ( set_a > int ) > set_a ).
thf(func_def_68,type,
sK12: ( int > set_a ) > int ).
thf(func_def_69,type,
sK13: ( int > set_a ) > int ).
thf(func_def_70,type,
sK14: ( int > int ) > int ).
thf(func_def_71,type,
sK15: ( int > int ) > int ).
thf(func_def_72,type,
sK16: ( a > $o ) > a ).
thf(func_def_73,type,
sK17: ( int > set_a ) > int ).
thf(func_def_74,type,
sK18: ( int > set_a ) > int ).
thf(func_def_75,type,
sK19: ( int > int > $o ) > int ).
thf(func_def_76,type,
sK20: ( int > int > $o ) > int ).
thf(func_def_77,type,
sK21: ( int > int > $o ) > int ).
thf(func_def_78,type,
sK22: ( int > int > $o ) > int ).
thf(func_def_79,type,
sK23: ( int > int > $o ) > int ).
thf(func_def_80,type,
sK24: a > ( a > $o ) > a ).
thf(func_def_81,type,
sK25: ( set_a > int ) > set_a ).
thf(func_def_82,type,
sK26: ( set_a > int ) > set_a ).
thf(func_def_83,type,
sK27: ( int > set_a ) > int ).
thf(func_def_84,type,
sK28: ( int > set_a ) > int ).
thf(func_def_85,type,
sK29: int > int ).
thf(func_def_86,type,
sK30: ( a > $o ) > a > a ).
thf(func_def_87,type,
sK31: ( int > set_a ) > int ).
thf(func_def_88,type,
sK32: ( int > set_a ) > int ).
thf(func_def_89,type,
sK33: ( a > $o ) > ( a > $o ) > a ).
thf(func_def_90,type,
sK34: a > ( a > $o ) > a ).
thf(func_def_91,type,
sK35: a > a > set_a > set_a > set_a ).
thf(func_def_92,type,
sK36: a > binary1439146945Tree_a > binary1439146945Tree_a ).
thf(func_def_93,type,
sK37: a > binary1439146945Tree_a > binary1439146945Tree_a ).
thf(func_def_94,type,
sK38: a > binary1439146945Tree_a > binary1439146945Tree_a ).
thf(func_def_95,type,
sK39: a > binary1439146945Tree_a > a ).
thf(func_def_96,type,
sK40: a > binary1439146945Tree_a > binary1439146945Tree_a ).
thf(func_def_97,type,
sK41: a > binary1439146945Tree_a > a ).
thf(func_def_98,type,
sK42: a > binary1439146945Tree_a > binary1439146945Tree_a ).
thf(func_def_99,type,
sK43: a > binary1439146945Tree_a > binary1439146945Tree_a ).
thf(func_def_100,type,
sK44: set_a > a ).
thf(func_def_101,type,
sK45: set_a > a ).
thf(func_def_102,type,
sK46: ( set_a > set_a ) > set_a ).
thf(func_def_103,type,
sK47: ( set_a > set_a ) > set_a ).
thf(func_def_104,type,
sK48: ( int > set_a ) > int ).
thf(func_def_105,type,
sK49: ( int > set_a ) > int ).
thf(func_def_106,type,
sK50: int > int ).
thf(func_def_107,type,
sK51: ( int > int ) > int ).
thf(func_def_108,type,
sK52: ( int > int ) > int ).
thf(func_def_109,type,
sK53: binary1439146945Tree_a > a > ( a > int ) > a ).
thf(func_def_110,type,
sK54: a > binary1439146945Tree_a > ( a > int ) > a ).
thf(func_def_111,type,
sK55: ( set_a > int ) > set_a ).
thf(func_def_112,type,
sK56: ( set_a > int ) > set_a ).
thf(func_def_113,type,
sK57: ( binary1439146945Tree_a > $o ) > binary1439146945Tree_a ).
thf(func_def_114,type,
sK58: ( binary1439146945Tree_a > $o ) > binary1439146945Tree_a ).
thf(func_def_115,type,
sK59: ( binary1439146945Tree_a > $o ) > a ).
thf(func_def_116,type,
sK60: ( int > int ) > int ).
thf(func_def_117,type,
sK61: ( int > int ) > int ).
thf(func_def_118,type,
sK62: ( set_a > int ) > set_a ).
thf(func_def_119,type,
sK63: ( set_a > int ) > set_a ).
thf(func_def_120,type,
sK64: ( int > int ) > int ).
thf(func_def_121,type,
sK65: ( int > int ) > int ).
thf(func_def_122,type,
sK66: ( int > set_a ) > int ).
thf(func_def_123,type,
sK67: ( int > set_a ) > int ).
thf(func_def_124,type,
sK68: set_a > a ).
thf(func_def_125,type,
sK69: ( a > $o ) > a > a ).
thf(func_def_126,type,
sK70: ( set_a > set_a ) > set_a ).
thf(func_def_127,type,
sK71: ( set_a > set_a ) > set_a ).
thf(func_def_128,type,
sK72: set_a > set_a > a ).
thf(func_def_129,type,
sK73: ( a > $o ) > ( a > $o ) > a ).
thf(func_def_130,type,
sK74: set_a > a ).
thf(func_def_131,type,
sK75: ( int > set_a ) > int ).
thf(func_def_132,type,
sK76: ( int > set_a ) > int ).
thf(func_def_133,type,
sK77: set_a > a ).
thf(func_def_134,type,
sK78: set_a > a ).
thf(func_def_135,type,
sK79: a > ( a > $o ) > a ).
thf(func_def_136,type,
sK80: ( a > $o ) > ( a > $o ) > a ).
thf(func_def_137,type,
sK81: ( a > $o ) > a ).
thf(func_def_138,type,
sK82: ( set_a > set_a ) > set_a ).
thf(func_def_139,type,
sK83: ( set_a > set_a ) > set_a ).
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 > ( a > $o ) > a ).
thf(func_def_143,type,
sK87: set_a > ( a > $o ) > a ).
thf(func_def_144,type,
sK88: set_a > set_a > ( a > $o ) > a ).
thf(func_def_145,type,
sK89: ( set_a > int ) > set_a ).
thf(func_def_146,type,
sK90: ( set_a > int ) > set_a ).
thf(func_def_147,type,
sK91: a ).
thf(func_def_148,type,
sK92: ( int > int ) > int ).
thf(func_def_149,type,
sK93: ( int > int ) > int ).
thf(func_def_150,type,
sK94: ( set_a > set_a ) > set_a ).
thf(func_def_151,type,
sK95: ( set_a > set_a ) > set_a ).
thf(func_def_152,type,
sK96: ( set_a > set_a ) > set_a ).
thf(func_def_153,type,
sK97: ( set_a > set_a ) > set_a ).
thf(func_def_154,type,
sK98: a > ( a > $o ) > a ).
thf(func_def_155,type,
sK99: set_a > set_a > a ).
thf(func_def_156,type,
sK100: set_a > a > set_a ).
thf(func_def_157,type,
sK101: ( int > int ) > int ).
thf(func_def_158,type,
sK102: ( int > int ) > int ).
thf(func_def_159,type,
sK103: ( set_a > set_a ) > set_a ).
thf(func_def_160,type,
sK104: ( set_a > set_a ) > set_a ).
thf(func_def_161,type,
sK105: a > set_a > set_a ).
thf(func_def_162,type,
sK106: ( set_a > int ) > set_a ).
thf(func_def_163,type,
sK107: ( set_a > int ) > set_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(f225,axiom,
! [X0: int] :
~ ( ord_less_int @ X0 @ X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_224_dual__order_Oirrefl) ).
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(f428,plain,
~ ! [X0: a] :
( ( member_a @ X0 @ ( binary504661350_eqs_a @ h @ e ) )
=> ( ( h @ X0 )
!= ( h @ x ) ) ),
inference(rectify,[],[f360]) ).
thf(f429,plain,
~ ! [X0: a] :
( ( ( member_a @ X0 @ ( binary504661350_eqs_a @ h @ e ) )
= $true )
=> ( ( h @ X0 )
!= ( h @ x ) ) ),
inference(fool_elimination,[],[f428]) ).
thf(f541,plain,
! [X0: a] :
( ( member_a @ X0 @ ( binary504661350_eqs_a @ h @ e ) )
=> ( ord_less_int @ ( h @ X0 ) @ ( h @ x ) ) ),
inference(rectify,[],[f1]) ).
thf(f542,plain,
! [X0: a] :
( ( ( member_a @ X0 @ ( binary504661350_eqs_a @ h @ e ) )
= $true )
=> ( ( ord_less_int @ ( h @ X0 ) @ ( h @ x ) )
= $true ) ),
inference(fool_elimination,[],[f541]) ).
thf(f712,plain,
! [X0: int] :
~ ( ord_less_int @ X0 @ X0 ),
inference(rectify,[],[f225]) ).
thf(f713,plain,
! [X0: int] :
( ( ord_less_int @ X0 @ X0 )
!= $true ),
inference(fool_elimination,[],[f712]) ).
thf(f949,plain,
! [X0: int] :
( ( ord_less_int @ X0 @ X0 )
!= $true ),
inference(flattening,[],[f713]) ).
thf(f1082,plain,
! [X0: a] :
( ( ( ord_less_int @ ( h @ X0 ) @ ( h @ x ) )
= $true )
| ( ( member_a @ X0 @ ( binary504661350_eqs_a @ h @ e ) )
!= $true ) ),
inference(ennf_transformation,[],[f542]) ).
thf(f1140,plain,
? [X0: a] :
( ( ( member_a @ X0 @ ( binary504661350_eqs_a @ h @ e ) )
= $true )
& ( ( h @ X0 )
= ( h @ x ) ) ),
inference(ennf_transformation,[],[f429]) ).
thf(f1457,plain,
( ( ( member_a @ sK91 @ ( binary504661350_eqs_a @ h @ e ) )
= $true )
& ( ( h @ x )
= ( h @ sK91 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK91]),skolemize(X0,sK91)],[f1140]) ).
thf(f1693,plain,
! [X0: int] :
( ( ord_less_int @ X0 @ X0 )
!= $true ),
inference(cnf_transformation,[],[f949]) ).
thf(f1990,plain,
( ( h @ x )
= ( h @ sK91 ) ),
inference(cnf_transformation,[],[f1457]) ).
thf(f1991,plain,
( ( member_a @ sK91 @ ( binary504661350_eqs_a @ h @ e ) )
= $true ),
inference(cnf_transformation,[],[f1457]) ).
thf(f2075,plain,
! [X0: a] :
( ( ( ord_less_int @ ( h @ X0 ) @ ( h @ x ) )
= $true )
| ( ( member_a @ X0 @ ( binary504661350_eqs_a @ h @ e ) )
!= $true ) ),
inference(cnf_transformation,[],[f1082]) ).
thf(f2265,definition,
( spl108_10
<=> ( ( member_a @ sK91 @ ( binary504661350_eqs_a @ h @ e ) )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl108_10])],[avatar_definition]) ).
thf(f2267,plain,
( ( ( member_a @ sK91 @ ( binary504661350_eqs_a @ h @ e ) )
= $true )
| ~ spl108_10 ),
inference(avatar_component_clause,[],[f2265]) ).
thf(f2268,plain,
spl108_10,
inference(avatar_split_clause,[],[f1991,f2265]) ).
thf(f2358,definition,
( spl108_29
<=> ( ( h @ x )
= ( h @ sK91 ) ) ),
introduced(definition,[new_symbols(definition,[spl108_29])],[avatar_definition]) ).
thf(f2360,plain,
( ( ( h @ x )
= ( h @ sK91 ) )
| ~ spl108_29 ),
inference(avatar_component_clause,[],[f2358]) ).
thf(f2361,plain,
spl108_29,
inference(avatar_split_clause,[],[f1990,f2358]) ).
thf(f2495,plain,
( ! [X0: a] :
( ( ( member_a @ X0 @ ( binary504661350_eqs_a @ h @ e ) )
!= $true )
| ( ( ord_less_int @ ( h @ X0 ) @ ( h @ sK91 ) )
= $true ) )
| ~ spl108_29 ),
inference(forward_demodulation,[],[f2075,f2360]) ).
thf(f2496,plain,
( ( $true
= ( ord_less_int @ ( h @ sK91 ) @ ( h @ sK91 ) ) )
| ( $true != $true )
| ~ spl108_10
| ~ spl108_29 ),
inference(superposition,[],[f2495,f2267]) ).
thf(f2500,plain,
( ( $true
= ( ord_less_int @ ( h @ sK91 ) @ ( h @ sK91 ) ) )
| ~ spl108_10
| ~ spl108_29 ),
inference(trivial_inequality_removal,[],[f2496]) ).
thf(f2505,definition,
( spl108_56
<=> ( $true
= ( ord_less_int @ ( h @ sK91 ) @ ( h @ sK91 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl108_56])],[avatar_definition]) ).
thf(f2507,plain,
( ( $true
= ( ord_less_int @ ( h @ sK91 ) @ ( h @ sK91 ) ) )
| ~ spl108_56 ),
inference(avatar_component_clause,[],[f2505]) ).
thf(f2508,plain,
( spl108_56
| ~ spl108_10
| ~ spl108_29 ),
inference(avatar_split_clause,[],[f2500,f2358,f2265,f2505]) ).
thf(f2636,plain,
( ( $true != $true )
| ~ spl108_56 ),
inference(superposition,[],[f1693,f2507]) ).
thf(f2637,plain,
( $false
| ~ spl108_56 ),
inference(trivial_inequality_removal,[],[f2636]) ).
thf(f2638,plain,
~ spl108_56,
inference(avatar_contradiction_clause,[],[f2637]) ).
cnf(s9,plain,
spl108_10,
inference(sat_conversion,[],[f2268]) ).
cnf(s29,plain,
spl108_29,
inference(sat_conversion,[],[f2361]) ).
cnf(s79,plain,
( ~ spl108_10
| ~ spl108_29
| spl108_56 ),
inference(sat_conversion,[],[f2508]) ).
cnf(s88,plain,
~ spl108_56,
inference(sat_conversion,[],[f2638]) ).
cnf(s89,plain,
( ~ spl108_10
| ~ spl108_29 ),
inference(rat,[],[s79,s88]) ).
cnf(s90,plain,
~ spl108_10,
inference(rat,[],[s89,s29]) ).
cnf(s93,plain,
$false,
inference(rat,[],[s9,s90]) ).
thf(f2639,plain,
$false,
inference(avatar_sat_refutation,[],[s93]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % 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 THM
% 0.07/0.19 % Computer : n016.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Tue Sep 29 19:43:35 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running higher-order theorem proving
% 0.21/0.27 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.54/0.36 % (814652)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.54/0.36 % (814660)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=3006585942:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.54/0.36 % (814663)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.54/0.36 % (814663)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.54/0.36 % (814657)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2391820889:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.54/0.36 % (814658)lrs+10_16_si=on:nwc=1.5:random_seed=931763434:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.54/0.36 % (814661)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=179887397:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.54/0.36 % (814659)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=3183423916:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.54/0.36 % (814662)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3277888748:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.54/0.36 % (814663)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=208737207:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.54/0.36 % (814659)Instruction limit reached!
% 0.54/0.36 % (814659)------------------------------
% 0.54/0.36 % (814659)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.54/0.36 % (814659)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.54/0.36 % (814659)CaDiCaL version: 2.1.3
% 0.54/0.36 % (814659)Termination reason: Instruction limit
% 0.54/0.36 % (814659)Termination phase: shuffling
% 0.54/0.36 % (814659)Time elapsed: 0.002 s
% 0.54/0.36 % (814659)Peak memory usage: 10 MB
% 0.54/0.36 % (814659)Instructions burned: 3 (million)
% 0.54/0.36 % (814658)Instruction limit reached!
% 0.54/0.36 % (814658)------------------------------
% 0.54/0.36 % (814658)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.54/0.36 % (814658)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.54/0.36 % (814658)CaDiCaL version: 2.1.3
% 0.54/0.36 % (814658)Termination reason: Instruction limit
% 0.54/0.36 % (814658)Termination phase: shuffling
% 0.54/0.36 % (814658)Time elapsed: 0.010 s
% 0.54/0.36 % (814658)Peak memory usage: 10 MB
% 0.54/0.36 % (814658)Instructions burned: 18 (million)
% 0.54/0.36 % (814661)Instruction limit reached!
% 0.54/0.36 % (814661)------------------------------
% 0.54/0.36 % (814661)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.54/0.36 % (814661)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.54/0.36 % (814661)CaDiCaL version: 2.1.3
% 0.54/0.36 % (814661)Termination reason: Instruction limit
% 0.54/0.37 % (814661)Termination phase: Property scanning
% 0.54/0.37 % (814661)Time elapsed: 0.012 s
% 0.54/0.37 % (814661)Peak memory usage: 10 MB
% 0.54/0.37 % (814661)Instructions burned: 26 (million)
% 0.54/0.37 % (814671)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=641325560:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.54/0.37 % (814671)Instruction limit reached!
% 0.54/0.37 % (814671)------------------------------
% 0.54/0.37 % (814671)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.54/0.37 % (814671)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.54/0.37 % (814671)CaDiCaL version: 2.1.3
% 0.54/0.37 % (814671)Termination reason: Instruction limit
% 0.54/0.37 % (814671)Termination phase: shuffling
% 0.54/0.37 % (814671)Time elapsed: 0.002 s
% 0.54/0.37 % (814671)Peak memory usage: 10 MB
% 0.54/0.37 % (814671)Instructions burned: 4 (million)
% 0.54/0.37 % (814673)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.54/0.37 % (814673)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=2538659524:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.54/0.37 % (814672)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=3725082317:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.54/0.37 % (814660) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-814652-814660"...
% 0.54/0.37 % (814660)...printing done.
% 0.54/0.37 % (814672)Instruction limit reached!
% 0.54/0.37 % (814672)------------------------------
% 0.54/0.37 % (814672)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.54/0.37 % (814672)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.54/0.37 % (814672)CaDiCaL version: 2.1.3
% 0.54/0.37 % (814672)Termination reason: Instruction limit
% 0.54/0.37 % (814672)Termination phase: shuffling
% 0.54/0.37 % (814672)Time elapsed: 0.004 s
% 0.54/0.37 % (814673)Instruction limit reached!
% 0.54/0.37 % (814673)------------------------------
% 0.54/0.37 % (814673)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.54/0.37 % (814672)Peak memory usage: 10 MB
% 0.54/0.37 % (814672)Instructions burned: 7 (million)
% 0.54/0.37 % (814673)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.54/0.37 % (814673)CaDiCaL version: 2.1.3
% 0.54/0.37 % (814673)Termination reason: Instruction limit
% 0.54/0.37 % (814673)Termination phase: shuffling
% 0.54/0.37 % (814662)Instruction limit reached!
% 0.54/0.37 % (814662)------------------------------
% 0.54/0.37 % (814662)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.54/0.37 % (814673)Time elapsed: 0.004 s
% 0.54/0.37 % (814673)Peak memory usage: 10 MB
% 0.54/0.37 % (814673)Instructions burned: 8 (million)
% 0.54/0.37 % (814662)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.54/0.37 % (814662)CaDiCaL version: 2.1.3
% 0.54/0.37 % (814662)Termination reason: Instruction limit
% 0.54/0.37 % (814662)Termination phase: Property scanning
% 0.54/0.37 % (814662)Time elapsed: 0.035 s
% 0.54/0.37 % (814662)Peak memory usage: 12 MB
% 0.54/0.37 % (814662)Instructions burned: 76 (million)
% 0.54/0.37 % (814660)Refutation found. Thanks to Tanya!
% 0.54/0.37 % SZS status Theorem for theBenchmark
% 0.54/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.54/0.37 % (814660)------------------------------
% 0.54/0.37 % (814660)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.54/0.37 % (814660)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.54/0.37 % (814660)CaDiCaL version: 2.1.3
% 0.54/0.37 % (814660)Termination reason: Refutation
% 0.54/0.37 % (814660)Time elapsed: 0.042 s
% 0.54/0.37 % (814660)Peak memory usage: 15 MB
% 0.54/0.37 % (814660)Instructions burned: 155 (million)
% 0.54/0.37 % (814652)Success in time 0.082 s
% 0.54/0.37 % Vampire exiting
%------------------------------------------------------------------------------