%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ITP069^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:10:34 AM UTC 2026
% Result : Theorem 0.09s 0.19s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 18 unt; 0 typ; 0 def)
% Number of atoms : 106 ( 36 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 262 ( 21 ~; 14 |; 0 &; 218 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 11 ( 10 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 145 ( 142 usr; 7 con; 0-4 aty)
% Number of variables : 6 ( 0 ^; 6 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
set_Pr158363655iset_a: $tType ).
thf(type_def_6,type,
produc1127127335iset_a: $tType ).
thf(type_def_7,type,
set_Product_prod_a_a: $tType ).
thf(type_def_8,type,
multiset_multiset_a: $tType ).
thf(type_def_9,type,
set_multiset_a: $tType ).
thf(type_def_10,type,
product_prod_a_a: $tType ).
thf(type_def_11,type,
multiset_a: $tType ).
thf(type_def_12,type,
tree_a: $tType ).
thf(type_def_13,type,
set_a: $tType ).
thf(type_def_14,type,
a: $tType ).
thf(type_def_15,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
minus_1649712171iset_a: multiset_a > multiset_a > multiset_a ).
thf(func_def_1,type,
plus_plus_multiset_a: multiset_a > multiset_a > multiset_a ).
thf(func_def_2,type,
zero_zero_multiset_a: multiset_a ).
thf(func_def_3,type,
nO_MAT1617603563iset_a: multiset_a > multiset_a > $o ).
thf(func_def_4,type,
heapIm970322378pify_a: tree_a > tree_a ).
thf(func_def_5,type,
heapIm1140443833left_a: tree_a > tree_a ).
thf(func_def_6,type,
heapIm1257206334ight_a: tree_a > tree_a ).
thf(func_def_7,type,
heapIm1091024090Down_a: tree_a > tree_a ).
thf(func_def_8,type,
e_a: tree_a ).
thf(func_def_9,type,
t_a: a > tree_a > tree_a > tree_a ).
thf(func_def_10,type,
in_tree_a: a > tree_a > $o ).
thf(func_def_11,type,
is_heap_a: tree_a > $o ).
thf(func_def_12,type,
multiset_a2: tree_a > multiset_a ).
thf(func_def_13,type,
val_a: tree_a > a ).
thf(func_def_14,type,
lattic146396397_Max_a: set_a > a ).
thf(func_def_15,type,
add_mset_a: a > multiset_a > multiset_a ).
thf(func_def_16,type,
comm_m315775925iset_a: ( multiset_a > multiset_a > multiset_a ) > multiset_a > multiset_multiset_a > multiset_a ).
thf(func_def_17,type,
fold_m382157835iset_a: ( multiset_a > multiset_a > multiset_a ) > multiset_a > multiset_multiset_a > multiset_a ).
thf(func_def_18,type,
fold_m364285649iset_a: ( a > multiset_a > multiset_a ) > multiset_a > multiset_a > multiset_a ).
thf(func_def_19,type,
is_empty_a: multiset_a > $o ).
thf(func_def_20,type,
mult1_a: set_Product_prod_a_a > set_Pr158363655iset_a ).
thf(func_def_21,type,
mult_a: set_Product_prod_a_a > set_Pr158363655iset_a ).
thf(func_def_22,type,
set_mset_multiset_a: multiset_multiset_a > set_multiset_a ).
thf(func_def_23,type,
set_mset_a: multiset_a > set_a ).
thf(func_def_24,type,
ord_le1199012836iset_a: multiset_a > multiset_a > $o ).
thf(func_def_25,type,
ord_less_eq_a: a > a > $o ).
thf(func_def_26,type,
order_Greatest_a: ( a > $o ) > a ).
thf(func_def_27,type,
produc2037245207iset_a: multiset_a > multiset_a > produc1127127335iset_a ).
thf(func_def_28,type,
product_Pair_a_a: a > a > product_prod_a_a ).
thf(func_def_29,type,
irrefl_a: set_Product_prod_a_a > $o ).
thf(func_def_30,type,
trans_a: set_Product_prod_a_a > $o ).
thf(func_def_31,type,
collect_a: ( a > $o ) > set_a ).
thf(func_def_32,type,
member_multiset_a: multiset_a > set_multiset_a > $o ).
thf(func_def_33,type,
member340150864iset_a: produc1127127335iset_a > set_Pr158363655iset_a > $o ).
thf(func_def_34,type,
member449909584od_a_a: product_prod_a_a > set_Product_prod_a_a > $o ).
thf(func_def_35,type,
member_a: a > set_a > $o ).
thf(func_def_36,type,
l: tree_a ).
thf(func_def_37,type,
r: tree_a ).
thf(func_def_38,type,
v: a ).
thf(func_def_42,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_43,type,
vAND: $o > $o > $o ).
thf(func_def_44,type,
vOR: $o > $o > $o ).
thf(func_def_45,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_46,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_47,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_48,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_49,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_50,type,
vIMP: $o > $o > $o ).
thf(func_def_51,type,
sP0: a > a > a > $o ).
thf(func_def_52,type,
sP1: a > a > a > $o ).
thf(func_def_53,type,
sP2: a > a > a > $o ).
thf(func_def_54,type,
sK3: tree_a > a ).
thf(func_def_55,type,
sK4: tree_a > a ).
thf(func_def_56,type,
sK5: tree_a > tree_a ).
thf(func_def_57,type,
sK6: tree_a > tree_a ).
thf(func_def_58,type,
sK7: tree_a > a ).
thf(func_def_59,type,
sK8: tree_a > tree_a ).
thf(func_def_60,type,
sK9: tree_a > tree_a ).
thf(func_def_61,type,
sK10: tree_a > a ).
thf(func_def_62,type,
sK11: tree_a > a ).
thf(func_def_63,type,
sK12: tree_a > tree_a ).
thf(func_def_64,type,
sK13: tree_a > tree_a ).
thf(func_def_65,type,
sK14: tree_a > a ).
thf(func_def_66,type,
sK15: tree_a > a ).
thf(func_def_67,type,
sK16: tree_a > tree_a ).
thf(func_def_68,type,
sK17: tree_a > tree_a ).
thf(func_def_69,type,
sK18: tree_a > a ).
thf(func_def_70,type,
sK19: tree_a > a ).
thf(func_def_71,type,
sK20: tree_a > a ).
thf(func_def_72,type,
sK21: tree_a > tree_a ).
thf(func_def_73,type,
sK22: tree_a > tree_a ).
thf(func_def_74,type,
sK23: tree_a > a ).
thf(func_def_75,type,
sK24: tree_a > tree_a ).
thf(func_def_76,type,
sK25: tree_a > tree_a ).
thf(func_def_77,type,
sK26: tree_a > a ).
thf(func_def_78,type,
sK27: tree_a > a ).
thf(func_def_79,type,
sK28: tree_a > tree_a ).
thf(func_def_80,type,
sK29: tree_a > tree_a ).
thf(func_def_81,type,
sK30: tree_a > a ).
thf(func_def_82,type,
sK31: tree_a > a ).
thf(func_def_83,type,
sK32: tree_a > tree_a ).
thf(func_def_84,type,
sK33: tree_a > tree_a ).
thf(func_def_85,type,
sK34: tree_a > a ).
thf(func_def_86,type,
sK35: tree_a > a ).
thf(func_def_87,type,
sK36: tree_a > tree_a ).
thf(func_def_88,type,
sK37: tree_a > tree_a ).
thf(func_def_89,type,
sK38: ( tree_a > $o ) > a ).
thf(func_def_90,type,
sK39: ( tree_a > $o ) > tree_a ).
thf(func_def_91,type,
sK40: ( tree_a > $o ) > tree_a ).
thf(func_def_92,type,
sK41: a > tree_a > tree_a ).
thf(func_def_93,type,
sK42: a > tree_a > a ).
thf(func_def_94,type,
sK43: a > tree_a > tree_a ).
thf(func_def_95,type,
sK44: ( a > a ) > a ).
thf(func_def_96,type,
sK45: ( a > a ) > a ).
thf(func_def_97,type,
sK46: ( a > a ) > a ).
thf(func_def_98,type,
sK47: ( a > a ) > a ).
thf(func_def_99,type,
sK48: ( a > a ) > a ).
thf(func_def_100,type,
sK49: ( a > a ) > a ).
thf(func_def_101,type,
sK50: ( a > a ) > a ).
thf(func_def_102,type,
sK51: ( a > a ) > a ).
thf(func_def_103,type,
sK52: ( a > a > $o ) > a ).
thf(func_def_104,type,
sK53: ( a > a > $o ) > a ).
thf(func_def_105,type,
sK54: ( a > a > $o ) > a ).
thf(func_def_106,type,
sK55: ( a > a > $o ) > a ).
thf(func_def_107,type,
sK56: multiset_a > a > multiset_a ).
thf(func_def_108,type,
sK57: multiset_a > a > multiset_a ).
thf(func_def_109,type,
sK58: a > ( a > $o ) > a ).
thf(func_def_110,type,
sK59: ( a > $o ) > ( a > $o ) > a ).
thf(func_def_111,type,
sK60: a > ( a > $o ) > a ).
thf(func_def_112,type,
sK61: ( multiset_a > $o ) > a ).
thf(func_def_113,type,
sK62: ( multiset_a > $o ) > multiset_a ).
thf(func_def_114,type,
sK63: ( multiset_a > $o ) > a ).
thf(func_def_115,type,
sK64: ( multiset_a > $o ) > multiset_a ).
thf(func_def_116,type,
sK65: multiset_a > a ).
thf(func_def_117,type,
sK66: multiset_a > multiset_a ).
thf(func_def_118,type,
sK67: ( multiset_a > $o ) > a ).
thf(func_def_119,type,
sK68: ( multiset_a > $o ) > multiset_a ).
thf(func_def_120,type,
sK69: ( multiset_a > multiset_a > $o ) > a ).
thf(func_def_121,type,
sK70: ( multiset_a > multiset_a > $o ) > multiset_a ).
thf(func_def_122,type,
sK71: ( multiset_a > multiset_a > $o ) > multiset_a ).
thf(func_def_123,type,
sK72: ( multiset_a > multiset_a > $o ) > a ).
thf(func_def_124,type,
sK73: ( multiset_a > multiset_a > $o ) > multiset_a ).
thf(func_def_125,type,
sK74: ( multiset_a > multiset_a > $o ) > multiset_a ).
thf(func_def_126,type,
sK75: multiset_a > multiset_a ).
thf(func_def_127,type,
sK76: multiset_a > a ).
thf(func_def_128,type,
sK77: multiset_a > a ).
thf(func_def_129,type,
sK78: set_Product_prod_a_a > multiset_a > multiset_a > a ).
thf(func_def_130,type,
sK79: set_Product_prod_a_a > multiset_a > multiset_a > multiset_a ).
thf(func_def_131,type,
sK80: set_Product_prod_a_a > multiset_a > multiset_a > multiset_a ).
thf(func_def_132,type,
sK81: set_Product_prod_a_a > multiset_a > a > a ).
thf(func_def_133,type,
sK82: set_Product_prod_a_a > multiset_a > a > multiset_a > multiset_a ).
thf(func_def_134,type,
sK83: set_Product_prod_a_a > multiset_a > a > multiset_a > multiset_a ).
thf(func_def_135,type,
sK84: set_Product_prod_a_a > multiset_a > multiset_a > a ).
thf(func_def_136,type,
sK85: multiset_a > multiset_a > set_Product_prod_a_a > multiset_a ).
thf(func_def_137,type,
sK86: multiset_a > multiset_a > set_Product_prod_a_a > multiset_a ).
thf(func_def_138,type,
sK87: multiset_a > multiset_a > set_Product_prod_a_a > multiset_a ).
thf(func_def_139,type,
sK88: a > multiset_a > multiset_a > set_Product_prod_a_a > a ).
thf(func_def_140,type,
vNOT: $o > $o ).
thf(func_def_141,type,
sK89: a > multiset_multiset_a > multiset_a ).
thf(func_def_142,type,
sK90: multiset_multiset_a > multiset_a ).
thf(func_def_143,type,
sK91: multiset_a > multiset_a > a > a > multiset_a ).
thf(f1,axiom,
is_heap_a @ ( heapIm970322378pify_a @ r ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_T_Ohyps_I2_J) ).
thf(f2,axiom,
is_heap_a @ ( heapIm970322378pify_a @ l ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_T_Ohyps_I1_J) ).
thf(f3,axiom,
( ( is_heap_a @ ( heapIm970322378pify_a @ l ) )
=> ( ( is_heap_a @ ( heapIm970322378pify_a @ r ) )
=> ( ( ( t_a @ v @ ( heapIm970322378pify_a @ l ) @ ( heapIm970322378pify_a @ r ) )
= ( t_a @ v @ ( heapIm970322378pify_a @ l ) @ ( heapIm970322378pify_a @ r ) ) )
=> ( is_heap_a @ ( heapIm1091024090Down_a @ ( t_a @ v @ ( heapIm970322378pify_a @ l ) @ ( heapIm970322378pify_a @ r ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2__092_060open_062_092_060lbrakk_062is__heap_A_Iheapify_Al_J_059_Ais__heap_A_Iheapify_Ar_J_059_AT_Av_A_Iheapify_Al_J_A_Iheapify_Ar_J_A_061_AT_Av_A_Iheapify_Al_J_A_Iheapify_Ar_J_092_060rbrakk_062_A_092_060Longrightarrow_062_Ais__heap_A_IsiftDown_A_IT_Av_A_Iheapify_Al_J_A_Iheapify_Ar_J_J_J_092_060close_062) ).
thf(f4,axiom,
! [X0: a,X1: tree_a,X2: tree_a] :
( ( heapIm970322378pify_a @ ( t_a @ X0 @ X1 @ X2 ) )
= ( heapIm1091024090Down_a @ ( t_a @ X0 @ ( heapIm970322378pify_a @ X1 ) @ ( heapIm970322378pify_a @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_heapify_Osimps_I2_J) ).
thf(f143,conjecture,
is_heap_a @ ( heapIm970322378pify_a @ ( t_a @ v @ l @ r ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(f144,negated_conjecture,
~ ( is_heap_a @ ( heapIm970322378pify_a @ ( t_a @ v @ l @ r ) ) ),
inference(negated_conjecture,[status(cth)],[f143]) ).
thf(f145,plain,
is_heap_a @ ( heapIm970322378pify_a @ r ),
inference(rectify,[],[f1]) ).
thf(f146,plain,
( ( is_heap_a @ ( heapIm970322378pify_a @ r ) )
= $true ),
inference(fool_elimination,[],[f145]) ).
thf(f147,plain,
is_heap_a @ ( heapIm970322378pify_a @ l ),
inference(rectify,[],[f2]) ).
thf(f148,plain,
( ( is_heap_a @ ( heapIm970322378pify_a @ l ) )
= $true ),
inference(fool_elimination,[],[f147]) ).
thf(f149,plain,
( ( is_heap_a @ ( heapIm970322378pify_a @ l ) )
=> ( ( is_heap_a @ ( heapIm970322378pify_a @ r ) )
=> ( ( ( t_a @ v @ ( heapIm970322378pify_a @ l ) @ ( heapIm970322378pify_a @ r ) )
= ( t_a @ v @ ( heapIm970322378pify_a @ l ) @ ( heapIm970322378pify_a @ r ) ) )
=> ( is_heap_a @ ( heapIm1091024090Down_a @ ( t_a @ v @ ( heapIm970322378pify_a @ l ) @ ( heapIm970322378pify_a @ r ) ) ) ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f150,plain,
( ( ( is_heap_a @ ( heapIm970322378pify_a @ l ) )
= $true )
=> ( ( ( is_heap_a @ ( heapIm970322378pify_a @ r ) )
= $true )
=> ( ( ( t_a @ v @ ( heapIm970322378pify_a @ l ) @ ( heapIm970322378pify_a @ r ) )
= ( t_a @ v @ ( heapIm970322378pify_a @ l ) @ ( heapIm970322378pify_a @ r ) ) )
=> ( ( is_heap_a @ ( heapIm1091024090Down_a @ ( t_a @ v @ ( heapIm970322378pify_a @ l ) @ ( heapIm970322378pify_a @ r ) ) ) )
= $true ) ) ) ),
inference(fool_elimination,[],[f149]) ).
thf(f335,plain,
~ ( is_heap_a @ ( heapIm970322378pify_a @ ( t_a @ v @ l @ r ) ) ),
inference(rectify,[],[f144]) ).
thf(f336,plain,
( ( is_heap_a @ ( heapIm970322378pify_a @ ( t_a @ v @ l @ r ) ) )
!= $true ),
inference(fool_elimination,[],[f335]) ).
thf(f350,plain,
( ( is_heap_a @ ( heapIm970322378pify_a @ ( t_a @ v @ l @ r ) ) )
!= $true ),
inference(flattening,[],[f336]) ).
thf(f351,plain,
( ( ( is_heap_a @ ( heapIm1091024090Down_a @ ( t_a @ v @ ( heapIm970322378pify_a @ l ) @ ( heapIm970322378pify_a @ r ) ) ) )
= $true )
| ( ( t_a @ v @ ( heapIm970322378pify_a @ l ) @ ( heapIm970322378pify_a @ r ) )
!= ( t_a @ v @ ( heapIm970322378pify_a @ l ) @ ( heapIm970322378pify_a @ r ) ) )
| ( ( is_heap_a @ ( heapIm970322378pify_a @ r ) )
!= $true )
| ( ( is_heap_a @ ( heapIm970322378pify_a @ l ) )
!= $true ) ),
inference(ennf_transformation,[],[f150]) ).
thf(f352,plain,
( ( ( is_heap_a @ ( heapIm1091024090Down_a @ ( t_a @ v @ ( heapIm970322378pify_a @ l ) @ ( heapIm970322378pify_a @ r ) ) ) )
= $true )
| ( ( t_a @ v @ ( heapIm970322378pify_a @ l ) @ ( heapIm970322378pify_a @ r ) )
!= ( t_a @ v @ ( heapIm970322378pify_a @ l ) @ ( heapIm970322378pify_a @ r ) ) )
| ( ( is_heap_a @ ( heapIm970322378pify_a @ r ) )
!= $true )
| ( ( is_heap_a @ ( heapIm970322378pify_a @ l ) )
!= $true ) ),
inference(flattening,[],[f351]) ).
thf(f501,plain,
( ( is_heap_a @ ( heapIm970322378pify_a @ r ) )
= $true ),
inference(cnf_transformation,[],[f146]) ).
thf(f502,plain,
( ( is_heap_a @ ( heapIm970322378pify_a @ l ) )
= $true ),
inference(cnf_transformation,[],[f148]) ).
thf(f503,plain,
( ( ( is_heap_a @ ( heapIm1091024090Down_a @ ( t_a @ v @ ( heapIm970322378pify_a @ l ) @ ( heapIm970322378pify_a @ r ) ) ) )
= $true )
| ( ( t_a @ v @ ( heapIm970322378pify_a @ l ) @ ( heapIm970322378pify_a @ r ) )
!= ( t_a @ v @ ( heapIm970322378pify_a @ l ) @ ( heapIm970322378pify_a @ r ) ) )
| ( ( is_heap_a @ ( heapIm970322378pify_a @ r ) )
!= $true )
| ( ( is_heap_a @ ( heapIm970322378pify_a @ l ) )
!= $true ) ),
inference(cnf_transformation,[],[f352]) ).
thf(f504,plain,
! [X2: tree_a,X0: a,X1: tree_a] :
( ( heapIm970322378pify_a @ ( t_a @ X0 @ X1 @ X2 ) )
= ( heapIm1091024090Down_a @ ( t_a @ X0 @ ( heapIm970322378pify_a @ X1 ) @ ( heapIm970322378pify_a @ X2 ) ) ) ),
inference(cnf_transformation,[],[f4]) ).
thf(f700,plain,
( ( is_heap_a @ ( heapIm970322378pify_a @ ( t_a @ v @ l @ r ) ) )
!= $true ),
inference(cnf_transformation,[],[f350]) ).
thf(f1066,plain,
( ( ( is_heap_a @ ( heapIm1091024090Down_a @ ( t_a @ v @ ( heapIm970322378pify_a @ l ) @ ( heapIm970322378pify_a @ r ) ) ) )
= $true )
| ( ( is_heap_a @ ( heapIm970322378pify_a @ r ) )
!= $true )
| ( ( is_heap_a @ ( heapIm970322378pify_a @ l ) )
!= $true ) ),
inference(trivial_inequality_removal,[],[f503]) ).
thf(f1087,plain,
( ( ( is_heap_a @ ( heapIm970322378pify_a @ ( t_a @ v @ l @ r ) ) )
= $true )
| ( ( is_heap_a @ ( heapIm970322378pify_a @ r ) )
!= $true )
| ( ( is_heap_a @ ( heapIm970322378pify_a @ l ) )
!= $true ) ),
inference(forward_demodulation,[],[f1066,f504]) ).
thf(f1101,plain,
( ( ( is_heap_a @ ( heapIm970322378pify_a @ r ) )
!= $true )
| ( ( is_heap_a @ ( heapIm970322378pify_a @ l ) )
!= $true ) ),
inference(forward_subsumption_resolution,[],[f1087,f700]) ).
thf(f1113,plain,
( ( is_heap_a @ ( heapIm970322378pify_a @ l ) )
!= $true ),
inference(forward_subsumption_resolution,[],[f1101,f501]) ).
thf(f1120,plain,
$false,
inference(forward_subsumption_resolution,[],[f1113,f502]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : ITP069^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.00/0.11 % Computer : n012.cluster.edu
% 0.00/0.11 % Model : x86_64 x86_64
% 0.00/0.11 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11 % Memory : 8046.5625MB
% 0.00/0.11 % OS : Linux 6.8.0-71-generic
% 0.00/0.11 % CPULimit : 300
% 0.00/0.11 % WCLimit : 300
% 0.00/0.11 % DateTime : Tue Sep 29 19:46:03 UTC 2026
% 0.00/0.11 % CPUTime :
% 0.00/0.11 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.13 Running first-order model finding
% 0.09/0.13 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.19 % (595308)Will run a generic schedule for satisfiability detection.
% 0.09/0.19 % (595318)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4089044248:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.19 % (595317)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3650266703:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.19 % (595313)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1938927035_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.19 % (595316)dis+10_1_sil=32000:sp=arity:random_seed=679438075:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.19 % (595315)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3464249246:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.19 % (595319)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2611090952:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.19 % (595314)% WARNING: option uhcvi not known.
% 0.09/0.19 % (595317)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.09/0.19 % (595314)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3036701275:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.19 % Exception at run slice level
% 0.09/0.19 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.09/0.19 % (595314)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.09/0.19 % (595318) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-595308-595318"...
% 0.09/0.19 % (595318)...printing done.
% 0.09/0.19 % (595318)Refutation found. Thanks to Tanya!
% 0.09/0.19 % SZS status Theorem for theBenchmark
% 0.09/0.19 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.19 % (595318)------------------------------
% 0.09/0.19 % (595318)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.19 % (595318)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.19 % (595318)CaDiCaL version: 2.1.3
% 0.09/0.19 % (595318)Termination reason: Refutation
% 0.09/0.19 % (595318)Time elapsed: 0.022 s
% 0.09/0.19 % (595318)Peak memory usage: 13 MB
% 0.09/0.19 % (595318)Instructions burned: 91 (million)
% 0.09/0.19 % (595308)Success in time 0.053 s
% 0.09/0.19 % Vampire exiting
%------------------------------------------------------------------------------