%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWW529_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n004.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 : Tue Sep 29 01:40:23 PM UTC 2026
% Result : Theorem 0.20s 0.29s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 46 ( 15 unt; 0 typ; 3 def)
% Number of atoms : 99 ( 20 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 96 ( 43 ~; 35 |; 11 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 7 ( 6 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 23 ( 21 usr; 5 prp; 0-3 aty)
% Number of functors : 44 ( 44 usr; 9 con; 0-5 aty)
% Number of variables : 36 ( 0 sgn 34 !; 2 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
a: $tType ).
tff(type_def_6,type,
code_term: $tType ).
tff(type_def_7,type,
code_code_numeral: $tType ).
tff(type_def_8,type,
bool: $tType ).
tff(type_def_9,type,
huffma1450048681e_tree: $tType > $tType ).
tff(type_def_10,type,
nat: $tType ).
tff(type_def_11,type,
product_unit: $tType ).
tff(type_def_12,type,
fun: ( $tType * $tType ) > $tType ).
tff(type_def_13,type,
product_prod: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
combb:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,X1) * fun(X2,X0) ) > fun(X2,X1) ) ).
tff(func_def_1,type,
combc:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * X1 ) > fun(X0,X2) ) ).
tff(func_def_2,type,
combk:
!>[X0: $tType,X1: $tType] : ( X0 > fun(X1,X0) ) ).
tff(func_def_3,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * fun(X0,X1) ) > fun(X0,X2) ) ).
tff(func_def_4,type,
one_one:
!>[X0: $tType] : X0 ).
tff(func_def_5,type,
plus_plus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_6,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_7,type,
huffma675207370phabet:
!>[X0: $tType] : ( huffma1450048681e_tree(X0) > fun(X0,bool) ) ).
tff(func_def_8,type,
huffma410068972_depth:
!>[X0: $tType] : ( ( huffma1450048681e_tree(X0) * X0 ) > nat ) ).
tff(func_def_9,type,
huffma945805758height:
!>[X0: $tType] : ( huffma1450048681e_tree(X0) > nat ) ).
tff(func_def_10,type,
huffma928900296x_tree:
!>[X0: $tType] : ( ( code_code_numeral * code_code_numeral ) > fun(product_prod(code_code_numeral,code_code_numeral),product_prod(product_prod(huffma1450048681e_tree(X0),fun(product_unit,code_term)),product_prod(code_code_numeral,code_code_numeral))) ) ).
tff(func_def_11,type,
huffma1146269203erNode:
!>[X0: $tType] : ( ( nat * huffma1450048681e_tree(X0) * huffma1450048681e_tree(X0) ) > huffma1450048681e_tree(X0) ) ).
tff(func_def_12,type,
huffma2021818691e_Leaf:
!>[X0: $tType] : ( ( nat * X0 ) > huffma1450048681e_tree(X0) ) ).
tff(func_def_13,type,
huffma107959123e_case:
!>[X0: $tType,X1: $tType] : ( ( fun(nat,fun(X0,X1)) * fun(nat,fun(huffma1450048681e_tree(X0),fun(huffma1450048681e_tree(X0),X1))) * huffma1450048681e_tree(X0) ) > X1 ) ).
tff(func_def_14,type,
inf_inf:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_15,type,
sup_sup:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_16,type,
bot_bot:
!>[X0: $tType] : X0 ).
tff(func_def_17,type,
random_random:
!>[X0: $tType] : ( code_code_numeral > fun(product_prod(code_code_numeral,code_code_numeral),product_prod(product_prod(X0,fun(product_unit,code_term)),product_prod(code_code_numeral,code_code_numeral))) ) ).
tff(func_def_18,type,
collect:
!>[X0: $tType] : ( fun(X0,bool) > fun(X0,bool) ) ).
tff(func_def_19,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_20,type,
fFalse: bool ).
tff(func_def_21,type,
fTrue: bool ).
tff(func_def_22,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_23,type,
fdisj: fun(bool,fun(bool,bool)) ).
tff(func_def_24,type,
member:
!>[X0: $tType] : fun(X0,fun(fun(X0,bool),bool)) ).
tff(func_def_25,type,
t_1: huffma1450048681e_tree(a) ).
tff(func_def_26,type,
t_2: huffma1450048681e_tree(a) ).
tff(func_def_27,type,
w: nat ).
tff(func_def_28,type,
sK0: a ).
tff(func_def_29,type,
sK1: a ).
tff(func_def_30,type,
sK2:
!>[X0: $tType] : ( huffma1450048681e_tree(X0) > X0 ) ).
tff(func_def_31,type,
sK3:
!>[X0: $tType] : ( fun(X0,bool) > X0 ) ).
tff(func_def_32,type,
sK4:
!>[X0: $tType] : ( fun(X0,bool) > X0 ) ).
tff(func_def_33,type,
sK5:
!>[X0: $tType] : ( fun(X0,bool) > X0 ) ).
tff(func_def_34,type,
sK6:
!>[X0: $tType] : ( fun(X0,bool) > X0 ) ).
tff(func_def_35,type,
sK7:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(X0,bool) ) > X0 ) ).
tff(func_def_36,type,
sK8:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(X0,bool) ) > X0 ) ).
tff(func_def_37,type,
sK9:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(X0,bool) * fun(X0,bool) ) > X0 ) ).
tff(func_def_38,type,
sK10:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(X0,bool) * fun(X0,bool) ) > X0 ) ).
tff(func_def_39,type,
sK11:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(X0,bool) ) > X0 ) ).
tff(func_def_40,type,
sK12:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(X0,bool) ) > X0 ) ).
tff(pred_def_1,type,
enum:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
typerep:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
cl_HOL_Oequal:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
code_term_of:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
one:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
random:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
ab_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
cancel_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
cancel146912293up_add:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
linord219039673up_add:
!>[X0: $tType] : $o ).
tff(pred_def_12,type,
ordere236663937imp_le:
!>[X0: $tType] : $o ).
tff(pred_def_13,type,
finite_finite:
!>[X0: $tType] : ( fun(X0,bool) > $o ) ).
tff(pred_def_14,type,
equal_equal:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_15,type,
huffma1518433673istent:
!>[X0: $tType] : ( huffma1450048681e_tree(X0) > $o ) ).
tff(pred_def_16,type,
ord_less_eq:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_17,type,
pp: bool > $o ).
tff(f1,axiom,
huffma1518433673istent(a,huffma1146269203erNode(a,w,t_1,t_2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_InnerNode_Oprems) ).
tff(f3,axiom,
( huffma1518433673istent(a,t_1)
=> ? [X0: a] :
( pp(aa(fun(a,bool),bool,aa(a,fun(fun(a,bool),bool),member(a),X0),huffma675207370phabet(a,t_1)))
& ( huffma410068972_depth(a,t_1,X0) = huffma945805758height(a,t_1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2_InnerNode_I1_J) ).
tff(f14,axiom,
! [X0: $tType,X1: huffma1450048681e_tree(X0),X2: huffma1450048681e_tree(X0),X3: nat] :
( huffma1518433673istent(X0,huffma1146269203erNode(X0,X3,X2,X1))
<=> ( huffma1518433673istent(X0,X2)
& huffma1518433673istent(X0,X1)
& ( inf_inf(fun(X0,bool),huffma675207370phabet(X0,X2),huffma675207370phabet(X0,X1)) = bot_bot(fun(X0,bool)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_13_consistent_Osimps_I2_J) ).
tff(f150,axiom,
! [X0: $tType,X1: $tType,X2: $tType,X3: X0,X4: X2,X5: fun(X0,fun(X2,X1))] : ( aa(X0,X1,combc(X0,X2,X1,X5,X4),X3) = aa(X2,X1,aa(X0,fun(X2,X1),X5,X3),X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_COMBC_1_1_U) ).
tff(f161,axiom,
! [X0: a] :
( pp(aa(fun(a,bool),bool,aa(a,fun(fun(a,bool),bool),member(a),X0),huffma675207370phabet(a,t_1)))
=> ( ( huffma410068972_depth(a,t_1,X0) = huffma945805758height(a,t_1) )
=> thesis ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f162,conjecture,
thesis,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).
tff(f163,negated_conjecture,
~ thesis,
inference(negated_conjecture,[status(cth)],[f162]) ).
tff(f166,plain,
~ thesis,
inference(flattening,[],[f163]) ).
tff(f172,plain,
( ? [X0: a] :
( pp(aa(fun(a,bool),bool,aa(a,fun(fun(a,bool),bool),member(a),X0),huffma675207370phabet(a,t_1)))
& ( huffma410068972_depth(a,t_1,X0) = huffma945805758height(a,t_1) ) )
| ~ huffma1518433673istent(a,t_1) ),
inference(ennf_transformation,[],[f3]) ).
tff(f234,plain,
! [X0: a] :
( thesis
| ( huffma410068972_depth(a,t_1,X0) != huffma945805758height(a,t_1) )
| ~ pp(aa(fun(a,bool),bool,aa(a,fun(fun(a,bool),bool),member(a),X0),huffma675207370phabet(a,t_1))) ),
inference(ennf_transformation,[],[f161]) ).
tff(f235,plain,
! [X0: a] :
( thesis
| ( huffma410068972_depth(a,t_1,X0) != huffma945805758height(a,t_1) )
| ~ pp(aa(fun(a,bool),bool,aa(a,fun(fun(a,bool),bool),member(a),X0),huffma675207370phabet(a,t_1))) ),
inference(flattening,[],[f234]) ).
tff(f237,plain,
( ( pp(aa(fun(a,bool),bool,aa(a,fun(fun(a,bool),bool),member(a),sK1),huffma675207370phabet(a,t_1)))
& ( huffma945805758height(a,t_1) = huffma410068972_depth(a,t_1,sK1) ) )
| ~ huffma1518433673istent(a,t_1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X0,sK1)],[f172]) ).
tff(f241,plain,
! [X0: $tType,X1: huffma1450048681e_tree(X0),X2: huffma1450048681e_tree(X0),X3: nat] :
( ( huffma1518433673istent(X0,huffma1146269203erNode(X0,X3,X2,X1))
| ~ huffma1518433673istent(X0,X2)
| ~ huffma1518433673istent(X0,X1)
| ( inf_inf(fun(X0,bool),huffma675207370phabet(X0,X2),huffma675207370phabet(X0,X1)) != bot_bot(fun(X0,bool)) ) )
& ( ( huffma1518433673istent(X0,X2)
& huffma1518433673istent(X0,X1)
& ( inf_inf(fun(X0,bool),huffma675207370phabet(X0,X2),huffma675207370phabet(X0,X1)) = bot_bot(fun(X0,bool)) ) )
| ~ huffma1518433673istent(X0,huffma1146269203erNode(X0,X3,X2,X1)) ) ),
inference(nnf_transformation,[],[f14]) ).
tff(f242,plain,
! [X0: $tType,X1: huffma1450048681e_tree(X0),X2: huffma1450048681e_tree(X0),X3: nat] :
( ( huffma1518433673istent(X0,huffma1146269203erNode(X0,X3,X2,X1))
| ~ huffma1518433673istent(X0,X2)
| ~ huffma1518433673istent(X0,X1)
| ( inf_inf(fun(X0,bool),huffma675207370phabet(X0,X2),huffma675207370phabet(X0,X1)) != bot_bot(fun(X0,bool)) ) )
& ( ( huffma1518433673istent(X0,X2)
& huffma1518433673istent(X0,X1)
& ( inf_inf(fun(X0,bool),huffma675207370phabet(X0,X2),huffma675207370phabet(X0,X1)) = bot_bot(fun(X0,bool)) ) )
| ~ huffma1518433673istent(X0,huffma1146269203erNode(X0,X3,X2,X1)) ) ),
inference(flattening,[],[f241]) ).
tff(f288,plain,
huffma1518433673istent(a,huffma1146269203erNode(a,w,t_1,t_2)),
inference(cnf_transformation,[],[f1]) ).
tff(f291,plain,
( ( huffma945805758height(a,t_1) = huffma410068972_depth(a,t_1,sK1) )
| ~ huffma1518433673istent(a,t_1) ),
inference(cnf_transformation,[],[f237]) ).
tff(f292,plain,
( pp(aa(fun(a,bool),bool,aa(a,fun(fun(a,bool),bool),member(a),sK1),huffma675207370phabet(a,t_1)))
| ~ huffma1518433673istent(a,t_1) ),
inference(cnf_transformation,[],[f237]) ).
tff(f309,plain,
! [X0: $tType,X2: huffma1450048681e_tree(X0),X3: nat,X1: huffma1450048681e_tree(X0)] :
( ~ huffma1518433673istent(X0,huffma1146269203erNode(X0,X3,X2,X1))
| huffma1518433673istent(X0,X2) ),
inference(cnf_transformation,[],[f242]) ).
tff(f488,plain,
! [X1: $tType,X0: $tType,X2: $tType,X3: X0,X4: X2,X5: fun(X0,fun(X2,X1))] : ( aa(X0,X1,combc(X0,X2,X1,X5,X4),X3) = aa(X2,X1,aa(X0,fun(X2,X1),X5,X3),X4) ),
inference(cnf_transformation,[],[f150]) ).
tff(f499,plain,
! [X0: a] :
( thesis
| ( huffma410068972_depth(a,t_1,X0) != huffma945805758height(a,t_1) )
| ~ pp(aa(fun(a,bool),bool,aa(a,fun(fun(a,bool),bool),member(a),X0),huffma675207370phabet(a,t_1))) ),
inference(cnf_transformation,[],[f235]) ).
tff(f500,plain,
~ thesis,
inference(cnf_transformation,[],[f166]) ).
tff(f501,plain,
! [X0: a] :
( ( huffma410068972_depth(a,t_1,X0) != huffma945805758height(a,t_1) )
| ~ pp(aa(fun(a,bool),bool,aa(a,fun(fun(a,bool),bool),member(a),X0),huffma675207370phabet(a,t_1))) ),
inference(forward_subsumption_resolution,[],[f499,f500]) ).
tff(f553,definition,
( spl13_1
<=> huffma1518433673istent(a,t_1) ),
introduced(definition,[new_symbols(definition,[spl13_1])],[avatar_definition]) ).
tff(f555,plain,
( ~ huffma1518433673istent(a,t_1)
| spl13_1 ),
inference(avatar_component_clause,[],[f553]) ).
tff(f557,definition,
( spl13_2
<=> ( huffma945805758height(a,t_1) = huffma410068972_depth(a,t_1,sK1) ) ),
introduced(definition,[new_symbols(definition,[spl13_2])],[avatar_definition]) ).
tff(f559,plain,
( ( huffma945805758height(a,t_1) = huffma410068972_depth(a,t_1,sK1) )
| ~ spl13_2 ),
inference(avatar_component_clause,[],[f557]) ).
tff(f560,plain,
( ~ spl13_1
| spl13_2 ),
inference(avatar_split_clause,[],[f291,f557,f553]) ).
tff(f561,plain,
( pp(aa(a,bool,combc(a,fun(a,bool),bool,member(a),huffma675207370phabet(a,t_1)),sK1))
| ~ huffma1518433673istent(a,t_1) ),
inference(forward_demodulation,[],[f292,f488]) ).
tff(f572,plain,
! [X0: a] :
( ~ pp(aa(a,bool,combc(a,fun(a,bool),bool,member(a),huffma675207370phabet(a,t_1)),X0))
| ( huffma410068972_depth(a,t_1,X0) != huffma945805758height(a,t_1) ) ),
inference(forward_demodulation,[],[f501,f488]) ).
tff(f602,definition,
( spl13_5
<=> pp(aa(a,bool,combc(a,fun(a,bool),bool,member(a),huffma675207370phabet(a,t_1)),sK1)) ),
introduced(definition,[new_symbols(definition,[spl13_5])],[avatar_definition]) ).
tff(f604,plain,
( pp(aa(a,bool,combc(a,fun(a,bool),bool,member(a),huffma675207370phabet(a,t_1)),sK1))
| ~ spl13_5 ),
inference(avatar_component_clause,[],[f602]) ).
tff(f605,plain,
( ~ spl13_1
| spl13_5 ),
inference(avatar_split_clause,[],[f561,f602,f553]) ).
tff(f765,plain,
huffma1518433673istent(a,t_1),
inference(resolution,[],[f309,f288]) ).
tff(f766,plain,
( $false
| spl13_1 ),
inference(forward_subsumption_resolution,[],[f765,f555]) ).
tff(f767,plain,
spl13_1,
inference(avatar_contradiction_clause,[],[f766]) ).
tff(f1147,plain,
( ( huffma945805758height(a,t_1) != huffma410068972_depth(a,t_1,sK1) )
| ~ spl13_5 ),
inference(resolution,[],[f604,f572]) ).
tff(f1160,plain,
( $false
| ~ spl13_2
| ~ spl13_5 ),
inference(forward_subsumption_resolution,[],[f1147,f559]) ).
tff(f1161,plain,
( ~ spl13_2
| ~ spl13_5 ),
inference(avatar_contradiction_clause,[],[f1160]) ).
cnf(s1,plain,
( ~ spl13_1
| spl13_2 ),
inference(sat_conversion,[],[f560]) ).
cnf(s3,plain,
( ~ spl13_1
| spl13_5 ),
inference(sat_conversion,[],[f605]) ).
cnf(s7,plain,
spl13_1,
inference(sat_conversion,[],[f767]) ).
cnf(s12,plain,
( ~ spl13_2
| ~ spl13_5 ),
inference(sat_conversion,[],[f1161]) ).
cnf(s14,plain,
spl13_5,
inference(rat,[],[s3,s7]) ).
cnf(s15,plain,
~ spl13_2,
inference(rat,[],[s12,s14]) ).
cnf(s20,plain,
$false,
inference(rat,[],[s1,s15,s7]) ).
tff(f1164,plain,
$false,
inference(avatar_sat_refutation,[],[s20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWW529_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n004.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Mon Sep 28 14:17:37 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 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.20/0.29 % (375934)Will run a generic schedule for satisfiability detection.
% 0.20/0.29 % (375942)dis+10_1_sil=32000:sp=arity:random_seed=4122412058:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.29 % (375940)% WARNING: option uhcvi not known.
% 0.20/0.29 % (375939)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1165472259_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.29 % (375940)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=240112735:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.29 % (375941)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2137013388:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.29 % (375943)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4026782348:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.29 % (375944)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2345983796:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.29 % (375945)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3086179865:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.29 % Exception at run slice level
% 0.20/0.29 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.29 % (375944) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-375934-375944"...
% 0.20/0.29 % (375953)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=842525866:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.29 % (375942)Instruction limit reached!
% 0.20/0.29 % (375942)------------------------------
% 0.20/0.29 % (375942)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (375942)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (375942)CaDiCaL version: 2.1.3
% 0.20/0.29 % (375942)Termination reason: Instruction limit
% 0.20/0.29 % (375942)Termination phase: Saturation
% 0.20/0.29 % (375942)Time elapsed: 0.032 s
% 0.20/0.29 % (375942)Peak memory usage: 12 MB
% 0.20/0.29 % (375942)Instructions burned: 103 (million)
% 0.20/0.29 % (375944)...printing done.
% 0.20/0.29 % (375944)Refutation found. Thanks to Tanya!
% 0.20/0.29 % SZS status Theorem for theBenchmark
% 0.20/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.30 % (375944)------------------------------
% 0.20/0.30 % (375944)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (375944)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (375944)CaDiCaL version: 2.1.3
% 0.20/0.30 % (375944)Termination reason: Refutation
% 0.20/0.30 % (375944)Time elapsed: 0.025 s
% 0.20/0.30 % (375944)Peak memory usage: 13 MB
% 0.20/0.30 % (375944)Instructions burned: 39 (million)
% 0.20/0.30 % (375934)Success in time 0.066 s
% 0.20/0.30 % Vampire exiting
%------------------------------------------------------------------------------