%------------------------------------------------------------------------------
% File : Vampire---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 THM
% Computer : n007.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:30:45 PM UTC 2026
% Result : Theorem 4.74s 1.46s
% Output : Refutation 5.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 56 ( 16 unt; 0 typ; 6 def)
% Number of atoms : 126 ( 14 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 128 ( 58 ~; 49 |; 11 &)
% ( 7 <=>; 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 : 26 ( 24 usr; 7 prp; 0-3 aty)
% Number of functors : 44 ( 44 usr; 9 con; 0-5 aty)
% Number of variables : 32 ( 0 sgn 30 !; 2 ?; 32 :)
% 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(pred_def_19,type,
sQ13_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $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(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(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(f524,definition,
! [X0: $tType,X2: X0,X1: X0] :
( sQ13_eqProxy(X0,X1,X2)
<=> ( X1 = X2 ) ),
introduced(definition,[new_symbols(definition,[sQ13_eqProxy])],[equality_proxy_definition]) ).
tff(f526,plain,
( sQ13_eqProxy(nat,huffma945805758height(a,t_1),huffma410068972_depth(a,t_1,sK1))
| ~ huffma1518433673istent(a,t_1) ),
inference(equality_proxy_replacement,[],[f291,f524]) ).
tff(f611,plain,
! [X0: a] :
( thesis
| ~ sQ13_eqProxy(nat,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(equality_proxy_replacement,[],[f499,f524]) ).
tff(f613,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ13_eqProxy(X0,X2,X1)
| ~ sQ13_eqProxy(X0,X1,X2) ),
inference(equality_proxy_axiom,[],[f524]) ).
tff(f615,definition,
( spl14_1
<=> ! [X0: a] :
( ~ sQ13_eqProxy(nat,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))) ) ),
introduced(definition,[new_symbols(definition,[spl14_1])],[avatar_definition]) ).
tff(f616,plain,
( ! [X0: a] :
( ~ sQ13_eqProxy(nat,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))) )
| ~ spl14_1 ),
inference(avatar_component_clause,[],[f615]) ).
tff(f618,definition,
( spl14_2
<=> thesis ),
introduced(definition,[new_symbols(definition,[spl14_2])],[avatar_definition]) ).
tff(f619,plain,
( thesis
| ~ spl14_2 ),
inference(avatar_component_clause,[],[f618]) ).
tff(f620,plain,
( spl14_1
| spl14_2 ),
inference(avatar_split_clause,[],[f611,f618,f615]) ).
tff(f622,definition,
( spl14_3
<=> huffma1518433673istent(a,t_1) ),
introduced(definition,[new_symbols(definition,[spl14_3])],[avatar_definition]) ).
tff(f623,plain,
( ~ huffma1518433673istent(a,t_1)
| spl14_3 ),
inference(avatar_component_clause,[],[f622]) ).
tff(f625,definition,
( spl14_4
<=> sQ13_eqProxy(nat,huffma945805758height(a,t_1),huffma410068972_depth(a,t_1,sK1)) ),
introduced(definition,[new_symbols(definition,[spl14_4])],[avatar_definition]) ).
tff(f626,plain,
( sQ13_eqProxy(nat,huffma945805758height(a,t_1),huffma410068972_depth(a,t_1,sK1))
| ~ spl14_4 ),
inference(avatar_component_clause,[],[f625]) ).
tff(f627,plain,
( ~ spl14_3
| spl14_4 ),
inference(avatar_split_clause,[],[f526,f625,f622]) ).
tff(f629,definition,
( spl14_5
<=> pp(aa(fun(a,bool),bool,aa(a,fun(fun(a,bool),bool),member(a),sK1),huffma675207370phabet(a,t_1))) ),
introduced(definition,[new_symbols(definition,[spl14_5])],[avatar_definition]) ).
tff(f630,plain,
( pp(aa(fun(a,bool),bool,aa(a,fun(fun(a,bool),bool),member(a),sK1),huffma675207370phabet(a,t_1)))
| ~ spl14_5 ),
inference(avatar_component_clause,[],[f629]) ).
tff(f631,plain,
( ~ spl14_3
| spl14_5 ),
inference(avatar_split_clause,[],[f292,f629,f622]) ).
tff(f643,plain,
( $false
| ~ spl14_2 ),
inference(resolution,[],[f619,f500]) ).
tff(f644,plain,
~ spl14_2,
inference(avatar_contradiction_clause,[],[f643]) ).
tff(f649,plain,
( ! [X0: a] :
( ~ sQ13_eqProxy(nat,huffma945805758height(a,t_1),huffma410068972_depth(a,t_1,X0))
| ~ pp(aa(fun(a,bool),bool,aa(a,fun(fun(a,bool),bool),member(a),X0),huffma675207370phabet(a,t_1))) )
| ~ spl14_1 ),
inference(resolution,[],[f613,f616]) ).
tff(f654,plain,
huffma1518433673istent(a,t_1),
inference(resolution,[],[f309,f288]) ).
tff(f655,plain,
( $false
| spl14_3 ),
inference(resolution,[],[f654,f623]) ).
tff(f656,plain,
spl14_3,
inference(avatar_contradiction_clause,[],[f655]) ).
tff(f657,plain,
( ~ pp(aa(fun(a,bool),bool,aa(a,fun(fun(a,bool),bool),member(a),sK1),huffma675207370phabet(a,t_1)))
| ~ spl14_1
| ~ spl14_4 ),
inference(resolution,[],[f626,f649]) ).
tff(f658,plain,
( $false
| ~ spl14_1
| ~ spl14_4
| ~ spl14_5 ),
inference(resolution,[],[f657,f630]) ).
tff(f659,plain,
( ~ spl14_1
| ~ spl14_4
| ~ spl14_5 ),
inference(avatar_contradiction_clause,[],[f658]) ).
cnf(s1,plain,
( spl14_1
| spl14_2 ),
inference(sat_conversion,[],[f620]) ).
cnf(s2,plain,
( ~ spl14_3
| spl14_4 ),
inference(sat_conversion,[],[f627]) ).
cnf(s3,plain,
( ~ spl14_3
| spl14_5 ),
inference(sat_conversion,[],[f631]) ).
cnf(s6,plain,
~ spl14_2,
inference(sat_conversion,[],[f644]) ).
cnf(s8,plain,
spl14_3,
inference(sat_conversion,[],[f656]) ).
cnf(s9,plain,
( ~ spl14_1
| ~ spl14_4
| ~ spl14_5 ),
inference(sat_conversion,[],[f659]) ).
cnf(s12,plain,
spl14_5,
inference(rat,[],[s3,s8]) ).
cnf(s13,plain,
spl14_4,
inference(rat,[],[s2,s8]) ).
cnf(s14,plain,
~ spl14_1,
inference(rat,[],[s9,s12,s13]) ).
cnf(s15,plain,
$false,
inference(rat,[],[s1,s6,s14]) ).
tff(f660,plain,
$false,
inference(avatar_sat_refutation,[],[s15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW529_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.23 % Computer : n007.cluster.edu
% 0.10/0.23 % Model : x86_64 x86_64
% 0.10/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.23 % Memory : 8046.5625MB
% 0.10/0.23 % OS : Linux 6.8.0-71-generic
% 0.10/0.23 % CPULimit : 300
% 0.10/0.23 % WCLimit : 300
% 0.10/0.23 % DateTime : Mon Sep 28 14:15:40 UTC 2026
% 0.10/0.23 % CPUTime :
% 0.10/0.23 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.29 Running first-order theorem proving
% 0.10/0.29 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.74/1.46 % (2407951)Detected formulas, will run a generic FOF schedule.
% 4.74/1.46 % (2407958)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=3116066881:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.74/1.46 % (2407958)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 4.74/1.46 % (2407962)dis-21_1_sil=8000:lcm=predicate:random_seed=1544569181:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 4.74/1.46 % (2407960)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1315926583:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.74/1.46 % (2407956)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=4254305119:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.74/1.46 % (2407961)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2686173361:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.74/1.46 % (2407957)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3809284152:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.74/1.46 % (2407959)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3440684470:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.74/1.46 % (2407959)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 4.74/1.46 % (2407959)Refutation not found, incomplete strategy
% 4.74/1.46 % (2407959)------------------------------
% 4.74/1.46 % (2407959)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.74/1.46 % (2407959)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.74/1.46 % (2407959)CaDiCaL version: 2.1.3
% 4.74/1.46 % (2407959)Termination reason: Refutation not found, incomplete strategy
% 4.74/1.46 % (2407959)Time elapsed: 0.007 s
% 4.74/1.46 % (2407959)Peak memory usage: 88 MB
% 4.74/1.46 % (2407959)Instructions burned: 5 (million)
% 4.74/1.46 % (2407962)First to succeed.
% 4.74/1.46 % (2407962)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2407951"
% 4.74/1.46 % (2407961)Also succeeded, but the first one will report.
% 4.74/1.46 % (2407960)Instruction limit reached!
% 4.74/1.46 % (2407960)------------------------------
% 4.74/1.46 % (2407960)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.74/1.46 % (2407960)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.74/1.46 % (2407960)CaDiCaL version: 2.1.3
% 4.74/1.46 % (2407960)Termination reason: Instruction limit
% 4.74/1.46 % (2407960)Termination phase: Saturation
% 4.74/1.46 % (2407960)Time elapsed: 0.110 s
% 4.74/1.46 % (2407960)Peak memory usage: 89 MB
% 4.74/1.46 % (2407960)Instructions burned: 119 (million)
% 4.74/1.46 % Exception at run slice level
% 4.74/1.46 User error: GNN currently only supports monomorphic FOL.
% 4.74/1.46 % (2407972)lrs+10_1_sil=8000:sp=occurrence:random_seed=4217296623:i=285:sd=3:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/285Mi)
% 4.74/1.46 % (2407972)Also succeeded, but the first one will report.
% 4.74/1.46 % (2407959)------------------------------
% 4.74/1.46 % (2407959)------------------------------
% 4.74/1.46 % (2407962)Refutation found. Thanks to Tanya!
% 4.74/1.46 % SZS status Theorem for theBenchmark
% 4.74/1.46 % SZS output start Proof for theBenchmark
% See solution above
% 5.66/1.69 % (2407962)------------------------------
% 5.66/1.69 % (2407962)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.66/1.69 % (2407962)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.66/1.69 % (2407962)CaDiCaL version: 2.1.3
% 5.66/1.69 % (2407962)Termination reason: Refutation
% 5.66/1.69 % (2407962)Time elapsed: 0.016 s
% 5.66/1.69 % (2407962)Peak memory usage: 89 MB
% 5.66/1.69 % (2407962)Instructions burned: 16 (million)
% 5.66/1.69 % (2407962)------------------------------
% 5.66/1.69 % (2407962)------------------------------
% 5.66/1.69 % (2407951)Success in time 0.71 s
% 5.66/1.69 % Vampire exiting
%------------------------------------------------------------------------------