%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWW602_2 : TPTP v9.3.1. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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:54 PM UTC 2026
% Result : Theorem 12.78s 2.79s
% Output : Refutation 14.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 22
% Syntax : Number of formulae : 104 ( 11 unt; 0 typ; 16 def)
% Number of atoms : 723 ( 160 equ)
% Maximal formula atoms : 61 ( 6 avg)
% Number of connectives : 931 ( 312 ~; 150 |; 343 &)
% ( 30 <=>; 96 =>; 0 <=; 0 <~>)
% Maximal formula depth : 56 ( 7 avg)
% Maximal term depth : 8 ( 2 avg)
% Number arithmetic : 1210 ( 319 atm; 400 fun; 449 num; 42 var)
% Number of types : 9 ( 7 usr; 1 ari; 0 dat; 0 cdt)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 25 ( 21 usr; 17 prp; 0-3 aty)
% Number of functors : 72 ( 66 usr; 23 con; 0-5 aty)
% Number of variables : 279 ( 199 !; 80 ?; 279 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
uni: $tType ).
tff(type_def_6,type,
ty: $tType ).
tff(type_def_7,type,
bool1: $tType ).
tff(type_def_8,type,
tuple02: $tType ).
tff(type_def_9,type,
tree1: $tType ).
tff(type_def_10,type,
list_tree: $tType ).
tff(type_def_11,type,
map_int_lplist_treerp: $tType ).
tff(func_def_0,type,
witness1: ty > uni ).
tff(func_def_1,type,
int: ty ).
tff(func_def_2,type,
real: ty ).
tff(func_def_3,type,
bool: ty ).
tff(func_def_4,type,
true1: bool1 ).
tff(func_def_5,type,
false1: bool1 ).
tff(func_def_6,type,
match_bool1: ( ty * bool1 * uni * uni ) > uni ).
tff(func_def_7,type,
tuple0: ty ).
tff(func_def_8,type,
tuple03: tuple02 ).
tff(func_def_9,type,
qtmark: ty ).
tff(func_def_12,type,
list: ty > ty ).
tff(func_def_13,type,
nil: ty > uni ).
tff(func_def_14,type,
cons: ( ty * uni * uni ) > uni ).
tff(func_def_15,type,
match_list1: ( ty * ty * uni * uni * uni ) > uni ).
tff(func_def_16,type,
cons_proj_11: ( ty * uni ) > uni ).
tff(func_def_17,type,
cons_proj_21: ( ty * uni ) > uni ).
tff(func_def_18,type,
infix_plpl: ( ty * uni * uni ) > uni ).
tff(func_def_19,type,
length2: ( ty * uni ) > $int ).
tff(func_def_22,type,
map: ( ty * ty ) > ty ).
tff(func_def_23,type,
get: ( ty * ty * uni * uni ) > uni ).
tff(func_def_24,type,
set: ( ty * ty * uni * uni * uni ) > uni ).
tff(func_def_25,type,
const: ( ty * ty * uni ) > uni ).
tff(func_def_26,type,
array: ty > ty ).
tff(func_def_27,type,
mk_array1: ( ty * $int * uni ) > uni ).
tff(func_def_28,type,
length3: ( ty * uni ) > $int ).
tff(func_def_29,type,
elts: ( ty * uni ) > uni ).
tff(func_def_30,type,
get2: ( ty * uni * $int ) > uni ).
tff(func_def_31,type,
t2tb: $int > uni ).
tff(func_def_32,type,
tb2t: uni > $int ).
tff(func_def_33,type,
set2: ( ty * uni * $int * uni ) > uni ).
tff(func_def_34,type,
make1: ( ty * $int * uni ) > uni ).
tff(func_def_35,type,
tree: ty ).
tff(func_def_36,type,
empty1: tree1 ).
tff(func_def_37,type,
node1: ( tree1 * tree1 ) > tree1 ).
tff(func_def_38,type,
match_tree1: ( ty * tree1 * uni * uni ) > uni ).
tff(func_def_39,type,
node_proj_11: tree1 > tree1 ).
tff(func_def_40,type,
node_proj_21: tree1 > tree1 ).
tff(func_def_41,type,
size1: tree1 > $int ).
tff(func_def_42,type,
t2tb1: list_tree > uni ).
tff(func_def_43,type,
tb2t1: uni > list_tree ).
tff(func_def_44,type,
t2tb2: tree1 > uni ).
tff(func_def_45,type,
tb2t2: uni > tree1 ).
tff(func_def_46,type,
t2tb3: map_int_lplist_treerp > uni ).
tff(func_def_47,type,
tb2t3: uni > map_int_lplist_treerp ).
tff(func_def_50,type,
sK1: ( ty * uni ) > uni ).
tff(func_def_51,type,
sK2: ( ty * uni ) > uni ).
tff(func_def_52,type,
sK3: ( ty * uni ) > uni ).
tff(func_def_53,type,
sK4: tree1 > tree1 ).
tff(func_def_54,type,
sK5: tree1 > tree1 ).
tff(func_def_55,type,
sK6: ( uni * ty * uni ) > uni ).
tff(func_def_56,type,
sK7: ( uni * ty * uni ) > uni ).
tff(func_def_57,type,
sK8: $int ).
tff(func_def_58,type,
sK9: map_int_lplist_treerp ).
tff(func_def_59,type,
sK10: map_int_lplist_treerp ).
tff(func_def_60,type,
sK11: $int ).
tff(func_def_61,type,
sK12: map_int_lplist_treerp ).
tff(func_def_62,type,
sK13: map_int_lplist_treerp ).
tff(func_def_63,type,
sK14: $int ).
tff(func_def_64,type,
sK15: tree1 > tree1 ).
tff(func_def_65,type,
sK16: tree1 > tree1 ).
tff(func_def_66,type,
sK17: list_tree ).
tff(func_def_67,type,
sK18: map_int_lplist_treerp ).
tff(func_def_68,type,
sK19: tree1 ).
tff(func_def_69,type,
sK20: tree1 > tree1 ).
tff(func_def_70,type,
sK21: tree1 > tree1 ).
tff(func_def_71,type,
sK22: ( uni * uni * ty ) > uni ).
tff(pred_def_1,type,
sort1: ( ty * uni ) > $o ).
tff(pred_def_3,type,
mem: ( ty * uni * uni ) > $o ).
tff(pred_def_4,type,
distinct: ( ty * uni ) > $o ).
tff(pred_def_6,type,
all_trees1: ( $int * list_tree ) > $o ).
tff(pred_def_7,type,
sP0: ( ty * uni ) > $o ).
tff(f21,axiom,
! [X1: uni,X2: uni,X0: ty] : sort1(list(X0),infix_plpl(X0,X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',infix_plpl_sort2) ).
tff(f29,axiom,
! [X3: uni,X0: ty,X1: uni,X2: uni] :
( ( mem(X0,X1,X2)
| mem(X0,X1,X3) )
<=> mem(X0,X1,infix_plpl(X0,X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mem_append) ).
tff(f38,axiom,
! [X0: ty,X1: ty,X5: uni,X3: uni,X2: uni,X4: uni] :
( sort1(X1,X5)
=> ( ( X3 = X4 )
=> ( get(X1,X0,set(X1,X0,X2,X3,X5),X4) = X5 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',select_eq) ).
tff(f63,axiom,
( ! [X1: tree1,X0: tree1] : ( size1(node1(X0,X1)) = $sum($sum(1,size1(X0)),size1(X1)) )
& ( size1(empty1) = 0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',size_def) ).
tff(f77,axiom,
! [X0: uni] : ( t2tb3(tb2t3(X0)) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bridgeR3) ).
tff(f78,conjecture,
! [X0: $int] :
( $lesseq(0,X0)
=> ( $lesseq(0,$sum(X0,1))
=> ( $lesseq(0,$sum(X0,1))
=> ( ( $lesseq(0,0)
& $less(0,$sum(X0,1)) )
=> ! [X1: map_int_lplist_treerp] :
( ( ( X1 = tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) )
& $lesseq(0,$sum(X0,1)) )
=> ( $lesseq(1,X0)
=> ! [X2: map_int_lplist_treerp,X3: $int] :
( ( $lesseq(1,X3)
& $lesseq(X3,X0) )
=> ( ! [X4: $int] :
( ( $less(X4,X3)
& $lesseq(0,X4) )
=> all_trees1(X4,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X4)))) )
=> ( ( $lesseq(0,X3)
& $less(X3,$sum(X0,1))
& $lesseq(0,$sum(X0,1)) )
=> ! [X5: map_int_lplist_treerp] :
( ( $lesseq(0,$sum(X0,1))
& ( X5 = tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) ) )
=> ( $lesseq(0,$difference(X3,1))
=> ! [X6: map_int_lplist_treerp,X7: $int] :
( ( $lesseq(X7,$difference(X3,1))
& $lesseq(0,X7) )
=> ( ( distinct(tree,get(list(tree),int,t2tb3(X6),t2tb(X3)))
& ! [X4: $int] :
( ( $lesseq(0,X4)
& $less(X4,X3) )
=> all_trees1(X4,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X4)))) )
& ! [X8: tree1] :
( mem(tree,t2tb2(X8),get(list(tree),int,t2tb3(X6),t2tb(X3)))
<=> ? [X9: tree1,X10: tree1] :
( ( size1(X8) = X3 )
& ( X8 = node1(X9,X10) )
& $less(size1(X9),X7) ) ) )
=> ( ( $lesseq(0,X3)
& $lesseq(0,$sum(X0,1))
& $less(X3,$sum(X0,1)) )
=> ( ( $less($difference($difference(X3,1),X7),$sum(X0,1))
& $lesseq(0,$difference($difference(X3,1),X7)) )
=> ( ( $lesseq(0,X7)
& $less(X7,$sum(X0,1)) )
=> ( ( $lesseq(0,X7)
& all_trees1($difference($difference(X3,1),X7),tb2t1(get(list(tree),int,t2tb3(X6),t2tb($difference($difference(X3,1),X7)))))
& $lesseq(0,$difference($difference(X3,1),X7))
& all_trees1(X7,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X7)))) )
=> ! [X11: list_tree] :
( ( ! [X8: tree1] :
( mem(tree,t2tb2(X8),t2tb1(X11))
<=> ? [X10: tree1,X9: tree1] :
( ( size1(X9) = X7 )
& ( X8 = node1(X9,X10) )
& ( size1(X10) = $difference($difference(X3,1),X7) ) ) )
& distinct(tree,t2tb1(X11)) )
=> ( ( $less(X3,$sum(X0,1))
& $lesseq(0,X3) )
=> ! [X12: map_int_lplist_treerp] :
( ( $lesseq(0,$sum(X0,1))
& ( X12 = tb2t3(set(list(tree),int,t2tb3(X6),t2tb(X3),infix_plpl(tree,t2tb1(X11),get(list(tree),int,t2tb3(X6),t2tb(X3))))) ) )
=> ! [X8: tree1] :
( mem(tree,t2tb2(X8),get(list(tree),int,t2tb3(X12),t2tb(X3)))
=> ? [X10: tree1,X9: tree1] :
( ( X8 = node1(X9,X10) )
& $less(size1(X9),$sum(X7,1))
& ( size1(X8) = X3 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wP_parameter_all_trees) ).
tff(f79,negated_conjecture,
~ ! [X0: $int] :
( $lesseq(0,X0)
=> ( $lesseq(0,$sum(X0,1))
=> ( $lesseq(0,$sum(X0,1))
=> ( ( $lesseq(0,0)
& $less(0,$sum(X0,1)) )
=> ! [X1: map_int_lplist_treerp] :
( ( ( X1 = tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) )
& $lesseq(0,$sum(X0,1)) )
=> ( $lesseq(1,X0)
=> ! [X2: map_int_lplist_treerp,X3: $int] :
( ( $lesseq(1,X3)
& $lesseq(X3,X0) )
=> ( ! [X4: $int] :
( ( $less(X4,X3)
& $lesseq(0,X4) )
=> all_trees1(X4,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X4)))) )
=> ( ( $lesseq(0,X3)
& $less(X3,$sum(X0,1))
& $lesseq(0,$sum(X0,1)) )
=> ! [X5: map_int_lplist_treerp] :
( ( $lesseq(0,$sum(X0,1))
& ( X5 = tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) ) )
=> ( $lesseq(0,$difference(X3,1))
=> ! [X6: map_int_lplist_treerp,X7: $int] :
( ( $lesseq(X7,$difference(X3,1))
& $lesseq(0,X7) )
=> ( ( distinct(tree,get(list(tree),int,t2tb3(X6),t2tb(X3)))
& ! [X4: $int] :
( ( $lesseq(0,X4)
& $less(X4,X3) )
=> all_trees1(X4,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X4)))) )
& ! [X8: tree1] :
( mem(tree,t2tb2(X8),get(list(tree),int,t2tb3(X6),t2tb(X3)))
<=> ? [X9: tree1,X10: tree1] :
( ( size1(X8) = X3 )
& ( X8 = node1(X9,X10) )
& $less(size1(X9),X7) ) ) )
=> ( ( $lesseq(0,X3)
& $lesseq(0,$sum(X0,1))
& $less(X3,$sum(X0,1)) )
=> ( ( $less($difference($difference(X3,1),X7),$sum(X0,1))
& $lesseq(0,$difference($difference(X3,1),X7)) )
=> ( ( $lesseq(0,X7)
& $less(X7,$sum(X0,1)) )
=> ( ( $lesseq(0,X7)
& all_trees1($difference($difference(X3,1),X7),tb2t1(get(list(tree),int,t2tb3(X6),t2tb($difference($difference(X3,1),X7)))))
& $lesseq(0,$difference($difference(X3,1),X7))
& all_trees1(X7,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X7)))) )
=> ! [X11: list_tree] :
( ( ! [X8: tree1] :
( mem(tree,t2tb2(X8),t2tb1(X11))
<=> ? [X10: tree1,X9: tree1] :
( ( size1(X9) = X7 )
& ( X8 = node1(X9,X10) )
& ( size1(X10) = $difference($difference(X3,1),X7) ) ) )
& distinct(tree,t2tb1(X11)) )
=> ( ( $less(X3,$sum(X0,1))
& $lesseq(0,X3) )
=> ! [X12: map_int_lplist_treerp] :
( ( $lesseq(0,$sum(X0,1))
& ( X12 = tb2t3(set(list(tree),int,t2tb3(X6),t2tb(X3),infix_plpl(tree,t2tb1(X11),get(list(tree),int,t2tb3(X6),t2tb(X3))))) ) )
=> ! [X8: tree1] :
( mem(tree,t2tb2(X8),get(list(tree),int,t2tb3(X12),t2tb(X3)))
=> ? [X10: tree1,X9: tree1] :
( ( X8 = node1(X9,X10) )
& $less(size1(X9),$sum(X7,1))
& ( size1(X8) = X3 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f78]) ).
tff(f80,plain,
~ ! [X0: $int] :
( ~ $less(X0,0)
=> ( ~ $less($sum(X0,1),0)
=> ( ~ $less($sum(X0,1),0)
=> ( ( $less(0,$sum(X0,1))
& ~ $less(0,0) )
=> ! [X1: map_int_lplist_treerp] :
( ( ~ $less($sum(X0,1),0)
& ( X1 = tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) ) )
=> ( ~ $less(X0,1)
=> ! [X2: map_int_lplist_treerp,X3: $int] :
( ( ~ $less(X3,1)
& ~ $less(X0,X3) )
=> ( ! [X4: $int] :
( ( $less(X4,X3)
& ~ $less(X4,0) )
=> all_trees1(X4,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X4)))) )
=> ( ( $less(X3,$sum(X0,1))
& ~ $less($sum(X0,1),0)
& ~ $less(X3,0) )
=> ! [X5: map_int_lplist_treerp] :
( ( ( X5 = tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) )
& ~ $less($sum(X0,1),0) )
=> ( ~ $less($sum(X3,$uminus(1)),0)
=> ! [X6: map_int_lplist_treerp,X7: $int] :
( ( ~ $less($sum(X3,$uminus(1)),X7)
& ~ $less(X7,0) )
=> ( ( distinct(tree,get(list(tree),int,t2tb3(X6),t2tb(X3)))
& ! [X4: $int] :
( ( ~ $less(X4,0)
& $less(X4,X3) )
=> all_trees1(X4,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X4)))) )
& ! [X8: tree1] :
( mem(tree,t2tb2(X8),get(list(tree),int,t2tb3(X6),t2tb(X3)))
<=> ? [X9: tree1,X10: tree1] :
( ( size1(X8) = X3 )
& ( X8 = node1(X9,X10) )
& $less(size1(X9),X7) ) ) )
=> ( ( $less(X3,$sum(X0,1))
& ~ $less($sum(X0,1),0)
& ~ $less(X3,0) )
=> ( ( ~ $less($sum($sum(X3,$uminus(1)),$uminus(X7)),0)
& $less($sum($sum(X3,$uminus(1)),$uminus(X7)),$sum(X0,1)) )
=> ( ( $less(X7,$sum(X0,1))
& ~ $less(X7,0) )
=> ( ( all_trees1($sum($sum(X3,$uminus(1)),$uminus(X7)),tb2t1(get(list(tree),int,t2tb3(X6),t2tb($sum($sum(X3,$uminus(1)),$uminus(X7))))))
& ~ $less(X7,0)
& ~ $less($sum($sum(X3,$uminus(1)),$uminus(X7)),0)
& all_trees1(X7,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X7)))) )
=> ! [X11: list_tree] :
( ( ! [X8: tree1] :
( mem(tree,t2tb2(X8),t2tb1(X11))
<=> ? [X10: tree1,X9: tree1] :
( ( size1(X9) = X7 )
& ( X8 = node1(X9,X10) )
& ( size1(X10) = $sum($sum(X3,$uminus(1)),$uminus(X7)) ) ) )
& distinct(tree,t2tb1(X11)) )
=> ( ( ~ $less(X3,0)
& $less(X3,$sum(X0,1)) )
=> ! [X12: map_int_lplist_treerp] :
( ( ~ $less($sum(X0,1),0)
& ( X12 = tb2t3(set(list(tree),int,t2tb3(X6),t2tb(X3),infix_plpl(tree,t2tb1(X11),get(list(tree),int,t2tb3(X6),t2tb(X3))))) ) )
=> ! [X8: tree1] :
( mem(tree,t2tb2(X8),get(list(tree),int,t2tb3(X12),t2tb(X3)))
=> ? [X10: tree1,X9: tree1] :
( ( X8 = node1(X9,X10) )
& $less(size1(X9),$sum(X7,1))
& ( size1(X8) = X3 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(theory_normalization,[],[f79]) ).
tff(f84,plain,
~ ! [X0: $int] :
( ~ $less(X0,0)
=> ( ~ $less($sum(X0,1),0)
=> ( ~ $less($sum(X0,1),0)
=> ( ( $less(0,$sum(X0,1))
& ~ $less(0,0) )
=> ! [X1: map_int_lplist_treerp] :
( ( ~ $less($sum(X0,1),0)
& ( X1 = tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) ) )
=> ( ~ $less(X0,1)
=> ! [X2: map_int_lplist_treerp,X3: $int] :
( ( ~ $less(X3,1)
& ~ $less(X0,X3) )
=> ( ! [X4: $int] :
( ( $less(X4,X3)
& ~ $less(X4,0) )
=> all_trees1(X4,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X4)))) )
=> ( ( $less(X3,$sum(X0,1))
& ~ $less($sum(X0,1),0)
& ~ $less(X3,0) )
=> ! [X5: map_int_lplist_treerp] :
( ( ( X5 = tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) )
& ~ $less($sum(X0,1),0) )
=> ( ~ $less($sum(X3,$uminus(1)),0)
=> ! [X7: $int,X6: map_int_lplist_treerp] :
( ( ~ $less($sum(X3,$uminus(1)),X7)
& ~ $less(X7,0) )
=> ( ( ! [X8: $int] :
( ( $less(X8,X3)
& ~ $less(X8,0) )
=> all_trees1(X8,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X8)))) )
& distinct(tree,get(list(tree),int,t2tb3(X6),t2tb(X3)))
& ! [X9: tree1] :
( ? [X11: tree1,X10: tree1] :
( ( size1(X9) = X3 )
& $less(size1(X10),X7)
& ( node1(X10,X11) = X9 ) )
<=> mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X6),t2tb(X3))) ) )
=> ( ( $less(X3,$sum(X0,1))
& ~ $less($sum(X0,1),0)
& ~ $less(X3,0) )
=> ( ( ~ $less($sum($sum(X3,$uminus(1)),$uminus(X7)),0)
& $less($sum($sum(X3,$uminus(1)),$uminus(X7)),$sum(X0,1)) )
=> ( ( $less(X7,$sum(X0,1))
& ~ $less(X7,0) )
=> ( ( all_trees1($sum($sum(X3,$uminus(1)),$uminus(X7)),tb2t1(get(list(tree),int,t2tb3(X6),t2tb($sum($sum(X3,$uminus(1)),$uminus(X7))))))
& ~ $less(X7,0)
& ~ $less($sum($sum(X3,$uminus(1)),$uminus(X7)),0)
& all_trees1(X7,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X7)))) )
=> ! [X12: list_tree] :
( ( distinct(tree,t2tb1(X12))
& ! [X13: tree1] :
( ? [X14: tree1,X15: tree1] :
( ( node1(X15,X14) = X13 )
& ( $sum($sum(X3,$uminus(1)),$uminus(X7)) = size1(X14) )
& ( size1(X15) = X7 ) )
<=> mem(tree,t2tb2(X13),t2tb1(X12)) ) )
=> ( ( ~ $less(X3,0)
& $less(X3,$sum(X0,1)) )
=> ! [X16: map_int_lplist_treerp] :
( ( ( tb2t3(set(list(tree),int,t2tb3(X6),t2tb(X3),infix_plpl(tree,t2tb1(X12),get(list(tree),int,t2tb3(X6),t2tb(X3))))) = X16 )
& ~ $less($sum(X0,1),0) )
=> ! [X17: tree1] :
( mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X16),t2tb(X3)))
=> ? [X18: tree1,X19: tree1] :
( $less(size1(X19),$sum(X7,1))
& ( size1(X17) = X3 )
& ( node1(X19,X18) = X17 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f80]) ).
tff(f86,plain,
! [X2: uni,X0: uni,X1: ty,X3: uni] :
( mem(X1,X2,infix_plpl(X1,X3,X0))
<=> ( mem(X1,X2,X0)
| mem(X1,X2,X3) ) ),
inference(rectify,[],[f29]) ).
tff(f92,plain,
( ( size1(empty1) = 0 )
& ! [X1: tree1,X0: tree1] : ( $sum($sum(1,size1(X1)),size1(X0)) = size1(node1(X1,X0)) ) ),
inference(rectify,[],[f63]) ).
tff(f96,plain,
! [X1: ty,X2: uni,X0: ty,X5: uni,X3: uni,X4: uni] :
( sort1(X1,X2)
=> ( ( X3 = X5 )
=> ( get(X1,X0,set(X1,X0,X4,X3,X2),X5) = X2 ) ) ),
inference(rectify,[],[f38]) ).
tff(f113,plain,
? [X0: $int] :
( ? [X1: map_int_lplist_treerp] :
( ? [X2: map_int_lplist_treerp,X3: $int] :
( ? [X5: map_int_lplist_treerp] :
( ? [X7: $int,X6: map_int_lplist_treerp] :
( ? [X12: list_tree] :
( ? [X16: map_int_lplist_treerp] :
( ? [X17: tree1] :
( ! [X18: tree1,X19: tree1] :
( ( size1(X17) != X3 )
| ~ $less(size1(X19),$sum(X7,1))
| ( node1(X19,X18) != X17 ) )
& mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X16),t2tb(X3))) )
& ( tb2t3(set(list(tree),int,t2tb3(X6),t2tb(X3),infix_plpl(tree,t2tb1(X12),get(list(tree),int,t2tb3(X6),t2tb(X3))))) = X16 )
& ~ $less($sum(X0,1),0) )
& ~ $less(X3,0)
& $less(X3,$sum(X0,1))
& distinct(tree,t2tb1(X12))
& ! [X13: tree1] :
( ? [X14: tree1,X15: tree1] :
( ( node1(X15,X14) = X13 )
& ( $sum($sum(X3,$uminus(1)),$uminus(X7)) = size1(X14) )
& ( size1(X15) = X7 ) )
<=> mem(tree,t2tb2(X13),t2tb1(X12)) ) )
& all_trees1($sum($sum(X3,$uminus(1)),$uminus(X7)),tb2t1(get(list(tree),int,t2tb3(X6),t2tb($sum($sum(X3,$uminus(1)),$uminus(X7))))))
& ~ $less(X7,0)
& ~ $less($sum($sum(X3,$uminus(1)),$uminus(X7)),0)
& all_trees1(X7,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X7))))
& $less(X7,$sum(X0,1))
& ~ $less(X7,0)
& ~ $less($sum($sum(X3,$uminus(1)),$uminus(X7)),0)
& $less($sum($sum(X3,$uminus(1)),$uminus(X7)),$sum(X0,1))
& $less(X3,$sum(X0,1))
& ~ $less($sum(X0,1),0)
& ~ $less(X3,0)
& ! [X8: $int] :
( all_trees1(X8,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X8))))
| ~ $less(X8,X3)
| $less(X8,0) )
& distinct(tree,get(list(tree),int,t2tb3(X6),t2tb(X3)))
& ! [X9: tree1] :
( ? [X11: tree1,X10: tree1] :
( ( size1(X9) = X3 )
& $less(size1(X10),X7)
& ( node1(X10,X11) = X9 ) )
<=> mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X6),t2tb(X3))) )
& ~ $less($sum(X3,$uminus(1)),X7)
& ~ $less(X7,0) )
& ~ $less($sum(X3,$uminus(1)),0)
& ( X5 = tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) )
& ~ $less($sum(X0,1),0) )
& $less(X3,$sum(X0,1))
& ~ $less($sum(X0,1),0)
& ~ $less(X3,0)
& ! [X4: $int] :
( all_trees1(X4,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X4))))
| ~ $less(X4,X3)
| $less(X4,0) )
& ~ $less(X3,1)
& ~ $less(X0,X3) )
& ~ $less(X0,1)
& ~ $less($sum(X0,1),0)
& ( X1 = tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) ) )
& $less(0,$sum(X0,1))
& ~ $less(0,0)
& ~ $less($sum(X0,1),0)
& ~ $less($sum(X0,1),0)
& ~ $less(X0,0) ),
inference(ennf_transformation,[],[f84]) ).
tff(f114,plain,
? [X0: $int] :
( $less(0,$sum(X0,1))
& ~ $less(0,0)
& ~ $less($sum(X0,1),0)
& ~ $less($sum(X0,1),0)
& ? [X1: map_int_lplist_treerp] :
( ~ $less(X0,1)
& ~ $less($sum(X0,1),0)
& ? [X2: map_int_lplist_treerp,X3: $int] :
( ~ $less(X0,X3)
& ~ $less($sum(X0,1),0)
& ! [X4: $int] :
( all_trees1(X4,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X4))))
| ~ $less(X4,X3)
| $less(X4,0) )
& ~ $less(X3,1)
& $less(X3,$sum(X0,1))
& ~ $less(X3,0)
& ? [X5: map_int_lplist_treerp] :
( ~ $less($sum(X3,$uminus(1)),0)
& ( X5 = tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) )
& ? [X6: map_int_lplist_treerp,X7: $int] :
( ~ $less(X7,0)
& distinct(tree,get(list(tree),int,t2tb3(X6),t2tb(X3)))
& $less(X3,$sum(X0,1))
& ! [X8: $int] :
( ~ $less(X8,X3)
| all_trees1(X8,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X8))))
| $less(X8,0) )
& ~ $less($sum(X3,$uminus(1)),X7)
& all_trees1($sum($sum(X3,$uminus(1)),$uminus(X7)),tb2t1(get(list(tree),int,t2tb3(X6),t2tb($sum($sum(X3,$uminus(1)),$uminus(X7))))))
& ! [X9: tree1] :
( ? [X11: tree1,X10: tree1] :
( ( size1(X9) = X3 )
& $less(size1(X10),X7)
& ( node1(X10,X11) = X9 ) )
<=> mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X6),t2tb(X3))) )
& ~ $less(X7,0)
& ? [X12: list_tree] :
( ~ $less(X3,0)
& distinct(tree,t2tb1(X12))
& ? [X16: map_int_lplist_treerp] :
( ? [X17: tree1] :
( ! [X18: tree1,X19: tree1] :
( ( size1(X17) != X3 )
| ~ $less(size1(X19),$sum(X7,1))
| ( node1(X19,X18) != X17 ) )
& mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X16),t2tb(X3))) )
& ~ $less($sum(X0,1),0)
& ( tb2t3(set(list(tree),int,t2tb3(X6),t2tb(X3),infix_plpl(tree,t2tb1(X12),get(list(tree),int,t2tb3(X6),t2tb(X3))))) = X16 ) )
& ! [X13: tree1] :
( ? [X14: tree1,X15: tree1] :
( ( node1(X15,X14) = X13 )
& ( $sum($sum(X3,$uminus(1)),$uminus(X7)) = size1(X14) )
& ( size1(X15) = X7 ) )
<=> mem(tree,t2tb2(X13),t2tb1(X12)) )
& $less(X3,$sum(X0,1)) )
& ~ $less($sum($sum(X3,$uminus(1)),$uminus(X7)),0)
& all_trees1(X7,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X7))))
& ~ $less($sum(X0,1),0)
& ~ $less(X3,0)
& ~ $less(X7,0)
& ~ $less($sum($sum(X3,$uminus(1)),$uminus(X7)),0)
& $less($sum($sum(X3,$uminus(1)),$uminus(X7)),$sum(X0,1))
& $less(X7,$sum(X0,1)) )
& ~ $less($sum(X0,1),0) ) )
& ( X1 = tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) ) )
& ~ $less(X0,0) ),
inference(flattening,[],[f113]) ).
tff(f123,plain,
! [X1: ty,X2: uni,X0: ty,X5: uni,X3: uni,X4: uni] :
( ( get(X1,X0,set(X1,X0,X4,X3,X2),X5) = X2 )
| ( X3 != X5 )
| ~ sort1(X1,X2) ),
inference(ennf_transformation,[],[f96]) ).
tff(f124,plain,
! [X5: uni,X0: ty,X4: uni,X2: uni,X1: ty,X3: uni] :
( ~ sort1(X1,X2)
| ( X3 != X5 )
| ( get(X1,X0,set(X1,X0,X4,X3,X2),X5) = X2 ) ),
inference(flattening,[],[f123]) ).
tff(f131,plain,
! [X0: uni,X1: ty,X2: uni,X3: uni,X4: ty,X5: uni] :
( ~ sort1(X4,X3)
| ( X0 != X5 )
| ( get(X4,X1,set(X4,X1,X2,X5,X3),X0) = X3 ) ),
inference(rectify,[],[f124]) ).
tff(f145,plain,
( ( size1(empty1) = 0 )
& ! [X0: tree1,X1: tree1] : ( size1(node1(X0,X1)) = $sum($sum(1,size1(X0)),size1(X1)) ) ),
inference(rectify,[],[f92]) ).
tff(f147,plain,
? [X0: $int] :
( $less(0,$sum(X0,1))
& ~ $less(0,0)
& ~ $less($sum(X0,1),0)
& ~ $less($sum(X0,1),0)
& ? [X1: map_int_lplist_treerp] :
( ~ $less(X0,1)
& ~ $less($sum(X0,1),0)
& ? [X2: map_int_lplist_treerp,X3: $int] :
( ~ $less(X0,X3)
& ~ $less($sum(X0,1),0)
& ! [X4: $int] :
( all_trees1(X4,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X4))))
| ~ $less(X4,X3)
| $less(X4,0) )
& ~ $less(X3,1)
& $less(X3,$sum(X0,1))
& ~ $less(X3,0)
& ? [X5: map_int_lplist_treerp] :
( ~ $less($sum(X3,$uminus(1)),0)
& ( X5 = tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) )
& ? [X6: map_int_lplist_treerp,X7: $int] :
( ~ $less(X7,0)
& distinct(tree,get(list(tree),int,t2tb3(X6),t2tb(X3)))
& $less(X3,$sum(X0,1))
& ! [X8: $int] :
( ~ $less(X8,X3)
| all_trees1(X8,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X8))))
| $less(X8,0) )
& ~ $less($sum(X3,$uminus(1)),X7)
& all_trees1($sum($sum(X3,$uminus(1)),$uminus(X7)),tb2t1(get(list(tree),int,t2tb3(X6),t2tb($sum($sum(X3,$uminus(1)),$uminus(X7))))))
& ! [X9: tree1] :
( ( ? [X11: tree1,X10: tree1] :
( ( size1(X9) = X3 )
& $less(size1(X10),X7)
& ( node1(X10,X11) = X9 ) )
| ~ mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X6),t2tb(X3))) )
& ( mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X6),t2tb(X3)))
| ! [X11: tree1,X10: tree1] :
( ( size1(X9) != X3 )
| ~ $less(size1(X10),X7)
| ( node1(X10,X11) != X9 ) ) ) )
& ~ $less(X7,0)
& ? [X12: list_tree] :
( ~ $less(X3,0)
& distinct(tree,t2tb1(X12))
& ? [X16: map_int_lplist_treerp] :
( ? [X17: tree1] :
( ! [X18: tree1,X19: tree1] :
( ( size1(X17) != X3 )
| ~ $less(size1(X19),$sum(X7,1))
| ( node1(X19,X18) != X17 ) )
& mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X16),t2tb(X3))) )
& ~ $less($sum(X0,1),0)
& ( tb2t3(set(list(tree),int,t2tb3(X6),t2tb(X3),infix_plpl(tree,t2tb1(X12),get(list(tree),int,t2tb3(X6),t2tb(X3))))) = X16 ) )
& ! [X13: tree1] :
( ( ? [X14: tree1,X15: tree1] :
( ( node1(X15,X14) = X13 )
& ( $sum($sum(X3,$uminus(1)),$uminus(X7)) = size1(X14) )
& ( size1(X15) = X7 ) )
| ~ mem(tree,t2tb2(X13),t2tb1(X12)) )
& ( mem(tree,t2tb2(X13),t2tb1(X12))
| ! [X14: tree1,X15: tree1] :
( ( node1(X15,X14) != X13 )
| ( $sum($sum(X3,$uminus(1)),$uminus(X7)) != size1(X14) )
| ( size1(X15) != X7 ) ) ) )
& $less(X3,$sum(X0,1)) )
& ~ $less($sum($sum(X3,$uminus(1)),$uminus(X7)),0)
& all_trees1(X7,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X7))))
& ~ $less($sum(X0,1),0)
& ~ $less(X3,0)
& ~ $less(X7,0)
& ~ $less($sum($sum(X3,$uminus(1)),$uminus(X7)),0)
& $less($sum($sum(X3,$uminus(1)),$uminus(X7)),$sum(X0,1))
& $less(X7,$sum(X0,1)) )
& ~ $less($sum(X0,1),0) ) )
& ( X1 = tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) ) )
& ~ $less(X0,0) ),
inference(nnf_transformation,[],[f114]) ).
tff(f148,plain,
? [X0: $int] :
( $less(0,$sum(X0,1))
& ~ $less(0,0)
& ~ $less($sum(X0,1),0)
& ~ $less($sum(X0,1),0)
& ? [X1: map_int_lplist_treerp] :
( ~ $less(X0,1)
& ~ $less($sum(X0,1),0)
& ? [X2: map_int_lplist_treerp,X3: $int] :
( ~ $less(X0,X3)
& ~ $less($sum(X0,1),0)
& ! [X4: $int] :
( all_trees1(X4,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X4))))
| ~ $less(X4,X3)
| $less(X4,0) )
& ~ $less(X3,1)
& $less(X3,$sum(X0,1))
& ~ $less(X3,0)
& ? [X5: map_int_lplist_treerp] :
( ~ $less($sum(X3,$uminus(1)),0)
& ( X5 = tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) )
& ? [X6: map_int_lplist_treerp,X7: $int] :
( ~ $less(X7,0)
& distinct(tree,get(list(tree),int,t2tb3(X6),t2tb(X3)))
& $less(X3,$sum(X0,1))
& ! [X8: $int] :
( ~ $less(X8,X3)
| all_trees1(X8,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X8))))
| $less(X8,0) )
& ~ $less($sum(X3,$uminus(1)),X7)
& all_trees1($sum($sum(X3,$uminus(1)),$uminus(X7)),tb2t1(get(list(tree),int,t2tb3(X6),t2tb($sum($sum(X3,$uminus(1)),$uminus(X7))))))
& ! [X9: tree1] :
( ( ? [X10: tree1,X11: tree1] :
( ( size1(X9) = X3 )
& $less(size1(X11),X7)
& ( node1(X11,X10) = X9 ) )
| ~ mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X6),t2tb(X3))) )
& ( mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X6),t2tb(X3)))
| ! [X12: tree1,X13: tree1] :
( ( size1(X9) != X3 )
| ~ $less(size1(X13),X7)
| ( node1(X13,X12) != X9 ) ) ) )
& ~ $less(X7,0)
& ? [X14: list_tree] :
( ~ $less(X3,0)
& distinct(tree,t2tb1(X14))
& ? [X15: map_int_lplist_treerp] :
( ? [X16: tree1] :
( ! [X17: tree1,X18: tree1] :
( ( size1(X16) != X3 )
| ~ $less(size1(X18),$sum(X7,1))
| ( node1(X18,X17) != X16 ) )
& mem(tree,t2tb2(X16),get(list(tree),int,t2tb3(X15),t2tb(X3))) )
& ~ $less($sum(X0,1),0)
& ( tb2t3(set(list(tree),int,t2tb3(X6),t2tb(X3),infix_plpl(tree,t2tb1(X14),get(list(tree),int,t2tb3(X6),t2tb(X3))))) = X15 ) )
& ! [X19: tree1] :
( ( ? [X20: tree1,X21: tree1] :
( ( node1(X21,X20) = X19 )
& ( $sum($sum(X3,$uminus(1)),$uminus(X7)) = size1(X20) )
& ( size1(X21) = X7 ) )
| ~ mem(tree,t2tb2(X19),t2tb1(X14)) )
& ( mem(tree,t2tb2(X19),t2tb1(X14))
| ! [X22: tree1,X23: tree1] :
( ( node1(X23,X22) != X19 )
| ( size1(X22) != $sum($sum(X3,$uminus(1)),$uminus(X7)) )
| ( size1(X23) != X7 ) ) ) )
& $less(X3,$sum(X0,1)) )
& ~ $less($sum($sum(X3,$uminus(1)),$uminus(X7)),0)
& all_trees1(X7,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X7))))
& ~ $less($sum(X0,1),0)
& ~ $less(X3,0)
& ~ $less(X7,0)
& ~ $less($sum($sum(X3,$uminus(1)),$uminus(X7)),0)
& $less($sum($sum(X3,$uminus(1)),$uminus(X7)),$sum(X0,1))
& $less(X7,$sum(X0,1)) )
& ~ $less($sum(X0,1),0) ) )
& ( X1 = tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) ) )
& ~ $less(X0,0) ),
inference(rectify,[],[f147]) ).
tff(f149,plain,
( $less(0,$sum(sK8,1))
& ~ $less(0,0)
& ~ $less($sum(sK8,1),0)
& ~ $less($sum(sK8,1),0)
& ~ $less(sK8,1)
& ~ $less($sum(sK8,1),0)
& ~ $less(sK8,sK11)
& ~ $less($sum(sK8,1),0)
& ! [X4: $int] :
( all_trees1(X4,tb2t1(get(list(tree),int,t2tb3(sK10),t2tb(X4))))
| ~ $less(X4,sK11)
| $less(X4,0) )
& ~ $less(sK11,1)
& $less(sK11,$sum(sK8,1))
& ~ $less(sK11,0)
& ~ $less($sum(sK11,$uminus(1)),0)
& ( sK12 = tb2t3(set(list(tree),int,t2tb3(sK10),t2tb(sK11),nil(tree))) )
& ~ $less(sK14,0)
& distinct(tree,get(list(tree),int,t2tb3(sK13),t2tb(sK11)))
& $less(sK11,$sum(sK8,1))
& ! [X8: $int] :
( ~ $less(X8,sK11)
| all_trees1(X8,tb2t1(get(list(tree),int,t2tb3(sK13),t2tb(X8))))
| $less(X8,0) )
& ~ $less($sum(sK11,$uminus(1)),sK14)
& all_trees1($sum($sum(sK11,$uminus(1)),$uminus(sK14)),tb2t1(get(list(tree),int,t2tb3(sK13),t2tb($sum($sum(sK11,$uminus(1)),$uminus(sK14))))))
& ! [X9: tree1] :
( ( ( ( size1(X9) = sK11 )
& $less(size1(sK16(X9)),sK14)
& ( node1(sK16(X9),sK15(X9)) = X9 ) )
| ~ mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(sK13),t2tb(sK11))) )
& ( mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(sK13),t2tb(sK11)))
| ! [X12: tree1,X13: tree1] :
( ( size1(X9) != sK11 )
| ~ $less(size1(X13),sK14)
| ( node1(X13,X12) != X9 ) ) ) )
& ~ $less(sK14,0)
& ~ $less(sK11,0)
& distinct(tree,t2tb1(sK17))
& ! [X17: tree1,X18: tree1] :
( ( size1(sK19) != sK11 )
| ~ $less(size1(X18),$sum(sK14,1))
| ( node1(X18,X17) != sK19 ) )
& mem(tree,t2tb2(sK19),get(list(tree),int,t2tb3(sK18),t2tb(sK11)))
& ~ $less($sum(sK8,1),0)
& ( sK18 = tb2t3(set(list(tree),int,t2tb3(sK13),t2tb(sK11),infix_plpl(tree,t2tb1(sK17),get(list(tree),int,t2tb3(sK13),t2tb(sK11))))) )
& ! [X19: tree1] :
( ( ( ( node1(sK21(X19),sK20(X19)) = X19 )
& ( size1(sK20(X19)) = $sum($sum(sK11,$uminus(1)),$uminus(sK14)) )
& ( size1(sK21(X19)) = sK14 ) )
| ~ mem(tree,t2tb2(X19),t2tb1(sK17)) )
& ( mem(tree,t2tb2(X19),t2tb1(sK17))
| ! [X22: tree1,X23: tree1] :
( ( node1(X23,X22) != X19 )
| ( size1(X22) != $sum($sum(sK11,$uminus(1)),$uminus(sK14)) )
| ( size1(X23) != sK14 ) ) ) )
& $less(sK11,$sum(sK8,1))
& ~ $less($sum($sum(sK11,$uminus(1)),$uminus(sK14)),0)
& all_trees1(sK14,tb2t1(get(list(tree),int,t2tb3(sK13),t2tb(sK14))))
& ~ $less($sum(sK8,1),0)
& ~ $less(sK11,0)
& ~ $less(sK14,0)
& ~ $less($sum($sum(sK11,$uminus(1)),$uminus(sK14)),0)
& $less($sum($sum(sK11,$uminus(1)),$uminus(sK14)),$sum(sK8,1))
& $less(sK14,$sum(sK8,1))
& ~ $less($sum(sK8,1),0)
& ( tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = sK9 )
& ~ $less(sK8,0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9,sK10,sK11,sK12,sK13,sK14,sK15,sK16,sK17,sK18,sK19,sK20,sK21]),skolemize(X0,sK8),skolemize(X1,sK9),skolemize(X2,sK10),skolemize(X3,sK11),skolemize(X5,sK12),skolemize(X6,sK13),skolemize(X7,sK14),skolemize(X10,sK15(X9)),skolemize(X11,sK16(X9)),skolemize(X14,sK17),skolemize(X15,sK18),skolemize(X16,sK19),skolemize(X20,sK20(X19)),skolemize(X21,sK21(X19))],[f148]) ).
tff(f152,plain,
! [X2: uni,X0: uni,X1: ty,X3: uni] :
( ( mem(X1,X2,infix_plpl(X1,X3,X0))
| ( ~ mem(X1,X2,X0)
& ~ mem(X1,X2,X3) ) )
& ( mem(X1,X2,X0)
| mem(X1,X2,X3)
| ~ mem(X1,X2,infix_plpl(X1,X3,X0)) ) ),
inference(nnf_transformation,[],[f86]) ).
tff(f153,plain,
! [X2: uni,X0: uni,X1: ty,X3: uni] :
( ( mem(X1,X2,infix_plpl(X1,X3,X0))
| ( ~ mem(X1,X2,X0)
& ~ mem(X1,X2,X3) ) )
& ( mem(X1,X2,X0)
| mem(X1,X2,X3)
| ~ mem(X1,X2,infix_plpl(X1,X3,X0)) ) ),
inference(flattening,[],[f152]) ).
tff(f154,plain,
! [X0: uni,X1: uni,X2: ty,X3: uni] :
( ( mem(X2,X0,infix_plpl(X2,X3,X1))
| ( ~ mem(X2,X0,X1)
& ~ mem(X2,X0,X3) ) )
& ( mem(X2,X0,X1)
| mem(X2,X0,X3)
| ~ mem(X2,X0,infix_plpl(X2,X3,X1)) ) ),
inference(rectify,[],[f153]) ).
tff(f163,plain,
! [X0: uni,X1: uni,X2: ty] : sort1(list(X2),infix_plpl(X2,X0,X1)),
inference(rectify,[],[f21]) ).
tff(f172,plain,
! [X2: uni,X3: uni,X0: uni,X1: ty,X4: ty,X5: uni] :
( ~ sort1(X4,X3)
| ( X0 != X5 )
| ( get(X4,X1,set(X4,X1,X2,X5,X3),X0) = X3 ) ),
inference(cnf_transformation,[],[f131]) ).
tff(f199,plain,
! [X0: uni] : ( t2tb3(tb2t3(X0)) = X0 ),
inference(cnf_transformation,[],[f77]) ).
tff(f201,plain,
! [X0: tree1,X1: tree1] : ( size1(node1(X0,X1)) = $sum($sum(1,size1(X0)),size1(X1)) ),
inference(cnf_transformation,[],[f145]) ).
tff(f217,plain,
! [X19: tree1] :
( ~ mem(tree,t2tb2(X19),t2tb1(sK17))
| ( size1(sK21(X19)) = sK14 ) ),
inference(cnf_transformation,[],[f149]) ).
tff(f218,plain,
! [X19: tree1] :
( ( size1(sK20(X19)) = $sum($sum(sK11,$uminus(1)),$uminus(sK14)) )
| ~ mem(tree,t2tb2(X19),t2tb1(sK17)) ),
inference(cnf_transformation,[],[f149]) ).
tff(f219,plain,
! [X19: tree1] :
( ( node1(sK21(X19),sK20(X19)) = X19 )
| ~ mem(tree,t2tb2(X19),t2tb1(sK17)) ),
inference(cnf_transformation,[],[f149]) ).
tff(f220,plain,
sK18 = tb2t3(set(list(tree),int,t2tb3(sK13),t2tb(sK11),infix_plpl(tree,t2tb1(sK17),get(list(tree),int,t2tb3(sK13),t2tb(sK11))))),
inference(cnf_transformation,[],[f149]) ).
tff(f222,plain,
mem(tree,t2tb2(sK19),get(list(tree),int,t2tb3(sK18),t2tb(sK11))),
inference(cnf_transformation,[],[f149]) ).
tff(f223,plain,
! [X18: tree1,X17: tree1] :
( ( node1(X18,X17) != sK19 )
| ~ $less(size1(X18),$sum(sK14,1))
| ( size1(sK19) != sK11 ) ),
inference(cnf_transformation,[],[f149]) ).
tff(f228,plain,
! [X9: tree1] :
( ~ mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(sK13),t2tb(sK11)))
| ( node1(sK16(X9),sK15(X9)) = X9 ) ),
inference(cnf_transformation,[],[f149]) ).
tff(f229,plain,
! [X9: tree1] :
( ~ mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(sK13),t2tb(sK11)))
| $less(size1(sK16(X9)),sK14) ),
inference(cnf_transformation,[],[f149]) ).
tff(f230,plain,
! [X9: tree1] :
( ~ mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(sK13),t2tb(sK11)))
| ( size1(X9) = sK11 ) ),
inference(cnf_transformation,[],[f149]) ).
tff(f256,plain,
! [X2: ty,X3: uni,X0: uni,X1: uni] :
( ~ mem(X2,X0,infix_plpl(X2,X3,X1))
| mem(X2,X0,X1)
| mem(X2,X0,X3) ),
inference(cnf_transformation,[],[f154]) ).
tff(f272,plain,
! [X2: ty,X0: uni,X1: uni] : sort1(list(X2),infix_plpl(X2,X0,X1)),
inference(cnf_transformation,[],[f163]) ).
tff(f279,plain,
! [X2: uni,X3: uni,X1: ty,X4: ty,X5: uni] :
( ( get(X4,X1,set(X4,X1,X2,X5,X3),X5) = X3 )
| ~ sort1(X4,X3) ),
inference(equality_resolution,[],[f172]) ).
tff(f288,plain,
! [X19: tree1] :
( ( size1(sK20(X19)) = $sum($sum(sK11,-1),$uminus(sK14)) )
| ~ mem(tree,t2tb2(X19),t2tb1(sK17)) ),
inference(evaluation,[],[f218]) ).
tff(f369,definition,
( spl23_16
<=> mem(tree,t2tb2(sK19),get(list(tree),int,t2tb3(sK18),t2tb(sK11))) ),
introduced(definition,[new_symbols(definition,[spl23_16])],[avatar_definition]) ).
tff(f371,plain,
( mem(tree,t2tb2(sK19),get(list(tree),int,t2tb3(sK18),t2tb(sK11)))
| ~ spl23_16 ),
inference(avatar_component_clause,[],[f369]) ).
tff(f372,plain,
spl23_16,
inference(avatar_split_clause,[],[f222,f369]) ).
tff(f399,definition,
( spl23_22
<=> ( sK18 = tb2t3(set(list(tree),int,t2tb3(sK13),t2tb(sK11),infix_plpl(tree,t2tb1(sK17),get(list(tree),int,t2tb3(sK13),t2tb(sK11))))) ) ),
introduced(definition,[new_symbols(definition,[spl23_22])],[avatar_definition]) ).
tff(f401,plain,
( ( sK18 = tb2t3(set(list(tree),int,t2tb3(sK13),t2tb(sK11),infix_plpl(tree,t2tb1(sK17),get(list(tree),int,t2tb3(sK13),t2tb(sK11))))) )
| ~ spl23_22 ),
inference(avatar_component_clause,[],[f399]) ).
tff(f402,plain,
spl23_22,
inference(avatar_split_clause,[],[f220,f399]) ).
tff(f405,definition,
( spl23_23
<=> ( size1(sK19) = sK11 ) ),
introduced(definition,[new_symbols(definition,[spl23_23])],[avatar_definition]) ).
tff(f407,plain,
( ( size1(sK19) != sK11 )
| spl23_23 ),
inference(avatar_component_clause,[],[f405]) ).
tff(f409,definition,
( spl23_24
<=> ! [X18: tree1,X17: tree1] :
( ( node1(X18,X17) != sK19 )
| ~ $less(size1(X18),$sum(sK14,1)) ) ),
introduced(definition,[new_symbols(definition,[spl23_24])],[avatar_definition]) ).
tff(f410,plain,
( ! [X18: tree1,X17: tree1] :
( ~ $less(size1(X18),$sum(sK14,1))
| ( node1(X18,X17) != sK19 ) )
| ~ spl23_24 ),
inference(avatar_component_clause,[],[f409]) ).
tff(f411,plain,
( ~ spl23_23
| spl23_24 ),
inference(avatar_split_clause,[],[f223,f409,f405]) ).
tff(f412,plain,
( mem(tree,t2tb2(sK19),get(list(tree),int,t2tb3(tb2t3(set(list(tree),int,t2tb3(sK13),t2tb(sK11),infix_plpl(tree,t2tb1(sK17),get(list(tree),int,t2tb3(sK13),t2tb(sK11)))))),t2tb(sK11)))
| ~ spl23_16
| ~ spl23_22 ),
inference(forward_demodulation,[],[f371,f401]) ).
tff(f413,plain,
( mem(tree,t2tb2(sK19),get(list(tree),int,set(list(tree),int,t2tb3(sK13),t2tb(sK11),infix_plpl(tree,t2tb1(sK17),get(list(tree),int,t2tb3(sK13),t2tb(sK11)))),t2tb(sK11)))
| ~ spl23_16
| ~ spl23_22 ),
inference(forward_demodulation,[],[f412,f199]) ).
tff(f415,definition,
( spl23_25
<=> mem(tree,t2tb2(sK19),get(list(tree),int,set(list(tree),int,t2tb3(sK13),t2tb(sK11),infix_plpl(tree,t2tb1(sK17),get(list(tree),int,t2tb3(sK13),t2tb(sK11)))),t2tb(sK11))) ),
introduced(definition,[new_symbols(definition,[spl23_25])],[avatar_definition]) ).
tff(f417,plain,
( mem(tree,t2tb2(sK19),get(list(tree),int,set(list(tree),int,t2tb3(sK13),t2tb(sK11),infix_plpl(tree,t2tb1(sK17),get(list(tree),int,t2tb3(sK13),t2tb(sK11)))),t2tb(sK11)))
| ~ spl23_25 ),
inference(avatar_component_clause,[],[f415]) ).
tff(f418,plain,
( spl23_25
| ~ spl23_16
| ~ spl23_22 ),
inference(avatar_split_clause,[],[f413,f399,f369,f415]) ).
tff(f438,plain,
! [X0: tree1] :
( ( size1(X0) = $sum($sum(1,size1(sK21(X0))),size1(sK20(X0))) )
| ~ mem(tree,t2tb2(X0),t2tb1(sK17)) ),
inference(superposition,[],[f201,f219]) ).
tff(f469,plain,
( ~ mem(tree,t2tb2(sK19),get(list(tree),int,t2tb3(sK13),t2tb(sK11)))
| spl23_23 ),
inference(unit_resulting_resolution,[],[f230,f407]) ).
tff(f471,definition,
( spl23_33
<=> mem(tree,t2tb2(sK19),get(list(tree),int,t2tb3(sK13),t2tb(sK11))) ),
introduced(definition,[new_symbols(definition,[spl23_33])],[avatar_definition]) ).
tff(f472,plain,
( mem(tree,t2tb2(sK19),get(list(tree),int,t2tb3(sK13),t2tb(sK11)))
| ~ spl23_33 ),
inference(avatar_component_clause,[],[f471]) ).
tff(f474,plain,
( ~ spl23_33
| spl23_23 ),
inference(avatar_split_clause,[],[f469,f405,f471]) ).
tff(f575,plain,
( mem(tree,t2tb2(sK19),infix_plpl(tree,t2tb1(sK17),get(list(tree),int,t2tb3(sK13),t2tb(sK11))))
| ~ sort1(list(tree),infix_plpl(tree,t2tb1(sK17),get(list(tree),int,t2tb3(sK13),t2tb(sK11))))
| ~ spl23_25 ),
inference(superposition,[],[f417,f279]) ).
tff(f581,plain,
( mem(tree,t2tb2(sK19),infix_plpl(tree,t2tb1(sK17),get(list(tree),int,t2tb3(sK13),t2tb(sK11))))
| ~ spl23_25 ),
inference(forward_subsumption_resolution,[],[f575,f272]) ).
tff(f593,definition,
( spl23_49
<=> mem(tree,t2tb2(sK19),infix_plpl(tree,t2tb1(sK17),get(list(tree),int,t2tb3(sK13),t2tb(sK11)))) ),
introduced(definition,[new_symbols(definition,[spl23_49])],[avatar_definition]) ).
tff(f595,plain,
( mem(tree,t2tb2(sK19),infix_plpl(tree,t2tb1(sK17),get(list(tree),int,t2tb3(sK13),t2tb(sK11))))
| ~ spl23_49 ),
inference(avatar_component_clause,[],[f593]) ).
tff(f596,plain,
( spl23_49
| ~ spl23_25 ),
inference(avatar_split_clause,[],[f581,f415,f593]) ).
tff(f689,plain,
( mem(tree,t2tb2(sK19),get(list(tree),int,t2tb3(sK13),t2tb(sK11)))
| mem(tree,t2tb2(sK19),t2tb1(sK17))
| ~ spl23_49 ),
inference(resolution,[],[f595,f256]) ).
tff(f702,definition,
( spl23_64
<=> mem(tree,t2tb2(sK19),t2tb1(sK17)) ),
introduced(definition,[new_symbols(definition,[spl23_64])],[avatar_definition]) ).
tff(f704,plain,
( mem(tree,t2tb2(sK19),t2tb1(sK17))
| ~ spl23_64 ),
inference(avatar_component_clause,[],[f702]) ).
tff(f714,plain,
( spl23_64
| spl23_33
| ~ spl23_49 ),
inference(avatar_split_clause,[],[f689,f593,f471,f702]) ).
tff(f737,plain,
( ( size1(sK20(sK19)) = $sum($sum(sK11,-1),$uminus(sK14)) )
| ~ spl23_64 ),
inference(unit_resulting_resolution,[],[f288,f704]) ).
tff(f755,plain,
( ( size1(sK21(sK19)) = sK14 )
| ~ spl23_64 ),
inference(resolution,[],[f704,f217]) ).
tff(f758,definition,
( spl23_68
<=> ( size1(sK20(sK19)) = $sum($sum(sK11,-1),$uminus(sK14)) ) ),
introduced(definition,[new_symbols(definition,[spl23_68])],[avatar_definition]) ).
tff(f761,plain,
( spl23_68
| ~ spl23_64 ),
inference(avatar_split_clause,[],[f737,f702,f758]) ).
tff(f768,definition,
( spl23_70
<=> ( size1(sK21(sK19)) = sK14 ) ),
introduced(definition,[new_symbols(definition,[spl23_70])],[avatar_definition]) ).
tff(f770,plain,
( ( size1(sK21(sK19)) = sK14 )
| ~ spl23_70 ),
inference(avatar_component_clause,[],[f768]) ).
tff(f771,plain,
( spl23_70
| ~ spl23_64 ),
inference(avatar_split_clause,[],[f755,f702,f768]) ).
tff(f827,definition,
( spl23_80
<=> $less(sK14,$sum(sK14,1)) ),
introduced(definition,[new_symbols(definition,[spl23_80])],[avatar_definition]) ).
tff(f868,plain,
( $less(size1(sK16(sK19)),sK14)
| ~ spl23_33 ),
inference(unit_resulting_resolution,[],[f229,f472]) ).
tff(f877,plain,
( ( sK19 = node1(sK16(sK19),sK15(sK19)) )
| ~ spl23_33 ),
inference(resolution,[],[f472,f228]) ).
tff(f891,definition,
( spl23_89
<=> ( sK19 = node1(sK16(sK19),sK15(sK19)) ) ),
introduced(definition,[new_symbols(definition,[spl23_89])],[avatar_definition]) ).
tff(f893,plain,
( ( sK19 = node1(sK16(sK19),sK15(sK19)) )
| ~ spl23_89 ),
inference(avatar_component_clause,[],[f891]) ).
tff(f894,plain,
( spl23_89
| ~ spl23_33 ),
inference(avatar_split_clause,[],[f877,f471,f891]) ).
tff(f901,definition,
( spl23_91
<=> $less(size1(sK16(sK19)),sK14) ),
introduced(definition,[new_symbols(definition,[spl23_91])],[avatar_definition]) ).
tff(f904,plain,
( spl23_91
| ~ spl23_33 ),
inference(avatar_split_clause,[],[f868,f471,f901]) ).
tff(f905,plain,
( ! [X0: tree1] :
( ( sK19 != node1(sK21(sK19),X0) )
| ~ $less(sK14,$sum(sK14,1)) )
| ~ spl23_24
| ~ spl23_70 ),
inference(superposition,[],[f410,f770]) ).
tff(f910,definition,
( spl23_92
<=> ! [X0: tree1] : ( sK19 != node1(sK21(sK19),X0) ) ),
introduced(definition,[new_symbols(definition,[spl23_92])],[avatar_definition]) ).
tff(f911,plain,
( ! [X0: tree1] : ( sK19 != node1(sK21(sK19),X0) )
| ~ spl23_92 ),
inference(avatar_component_clause,[],[f910]) ).
tff(f912,plain,
( spl23_92
| ~ spl23_80
| ~ spl23_24
| ~ spl23_70 ),
inference(avatar_split_clause,[],[f905,f768,f409,f827,f910]) ).
tff(f935,definition,
( spl23_94
<=> ( $sum($sum(1,sK14),size1(sK20(sK19))) = sK11 ) ),
introduced(definition,[new_symbols(definition,[spl23_94])],[avatar_definition]) ).
tff(f937,plain,
( ( $sum($sum(1,sK14),size1(sK20(sK19))) = sK11 )
| ~ spl23_94 ),
inference(avatar_component_clause,[],[f935]) ).
tff(f942,plain,
( ( size1(sK19) = $sum($sum(1,size1(sK21(sK19))),size1(sK20(sK19))) )
| ~ spl23_64 ),
inference(unit_resulting_resolution,[],[f438,f704]) ).
tff(f964,plain,
( ( size1(sK19) = $sum($sum(1,sK14),size1(sK20(sK19))) )
| ~ spl23_64
| ~ spl23_70 ),
inference(forward_demodulation,[],[f942,f770]) ).
tff(f967,plain,
( ( size1(sK19) = sK11 )
| ~ spl23_64
| ~ spl23_70
| ~ spl23_94 ),
inference(forward_demodulation,[],[f964,f937]) ).
tff(f1202,plain,
( ~ $less(size1(sK16(sK19)),$sum(sK14,1))
| ~ spl23_24
| ~ spl23_89 ),
inference(unit_resulting_resolution,[],[f410,f893]) ).
tff(f1213,definition,
( spl23_108
<=> $less(size1(sK16(sK19)),$sum(sK14,1)) ),
introduced(definition,[new_symbols(definition,[spl23_108])],[avatar_definition]) ).
tff(f1216,plain,
( ~ spl23_108
| ~ spl23_24
| ~ spl23_89 ),
inference(avatar_split_clause,[],[f1202,f891,f409,f1213]) ).
tff(f1248,plain,
( spl23_23
| ~ spl23_64
| ~ spl23_70
| ~ spl23_94 ),
inference(avatar_split_clause,[],[f967,f935,f768,f702,f405]) ).
tff(f1388,plain,
( ( sK19 != sK19 )
| ~ mem(tree,t2tb2(sK19),t2tb1(sK17))
| ~ spl23_92 ),
inference(superposition,[],[f911,f219]) ).
tff(f1389,plain,
( ~ mem(tree,t2tb2(sK19),t2tb1(sK17))
| ~ spl23_92 ),
inference(trivial_inequality_removal,[],[f1388]) ).
tff(f1393,plain,
( $false
| ~ spl23_64
| ~ spl23_92 ),
inference(forward_subsumption_resolution,[],[f1389,f704]) ).
tff(f1394,plain,
( ~ spl23_64
| ~ spl23_92 ),
inference(avatar_contradiction_clause,[],[f1393]) ).
tff(f1395,plain,
$false,
inference(avatar_smt_refutation,[],[f1394,f1248,f1216,f912,f904,f894,f771,f761,f714,f596,f474,f418,f411,f402,f372]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW602_2 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 % Computer : n007.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Mon Sep 28 14:19:10 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running first-order theorem proving
% 0.09/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.11/1.67 % (2413098)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 5.11/1.67 % (2413160)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=3261985255:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 5.11/1.67 % (2413162)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=1432863727:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 5.11/1.67 % (2413160)Instruction limit reached!
% 5.11/1.67 % (2413160)------------------------------
% 5.11/1.67 % (2413160)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.11/1.67 % (2413160)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.11/1.67 % (2413160)CaDiCaL version: 2.1.3
% 5.11/1.67 % (2413160)Termination reason: Instruction limit
% 5.11/1.67 % (2413160)Termination phase: Clausification
% 5.11/1.67 % (2413160)Time elapsed: 0.003 s
% 5.11/1.67 % (2413160)Peak memory usage: 86 MB
% 5.11/1.67 % (2413160)Instructions burned: 5 (million)
% 5.11/1.67 % (2413159)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=3980117046:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 5.11/1.67 % (2413159)Instruction limit reached!
% 5.11/1.67 % (2413159)------------------------------
% 5.11/1.67 % (2413159)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.11/1.67 % (2413159)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.11/1.67 % (2413159)CaDiCaL version: 2.1.3
% 5.11/1.67 % (2413159)Termination reason: Instruction limit
% 5.11/1.67 % (2413159)Termination phase: Property scanning
% 5.11/1.67 % (2413159)Time elapsed: 0.008 s
% 5.11/1.67 % (2413159)Peak memory usage: 87 MB
% 5.11/1.67 % (2413159)Instructions burned: 7 (million)
% 5.11/1.67 % (2413162)Instruction limit reached!
% 5.11/1.67 % (2413162)------------------------------
% 5.11/1.67 % (2413162)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.11/1.67 % (2413162)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.11/1.67 % (2413162)CaDiCaL version: 2.1.3
% 5.11/1.67 % (2413162)Termination reason: Instruction limit
% 5.11/1.67 % (2413162)Termination phase: Saturation
% 5.11/1.67 % (2413162)Time elapsed: 0.067 s
% 5.11/1.67 % (2413162)Peak memory usage: 117 MB
% 5.11/1.67 % (2413162)Instructions burned: 33 (million)
% 5.11/1.67 % (2413156)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=3898598762:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 5.11/1.67 % (2413161)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=3674752868:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 5.11/1.67 % (2413158)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=2794728421:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 5.11/1.67 % (2413157)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=2641400935:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 5.11/1.67 % (2413156)Instruction limit reached!
% 5.11/1.67 % (2413156)------------------------------
% 5.11/1.67 % (2413156)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.11/1.67 % (2413156)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.11/1.67 % (2413156)CaDiCaL version: 2.1.3
% 5.11/1.67 % (2413156)Termination reason: Instruction limit
% 5.11/1.67 % (2413156)Termination phase: Saturation
% 5.11/1.67 % (2413156)Time elapsed: 0.035 s
% 5.11/1.67 % (2413156)Peak memory usage: 107 MB
% 5.11/1.67 % (2413156)Instructions burned: 12 (million)
% 5.11/1.67 % (2413161)Instruction limit reached!
% 5.11/1.67 % (2413161)------------------------------
% 5.11/1.67 % (2413161)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.11/1.67 % (2413161)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.11/1.67 % (2413161)CaDiCaL version: 2.1.3
% 5.11/1.67 % (2413161)Termination reason: Instruction limit
% 5.11/1.67 % (2413161)Termination phase: Saturation
% 5.11/1.67 % (2413161)Time elapsed: 0.083 s
% 5.11/1.67 % (2413161)Peak memory usage: 116 MB
% 5.11/1.67 % (2413161)Instructions burned: 46 (million)
% 5.11/1.67 % (2413165)dis+11_3_anc=none:drc=ordering:si=on:urr=ec_only:bce=on:tha=off:sac=on:random_seed=2629583290:st=5:i=14:sd=10:rtra=on:ss=axioms:rawr=on_2998 on theBenchmark for (2998ds/14Mi)
% 5.11/1.67 % (2413165)Instruction limit reached!
% 5.11/1.67 % (2413165)------------------------------
% 7.01/1.89 % (2413165)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.01/1.89 % (2413165)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.01/1.89 % (2413165)CaDiCaL version: 2.1.3
% 7.01/1.89 % (2413165)Termination reason: Instruction limit
% 7.01/1.89 % (2413165)Termination phase: Saturation
% 7.01/1.89 % (2413165)Time elapsed: 0.017 s
% 7.01/1.89 % (2413165)Peak memory usage: 89 MB
% 7.01/1.89 % (2413165)Instructions burned: 14 (million)
% 7.01/1.89 % (2413172)ott+21_1024_to=lakbo:sil=128000:bsd=on:si=on:alasca=on:uwa=alasca_main:nwc=0.5:random_seed=2556189144:cond=on:i=16:fgj=on:ep=RS:asg=force:nm=10:rtra=on:rawr=on_2997 on theBenchmark for (2997ds/16Mi)
% 7.01/1.89 % (2413172)Instruction limit reached!
% 7.01/1.89 % (2413172)------------------------------
% 7.01/1.89 % (2413172)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.01/1.89 % (2413172)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.01/1.89 % (2413172)CaDiCaL version: 2.1.3
% 7.01/1.89 % (2413172)Termination reason: Instruction limit
% 7.01/1.89 % (2413172)Termination phase: Saturation
% 7.01/1.89 % (2413172)Time elapsed: 0.010 s
% 7.01/1.89 % (2413172)Peak memory usage: 89 MB
% 7.01/1.89 % (2413172)Instructions burned: 17 (million)
% 7.01/1.89 % (2413174)dis+1011_1_prc=on:drc=off:si=on:sac=on:random_seed=1625580573:i=24:canc=force:rtra=on_2997 on theBenchmark for (2997ds/24Mi)
% 7.01/1.89 % (2413174)Instruction limit reached!
% 7.01/1.89 % (2413174)------------------------------
% 7.01/1.89 % (2413174)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.01/1.89 % (2413174)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.01/1.89 % (2413174)CaDiCaL version: 2.1.3
% 7.01/1.89 % (2413174)Termination reason: Instruction limit
% 7.01/1.89 % (2413174)Termination phase: Saturation
% 7.01/1.89 % (2413174)Time elapsed: 0.020 s
% 7.01/1.89 % (2413174)Peak memory usage: 90 MB
% 7.01/1.89 % (2413174)Instructions burned: 24 (million)
% 7.01/1.89 % (2413167)dis+1011_2:1_to=kbo:sil=128000:tgt=full:fde=none:si=on:norm_ineq=on:spb=goal_then_units:tha=some:nwc=2:sac=on:random_seed=3543080764:i=29:thsqd=64:nm=0:thsqc=8:rtra=on:thsq=on:ev=off_2997 on theBenchmark for (2997ds/29Mi)
% 7.01/1.89 % (2413158)Instruction limit reached!
% 7.01/1.89 % (2413158)------------------------------
% 7.01/1.89 % (2413158)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.01/1.89 % (2413158)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.01/1.89 % (2413158)CaDiCaL version: 2.1.3
% 7.01/1.89 % (2413158)Termination reason: Instruction limit
% 7.01/1.89 % (2413158)Termination phase: Saturation
% 7.01/1.89 % (2413158)Time elapsed: 0.275 s
% 7.01/1.89 % (2413158)Peak memory usage: 119 MB
% 7.01/1.89 % (2413158)Instructions burned: 201 (million)
% 7.01/1.89 % (2413167)Instruction limit reached!
% 7.01/1.89 % (2413167)------------------------------
% 7.01/1.89 % (2413167)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.01/1.89 % (2413167)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.01/1.89 % (2413167)CaDiCaL version: 2.1.3
% 7.01/1.89 % (2413167)Termination reason: Instruction limit
% 7.01/1.89 % (2413167)Termination phase: Saturation
% 7.01/1.89 % (2413167)Time elapsed: 0.034 s
% 7.01/1.89 % (2413167)Peak memory usage: 89 MB
% 7.01/1.89 % (2413167)Instructions burned: 30 (million)
% 7.01/1.89 % (2413157)Instruction limit reached!
% 7.01/1.89 % (2413157)------------------------------
% 7.01/1.89 % (2413157)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.01/1.89 % (2413157)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.01/1.89 % (2413157)CaDiCaL version: 2.1.3
% 7.01/1.89 % (2413157)Termination reason: Instruction limit
% 7.01/1.89 % (2413157)Termination phase: Saturation
% 7.01/1.89 % (2413157)Time elapsed: 0.352 s
% 7.01/1.89 % (2413157)Peak memory usage: 118 MB
% 7.01/1.89 % (2413157)Instructions burned: 307 (million)
% 7.01/1.89 % (2413177)ott+1010_8_to=lpo:sil=128000:si=on:norm_ineq=on:sp=unary_frequency:sos=on:gve=cautious:spb=goal_then_units:uwa=alasca_main_floor:tha=some:random_seed=2673826915:i=27:canc=cautious:fsr=off:rtra=on_2996 on theBenchmark for (2996ds/27Mi)
% 7.01/1.89 % (2413177)Instruction limit reached!
% 7.01/1.89 % (2413177)------------------------------
% 7.01/1.89 % (2413177)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.01/1.89 % (2413177)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.20/2.25 % (2413177)CaDiCaL version: 2.1.3
% 10.20/2.25 % (2413177)Termination reason: Instruction limit
% 10.20/2.25 % (2413177)Termination phase: Saturation
% 10.20/2.25 % (2413177)Time elapsed: 0.031 s
% 10.20/2.25 % (2413177)Peak memory usage: 90 MB
% 10.20/2.25 % (2413177)Instructions burned: 28 (million)
% 10.20/2.25 % (2413184)ott+1002_1_si=on:sp=occurrence:spb=goal:lcm=predicate:random_seed=710142567:i=2:bd=preordered:nm=2:ins=3:rtra=on:inst=on:tar=off_2995 on theBenchmark for (2995ds/2Mi)
% 10.20/2.25 % (2413184)Instruction limit reached!
% 10.20/2.25 % (2413184)------------------------------
% 10.20/2.25 % (2413184)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.20/2.25 % (2413184)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.20/2.25 % (2413184)CaDiCaL version: 2.1.3
% 10.20/2.25 % (2413184)Termination reason: Instruction limit
% 10.20/2.25 % (2413184)Termination phase: Preprocessing 3
% 10.20/2.25 % (2413184)Time elapsed: 0.003 s
% 10.20/2.25 % (2413184)Peak memory usage: 86 MB
% 10.20/2.25 % (2413184)Instructions burned: 4 (million)
% 10.20/2.25 % (2413183)dis+1002_24_to=kbo:sil=128000:si=on:random_seed=516657687:i=85:gtgl=4:rtra=on:gtg=exists_sym_2995 on theBenchmark for (2995ds/85Mi)
% 10.20/2.25 % (2413186)dis+1010_1_to=kbo:sil=128000:tgt=full:si=on:tha=off:random_seed=46587928:i=181:rtra=on:ss=axioms:ev=cautious_2995 on theBenchmark for (2995ds/181Mi)
% 10.20/2.25 % (2413189)lrs+10_2_to=lpo:sil=64000:si=on:sos=on:gve=force:lcm=reverse:uwa=one_side_interpreted:random_seed=325086058:i=4:ep=RST:ins=2:rtra=on_2994 on theBenchmark for (2994ds/4Mi)
% 10.20/2.25 % (2413189)Instruction limit reached!
% 10.20/2.25 % (2413189)------------------------------
% 10.20/2.25 % (2413189)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.20/2.25 % (2413189)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.20/2.25 % (2413189)CaDiCaL version: 2.1.3
% 10.20/2.25 % (2413189)Termination reason: Instruction limit
% 10.20/2.25 % (2413189)Termination phase: Preprocessing 3
% 10.20/2.25 % (2413189)Time elapsed: 0.005 s
% 10.20/2.25 % (2413189)Peak memory usage: 86 MB
% 10.20/2.25 % (2413189)Instructions burned: 4 (million)
% 10.20/2.25 % (2413183)Instruction limit reached!
% 10.20/2.25 % (2413183)------------------------------
% 10.20/2.25 % (2413183)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.20/2.25 % (2413183)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.20/2.25 % (2413183)CaDiCaL version: 2.1.3
% 10.20/2.25 % (2413183)Termination reason: Instruction limit
% 10.20/2.25 % (2413183)Termination phase: Saturation
% 10.20/2.25 % (2413183)Time elapsed: 0.080 s
% 10.20/2.25 % (2413183)Peak memory usage: 89 MB
% 10.20/2.25 % (2413183)Instructions burned: 85 (million)
% 10.20/2.25 % (2413190)dis+1010_128_isp=bottom:to=lpo:thi=overlap:prc=on:sas=z3:si=on:fd=preordered:random_seed=237596206:i=66:thsqd=64:thsqc=16:rtra=on:thsq=on:ev=force_2994 on theBenchmark for (2994ds/66Mi)
% 10.20/2.25 % (2413199)lrs+10_1_to=lakbo:sil=128000:si=on:alasca=on:sp=occurrence:random_seed=1117882749:st=3:i=2:rtra=on:ss=axioms_2993 on theBenchmark for (2993ds/2Mi)
% 10.20/2.25 % (2413199)Instruction limit reached!
% 10.20/2.25 % (2413199)------------------------------
% 10.20/2.25 % (2413199)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.20/2.25 % (2413199)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.20/2.25 % (2413199)CaDiCaL version: 2.1.3
% 10.20/2.25 % (2413199)Termination reason: Instruction limit
% 10.20/2.25 % (2413199)Termination phase: Preprocessing 3
% 10.20/2.25 % (2413199)Time elapsed: 0.002 s
% 10.20/2.25 % (2413199)Peak memory usage: 86 MB
% 10.20/2.25 % (2413199)Instructions burned: 3 (million)
% 10.20/2.25 % (2413194)lrs+10_1_thi=all:si=on:fd=off:random_seed=4203199049:i=53:rtra=on:gtg=all_2993 on theBenchmark for (2993ds/53Mi)
% 10.20/2.25 % (2413198)ott+1011_1_to=kbo:plsq=on:drc=off:si=on:plsqr=32,1:sp=const_frequency:sos=all:uwa=one_side_interpreted:sac=on:random_seed=3339129149:i=8:ep=RST:nm=16:rtra=on:gtg=exists_top_2993 on theBenchmark for (2993ds/8Mi)
% 10.20/2.25 % (2413198)Instruction limit reached!
% 10.20/2.25 % (2413198)------------------------------
% 10.20/2.25 % (2413198)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.20/2.25 % (2413198)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.20/2.25 % (2413198)CaDiCaL version: 2.1.3
% 10.20/2.25 % (2413198)Termination reason: Instruction limit
% 10.20/2.25 % (2413198)Termination phase: Property scanning
% 12.26/2.60 % (2413198)Time elapsed: 0.009 s
% 12.26/2.60 % (2413198)Peak memory usage: 87 MB
% 12.26/2.60 % (2413198)Instructions burned: 9 (million)
% 12.26/2.60 % (2413190)Instruction limit reached!
% 12.26/2.60 % (2413190)------------------------------
% 12.26/2.60 % (2413190)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.26/2.60 % (2413190)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.26/2.60 % (2413190)CaDiCaL version: 2.1.3
% 12.26/2.60 % (2413190)Termination reason: Instruction limit
% 12.26/2.60 % (2413190)Termination phase: Saturation
% 12.26/2.60 % (2413190)Time elapsed: 0.134 s
% 12.26/2.60 % (2413190)Peak memory usage: 135 MB
% 12.26/2.60 % (2413190)Instructions burned: 70 (million)
% 12.26/2.60 % (2413186)Instruction limit reached!
% 12.26/2.60 % (2413186)------------------------------
% 12.26/2.60 % (2413186)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.26/2.60 % (2413186)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.26/2.60 % (2413186)CaDiCaL version: 2.1.3
% 12.26/2.60 % (2413186)Termination reason: Instruction limit
% 12.26/2.60 % (2413186)Termination phase: Saturation
% 12.26/2.60 % (2413186)Time elapsed: 0.218 s
% 12.26/2.60 % (2413186)Peak memory usage: 92 MB
% 12.26/2.60 % (2413186)Instructions burned: 181 (million)
% 12.26/2.60 % (2413194)Instruction limit reached!
% 12.26/2.60 % (2413194)------------------------------
% 12.26/2.60 % (2413194)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.26/2.60 % (2413194)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.26/2.60 % (2413194)CaDiCaL version: 2.1.3
% 12.26/2.60 % (2413194)Termination reason: Instruction limit
% 12.26/2.60 % (2413194)Termination phase: Saturation
% 12.26/2.60 % (2413194)Time elapsed: 0.090 s
% 12.26/2.60 % (2413194)Peak memory usage: 116 MB
% 12.26/2.60 % (2413194)Instructions burned: 53 (million)
% 12.26/2.60 % (2413204)dis+1002_1_to=lpo:sil=64000:si=on:flr=on:random_seed=3771807426:i=2:doe=on:canc=force:asg=cautious:rtra=on_2992 on theBenchmark for (2992ds/2Mi)
% 12.26/2.60 % (2413204)Instruction limit reached!
% 12.26/2.60 % (2413204)------------------------------
% 12.26/2.60 % (2413204)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.26/2.60 % (2413204)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.26/2.60 % (2413204)CaDiCaL version: 2.1.3
% 12.26/2.60 % (2413204)Termination reason: Instruction limit
% 12.26/2.60 % (2413204)Termination phase: Preprocessing 1
% 12.26/2.60 % (2413204)Time elapsed: 0.003 s
% 12.26/2.60 % (2413204)Peak memory usage: 86 MB
% 12.26/2.60 % (2413204)Instructions burned: 2 (million)
% 12.26/2.60 % (2413205)lrs+1011_16:1_to=kbo:sil=128000:sas=z3:si=on:sos=theory:erd=off:urr=full:random_seed=256263904:i=127:doe=on:rtra=on_2992 on theBenchmark for (2992ds/127Mi)
% 12.26/2.60 % (2413209)dis+10_1_si=on:random_seed=3389512709:i=10:ep=R:rtra=on_2991 on theBenchmark for (2991ds/10Mi)
% 12.26/2.60 % (2413209)Instruction limit reached!
% 12.26/2.60 % (2413209)------------------------------
% 12.26/2.60 % (2413209)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.26/2.60 % (2413209)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.26/2.60 % (2413209)CaDiCaL version: 2.1.3
% 12.26/2.60 % (2413209)Termination reason: Instruction limit
% 12.26/2.60 % (2413209)Termination phase: Saturation
% 12.26/2.60 % (2413209)Time elapsed: 0.011 s
% 12.26/2.60 % (2413209)Peak memory usage: 88 MB
% 12.26/2.60 % (2413209)Instructions burned: 10 (million)
% 12.26/2.60 % (2413211)lrs-1011_64_to=lpo:si=on:sp=unary_first:sos=on:br=off:random_seed=2451291609:i=26:canc=cautious:av=off:rtra=on_2990 on theBenchmark for (2990ds/26Mi)
% 12.26/2.60 % (2413211)Refutation not found, incomplete strategy
% 12.26/2.60 % (2413211)------------------------------
% 12.26/2.60 % (2413211)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.26/2.60 % (2413211)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.26/2.60 % (2413211)CaDiCaL version: 2.1.3
% 12.26/2.60 % (2413211)Termination reason: Refutation not found, incomplete strategy
% 12.26/2.60 % (2413211)Time elapsed: 0.012 s
% 12.26/2.60 % (2413211)Peak memory usage: 89 MB
% 12.26/2.60 % (2413211)Instructions burned: 19 (million)
% 12.26/2.60 % (2413213)ott+10_8:1_to=lpo:sil=128000:si=on:fs=off:spb=goal_then_units:uwa=alasca_main:random_seed=2588370390:i=2:fsr=off:rtra=on:inst=on_2990 on theBenchmark for (2990ds/2Mi)
% 12.26/2.60 % (2413213)Instruction limit reached!
% 12.26/2.60 % (2413213)------------------------------
% 12.78/2.79 % (2413213)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.78/2.79 % (2413213)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.78/2.79 % (2413213)CaDiCaL version: 2.1.3
% 12.78/2.79 % (2413213)Termination reason: Instruction limit
% 12.78/2.79 % (2413213)Termination phase: Preprocessing 1
% 12.78/2.79 % (2413213)Time elapsed: 0.003 s
% 12.78/2.79 % (2413213)Peak memory usage: 85 MB
% 12.78/2.79 % (2413213)Instructions burned: 3 (million)
% 12.78/2.79 % (2413212)dis+1011_5_anc=all:tgt=full:si=on:sp=const_frequency:spb=non_intro:fd=preordered:sac=on:random_seed=982797762:avsq=on:i=35:doe=on:thsqd=64:nm=64:fsr=off:thsqc=32:rtra=on:tac=light:ss=included:thsq=on:ev=off:sgt=32_2990 on theBenchmark for (2990ds/35Mi)
% 12.78/2.79 % (2413205)Instruction limit reached!
% 12.78/2.79 % (2413205)------------------------------
% 12.78/2.79 % (2413205)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.78/2.79 % (2413205)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.78/2.79 % (2413205)CaDiCaL version: 2.1.3
% 12.78/2.79 % (2413205)Termination reason: Instruction limit
% 12.78/2.79 % (2413205)Termination phase: Saturation
% 12.78/2.79 % (2413205)Time elapsed: 0.177 s
% 12.78/2.79 % (2413205)Peak memory usage: 117 MB
% 12.78/2.79 % (2413205)Instructions burned: 128 (million)
% 12.78/2.79 % (2413214)dis+21_1_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=off:s2agt=16:random_seed=452082467:s2a=on:i=8:kws=inv_precedence:doe=on:rtra=on_2990 on theBenchmark for (2990ds/8Mi)
% 12.78/2.79 % (2413214)Instruction limit reached!
% 12.78/2.79 % (2413214)------------------------------
% 12.78/2.79 % (2413214)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.78/2.79 % (2413214)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.78/2.79 % (2413214)CaDiCaL version: 2.1.3
% 12.78/2.79 % (2413214)Termination reason: Instruction limit
% 12.78/2.79 % (2413214)Termination phase: Saturation
% 12.78/2.79 % (2413214)Time elapsed: 0.009 s
% 12.78/2.79 % (2413214)Peak memory usage: 88 MB
% 12.78/2.79 % (2413214)Instructions burned: 8 (million)
% 12.78/2.79 % (2413212)Instruction limit reached!
% 12.78/2.79 % (2413212)------------------------------
% 12.78/2.79 % (2413212)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.78/2.79 % (2413212)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.78/2.79 % (2413212)CaDiCaL version: 2.1.3
% 12.78/2.79 % (2413212)Termination reason: Instruction limit
% 12.78/2.79 % (2413212)Termination phase: Saturation
% 12.78/2.79 % (2413212)Time elapsed: 0.042 s
% 12.78/2.79 % (2413212)Peak memory usage: 89 MB
% 12.78/2.79 % (2413212)Instructions burned: 35 (million)
% 12.78/2.79 % (2413219)ott+1002_1_to=lpo:thi=overlap:prc=on:bsd=on:si=on:gve=cautious:thigen=on:tha=some:random_seed=1094087277:i=13:av=off:rtra=on:gtg=exists_sym:ev=force_2989 on theBenchmark for (2989ds/13Mi)
% 12.78/2.79 % (2413217)lrs-1011_1_to=kbo:sil=128000:prc=on:si=on:fs=off:tha=off:random_seed=3525379358:i=370:ep=RS:fsr=off:rtra=on_2989 on theBenchmark for (2989ds/370Mi)
% 12.78/2.79 % (2413219)Instruction limit reached!
% 12.78/2.79 % (2413219)------------------------------
% 12.78/2.79 % (2413219)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.78/2.79 % (2413219)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.78/2.79 % (2413219)CaDiCaL version: 2.1.3
% 12.78/2.79 % (2413219)Termination reason: Instruction limit
% 12.78/2.79 % (2413219)Termination phase: Saturation
% 12.78/2.79 % (2413219)Time elapsed: 0.039 s
% 12.78/2.79 % (2413219)Peak memory usage: 109 MB
% 12.78/2.79 % (2413219)Instructions burned: 13 (million)
% 12.78/2.79 % (2413211)------------------------------
% 12.78/2.79 % (2413211)------------------------------
% 12.78/2.79 % (2413222)lrs+1002_1_to=lpo:sil=128000:sas=z3:si=on:sos=on:urr=on:tha=off:random_seed=2870493114:i=226:rtra=on:gtg=position:ss=axioms_2988 on theBenchmark for (2988ds/226Mi)
% 12.78/2.79 % (2413228)lrs+1002_1_to=lpo:thi=strong:sas=z3:si=on:sp=const_frequency:tha=off:random_seed=921201824:i=71:rtra=on:gtg=exists_top_2987 on theBenchmark for (2987ds/71Mi)
% 12.78/2.79 % (2413227)lrs+1010_5_to=lpo:sil=128000:si=on:sp=const_frequency:sos=theory:tha=off:random_seed=2419262436:i=10:rtra=on_2987 on theBenchmark for (2987ds/10Mi)
% 12.78/2.79 % (2413227)Instruction limit reached!
% 12.78/2.79 % (2413227)------------------------------
% 12.78/2.79 % (2413227)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.78/2.79 % (2413227)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.78/2.79 % (2413227)CaDiCaL version: 2.1.3
% 12.78/2.79 % (2413227)Termination reason: Instruction limit
% 12.78/2.79 % (2413227)Termination phase: Saturation
% 12.78/2.79 % (2413227)Time elapsed: 0.012 s
% 12.78/2.79 % (2413227)Peak memory usage: 88 MB
% 12.78/2.79 % (2413227)Instructions burned: 10 (million)
% 12.78/2.79 % (2413229)lrs+1010_1_to=lpo:prlc=on:sil=128000:prc=on:drc=off:si=on:sp=const_max:thsqr=8,1:tha=some:nwc=5:random_seed=2052088488:i=75:doe=on:thsqd=64:canc=force:thsqc=64:rtra=on:thsq=on_2987 on theBenchmark for (2987ds/75Mi)
% 12.78/2.79 % (2413233)dis+1011_2:1_to=kbo:sil=128000:tgt=full:fde=none:si=on:norm_ineq=on:spb=goal_then_units:tha=some:nwc=2:sac=on:random_seed=1391773644:i=294:thsqd=64:nm=0:thsqc=8:rtra=on:thsq=on:ev=off_2986 on theBenchmark for (2986ds/294Mi)
% 12.78/2.79 % (2413234)ott+21_1_to=kbo:tgt=full:sas=z3:si=on:tha=off:random_seed=215073330:i=130:kws=inv_frequency:nm=0:rtra=on:gtg=exists_all_2986 on theBenchmark for (2986ds/130Mi)
% 12.78/2.79 % (2413222)First to succeed.
% 12.78/2.79 % (2413229)Instruction limit reached!
% 12.78/2.79 % (2413229)------------------------------
% 12.78/2.79 % (2413229)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.78/2.79 % (2413229)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.78/2.79 % (2413229)CaDiCaL version: 2.1.3
% 12.78/2.79 % (2413229)Termination reason: Instruction limit
% 12.78/2.79 % (2413229)Termination phase: Saturation
% 12.78/2.79 % (2413229)Time elapsed: 0.088 s
% 12.78/2.79 % (2413229)Peak memory usage: 90 MB
% 12.78/2.79 % (2413229)Instructions burned: 75 (million)
% 12.78/2.79 % (2413222)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2413098"
% 12.78/2.79 % (2413228)Instruction limit reached!
% 12.78/2.79 % (2413228)------------------------------
% 12.78/2.79 % (2413228)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.78/2.79 % (2413228)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.78/2.79 % (2413228)CaDiCaL version: 2.1.3
% 12.78/2.79 % (2413228)Termination reason: Instruction limit
% 12.78/2.79 % (2413228)Termination phase: Saturation
% 12.78/2.79 % (2413228)Time elapsed: 0.135 s
% 12.78/2.79 % (2413228)Peak memory usage: 133 MB
% 12.78/2.79 % (2413228)Instructions burned: 73 (million)
% 12.78/2.79 % (2413217)Instruction limit reached!
% 12.78/2.79 % (2413217)------------------------------
% 12.78/2.79 % (2413217)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.78/2.79 % (2413217)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.78/2.79 % (2413217)CaDiCaL version: 2.1.3
% 12.78/2.79 % (2413217)Termination reason: Instruction limit
% 12.78/2.79 % (2413217)Termination phase: Saturation
% 12.78/2.79 % (2413217)Time elapsed: 0.362 s
% 12.78/2.79 % (2413217)Peak memory usage: 92 MB
% 12.78/2.79 % (2413217)Instructions burned: 371 (million)
% 12.78/2.79 % (2413239)lrs+21_1_to=kbo:sil=64000:thi=all:sas=z3:si=on:spb=goal_then_units:tha=off:nwc=3:random_seed=2203626663:i=131:rtra=on_2985 on theBenchmark for (2985ds/131Mi)
% 12.78/2.79 % (2413233)Instruction limit reached!
% 12.78/2.79 % (2413233)------------------------------
% 12.78/2.79 % (2413233)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.78/2.79 % (2413233)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.78/2.79 % (2413233)CaDiCaL version: 2.1.3
% 12.78/2.79 % (2413233)Termination reason: Instruction limit
% 12.78/2.79 % (2413233)Termination phase: Saturation
% 12.78/2.79 % (2413233)Time elapsed: 0.184 s
% 12.78/2.79 % (2413233)Peak memory usage: 91 MB
% 12.78/2.79 % (2413233)Instructions burned: 294 (million)
% 12.78/2.79 % (2413234)Instruction limit reached!
% 12.78/2.79 % (2413234)------------------------------
% 12.78/2.79 % (2413234)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.78/2.79 % (2413234)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.78/2.79 % (2413234)CaDiCaL version: 2.1.3
% 12.78/2.79 % (2413234)Termination reason: Instruction limit
% 12.78/2.79 % (2413234)Termination phase: Saturation
% 12.78/2.79 % (2413234)Time elapsed: 0.171 s
% 12.78/2.79 % (2413234)Peak memory usage: 117 MB
% 12.78/2.79 % (2413234)Instructions burned: 130 (million)
% 12.78/2.79 % (2413245)ott+1010_3:1_to=kbo:sil=128000:thi=overlap:sas=z3:si=on:urr=on:tha=off:s2agt=32:random_seed=1425744468:s2a=on:i=598:doe=on:bs=on:canc=cautious:fsr=off:rtra=on_2983 on theBenchmark for (2983ds/598Mi)
% 12.78/2.79 % (2413244)lrs+10_1_to=lpo:sil=64000:si=on:sos=on:urr=on:random_seed=1283860099:i=307:rtra=on:gtg=exists_top_2983 on theBenchmark for (2983ds/307Mi)
% 12.78/2.79 % (2413243)dis+1010_16_to=lpo:sil=64000:thi=strong:sas=z3:si=on:nwc=5:random_seed=3411720878:i=40:gtgl=2:rtra=on:gtg=exists_sym:ev=force_2984 on theBenchmark for (2984ds/40Mi)
% 12.78/2.79 % (2413239)Instruction limit reached!
% 12.78/2.79 % (2413239)------------------------------
% 12.78/2.79 % (2413239)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.78/2.79 % (2413239)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.78/2.79 % (2413239)CaDiCaL version: 2.1.3
% 12.78/2.79 % (2413239)Termination reason: Instruction limit
% 12.78/2.79 % (2413239)Termination phase: Saturation
% 12.78/2.79 % (2413239)Time elapsed: 0.205 s
% 12.78/2.79 % (2413239)Peak memory usage: 134 MB
% 12.78/2.79 % (2413239)Instructions burned: 132 (million)
% 12.78/2.79 % (2413243)Instruction limit reached!
% 12.78/2.79 % (2413243)------------------------------
% 12.78/2.79 % (2413243)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.78/2.79 % (2413243)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.78/2.79 % (2413243)CaDiCaL version: 2.1.3
% 12.78/2.79 % (2413243)Termination reason: Instruction limit
% 12.78/2.79 % (2413243)Termination phase: Saturation
% 12.78/2.79 % (2413243)Time elapsed: 0.100 s
% 12.78/2.79 % (2413243)Peak memory usage: 134 MB
% 12.78/2.79 % (2413243)Instructions burned: 41 (million)
% 12.78/2.79 % (2413247)lrs+1011_5:1_to=kbo:sil=64000:thi=all:si=on:uwa=ground:br=off:random_seed=810920389:i=131:canc=cautious:fsr=off:rtra=on_2982 on theBenchmark for (2982ds/131Mi)
% 12.78/2.79 % (2413222)Refutation found. Thanks to Tanya!
% 12.78/2.79 % SZS status Theorem for theBenchmark
% 12.78/2.79 % SZS output start Proof for theBenchmark
% See solution above
% 14.76/3.00 % (2413222)------------------------------
% 14.76/3.00 % (2413222)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.76/3.00 % (2413222)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.76/3.00 % (2413222)CaDiCaL version: 2.1.3
% 14.76/3.00 % (2413222)Termination reason: Refutation
% 14.76/3.00 % (2413222)Time elapsed: 0.249 s
% 14.76/3.00 % (2413222)Peak memory usage: 118 MB
% 14.76/3.00 % (2413222)Instructions burned: 195 (million)
% 14.76/3.00 % (2413222)------------------------------
% 14.76/3.00 % (2413222)------------------------------
% 14.76/3.00 % (2413098)Success in time 2.012 s
% 14.76/3.00 % Vampire exiting
%------------------------------------------------------------------------------