%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ITP070^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:12 AM UTC 2026
% Result : Theorem 0.48s 0.42s
% Output : Refutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 19 unt; 0 typ; 0 def)
% Number of atoms : 171 ( 74 equ; 0 cnn)
% Maximal formula atoms : 10 ( 5 avg)
% Number of connectives : 1202 ( 34 ~; 19 |; 18 &;1107 @)
% ( 0 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Number of types : 8 ( 7 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 156 ( 153 usr; 11 con; 0-6 aty)
% Number of variables : 61 ( 0 ^; 61 !; 0 ?; 61 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
produc768687417list_a: $tType ).
thf(type_def_6,type,
produc143150363Tree_a: $tType ).
thf(type_def_7,type,
multiset_a: $tType ).
thf(type_def_8,type,
list_a: $tType ).
thf(type_def_9,type,
tree_a: $tType ).
thf(type_def_10,type,
set_a: $tType ).
thf(type_def_11,type,
a: $tType ).
thf(type_def_12,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
plus_plus_multiset_a: multiset_a > multiset_a > multiset_a ).
thf(func_def_1,type,
zero_zero_multiset_a: multiset_a ).
thf(func_def_2,type,
heapIm970322378pify_a: tree_a > tree_a ).
thf(func_def_3,type,
heapIm229596386mpty_a: tree_a > $o ).
thf(func_def_4,type,
heapIm1057938560list_a: list_a > tree_a ).
thf(func_def_5,type,
heapIm1140443833left_a: tree_a > tree_a ).
thf(func_def_6,type,
heapIm1637418125tree_a: list_a > tree_a ).
thf(func_def_7,type,
heapIm837449470Leaf_a: tree_a > produc143150363Tree_a ).
thf(func_def_8,type,
heapIm1257206334ight_a: tree_a > tree_a ).
thf(func_def_9,type,
heapIm1091024090Down_a: tree_a > tree_a ).
thf(func_def_10,type,
heap_Tree_a_a: tree_a > ( tree_a > $o ) > ( list_a > tree_a ) > ( tree_a > multiset_a ) > ( tree_a > tree_a ) > ( tree_a > produc143150363Tree_a ) > $o ).
thf(func_def_11,type,
heap_axioms_Tree_a_a: ( tree_a > $o ) > ( list_a > tree_a ) > ( tree_a > multiset_a ) > ( tree_a > tree_a ) > ( tree_a > produc143150363Tree_a ) > $o ).
thf(func_def_12,type,
e_a: tree_a ).
thf(func_def_13,type,
t_a: a > tree_a > tree_a > tree_a ).
thf(func_def_14,type,
in_tree_a: a > tree_a > $o ).
thf(func_def_15,type,
is_heap_a: tree_a > $o ).
thf(func_def_16,type,
multiset_a2: tree_a > multiset_a ).
thf(func_def_17,type,
val_a: tree_a > a ).
thf(func_def_18,type,
lattic146396397_Max_a: set_a > a ).
thf(func_def_19,type,
cons_a: a > list_a > list_a ).
thf(func_def_20,type,
add_mset_a: a > multiset_a > multiset_a ).
thf(func_def_21,type,
is_empty_a: multiset_a > $o ).
thf(func_def_22,type,
set_mset_a: multiset_a > set_a ).
thf(func_def_23,type,
subseteq_mset_a: multiset_a > multiset_a > $o ).
thf(func_def_24,type,
ord_less_eq_o_o_a: ( $o > $o > a ) > ( $o > $o > a ) > $o ).
thf(func_def_25,type,
ord_less_eq_o_a: ( $o > a ) > ( $o > a ) > $o ).
thf(func_def_26,type,
ord_le1199012836iset_a: multiset_a > multiset_a > $o ).
thf(func_def_27,type,
ord_less_eq_set_a: set_a > set_a > $o ).
thf(func_def_28,type,
ord_less_eq_a: a > a > $o ).
thf(func_def_29,type,
order_Greatest_o_a: ( ( $o > a ) > $o ) > $o > a ).
thf(func_def_30,type,
order_Greatest_a: ( a > $o ) > a ).
thf(func_def_31,type,
produc1352981801list_a: tree_a > list_a > produc768687417list_a ).
thf(func_def_32,type,
produc686083979Tree_a: a > tree_a > produc143150363Tree_a ).
thf(func_def_33,type,
set_Tree_a_a: ( tree_a > multiset_a ) > tree_a > set_a ).
thf(func_def_34,type,
removeMax_Tree_a_a: tree_a > ( tree_a > $o ) > ( list_a > tree_a ) > ( tree_a > multiset_a ) > ( tree_a > produc143150363Tree_a ) > ( tree_a > $o ) > $o ).
thf(func_def_35,type,
ssort_Tree_a_a: ( tree_a > $o ) > ( tree_a > produc143150363Tree_a ) > tree_a > list_a > list_a ).
thf(func_def_36,type,
ssort_dom_Tree_a_a: ( tree_a > $o ) > ( tree_a > produc143150363Tree_a ) > produc768687417list_a > $o ).
thf(func_def_37,type,
remove301631099ee_a_a: ( tree_a > $o ) > ( list_a > tree_a ) > ( tree_a > multiset_a ) > ( tree_a > produc143150363Tree_a ) > ( tree_a > $o ) > $o ).
thf(func_def_38,type,
collect_a: ( a > $o ) > set_a ).
thf(func_def_39,type,
member_a: a > set_a > $o ).
thf(func_def_40,type,
l1: tree_a ).
thf(func_def_41,type,
l2: tree_a ).
thf(func_def_42,type,
r1: tree_a ).
thf(func_def_43,type,
r2: tree_a ).
thf(func_def_44,type,
v1: a ).
thf(func_def_45,type,
v2: a ).
thf(func_def_46,type,
v: a ).
thf(func_def_50,type,
db0:
!>[X0: $tType] : X0 ).
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,
vAND: $o > $o > $o ).
thf(func_def_54,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_55,type,
vOR: $o > $o > $o ).
thf(func_def_56,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_57,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_58,type,
vIMP: $o > $o > $o ).
thf(func_def_59,type,
vNOT: $o > $o ).
thf(func_def_60,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_61,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_62,type,
db7:
!>[X0: $tType] : X0 ).
thf(func_def_63,type,
db5:
!>[X0: $tType] : X0 ).
thf(func_def_64,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_65,type,
sP0: ( tree_a > $o ) > $o ).
thf(func_def_66,type,
sP1: ( tree_a > $o ) > $o ).
thf(func_def_67,type,
sP2: ( tree_a > $o ) > $o ).
thf(func_def_68,type,
sK3: tree_a > tree_a ).
thf(func_def_69,type,
sK4: tree_a > tree_a ).
thf(func_def_70,type,
sK5: tree_a > a ).
thf(func_def_71,type,
sK6: tree_a > a ).
thf(func_def_72,type,
sK7: tree_a > tree_a ).
thf(func_def_73,type,
sK8: tree_a > tree_a ).
thf(func_def_74,type,
sK9: tree_a > a ).
thf(func_def_75,type,
sK10: tree_a > a ).
thf(func_def_76,type,
sK11: tree_a > tree_a ).
thf(func_def_77,type,
sK12: tree_a > tree_a ).
thf(func_def_78,type,
sK13: tree_a > tree_a ).
thf(func_def_79,type,
sK14: tree_a > tree_a ).
thf(func_def_80,type,
sK15: tree_a > a ).
thf(func_def_81,type,
sK16: tree_a > a ).
thf(func_def_82,type,
sK17: tree_a > a ).
thf(func_def_83,type,
sK18: tree_a > a ).
thf(func_def_84,type,
sK19: tree_a > tree_a ).
thf(func_def_85,type,
sK20: tree_a > tree_a ).
thf(func_def_86,type,
sK21: tree_a > tree_a ).
thf(func_def_87,type,
sK22: tree_a > a ).
thf(func_def_88,type,
sK23: tree_a > tree_a ).
thf(func_def_89,type,
sK24: tree_a > a ).
thf(func_def_90,type,
sK25: tree_a > a ).
thf(func_def_91,type,
sK26: tree_a > tree_a ).
thf(func_def_92,type,
sK27: tree_a > a ).
thf(func_def_93,type,
sK28: tree_a > tree_a ).
thf(func_def_94,type,
sK29: tree_a > tree_a ).
thf(func_def_95,type,
sK30: tree_a > a ).
thf(func_def_96,type,
sK31: tree_a > a ).
thf(func_def_97,type,
sK32: tree_a > tree_a ).
thf(func_def_98,type,
sK33: tree_a > a ).
thf(func_def_99,type,
sK34: tree_a > a ).
thf(func_def_100,type,
sK35: tree_a > tree_a ).
thf(func_def_101,type,
sK36: tree_a > a ).
thf(func_def_102,type,
sK37: tree_a > tree_a ).
thf(func_def_103,type,
sK38: tree_a > tree_a ).
thf(func_def_104,type,
sK39: tree_a > a ).
thf(func_def_105,type,
sK40: tree_a > a ).
thf(func_def_106,type,
sK41: tree_a > tree_a ).
thf(func_def_107,type,
sK42: a > tree_a > tree_a ).
thf(func_def_108,type,
sK43: a > tree_a > tree_a ).
thf(func_def_109,type,
sK44: a > tree_a > a ).
thf(func_def_110,type,
sK45: tree_a > a ).
thf(func_def_111,type,
sK46: tree_a > tree_a ).
thf(func_def_112,type,
sK47: tree_a > a ).
thf(func_def_113,type,
sK48: tree_a > tree_a ).
thf(func_def_114,type,
sK49: tree_a > a ).
thf(func_def_115,type,
sK50: tree_a > a ).
thf(func_def_116,type,
sK51: tree_a > a ).
thf(func_def_117,type,
sK52: tree_a > tree_a ).
thf(func_def_118,type,
sK53: tree_a > tree_a ).
thf(func_def_119,type,
sK54: tree_a > tree_a ).
thf(func_def_120,type,
sK55: tree_a > tree_a ).
thf(func_def_121,type,
sK56: tree_a > tree_a ).
thf(func_def_122,type,
sK57: tree_a > tree_a ).
thf(func_def_123,type,
sK58: tree_a > a ).
thf(func_def_124,type,
sK59: tree_a > a ).
thf(func_def_125,type,
sK60: tree_a > a ).
thf(func_def_126,type,
sK61: tree_a > tree_a ).
thf(func_def_127,type,
sK62: tree_a > tree_a ).
thf(func_def_128,type,
sK63: tree_a > a ).
thf(func_def_129,type,
sK64: ( tree_a > $o ) > tree_a ).
thf(func_def_130,type,
sK65: ( tree_a > $o ) > a ).
thf(func_def_131,type,
sK66: ( tree_a > $o ) > tree_a ).
thf(func_def_132,type,
sK67: ( tree_a > $o ) > tree_a ).
thf(func_def_133,type,
sK68: ( tree_a > $o ) > a ).
thf(func_def_134,type,
sK69: ( tree_a > $o ) > a ).
thf(func_def_135,type,
sK70: ( tree_a > $o ) > tree_a ).
thf(func_def_136,type,
sK71: ( tree_a > $o ) > tree_a ).
thf(func_def_137,type,
sK72: ( tree_a > $o ) > tree_a ).
thf(func_def_138,type,
sK73: ( tree_a > $o ) > a ).
thf(func_def_139,type,
sK74: ( tree_a > $o ) > tree_a ).
thf(func_def_140,type,
sK75: ( tree_a > $o ) > tree_a ).
thf(func_def_141,type,
sK76: ( tree_a > $o ) > a ).
thf(func_def_142,type,
sK77: ( tree_a > $o ) > a ).
thf(func_def_143,type,
sK78: ( tree_a > $o ) > tree_a ).
thf(func_def_144,type,
sK79: ( tree_a > $o ) > a ).
thf(func_def_145,type,
sK80: ( tree_a > $o ) > tree_a ).
thf(func_def_146,type,
sK81: ( tree_a > $o ) > a ).
thf(func_def_147,type,
sK82: ( tree_a > $o ) > a ).
thf(func_def_148,type,
sK83: ( tree_a > $o ) > tree_a ).
thf(func_def_149,type,
sK84: ( tree_a > $o ) > tree_a ).
thf(func_def_150,type,
sK85: ( tree_a > $o ) > a ).
thf(func_def_151,type,
sK86: ( tree_a > $o ) > a ).
thf(func_def_152,type,
sK87: ( tree_a > $o ) > a ).
thf(func_def_153,type,
sK88: ( tree_a > $o ) > tree_a ).
thf(func_def_154,type,
sK89: ( tree_a > $o ) > tree_a ).
thf(f1,axiom,
ord_less_eq_a @ v2 @ v1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0__092_060open_062v2_A_092_060le_062_Av1_092_060close_062) ).
thf(f2,axiom,
ord_less_eq_a @ v1 @ v,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_True) ).
thf(f31,axiom,
! [X2: tree_a,X0: a,X1: tree_a] :
( ( val_a @ ( t_a @ X0 @ X1 @ X2 ) )
= X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_30_val_Osimps) ).
thf(f32,axiom,
! [X2: tree_a,X5: tree_a,X4: tree_a,X0: a,X1: tree_a,X3: a,X6: a] :
( ( ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ ( val_a @ ( t_a @ X3 @ X4 @ X5 ) ) )
=> ( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ X6 )
=> ( ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( t_a @ X3 @ X4 @ X5 ) @ ( t_a @ X0 @ X1 @ X2 ) ) )
= ( t_a @ X6 @ ( t_a @ X3 @ X4 @ X5 ) @ ( t_a @ X0 @ X1 @ X2 ) ) ) )
& ( ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ X6 )
=> ( ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( t_a @ X3 @ X4 @ X5 ) @ ( t_a @ X0 @ X1 @ X2 ) ) )
= ( t_a @ ( val_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ ( t_a @ X3 @ X4 @ X5 ) @ ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( heapIm1140443833left_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X0 @ X1 @ X2 ) ) ) ) ) ) ) ) )
& ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ ( val_a @ ( t_a @ X3 @ X4 @ X5 ) ) )
=> ( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X3 @ X4 @ X5 ) ) @ X6 )
=> ( ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( t_a @ X3 @ X4 @ X5 ) @ ( t_a @ X0 @ X1 @ X2 ) ) )
= ( t_a @ X6 @ ( t_a @ X3 @ X4 @ X5 ) @ ( t_a @ X0 @ X1 @ X2 ) ) ) )
& ( ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X3 @ X4 @ X5 ) ) @ X6 )
=> ( ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( t_a @ X3 @ X4 @ X5 ) @ ( t_a @ X0 @ X1 @ X2 ) ) )
= ( t_a @ ( val_a @ ( t_a @ X3 @ X4 @ X5 ) ) @ ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( heapIm1140443833left_a @ ( t_a @ X3 @ X4 @ X5 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X3 @ X4 @ X5 ) ) ) ) @ ( t_a @ X0 @ X1 @ X2 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_31_siftDown_Osimps_I5_J) ).
thf(f215,conjecture,
( ( multiset_a2 @ ( heapIm1091024090Down_a @ ( t_a @ v @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) )
= ( multiset_a2 @ ( t_a @ v @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(f216,negated_conjecture,
( ( multiset_a2 @ ( heapIm1091024090Down_a @ ( t_a @ v @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) )
!= ( multiset_a2 @ ( t_a @ v @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f215]) ).
thf(f228,plain,
! [X0: tree_a,X1: tree_a,X2: tree_a,X3: a,X4: tree_a,X5: a,X6: a] :
( ( ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X3 @ X4 @ X0 ) ) @ ( val_a @ ( t_a @ X5 @ X2 @ X1 ) ) )
=> ( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X3 @ X4 @ X0 ) ) @ X6 )
=> ( ( t_a @ X6 @ ( t_a @ X5 @ X2 @ X1 ) @ ( t_a @ X3 @ X4 @ X0 ) )
= ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( t_a @ X5 @ X2 @ X1 ) @ ( t_a @ X3 @ X4 @ X0 ) ) ) ) )
& ( ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X3 @ X4 @ X0 ) ) @ X6 )
=> ( ( t_a @ ( val_a @ ( t_a @ X3 @ X4 @ X0 ) ) @ ( t_a @ X5 @ X2 @ X1 ) @ ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( heapIm1140443833left_a @ ( t_a @ X3 @ X4 @ X0 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X3 @ X4 @ X0 ) ) ) ) )
= ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( t_a @ X5 @ X2 @ X1 ) @ ( t_a @ X3 @ X4 @ X0 ) ) ) ) ) ) )
& ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X3 @ X4 @ X0 ) ) @ ( val_a @ ( t_a @ X5 @ X2 @ X1 ) ) )
=> ( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X5 @ X2 @ X1 ) ) @ X6 )
=> ( ( t_a @ X6 @ ( t_a @ X5 @ X2 @ X1 ) @ ( t_a @ X3 @ X4 @ X0 ) )
= ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( t_a @ X5 @ X2 @ X1 ) @ ( t_a @ X3 @ X4 @ X0 ) ) ) ) )
& ( ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X5 @ X2 @ X1 ) ) @ X6 )
=> ( ( t_a @ ( val_a @ ( t_a @ X5 @ X2 @ X1 ) ) @ ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( heapIm1140443833left_a @ ( t_a @ X5 @ X2 @ X1 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X5 @ X2 @ X1 ) ) ) ) @ ( t_a @ X3 @ X4 @ X0 ) )
= ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( t_a @ X5 @ X2 @ X1 ) @ ( t_a @ X3 @ X4 @ X0 ) ) ) ) ) ) ) ),
inference(rectify,[],[f32]) ).
thf(f229,plain,
! [X0: tree_a,X1: tree_a,X2: tree_a,X3: a,X4: tree_a,X5: a,X6: a] :
( ( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X3 @ X4 @ X0 ) ) @ ( val_a @ ( t_a @ X5 @ X2 @ X1 ) ) )
!= $true )
=> ( ( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X3 @ X4 @ X0 ) ) @ X6 )
= $true )
=> ( ( t_a @ X6 @ ( t_a @ X5 @ X2 @ X1 ) @ ( t_a @ X3 @ X4 @ X0 ) )
= ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( t_a @ X5 @ X2 @ X1 ) @ ( t_a @ X3 @ X4 @ X0 ) ) ) ) )
& ( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X3 @ X4 @ X0 ) ) @ X6 )
!= $true )
=> ( ( t_a @ ( val_a @ ( t_a @ X3 @ X4 @ X0 ) ) @ ( t_a @ X5 @ X2 @ X1 ) @ ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( heapIm1140443833left_a @ ( t_a @ X3 @ X4 @ X0 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X3 @ X4 @ X0 ) ) ) ) )
= ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( t_a @ X5 @ X2 @ X1 ) @ ( t_a @ X3 @ X4 @ X0 ) ) ) ) ) ) )
& ( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X3 @ X4 @ X0 ) ) @ ( val_a @ ( t_a @ X5 @ X2 @ X1 ) ) )
= $true )
=> ( ( ( $true
= ( ord_less_eq_a @ ( val_a @ ( t_a @ X5 @ X2 @ X1 ) ) @ X6 ) )
=> ( ( t_a @ X6 @ ( t_a @ X5 @ X2 @ X1 ) @ ( t_a @ X3 @ X4 @ X0 ) )
= ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( t_a @ X5 @ X2 @ X1 ) @ ( t_a @ X3 @ X4 @ X0 ) ) ) ) )
& ( ( $true
!= ( ord_less_eq_a @ ( val_a @ ( t_a @ X5 @ X2 @ X1 ) ) @ X6 ) )
=> ( ( t_a @ ( val_a @ ( t_a @ X5 @ X2 @ X1 ) ) @ ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( heapIm1140443833left_a @ ( t_a @ X5 @ X2 @ X1 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X5 @ X2 @ X1 ) ) ) ) @ ( t_a @ X3 @ X4 @ X0 ) )
= ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( t_a @ X5 @ X2 @ X1 ) @ ( t_a @ X3 @ X4 @ X0 ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f228]) ).
thf(f325,plain,
ord_less_eq_a @ v1 @ v,
inference(rectify,[],[f2]) ).
thf(f326,plain,
( ( ord_less_eq_a @ v1 @ v )
= $true ),
inference(fool_elimination,[],[f325]) ).
thf(f521,plain,
ord_less_eq_a @ v2 @ v1,
inference(rectify,[],[f1]) ).
thf(f522,plain,
( ( ord_less_eq_a @ v2 @ v1 )
= $true ),
inference(fool_elimination,[],[f521]) ).
thf(f545,plain,
( ( multiset_a2 @ ( heapIm1091024090Down_a @ ( t_a @ v @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) )
!= ( multiset_a2 @ ( t_a @ v @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) ),
inference(flattening,[],[f216]) ).
thf(f548,plain,
! [X2: tree_a,X0: tree_a,X3: a,X1: tree_a,X4: tree_a,X6: a,X5: a] :
( ( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X3 @ X4 @ X0 ) ) @ ( val_a @ ( t_a @ X5 @ X2 @ X1 ) ) )
= $true )
=> ( ( ( $true
= ( ord_less_eq_a @ ( val_a @ ( t_a @ X5 @ X2 @ X1 ) ) @ X6 ) )
=> ( ( t_a @ X6 @ ( t_a @ X5 @ X2 @ X1 ) @ ( t_a @ X3 @ X4 @ X0 ) )
= ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( t_a @ X5 @ X2 @ X1 ) @ ( t_a @ X3 @ X4 @ X0 ) ) ) ) )
& ( ( $true
!= ( ord_less_eq_a @ ( val_a @ ( t_a @ X5 @ X2 @ X1 ) ) @ X6 ) )
=> ( ( t_a @ ( val_a @ ( t_a @ X5 @ X2 @ X1 ) ) @ ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( heapIm1140443833left_a @ ( t_a @ X5 @ X2 @ X1 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X5 @ X2 @ X1 ) ) ) ) @ ( t_a @ X3 @ X4 @ X0 ) )
= ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( t_a @ X5 @ X2 @ X1 ) @ ( t_a @ X3 @ X4 @ X0 ) ) ) ) ) ) )
& ( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X3 @ X4 @ X0 ) ) @ ( val_a @ ( t_a @ X5 @ X2 @ X1 ) ) )
!= $true )
=> ( ( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X3 @ X4 @ X0 ) ) @ X6 )
= $true )
=> ( ( t_a @ X6 @ ( t_a @ X5 @ X2 @ X1 ) @ ( t_a @ X3 @ X4 @ X0 ) )
= ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( t_a @ X5 @ X2 @ X1 ) @ ( t_a @ X3 @ X4 @ X0 ) ) ) ) )
& ( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X3 @ X4 @ X0 ) ) @ X6 )
!= $true )
=> ( ( t_a @ ( val_a @ ( t_a @ X3 @ X4 @ X0 ) ) @ ( t_a @ X5 @ X2 @ X1 ) @ ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( heapIm1140443833left_a @ ( t_a @ X3 @ X4 @ X0 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X3 @ X4 @ X0 ) ) ) ) )
= ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( t_a @ X5 @ X2 @ X1 ) @ ( t_a @ X3 @ X4 @ X0 ) ) ) ) ) ) ) ),
inference(flattening,[],[f229]) ).
thf(f551,plain,
! [X2: tree_a,X0: tree_a,X1: a] :
( ( val_a @ ( t_a @ X1 @ X2 @ X0 ) )
= X1 ),
inference(rectify,[],[f31]) ).
thf(f572,plain,
! [X1: tree_a,X6: a,X5: a,X2: tree_a,X4: tree_a,X0: tree_a,X3: a] :
( ( ( ( ( ( t_a @ ( val_a @ ( t_a @ X5 @ X2 @ X1 ) ) @ ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( heapIm1140443833left_a @ ( t_a @ X5 @ X2 @ X1 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X5 @ X2 @ X1 ) ) ) ) @ ( t_a @ X3 @ X4 @ X0 ) )
= ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( t_a @ X5 @ X2 @ X1 ) @ ( t_a @ X3 @ X4 @ X0 ) ) ) )
| ( $true
= ( ord_less_eq_a @ ( val_a @ ( t_a @ X5 @ X2 @ X1 ) ) @ X6 ) ) )
& ( ( ( t_a @ X6 @ ( t_a @ X5 @ X2 @ X1 ) @ ( t_a @ X3 @ X4 @ X0 ) )
= ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( t_a @ X5 @ X2 @ X1 ) @ ( t_a @ X3 @ X4 @ X0 ) ) ) )
| ( $true
!= ( ord_less_eq_a @ ( val_a @ ( t_a @ X5 @ X2 @ X1 ) ) @ X6 ) ) ) )
| ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X3 @ X4 @ X0 ) ) @ ( val_a @ ( t_a @ X5 @ X2 @ X1 ) ) )
!= $true ) )
& ( ( ( ( ( t_a @ ( val_a @ ( t_a @ X3 @ X4 @ X0 ) ) @ ( t_a @ X5 @ X2 @ X1 ) @ ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( heapIm1140443833left_a @ ( t_a @ X3 @ X4 @ X0 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X3 @ X4 @ X0 ) ) ) ) )
= ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( t_a @ X5 @ X2 @ X1 ) @ ( t_a @ X3 @ X4 @ X0 ) ) ) )
| ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X3 @ X4 @ X0 ) ) @ X6 )
= $true ) )
& ( ( ( t_a @ X6 @ ( t_a @ X5 @ X2 @ X1 ) @ ( t_a @ X3 @ X4 @ X0 ) )
= ( heapIm1091024090Down_a @ ( t_a @ X6 @ ( t_a @ X5 @ X2 @ X1 ) @ ( t_a @ X3 @ X4 @ X0 ) ) ) )
| ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X3 @ X4 @ X0 ) ) @ X6 )
!= $true ) ) )
| ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X3 @ X4 @ X0 ) ) @ ( val_a @ ( t_a @ X5 @ X2 @ X1 ) ) )
= $true ) ) ),
inference(ennf_transformation,[],[f548]) ).
thf(f590,plain,
! [X0: tree_a,X1: tree_a,X2: a] :
( ( val_a @ ( t_a @ X2 @ X0 @ X1 ) )
= X2 ),
inference(rectify,[],[f551]) ).
thf(f601,plain,
! [X0: tree_a,X1: a,X2: a,X3: tree_a,X4: tree_a,X5: tree_a,X6: a] :
( ( ( ( ( ( heapIm1091024090Down_a @ ( t_a @ X1 @ ( t_a @ X2 @ X3 @ X0 ) @ ( t_a @ X6 @ X4 @ X5 ) ) )
= ( t_a @ ( val_a @ ( t_a @ X2 @ X3 @ X0 ) ) @ ( heapIm1091024090Down_a @ ( t_a @ X1 @ ( heapIm1140443833left_a @ ( t_a @ X2 @ X3 @ X0 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X2 @ X3 @ X0 ) ) ) ) @ ( t_a @ X6 @ X4 @ X5 ) ) )
| ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X2 @ X3 @ X0 ) ) @ X1 )
= $true ) )
& ( ( ( heapIm1091024090Down_a @ ( t_a @ X1 @ ( t_a @ X2 @ X3 @ X0 ) @ ( t_a @ X6 @ X4 @ X5 ) ) )
= ( t_a @ X1 @ ( t_a @ X2 @ X3 @ X0 ) @ ( t_a @ X6 @ X4 @ X5 ) ) )
| ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X2 @ X3 @ X0 ) ) @ X1 )
!= $true ) ) )
| ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X6 @ X4 @ X5 ) ) @ ( val_a @ ( t_a @ X2 @ X3 @ X0 ) ) )
!= $true ) )
& ( ( ( ( ( t_a @ ( val_a @ ( t_a @ X6 @ X4 @ X5 ) ) @ ( t_a @ X2 @ X3 @ X0 ) @ ( heapIm1091024090Down_a @ ( t_a @ X1 @ ( heapIm1140443833left_a @ ( t_a @ X6 @ X4 @ X5 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X6 @ X4 @ X5 ) ) ) ) )
= ( heapIm1091024090Down_a @ ( t_a @ X1 @ ( t_a @ X2 @ X3 @ X0 ) @ ( t_a @ X6 @ X4 @ X5 ) ) ) )
| ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X6 @ X4 @ X5 ) ) @ X1 )
= $true ) )
& ( ( ( heapIm1091024090Down_a @ ( t_a @ X1 @ ( t_a @ X2 @ X3 @ X0 ) @ ( t_a @ X6 @ X4 @ X5 ) ) )
= ( t_a @ X1 @ ( t_a @ X2 @ X3 @ X0 ) @ ( t_a @ X6 @ X4 @ X5 ) ) )
| ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X6 @ X4 @ X5 ) ) @ X1 )
!= $true ) ) )
| ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X6 @ X4 @ X5 ) ) @ ( val_a @ ( t_a @ X2 @ X3 @ X0 ) ) )
= $true ) ) ),
inference(rectify,[],[f572]) ).
thf(f619,plain,
( ( ord_less_eq_a @ v2 @ v1 )
= $true ),
inference(cnf_transformation,[],[f522]) ).
thf(f622,plain,
( ( multiset_a2 @ ( heapIm1091024090Down_a @ ( t_a @ v @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) )
!= ( multiset_a2 @ ( t_a @ v @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) ),
inference(cnf_transformation,[],[f545]) ).
thf(f624,plain,
! [X2: a,X0: tree_a,X1: tree_a] :
( ( val_a @ ( t_a @ X2 @ X0 @ X1 ) )
= X2 ),
inference(cnf_transformation,[],[f590]) ).
thf(f633,plain,
( ( ord_less_eq_a @ v1 @ v )
= $true ),
inference(cnf_transformation,[],[f326]) ).
thf(f640,plain,
! [X2: a,X3: tree_a,X0: tree_a,X1: a,X6: a,X4: tree_a,X5: tree_a] :
( ( ( heapIm1091024090Down_a @ ( t_a @ X1 @ ( t_a @ X2 @ X3 @ X0 ) @ ( t_a @ X6 @ X4 @ X5 ) ) )
= ( t_a @ X1 @ ( t_a @ X2 @ X3 @ X0 ) @ ( t_a @ X6 @ X4 @ X5 ) ) )
| ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X6 @ X4 @ X5 ) ) @ ( val_a @ ( t_a @ X2 @ X3 @ X0 ) ) )
!= $true )
| ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X2 @ X3 @ X0 ) ) @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f601]) ).
thf(f674,plain,
( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ v )
!= $true )
| ( ( ord_less_eq_a @ ( val_a @ ( t_a @ v2 @ l2 @ r2 ) ) @ ( val_a @ ( t_a @ v1 @ l1 @ r1 ) ) )
!= $true )
| ( ( multiset_a2 @ ( t_a @ v @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) )
!= ( multiset_a2 @ ( t_a @ v @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) ) ),
inference(superposition,[],[f622,f640]) ).
thf(f675,plain,
( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ v2 @ l2 @ r2 ) ) @ ( val_a @ ( t_a @ v1 @ l1 @ r1 ) ) )
!= $true )
| ( ( ord_less_eq_a @ ( val_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ v )
!= $true ) ),
inference(trivial_inequality_removal,[],[f674]) ).
thf(f679,plain,
( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ v )
!= $true )
| ( $true
!= ( ord_less_eq_a @ v2 @ ( val_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) ) ),
inference(forward_demodulation,[],[f675,f624]) ).
thf(f683,plain,
( ( $true
!= ( ord_less_eq_a @ v2 @ ( val_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) )
| ( ( ord_less_eq_a @ v1 @ v )
!= $true ) ),
inference(forward_demodulation,[],[f679,f624]) ).
thf(f687,plain,
( $true
!= ( ord_less_eq_a @ v2 @ ( val_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) ),
inference(forward_subsumption_resolution,[],[f683,f633]) ).
thf(f691,plain,
( ( ord_less_eq_a @ v2 @ v1 )
!= $true ),
inference(forward_demodulation,[],[f687,f624]) ).
thf(f693,plain,
$false,
inference(forward_subsumption_resolution,[],[f691,f619]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP070^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.19 % Computer : n014.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Tue Sep 29 19:46:30 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.23 Running higher-order theorem proving
% 0.20/0.28 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.42 % (3122369)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.48/0.42 % (3122379)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3377750516:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.48/0.42 % (3122380)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.48/0.42 % (3122380)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.48/0.42 % (3122374)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=298229810:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.48/0.42 % (3122376)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1303624973:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.48/0.42 % (3122378)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=931816554:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.48/0.42 % (3122377)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=3773548921: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.48/0.42 % (3122380)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=1741431394:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.48/0.42 % (3122376)Instruction limit reached!
% 0.48/0.42 % (3122376)------------------------------
% 0.48/0.42 % (3122376)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.48/0.42 % (3122376)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.48/0.42 % (3122376)CaDiCaL version: 2.1.3
% 0.48/0.42 % (3122376)Termination reason: Instruction limit
% 0.48/0.42 % (3122376)Termination phase: shuffling
% 0.48/0.42 % (3122376)Time elapsed: 0.003 s
% 0.48/0.42 % (3122376)Peak memory usage: 10 MB
% 0.48/0.42 % (3122376)Instructions burned: 7 (million)
% 0.48/0.42 % (3122375)lrs+10_16_si=on:nwc=1.5:random_seed=356094238:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.48/0.42 % (3122378)Instruction limit reached!
% 0.48/0.42 % (3122378)------------------------------
% 0.48/0.42 % (3122378)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.48/0.42 % (3122379)Instruction limit reached!
% 0.48/0.42 % (3122379)------------------------------
% 0.48/0.42 % (3122379)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.48/0.42 % (3122378)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.48/0.42 % (3122379)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.48/0.42 % (3122378)CaDiCaL version: 2.1.3
% 0.48/0.42 % (3122378)Termination reason: Instruction limit
% 0.48/0.42 % (3122378)Termination phase: Property scanning
% 0.48/0.42 % (3122379)CaDiCaL version: 2.1.3
% 0.48/0.42 % (3122378)Time elapsed: 0.011 s
% 0.48/0.42 % (3122379)Termination reason: Instruction limit
% 0.48/0.42 % (3122379)Termination phase: Property scanning
% 0.48/0.42 % (3122379)Time elapsed: 0.018 s
% 0.48/0.42 % (3122378)Peak memory usage: 10 MB
% 0.48/0.42 % (3122378)Instructions burned: 25 (million)
% 0.48/0.42 % (3122379)Peak memory usage: 12 MB
% 0.48/0.42 % (3122379)Instructions burned: 75 (million)
% 0.48/0.42 % (3122375)Instruction limit reached!
% 0.48/0.42 % (3122375)------------------------------
% 0.48/0.42 % (3122375)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.48/0.42 % (3122375)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.48/0.42 % (3122375)CaDiCaL version: 2.1.3
% 0.48/0.42 % (3122375)Termination reason: Instruction limit
% 0.48/0.42 % (3122375)Termination phase: Property scanning
% 0.48/0.42 % (3122375)Time elapsed: 0.011 s
% 0.48/0.42 % (3122375)Peak memory usage: 10 MB
% 0.48/0.42 % (3122375)Instructions burned: 24 (million)
% 0.48/0.42 % (3122387)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=2463957840:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.48/0.42 % (3122389)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=1800568853:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.48/0.42 % (3122389)Instruction limit reached!
% 0.48/0.42 % (3122389)------------------------------
% 0.48/0.42 % (3122389)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.48/0.42 % (3122389)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.48/0.42 % (3122389)CaDiCaL version: 2.1.3
% 0.48/0.42 % (3122389)Termination reason: Instruction limit
% 0.48/0.42 % (3122389)Termination phase: shuffling
% 0.48/0.42 % (3122389)Time elapsed: 0.002 s
% 0.48/0.42 % (3122389)Peak memory usage: 10 MB
% 0.48/0.42 % (3122389)Instructions burned: 9 (million)
% 0.48/0.42 % (3122387)Instruction limit reached!
% 0.48/0.42 % (3122387)------------------------------
% 0.48/0.42 % (3122387)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.48/0.42 % (3122387)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.48/0.42 % (3122387)CaDiCaL version: 2.1.3
% 0.48/0.42 % (3122387)Termination reason: Instruction limit
% 0.48/0.42 % (3122387)Termination phase: shuffling
% 0.48/0.42 % (3122387)Time elapsed: 0.003 s
% 0.48/0.42 % (3122387)Peak memory usage: 10 MB
% 0.48/0.42 % (3122387)Instructions burned: 5 (million)
% 0.48/0.42 % (3122390)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.48/0.42 % (3122390)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=2966640126:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.48/0.42 % (3122394)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.48/0.42 % (3122394)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.48/0.42 % (3122394)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=2733181472:i=28:s2at=5:piset=not:hud=10:bd=all:av=off:rtra=on:ixr=off:fsdmm=1_2999 on theBenchmark for (2999ds/28Mi)
% 0.48/0.42 % (3122391)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=3020455028:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.48/0.42 % (3122390)Instruction limit reached!
% 0.48/0.42 % (3122390)------------------------------
% 0.48/0.42 % (3122390)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.48/0.42 % (3122390)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.48/0.42 % (3122390)CaDiCaL version: 2.1.3
% 0.48/0.42 % (3122390)Termination reason: Instruction limit
% 0.48/0.42 % (3122390)Termination phase: shuffling
% 0.48/0.42 % (3122390)Time elapsed: 0.004 s
% 0.48/0.42 % (3122390)Peak memory usage: 10 MB
% 0.48/0.42 % (3122390)Instructions burned: 9 (million)
% 0.48/0.42 % (3122374)Instruction limit reached!
% 0.48/0.42 % (3122374)------------------------------
% 0.48/0.42 % (3122374)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.48/0.42 % (3122374)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.48/0.42 % (3122374)CaDiCaL version: 2.1.3
% 0.48/0.42 % (3122374)Termination reason: Instruction limit
% 0.48/0.42 % (3122374)Termination phase: Function definition elimination
% 0.48/0.42 % (3122374)Time elapsed: 0.039 s
% 0.48/0.42 % (3122374)Peak memory usage: 12 MB
% 0.48/0.42 % (3122374)Instructions burned: 88 (million)
% 0.48/0.42 % (3122391)Instruction limit reached!
% 0.48/0.42 % (3122391)------------------------------
% 0.48/0.42 % (3122391)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.48/0.42 % (3122391)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.48/0.42 % (3122391)CaDiCaL version: 2.1.3
% 0.48/0.42 % (3122391)Termination reason: Instruction limit
% 0.48/0.42 % (3122391)Termination phase: shuffling
% 0.48/0.42 % (3122391)Time elapsed: 0.006 s
% 0.48/0.42 % (3122391)Peak memory usage: 10 MB
% 0.48/0.42 % (3122391)Instructions burned: 14 (million)
% 0.48/0.42 % (3122394)Instruction limit reached!
% 0.48/0.42 % (3122394)------------------------------
% 0.48/0.42 % (3122394)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.48/0.42 % (3122394)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.48/0.42 % (3122394)CaDiCaL version: 2.1.3
% 0.48/0.42 % (3122394)Termination reason: Instruction limit
% 0.48/0.42 % (3122394)Termination phase: shuffling
% 0.48/0.42 % (3122394)Time elapsed: 0.007 s
% 0.48/0.42 % (3122394)Peak memory usage: 10 MB
% 0.48/0.42 % (3122394)Instructions burned: 32 (million)
% 0.48/0.42 % (3122395)lrs+1002_64_sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:sp=occurrence:lma=off:plsqr=32,1:uwa=interpreted_only:random_seed=2535741103:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 0.48/0.42 % (3122400)WARNING Broken Constraint: if positive_literal_split_queue_ratios(1,32) has been set then positive_literal_split_queue(off) is equal to on
% 0.48/0.42 % (3122403)lrs+1002_1_to=lpo:sil=128000:si=on:sos=on:spb=goal_then_units:uwa=off:random_seed=719280138:st=2:i=249:sd=1:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/249Mi)
% 0.48/0.42 % (3122399)lrs+10_1_si=on:cs=on:random_seed=1131590167:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 0.48/0.42 % (3122400)ott+1002_20_sil=128000:cnfonf=lazy_not_gen_be_off:si=on:sp=unary_frequency:plsqr=1,32:bce=on:uwa=interpreted_only:foolp=on:random_seed=897161209:i=2:add=on:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.48/0.42 % (3122400)Instruction limit reached!
% 0.48/0.42 % (3122400)------------------------------
% 0.48/0.42 % (3122400)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.48/0.42 % (3122400)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.48/0.42 % (3122400)CaDiCaL version: 2.1.3
% 0.48/0.42 % (3122400)Termination reason: Instruction limit
% 0.48/0.42 % (3122400)Termination phase: shuffling
% 0.48/0.42 % (3122400)Time elapsed: 0.002 s
% 0.48/0.42 % (3122400)Peak memory usage: 10 MB
% 0.48/0.42 % (3122400)Instructions burned: 3 (million)
% 0.48/0.42 % (3122399)Instruction limit reached!
% 0.48/0.42 % (3122399)------------------------------
% 0.48/0.42 % (3122399)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.48/0.42 % (3122399)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.48/0.42 % (3122399)CaDiCaL version: 2.1.3
% 0.48/0.42 % (3122399)Termination reason: Instruction limit
% 0.48/0.42 % (3122399)Termination phase: shuffling
% 0.48/0.42 % (3122399)Time elapsed: 0.004 s
% 0.48/0.42 % (3122399)Peak memory usage: 10 MB
% 0.48/0.42 % (3122399)Instructions burned: 8 (million)
% 0.48/0.42 % (3122402)lrs+1002_3:1_sil=128000:e2e=on:si=on:urr=on:uwa=one_side_constant:nwc=1.5:random_seed=1355079235:i=38:bd=all:rtra=on:amm=off:ss=axioms:ntd=on_2998 on theBenchmark for (2998ds/38Mi)
% 0.48/0.42 % (3122380)Instruction limit reached!
% 0.48/0.42 % (3122380)------------------------------
% 0.48/0.42 % (3122380)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.48/0.42 % (3122380)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.48/0.42 % (3122380)CaDiCaL version: 2.1.3
% 0.48/0.42 % (3122380)Termination reason: Instruction limit
% 0.48/0.42 % (3122380)Termination phase: Saturation
% 0.48/0.42 % (3122380)Time elapsed: 0.071 s
% 0.48/0.42 % (3122380)Peak memory usage: 14 MB
% 0.48/0.42 % (3122380)Instructions burned: 157 (million)
% 0.48/0.42 % (3122403) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3122369-3122403"...
% 0.48/0.42 % (3122403)...printing done.
% 0.48/0.42 % (3122403)Refutation found. Thanks to Tanya!
% 0.48/0.42 % SZS status Theorem for theBenchmark
% 0.48/0.42 % SZS output start Proof for theBenchmark
% See solution above
% 0.48/0.42 % (3122403)------------------------------
% 0.48/0.42 % (3122403)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.48/0.42 % (3122403)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.48/0.42 % (3122403)CaDiCaL version: 2.1.3
% 0.48/0.42 % (3122403)Termination reason: Refutation
% 0.48/0.42 % (3122403)Time elapsed: 0.018 s
% 0.48/0.42 % (3122403)Peak memory usage: 13 MB
% 0.48/0.42 % (3122403)Instructions burned: 74 (million)
% 0.48/0.42 % (3122369)Success in time 0.134 s
% 0.48/0.42 % Vampire exiting
%------------------------------------------------------------------------------