%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ITP067^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 : 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:08:11 AM UTC 2026
% Result : Theorem 1.43s 0.48s
% Output : Refutation 1.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 27
% Syntax : Number of formulae : 179 ( 53 unt; 0 typ; 17 def)
% Number of atoms : 817 ( 252 equ; 0 cnn)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 2673 ( 182 ~; 201 |; 29 &;2207 @)
% ( 18 <=>; 36 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 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 : 185 ( 182 usr; 31 con; 0-4 aty)
% Number of variables : 191 ( 0 sgn 191 !; 0 ?; 191 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
multiset_a: $tType ).
thf(type_def_6,type,
tree_a: $tType ).
thf(type_def_7,type,
set_a: $tType ).
thf(type_def_8,type,
a: $tType ).
thf(type_def_9,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
minus_1649712171iset_a: multiset_a > multiset_a > multiset_a ).
thf(func_def_1,type,
minus_minus_set_a: set_a > set_a > set_a ).
thf(func_def_2,type,
plus_plus_multiset_a: multiset_a > multiset_a > multiset_a ).
thf(func_def_3,type,
zero_zero_multiset_a: multiset_a ).
thf(func_def_4,type,
heapIm1140443833left_a: tree_a > tree_a ).
thf(func_def_5,type,
heapIm1257206334ight_a: tree_a > tree_a ).
thf(func_def_6,type,
heapIm1091024090Down_a: tree_a > tree_a ).
thf(func_def_7,type,
e_a: tree_a ).
thf(func_def_8,type,
t_a: a > tree_a > tree_a > tree_a ).
thf(func_def_9,type,
pred_Tree_a: ( a > $o ) > tree_a > $o ).
thf(func_def_10,type,
set_Tree_a: tree_a > set_a ).
thf(func_def_11,type,
in_tree_a: a > tree_a > $o ).
thf(func_def_12,type,
is_heap_a: tree_a > $o ).
thf(func_def_13,type,
multiset_a2: tree_a > multiset_a ).
thf(func_def_14,type,
val_a: tree_a > a ).
thf(func_def_15,type,
lattic146396397_Max_a: set_a > a ).
thf(func_def_16,type,
add_mset_a: a > multiset_a > multiset_a ).
thf(func_def_17,type,
set_mset_a: multiset_a > set_a ).
thf(func_def_18,type,
bot_bot_a_o: a > $o ).
thf(func_def_19,type,
bot_bot_set_a: set_a ).
thf(func_def_20,type,
ord_less_eq_o_o_a: ( $o > $o > a ) > ( $o > $o > a ) > $o ).
thf(func_def_21,type,
ord_less_eq_o_a: ( $o > a ) > ( $o > a ) > $o ).
thf(func_def_22,type,
ord_less_eq_Tree_a_o: ( tree_a > $o ) > ( tree_a > $o ) > $o ).
thf(func_def_23,type,
ord_less_eq_a_o: ( a > $o ) > ( a > $o ) > $o ).
thf(func_def_24,type,
ord_le1199012836iset_a: multiset_a > multiset_a > $o ).
thf(func_def_25,type,
ord_less_eq_set_a: set_a > set_a > $o ).
thf(func_def_26,type,
ord_less_eq_a: a > a > $o ).
thf(func_def_27,type,
order_Greatest_o_a: ( ( $o > a ) > $o ) > $o > a ).
thf(func_def_28,type,
order_Greatest_a: ( a > $o ) > a ).
thf(func_def_29,type,
ball_a: set_a > ( a > $o ) > $o ).
thf(func_def_30,type,
collect_a: ( a > $o ) > set_a ).
thf(func_def_31,type,
insert_a: a > set_a > set_a ).
thf(func_def_32,type,
is_singleton_a: set_a > $o ).
thf(func_def_33,type,
member_a: a > set_a > $o ).
thf(func_def_34,type,
l1: tree_a ).
thf(func_def_35,type,
l2: tree_a ).
thf(func_def_36,type,
r1: tree_a ).
thf(func_def_37,type,
r2: tree_a ).
thf(func_def_38,type,
t: tree_a ).
thf(func_def_39,type,
v: a ).
thf(func_def_40,type,
v1: a ).
thf(func_def_41,type,
v2: a ).
thf(func_def_42,type,
v3: a ).
thf(func_def_46,type,
vAND: $o > $o > $o ).
thf(func_def_47,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_48,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_49,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_50,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_51,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_52,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_53,type,
vIMP: $o > $o > $o ).
thf(func_def_54,type,
sP0: a > a > a > $o ).
thf(func_def_55,type,
sP1: a > a > a > $o ).
thf(func_def_56,type,
sK2: ( a > $o > a ) > a ).
thf(func_def_57,type,
sK3: ( a > $o > a ) > a ).
thf(func_def_58,type,
sK4: ( multiset_a > $o ) > multiset_a ).
thf(func_def_59,type,
sK5: ( multiset_a > $o ) > a ).
thf(func_def_60,type,
sK6: ( ( $o > a ) > $o > a ) > $o > a ).
thf(func_def_61,type,
sK7: ( ( $o > a ) > $o > a ) > $o > a ).
thf(func_def_62,type,
sK8: ( a > a ) > a ).
thf(func_def_63,type,
sK9: ( a > a ) > a ).
thf(func_def_64,type,
sK10: set_a > a ).
thf(func_def_65,type,
sK11: ( multiset_a > $o ) > multiset_a ).
thf(func_def_66,type,
sK12: ( multiset_a > $o ) > a ).
thf(func_def_67,type,
sK13: ( ( $o > a ) > a ) > $o > a ).
thf(func_def_68,type,
sK14: ( ( $o > a ) > a ) > $o > a ).
thf(func_def_69,type,
sK15: ( ( $o > a ) > a ) > $o > a ).
thf(func_def_70,type,
sK16: ( ( $o > a ) > a ) > $o > a ).
thf(func_def_71,type,
sK17: ( ( $o > a ) > $o > a ) > $o > a ).
thf(func_def_72,type,
sK18: ( ( $o > a ) > $o > a ) > $o > a ).
thf(func_def_73,type,
sK19: ( $o > a ) > ( ( $o > a ) > $o ) > $o > a ).
thf(func_def_74,type,
sK20: set_a > a ).
thf(func_def_75,type,
sK21: ( ( $o > a ) > a ) > $o > a ).
thf(func_def_76,type,
sK22: ( ( $o > a ) > a ) > $o > a ).
thf(func_def_77,type,
sK23: ( a > $o > a ) > a ).
thf(func_def_78,type,
sK24: ( a > $o > a ) > a ).
thf(func_def_79,type,
sK25: ( a > a ) > a ).
thf(func_def_80,type,
sK26: ( a > a ) > a ).
thf(func_def_81,type,
sK27: set_a > a > set_a ).
thf(func_def_82,type,
sK28: set_a > a > set_a ).
thf(func_def_83,type,
sK29: ( $o > a ) > ( $o > a ) > $o ).
thf(func_def_84,type,
sK30: ( ( $o > a ) > a ) > $o > a ).
thf(func_def_85,type,
sK31: ( ( $o > a ) > a ) > $o > a ).
thf(func_def_86,type,
sK32: tree_a > a > a ).
thf(func_def_87,type,
sK33: tree_a > a > tree_a ).
thf(func_def_88,type,
sK34: tree_a > a > tree_a ).
thf(func_def_89,type,
sK35: tree_a > a > a ).
thf(func_def_90,type,
sK36: tree_a > a > tree_a ).
thf(func_def_91,type,
sK37: tree_a > a > tree_a ).
thf(func_def_92,type,
sK38: tree_a > a > tree_a ).
thf(func_def_93,type,
sK39: tree_a > a > tree_a ).
thf(func_def_94,type,
sK40: ( a > a > $o ) > a ).
thf(func_def_95,type,
sK41: ( a > a > $o ) > a ).
thf(func_def_96,type,
sK42: ( a > a > $o ) > a ).
thf(func_def_97,type,
sK43: ( a > a > $o ) > a ).
thf(func_def_98,type,
sK44: set_a > a > set_a > a > set_a ).
thf(func_def_99,type,
sK45: ( a > a ) > a ).
thf(func_def_100,type,
sK46: ( a > a ) > a ).
thf(func_def_101,type,
sK47: tree_a > tree_a ).
thf(func_def_102,type,
sK48: tree_a > a ).
thf(func_def_103,type,
sK49: tree_a > a ).
thf(func_def_104,type,
sK50: tree_a > tree_a ).
thf(func_def_105,type,
sK51: tree_a > tree_a ).
thf(func_def_106,type,
sK52: tree_a > a ).
thf(func_def_107,type,
sK53: tree_a > a ).
thf(func_def_108,type,
sK54: tree_a > tree_a ).
thf(func_def_109,type,
sK55: tree_a > a ).
thf(func_def_110,type,
sK56: tree_a > tree_a ).
thf(func_def_111,type,
sK57: tree_a > tree_a ).
thf(func_def_112,type,
sK58: tree_a > tree_a ).
thf(func_def_113,type,
sK59: tree_a > a ).
thf(func_def_114,type,
sK60: tree_a > a ).
thf(func_def_115,type,
sK61: tree_a > a ).
thf(func_def_116,type,
sK62: tree_a > tree_a ).
thf(func_def_117,type,
sK63: set_a > ( a > $o ) > a ).
thf(func_def_118,type,
sK64: ( a > $o ) > set_a > ( a > $o ) > a ).
thf(func_def_119,type,
sK65: ( tree_a > $o ) > tree_a ).
thf(func_def_120,type,
sK66: ( tree_a > $o ) > a ).
thf(func_def_121,type,
sK67: ( tree_a > $o ) > tree_a ).
thf(func_def_122,type,
sK68: tree_a > ( a > $o ) > ( a > $o ) > a ).
thf(func_def_123,type,
sK69: tree_a > tree_a ).
thf(func_def_124,type,
sK70: tree_a > tree_a ).
thf(func_def_125,type,
sK71: tree_a > a ).
thf(func_def_126,type,
sK72: tree_a > a ).
thf(func_def_127,type,
sK73: tree_a > a ).
thf(func_def_128,type,
sK74: tree_a > tree_a ).
thf(func_def_129,type,
sK75: tree_a > tree_a ).
thf(func_def_130,type,
sK76: tree_a > tree_a ).
thf(func_def_131,type,
sK77: tree_a > tree_a ).
thf(func_def_132,type,
sK78: tree_a > a ).
thf(func_def_133,type,
sK79: tree_a > a ).
thf(func_def_134,type,
sK80: tree_a > a ).
thf(func_def_135,type,
sK81: tree_a > a ).
thf(func_def_136,type,
sK82: tree_a > tree_a ).
thf(func_def_137,type,
sK83: tree_a > tree_a ).
thf(func_def_138,type,
sK84: tree_a > a ).
thf(func_def_139,type,
sK85: set_a > a ).
thf(func_def_140,type,
sK86: set_a > a ).
thf(func_def_141,type,
sK87: set_a > a ).
thf(func_def_142,type,
sK88: tree_a > ( a > $o ) > ( a > $o ) > a ).
thf(func_def_143,type,
sK89: ( a > $o ) > ( a > $o ) > a ).
thf(func_def_144,type,
sK90: a > ( a > $o ) > a ).
thf(func_def_145,type,
sK91: a > tree_a > tree_a ).
thf(func_def_146,type,
sK92: a > tree_a > tree_a ).
thf(func_def_147,type,
sK93: a > tree_a > a ).
thf(func_def_148,type,
sK94: ( a > $o ) > a > a ).
thf(func_def_149,type,
sK95: ( a > $o > a ) > a ).
thf(func_def_150,type,
sK96: ( a > $o > a ) > a ).
thf(func_def_151,type,
sK97: set_a > set_a > a ).
thf(func_def_152,type,
sK98: ( ( $o > a ) > $o > a ) > $o > a ).
thf(func_def_153,type,
sK99: ( ( $o > a ) > $o > a ) > $o > a ).
thf(func_def_154,type,
sK100: ( ( $o > a ) > $o > a ) > $o > a ).
thf(func_def_155,type,
sK101: ( ( $o > a ) > $o > a ) > $o > a ).
thf(func_def_156,type,
sK102: tree_a > tree_a ).
thf(func_def_157,type,
sK103: tree_a > tree_a ).
thf(func_def_158,type,
sK104: tree_a > a ).
thf(func_def_159,type,
sK105: ( a > $o > a ) > a ).
thf(func_def_160,type,
sK106: ( a > $o > a ) > a ).
thf(func_def_161,type,
sK107: ( a > a ) > a ).
thf(func_def_162,type,
sK108: ( a > a ) > a ).
thf(func_def_163,type,
sK109: ( $o > a ) > ( ( $o > a ) > $o ) > $o > a ).
thf(func_def_164,type,
sK110: ( ( $o > a ) > $o ) > ( ( $o > a ) > $o ) > $o > a ).
thf(func_def_165,type,
sK111: set_a > a ).
thf(func_def_166,type,
vNOT: $o > $o ).
thf(f1,axiom,
~ ( ( v = v1 )
| ( v = v3 )
| ( v = v2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_False) ).
thf(f3,axiom,
ord_less_eq_a @ v2 @ v1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2_True) ).
thf(f4,axiom,
in_tree_a @ v @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3__C5__1_Oprems_C) ).
thf(f6,axiom,
! [X2: tree_a,X0: a,X1: a,X3: tree_a] :
( ( in_tree_a @ X0 @ X3 )
| ( in_tree_a @ X0 @ X2 )
| ( ( X0 = X1 )
= ( in_tree_a @ X0 @ ( t_a @ X1 @ X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_5_in__tree_Osimps_I2_J) ).
thf(f8,axiom,
( ( ord_less_eq_a @ ( val_a @ ( t_a @ v2 @ l2 @ r2 ) ) @ ( val_a @ ( t_a @ v1 @ l1 @ r1 ) ) )
=> ( ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ v3 )
=> ( ( in_tree_a @ v @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ ( heapIm1140443833left_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) ) )
=> ( in_tree_a @ v @ ( t_a @ v3 @ ( heapIm1140443833left_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_7__C5__1_Ohyps_C_I1_J) ).
thf(f9,axiom,
! [X2: tree_a,X1: tree_a,X0: a] :
( ( heapIm1140443833left_a @ ( t_a @ X0 @ X1 @ X2 ) )
= X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_8_left_Osimps) ).
thf(f10,axiom,
! [X1: tree_a,X0: a,X2: tree_a] :
( ( heapIm1257206334ight_a @ ( t_a @ X0 @ X1 @ X2 ) )
= X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_9_right_Osimps) ).
thf(f16,axiom,
! [X0: a,X1: tree_a,X2: tree_a,X4: tree_a,X6: a,X3: a,X5: tree_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 @ ( 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 ) ) @ 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 ) ) @ ( 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_15_siftDown_Osimps_I6_J) ).
thf(f30,axiom,
! [X2: tree_a,X1: tree_a,X0: a] :
( ( val_a @ ( t_a @ X0 @ X1 @ X2 ) )
= X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_29_val_Osimps) ).
thf(f169,conjecture,
in_tree_a @ v @ ( t_a @ v3 @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(f170,negated_conjecture,
~ ( in_tree_a @ v @ ( t_a @ v3 @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ),
inference(negated_conjecture,[status(cth)],[f169]) ).
thf(f248,plain,
! [X0: tree_a,X1: a,X2: a,X3: tree_a] :
( ( in_tree_a @ X1 @ X3 )
| ( in_tree_a @ X1 @ X0 )
| ( ( X1 = X2 )
= ( in_tree_a @ X1 @ ( t_a @ X2 @ X0 @ X3 ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f249,plain,
! [X3: tree_a,X0: tree_a,X1: a,X2: a] :
( ( $true
= ( in_tree_a @ X1 @ ( t_a @ X2 @ X0 @ X3 ) ) )
<=> ( ( $true
= ( in_tree_a @ X1 @ X0 ) )
| ( X1 = X2 )
| ( $true
= ( in_tree_a @ X1 @ X3 ) ) ) ),
inference(fool_elimination,[],[f248]) ).
thf(f258,plain,
in_tree_a @ v @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ),
inference(rectify,[],[f4]) ).
thf(f259,plain,
( ( in_tree_a @ v @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) )
= $true ),
inference(fool_elimination,[],[f258]) ).
thf(f274,plain,
! [X0: a,X1: tree_a,X2: tree_a,X3: tree_a,X4: a,X5: a,X6: tree_a] :
( ( ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ ( val_a @ ( t_a @ X5 @ X3 @ X6 ) ) )
=> ( ( ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ X4 )
=> ( ( t_a @ ( val_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ ( t_a @ X5 @ X3 @ X6 ) @ ( heapIm1091024090Down_a @ ( t_a @ X4 @ ( heapIm1140443833left_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X0 @ X1 @ X2 ) ) ) ) )
= ( heapIm1091024090Down_a @ ( t_a @ X4 @ ( t_a @ X5 @ X3 @ X6 ) @ ( t_a @ X0 @ X1 @ X2 ) ) ) ) )
& ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ X4 )
=> ( ( heapIm1091024090Down_a @ ( t_a @ X4 @ ( t_a @ X5 @ X3 @ X6 ) @ ( t_a @ X0 @ X1 @ X2 ) ) )
= ( t_a @ X4 @ ( t_a @ X5 @ X3 @ X6 ) @ ( t_a @ X0 @ X1 @ X2 ) ) ) ) ) )
& ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ ( val_a @ ( t_a @ X5 @ X3 @ X6 ) ) )
=> ( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ X5 @ X3 @ X6 ) ) @ X4 )
=> ( ( heapIm1091024090Down_a @ ( t_a @ X4 @ ( t_a @ X5 @ X3 @ X6 ) @ ( t_a @ X0 @ X1 @ X2 ) ) )
= ( t_a @ X4 @ ( t_a @ X5 @ X3 @ X6 ) @ ( t_a @ X0 @ X1 @ X2 ) ) ) )
& ( ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ X5 @ X3 @ X6 ) ) @ X4 )
=> ( ( t_a @ ( val_a @ ( t_a @ X5 @ X3 @ X6 ) ) @ ( heapIm1091024090Down_a @ ( t_a @ X4 @ ( heapIm1140443833left_a @ ( t_a @ X5 @ X3 @ X6 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X5 @ X3 @ X6 ) ) ) ) @ ( t_a @ X0 @ X1 @ X2 ) )
= ( heapIm1091024090Down_a @ ( t_a @ X4 @ ( t_a @ X5 @ X3 @ X6 ) @ ( t_a @ X0 @ X1 @ X2 ) ) ) ) ) ) ) ),
inference(rectify,[],[f16]) ).
thf(f275,plain,
! [X0: a,X1: tree_a,X2: tree_a,X3: tree_a,X4: a,X5: a,X6: tree_a] :
( ( ( $true
!= ( ord_less_eq_a @ ( val_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ ( val_a @ ( t_a @ X5 @ X3 @ X6 ) ) ) )
=> ( ( ( $true
!= ( ord_less_eq_a @ ( val_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ X4 ) )
=> ( ( t_a @ ( val_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ ( t_a @ X5 @ X3 @ X6 ) @ ( heapIm1091024090Down_a @ ( t_a @ X4 @ ( heapIm1140443833left_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X0 @ X1 @ X2 ) ) ) ) )
= ( heapIm1091024090Down_a @ ( t_a @ X4 @ ( t_a @ X5 @ X3 @ X6 ) @ ( t_a @ X0 @ X1 @ X2 ) ) ) ) )
& ( ( $true
= ( ord_less_eq_a @ ( val_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ X4 ) )
=> ( ( heapIm1091024090Down_a @ ( t_a @ X4 @ ( t_a @ X5 @ X3 @ X6 ) @ ( t_a @ X0 @ X1 @ X2 ) ) )
= ( t_a @ X4 @ ( t_a @ X5 @ X3 @ X6 ) @ ( t_a @ X0 @ X1 @ X2 ) ) ) ) ) )
& ( ( $true
= ( ord_less_eq_a @ ( val_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ ( val_a @ ( t_a @ X5 @ X3 @ X6 ) ) ) )
=> ( ( ( $true
= ( ord_less_eq_a @ ( val_a @ ( t_a @ X5 @ X3 @ X6 ) ) @ X4 ) )
=> ( ( heapIm1091024090Down_a @ ( t_a @ X4 @ ( t_a @ X5 @ X3 @ X6 ) @ ( t_a @ X0 @ X1 @ X2 ) ) )
= ( t_a @ X4 @ ( t_a @ X5 @ X3 @ X6 ) @ ( t_a @ X0 @ X1 @ X2 ) ) ) )
& ( ( $true
!= ( ord_less_eq_a @ ( val_a @ ( t_a @ X5 @ X3 @ X6 ) ) @ X4 ) )
=> ( ( t_a @ ( val_a @ ( t_a @ X5 @ X3 @ X6 ) ) @ ( heapIm1091024090Down_a @ ( t_a @ X4 @ ( heapIm1140443833left_a @ ( t_a @ X5 @ X3 @ X6 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X5 @ X3 @ X6 ) ) ) ) @ ( t_a @ X0 @ X1 @ X2 ) )
= ( heapIm1091024090Down_a @ ( t_a @ X4 @ ( t_a @ X5 @ X3 @ X6 ) @ ( t_a @ X0 @ X1 @ X2 ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f274]) ).
thf(f371,plain,
( ( ord_less_eq_a @ ( val_a @ ( t_a @ v2 @ l2 @ r2 ) ) @ ( val_a @ ( t_a @ v1 @ l1 @ r1 ) ) )
=> ( ~ ( ord_less_eq_a @ ( val_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ v3 )
=> ( ( in_tree_a @ v @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ ( heapIm1140443833left_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) ) )
=> ( in_tree_a @ v @ ( t_a @ v3 @ ( heapIm1140443833left_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f372,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 ) ) @ v3 )
!= $true )
=> ( ( ( in_tree_a @ v @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ ( heapIm1140443833left_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) ) )
= $true )
=> ( ( in_tree_a @ v @ ( t_a @ v3 @ ( heapIm1140443833left_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) )
= $true ) ) ) ),
inference(fool_elimination,[],[f371]) ).
thf(f391,plain,
~ ( in_tree_a @ v @ ( t_a @ v3 @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ),
inference(rectify,[],[f170]) ).
thf(f392,plain,
( ( in_tree_a @ v @ ( t_a @ v3 @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) )
!= $true ),
inference(fool_elimination,[],[f391]) ).
thf(f393,plain,
ord_less_eq_a @ v2 @ v1,
inference(rectify,[],[f3]) ).
thf(f394,plain,
( ( ord_less_eq_a @ v2 @ v1 )
= $true ),
inference(fool_elimination,[],[f393]) ).
thf(f483,plain,
! [X0: a,X3: tree_a,X6: tree_a,X5: a,X4: a,X2: tree_a,X1: tree_a] :
( ( ( $true
!= ( ord_less_eq_a @ ( val_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ ( val_a @ ( t_a @ X5 @ X3 @ X6 ) ) ) )
=> ( ( ( $true
= ( ord_less_eq_a @ ( val_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ X4 ) )
=> ( ( heapIm1091024090Down_a @ ( t_a @ X4 @ ( t_a @ X5 @ X3 @ X6 ) @ ( t_a @ X0 @ X1 @ X2 ) ) )
= ( t_a @ X4 @ ( t_a @ X5 @ X3 @ X6 ) @ ( t_a @ X0 @ X1 @ X2 ) ) ) )
& ( ( $true
!= ( ord_less_eq_a @ ( val_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ X4 ) )
=> ( ( t_a @ ( val_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ ( t_a @ X5 @ X3 @ X6 ) @ ( heapIm1091024090Down_a @ ( t_a @ X4 @ ( heapIm1140443833left_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X0 @ X1 @ X2 ) ) ) ) )
= ( heapIm1091024090Down_a @ ( t_a @ X4 @ ( t_a @ X5 @ X3 @ X6 ) @ ( t_a @ X0 @ X1 @ X2 ) ) ) ) ) ) )
& ( ( $true
= ( ord_less_eq_a @ ( val_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ ( val_a @ ( t_a @ X5 @ X3 @ X6 ) ) ) )
=> ( ( ( $true
= ( ord_less_eq_a @ ( val_a @ ( t_a @ X5 @ X3 @ X6 ) ) @ X4 ) )
=> ( ( heapIm1091024090Down_a @ ( t_a @ X4 @ ( t_a @ X5 @ X3 @ X6 ) @ ( t_a @ X0 @ X1 @ X2 ) ) )
= ( t_a @ X4 @ ( t_a @ X5 @ X3 @ X6 ) @ ( t_a @ X0 @ X1 @ X2 ) ) ) )
& ( ( $true
!= ( ord_less_eq_a @ ( val_a @ ( t_a @ X5 @ X3 @ X6 ) ) @ X4 ) )
=> ( ( t_a @ ( val_a @ ( t_a @ X5 @ X3 @ X6 ) ) @ ( heapIm1091024090Down_a @ ( t_a @ X4 @ ( heapIm1140443833left_a @ ( t_a @ X5 @ X3 @ X6 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X5 @ X3 @ X6 ) ) ) ) @ ( t_a @ X0 @ X1 @ X2 ) )
= ( heapIm1091024090Down_a @ ( t_a @ X4 @ ( t_a @ X5 @ X3 @ X6 ) @ ( t_a @ X0 @ X1 @ X2 ) ) ) ) ) ) ) ),
inference(flattening,[],[f275]) ).
thf(f484,plain,
! [X1: tree_a,X2: a,X0: tree_a] :
( ( heapIm1140443833left_a @ ( t_a @ X2 @ X1 @ X0 ) )
= X1 ),
inference(rectify,[],[f9]) ).
thf(f495,plain,
! [X2: tree_a,X0: tree_a,X1: a] :
( ( heapIm1257206334ight_a @ ( t_a @ X1 @ X0 @ X2 ) )
= X2 ),
inference(rectify,[],[f10]) ).
thf(f496,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 ) ) @ v3 )
!= $true )
=> ( ( ( in_tree_a @ v @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ ( heapIm1140443833left_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) ) )
= $true )
=> ( ( in_tree_a @ v @ ( t_a @ v3 @ ( heapIm1140443833left_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) )
= $true ) ) ) ),
inference(flattening,[],[f372]) ).
thf(f499,plain,
( ( in_tree_a @ v @ ( t_a @ v3 @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) )
!= $true ),
inference(flattening,[],[f392]) ).
thf(f506,plain,
! [X1: tree_a,X0: tree_a,X2: a] :
( ( val_a @ ( t_a @ X2 @ X1 @ X0 ) )
= X2 ),
inference(rectify,[],[f30]) ).
thf(f532,plain,
( ( v != v2 )
& ( v != v3 )
& ( v != v1 ) ),
inference(ennf_transformation,[],[f1]) ).
thf(f637,plain,
( ( ( in_tree_a @ v @ ( t_a @ v3 @ ( heapIm1140443833left_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) )
= $true )
| ( ( in_tree_a @ v @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ ( heapIm1140443833left_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) ) )
!= $true )
| ( ( ord_less_eq_a @ ( val_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ v3 )
= $true )
| ( ( ord_less_eq_a @ ( val_a @ ( t_a @ v2 @ l2 @ r2 ) ) @ ( val_a @ ( t_a @ v1 @ l1 @ r1 ) ) )
!= $true ) ),
inference(ennf_transformation,[],[f496]) ).
thf(f638,plain,
( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ v2 @ l2 @ r2 ) ) @ ( val_a @ ( t_a @ v1 @ l1 @ r1 ) ) )
!= $true )
| ( ( in_tree_a @ v @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ ( heapIm1140443833left_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) ) )
!= $true )
| ( ( in_tree_a @ v @ ( t_a @ v3 @ ( heapIm1140443833left_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) )
= $true )
| ( ( ord_less_eq_a @ ( val_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ v3 )
= $true ) ),
inference(flattening,[],[f637]) ).
thf(f656,plain,
! [X2: tree_a,X0: a,X3: tree_a,X1: tree_a,X6: tree_a,X4: a,X5: a] :
( ( ( ( ( $true
= ( ord_less_eq_a @ ( val_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ X4 ) )
| ( ( t_a @ ( val_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ ( t_a @ X5 @ X3 @ X6 ) @ ( heapIm1091024090Down_a @ ( t_a @ X4 @ ( heapIm1140443833left_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X0 @ X1 @ X2 ) ) ) ) )
= ( heapIm1091024090Down_a @ ( t_a @ X4 @ ( t_a @ X5 @ X3 @ X6 ) @ ( t_a @ X0 @ X1 @ X2 ) ) ) ) )
& ( ( $true
!= ( ord_less_eq_a @ ( val_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ X4 ) )
| ( ( heapIm1091024090Down_a @ ( t_a @ X4 @ ( t_a @ X5 @ X3 @ X6 ) @ ( t_a @ X0 @ X1 @ X2 ) ) )
= ( t_a @ X4 @ ( t_a @ X5 @ X3 @ X6 ) @ ( t_a @ X0 @ X1 @ X2 ) ) ) ) )
| ( $true
= ( ord_less_eq_a @ ( val_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ ( val_a @ ( t_a @ X5 @ X3 @ X6 ) ) ) ) )
& ( ( $true
!= ( ord_less_eq_a @ ( val_a @ ( t_a @ X0 @ X1 @ X2 ) ) @ ( val_a @ ( t_a @ X5 @ X3 @ X6 ) ) ) )
| ( ( ( ( t_a @ ( val_a @ ( t_a @ X5 @ X3 @ X6 ) ) @ ( heapIm1091024090Down_a @ ( t_a @ X4 @ ( heapIm1140443833left_a @ ( t_a @ X5 @ X3 @ X6 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X5 @ X3 @ X6 ) ) ) ) @ ( t_a @ X0 @ X1 @ X2 ) )
= ( heapIm1091024090Down_a @ ( t_a @ X4 @ ( t_a @ X5 @ X3 @ X6 ) @ ( t_a @ X0 @ X1 @ X2 ) ) ) )
| ( $true
= ( ord_less_eq_a @ ( val_a @ ( t_a @ X5 @ X3 @ X6 ) ) @ X4 ) ) )
& ( ( $true
!= ( ord_less_eq_a @ ( val_a @ ( t_a @ X5 @ X3 @ X6 ) ) @ X4 ) )
| ( ( heapIm1091024090Down_a @ ( t_a @ X4 @ ( t_a @ X5 @ X3 @ X6 ) @ ( t_a @ X0 @ X1 @ X2 ) ) )
= ( t_a @ X4 @ ( t_a @ X5 @ X3 @ X6 ) @ ( t_a @ X0 @ X1 @ X2 ) ) ) ) ) ) ),
inference(ennf_transformation,[],[f483]) ).
thf(f702,plain,
! [X0: tree_a,X1: a,X2: tree_a] :
( ( heapIm1140443833left_a @ ( t_a @ X1 @ X0 @ X2 ) )
= X0 ),
inference(rectify,[],[f484]) ).
thf(f775,plain,
! [X3: tree_a,X0: tree_a,X1: a,X2: a] :
( ( ( $true
= ( in_tree_a @ X1 @ ( t_a @ X2 @ X0 @ X3 ) ) )
| ( ( $true
!= ( in_tree_a @ X1 @ X0 ) )
& ( X1 != X2 )
& ( $true
!= ( in_tree_a @ X1 @ X3 ) ) ) )
& ( ( $true
= ( in_tree_a @ X1 @ X0 ) )
| ( X1 = X2 )
| ( $true
= ( in_tree_a @ X1 @ X3 ) )
| ( $true
!= ( in_tree_a @ X1 @ ( t_a @ X2 @ X0 @ X3 ) ) ) ) ),
inference(nnf_transformation,[],[f249]) ).
thf(f776,plain,
! [X3: tree_a,X0: tree_a,X1: a,X2: a] :
( ( ( $true
= ( in_tree_a @ X1 @ ( t_a @ X2 @ X0 @ X3 ) ) )
| ( ( $true
!= ( in_tree_a @ X1 @ X0 ) )
& ( X1 != X2 )
& ( $true
!= ( in_tree_a @ X1 @ X3 ) ) ) )
& ( ( $true
= ( in_tree_a @ X1 @ X0 ) )
| ( X1 = X2 )
| ( $true
= ( in_tree_a @ X1 @ X3 ) )
| ( $true
!= ( in_tree_a @ X1 @ ( t_a @ X2 @ X0 @ X3 ) ) ) ) ),
inference(flattening,[],[f775]) ).
thf(f777,plain,
! [X0: tree_a,X1: tree_a,X2: a,X3: a] :
( ( ( $true
= ( in_tree_a @ X2 @ ( t_a @ X3 @ X1 @ X0 ) ) )
| ( ( $true
!= ( in_tree_a @ X2 @ X1 ) )
& ( X2 != X3 )
& ( $true
!= ( in_tree_a @ X2 @ X0 ) ) ) )
& ( ( $true
= ( in_tree_a @ X2 @ X1 ) )
| ( X2 = X3 )
| ( $true
= ( in_tree_a @ X2 @ X0 ) )
| ( $true
!= ( in_tree_a @ X2 @ ( t_a @ X3 @ X1 @ X0 ) ) ) ) ),
inference(rectify,[],[f776]) ).
thf(f815,plain,
! [X0: tree_a,X1: a,X2: tree_a,X3: tree_a,X4: tree_a,X5: a,X6: a] :
( ( ( ( ( $true
= ( ord_less_eq_a @ ( val_a @ ( t_a @ X1 @ X3 @ X0 ) ) @ X5 ) )
| ( ( heapIm1091024090Down_a @ ( t_a @ X5 @ ( t_a @ X6 @ X2 @ X4 ) @ ( t_a @ X1 @ X3 @ X0 ) ) )
= ( t_a @ ( val_a @ ( t_a @ X1 @ X3 @ X0 ) ) @ ( t_a @ X6 @ X2 @ X4 ) @ ( heapIm1091024090Down_a @ ( t_a @ X5 @ ( heapIm1140443833left_a @ ( t_a @ X1 @ X3 @ X0 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X1 @ X3 @ X0 ) ) ) ) ) ) )
& ( ( $true
!= ( ord_less_eq_a @ ( val_a @ ( t_a @ X1 @ X3 @ X0 ) ) @ X5 ) )
| ( ( heapIm1091024090Down_a @ ( t_a @ X5 @ ( t_a @ X6 @ X2 @ X4 ) @ ( t_a @ X1 @ X3 @ X0 ) ) )
= ( t_a @ X5 @ ( t_a @ X6 @ X2 @ X4 ) @ ( t_a @ X1 @ X3 @ X0 ) ) ) ) )
| ( $true
= ( ord_less_eq_a @ ( val_a @ ( t_a @ X1 @ X3 @ X0 ) ) @ ( val_a @ ( t_a @ X6 @ X2 @ X4 ) ) ) ) )
& ( ( $true
!= ( ord_less_eq_a @ ( val_a @ ( t_a @ X1 @ X3 @ X0 ) ) @ ( val_a @ ( t_a @ X6 @ X2 @ X4 ) ) ) )
| ( ( ( ( heapIm1091024090Down_a @ ( t_a @ X5 @ ( t_a @ X6 @ X2 @ X4 ) @ ( t_a @ X1 @ X3 @ X0 ) ) )
= ( t_a @ ( val_a @ ( t_a @ X6 @ X2 @ X4 ) ) @ ( heapIm1091024090Down_a @ ( t_a @ X5 @ ( heapIm1140443833left_a @ ( t_a @ X6 @ X2 @ X4 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X6 @ X2 @ X4 ) ) ) ) @ ( t_a @ X1 @ X3 @ X0 ) ) )
| ( $true
= ( ord_less_eq_a @ ( val_a @ ( t_a @ X6 @ X2 @ X4 ) ) @ X5 ) ) )
& ( ( $true
!= ( ord_less_eq_a @ ( val_a @ ( t_a @ X6 @ X2 @ X4 ) ) @ X5 ) )
| ( ( heapIm1091024090Down_a @ ( t_a @ X5 @ ( t_a @ X6 @ X2 @ X4 ) @ ( t_a @ X1 @ X3 @ X0 ) ) )
= ( t_a @ X5 @ ( t_a @ X6 @ X2 @ X4 ) @ ( t_a @ X1 @ X3 @ X0 ) ) ) ) ) ) ),
inference(rectify,[],[f656]) ).
thf(f835,plain,
! [X0: tree_a,X1: tree_a,X2: a] :
( ( heapIm1257206334ight_a @ ( t_a @ X2 @ X1 @ X0 ) )
= X0 ),
inference(rectify,[],[f495]) ).
thf(f855,plain,
! [X0: tree_a,X1: tree_a,X2: a] :
( ( val_a @ ( t_a @ X2 @ X0 @ X1 ) )
= X2 ),
inference(rectify,[],[f506]) ).
thf(f874,plain,
( ( in_tree_a @ v @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) )
= $true ),
inference(cnf_transformation,[],[f259]) ).
thf(f886,plain,
! [X2: tree_a,X0: tree_a,X1: a] :
( ( heapIm1140443833left_a @ ( t_a @ X1 @ X0 @ X2 ) )
= X0 ),
inference(cnf_transformation,[],[f702]) ).
thf(f893,plain,
( ( in_tree_a @ v @ ( t_a @ v3 @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) )
!= $true ),
inference(cnf_transformation,[],[f499]) ).
thf(f953,plain,
v != v1,
inference(cnf_transformation,[],[f532]) ).
thf(f954,plain,
v != v3,
inference(cnf_transformation,[],[f532]) ).
thf(f1021,plain,
( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ v2 @ l2 @ r2 ) ) @ ( val_a @ ( t_a @ v1 @ l1 @ r1 ) ) )
!= $true )
| ( ( in_tree_a @ v @ ( t_a @ v3 @ ( heapIm1140443833left_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) )
= $true )
| ( ( ord_less_eq_a @ ( val_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ v3 )
= $true )
| ( ( in_tree_a @ v @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ ( heapIm1140443833left_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) ) )
!= $true ) ),
inference(cnf_transformation,[],[f638]) ).
thf(f1025,plain,
! [X2: a,X3: a,X0: tree_a,X1: tree_a] :
( ( $true
!= ( in_tree_a @ X2 @ ( t_a @ X3 @ X1 @ X0 ) ) )
| ( $true
= ( in_tree_a @ X2 @ X0 ) )
| ( X2 = X3 )
| ( $true
= ( in_tree_a @ X2 @ X1 ) ) ),
inference(cnf_transformation,[],[f777]) ).
thf(f1026,plain,
! [X2: a,X3: a,X0: tree_a,X1: tree_a] :
( ( $true
= ( in_tree_a @ X2 @ ( t_a @ X3 @ X1 @ X0 ) ) )
| ( $true
!= ( in_tree_a @ X2 @ X0 ) ) ),
inference(cnf_transformation,[],[f777]) ).
thf(f1028,plain,
! [X2: a,X3: a,X0: tree_a,X1: tree_a] :
( ( $true
= ( in_tree_a @ X2 @ ( t_a @ X3 @ X1 @ X0 ) ) )
| ( $true
!= ( in_tree_a @ X2 @ X1 ) ) ),
inference(cnf_transformation,[],[f777]) ).
thf(f1068,plain,
( ( ord_less_eq_a @ v2 @ v1 )
= $true ),
inference(cnf_transformation,[],[f394]) ).
thf(f1092,plain,
! [X2: tree_a,X3: tree_a,X0: tree_a,X1: a,X6: a,X4: tree_a,X5: a] :
( ( $true
!= ( ord_less_eq_a @ ( val_a @ ( t_a @ X1 @ X3 @ X0 ) ) @ ( val_a @ ( t_a @ X6 @ X2 @ X4 ) ) ) )
| ( $true
!= ( ord_less_eq_a @ ( val_a @ ( t_a @ X6 @ X2 @ X4 ) ) @ X5 ) )
| ( ( heapIm1091024090Down_a @ ( t_a @ X5 @ ( t_a @ X6 @ X2 @ X4 ) @ ( t_a @ X1 @ X3 @ X0 ) ) )
= ( t_a @ X5 @ ( t_a @ X6 @ X2 @ X4 ) @ ( t_a @ X1 @ X3 @ X0 ) ) ) ),
inference(cnf_transformation,[],[f815]) ).
thf(f1093,plain,
! [X2: tree_a,X3: tree_a,X0: tree_a,X1: a,X6: a,X4: tree_a,X5: a] :
( ( ( heapIm1091024090Down_a @ ( t_a @ X5 @ ( t_a @ X6 @ X2 @ X4 ) @ ( t_a @ X1 @ X3 @ X0 ) ) )
= ( t_a @ ( val_a @ ( t_a @ X6 @ X2 @ X4 ) ) @ ( heapIm1091024090Down_a @ ( t_a @ X5 @ ( heapIm1140443833left_a @ ( t_a @ X6 @ X2 @ X4 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X6 @ X2 @ X4 ) ) ) ) @ ( t_a @ X1 @ X3 @ X0 ) ) )
| ( $true
= ( ord_less_eq_a @ ( val_a @ ( t_a @ X6 @ X2 @ X4 ) ) @ X5 ) )
| ( $true
!= ( ord_less_eq_a @ ( val_a @ ( t_a @ X1 @ X3 @ X0 ) ) @ ( val_a @ ( t_a @ X6 @ X2 @ X4 ) ) ) ) ),
inference(cnf_transformation,[],[f815]) ).
thf(f1131,plain,
! [X2: a,X0: tree_a,X1: tree_a] :
( ( heapIm1257206334ight_a @ ( t_a @ X2 @ X1 @ X0 ) )
= X0 ),
inference(cnf_transformation,[],[f835]) ).
thf(f1159,plain,
! [X2: a,X0: tree_a,X1: tree_a] :
( ( val_a @ ( t_a @ X2 @ X0 @ X1 ) )
= X2 ),
inference(cnf_transformation,[],[f855]) ).
thf(f1262,definition,
( spl112_5
<=> ( ( ord_less_eq_a @ ( val_a @ ( t_a @ v2 @ l2 @ r2 ) ) @ ( val_a @ ( t_a @ v1 @ l1 @ r1 ) ) )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl112_5])],[avatar_definition]) ).
thf(f1263,plain,
( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ v2 @ l2 @ r2 ) ) @ ( val_a @ ( t_a @ v1 @ l1 @ r1 ) ) )
!= $true )
| spl112_5 ),
inference(avatar_component_clause,[],[f1262]) ).
thf(f1267,definition,
( spl112_6
<=> ( v = v1 ) ),
introduced(definition,[new_symbols(definition,[spl112_6])],[avatar_definition]) ).
thf(f1269,plain,
( ( v != v1 )
| spl112_6 ),
inference(avatar_component_clause,[],[f1267]) ).
thf(f1270,plain,
~ spl112_6,
inference(avatar_split_clause,[],[f953,f1267]) ).
thf(f1277,definition,
( spl112_8
<=> ( ( ord_less_eq_a @ ( val_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ v3 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl112_8])],[avatar_definition]) ).
thf(f1279,plain,
( ( ( ord_less_eq_a @ ( val_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ v3 )
= $true )
| ~ spl112_8 ),
inference(avatar_component_clause,[],[f1277]) ).
thf(f1281,definition,
( spl112_9
<=> ( ( in_tree_a @ v @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ ( heapIm1140443833left_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) ) )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl112_9])],[avatar_definition]) ).
thf(f1283,plain,
( ( ( in_tree_a @ v @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ ( heapIm1140443833left_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) ) )
!= $true )
| spl112_9 ),
inference(avatar_component_clause,[],[f1281]) ).
thf(f1285,definition,
( spl112_10
<=> ( ( in_tree_a @ v @ ( t_a @ v3 @ ( heapIm1140443833left_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl112_10])],[avatar_definition]) ).
thf(f1287,plain,
( ( ( in_tree_a @ v @ ( t_a @ v3 @ ( heapIm1140443833left_a @ ( t_a @ v1 @ l1 @ r1 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) )
= $true )
| ~ spl112_10 ),
inference(avatar_component_clause,[],[f1285]) ).
thf(f1288,plain,
( spl112_8
| ~ spl112_5
| ~ spl112_9
| spl112_10 ),
inference(avatar_split_clause,[],[f1021,f1285,f1281,f1262,f1277]) ).
thf(f1330,definition,
( spl112_19
<=> ( v = v3 ) ),
introduced(definition,[new_symbols(definition,[spl112_19])],[avatar_definition]) ).
thf(f1332,plain,
( ( v != v3 )
| spl112_19 ),
inference(avatar_component_clause,[],[f1330]) ).
thf(f1333,plain,
~ spl112_19,
inference(avatar_split_clause,[],[f954,f1330]) ).
thf(f1335,definition,
( spl112_20
<=> ( ( in_tree_a @ v @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl112_20])],[avatar_definition]) ).
thf(f1337,plain,
( ( ( in_tree_a @ v @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) )
= $true )
| ~ spl112_20 ),
inference(avatar_component_clause,[],[f1335]) ).
thf(f1338,plain,
spl112_20,
inference(avatar_split_clause,[],[f874,f1335]) ).
thf(f1355,definition,
( spl112_24
<=> ( ( ord_less_eq_a @ v2 @ v1 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl112_24])],[avatar_definition]) ).
thf(f1357,plain,
( ( ( ord_less_eq_a @ v2 @ v1 )
= $true )
| ~ spl112_24 ),
inference(avatar_component_clause,[],[f1355]) ).
thf(f1358,plain,
spl112_24,
inference(avatar_split_clause,[],[f1068,f1355]) ).
thf(f1365,definition,
( spl112_26
<=> ( ( in_tree_a @ v @ ( t_a @ v3 @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl112_26])],[avatar_definition]) ).
thf(f1367,plain,
( ( ( in_tree_a @ v @ ( t_a @ v3 @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) )
!= $true )
| spl112_26 ),
inference(avatar_component_clause,[],[f1365]) ).
thf(f1368,plain,
~ spl112_26,
inference(avatar_split_clause,[],[f893,f1365]) ).
thf(f1449,plain,
( ( $true != $true )
| ( $true
!= ( in_tree_a @ v @ ( t_a @ v2 @ l2 @ r2 ) ) )
| spl112_26 ),
inference(superposition,[],[f1367,f1026]) ).
thf(f1450,plain,
( ( $true
!= ( in_tree_a @ v @ ( t_a @ v2 @ l2 @ r2 ) ) )
| spl112_26 ),
inference(trivial_inequality_removal,[],[f1449]) ).
thf(f1452,definition,
( spl112_34
<=> ( $true
= ( in_tree_a @ v @ ( t_a @ v2 @ l2 @ r2 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl112_34])],[avatar_definition]) ).
thf(f1454,plain,
( ( $true
!= ( in_tree_a @ v @ ( t_a @ v2 @ l2 @ r2 ) ) )
| spl112_34 ),
inference(avatar_component_clause,[],[f1452]) ).
thf(f1455,plain,
( ~ spl112_34
| spl112_26 ),
inference(avatar_split_clause,[],[f1450,f1365,f1452]) ).
thf(f1457,plain,
( ( $true != $true )
| ( $true
!= ( in_tree_a @ v @ ( t_a @ v1 @ l1 @ r1 ) ) )
| spl112_26 ),
inference(superposition,[],[f1367,f1028]) ).
thf(f1458,plain,
( ( $true
!= ( in_tree_a @ v @ ( t_a @ v1 @ l1 @ r1 ) ) )
| spl112_26 ),
inference(trivial_inequality_removal,[],[f1457]) ).
thf(f1460,definition,
( spl112_35
<=> ( $true
= ( in_tree_a @ v @ ( t_a @ v1 @ l1 @ r1 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl112_35])],[avatar_definition]) ).
thf(f1462,plain,
( ( $true
!= ( in_tree_a @ v @ ( t_a @ v1 @ l1 @ r1 ) ) )
| spl112_35 ),
inference(avatar_component_clause,[],[f1460]) ).
thf(f1463,plain,
( ~ spl112_35
| spl112_26 ),
inference(avatar_split_clause,[],[f1458,f1365,f1460]) ).
thf(f1470,plain,
( ( $true
!= ( in_tree_a @ v @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ l1 @ ( heapIm1257206334ight_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) ) ) )
| spl112_9 ),
inference(forward_demodulation,[],[f1283,f886]) ).
thf(f1471,plain,
( ( $true
!= ( in_tree_a @ v @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ l1 @ r1 ) ) ) )
| spl112_9 ),
inference(forward_demodulation,[],[f1470,f1131]) ).
thf(f1473,definition,
( spl112_36
<=> ( $true
= ( in_tree_a @ v @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ l1 @ r1 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl112_36])],[avatar_definition]) ).
thf(f1476,plain,
( ~ spl112_36
| spl112_9 ),
inference(avatar_split_clause,[],[f1471,f1281,f1473]) ).
thf(f1507,plain,
( ( $true
!= ( in_tree_a @ v @ l1 ) )
| ( $true != $true )
| spl112_35 ),
inference(superposition,[],[f1462,f1028]) ).
thf(f1508,plain,
( ( $true
!= ( in_tree_a @ v @ r1 ) )
| ( $true != $true )
| spl112_35 ),
inference(superposition,[],[f1462,f1026]) ).
thf(f1509,plain,
( ( $true
!= ( in_tree_a @ v @ l1 ) )
| spl112_35 ),
inference(trivial_inequality_removal,[],[f1507]) ).
thf(f1510,plain,
( ( $true
!= ( in_tree_a @ v @ r1 ) )
| spl112_35 ),
inference(trivial_inequality_removal,[],[f1508]) ).
thf(f1512,definition,
( spl112_39
<=> ( $true
= ( in_tree_a @ v @ l1 ) ) ),
introduced(definition,[new_symbols(definition,[spl112_39])],[avatar_definition]) ).
thf(f1514,plain,
( ( $true
!= ( in_tree_a @ v @ l1 ) )
| spl112_39 ),
inference(avatar_component_clause,[],[f1512]) ).
thf(f1515,plain,
( ~ spl112_39
| spl112_35 ),
inference(avatar_split_clause,[],[f1509,f1460,f1512]) ).
thf(f1517,definition,
( spl112_40
<=> ( $true
= ( in_tree_a @ v @ r1 ) ) ),
introduced(definition,[new_symbols(definition,[spl112_40])],[avatar_definition]) ).
thf(f1519,plain,
( ( $true
!= ( in_tree_a @ v @ r1 ) )
| spl112_40 ),
inference(avatar_component_clause,[],[f1517]) ).
thf(f1520,plain,
( ~ spl112_40
| spl112_35 ),
inference(avatar_split_clause,[],[f1510,f1460,f1517]) ).
thf(f1988,plain,
! [X2: tree_a,X3: tree_a,X0: tree_a,X1: a,X6: a,X4: tree_a,X5: a] :
( ( ( heapIm1091024090Down_a @ ( t_a @ X5 @ ( t_a @ X6 @ X2 @ X4 ) @ ( t_a @ X1 @ X3 @ X0 ) ) )
= ( t_a @ X5 @ ( t_a @ X6 @ X2 @ X4 ) @ ( t_a @ X1 @ X3 @ X0 ) ) )
| ( $true
!= ( ord_less_eq_a @ ( val_a @ ( t_a @ X6 @ X2 @ X4 ) ) @ X5 ) )
| ( $true
!= ( ord_less_eq_a @ X1 @ ( val_a @ ( t_a @ X6 @ X2 @ X4 ) ) ) ) ),
inference(forward_demodulation,[],[f1092,f1159]) ).
thf(f1989,plain,
! [X2: tree_a,X3: tree_a,X0: tree_a,X1: a,X6: a,X4: tree_a,X5: a] :
( ( ( heapIm1091024090Down_a @ ( t_a @ X5 @ ( t_a @ X6 @ X2 @ X4 ) @ ( t_a @ X1 @ X3 @ X0 ) ) )
= ( t_a @ X5 @ ( t_a @ X6 @ X2 @ X4 ) @ ( t_a @ X1 @ X3 @ X0 ) ) )
| ( ( ord_less_eq_a @ X6 @ X5 )
!= $true )
| ( $true
!= ( ord_less_eq_a @ X1 @ ( val_a @ ( t_a @ X6 @ X2 @ X4 ) ) ) ) ),
inference(forward_demodulation,[],[f1988,f1159]) ).
thf(f1990,plain,
! [X2: tree_a,X3: tree_a,X0: tree_a,X1: a,X6: a,X4: tree_a,X5: a] :
( ( ( heapIm1091024090Down_a @ ( t_a @ X5 @ ( t_a @ X6 @ X2 @ X4 ) @ ( t_a @ X1 @ X3 @ X0 ) ) )
= ( t_a @ X5 @ ( t_a @ X6 @ X2 @ X4 ) @ ( t_a @ X1 @ X3 @ X0 ) ) )
| ( ( ord_less_eq_a @ X6 @ X5 )
!= $true )
| ( ( ord_less_eq_a @ X1 @ X6 )
!= $true ) ),
inference(forward_demodulation,[],[f1989,f1159]) ).
thf(f2008,plain,
( ( $true
!= ( ord_less_eq_a @ v1 @ v3 ) )
| ( ( in_tree_a @ v @ ( t_a @ v3 @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) )
= $true )
| ( ( ord_less_eq_a @ v2 @ v1 )
!= $true )
| ~ spl112_20 ),
inference(superposition,[],[f1337,f1990]) ).
thf(f2014,plain,
( ( $true
!= ( ord_less_eq_a @ v1 @ v3 ) )
| ( ( ord_less_eq_a @ v2 @ v1 )
!= $true )
| ~ spl112_20
| spl112_26 ),
inference(forward_subsumption_resolution,[],[f2008,f1367]) ).
thf(f2016,plain,
( ( $true
!= ( ord_less_eq_a @ v1 @ v3 ) )
| ~ spl112_20
| ~ spl112_24
| spl112_26 ),
inference(forward_subsumption_resolution,[],[f2014,f1357]) ).
thf(f2019,definition,
( spl112_42
<=> ( $true
= ( ord_less_eq_a @ v1 @ v3 ) ) ),
introduced(definition,[new_symbols(definition,[spl112_42])],[avatar_definition]) ).
thf(f2021,plain,
( ( $true
!= ( ord_less_eq_a @ v1 @ v3 ) )
| spl112_42 ),
inference(avatar_component_clause,[],[f2019]) ).
thf(f2022,plain,
( ~ spl112_42
| ~ spl112_20
| ~ spl112_24
| spl112_26 ),
inference(avatar_split_clause,[],[f2016,f1365,f1355,f1335,f2019]) ).
thf(f2205,plain,
! [X2: tree_a,X3: tree_a,X0: tree_a,X1: a,X6: a,X4: tree_a,X5: a] :
( ( $true
!= ( ord_less_eq_a @ ( val_a @ ( t_a @ X1 @ X3 @ X0 ) ) @ ( val_a @ ( t_a @ X6 @ X2 @ X4 ) ) ) )
| ( ( heapIm1091024090Down_a @ ( t_a @ X5 @ ( t_a @ X6 @ X2 @ X4 ) @ ( t_a @ X1 @ X3 @ X0 ) ) )
= ( t_a @ X6 @ ( heapIm1091024090Down_a @ ( t_a @ X5 @ ( heapIm1140443833left_a @ ( t_a @ X6 @ X2 @ X4 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X6 @ X2 @ X4 ) ) ) ) @ ( t_a @ X1 @ X3 @ X0 ) ) )
| ( $true
= ( ord_less_eq_a @ ( val_a @ ( t_a @ X6 @ X2 @ X4 ) ) @ X5 ) ) ),
inference(forward_demodulation,[],[f1093,f1159]) ).
thf(f2206,plain,
! [X2: tree_a,X3: tree_a,X0: tree_a,X1: a,X6: a,X4: tree_a,X5: a] :
( ( $true
= ( ord_less_eq_a @ ( val_a @ ( t_a @ X6 @ X2 @ X4 ) ) @ X5 ) )
| ( $true
!= ( ord_less_eq_a @ X1 @ ( val_a @ ( t_a @ X6 @ X2 @ X4 ) ) ) )
| ( ( heapIm1091024090Down_a @ ( t_a @ X5 @ ( t_a @ X6 @ X2 @ X4 ) @ ( t_a @ X1 @ X3 @ X0 ) ) )
= ( t_a @ X6 @ ( heapIm1091024090Down_a @ ( t_a @ X5 @ ( heapIm1140443833left_a @ ( t_a @ X6 @ X2 @ X4 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X6 @ X2 @ X4 ) ) ) ) @ ( t_a @ X1 @ X3 @ X0 ) ) ) ),
inference(forward_demodulation,[],[f2205,f1159]) ).
thf(f2207,plain,
! [X2: tree_a,X3: tree_a,X0: tree_a,X1: a,X6: a,X4: tree_a,X5: a] :
( ( ( heapIm1091024090Down_a @ ( t_a @ X5 @ ( t_a @ X6 @ X2 @ X4 ) @ ( t_a @ X1 @ X3 @ X0 ) ) )
= ( t_a @ X6 @ ( heapIm1091024090Down_a @ ( t_a @ X5 @ ( heapIm1140443833left_a @ ( t_a @ X6 @ X2 @ X4 ) ) @ ( heapIm1257206334ight_a @ ( t_a @ X6 @ X2 @ X4 ) ) ) ) @ ( t_a @ X1 @ X3 @ X0 ) ) )
| ( $true
!= ( ord_less_eq_a @ X1 @ ( val_a @ ( t_a @ X6 @ X2 @ X4 ) ) ) )
| ( ( ord_less_eq_a @ X6 @ X5 )
= $true ) ),
inference(forward_demodulation,[],[f2206,f1159]) ).
thf(f2208,plain,
! [X2: tree_a,X3: tree_a,X0: tree_a,X1: a,X6: a,X4: tree_a,X5: a] :
( ( ( ord_less_eq_a @ X6 @ X5 )
= $true )
| ( ( t_a @ X6 @ ( heapIm1091024090Down_a @ ( t_a @ X5 @ X2 @ ( heapIm1257206334ight_a @ ( t_a @ X6 @ X2 @ X4 ) ) ) ) @ ( t_a @ X1 @ X3 @ X0 ) )
= ( heapIm1091024090Down_a @ ( t_a @ X5 @ ( t_a @ X6 @ X2 @ X4 ) @ ( t_a @ X1 @ X3 @ X0 ) ) ) )
| ( $true
!= ( ord_less_eq_a @ X1 @ ( val_a @ ( t_a @ X6 @ X2 @ X4 ) ) ) ) ),
inference(forward_demodulation,[],[f2207,f886]) ).
thf(f2209,plain,
! [X2: tree_a,X3: tree_a,X0: tree_a,X1: a,X6: a,X4: tree_a,X5: a] :
( ( ( heapIm1091024090Down_a @ ( t_a @ X5 @ ( t_a @ X6 @ X2 @ X4 ) @ ( t_a @ X1 @ X3 @ X0 ) ) )
= ( t_a @ X6 @ ( heapIm1091024090Down_a @ ( t_a @ X5 @ X2 @ X4 ) ) @ ( t_a @ X1 @ X3 @ X0 ) ) )
| ( ( ord_less_eq_a @ X6 @ X5 )
= $true )
| ( $true
!= ( ord_less_eq_a @ X1 @ ( val_a @ ( t_a @ X6 @ X2 @ X4 ) ) ) ) ),
inference(forward_demodulation,[],[f2208,f1131]) ).
thf(f2210,plain,
! [X2: tree_a,X3: tree_a,X0: tree_a,X1: a,X6: a,X4: tree_a,X5: a] :
( ( ( heapIm1091024090Down_a @ ( t_a @ X5 @ ( t_a @ X6 @ X2 @ X4 ) @ ( t_a @ X1 @ X3 @ X0 ) ) )
= ( t_a @ X6 @ ( heapIm1091024090Down_a @ ( t_a @ X5 @ X2 @ X4 ) ) @ ( t_a @ X1 @ X3 @ X0 ) ) )
| ( ( ord_less_eq_a @ X6 @ X5 )
= $true )
| ( ( ord_less_eq_a @ X1 @ X6 )
!= $true ) ),
inference(forward_demodulation,[],[f2209,f1159]) ).
thf(f2257,plain,
( ( ( in_tree_a @ v @ ( t_a @ v1 @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ l1 @ r1 ) ) @ ( t_a @ v2 @ l2 @ r2 ) ) )
= $true )
| ( $true
= ( ord_less_eq_a @ v1 @ v3 ) )
| ( ( ord_less_eq_a @ v2 @ v1 )
!= $true )
| ~ spl112_20 ),
inference(superposition,[],[f1337,f2210]) ).
thf(f2321,plain,
( ( ( ord_less_eq_a @ v2 @ v1 )
!= $true )
| ( ( in_tree_a @ v @ ( t_a @ v1 @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ l1 @ r1 ) ) @ ( t_a @ v2 @ l2 @ r2 ) ) )
= $true )
| ~ spl112_20
| spl112_42 ),
inference(forward_subsumption_resolution,[],[f2257,f2021]) ).
thf(f2323,plain,
( ( ( in_tree_a @ v @ ( t_a @ v1 @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ l1 @ r1 ) ) @ ( t_a @ v2 @ l2 @ r2 ) ) )
= $true )
| ~ spl112_20
| ~ spl112_24
| spl112_42 ),
inference(forward_subsumption_resolution,[],[f2321,f1357]) ).
thf(f2326,definition,
( spl112_43
<=> ( ( in_tree_a @ v @ ( t_a @ v1 @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ l1 @ r1 ) ) @ ( t_a @ v2 @ l2 @ r2 ) ) )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl112_43])],[avatar_definition]) ).
thf(f2328,plain,
( ( ( in_tree_a @ v @ ( t_a @ v1 @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ l1 @ r1 ) ) @ ( t_a @ v2 @ l2 @ r2 ) ) )
= $true )
| ~ spl112_43 ),
inference(avatar_component_clause,[],[f2326]) ).
thf(f2329,plain,
( spl112_43
| ~ spl112_20
| ~ spl112_24
| spl112_42 ),
inference(avatar_split_clause,[],[f2323,f2019,f1355,f1335,f2326]) ).
thf(f2482,plain,
( ( $true != $true )
| ( $true
= ( in_tree_a @ v @ ( t_a @ v2 @ l2 @ r2 ) ) )
| ( v = v1 )
| ( $true
= ( in_tree_a @ v @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ l1 @ r1 ) ) ) )
| ~ spl112_43 ),
inference(superposition,[],[f1025,f2328]) ).
thf(f2483,plain,
( ( v = v1 )
| ( $true
= ( in_tree_a @ v @ ( t_a @ v2 @ l2 @ r2 ) ) )
| ( $true
= ( in_tree_a @ v @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ l1 @ r1 ) ) ) )
| ~ spl112_43 ),
inference(trivial_inequality_removal,[],[f2482]) ).
thf(f2488,plain,
( ( $true
= ( in_tree_a @ v @ ( t_a @ v2 @ l2 @ r2 ) ) )
| ( $true
= ( in_tree_a @ v @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ l1 @ r1 ) ) ) )
| spl112_6
| ~ spl112_43 ),
inference(forward_subsumption_resolution,[],[f2483,f1269]) ).
thf(f2490,plain,
( ( $true
!= ( ord_less_eq_a @ v2 @ ( val_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) )
| spl112_5 ),
inference(forward_demodulation,[],[f1263,f1159]) ).
thf(f2491,plain,
( ( $true
= ( in_tree_a @ v @ ( heapIm1091024090Down_a @ ( t_a @ v3 @ l1 @ r1 ) ) ) )
| spl112_6
| spl112_34
| ~ spl112_43 ),
inference(forward_subsumption_resolution,[],[f2488,f1454]) ).
thf(f2493,plain,
( ( ( ord_less_eq_a @ v2 @ v1 )
!= $true )
| spl112_5 ),
inference(forward_demodulation,[],[f2490,f1159]) ).
thf(f2494,plain,
( spl112_36
| spl112_6
| spl112_34
| ~ spl112_43 ),
inference(avatar_split_clause,[],[f2491,f2326,f1452,f1267,f1473]) ).
thf(f2496,plain,
( $false
| spl112_5
| ~ spl112_24 ),
inference(forward_subsumption_resolution,[],[f2493,f1357]) ).
thf(f2497,plain,
( spl112_5
| ~ spl112_24 ),
inference(avatar_contradiction_clause,[],[f2496]) ).
thf(f2498,plain,
( ( $true
= ( ord_less_eq_a @ v1 @ v3 ) )
| ~ spl112_8 ),
inference(forward_demodulation,[],[f1279,f1159]) ).
thf(f2500,plain,
( $false
| ~ spl112_8
| spl112_42 ),
inference(forward_subsumption_resolution,[],[f2498,f2021]) ).
thf(f2501,plain,
( ~ spl112_8
| spl112_42 ),
inference(avatar_contradiction_clause,[],[f2500]) ).
thf(f2504,plain,
( ( $true
= ( in_tree_a @ v @ ( t_a @ v3 @ l1 @ ( heapIm1257206334ight_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) ) )
| ~ spl112_10 ),
inference(forward_demodulation,[],[f1287,f886]) ).
thf(f2505,plain,
( ( ( in_tree_a @ v @ ( t_a @ v3 @ l1 @ r1 ) )
= $true )
| ~ spl112_10 ),
inference(forward_demodulation,[],[f2504,f1131]) ).
thf(f2507,definition,
( spl112_44
<=> ( ( in_tree_a @ v @ ( t_a @ v3 @ l1 @ r1 ) )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl112_44])],[avatar_definition]) ).
thf(f2509,plain,
( ( ( in_tree_a @ v @ ( t_a @ v3 @ l1 @ r1 ) )
= $true )
| ~ spl112_44 ),
inference(avatar_component_clause,[],[f2507]) ).
thf(f2510,plain,
( spl112_44
| ~ spl112_10 ),
inference(avatar_split_clause,[],[f2505,f1285,f2507]) ).
thf(f2525,plain,
( ( $true
= ( in_tree_a @ v @ r1 ) )
| ( $true != $true )
| ( v = v3 )
| ( $true
= ( in_tree_a @ v @ l1 ) )
| ~ spl112_44 ),
inference(superposition,[],[f1025,f2509]) ).
thf(f2526,plain,
( ( $true
= ( in_tree_a @ v @ r1 ) )
| ( v = v3 )
| ( $true
= ( in_tree_a @ v @ l1 ) )
| ~ spl112_44 ),
inference(trivial_inequality_removal,[],[f2525]) ).
thf(f2527,plain,
( ( $true
= ( in_tree_a @ v @ l1 ) )
| ( v = v3 )
| spl112_40
| ~ spl112_44 ),
inference(forward_subsumption_resolution,[],[f2526,f1519]) ).
thf(f2528,plain,
( ( v = v3 )
| spl112_39
| spl112_40
| ~ spl112_44 ),
inference(forward_subsumption_resolution,[],[f2527,f1514]) ).
thf(f2529,plain,
( $false
| spl112_19
| spl112_39
| spl112_40
| ~ spl112_44 ),
inference(forward_subsumption_resolution,[],[f2528,f1332]) ).
thf(f2530,plain,
( spl112_19
| spl112_39
| spl112_40
| ~ spl112_44 ),
inference(avatar_contradiction_clause,[],[f2529]) ).
cnf(s3,plain,
~ spl112_6,
inference(sat_conversion,[],[f1270]) ).
cnf(s5,plain,
( ~ spl112_5
| spl112_8
| ~ spl112_9
| spl112_10 ),
inference(sat_conversion,[],[f1288]) ).
cnf(s14,plain,
~ spl112_19,
inference(sat_conversion,[],[f1333]) ).
cnf(s15,plain,
spl112_20,
inference(sat_conversion,[],[f1338]) ).
cnf(s20,plain,
spl112_24,
inference(sat_conversion,[],[f1358]) ).
cnf(s22,plain,
~ spl112_26,
inference(sat_conversion,[],[f1368]) ).
cnf(s33,plain,
( spl112_26
| ~ spl112_34 ),
inference(sat_conversion,[],[f1455]) ).
cnf(s34,plain,
( spl112_26
| ~ spl112_35 ),
inference(sat_conversion,[],[f1463]) ).
cnf(s35,plain,
( spl112_9
| ~ spl112_36 ),
inference(sat_conversion,[],[f1476]) ).
cnf(s38,plain,
( spl112_35
| ~ spl112_39 ),
inference(sat_conversion,[],[f1515]) ).
cnf(s39,plain,
( spl112_35
| ~ spl112_40 ),
inference(sat_conversion,[],[f1520]) ).
cnf(s41,plain,
( ~ spl112_20
| ~ spl112_24
| spl112_26
| ~ spl112_42 ),
inference(sat_conversion,[],[f2022]) ).
cnf(s42,plain,
( ~ spl112_20
| ~ spl112_24
| spl112_42
| spl112_43 ),
inference(sat_conversion,[],[f2329]) ).
cnf(s44,plain,
( spl112_6
| spl112_34
| spl112_36
| ~ spl112_43 ),
inference(sat_conversion,[],[f2494]) ).
cnf(s46,plain,
( spl112_5
| ~ spl112_24 ),
inference(sat_conversion,[],[f2497]) ).
cnf(s47,plain,
( ~ spl112_8
| spl112_42 ),
inference(sat_conversion,[],[f2501]) ).
cnf(s48,plain,
( ~ spl112_10
| spl112_44 ),
inference(sat_conversion,[],[f2510]) ).
cnf(s49,plain,
( spl112_19
| spl112_39
| spl112_40
| ~ spl112_44 ),
inference(sat_conversion,[],[f2530]) ).
cnf(s52,plain,
~ spl112_35,
inference(rat,[],[s34,s22]) ).
cnf(s53,plain,
~ spl112_34,
inference(rat,[],[s33,s22]) ).
cnf(s54,plain,
~ spl112_40,
inference(rat,[],[s39,s52]) ).
cnf(s55,plain,
~ spl112_39,
inference(rat,[],[s38,s52]) ).
cnf(s58,plain,
spl112_5,
inference(rat,[],[s46,s20]) ).
cnf(s59,plain,
~ spl112_42,
inference(rat,[],[s41,s20,s22,s15]) ).
cnf(s60,plain,
~ spl112_8,
inference(rat,[],[s47,s59]) ).
cnf(s61,plain,
spl112_43,
inference(rat,[],[s42,s15,s20,s59]) ).
cnf(s62,plain,
~ spl112_44,
inference(rat,[],[s49,s55,s54,s14]) ).
cnf(s63,plain,
~ spl112_10,
inference(rat,[],[s48,s62]) ).
cnf(s64,plain,
~ spl112_9,
inference(rat,[],[s5,s63,s60,s58]) ).
cnf(s65,plain,
~ spl112_36,
inference(rat,[],[s35,s64]) ).
cnf(s66,plain,
spl112_6,
inference(rat,[],[s44,s61,s53,s65]) ).
cnf(s67,plain,
$false,
inference(rat,[],[s3,s66]) ).
thf(f2531,plain,
$false,
inference(avatar_sat_refutation,[],[s67]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP067^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 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:52:07 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.21 Running higher-order theorem proving
% 0.09/0.25 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.73/0.37 % (1731649)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.73/0.37 % (1731655)lrs+10_16_si=on:nwc=1.5:random_seed=837561220:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.73/0.37 % (1731660)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.73/0.37 % (1731660)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.73/0.37 % (1731655)Instruction limit reached!
% 0.73/0.37 % (1731655)------------------------------
% 0.73/0.37 % (1731655)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.73/0.37 % (1731655)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.73/0.37 % (1731655)CaDiCaL version: 2.1.3
% 0.73/0.37 % (1731655)Termination reason: Instruction limit
% 0.73/0.37 % (1731655)Termination phase: Property scanning
% 0.73/0.37 % (1731655)Time elapsed: 0.005 s
% 0.73/0.37 % (1731655)Peak memory usage: 10 MB
% 0.73/0.37 % (1731655)Instructions burned: 23 (million)
% 0.73/0.37 % (1731654)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1394384324:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.73/0.37 % (1731656)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=3154999890:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.73/0.37 % (1731657)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=937591484: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.73/0.37 % (1731658)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=1158592908:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.73/0.37 % (1731659)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=640293664:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.73/0.37 % (1731660)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=2075937112:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.73/0.37 % (1731656)Instruction limit reached!
% 0.73/0.37 % (1731656)------------------------------
% 0.73/0.37 % (1731656)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.73/0.37 % (1731656)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.73/0.37 % (1731656)CaDiCaL version: 2.1.3
% 0.73/0.37 % (1731656)Termination reason: Instruction limit
% 0.73/0.37 % (1731656)Termination phase: shuffling
% 0.73/0.37 % (1731656)Time elapsed: 0.002 s
% 0.73/0.37 % (1731656)Peak memory usage: 10 MB
% 0.73/0.37 % (1731656)Instructions burned: 3 (million)
% 0.73/0.37 % (1731662)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=3342254917:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.73/0.37 % (1731662)Instruction limit reached!
% 0.73/0.37 % (1731662)------------------------------
% 0.73/0.37 % (1731662)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.73/0.37 % (1731662)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.73/0.37 % (1731662)CaDiCaL version: 2.1.3
% 0.73/0.37 % (1731662)Termination reason: Instruction limit
% 0.73/0.37 % (1731662)Termination phase: shuffling
% 0.73/0.37 % (1731662)Time elapsed: 0.001 s
% 0.73/0.37 % (1731662)Peak memory usage: 10 MB
% 0.73/0.37 % (1731662)Instructions burned: 4 (million)
% 0.73/0.37 % (1731658)Instruction limit reached!
% 0.73/0.37 % (1731658)------------------------------
% 0.73/0.37 % (1731658)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.73/0.37 % (1731658)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.73/0.37 % (1731658)CaDiCaL version: 2.1.3
% 0.73/0.37 % (1731658)Termination reason: Instruction limit
% 0.73/0.37 % (1731658)Termination phase: Property scanning
% 0.73/0.37 % (1731658)Time elapsed: 0.011 s
% 0.73/0.37 % (1731658)Peak memory usage: 10 MB
% 0.73/0.37 % (1731658)Instructions burned: 25 (million)
% 0.73/0.37 % (1731671)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.73/0.41 % (1731669)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=2931033464:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.73/0.41 % (1731671)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=2914077979:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.73/0.41 % (1731671)Instruction limit reached!
% 0.73/0.41 % (1731671)------------------------------
% 0.73/0.41 % (1731671)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.73/0.41 % (1731671)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.73/0.41 % (1731671)CaDiCaL version: 2.1.3
% 0.73/0.41 % (1731671)Termination reason: Instruction limit
% 0.73/0.41 % (1731671)Termination phase: shuffling
% 0.73/0.41 % (1731671)Time elapsed: 0.002 s
% 0.73/0.41 % (1731671)Peak memory usage: 10 MB
% 0.73/0.41 % (1731671)Instructions burned: 8 (million)
% 0.73/0.41 % (1731669)Instruction limit reached!
% 0.73/0.41 % (1731669)------------------------------
% 0.73/0.41 % (1731669)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.73/0.41 % (1731669)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.73/0.41 % (1731669)CaDiCaL version: 2.1.3
% 0.73/0.41 % (1731669)Termination reason: Instruction limit
% 0.73/0.41 % (1731669)Termination phase: shuffling
% 0.73/0.41 % (1731669)Time elapsed: 0.003 s
% 0.73/0.41 % (1731669)Peak memory usage: 10 MB
% 0.73/0.41 % (1731669)Instructions burned: 6 (million)
% 0.73/0.41 % (1731672)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=3034566302:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.73/0.41 % (1731675)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.73/0.41 % (1731675)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.73/0.41 % (1731659)Instruction limit reached!
% 0.73/0.41 % (1731659)------------------------------
% 0.73/0.41 % (1731659)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.73/0.41 % (1731659)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.73/0.41 % (1731659)CaDiCaL version: 2.1.3
% 0.73/0.41 % (1731659)Termination reason: Instruction limit
% 0.73/0.41 % (1731659)Termination phase: Property scanning
% 0.73/0.41 % (1731659)Time elapsed: 0.034 s
% 0.73/0.41 % (1731659)Peak memory usage: 11 MB
% 0.73/0.41 % (1731659)Instructions burned: 77 (million)
% 0.73/0.41 % (1731675)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=1138658596: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.73/0.41 % (1731672)Instruction limit reached!
% 0.73/0.41 % (1731672)------------------------------
% 0.73/0.41 % (1731672)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.73/0.41 % (1731672)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.73/0.41 % (1731672)CaDiCaL version: 2.1.3
% 0.73/0.41 % (1731672)Termination reason: Instruction limit
% 0.73/0.41 % (1731672)Termination phase: shuffling
% 0.73/0.41 % (1731672)Time elapsed: 0.007 s
% 0.73/0.41 % (1731672)Peak memory usage: 10 MB
% 0.73/0.41 % (1731672)Instructions burned: 16 (million)
% 0.73/0.41 % (1731654)Instruction limit reached!
% 0.73/0.41 % (1731654)------------------------------
% 0.73/0.41 % (1731654)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.73/0.41 % (1731654)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.73/0.41 % (1731654)CaDiCaL version: 2.1.3
% 0.73/0.41 % (1731654)Termination reason: Instruction limit
% 0.73/0.41 % (1731654)Termination phase: Saturation
% 0.73/0.41 % (1731654)Time elapsed: 0.038 s
% 0.73/0.41 % (1731654)Peak memory usage: 12 MB
% 0.73/0.41 % (1731654)Instructions burned: 88 (million)
% 0.73/0.41 % (1731675)Instruction limit reached!
% 0.73/0.41 % (1731675)------------------------------
% 0.73/0.41 % (1731675)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.73/0.41 % (1731675)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.73/0.41 % (1731675)CaDiCaL version: 2.1.3
% 0.73/0.41 % (1731675)Termination reason: Instruction limit
% 0.73/0.43 % (1731675)Termination phase: Property scanning
% 0.73/0.43 % (1731675)Time elapsed: 0.006 s
% 0.73/0.43 % (1731675)Peak memory usage: 10 MB
% 0.73/0.43 % (1731675)Instructions burned: 28 (million)
% 0.73/0.43 % (1731676)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=1958673045:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 0.73/0.43 % (1731678)lrs+10_1_si=on:cs=on:random_seed=1110303765:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 0.73/0.43 % (1731682)lrs+1002_1_to=lpo:sil=128000:si=on:sos=on:spb=goal_then_units:uwa=off:random_seed=3451241464:st=2:i=249:sd=1:rtra=on:ss=axioms_2999 on theBenchmark for (2999ds/249Mi)
% 0.73/0.43 % (1731680)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.73/0.43 % (1731678)Instruction limit reached!
% 0.73/0.43 % (1731678)------------------------------
% 0.73/0.43 % (1731678)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.73/0.43 % (1731678)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.73/0.43 % (1731678)CaDiCaL version: 2.1.3
% 0.73/0.43 % (1731678)Termination reason: Instruction limit
% 0.73/0.43 % (1731678)Termination phase: shuffling
% 0.73/0.43 % (1731678)Time elapsed: 0.004 s
% 0.73/0.43 % (1731678)Peak memory usage: 10 MB
% 0.73/0.43 % (1731678)Instructions burned: 8 (million)
% 0.73/0.43 % (1731680)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=3104173925:i=2:add=on:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.73/0.43 % (1731681)lrs+1002_3:1_sil=128000:e2e=on:si=on:urr=on:uwa=one_side_constant:nwc=1.5:random_seed=2467067874:i=38:bd=all:rtra=on:amm=off:ss=axioms:ntd=on_2999 on theBenchmark for (2999ds/38Mi)
% 0.73/0.43 % (1731680)Instruction limit reached!
% 0.73/0.43 % (1731680)------------------------------
% 0.73/0.43 % (1731680)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.73/0.43 % (1731680)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.73/0.43 % (1731680)CaDiCaL version: 2.1.3
% 0.73/0.43 % (1731680)Termination reason: Instruction limit
% 0.73/0.43 % (1731680)Termination phase: shuffling
% 0.73/0.43 % (1731680)Time elapsed: 0.004 s
% 0.73/0.43 % (1731680)Peak memory usage: 10 MB
% 0.73/0.43 % (1731680)Instructions burned: 9 (million)
% 0.73/0.43 % (1731682)Refutation not found, incomplete strategy
% 0.73/0.43 % (1731682)------------------------------
% 0.73/0.43 % (1731682)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.73/0.43 % (1731682)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.73/0.43 % (1731682)CaDiCaL version: 2.1.3
% 0.73/0.43 % (1731682)Termination reason: Refutation not found, incomplete strategy
% 0.73/0.43 % (1731682)Time elapsed: 0.009 s
% 0.73/0.43 % (1731682)Peak memory usage: 13 MB
% 0.73/0.43 % (1731682)Instructions burned: 37 (million)
% 0.73/0.43 % (1731682)------------------------------
% 0.73/0.43 % (1731682)------------------------------
% 0.73/0.43 % (1731690)dis+1010_1_sil=128000:si=on:uwa=off:random_seed=2295494866:st=3:s2a=on:i=327:sd=3:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/327Mi)
% 0.73/0.43 % (1731660)Instruction limit reached!
% 0.73/0.43 % (1731660)------------------------------
% 0.73/0.43 % (1731660)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.73/0.43 % (1731660)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.73/0.43 % (1731660)CaDiCaL version: 2.1.3
% 0.73/0.43 % (1731660)Termination reason: Instruction limit
% 0.73/0.43 % (1731660)Termination phase: Saturation
% 0.73/0.43 % (1731660)Time elapsed: 0.075 s
% 0.73/0.43 % (1731660)Peak memory usage: 13 MB
% 0.73/0.43 % (1731660)Instructions burned: 157 (million)
% 0.73/0.43 % (1731681)Instruction limit reached!
% 0.73/0.43 % (1731681)------------------------------
% 0.73/0.43 % (1731681)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.73/0.43 % (1731681)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.73/0.43 % (1731681)CaDiCaL version: 2.1.3
% 0.73/0.43 % (1731681)Termination reason: Instruction limit
% 0.73/0.43 % (1731681)Termination phase: Property scanning
% 0.73/0.43 % (1731681)Time elapsed: 0.018 s
% 0.73/0.43 % (1731681)Peak memory usage: 11 MB
% 0.73/0.43 % (1731681)Instructions burned: 40 (million)
% 0.73/0.43 % (1731687)dis+1002_1_sil=128000:fde=unused:e2e=on:si=on:cbe=off:uwa=off:random_seed=751738489:hsq=on:st=2:i=25:kws=inv_frequency:rtra=on:ss=axioms:ntd=on_2999 on theBenchmark for (2999ds/25Mi)
% 1.43/0.47 % (1731689)lrs+10_16:1_sil=128000:si=on:lma=off:urr=on:uwa=interpreted_only:random_seed=2683638168:i=14:kws=precedence:aac=none:nm=10:rtra=on:er=filter:ntd=on_2998 on theBenchmark for (2998ds/14Mi)
% 1.43/0.47 % (1731676)Instruction limit reached!
% 1.43/0.47 % (1731676)------------------------------
% 1.43/0.47 % (1731676)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.43/0.47 % (1731676)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.43/0.47 % (1731676)CaDiCaL version: 2.1.3
% 1.43/0.47 % (1731676)Termination reason: Instruction limit
% 1.43/0.47 % (1731676)Termination phase: Property scanning
% 1.43/0.47 % (1731676)Time elapsed: 0.036 s
% 1.43/0.47 % (1731676)Peak memory usage: 11 MB
% 1.43/0.47 % (1731676)Instructions burned: 87 (million)
% 1.43/0.47 % (1731689)Instruction limit reached!
% 1.43/0.47 % (1731689)------------------------------
% 1.43/0.47 % (1731689)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.43/0.47 % (1731689)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.43/0.47 % (1731689)CaDiCaL version: 2.1.3
% 1.43/0.47 % (1731689)Termination reason: Instruction limit
% 1.43/0.47 % (1731689)Termination phase: shuffling
% 1.43/0.47 % (1731689)Time elapsed: 0.006 s
% 1.43/0.47 % (1731689)Peak memory usage: 10 MB
% 1.43/0.47 % (1731689)Instructions burned: 14 (million)
% 1.43/0.47 % (1731687)Instruction limit reached!
% 1.43/0.47 % (1731687)------------------------------
% 1.43/0.47 % (1731687)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.43/0.47 % (1731687)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.43/0.47 % (1731687)CaDiCaL version: 2.1.3
% 1.43/0.47 % (1731687)Termination reason: Instruction limit
% 1.43/0.47 % (1731687)Termination phase: Property scanning
% 1.43/0.47 % (1731687)Time elapsed: 0.011 s
% 1.43/0.47 % (1731687)Peak memory usage: 10 MB
% 1.43/0.47 % (1731687)Instructions burned: 26 (million)
% 1.43/0.47 % (1731692)dis+10_1_anc=all_dependent:to=kbo:sil=128000:si=on:chr=on:random_seed=1755570670:uwa_fpi=on:i=14:aac=none:rtra=on:fe=abstraction_2998 on theBenchmark for (2998ds/14Mi)
% 1.43/0.47 % (1731694)ott+21_20_to=lpo:sil=128000:tgt=ground:si=on:sp=arity:lma=off:uwa=off:foolp=on:random_seed=4265155870:st=4:i=2:add=off:sd=3:nm=16:fsr=off:rtra=on:ss=axioms:sgt=8:ntd=on_2998 on theBenchmark for (2998ds/2Mi)
% 1.43/0.47 % (1731694)Instruction limit reached!
% 1.43/0.47 % (1731694)------------------------------
% 1.43/0.47 % (1731694)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.43/0.47 % (1731694)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.43/0.47 % (1731694)CaDiCaL version: 2.1.3
% 1.43/0.47 % (1731694)Termination reason: Instruction limit
% 1.43/0.47 % (1731694)Termination phase: shuffling
% 1.43/0.47 % (1731694)Time elapsed: 0.002 s
% 1.43/0.47 % (1731694)Peak memory usage: 10 MB
% 1.43/0.47 % (1731694)Instructions burned: 4 (million)
% 1.43/0.47 % (1731696)ott+1004_1_sil=128000:cnfonf=lazy_pi_sigma_gen:si=on:sp=unary_frequency:cbe=off:uwa=off:nwc=1:random_seed=1270949651:i=26:ep=R:rtra=on:ntd=on_2998 on theBenchmark for (2998ds/26Mi)
% 1.43/0.47 % (1731692)Instruction limit reached!
% 1.43/0.47 % (1731692)------------------------------
% 1.43/0.47 % (1731692)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.43/0.47 % (1731692)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.43/0.47 % (1731692)CaDiCaL version: 2.1.3
% 1.43/0.47 % (1731692)Termination reason: Instruction limit
% 1.43/0.47 % (1731692)Termination phase: shuffling
% 1.43/0.47 % (1731692)Time elapsed: 0.006 s
% 1.43/0.47 % (1731692)Peak memory usage: 10 MB
% 1.43/0.47 % (1731692)Instructions burned: 14 (million)
% 1.43/0.47 % (1731697)dis+1002_16_sil=128000:si=on:sp=occurrence:random_seed=2168473190:cond=fast:i=23:hud=1:av=off:rtra=on:fe=abstraction:ntd=on_2998 on theBenchmark for (2998ds/23Mi)
% 1.43/0.47 % (1731698)lrs+1002_1024_sil=128000:tgt=ground:fde=none:e2e=on:si=on:uwa=off:nwc=1:random_seed=1676610747:cond=on:i=60:rtra=on:ntd=on_2998 on theBenchmark for (2998ds/60Mi)
% 1.43/0.47 % (1731696)Instruction limit reached!
% 1.43/0.47 % (1731696)------------------------------
% 1.43/0.47 % (1731696)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.43/0.47 % (1731696)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.43/0.48 % (1731696)CaDiCaL version: 2.1.3
% 1.43/0.48 % (1731696)Termination reason: Instruction limit
% 1.43/0.48 % (1731696)Termination phase: Property scanning
% 1.43/0.48 % (1731696)Time elapsed: 0.012 s
% 1.43/0.48 % (1731696)Peak memory usage: 10 MB
% 1.43/0.48 % (1731696)Instructions burned: 26 (million)
% 1.43/0.48 % (1731701)WARNING Broken Constraint: if sine_to_age_generality_threshold(10) 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
% 1.43/0.48 % (1731701)WARNING Broken Constraint: if lrs_weight_limit_only(on) has been set then saturation_algorithm(otter) is equal to lrs
% 1.43/0.48 % (1731697)Instruction limit reached!
% 1.43/0.48 % (1731697)------------------------------
% 1.43/0.48 % (1731697)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.43/0.48 % (1731697)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.43/0.48 % (1731697)CaDiCaL version: 2.1.3
% 1.43/0.48 % (1731697)Termination reason: Instruction limit
% 1.43/0.48 % (1731697)Termination phase: Property scanning
% 1.43/0.48 % (1731697)Time elapsed: 0.010 s
% 1.43/0.48 % (1731697)Peak memory usage: 10 MB
% 1.43/0.48 % (1731697)Instructions burned: 23 (million)
% 1.43/0.48 % (1731703)WARNING Broken Constraint: if choice_reasoning(on) has been set then choice_ax(on) is equal to off
% 1.43/0.48 % (1731701)ott+21_1_to=kbo:sil=128000:cnfonf=lazy_gen:bsd=on:si=on:sp=const_frequency:lma=off:uwa=off:foolp=on:s2agt=10:lwlo=on:random_seed=3620409596:i=14:add=off:nm=40:rtra=on:rawr=on_2998 on theBenchmark for (2998ds/14Mi)
% 1.43/0.48 % (1731703)lrs+1010_4:1_slsqr=8,1:to=kbo:cha=on:drc=off:si=on:sp=arity:lcm=predicate:uwa=off:fd=preordered:gs=on:nwc=5:s2agt=32:slsqc=1:kmz=on:updr=off:chr=on:pe=on:slsq=on:random_seed=186892513:i=8:nm=2:rtra=on:fe=abstraction:inj=on_2998 on theBenchmark for (2998ds/8Mi)
% 1.43/0.48 % (1731701)Instruction limit reached!
% 1.43/0.48 % (1731701)------------------------------
% 1.43/0.48 % (1731701)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.43/0.48 % (1731701)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.43/0.48 % (1731701)CaDiCaL version: 2.1.3
% 1.43/0.48 % (1731701)Termination reason: Instruction limit
% 1.43/0.48 % (1731701)Termination phase: shuffling
% 1.43/0.48 % (1731701)Time elapsed: 0.006 s
% 1.43/0.48 % (1731701)Peak memory usage: 10 MB
% 1.43/0.48 % (1731701)Instructions burned: 14 (million)
% 1.43/0.48 % (1731703)Instruction limit reached!
% 1.43/0.48 % (1731703)------------------------------
% 1.43/0.48 % (1731703)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.43/0.48 % (1731703)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.43/0.48 % (1731703)CaDiCaL version: 2.1.3
% 1.43/0.48 % (1731703)Termination reason: Instruction limit
% 1.43/0.48 % (1731703)Termination phase: shuffling
% 1.43/0.48 % (1731703)Time elapsed: 0.004 s
% 1.43/0.48 % (1731703)Peak memory usage: 10 MB
% 1.43/0.48 % (1731703)Instructions burned: 9 (million)
% 1.43/0.48 % (1731706)dis+1004_50_to=lpo:drc=off:fde=unused:cnfonf=lazy_not_gen_be_off:si=on:sp=reverse_arity:spb=units:cbe=off:foolp=on:random_seed=3022608829:uwa_fpi=on:i=31:doe=on:bd=preordered:rtra=on:fsd=on_2998 on theBenchmark for (2998ds/31Mi)
% 1.43/0.48 % (1731707)dis+10_1024_sil=128000:cnfonf=off:si=on:fd=off:random_seed=965178565:i=7:hud=5:bd=preordered:rtra=on:bet=on_2998 on theBenchmark for (2998ds/7Mi)
% 1.43/0.48 % (1731698)Instruction limit reached!
% 1.43/0.48 % (1731698)------------------------------
% 1.43/0.48 % (1731698)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.43/0.48 % (1731698)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.43/0.48 % (1731698)CaDiCaL version: 2.1.3
% 1.43/0.48 % (1731698)Termination reason: Instruction limit
% 1.43/0.48 % (1731698)Termination phase: Property scanning
% 1.43/0.48 % (1731698)Time elapsed: 0.027 s
% 1.43/0.48 % (1731698)Peak memory usage: 11 MB
% 1.43/0.48 % (1731698)Instructions burned: 62 (million)
% 1.43/0.48 % (1731707)Instruction limit reached!
% 1.43/0.48 % (1731707)------------------------------
% 1.43/0.48 % (1731707)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.43/0.48 % (1731707)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.43/0.48 % (1731707)CaDiCaL version: 2.1.3
% 1.43/0.48 % (1731707)Termination reason: Instruction limit
% 1.43/0.48 % (1731707)Termination phase: shuffling
% 1.43/0.48 % (1731707)Time elapsed: 0.003 s
% 1.43/0.48 % (1731707)Peak memory usage: 10 MB
% 1.43/0.48 % (1731707)Instructions burned: 7 (million)
% 1.43/0.48 % (1731710)lrs+10_1_plsq=on:drc=ordering:cnfonf=lazy_not_gen_be_off:bsd=on:si=on:plsqr=32,1:cs=on:random_seed=712203066:i=23:rtra=on:ntd=on_2998 on theBenchmark for (2998ds/23Mi)
% 1.43/0.48 % (1731711)lrs+10_1_sil=128000:fde=unused:si=on:random_seed=3198268095:s2a=on:i=20:kws=inv_frequency:bd=all:rtra=on_2998 on theBenchmark for (2998ds/20Mi)
% 1.43/0.48 % (1731706)Instruction limit reached!
% 1.43/0.48 % (1731706)------------------------------
% 1.43/0.48 % (1731706)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.43/0.48 % (1731706)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.43/0.48 % (1731706)CaDiCaL version: 2.1.3
% 1.43/0.48 % (1731706)Termination reason: Instruction limit
% 1.43/0.48 % (1731706)Termination phase: Property scanning
% 1.43/0.48 % (1731706)Time elapsed: 0.015 s
% 1.43/0.48 % (1731706)Peak memory usage: 10 MB
% 1.43/0.48 % (1731706)Instructions burned: 33 (million)
% 1.43/0.48 % (1731711)Instruction limit reached!
% 1.43/0.48 % (1731711)------------------------------
% 1.43/0.48 % (1731711)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.43/0.48 % (1731711)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.43/0.48 % (1731711)CaDiCaL version: 2.1.3
% 1.43/0.48 % (1731711)Termination reason: Instruction limit
% 1.43/0.48 % (1731711)Termination phase: Property scanning
% 1.43/0.48 % (1731711)Time elapsed: 0.009 s
% 1.43/0.48 % (1731711)Peak memory usage: 10 MB
% 1.43/0.48 % (1731711)Instructions burned: 21 (million)
% 1.43/0.48 % (1731710)Instruction limit reached!
% 1.43/0.48 % (1731710)------------------------------
% 1.43/0.48 % (1731710)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.43/0.48 % (1731710)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.43/0.48 % (1731710)CaDiCaL version: 2.1.3
% 1.43/0.48 % (1731710)Termination reason: Instruction limit
% 1.43/0.48 % (1731710)Termination phase: shuffling
% 1.43/0.48 % (1731710)Time elapsed: 0.011 s
% 1.43/0.48 % (1731710)Peak memory usage: 10 MB
% 1.43/0.48 % (1731710)Instructions burned: 24 (million)
% 1.43/0.48 % (1731715)ott+1002_32_tgt=ground:si=on:sp=const_max:acc=on:nwc=0.5:random_seed=3180859857:i=143:fgj=on:piset=pi_sigma:rtra=on:fe=abstraction_2998 on theBenchmark for (2998ds/143Mi)
% 1.43/0.48 % (1731714)dis+1010_2:1_sil=128000:cnfonf=lazy_pi_sigma_gen:si=on:uwa=off:slsq=on:random_seed=464803247:i=1240:rtra=on:ixr=off_2998 on theBenchmark for (2998ds/1240Mi)
% 1.43/0.48 % (1731690)Instruction limit reached!
% 1.43/0.48 % (1731690)------------------------------
% 1.43/0.48 % (1731690)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.43/0.48 % (1731690)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.43/0.48 % (1731690)CaDiCaL version: 2.1.3
% 1.43/0.48 % (1731690)Termination reason: Instruction limit
% 1.43/0.48 % (1731690)Termination phase: Saturation
% 1.43/0.48 % (1731690)Time elapsed: 0.087 s
% 1.43/0.48 % (1731690)Peak memory usage: 14 MB
% 1.43/0.48 % (1731690)Instructions burned: 330 (million)
% 1.43/0.48 % (1731718)lrs+1002_1_sil=128000:si=on:acc=on:uwa=off:random_seed=3548697951:st=5:s2a=on:i=193:sd=1:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/193Mi)
% 1.43/0.48 % (1731720)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 1.43/0.48 % (1731657) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1731649-1731657"...
% 1.43/0.48 % (1731720)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=1698278542:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2998 on theBenchmark for (2998ds/7Mi)
% 1.43/0.48 % (1731720)Instruction limit reached!
% 1.43/0.48 % (1731720)------------------------------
% 1.43/0.48 % (1731720)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.43/0.48 % (1731720)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.43/0.48 % (1731720)CaDiCaL version: 2.1.3
% 1.43/0.48 % (1731720)Termination reason: Instruction limit
% 1.43/0.48 % (1731720)Termination phase: shuffling
% 1.43/0.48 % (1731720)Time elapsed: 0.004 s
% 1.43/0.48 % (1731720)Peak memory usage: 10 MB
% 1.43/0.48 % (1731720)Instructions burned: 9 (million)
% 1.43/0.48 % (1731719)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=3242126306:i=42:hud=10:rtra=on_2998 on theBenchmark for (2998ds/42Mi)
% 1.43/0.48 % (1731657)...printing done.
% 1.43/0.48 % (1731657)Refutation found. Thanks to Tanya!
% 1.43/0.48 % SZS status Theorem for theBenchmark
% 1.43/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 1.43/0.48 % (1731657)------------------------------
% 1.43/0.48 % (1731657)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.43/0.48 % (1731657)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.43/0.48 % (1731657)CaDiCaL version: 2.1.3
% 1.43/0.48 % (1731657)Termination reason: Refutation
% 1.43/0.48 % (1731657)Time elapsed: 0.179 s
% 1.43/0.48 % (1731657)Peak memory usage: 15 MB
% 1.43/0.48 % (1731657)Instructions burned: 368 (million)
% 1.43/0.48 % (1731649)Success in time 0.224 s
% 1.43/0.48 % Vampire exiting
%------------------------------------------------------------------------------