0.00/0.03	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.04	% Command    : vampire --mode casc -t %d %s
0.02/0.23	% Computer   : n127.star.cs.uiowa.edu
0.02/0.23	% Model      : x86_64 x86_64
0.02/0.23	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.02/0.23	% Memory     : 32218.625MB
0.02/0.23	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.02/0.23	% CPULimit   : 300
0.02/0.23	% DateTime   : Sat Jul 14 04:27:09 CDT 2018
0.02/0.23	% CPUTime    : 
0.02/0.27	% dis+11_6_add=large:afr=on:afp=100000:afq=1.2:amm=off:anc=none:cond=fast:gs=on:gsaa=from_current:gsem=off:irw=on:lma=on:lwlo=on:nm=64:nwc=1:sas=z3:sos=on:sp=occurrence:tha=off:thi=strong:updr=off_2 on theBenchmark
0.51/0.77	% Time limit reached!
0.51/0.77	% ------------------------------
0.51/0.77	% Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100)
0.51/0.77	% Termination reason: Time limit
0.51/0.77	% Termination phase: Saturation
0.51/0.77	
0.51/0.77	% Memory used [KB]: 6524
0.51/0.77	% Time elapsed: 0.500 s
0.51/0.77	% ------------------------------
0.51/0.77	% ------------------------------
0.58/0.80	% lrs+1010_4:1_aac=none:add=off:afp=40000:afq=1.0:amm=sco:anc=none:bd=off:cond=on:gs=on:gsem=on:irw=on:nm=0:nwc=2.5:sas=z3:stl=30:sos=theory:sp=reverse_arity:updr=off_11 on theBenchmark
2.20/2.41	% Time limit reached!
2.20/2.41	% ------------------------------
2.20/2.41	% Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100)
2.20/2.41	% Termination reason: Time limit
2.20/2.41	% Termination phase: Saturation
2.20/2.41	
2.20/2.41	% Memory used [KB]: 34924
2.20/2.41	% Time elapsed: 1.600 s
2.20/2.41	% ------------------------------
2.20/2.41	% ------------------------------
2.20/2.44	% dis-10_4:1_aac=none:add=off:afp=1000:afq=1.4:amm=off:anc=none:cond=fast:ep=RSTC:gs=on:gsaa=from_current:gsem=on:inw=on:lma=on:nm=64:nwc=4:sas=z3:tha=off:thi=strong:uwa=interpreted_only:updr=off:uhcvi=on_6 on theBenchmark
3.22/3.44	% Time limit reached!
3.22/3.44	% ------------------------------
3.22/3.44	% Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100)
3.22/3.44	% Termination reason: Time limit
3.22/3.44	% Termination phase: Saturation
3.22/3.44	
3.22/3.44	% Memory used [KB]: 7675
3.22/3.44	% Time elapsed: 1.0000 s
3.22/3.44	% ------------------------------
3.22/3.44	% ------------------------------
3.22/3.48	% lrs-11_1_av=off:cond=on:gs=on:lcm=reverse:lma=on:lwlo=on:nm=16:nwc=5:stl=30:sp=reverse_arity:tha=off:thi=strong:uwa=interpreted_only_74 on theBenchmark
13.05/13.28	% Time limit reached!
13.05/13.28	% ------------------------------
13.05/13.28	% Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100)
13.05/13.28	% Termination reason: Time limit
13.05/13.28	% Termination phase: Saturation
13.05/13.28	
13.05/13.28	% Memory used [KB]: 32366
13.05/13.28	% Time elapsed: 9.800 s
13.05/13.28	% ------------------------------
13.05/13.28	% ------------------------------
13.15/13.31	% dis+10_3:2_afr=on:afp=1000:afq=1.2:bd=off:irw=on:lcm=predicate:lwlo=on:nm=0:newcnf=on:nwc=2:sos=on:tha=off:thf=on:urr=ec_only_11 on theBenchmark
14.75/14.91	% Time limit reached!
14.75/14.91	% ------------------------------
14.75/14.91	% Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100)
14.75/14.91	% Termination reason: Time limit
14.75/14.91	% Termination phase: Saturation
14.75/14.91	
14.75/14.91	% Memory used [KB]: 36204
14.75/14.91	% Time elapsed: 1.600 s
14.75/14.91	% ------------------------------
14.75/14.91	% ------------------------------
14.75/14.95	% dis+1010_2:3_add=off:afr=on:afp=10000:afq=1.1:anc=none:fsr=off:gs=on:gsem=off:nwc=1:sas=z3:sos=all:sac=on:sp=reverse_arity:tha=off_9 on theBenchmark
16.09/16.25	% Time limit reached!
16.09/16.25	% ------------------------------
16.09/16.25	% Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100)
16.09/16.25	% Termination reason: Time limit
16.09/16.25	% Termination phase: Saturation
16.09/16.25	
16.09/16.25	% Memory used [KB]: 43879
16.09/16.25	% Time elapsed: 1.300 s
16.09/16.25	% ------------------------------
16.09/16.25	% ------------------------------
16.09/16.29	% lrs+1_2:3_afr=on:afp=1000:afq=1.1:amm=sco:anc=none:fsr=off:fde=none:gs=on:gsaa=full_model:gsem=on:lma=on:nm=64:nwc=1.3:sas=z3:stl=30:sac=on:tha=off:uwa=one_side_interpreted:updr=off_9 on theBenchmark
17.39/17.59	% Time limit reached!
17.39/17.59	% ------------------------------
17.39/17.59	% Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100)
17.39/17.59	% Termination reason: Time limit
17.39/17.59	% Termination phase: Saturation
17.39/17.59	
17.39/17.59	% Memory used [KB]: 41065
17.39/17.59	% Time elapsed: 1.300 s
17.39/17.59	% ------------------------------
17.39/17.59	% ------------------------------
17.48/17.62	% lrs+10_5:4_aac=none:add=large:afr=on:afp=100000:afq=1.1:anc=none:bd=off:bsr=on:er=known:fsr=off:lma=on:nm=0:nwc=1:sas=z3:stl=30:sos=on:updr=off_17 on theBenchmark
19.89/20.02	% Time limit reached!
19.89/20.02	% ------------------------------
19.89/20.02	% Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100)
19.89/20.02	% Termination reason: Time limit
19.89/20.02	% Termination phase: Saturation
19.89/20.02	
19.89/20.02	% Memory used [KB]: 17654
19.89/20.02	% Time elapsed: 2.400 s
19.89/20.02	% ------------------------------
19.89/20.02	% ------------------------------
19.89/20.06	% lrs+10_2_add=off:afr=on:afp=4000:afq=2.0:amm=off:anc=none:cond=fast:fsr=off:fde=unused:gs=on:gsaa=full_model:gsem=on:inw=on:nm=64:nwc=1:sas=z3:stl=30:sos=all:sp=occurrence:tha=off:thf=on:urr=on:updr=off:uhcvi=on_6 on theBenchmark
20.88/21.06	% Time limit reached!
20.88/21.06	% ------------------------------
20.88/21.06	% Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100)
20.88/21.06	% Termination reason: Time limit
20.88/21.06	% Termination phase: Saturation
20.88/21.06	
20.88/21.06	% Memory used [KB]: 12409
20.88/21.06	% Time elapsed: 1.0000 s
20.88/21.06	% ------------------------------
20.88/21.06	% ------------------------------
20.88/21.09	% lrs+1_5:4_aac=none:add=off:afr=on:afp=4000:afq=1.2:amm=sco:anc=none:gsp=input_only:gs=on:irw=on:nm=64:newcnf=on:nwc=1.3:nicw=on:sas=z3:stl=30:sp=occurrence:tha=off_34 on theBenchmark
25.53/25.69	% Time limit reached!
25.53/25.69	% ------------------------------
25.53/25.69	% Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100)
25.53/25.69	% Termination reason: Time limit
25.53/25.69	% Termination phase: Saturation
25.53/25.69	
25.53/25.69	% Memory used [KB]: 57568
25.53/25.69	% Time elapsed: 4.600 s
25.53/25.69	% ------------------------------
25.53/25.69	% ------------------------------
25.61/25.73	% dis+1002_4_add=off:afp=10000:afq=2.0:amm=off:anc=none:fsr=off:gsp=input_only:gs=on:gsem=on:irw=on:lwlo=on:nm=2:newcnf=on:nwc=1:sos=on:sac=on:sp=occurrence:tha=off:updr=off_3 on theBenchmark
26.23/26.33	% Time limit reached!
26.23/26.33	% ------------------------------
26.23/26.33	% Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100)
26.23/26.33	% Termination reason: Time limit
26.23/26.33	% Termination phase: Saturation
26.23/26.33	
26.23/26.33	% Memory used [KB]: 31598
26.23/26.33	% Time elapsed: 0.600 s
26.23/26.33	% ------------------------------
26.23/26.33	% ------------------------------
26.23/26.37	% lrs+1011_1_add=off:afp=100000:afq=1.0:anc=none:cond=on:gs=on:gsaa=from_current:gsem=on:inw=on:lma=on:nm=64:newcnf=on:nwc=1:sas=z3:stl=30:sos=on:sp=occurrence:tha=off:uwa=ground_3 on theBenchmark
26.83/26.97	% Time limit reached!
26.83/26.97	% ------------------------------
26.83/26.97	% Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100)
26.83/26.97	% Termination reason: Time limit
26.83/26.97	% Termination phase: Saturation
26.83/26.97	
26.83/26.97	% Memory used [KB]: 10362
26.83/26.97	% Time elapsed: 0.600 s
26.83/26.97	% ------------------------------
26.83/26.97	% ------------------------------
26.92/27.00	% dis+1_3:1_acc=on:afp=100000:afq=1.1:amm=off:anc=none:bd=off:cond=on:fsr=off:gs=on:inw=on:lma=on:nm=32:nwc=1:urr=on_2 on theBenchmark
27.33/27.50	% Time limit reached!
27.33/27.50	% ------------------------------
27.33/27.50	% Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100)
27.33/27.50	% Termination reason: Time limit
27.33/27.50	% Termination phase: Saturation
27.33/27.50	
27.33/27.50	% Memory used [KB]: 28656
27.33/27.50	% Time elapsed: 0.500 s
27.33/27.50	% ------------------------------
27.33/27.50	% ------------------------------
27.43/27.54	% dis+1010_4_add=off:afp=100000:afq=1.0:anc=none:fsr=off:gs=on:gsem=off:inw=on:irw=on:lma=on:nm=64:nwc=1:sas=z3:sos=on:sac=on:tha=off:thf=on_179 on theBenchmark
27.62/27.78	% Refutation found. Thanks to Tanya!
27.62/27.78	% SZS status Theorem for theBenchmark
27.62/27.78	% SZS output start Proof for theBenchmark
27.62/27.78	tff(type_def_5, type, uni: $tType).
27.62/27.78	tff(type_def_6, type, ty: $tType).
27.62/27.78	tff(type_def_7, type, bool1: $tType).
27.62/27.78	tff(type_def_8, type, tuple02: $tType).
27.62/27.78	tff(type_def_9, type, tree1: $tType).
27.62/27.78	tff(type_def_10, type, list_tree: $tType).
27.62/27.78	tff(type_def_11, type, map_int_lplist_treerp: $tType).
27.62/27.78	tff(func_def_0, type, witness1: ty > uni).
27.62/27.78	tff(func_def_1, type, int: ty).
27.62/27.78	tff(func_def_2, type, real: ty).
27.62/27.78	tff(func_def_3, type, bool: ty).
27.62/27.78	tff(func_def_4, type, true1: bool1).
27.62/27.78	tff(func_def_5, type, false1: bool1).
27.62/27.78	tff(func_def_6, type, match_bool1: (ty * bool1 * uni * uni) > uni).
27.62/27.78	tff(func_def_7, type, tuple0: ty).
27.62/27.78	tff(func_def_8, type, tuple03: tuple02).
27.62/27.78	tff(func_def_9, type, qtmark: ty).
27.62/27.78	tff(func_def_10, type, list: ty > ty).
27.62/27.78	tff(func_def_11, type, nil: ty > uni).
27.62/27.78	tff(func_def_12, type, cons: (ty * uni * uni) > uni).
27.62/27.78	tff(func_def_13, type, match_list1: (ty * ty * uni * uni * uni) > uni).
27.62/27.78	tff(func_def_14, type, cons_proj_11: (ty * uni) > uni).
27.62/27.78	tff(func_def_15, type, cons_proj_21: (ty * uni) > uni).
27.62/27.78	tff(func_def_16, type, infix_plpl: (ty * uni * uni) > uni).
27.62/27.78	tff(func_def_17, type, length2: (ty * uni) > $int).
27.62/27.78	tff(func_def_18, type, map: (ty * ty) > ty).
27.62/27.78	tff(func_def_19, type, get: (ty * ty * uni * uni) > uni).
27.62/27.78	tff(func_def_20, type, set: (ty * ty * uni * uni * uni) > uni).
27.62/27.78	tff(func_def_21, type, const: (ty * ty * uni) > uni).
27.62/27.78	tff(func_def_22, type, array: ty > ty).
27.62/27.78	tff(func_def_23, type, mk_array1: (ty * $int * uni) > uni).
27.62/27.78	tff(func_def_24, type, length3: (ty * uni) > $int).
27.62/27.78	tff(func_def_25, type, elts: (ty * uni) > uni).
27.62/27.78	tff(func_def_26, type, get2: (ty * uni * $int) > uni).
27.62/27.78	tff(func_def_27, type, t2tb: $int > uni).
27.62/27.78	tff(func_def_28, type, tb2t: uni > $int).
27.62/27.78	tff(func_def_29, type, set2: (ty * uni * $int * uni) > uni).
27.62/27.78	tff(func_def_30, type, make1: (ty * $int * uni) > uni).
27.62/27.78	tff(func_def_31, type, tree: ty).
27.62/27.78	tff(func_def_32, type, empty1: tree1).
27.62/27.78	tff(func_def_33, type, node1: (tree1 * tree1) > tree1).
27.62/27.78	tff(func_def_34, type, match_tree1: (ty * tree1 * uni * uni) > uni).
27.62/27.78	tff(func_def_35, type, node_proj_11: tree1 > tree1).
27.62/27.78	tff(func_def_36, type, node_proj_21: tree1 > tree1).
27.62/27.78	tff(func_def_37, type, size1: tree1 > $int).
27.62/27.78	tff(func_def_38, type, t2tb1: list_tree > uni).
27.62/27.78	tff(func_def_39, type, tb2t1: uni > list_tree).
27.62/27.78	tff(func_def_40, type, t2tb2: tree1 > uni).
27.62/27.78	tff(func_def_41, type, tb2t2: uni > tree1).
27.62/27.78	tff(func_def_42, type, t2tb3: map_int_lplist_treerp > uni).
27.62/27.78	tff(func_def_43, type, tb2t3: uni > map_int_lplist_treerp).
27.62/27.78	tff(func_def_50, type, sK0: $int).
27.62/27.78	tff(func_def_51, type, sK1: map_int_lplist_treerp).
27.62/27.78	tff(func_def_52, type, sK2: map_int_lplist_treerp).
27.62/27.78	tff(func_def_53, type, sK3: $int).
27.62/27.78	tff(func_def_54, type, sK4: map_int_lplist_treerp).
27.62/27.78	tff(func_def_55, type, sK5: map_int_lplist_treerp).
27.62/27.78	tff(func_def_56, type, sK6: $int).
27.62/27.78	tff(func_def_57, type, sK7: list_tree).
27.62/27.78	tff(func_def_58, type, sK8: map_int_lplist_treerp).
27.62/27.78	tff(func_def_59, type, sK9: tree1).
27.62/27.78	tff(func_def_60, type, sK10: tree1 > tree1).
27.62/27.78	tff(func_def_61, type, sK11: tree1 > tree1).
27.62/27.78	tff(func_def_62, type, sK12: tree1 > tree1).
27.62/27.78	tff(func_def_63, type, sK13: tree1 > tree1).
27.62/27.78	tff(func_def_64, type, sK14: tree1 > tree1).
27.62/27.78	tff(func_def_65, type, sK15: tree1 > tree1).
27.62/27.78	tff(func_def_66, type, sK16: (ty * uni) > uni).
27.62/27.78	tff(func_def_67, type, sK17: (ty * uni) > uni).
27.62/27.78	tff(func_def_68, type, sK18: (ty * uni) > uni).
27.62/27.78	tff(func_def_69, type, sK19: (ty * uni * uni) > uni).
27.62/27.78	tff(func_def_70, type, sK20: (ty * uni * uni) > uni).
27.62/27.78	tff(func_def_71, type, sK21: (ty * uni * uni) > uni).
27.62/27.78	tff(pred_def_1, type, sort1: (ty * uni) > $o).
27.62/27.78	tff(pred_def_2, type, mem: (ty * uni * uni) > $o).
27.62/27.78	tff(pred_def_3, type, distinct: (ty * uni) > $o).
27.62/27.78	tff(pred_def_4, type, all_trees1: ($int * list_tree) > $o).
27.62/27.78	tff(f3,axiom,(
27.62/27.78	  ! [X6 : $int,X7 : list_tree] : (all_trees1(X6,X7) <=> (distinct(tree,t2tb1(X7)) & ! [X8 : tree1] : (mem(tree,t2tb2(X8),t2tb1(X7)) <=> size1(X8) = X6)))),
27.62/27.78	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',all_trees_def)).
27.62/27.78	tff(f8,axiom,(
27.62/27.78	  ! [X12 : tree1,X13 : tree1] : (size1(X12) != size1(X13) => ! [X14 : tree1,X15 : tree1] : node1(X12,X14) != node1(X13,X15))),
27.62/27.78	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',tree_diff)).
27.62/27.78	tff(f12,axiom,(
27.62/27.78	  size1(empty1) = 0 & ! [X3 : tree1,X4 : tree1] : size1(node1(X3,X4)) = $sum($sum(1,size1(X3)),size1(X4))),
27.62/27.78	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',size_def)).
27.62/27.78	tff(f16,axiom,(
27.62/27.78	  ! [X9 : tree1] : tb2t2(t2tb2(X9)) = X9),
27.62/27.78	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',bridgeL2)).
27.62/27.78	tff(f25,axiom,(
27.62/27.78	  ! [X1 : tree1,X2 : tree1] : node_proj_11(node1(X1,X2)) = X1),
27.62/27.78	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',node_proj_1_def1)).
27.62/27.78	tff(f28,axiom,(
27.62/27.78	  ! [X0 : ty] : sort1(list(X0),nil(X0))),
27.62/27.78	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',nil_sort2)).
27.62/27.78	tff(f29,conjecture,(
27.62/27.78	  ! [X6 : $int] : ($lesseq(0,X6) => ($lesseq(0,$sum(X6,1)) => ($lesseq(0,$sum(X6,1)) => (($less(0,$sum(X6,1)) & $lesseq(0,0)) => ! [X0 : map_int_lplist_treerp] : (($lesseq(0,$sum(X6,1)) & tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = X0) => ($lesseq(1,X6) => ! [X17 : map_int_lplist_treerp,X9 : $int] : (($lesseq(X9,X6) & $lesseq(1,X9)) => (! [X24 : $int] : (($lesseq(0,X24) & $less(X24,X9)) => all_trees1(X24,tb2t1(get(list(tree),int,t2tb3(X17),t2tb(X24))))) => (($lesseq(0,X9) & $less(X9,$sum(X6,1)) & $lesseq(0,$sum(X6,1))) => ! [X20 : map_int_lplist_treerp] : ((tb2t3(set(list(tree),int,t2tb3(X17),t2tb(X9),nil(tree))) = X20 & $lesseq(0,$sum(X6,1))) => ($lesseq(0,$difference(X9,1)) => ! [X21 : map_int_lplist_treerp,X22 : $int] : (($lesseq(X22,$difference(X9,1)) & $lesseq(0,X22)) => ((! [X24 : $int] : (($less(X24,X9) & $lesseq(0,X24)) => all_trees1(X24,tb2t1(get(list(tree),int,t2tb3(X21),t2tb(X24))))) & distinct(tree,get(list(tree),int,t2tb3(X21),t2tb(X9))) & ! [X8 : tree1] : (mem(tree,t2tb2(X8),get(list(tree),int,t2tb3(X21),t2tb(X9))) <=> ? [X7 : tree1,X23 : tree1] : (node1(X7,X23) = X8 & $less(size1(X7),X22) & size1(X8) = X9))) => (($lesseq(0,$sum(X6,1)) & $less(X9,$sum(X6,1)) & $lesseq(0,X9)) => (($lesseq(0,$difference($difference(X9,1),X22)) & $less($difference($difference(X9,1),X22),$sum(X6,1))) => (($less(X22,$sum(X6,1)) & $lesseq(0,X22)) => (($lesseq(0,X22) & $lesseq(0,$difference($difference(X9,1),X22)) & all_trees1($difference($difference(X9,1),X22),tb2t1(get(list(tree),int,t2tb3(X21),t2tb($difference($difference(X9,1),X22))))) & all_trees1(X22,tb2t1(get(list(tree),int,t2tb3(X21),t2tb(X22))))) => ! [X25 : list_tree] : ((distinct(tree,t2tb1(X25)) & ! [X8 : tree1] : (mem(tree,t2tb2(X8),t2tb1(X25)) <=> ? [X7 : tree1,X23 : tree1] : (size1(X23) = $difference($difference(X9,1),X22) & size1(X7) = X22 & node1(X7,X23) = X8))) => (($less(X9,$sum(X6,1)) & $lesseq(0,X9)) => ! [X26 : map_int_lplist_treerp] : (($lesseq(0,$sum(X6,1)) & tb2t3(set(list(tree),int,t2tb3(X21),t2tb(X9),infix_plpl(tree,t2tb1(X25),get(list(tree),int,t2tb3(X21),t2tb(X9))))) = X26) => ! [X8 : tree1] : (mem(tree,t2tb2(X8),get(list(tree),int,t2tb3(X26),t2tb(X9))) => ? [X7 : tree1,X23 : tree1] : (node1(X7,X23) = X8 & size1(X8) = X9 & $less(size1(X7),$sum(X22,1))))))))))))))))))))))))),
27.62/27.78	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_all_trees)).
27.62/27.78	tff(f30,negated_conjecture,(
27.62/27.78	  ~! [X6 : $int] : ($lesseq(0,X6) => ($lesseq(0,$sum(X6,1)) => ($lesseq(0,$sum(X6,1)) => (($less(0,$sum(X6,1)) & $lesseq(0,0)) => ! [X0 : map_int_lplist_treerp] : (($lesseq(0,$sum(X6,1)) & tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = X0) => ($lesseq(1,X6) => ! [X17 : map_int_lplist_treerp,X9 : $int] : (($lesseq(X9,X6) & $lesseq(1,X9)) => (! [X24 : $int] : (($lesseq(0,X24) & $less(X24,X9)) => all_trees1(X24,tb2t1(get(list(tree),int,t2tb3(X17),t2tb(X24))))) => (($lesseq(0,X9) & $less(X9,$sum(X6,1)) & $lesseq(0,$sum(X6,1))) => ! [X20 : map_int_lplist_treerp] : ((tb2t3(set(list(tree),int,t2tb3(X17),t2tb(X9),nil(tree))) = X20 & $lesseq(0,$sum(X6,1))) => ($lesseq(0,$difference(X9,1)) => ! [X21 : map_int_lplist_treerp,X22 : $int] : (($lesseq(X22,$difference(X9,1)) & $lesseq(0,X22)) => ((! [X24 : $int] : (($less(X24,X9) & $lesseq(0,X24)) => all_trees1(X24,tb2t1(get(list(tree),int,t2tb3(X21),t2tb(X24))))) & distinct(tree,get(list(tree),int,t2tb3(X21),t2tb(X9))) & ! [X8 : tree1] : (mem(tree,t2tb2(X8),get(list(tree),int,t2tb3(X21),t2tb(X9))) <=> ? [X7 : tree1,X23 : tree1] : (node1(X7,X23) = X8 & $less(size1(X7),X22) & size1(X8) = X9))) => (($lesseq(0,$sum(X6,1)) & $less(X9,$sum(X6,1)) & $lesseq(0,X9)) => (($lesseq(0,$difference($difference(X9,1),X22)) & $less($difference($difference(X9,1),X22),$sum(X6,1))) => (($less(X22,$sum(X6,1)) & $lesseq(0,X22)) => (($lesseq(0,X22) & $lesseq(0,$difference($difference(X9,1),X22)) & all_trees1($difference($difference(X9,1),X22),tb2t1(get(list(tree),int,t2tb3(X21),t2tb($difference($difference(X9,1),X22))))) & all_trees1(X22,tb2t1(get(list(tree),int,t2tb3(X21),t2tb(X22))))) => ! [X25 : list_tree] : ((distinct(tree,t2tb1(X25)) & ! [X8 : tree1] : (mem(tree,t2tb2(X8),t2tb1(X25)) <=> ? [X7 : tree1,X23 : tree1] : (size1(X23) = $difference($difference(X9,1),X22) & size1(X7) = X22 & node1(X7,X23) = X8))) => (($less(X9,$sum(X6,1)) & $lesseq(0,X9)) => ! [X26 : map_int_lplist_treerp] : (($lesseq(0,$sum(X6,1)) & tb2t3(set(list(tree),int,t2tb3(X21),t2tb(X9),infix_plpl(tree,t2tb1(X25),get(list(tree),int,t2tb3(X21),t2tb(X9))))) = X26) => ! [X8 : tree1] : (mem(tree,t2tb2(X8),get(list(tree),int,t2tb3(X26),t2tb(X9))) => ? [X7 : tree1,X23 : tree1] : (node1(X7,X23) = X8 & size1(X8) = X9 & $less(size1(X7),$sum(X22,1))))))))))))))))))))))))),
27.62/27.78	  inference(negated_conjecture,[],[f29])).
27.62/27.78	tff(f35,axiom,(
27.62/27.78	  ! [X22 : uni] : t2tb2(tb2t2(X22)) = X22),
27.62/27.78	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',bridgeR2)).
27.62/27.78	tff(f39,axiom,(
27.62/27.78	  ! [X0 : ty,X16 : ty,X28 : uni,X17 : uni] : (sort1(X16,X28) => get(X16,X0,const(X16,X0,X28),X17) = X28)),
27.62/27.78	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',const)).
27.62/27.78	tff(f47,axiom,(
27.62/27.78	  ! [X0 : ty,X3 : uni,X12 : uni,X13 : uni] : ((mem(X0,X3,X12) | mem(X0,X3,X13)) <=> mem(X0,X3,infix_plpl(X0,X12,X13)))),
27.62/27.78	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',mem_append)).
27.62/27.78	tff(f51,axiom,(
27.62/27.78	  ! [X3 : $int] : sort1(int,t2tb(X3))),
27.62/27.78	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2tb_sort3)).
27.62/27.78	tff(f53,axiom,(
27.62/27.78	  ! [X1 : tree1,X2 : tree1] : node_proj_21(node1(X1,X2)) = X2),
27.62/27.78	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',node_proj_2_def1)).
27.62/27.78	tff(f54,axiom,(
27.62/27.78	  ! [X0 : ty,X16 : ty,X30 : uni,X17 : uni,X20 : uni,X28 : uni] : (sort1(X16,X28) => (X17 = X20 => get(X16,X0,set(X16,X0,X30,X17,X28),X20) = X28))),
27.62/27.78	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',select_eq)).
27.62/27.78	tff(f55,axiom,(
27.62/27.78	  ! [X22 : uni] : t2tb3(tb2t3(X22)) = X22),
27.62/27.78	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',bridgeR3)).
27.62/27.78	tff(f58,axiom,(
27.62/27.78	  ! [X8 : tree1] : ($less(0,size1(X8)) => ? [X7 : tree1,X23 : tree1] : ($less(size1(X7),size1(X8)) & node1(X7,X23) = X8))),
27.62/27.78	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',size_left)).
27.62/27.78	tff(f60,axiom,(
27.62/27.78	  ! [X10 : tree1,X11 : tree1] : empty1 != node1(X10,X11)),
27.62/27.78	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_Node1)).
27.62/27.78	tff(f63,axiom,(
27.62/27.78	  ! [X0 : ty,X12 : uni,X13 : uni] : (distinct(X0,X12) => (distinct(X0,X13) => (! [X3 : uni] : (sort1(X0,X3) => (mem(X0,X3,X12) => ~mem(X0,X3,X13))) => distinct(X0,infix_plpl(X0,X12,X13)))))),
27.62/27.78	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',distinct_append)).
27.62/27.78	tff(f66,axiom,(
27.62/27.78	  ! [X0 : ty,X3 : uni,X4 : uni] : sort1(list(X0),infix_plpl(X0,X3,X4))),
27.62/27.78	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',infix_plpl_sort2)).
27.62/27.78	tff(f67,axiom,(
27.62/27.78	  ! [X0 : ty,X16 : ty,X30 : uni,X17 : uni,X20 : uni] : (sort1(X0,X17) => (sort1(X0,X20) => ! [X28 : uni] : (X17 != X20 => get(X16,X0,X30,X20) = get(X16,X0,set(X16,X0,X30,X17,X28),X20))))),
27.62/27.78	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',select_neq)).
27.62/27.78	tff(f72,axiom,(
27.62/27.78	  ! [X0 : ty,X3 : uni,X4 : uni] : sort1(list(X0),cons(X0,X3,X4))),
27.62/27.78	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',cons_sort2)).
27.62/27.78	tff(f75,axiom,(
27.62/27.78	  ! [X1 : tree1] : (node1(node_proj_11(X1),node_proj_21(X1)) = X1 | empty1 = X1)),
27.62/27.78	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',tree_inversion1)).
27.62/27.78	tff(f78,axiom,(
27.62/27.78	  ! [X8 : tree1] : $lesseq(0,size1(X8))),
27.62/27.78	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',size_nonneg)).
27.62/27.78	tff(f80,plain,(
27.62/27.78	  ~! [X6 : $int] : (~$less(X6,0) => (~$less($sum(X6,1),0) => (~$less($sum(X6,1),0) => (($less(0,$sum(X6,1)) & ~$less(0,0)) => ! [X0 : map_int_lplist_treerp] : ((~$less($sum(X6,1),0) & tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = X0) => (~$less(X6,1) => ! [X17 : map_int_lplist_treerp,X9 : $int] : ((~$less(X6,X9) & ~$less(X9,1)) => (! [X24 : $int] : ((~$less(X24,0) & $less(X24,X9)) => all_trees1(X24,tb2t1(get(list(tree),int,t2tb3(X17),t2tb(X24))))) => ((~$less(X9,0) & $less(X9,$sum(X6,1)) & ~$less($sum(X6,1),0)) => ! [X20 : map_int_lplist_treerp] : ((tb2t3(set(list(tree),int,t2tb3(X17),t2tb(X9),nil(tree))) = X20 & ~$less($sum(X6,1),0)) => (~$less($sum(X9,$uminus(1)),0) => ! [X21 : map_int_lplist_treerp,X22 : $int] : ((~$less($sum(X9,$uminus(1)),X22) & ~$less(X22,0)) => ((! [X24 : $int] : (($less(X24,X9) & ~$less(X24,0)) => all_trees1(X24,tb2t1(get(list(tree),int,t2tb3(X21),t2tb(X24))))) & distinct(tree,get(list(tree),int,t2tb3(X21),t2tb(X9))) & ! [X8 : tree1] : (mem(tree,t2tb2(X8),get(list(tree),int,t2tb3(X21),t2tb(X9))) <=> ? [X7 : tree1,X23 : tree1] : (node1(X7,X23) = X8 & $less(size1(X7),X22) & size1(X8) = X9))) => ((~$less($sum(X6,1),0) & $less(X9,$sum(X6,1)) & ~$less(X9,0)) => ((~$less($sum($difference(X9,1),$uminus(X22)),0) & $less($sum($difference(X9,1),$uminus(X22)),$sum(X6,1))) => (($less(X22,$sum(X6,1)) & ~$less(X22,0)) => ((~$less(X22,0) & ~$less($sum($difference(X9,1),$uminus(X22)),0) & all_trees1($sum($difference(X9,1),$uminus(X22)),tb2t1(get(list(tree),int,t2tb3(X21),t2tb($sum($difference(X9,1),$uminus(X22)))))) & all_trees1(X22,tb2t1(get(list(tree),int,t2tb3(X21),t2tb(X22))))) => ! [X25 : list_tree] : ((distinct(tree,t2tb1(X25)) & ! [X8 : tree1] : (mem(tree,t2tb2(X8),t2tb1(X25)) <=> ? [X7 : tree1,X23 : tree1] : (size1(X23) = $sum($difference(X9,1),$uminus(X22)) & size1(X7) = X22 & node1(X7,X23) = X8))) => (($less(X9,$sum(X6,1)) & ~$less(X9,0)) => ! [X26 : map_int_lplist_treerp] : ((~$less($sum(X6,1),0) & tb2t3(set(list(tree),int,t2tb3(X21),t2tb(X9),infix_plpl(tree,t2tb1(X25),get(list(tree),int,t2tb3(X21),t2tb(X9))))) = X26) => ! [X8 : tree1] : (mem(tree,t2tb2(X8),get(list(tree),int,t2tb3(X26),t2tb(X9))) => ? [X7 : tree1,X23 : tree1] : (node1(X7,X23) = X8 & size1(X8) = X9 & $less(size1(X7),$sum(X22,1))))))))))))))))))))))))),
27.62/27.78	  inference(evaluation,[],[f30])).
27.62/27.78	tff(f81,plain,(
27.62/27.78	  ! [X8 : tree1] : ~$less(size1(X8),0)),
27.62/27.78	  inference(evaluation,[],[f78])).
27.62/27.78	tff(f84,plain,(
27.62/27.78	  ~! [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) & tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = X1) => (~$less(X0,1) => ! [X2 : map_int_lplist_treerp,X3 : $int] : ((~$less(X0,X3) & ~$less(X3,1)) => (! [X4 : $int] : ((~$less(X4,0) & $less(X4,X3)) => all_trees1(X4,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X4))))) => ((~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0)) => ! [X5 : map_int_lplist_treerp] : ((tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X5 & ~$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)) => ((! [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] : (mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X6),t2tb(X3))) <=> ? [X10 : tree1,X11 : tree1] : (node1(X10,X11) = X9 & $less(size1(X10),X7) & size1(X9) = X3))) => ((~$less($sum(X0,1),0) & $less(X3,$sum(X0,1)) & ~$less(X3,0)) => ((~$less($sum($difference(X3,1),$uminus(X7)),0) & $less($sum($difference(X3,1),$uminus(X7)),$sum(X0,1))) => (($less(X7,$sum(X0,1)) & ~$less(X7,0)) => ((~$less(X7,0) & ~$less($sum($difference(X3,1),$uminus(X7)),0) & all_trees1($sum($difference(X3,1),$uminus(X7)),tb2t1(get(list(tree),int,t2tb3(X6),t2tb($sum($difference(X3,1),$uminus(X7)))))) & all_trees1(X7,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X7))))) => ! [X12 : list_tree] : ((distinct(tree,t2tb1(X12)) & ! [X13 : tree1] : (mem(tree,t2tb2(X13),t2tb1(X12)) <=> ? [X14 : tree1,X15 : tree1] : (size1(X15) = $sum($difference(X3,1),$uminus(X7)) & size1(X14) = X7 & node1(X14,X15) = X13))) => (($less(X3,$sum(X0,1)) & ~$less(X3,0)) => ! [X16 : map_int_lplist_treerp] : ((~$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) => ! [X17 : tree1] : (mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X16),t2tb(X3))) => ? [X18 : tree1,X19 : tree1] : (node1(X18,X19) = X17 & size1(X17) = X3 & $less(size1(X18),$sum(X7,1))))))))))))))))))))))))),
27.62/27.78	  inference(rectify,[],[f80])).
27.62/27.78	tff(f85,plain,(
27.62/27.78	  size1(empty1) = 0 & ! [X0 : tree1,X1 : tree1] : size1(node1(X0,X1)) = $sum($sum(1,size1(X0)),size1(X1))),
27.62/27.78	  inference(rectify,[],[f12])).
27.62/27.78	tff(f87,plain,(
27.62/27.78	  ! [X0 : tree1] : ~$less(size1(X0),0)),
27.62/27.78	  inference(rectify,[],[f81])).
27.62/27.78	tff(f88,plain,(
27.62/27.78	  ! [X0 : $int] : sort1(int,t2tb(X0))),
27.62/27.78	  inference(rectify,[],[f51])).
27.62/27.78	tff(f94,plain,(
27.62/27.78	  ! [X0 : uni] : t2tb3(tb2t3(X0)) = X0),
27.62/27.78	  inference(rectify,[],[f55])).
27.62/27.78	tff(f95,plain,(
27.62/27.78	  ! [X0 : uni] : t2tb2(tb2t2(X0)) = X0),
27.62/27.78	  inference(rectify,[],[f35])).
27.62/27.78	tff(f96,plain,(
27.62/27.78	  ! [X0 : tree1] : tb2t2(t2tb2(X0)) = X0),
27.62/27.78	  inference(rectify,[],[f16])).
27.62/27.78	tff(f102,plain,(
27.62/27.78	  ! [X0 : tree1] : (node1(node_proj_11(X0),node_proj_21(X0)) = X0 | empty1 = X0)),
27.62/27.78	  inference(rectify,[],[f75])).
27.62/27.78	tff(f103,plain,(
27.62/27.78	  ! [X0 : tree1] : ($less(0,size1(X0)) => ? [X1 : tree1,X2 : tree1] : ($less(size1(X1),size1(X0)) & node1(X1,X2) = X0))),
27.62/27.78	  inference(rectify,[],[f58])).
27.62/27.78	tff(f104,plain,(
27.62/27.78	  ! [X0 : tree1,X1 : tree1] : empty1 != node1(X0,X1)),
27.62/27.78	  inference(rectify,[],[f60])).
27.62/27.78	tff(f107,plain,(
27.62/27.78	  ! [X0 : tree1,X1 : tree1] : node_proj_21(node1(X0,X1)) = X1),
27.62/27.78	  inference(rectify,[],[f53])).
27.62/27.78	tff(f108,plain,(
27.62/27.78	  ! [X0 : tree1,X1 : tree1] : node_proj_11(node1(X0,X1)) = X0),
27.62/27.78	  inference(rectify,[],[f25])).
27.62/27.78	tff(f116,plain,(
27.62/27.78	  ! [X0 : tree1,X1 : tree1] : (size1(X0) != size1(X1) => ! [X2 : tree1,X3 : tree1] : node1(X0,X2) != node1(X1,X3))),
27.62/27.78	  inference(rectify,[],[f8])).
27.62/27.78	tff(f117,plain,(
27.62/27.78	  ! [X0 : $int,X1 : list_tree] : (all_trees1(X0,X1) <=> (distinct(tree,t2tb1(X1)) & ! [X2 : tree1] : (mem(tree,t2tb2(X2),t2tb1(X1)) <=> size1(X2) = X0)))),
27.62/27.78	  inference(rectify,[],[f3])).
27.62/27.78	tff(f122,plain,(
27.62/27.78	  ! [X0 : ty,X1 : uni,X2 : uni] : sort1(list(X0),infix_plpl(X0,X1,X2))),
27.62/27.78	  inference(rectify,[],[f66])).
27.62/27.78	tff(f124,plain,(
27.62/27.78	  ! [X0 : ty,X1 : uni,X2 : uni] : sort1(list(X0),cons(X0,X1,X2))),
27.62/27.78	  inference(rectify,[],[f72])).
27.62/27.78	tff(f129,plain,(
27.62/27.78	  ! [X0 : ty,X1 : uni,X2 : uni] : (distinct(X0,X1) => (distinct(X0,X2) => (! [X3 : uni] : (sort1(X0,X3) => (mem(X0,X3,X1) => ~mem(X0,X3,X2))) => distinct(X0,infix_plpl(X0,X1,X2)))))),
27.62/27.78	  inference(rectify,[],[f63])).
27.62/27.78	tff(f143,plain,(
27.62/27.78	  ! [X0 : ty,X1 : ty,X2 : uni,X3 : uni] : (sort1(X1,X2) => get(X1,X0,const(X1,X0,X2),X3) = X2)),
27.62/27.78	  inference(rectify,[],[f39])).
27.62/27.78	tff(f144,plain,(
27.62/27.78	  ! [X0 : ty,X1 : uni,X2 : uni,X3 : uni] : ((mem(X0,X1,X2) | mem(X0,X1,X3)) <=> mem(X0,X1,infix_plpl(X0,X2,X3)))),
27.62/27.78	  inference(rectify,[],[f47])).
27.62/27.78	tff(f148,plain,(
27.62/27.78	  ! [X0 : ty,X1 : ty,X2 : uni,X3 : uni,X4 : uni] : (sort1(X0,X3) => (sort1(X0,X4) => ! [X5 : uni] : (X3 != X4 => get(X1,X0,X2,X4) = get(X1,X0,set(X1,X0,X2,X3,X5),X4))))),
27.62/27.78	  inference(rectify,[],[f67])).
27.62/27.78	tff(f150,plain,(
27.62/27.78	  ! [X0 : ty,X1 : ty,X2 : uni,X3 : uni,X4 : uni,X5 : uni] : (sort1(X1,X5) => (X3 = X4 => get(X1,X0,set(X1,X0,X2,X3,X5),X4) = X5))),
27.62/27.78	  inference(rectify,[],[f54])).
27.62/27.78	tff(f151,plain,(
27.62/27.78	  ! [X0 : $int,X1 : list_tree] : (all_trees1(X0,X1) => (distinct(tree,t2tb1(X1)) & ! [X2 : tree1] : (mem(tree,t2tb2(X2),t2tb1(X1)) <=> size1(X2) = X0)))),
27.62/27.78	  inference(unused_predicate_definition_removal,[],[f117])).
27.62/27.78	tff(f152,plain,(
27.62/27.78	  ? [X0 : $int] : ((((? [X1 : map_int_lplist_treerp] : ((? [X2 : map_int_lplist_treerp,X3 : $int] : (((? [X5 : map_int_lplist_treerp] : ((? [X6 : map_int_lplist_treerp,X7 : $int] : ((((((? [X12 : list_tree] : ((? [X16 : map_int_lplist_treerp] : (? [X17 : tree1] : (! [X18 : tree1,X19 : tree1] : (node1(X18,X19) != X17 | size1(X17) != X3 | ~$less(size1(X18),$sum(X7,1))) & 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)) & ($less(X3,$sum(X0,1)) & ~$less(X3,0))) & (distinct(tree,t2tb1(X12)) & ! [X13 : tree1] : (mem(tree,t2tb2(X13),t2tb1(X12)) <=> ? [X14 : tree1,X15 : tree1] : (size1(X15) = $sum($difference(X3,1),$uminus(X7)) & size1(X14) = X7 & node1(X14,X15) = X13)))) & (~$less(X7,0) & ~$less($sum($difference(X3,1),$uminus(X7)),0) & all_trees1($sum($difference(X3,1),$uminus(X7)),tb2t1(get(list(tree),int,t2tb3(X6),t2tb($sum($difference(X3,1),$uminus(X7)))))) & all_trees1(X7,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X7)))))) & ($less(X7,$sum(X0,1)) & ~$less(X7,0))) & (~$less($sum($difference(X3,1),$uminus(X7)),0) & $less($sum($difference(X3,1),$uminus(X7)),$sum(X0,1)))) & (~$less($sum(X0,1),0) & $less(X3,$sum(X0,1)) & ~$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] : (mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X6),t2tb(X3))) <=> ? [X10 : tree1,X11 : tree1] : (node1(X10,X11) = X9 & $less(size1(X10),X7) & size1(X9) = X3)))) & (~$less($sum(X3,$uminus(1)),X7) & ~$less(X7,0))) & ~$less($sum(X3,$uminus(1)),0)) & (tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X5 & ~$less($sum(X0,1),0))) & (~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0))) & ! [X4 : $int] : (all_trees1(X4,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X4)))) | ($less(X4,0) | ~$less(X4,X3)))) & (~$less(X0,X3) & ~$less(X3,1))) & ~$less(X0,1)) & (~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = X1)) & ($less(0,$sum(X0,1)) & ~$less(0,0))) & ~$less($sum(X0,1),0)) & ~$less($sum(X0,1),0)) & ~$less(X0,0))),
27.62/27.78	  inference(ennf_transformation,[],[f84])).
27.62/27.78	tff(f153,plain,(
27.62/27.78	  ? [X0 : $int] : (? [X1 : map_int_lplist_treerp] : (? [X2 : map_int_lplist_treerp,X3 : $int] : (? [X5 : map_int_lplist_treerp] : (? [X6 : map_int_lplist_treerp,X7 : $int] : (? [X12 : list_tree] : (? [X16 : map_int_lplist_treerp] : (? [X17 : tree1] : (! [X18 : tree1,X19 : tree1] : (node1(X18,X19) != X17 | size1(X17) != X3 | ~$less(size1(X18),$sum(X7,1))) & 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) & $less(X3,$sum(X0,1)) & ~$less(X3,0) & distinct(tree,t2tb1(X12)) & ! [X13 : tree1] : (mem(tree,t2tb2(X13),t2tb1(X12)) <=> ? [X14 : tree1,X15 : tree1] : (size1(X15) = $sum($difference(X3,1),$uminus(X7)) & size1(X14) = X7 & node1(X14,X15) = X13))) & ~$less(X7,0) & ~$less($sum($difference(X3,1),$uminus(X7)),0) & all_trees1($sum($difference(X3,1),$uminus(X7)),tb2t1(get(list(tree),int,t2tb3(X6),t2tb($sum($difference(X3,1),$uminus(X7)))))) & all_trees1(X7,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X7)))) & $less(X7,$sum(X0,1)) & ~$less(X7,0) & ~$less($sum($difference(X3,1),$uminus(X7)),0) & $less($sum($difference(X3,1),$uminus(X7)),$sum(X0,1)) & ~$less($sum(X0,1),0) & $less(X3,$sum(X0,1)) & ~$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] : (mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X6),t2tb(X3))) <=> ? [X10 : tree1,X11 : tree1] : (node1(X10,X11) = X9 & $less(size1(X10),X7) & size1(X9) = X3)) & ~$less($sum(X3,$uminus(1)),X7) & ~$less(X7,0)) & ~$less($sum(X3,$uminus(1)),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X5 & ~$less($sum(X0,1),0)) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X4 : $int] : (all_trees1(X4,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X4)))) | $less(X4,0) | ~$less(X4,X3)) & ~$less(X0,X3) & ~$less(X3,1)) & ~$less(X0,1) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = X1) & $less(0,$sum(X0,1)) & ~$less(0,0) & ~$less($sum(X0,1),0) & ~$less($sum(X0,1),0) & ~$less(X0,0))),
27.62/27.78	  inference(flattening,[],[f152])).
27.62/27.78	tff(f154,plain,(
27.62/27.78	  ! [X0 : tree1] : (? [X1 : tree1,X2 : tree1] : ($less(size1(X1),size1(X0)) & node1(X1,X2) = X0) | ~$less(0,size1(X0)))),
27.62/27.78	  inference(ennf_transformation,[],[f103])).
27.62/27.78	tff(f158,plain,(
27.62/27.78	  ! [X0 : tree1,X1 : tree1] : (! [X2 : tree1,X3 : tree1] : node1(X0,X2) != node1(X1,X3) | size1(X0) = size1(X1))),
27.62/27.78	  inference(ennf_transformation,[],[f116])).
27.62/27.78	tff(f159,plain,(
27.62/27.78	  ! [X0 : $int,X1 : list_tree] : ((distinct(tree,t2tb1(X1)) & ! [X2 : tree1] : (mem(tree,t2tb2(X2),t2tb1(X1)) <=> size1(X2) = X0)) | ~all_trees1(X0,X1))),
27.62/27.78	  inference(ennf_transformation,[],[f151])).
27.62/27.78	tff(f160,plain,(
27.62/27.78	  ! [X0 : ty,X1 : uni,X2 : uni] : (((distinct(X0,infix_plpl(X0,X1,X2)) | ? [X3 : uni] : ((mem(X0,X3,X2) & mem(X0,X3,X1)) & sort1(X0,X3))) | ~distinct(X0,X2)) | ~distinct(X0,X1))),
27.62/27.78	  inference(ennf_transformation,[],[f129])).
27.62/27.78	tff(f161,plain,(
27.62/27.78	  ! [X0 : ty,X1 : uni,X2 : uni] : (distinct(X0,infix_plpl(X0,X1,X2)) | ? [X3 : uni] : (mem(X0,X3,X2) & mem(X0,X3,X1) & sort1(X0,X3)) | ~distinct(X0,X2) | ~distinct(X0,X1))),
27.62/27.78	  inference(flattening,[],[f160])).
27.62/27.78	tff(f173,plain,(
27.62/27.78	  ! [X0 : ty,X1 : ty,X2 : uni,X3 : uni] : (get(X1,X0,const(X1,X0,X2),X3) = X2 | ~sort1(X1,X2))),
27.62/27.78	  inference(ennf_transformation,[],[f143])).
27.62/27.78	tff(f175,plain,(
27.62/27.78	  ! [X0 : ty,X1 : ty,X2 : uni,X3 : uni,X4 : uni] : ((! [X5 : uni] : (get(X1,X0,X2,X4) = get(X1,X0,set(X1,X0,X2,X3,X5),X4) | X3 = X4) | ~sort1(X0,X4)) | ~sort1(X0,X3))),
27.62/27.78	  inference(ennf_transformation,[],[f148])).
27.62/27.78	tff(f176,plain,(
27.62/27.78	  ! [X0 : ty,X1 : ty,X2 : uni,X3 : uni,X4 : uni] : (! [X5 : uni] : (get(X1,X0,X2,X4) = get(X1,X0,set(X1,X0,X2,X3,X5),X4) | X3 = X4) | ~sort1(X0,X4) | ~sort1(X0,X3))),
27.62/27.78	  inference(flattening,[],[f175])).
27.62/27.78	tff(f178,plain,(
27.62/27.78	  ! [X0 : ty,X1 : ty,X2 : uni,X3 : uni,X4 : uni,X5 : uni] : ((get(X1,X0,set(X1,X0,X2,X3,X5),X4) = X5 | X3 != X4) | ~sort1(X1,X5))),
27.62/27.78	  inference(ennf_transformation,[],[f150])).
27.62/27.78	tff(f179,plain,(
27.62/27.78	  ! [X0 : ty,X1 : ty,X2 : uni,X3 : uni,X4 : uni,X5 : uni] : (get(X1,X0,set(X1,X0,X2,X3,X5),X4) = X5 | X3 != X4 | ~sort1(X1,X5))),
27.62/27.78	  inference(flattening,[],[f178])).
27.62/27.78	tff(f180,plain,(
27.62/27.78	  ? [X0 : $int] : (? [X1 : map_int_lplist_treerp] : (? [X2 : map_int_lplist_treerp,X3 : $int] : (? [X5 : map_int_lplist_treerp] : (? [X6 : map_int_lplist_treerp,X7 : $int] : (? [X12 : list_tree] : (? [X16 : map_int_lplist_treerp] : (? [X17 : tree1] : (! [X18 : tree1,X19 : tree1] : (node1(X18,X19) != X17 | size1(X17) != X3 | ~$less(size1(X18),$sum(X7,1))) & 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) & $less(X3,$sum(X0,1)) & ~$less(X3,0) & distinct(tree,t2tb1(X12)) & ! [X13 : tree1] : ((mem(tree,t2tb2(X13),t2tb1(X12)) | ! [X14 : tree1,X15 : tree1] : (size1(X15) != $sum($difference(X3,1),$uminus(X7)) | size1(X14) != X7 | node1(X14,X15) != X13)) & (? [X14 : tree1,X15 : tree1] : (size1(X15) = $sum($difference(X3,1),$uminus(X7)) & size1(X14) = X7 & node1(X14,X15) = X13) | ~mem(tree,t2tb2(X13),t2tb1(X12))))) & ~$less(X7,0) & ~$less($sum($difference(X3,1),$uminus(X7)),0) & all_trees1($sum($difference(X3,1),$uminus(X7)),tb2t1(get(list(tree),int,t2tb3(X6),t2tb($sum($difference(X3,1),$uminus(X7)))))) & all_trees1(X7,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X7)))) & $less(X7,$sum(X0,1)) & ~$less(X7,0) & ~$less($sum($difference(X3,1),$uminus(X7)),0) & $less($sum($difference(X3,1),$uminus(X7)),$sum(X0,1)) & ~$less($sum(X0,1),0) & $less(X3,$sum(X0,1)) & ~$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] : ((mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X6),t2tb(X3))) | ! [X10 : tree1,X11 : tree1] : (node1(X10,X11) != X9 | ~$less(size1(X10),X7) | size1(X9) != X3)) & (? [X10 : tree1,X11 : tree1] : (node1(X10,X11) = X9 & $less(size1(X10),X7) & size1(X9) = X3) | ~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) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X5 & ~$less($sum(X0,1),0)) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X4 : $int] : (all_trees1(X4,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X4)))) | $less(X4,0) | ~$less(X4,X3)) & ~$less(X0,X3) & ~$less(X3,1)) & ~$less(X0,1) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = X1) & $less(0,$sum(X0,1)) & ~$less(0,0) & ~$less($sum(X0,1),0) & ~$less($sum(X0,1),0) & ~$less(X0,0))),
27.62/27.78	  inference(nnf_transformation,[],[f153])).
27.62/27.78	tff(f181,plain,(
27.62/27.78	  ? [X0 : $int] : (? [X1 : map_int_lplist_treerp] : (? [X2 : map_int_lplist_treerp,X3 : $int] : (? [X4 : map_int_lplist_treerp] : (? [X5 : map_int_lplist_treerp,X6 : $int] : (? [X7 : list_tree] : (? [X8 : map_int_lplist_treerp] : (? [X9 : tree1] : (! [X10 : tree1,X11 : tree1] : (node1(X10,X11) != X9 | size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1))) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(X3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(X5),t2tb(X3))))) = X8) & $less(X3,$sum(X0,1)) & ~$less(X3,0) & distinct(tree,t2tb1(X7)) & ! [X12 : tree1] : ((mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X13 : tree1,X14 : tree1] : (size1(X14) != $sum($difference(X3,1),$uminus(X6)) | size1(X13) != X6 | node1(X13,X14) != X12)) & (? [X15 : tree1,X16 : tree1] : (size1(X16) = $sum($difference(X3,1),$uminus(X6)) & size1(X15) = X6 & node1(X15,X16) = X12) | ~mem(tree,t2tb2(X12),t2tb1(X7))))) & ~$less(X6,0) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & all_trees1($sum($difference(X3,1),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($difference(X3,1),$uminus(X6)))))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & $less(X6,$sum(X0,1)) & ~$less(X6,0) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & $less($sum($difference(X3,1),$uminus(X6)),$sum(X0,1)) & ~$less($sum(X0,1),0) & $less(X3,$sum(X0,1)) & ~$less(X3,0) & ! [X17 : $int] : (all_trees1(X17,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X17)))) | ~$less(X17,X3) | $less(X17,0)) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X18 : tree1] : ((mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X19 : tree1,X20 : tree1] : (node1(X19,X20) != X18 | ~$less(size1(X19),X6) | size1(X18) != X3)) & (? [X21 : tree1,X22 : tree1] : (node1(X21,X22) = X18 & $less(size1(X21),X6) & size1(X18) = X3) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))))) & ~$less($sum(X3,$uminus(1)),X6) & ~$less(X6,0)) & ~$less($sum(X3,$uminus(1)),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X4 & ~$less($sum(X0,1),0)) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X23 : $int] : (all_trees1(X23,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X23)))) | $less(X23,0) | ~$less(X23,X3)) & ~$less(X0,X3) & ~$less(X3,1)) & ~$less(X0,1) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = X1) & $less(0,$sum(X0,1)) & ~$less(0,0) & ~$less($sum(X0,1),0) & ~$less($sum(X0,1),0) & ~$less(X0,0))),
27.62/27.78	  inference(rectify,[],[f180])).
27.62/27.78	tff(f182,plain,(
27.62/27.78	  ? [X0 : $int] : (? [X1 : map_int_lplist_treerp] : (? [X2 : map_int_lplist_treerp,X3 : $int] : (? [X4 : map_int_lplist_treerp] : (? [X5 : map_int_lplist_treerp,X6 : $int] : (? [X7 : list_tree] : (? [X8 : map_int_lplist_treerp] : (? [X9 : tree1] : (! [X10 : tree1,X11 : tree1] : (node1(X10,X11) != X9 | size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1))) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(X3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(X5),t2tb(X3))))) = X8) & $less(X3,$sum(X0,1)) & ~$less(X3,0) & distinct(tree,t2tb1(X7)) & ! [X12 : tree1] : ((mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X13 : tree1,X14 : tree1] : (size1(X14) != $sum($difference(X3,1),$uminus(X6)) | size1(X13) != X6 | node1(X13,X14) != X12)) & (? [X15 : tree1,X16 : tree1] : (size1(X16) = $sum($difference(X3,1),$uminus(X6)) & size1(X15) = X6 & node1(X15,X16) = X12) | ~mem(tree,t2tb2(X12),t2tb1(X7))))) & ~$less(X6,0) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & all_trees1($sum($difference(X3,1),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($difference(X3,1),$uminus(X6)))))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & $less(X6,$sum(X0,1)) & ~$less(X6,0) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & $less($sum($difference(X3,1),$uminus(X6)),$sum(X0,1)) & ~$less($sum(X0,1),0) & $less(X3,$sum(X0,1)) & ~$less(X3,0) & ! [X17 : $int] : (all_trees1(X17,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X17)))) | ~$less(X17,X3) | $less(X17,0)) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X18 : tree1] : ((mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X19 : tree1,X20 : tree1] : (node1(X19,X20) != X18 | ~$less(size1(X19),X6) | size1(X18) != X3)) & (? [X21 : tree1,X22 : tree1] : (node1(X21,X22) = X18 & $less(size1(X21),X6) & size1(X18) = X3) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))))) & ~$less($sum(X3,$uminus(1)),X6) & ~$less(X6,0)) & ~$less($sum(X3,$uminus(1)),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X4 & ~$less($sum(X0,1),0)) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X23 : $int] : (all_trees1(X23,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X23)))) | $less(X23,0) | ~$less(X23,X3)) & ~$less(X0,X3) & ~$less(X3,1)) & ~$less(X0,1) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = X1) & $less(0,$sum(X0,1)) & ~$less(0,0) & ~$less($sum(X0,1),0) & ~$less($sum(X0,1),0) & ~$less(X0,0)) => (? [X1 : map_int_lplist_treerp] : (? [X3 : $int,X2 : map_int_lplist_treerp] : (? [X4 : map_int_lplist_treerp] : (? [X6 : $int,X5 : map_int_lplist_treerp] : (? [X7 : list_tree] : (? [X8 : map_int_lplist_treerp] : (? [X9 : tree1] : (! [X10 : tree1,X11 : tree1] : (node1(X10,X11) != X9 | size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1))) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) & ~$less($sum(sK0,1),0) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(X3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(X5),t2tb(X3))))) = X8) & $less(X3,$sum(sK0,1)) & ~$less(X3,0) & distinct(tree,t2tb1(X7)) & ! [X12 : tree1] : ((mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X13 : tree1,X14 : tree1] : (size1(X14) != $sum($difference(X3,1),$uminus(X6)) | size1(X13) != X6 | node1(X13,X14) != X12)) & (? [X15 : tree1,X16 : tree1] : (size1(X16) = $sum($difference(X3,1),$uminus(X6)) & size1(X15) = X6 & node1(X15,X16) = X12) | ~mem(tree,t2tb2(X12),t2tb1(X7))))) & ~$less(X6,0) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & all_trees1($sum($difference(X3,1),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($difference(X3,1),$uminus(X6)))))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & $less(X6,$sum(sK0,1)) & ~$less(X6,0) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & $less($sum($difference(X3,1),$uminus(X6)),$sum(sK0,1)) & ~$less($sum(sK0,1),0) & $less(X3,$sum(sK0,1)) & ~$less(X3,0) & ! [X17 : $int] : (all_trees1(X17,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X17)))) | ~$less(X17,X3) | $less(X17,0)) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X18 : tree1] : ((mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X19 : tree1,X20 : tree1] : (node1(X19,X20) != X18 | ~$less(size1(X19),X6) | size1(X18) != X3)) & (? [X21 : tree1,X22 : tree1] : (node1(X21,X22) = X18 & $less(size1(X21),X6) & size1(X18) = X3) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))))) & ~$less($sum(X3,$uminus(1)),X6) & ~$less(X6,0)) & ~$less($sum(X3,$uminus(1)),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X4 & ~$less($sum(sK0,1),0)) & ~$less(X3,0) & $less(X3,$sum(sK0,1)) & ~$less($sum(sK0,1),0) & ! [X23 : $int] : (all_trees1(X23,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X23)))) | $less(X23,0) | ~$less(X23,X3)) & ~$less(sK0,X3) & ~$less(X3,1)) & ~$less(sK0,1) & ~$less($sum(sK0,1),0) & tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = X1) & $less(0,$sum(sK0,1)) & ~$less(0,0) & ~$less($sum(sK0,1),0) & ~$less($sum(sK0,1),0) & ~$less(sK0,0))),
27.62/27.78	  introduced(choice_axiom,[])).
27.62/27.78	tff(f183,plain,(
27.62/27.78	  ( ! [X0:$int] : (? [X1 : map_int_lplist_treerp] : (? [X2 : map_int_lplist_treerp,X3 : $int] : (? [X4 : map_int_lplist_treerp] : (? [X5 : map_int_lplist_treerp,X6 : $int] : (? [X7 : list_tree] : (? [X8 : map_int_lplist_treerp] : (? [X9 : tree1] : (! [X10 : tree1,X11 : tree1] : (node1(X10,X11) != X9 | size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1))) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(X3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(X5),t2tb(X3))))) = X8) & $less(X3,$sum(X0,1)) & ~$less(X3,0) & distinct(tree,t2tb1(X7)) & ! [X12 : tree1] : ((mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X13 : tree1,X14 : tree1] : (size1(X14) != $sum($difference(X3,1),$uminus(X6)) | size1(X13) != X6 | node1(X13,X14) != X12)) & (? [X15 : tree1,X16 : tree1] : (size1(X16) = $sum($difference(X3,1),$uminus(X6)) & size1(X15) = X6 & node1(X15,X16) = X12) | ~mem(tree,t2tb2(X12),t2tb1(X7))))) & ~$less(X6,0) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & all_trees1($sum($difference(X3,1),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($difference(X3,1),$uminus(X6)))))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & $less(X6,$sum(X0,1)) & ~$less(X6,0) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & $less($sum($difference(X3,1),$uminus(X6)),$sum(X0,1)) & ~$less($sum(X0,1),0) & $less(X3,$sum(X0,1)) & ~$less(X3,0) & ! [X17 : $int] : (all_trees1(X17,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X17)))) | ~$less(X17,X3) | $less(X17,0)) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X18 : tree1] : ((mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X19 : tree1,X20 : tree1] : (node1(X19,X20) != X18 | ~$less(size1(X19),X6) | size1(X18) != X3)) & (? [X21 : tree1,X22 : tree1] : (node1(X21,X22) = X18 & $less(size1(X21),X6) & size1(X18) = X3) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))))) & ~$less($sum(X3,$uminus(1)),X6) & ~$less(X6,0)) & ~$less($sum(X3,$uminus(1)),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X4 & ~$less($sum(X0,1),0)) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X23 : $int] : (all_trees1(X23,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X23)))) | $less(X23,0) | ~$less(X23,X3)) & ~$less(X0,X3) & ~$less(X3,1)) & ~$less(X0,1) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = X1) => (? [X2 : map_int_lplist_treerp,X3 : $int] : (? [X4 : map_int_lplist_treerp] : (? [X5 : map_int_lplist_treerp,X6 : $int] : (? [X7 : list_tree] : (? [X8 : map_int_lplist_treerp] : (? [X9 : tree1] : (! [X10 : tree1,X11 : tree1] : (node1(X10,X11) != X9 | size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1))) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(X3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(X5),t2tb(X3))))) = X8) & $less(X3,$sum(X0,1)) & ~$less(X3,0) & distinct(tree,t2tb1(X7)) & ! [X12 : tree1] : ((mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X13 : tree1,X14 : tree1] : (size1(X14) != $sum($difference(X3,1),$uminus(X6)) | size1(X13) != X6 | node1(X13,X14) != X12)) & (? [X15 : tree1,X16 : tree1] : (size1(X16) = $sum($difference(X3,1),$uminus(X6)) & size1(X15) = X6 & node1(X15,X16) = X12) | ~mem(tree,t2tb2(X12),t2tb1(X7))))) & ~$less(X6,0) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & all_trees1($sum($difference(X3,1),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($difference(X3,1),$uminus(X6)))))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & $less(X6,$sum(X0,1)) & ~$less(X6,0) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & $less($sum($difference(X3,1),$uminus(X6)),$sum(X0,1)) & ~$less($sum(X0,1),0) & $less(X3,$sum(X0,1)) & ~$less(X3,0) & ! [X17 : $int] : (all_trees1(X17,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X17)))) | ~$less(X17,X3) | $less(X17,0)) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X18 : tree1] : ((mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X19 : tree1,X20 : tree1] : (node1(X19,X20) != X18 | ~$less(size1(X19),X6) | size1(X18) != X3)) & (? [X21 : tree1,X22 : tree1] : (node1(X21,X22) = X18 & $less(size1(X21),X6) & size1(X18) = X3) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))))) & ~$less($sum(X3,$uminus(1)),X6) & ~$less(X6,0)) & ~$less($sum(X3,$uminus(1)),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X4 & ~$less($sum(X0,1),0)) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X23 : $int] : (all_trees1(X23,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X23)))) | $less(X23,0) | ~$less(X23,X3)) & ~$less(X0,X3) & ~$less(X3,1)) & ~$less(X0,1) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = sK1)) )),
27.62/27.78	  introduced(choice_axiom,[])).
27.62/27.78	tff(f184,plain,(
27.62/27.78	  ( ! [X0:$int] : (? [X2 : map_int_lplist_treerp,X3 : $int] : (? [X4 : map_int_lplist_treerp] : (? [X5 : map_int_lplist_treerp,X6 : $int] : (? [X7 : list_tree] : (? [X8 : map_int_lplist_treerp] : (? [X9 : tree1] : (! [X10 : tree1,X11 : tree1] : (node1(X10,X11) != X9 | size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1))) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(X3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(X5),t2tb(X3))))) = X8) & $less(X3,$sum(X0,1)) & ~$less(X3,0) & distinct(tree,t2tb1(X7)) & ! [X12 : tree1] : ((mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X13 : tree1,X14 : tree1] : (size1(X14) != $sum($difference(X3,1),$uminus(X6)) | size1(X13) != X6 | node1(X13,X14) != X12)) & (? [X15 : tree1,X16 : tree1] : (size1(X16) = $sum($difference(X3,1),$uminus(X6)) & size1(X15) = X6 & node1(X15,X16) = X12) | ~mem(tree,t2tb2(X12),t2tb1(X7))))) & ~$less(X6,0) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & all_trees1($sum($difference(X3,1),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($difference(X3,1),$uminus(X6)))))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & $less(X6,$sum(X0,1)) & ~$less(X6,0) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & $less($sum($difference(X3,1),$uminus(X6)),$sum(X0,1)) & ~$less($sum(X0,1),0) & $less(X3,$sum(X0,1)) & ~$less(X3,0) & ! [X17 : $int] : (all_trees1(X17,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X17)))) | ~$less(X17,X3) | $less(X17,0)) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X18 : tree1] : ((mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X19 : tree1,X20 : tree1] : (node1(X19,X20) != X18 | ~$less(size1(X19),X6) | size1(X18) != X3)) & (? [X21 : tree1,X22 : tree1] : (node1(X21,X22) = X18 & $less(size1(X21),X6) & size1(X18) = X3) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))))) & ~$less($sum(X3,$uminus(1)),X6) & ~$less(X6,0)) & ~$less($sum(X3,$uminus(1)),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X4 & ~$less($sum(X0,1),0)) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X23 : $int] : (all_trees1(X23,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X23)))) | $less(X23,0) | ~$less(X23,X3)) & ~$less(X0,X3) & ~$less(X3,1)) => (? [X4 : map_int_lplist_treerp] : (? [X6 : $int,X5 : map_int_lplist_treerp] : (? [X7 : list_tree] : (? [X8 : map_int_lplist_treerp] : (? [X9 : tree1] : (! [X11 : tree1,X10 : tree1] : (node1(X10,X11) != X9 | size1(X9) != sK3 | ~$less(size1(X10),$sum(X6,1))) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(sK3)))) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(sK3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(X5),t2tb(sK3))))) = X8) & $less(sK3,$sum(X0,1)) & ~$less(sK3,0) & distinct(tree,t2tb1(X7)) & ! [X12 : tree1] : ((mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X14 : tree1,X13 : tree1] : (size1(X14) != $sum($difference(sK3,1),$uminus(X6)) | size1(X13) != X6 | node1(X13,X14) != X12)) & (? [X16 : tree1,X15 : tree1] : (size1(X16) = $sum($difference(sK3,1),$uminus(X6)) & size1(X15) = X6 & node1(X15,X16) = X12) | ~mem(tree,t2tb2(X12),t2tb1(X7))))) & ~$less(X6,0) & ~$less($sum($difference(sK3,1),$uminus(X6)),0) & all_trees1($sum($difference(sK3,1),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($difference(sK3,1),$uminus(X6)))))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & $less(X6,$sum(X0,1)) & ~$less(X6,0) & ~$less($sum($difference(sK3,1),$uminus(X6)),0) & $less($sum($difference(sK3,1),$uminus(X6)),$sum(X0,1)) & ~$less($sum(X0,1),0) & $less(sK3,$sum(X0,1)) & ~$less(sK3,0) & ! [X17 : $int] : (all_trees1(X17,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X17)))) | ~$less(X17,sK3) | $less(X17,0)) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(sK3))) & ! [X18 : tree1] : ((mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(sK3))) | ! [X20 : tree1,X19 : tree1] : (node1(X19,X20) != X18 | ~$less(size1(X19),X6) | size1(X18) != sK3)) & (? [X22 : tree1,X21 : tree1] : (node1(X21,X22) = X18 & $less(size1(X21),X6) & size1(X18) = sK3) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(sK3))))) & ~$less($sum(sK3,$uminus(1)),X6) & ~$less(X6,0)) & ~$less($sum(sK3,$uminus(1)),0) & tb2t3(set(list(tree),int,t2tb3(sK2),t2tb(sK3),nil(tree))) = X4 & ~$less($sum(X0,1),0)) & ~$less(sK3,0) & $less(sK3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X23 : $int] : (all_trees1(X23,tb2t1(get(list(tree),int,t2tb3(sK2),t2tb(X23)))) | $less(X23,0) | ~$less(X23,sK3)) & ~$less(X0,sK3) & ~$less(sK3,1))) )),
27.62/27.78	  introduced(choice_axiom,[])).
27.62/27.78	tff(f185,plain,(
27.62/27.78	  ( ! [X2:map_int_lplist_treerp,X0:$int,X3:$int] : (? [X4 : map_int_lplist_treerp] : (? [X5 : map_int_lplist_treerp,X6 : $int] : (? [X7 : list_tree] : (? [X8 : map_int_lplist_treerp] : (? [X9 : tree1] : (! [X10 : tree1,X11 : tree1] : (node1(X10,X11) != X9 | size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1))) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(X3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(X5),t2tb(X3))))) = X8) & $less(X3,$sum(X0,1)) & ~$less(X3,0) & distinct(tree,t2tb1(X7)) & ! [X12 : tree1] : ((mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X13 : tree1,X14 : tree1] : (size1(X14) != $sum($difference(X3,1),$uminus(X6)) | size1(X13) != X6 | node1(X13,X14) != X12)) & (? [X15 : tree1,X16 : tree1] : (size1(X16) = $sum($difference(X3,1),$uminus(X6)) & size1(X15) = X6 & node1(X15,X16) = X12) | ~mem(tree,t2tb2(X12),t2tb1(X7))))) & ~$less(X6,0) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & all_trees1($sum($difference(X3,1),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($difference(X3,1),$uminus(X6)))))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & $less(X6,$sum(X0,1)) & ~$less(X6,0) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & $less($sum($difference(X3,1),$uminus(X6)),$sum(X0,1)) & ~$less($sum(X0,1),0) & $less(X3,$sum(X0,1)) & ~$less(X3,0) & ! [X17 : $int] : (all_trees1(X17,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X17)))) | ~$less(X17,X3) | $less(X17,0)) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X18 : tree1] : ((mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X19 : tree1,X20 : tree1] : (node1(X19,X20) != X18 | ~$less(size1(X19),X6) | size1(X18) != X3)) & (? [X21 : tree1,X22 : tree1] : (node1(X21,X22) = X18 & $less(size1(X21),X6) & size1(X18) = X3) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))))) & ~$less($sum(X3,$uminus(1)),X6) & ~$less(X6,0)) & ~$less($sum(X3,$uminus(1)),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X4 & ~$less($sum(X0,1),0)) => (? [X5 : map_int_lplist_treerp,X6 : $int] : (? [X7 : list_tree] : (? [X8 : map_int_lplist_treerp] : (? [X9 : tree1] : (! [X10 : tree1,X11 : tree1] : (node1(X10,X11) != X9 | size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1))) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(X3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(X5),t2tb(X3))))) = X8) & $less(X3,$sum(X0,1)) & ~$less(X3,0) & distinct(tree,t2tb1(X7)) & ! [X12 : tree1] : ((mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X13 : tree1,X14 : tree1] : (size1(X14) != $sum($difference(X3,1),$uminus(X6)) | size1(X13) != X6 | node1(X13,X14) != X12)) & (? [X15 : tree1,X16 : tree1] : (size1(X16) = $sum($difference(X3,1),$uminus(X6)) & size1(X15) = X6 & node1(X15,X16) = X12) | ~mem(tree,t2tb2(X12),t2tb1(X7))))) & ~$less(X6,0) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & all_trees1($sum($difference(X3,1),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($difference(X3,1),$uminus(X6)))))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & $less(X6,$sum(X0,1)) & ~$less(X6,0) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & $less($sum($difference(X3,1),$uminus(X6)),$sum(X0,1)) & ~$less($sum(X0,1),0) & $less(X3,$sum(X0,1)) & ~$less(X3,0) & ! [X17 : $int] : (all_trees1(X17,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X17)))) | ~$less(X17,X3) | $less(X17,0)) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X18 : tree1] : ((mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X19 : tree1,X20 : tree1] : (node1(X19,X20) != X18 | ~$less(size1(X19),X6) | size1(X18) != X3)) & (? [X21 : tree1,X22 : tree1] : (node1(X21,X22) = X18 & $less(size1(X21),X6) & size1(X18) = X3) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))))) & ~$less($sum(X3,$uminus(1)),X6) & ~$less(X6,0)) & ~$less($sum(X3,$uminus(1)),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = sK4 & ~$less($sum(X0,1),0))) )),
27.62/27.78	  introduced(choice_axiom,[])).
27.62/27.78	tff(f186,plain,(
27.62/27.78	  ( ! [X0:$int,X3:$int] : (? [X5 : map_int_lplist_treerp,X6 : $int] : (? [X7 : list_tree] : (? [X8 : map_int_lplist_treerp] : (? [X9 : tree1] : (! [X10 : tree1,X11 : tree1] : (node1(X10,X11) != X9 | size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1))) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(X3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(X5),t2tb(X3))))) = X8) & $less(X3,$sum(X0,1)) & ~$less(X3,0) & distinct(tree,t2tb1(X7)) & ! [X12 : tree1] : ((mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X13 : tree1,X14 : tree1] : (size1(X14) != $sum($difference(X3,1),$uminus(X6)) | size1(X13) != X6 | node1(X13,X14) != X12)) & (? [X15 : tree1,X16 : tree1] : (size1(X16) = $sum($difference(X3,1),$uminus(X6)) & size1(X15) = X6 & node1(X15,X16) = X12) | ~mem(tree,t2tb2(X12),t2tb1(X7))))) & ~$less(X6,0) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & all_trees1($sum($difference(X3,1),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($difference(X3,1),$uminus(X6)))))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & $less(X6,$sum(X0,1)) & ~$less(X6,0) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & $less($sum($difference(X3,1),$uminus(X6)),$sum(X0,1)) & ~$less($sum(X0,1),0) & $less(X3,$sum(X0,1)) & ~$less(X3,0) & ! [X17 : $int] : (all_trees1(X17,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X17)))) | ~$less(X17,X3) | $less(X17,0)) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X18 : tree1] : ((mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X19 : tree1,X20 : tree1] : (node1(X19,X20) != X18 | ~$less(size1(X19),X6) | size1(X18) != X3)) & (? [X21 : tree1,X22 : tree1] : (node1(X21,X22) = X18 & $less(size1(X21),X6) & size1(X18) = X3) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))))) & ~$less($sum(X3,$uminus(1)),X6) & ~$less(X6,0)) => (? [X7 : list_tree] : (? [X8 : map_int_lplist_treerp] : (? [X9 : tree1] : (! [X11 : tree1,X10 : tree1] : (node1(X10,X11) != X9 | size1(X9) != X3 | ~$less(size1(X10),$sum(sK6,1))) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,t2tb3(sK5),t2tb(X3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(sK5),t2tb(X3))))) = X8) & $less(X3,$sum(X0,1)) & ~$less(X3,0) & distinct(tree,t2tb1(X7)) & ! [X12 : tree1] : ((mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X14 : tree1,X13 : tree1] : (size1(X14) != $sum($difference(X3,1),$uminus(sK6)) | size1(X13) != sK6 | node1(X13,X14) != X12)) & (? [X16 : tree1,X15 : tree1] : (size1(X16) = $sum($difference(X3,1),$uminus(sK6)) & size1(X15) = sK6 & node1(X15,X16) = X12) | ~mem(tree,t2tb2(X12),t2tb1(X7))))) & ~$less(sK6,0) & ~$less($sum($difference(X3,1),$uminus(sK6)),0) & all_trees1($sum($difference(X3,1),$uminus(sK6)),tb2t1(get(list(tree),int,t2tb3(sK5),t2tb($sum($difference(X3,1),$uminus(sK6)))))) & all_trees1(sK6,tb2t1(get(list(tree),int,t2tb3(sK5),t2tb(sK6)))) & $less(sK6,$sum(X0,1)) & ~$less(sK6,0) & ~$less($sum($difference(X3,1),$uminus(sK6)),0) & $less($sum($difference(X3,1),$uminus(sK6)),$sum(X0,1)) & ~$less($sum(X0,1),0) & $less(X3,$sum(X0,1)) & ~$less(X3,0) & ! [X17 : $int] : (all_trees1(X17,tb2t1(get(list(tree),int,t2tb3(sK5),t2tb(X17)))) | ~$less(X17,X3) | $less(X17,0)) & distinct(tree,get(list(tree),int,t2tb3(sK5),t2tb(X3))) & ! [X18 : tree1] : ((mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(sK5),t2tb(X3))) | ! [X20 : tree1,X19 : tree1] : (node1(X19,X20) != X18 | ~$less(size1(X19),sK6) | size1(X18) != X3)) & (? [X22 : tree1,X21 : tree1] : (node1(X21,X22) = X18 & $less(size1(X21),sK6) & size1(X18) = X3) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(sK5),t2tb(X3))))) & ~$less($sum(X3,$uminus(1)),sK6) & ~$less(sK6,0))) )),
27.62/27.78	  introduced(choice_axiom,[])).
27.62/27.78	tff(f187,plain,(
27.62/27.78	  ( ! [X6:$int,X0:$int,X5:map_int_lplist_treerp,X3:$int] : (? [X7 : list_tree] : (? [X8 : map_int_lplist_treerp] : (? [X9 : tree1] : (! [X10 : tree1,X11 : tree1] : (node1(X10,X11) != X9 | size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1))) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(X3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(X5),t2tb(X3))))) = X8) & $less(X3,$sum(X0,1)) & ~$less(X3,0) & distinct(tree,t2tb1(X7)) & ! [X12 : tree1] : ((mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X13 : tree1,X14 : tree1] : (size1(X14) != $sum($difference(X3,1),$uminus(X6)) | size1(X13) != X6 | node1(X13,X14) != X12)) & (? [X15 : tree1,X16 : tree1] : (size1(X16) = $sum($difference(X3,1),$uminus(X6)) & size1(X15) = X6 & node1(X15,X16) = X12) | ~mem(tree,t2tb2(X12),t2tb1(X7))))) => (? [X8 : map_int_lplist_treerp] : (? [X9 : tree1] : (! [X10 : tree1,X11 : tree1] : (node1(X10,X11) != X9 | size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1))) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(X3),infix_plpl(tree,t2tb1(sK7),get(list(tree),int,t2tb3(X5),t2tb(X3))))) = X8) & $less(X3,$sum(X0,1)) & ~$less(X3,0) & distinct(tree,t2tb1(sK7)) & ! [X12 : tree1] : ((mem(tree,t2tb2(X12),t2tb1(sK7)) | ! [X13 : tree1,X14 : tree1] : (size1(X14) != $sum($difference(X3,1),$uminus(X6)) | size1(X13) != X6 | node1(X13,X14) != X12)) & (? [X15 : tree1,X16 : tree1] : (size1(X16) = $sum($difference(X3,1),$uminus(X6)) & size1(X15) = X6 & node1(X15,X16) = X12) | ~mem(tree,t2tb2(X12),t2tb1(sK7)))))) )),
27.62/27.78	  introduced(choice_axiom,[])).
27.62/27.78	tff(f188,plain,(
27.62/27.78	  ( ! [X6:$int,X0:$int,X7:list_tree,X5:map_int_lplist_treerp,X3:$int] : (? [X8 : map_int_lplist_treerp] : (? [X9 : tree1] : (! [X10 : tree1,X11 : tree1] : (node1(X10,X11) != X9 | size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1))) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(X3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(X5),t2tb(X3))))) = X8) => (? [X9 : tree1] : (! [X10 : tree1,X11 : tree1] : (node1(X10,X11) != X9 | size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1))) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(sK8),t2tb(X3)))) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(X3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(X5),t2tb(X3))))) = sK8)) )),
27.62/27.78	  introduced(choice_axiom,[])).
27.62/27.78	tff(f189,plain,(
27.62/27.78	  ( ! [X6:$int,X8:map_int_lplist_treerp,X3:$int] : (? [X9 : tree1] : (! [X10 : tree1,X11 : tree1] : (node1(X10,X11) != X9 | size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1))) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) => (! [X11 : tree1,X10 : tree1] : (node1(X10,X11) != sK9 | size1(sK9) != X3 | ~$less(size1(X10),$sum(X6,1))) & mem(tree,t2tb2(sK9),get(list(tree),int,t2tb3(X8),t2tb(X3))))) )),
27.62/27.78	  introduced(choice_axiom,[])).
27.62/27.78	tff(f190,plain,(
27.62/27.78	  ( ! [X6:$int,X3:$int] : (! [X12 : tree1] : (? [X15 : tree1,X16 : tree1] : (size1(X16) = $sum($difference(X3,1),$uminus(X6)) & size1(X15) = X6 & node1(X15,X16) = X12) => (size1(sK11(X12)) = $sum($difference(X3,1),$uminus(X6)) & size1(sK10(X12)) = X6 & node1(sK10(X12),sK11(X12)) = X12))) )),
27.62/27.78	  introduced(choice_axiom,[])).
27.62/27.78	tff(f191,plain,(
27.62/27.78	  ( ! [X6:$int,X3:$int] : (! [X18 : tree1] : (? [X21 : tree1,X22 : tree1] : (node1(X21,X22) = X18 & $less(size1(X21),X6) & size1(X18) = X3) => (node1(sK12(X18),sK13(X18)) = X18 & $less(size1(sK12(X18)),X6) & size1(X18) = X3))) )),
27.62/27.78	  introduced(choice_axiom,[])).
27.62/27.78	tff(f192,plain,(
27.62/27.78	  (((((((! [X10 : tree1,X11 : tree1] : (node1(X10,X11) != sK9 | size1(sK9) != sK3 | ~$less(size1(X10),$sum(sK6,1))) & mem(tree,t2tb2(sK9),get(list(tree),int,t2tb3(sK8),t2tb(sK3)))) & ~$less($sum(sK0,1),0) & tb2t3(set(list(tree),int,t2tb3(sK5),t2tb(sK3),infix_plpl(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3))))) = sK8) & $less(sK3,$sum(sK0,1)) & ~$less(sK3,0) & distinct(tree,t2tb1(sK7)) & ! [X12 : tree1] : ((mem(tree,t2tb2(X12),t2tb1(sK7)) | ! [X13 : tree1,X14 : tree1] : (size1(X14) != $sum($difference(sK3,1),$uminus(sK6)) | size1(X13) != sK6 | node1(X13,X14) != X12)) & ((size1(sK11(X12)) = $sum($difference(sK3,1),$uminus(sK6)) & size1(sK10(X12)) = sK6 & node1(sK10(X12),sK11(X12)) = X12) | ~mem(tree,t2tb2(X12),t2tb1(sK7))))) & ~$less(sK6,0) & ~$less($sum($difference(sK3,1),$uminus(sK6)),0) & all_trees1($sum($difference(sK3,1),$uminus(sK6)),tb2t1(get(list(tree),int,t2tb3(sK5),t2tb($sum($difference(sK3,1),$uminus(sK6)))))) & all_trees1(sK6,tb2t1(get(list(tree),int,t2tb3(sK5),t2tb(sK6)))) & $less(sK6,$sum(sK0,1)) & ~$less(sK6,0) & ~$less($sum($difference(sK3,1),$uminus(sK6)),0) & $less($sum($difference(sK3,1),$uminus(sK6)),$sum(sK0,1)) & ~$less($sum(sK0,1),0) & $less(sK3,$sum(sK0,1)) & ~$less(sK3,0) & ! [X17 : $int] : (all_trees1(X17,tb2t1(get(list(tree),int,t2tb3(sK5),t2tb(X17)))) | ~$less(X17,sK3) | $less(X17,0)) & distinct(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3))) & ! [X18 : tree1] : ((mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | ! [X19 : tree1,X20 : tree1] : (node1(X19,X20) != X18 | ~$less(size1(X19),sK6) | size1(X18) != sK3)) & ((node1(sK12(X18),sK13(X18)) = X18 & $less(size1(sK12(X18)),sK6) & size1(X18) = sK3) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(sK5),t2tb(sK3))))) & ~$less($sum(sK3,$uminus(1)),sK6) & ~$less(sK6,0)) & ~$less($sum(sK3,$uminus(1)),0) & tb2t3(set(list(tree),int,t2tb3(sK2),t2tb(sK3),nil(tree))) = sK4 & ~$less($sum(sK0,1),0)) & ~$less(sK3,0) & $less(sK3,$sum(sK0,1)) & ~$less($sum(sK0,1),0) & ! [X23 : $int] : (all_trees1(X23,tb2t1(get(list(tree),int,t2tb3(sK2),t2tb(X23)))) | $less(X23,0) | ~$less(X23,sK3)) & ~$less(sK0,sK3) & ~$less(sK3,1)) & ~$less(sK0,1) & ~$less($sum(sK0,1),0) & tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = sK1) & $less(0,$sum(sK0,1)) & ~$less(0,0) & ~$less($sum(sK0,1),0) & ~$less($sum(sK0,1),0) & ~$less(sK0,0)),
27.62/27.78	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8,sK9,sK10,sK11,sK12,sK13])],[f181,f191,f190,f189,f188,f187,f186,f185,f184,f183,f182])).
27.62/27.78	tff(f193,plain,(
27.62/27.78	  ! [X0 : tree1] : (? [X1 : tree1,X2 : tree1] : ($less(size1(X1),size1(X0)) & node1(X1,X2) = X0) => ($less(size1(sK14(X0)),size1(X0)) & node1(sK14(X0),sK15(X0)) = X0))),
27.62/27.78	  introduced(choice_axiom,[])).
27.62/27.78	tff(f194,plain,(
27.62/27.78	  ! [X0 : tree1] : (($less(size1(sK14(X0)),size1(X0)) & node1(sK14(X0),sK15(X0)) = X0) | ~$less(0,size1(X0)))),
27.62/27.78	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK14,sK15])],[f154,f193])).
27.62/27.78	tff(f200,plain,(
27.62/27.78	  ! [X0 : $int,X1 : list_tree] : ((distinct(tree,t2tb1(X1)) & ! [X2 : tree1] : ((mem(tree,t2tb2(X2),t2tb1(X1)) | size1(X2) != X0) & (size1(X2) = X0 | ~mem(tree,t2tb2(X2),t2tb1(X1))))) | ~all_trees1(X0,X1))),
27.62/27.78	  inference(nnf_transformation,[],[f159])).
27.62/27.78	tff(f202,plain,(
27.62/27.78	  ! [X2 : uni,X1 : uni,X0 : ty] : (? [X3 : uni] : (mem(X0,X3,X2) & mem(X0,X3,X1) & sort1(X0,X3)) => (mem(X0,sK19(X0,X1,X2),X2) & mem(X0,sK19(X0,X1,X2),X1) & sort1(X0,sK19(X0,X1,X2))))),
27.62/27.78	  introduced(choice_axiom,[])).
27.62/27.78	tff(f203,plain,(
27.62/27.78	  ! [X0 : ty,X1 : uni,X2 : uni] : (distinct(X0,infix_plpl(X0,X1,X2)) | (mem(X0,sK19(X0,X1,X2),X2) & mem(X0,sK19(X0,X1,X2),X1) & sort1(X0,sK19(X0,X1,X2))) | ~distinct(X0,X2) | ~distinct(X0,X1))),
27.62/27.78	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK19])],[f161,f202])).
27.62/27.78	tff(f206,plain,(
27.62/27.78	  ! [X0 : ty,X1 : uni,X2 : uni,X3 : uni] : (((mem(X0,X1,X2) | mem(X0,X1,X3)) | ~mem(X0,X1,infix_plpl(X0,X2,X3))) & (mem(X0,X1,infix_plpl(X0,X2,X3)) | (~mem(X0,X1,X2) & ~mem(X0,X1,X3))))),
27.62/27.78	  inference(nnf_transformation,[],[f144])).
27.62/27.78	tff(f207,plain,(
27.62/27.78	  ! [X0 : ty,X1 : uni,X2 : uni,X3 : uni] : ((mem(X0,X1,X2) | mem(X0,X1,X3) | ~mem(X0,X1,infix_plpl(X0,X2,X3))) & (mem(X0,X1,infix_plpl(X0,X2,X3)) | (~mem(X0,X1,X2) & ~mem(X0,X1,X3))))),
27.62/27.78	  inference(flattening,[],[f206])).
27.62/27.78	tff(f208,plain,(
27.62/27.78	  ~$less(sK0,0)),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f212,plain,(
27.62/27.78	  $less(0,$sum(sK0,1))),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f213,plain,(
27.62/27.78	  tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = sK1),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f215,plain,(
27.62/27.78	  ~$less(sK0,1)),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f216,plain,(
27.62/27.78	  ~$less(sK3,1)),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f217,plain,(
27.62/27.78	  ~$less(sK0,sK3)),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f223,plain,(
27.62/27.78	  tb2t3(set(list(tree),int,t2tb3(sK2),t2tb(sK3),nil(tree))) = sK4),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f226,plain,(
27.62/27.78	  ~$less($sum(sK3,$uminus(1)),sK6)),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f227,plain,(
27.62/27.78	  ( ! [X18:tree1] : (~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | size1(X18) = sK3) )),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f228,plain,(
27.62/27.78	  ( ! [X18:tree1] : ($less(size1(sK12(X18)),sK6) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) )),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f229,plain,(
27.62/27.78	  ( ! [X18:tree1] : (~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | node1(sK12(X18),sK13(X18)) = X18) )),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f230,plain,(
27.62/27.78	  ( ! [X19:tree1,X20:tree1,X18:tree1] : (mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | node1(X19,X20) != X18 | ~$less(size1(X19),sK6) | size1(X18) != sK3) )),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f231,plain,(
27.62/27.78	  distinct(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f236,plain,(
27.62/27.78	  $less($sum($difference(sK3,1),$uminus(sK6)),$sum(sK0,1))),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f239,plain,(
27.62/27.78	  $less(sK6,$sum(sK0,1))),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f240,plain,(
27.62/27.78	  all_trees1(sK6,tb2t1(get(list(tree),int,t2tb3(sK5),t2tb(sK6))))),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f242,plain,(
27.62/27.78	  ~$less($sum($difference(sK3,1),$uminus(sK6)),0)),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f243,plain,(
27.62/27.78	  ~$less(sK6,0)),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f244,plain,(
27.62/27.78	  ( ! [X12:tree1] : (node1(sK10(X12),sK11(X12)) = X12 | ~mem(tree,t2tb2(X12),t2tb1(sK7))) )),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f245,plain,(
27.62/27.78	  ( ! [X12:tree1] : (~mem(tree,t2tb2(X12),t2tb1(sK7)) | size1(sK10(X12)) = sK6) )),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f246,plain,(
27.62/27.78	  ( ! [X12:tree1] : (size1(sK11(X12)) = $sum($difference(sK3,1),$uminus(sK6)) | ~mem(tree,t2tb2(X12),t2tb1(sK7))) )),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f247,plain,(
27.62/27.78	  ( ! [X14:tree1,X12:tree1,X13:tree1] : (mem(tree,t2tb2(X12),t2tb1(sK7)) | size1(X14) != $sum($difference(sK3,1),$uminus(sK6)) | size1(X13) != sK6 | node1(X13,X14) != X12) )),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f248,plain,(
27.62/27.78	  distinct(tree,t2tb1(sK7))),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f249,plain,(
27.62/27.78	  ~$less(sK3,0)),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f250,plain,(
27.62/27.78	  $less(sK3,$sum(sK0,1))),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f251,plain,(
27.62/27.78	  tb2t3(set(list(tree),int,t2tb3(sK5),t2tb(sK3),infix_plpl(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3))))) = sK8),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f252,plain,(
27.62/27.78	  ~$less($sum(sK0,1),0)),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f253,plain,(
27.62/27.78	  mem(tree,t2tb2(sK9),get(list(tree),int,t2tb3(sK8),t2tb(sK3)))),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f254,plain,(
27.62/27.78	  ( ! [X10:tree1,X11:tree1] : (node1(X10,X11) != sK9 | size1(sK9) != sK3 | ~$less(size1(X10),$sum(sK6,1))) )),
27.62/27.78	  inference(cnf_transformation,[],[f192])).
27.62/27.78	tff(f257,plain,(
27.62/27.78	  ( ! [X0:tree1,X1:tree1] : (size1(node1(X0,X1)) = $sum($sum(1,size1(X0)),size1(X1))) )),
27.62/27.78	  inference(cnf_transformation,[],[f85])).
27.62/27.78	tff(f260,plain,(
27.62/27.78	  ( ! [X0:tree1] : (~$less(size1(X0),0)) )),
27.62/27.78	  inference(cnf_transformation,[],[f87])).
27.62/27.78	tff(f262,plain,(
27.62/27.78	  ( ! [X0:$int] : (sort1(int,t2tb(X0))) )),
27.62/27.78	  inference(cnf_transformation,[],[f88])).
27.62/27.78	tff(f269,plain,(
27.62/27.78	  ( ! [X0:uni] : (t2tb3(tb2t3(X0)) = X0) )),
27.62/27.78	  inference(cnf_transformation,[],[f94])).
27.62/27.78	tff(f270,plain,(
27.62/27.78	  ( ! [X0:uni] : (t2tb2(tb2t2(X0)) = X0) )),
27.62/27.78	  inference(cnf_transformation,[],[f95])).
27.62/27.78	tff(f271,plain,(
27.62/27.78	  ( ! [X0:tree1] : (tb2t2(t2tb2(X0)) = X0) )),
27.62/27.78	  inference(cnf_transformation,[],[f96])).
27.62/27.78	tff(f273,plain,(
27.62/27.78	  ( ! [X0:ty] : (sort1(list(X0),nil(X0))) )),
27.62/27.78	  inference(cnf_transformation,[],[f28])).
27.62/27.78	tff(f279,plain,(
27.62/27.78	  ( ! [X0:tree1] : (node1(node_proj_11(X0),node_proj_21(X0)) = X0 | empty1 = X0) )),
27.62/27.78	  inference(cnf_transformation,[],[f102])).
27.62/27.78	tff(f280,plain,(
27.62/27.78	  ( ! [X0:tree1] : (node1(sK14(X0),sK15(X0)) = X0 | ~$less(0,size1(X0))) )),
27.62/27.78	  inference(cnf_transformation,[],[f194])).
27.62/27.78	tff(f282,plain,(
27.62/27.78	  ( ! [X0:tree1,X1:tree1] : (empty1 != node1(X0,X1)) )),
27.62/27.78	  inference(cnf_transformation,[],[f104])).
27.62/27.78	tff(f285,plain,(
27.62/27.78	  ( ! [X0:tree1,X1:tree1] : (node_proj_21(node1(X0,X1)) = X1) )),
27.62/27.78	  inference(cnf_transformation,[],[f107])).
27.62/27.78	tff(f286,plain,(
27.62/27.78	  ( ! [X0:tree1,X1:tree1] : (node_proj_11(node1(X0,X1)) = X0) )),
27.62/27.78	  inference(cnf_transformation,[],[f108])).
27.62/27.78	tff(f309,plain,(
27.62/27.78	  ( ! [X2:tree1,X0:tree1,X3:tree1,X1:tree1] : (node1(X0,X2) != node1(X1,X3) | size1(X0) = size1(X1)) )),
27.62/27.78	  inference(cnf_transformation,[],[f158])).
27.62/27.78	tff(f311,plain,(
27.62/27.78	  ( ! [X2:tree1,X0:$int,X1:list_tree] : (mem(tree,t2tb2(X2),t2tb1(X1)) | size1(X2) != X0 | ~all_trees1(X0,X1)) )),
27.62/27.78	  inference(cnf_transformation,[],[f200])).
27.62/27.78	tff(f318,plain,(
27.62/27.78	  ( ! [X2:uni,X0:ty,X1:uni] : (sort1(list(X0),infix_plpl(X0,X1,X2))) )),
27.62/27.78	  inference(cnf_transformation,[],[f122])).
27.62/27.78	tff(f320,plain,(
27.62/27.78	  ( ! [X2:uni,X0:ty,X1:uni] : (sort1(list(X0),cons(X0,X1,X2))) )),
27.62/27.78	  inference(cnf_transformation,[],[f124])).
27.62/27.78	tff(f327,plain,(
27.62/27.78	  ( ! [X2:uni,X0:ty,X1:uni] : (distinct(X0,infix_plpl(X0,X1,X2)) | sort1(X0,sK19(X0,X1,X2)) | ~distinct(X0,X2) | ~distinct(X0,X1)) )),
27.62/27.78	  inference(cnf_transformation,[],[f203])).
27.62/27.78	tff(f328,plain,(
27.62/27.78	  ( ! [X2:uni,X0:ty,X1:uni] : (mem(X0,sK19(X0,X1,X2),X1) | distinct(X0,infix_plpl(X0,X1,X2)) | ~distinct(X0,X2) | ~distinct(X0,X1)) )),
27.62/27.78	  inference(cnf_transformation,[],[f203])).
27.62/27.78	tff(f329,plain,(
27.62/27.78	  ( ! [X2:uni,X0:ty,X1:uni] : (mem(X0,sK19(X0,X1,X2),X2) | distinct(X0,infix_plpl(X0,X1,X2)) | ~distinct(X0,X2) | ~distinct(X0,X1)) )),
27.62/27.78	  inference(cnf_transformation,[],[f203])).
27.62/27.78	tff(f347,plain,(
27.62/27.78	  ( ! [X2:uni,X0:ty,X3:uni,X1:ty] : (get(X1,X0,const(X1,X0,X2),X3) = X2 | ~sort1(X1,X2)) )),
27.62/27.78	  inference(cnf_transformation,[],[f173])).
27.62/27.78	tff(f350,plain,(
27.62/27.78	  ( ! [X2:uni,X0:ty,X3:uni,X1:uni] : (~mem(X0,X1,infix_plpl(X0,X2,X3)) | mem(X0,X1,X3) | mem(X0,X1,X2)) )),
27.62/27.78	  inference(cnf_transformation,[],[f207])).
27.62/27.78	tff(f354,plain,(
27.62/27.78	  ( ! [X4:uni,X2:uni,X0:ty,X5:uni,X3:uni,X1:ty] : (get(X1,X0,X2,X4) = get(X1,X0,set(X1,X0,X2,X3,X5),X4) | X3 = X4 | ~sort1(X0,X4) | ~sort1(X0,X3)) )),
27.62/27.78	  inference(cnf_transformation,[],[f176])).
27.62/27.78	tff(f356,plain,(
27.62/27.78	  ( ! [X4:uni,X2:uni,X0:ty,X5:uni,X3:uni,X1:ty] : (get(X1,X0,set(X1,X0,X2,X3,X5),X4) = X5 | X3 != X4 | ~sort1(X1,X5)) )),
27.62/27.78	  inference(cnf_transformation,[],[f179])).
27.62/27.78	tff(f360,plain,(
27.62/27.78	  ( ! [X14:tree1,X13:tree1] : (mem(tree,t2tb2(node1(X13,X14)),t2tb1(sK7)) | size1(X14) != $sum($difference(sK3,1),$uminus(sK6)) | size1(X13) != sK6) )),
27.62/27.78	  inference(equality_resolution,[],[f247])).
27.62/27.78	tff(f361,plain,(
27.62/27.78	  ( ! [X19:tree1,X20:tree1] : (mem(tree,t2tb2(node1(X19,X20)),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | ~$less(size1(X19),sK6) | size1(node1(X19,X20)) != sK3) )),
27.62/27.78	  inference(equality_resolution,[],[f230])).
27.62/27.78	tff(f363,plain,(
27.62/27.78	  ( ! [X2:tree1,X1:list_tree] : (mem(tree,t2tb2(X2),t2tb1(X1)) | ~all_trees1(size1(X2),X1)) )),
27.62/27.78	  inference(equality_resolution,[],[f311])).
27.62/27.78	tff(f365,plain,(
27.62/27.78	  ( ! [X4:uni,X2:uni,X0:ty,X5:uni,X1:ty] : (get(X1,X0,set(X1,X0,X2,X4,X5),X4) = X5 | ~sort1(X1,X5)) )),
27.62/27.78	  inference(equality_resolution,[],[f356])).
27.62/27.78	tff(f366,plain,(
27.62/27.78	  ( ! [X12:$int,X10:tree1,X13:$int,X11:tree1] : (node1(X10,X11) != sK9 | size1(sK9) != sK3 | size1(X10) != X12 | sK6 != X13 | ~$less(X12,$sum(X13,1))) )),
27.62/27.78	  inference(theory_flattening,[],[f254])).
27.62/27.78	tff(f367,plain,(
27.62/27.78	  ( ! [X1:$int] : (sK0 != X1 | ~$less($sum(X1,1),0)) )),
27.62/27.78	  inference(theory_flattening,[],[f252])).
27.62/27.78	tff(f368,plain,(
27.62/27.78	  ( ! [X2:$int,X1:$int] : (sK3 != X1 | sK0 != X2 | $less(X1,$sum(X2,1))) )),
27.62/27.78	  inference(theory_flattening,[],[f250])).
27.62/27.78	tff(f369,plain,(
27.62/27.78	  ( ! [X1:$int] : (sK3 != X1 | ~$less(X1,0)) )),
27.62/27.78	  inference(theory_flattening,[],[f249])).
27.62/27.78	tff(f370,plain,(
27.62/27.78	  ( ! [X14:tree1,X17:$int,X15:$int,X13:tree1,X16:$int] : ($sum($difference(X16,1),$uminus(X17)) != X15 | size1(X14) != X15 | sK3 != X16 | sK6 != X17 | mem(tree,t2tb2(node1(X13,X14)),t2tb1(sK7)) | size1(X13) != sK6) )),
27.62/27.78	  inference(theory_flattening,[],[f360])).
27.62/27.78	tff(f371,plain,(
27.62/27.78	  ( ! [X14:$int,X12:tree1,X15:$int,X13:$int] : (size1(sK11(X12)) != X13 | sK3 != X14 | sK6 != X15 | $sum($difference(X14,1),$uminus(X15)) = X13 | ~mem(tree,t2tb2(X12),t2tb1(sK7))) )),
27.62/27.78	  inference(theory_flattening,[],[f246])).
27.62/27.78	tff(f372,plain,(
27.62/27.78	  ( ! [X1:$int] : (sK6 != X1 | ~$less(X1,0)) )),
27.62/27.78	  inference(theory_flattening,[],[f243])).
27.62/27.78	tff(f373,plain,(
27.62/27.78	  ( ! [X2:$int,X1:$int] : (sK6 != X2 | sK3 != X1 | ~$less($sum($difference(X1,1),$uminus(X2)),0)) )),
27.62/27.78	  inference(theory_flattening,[],[f242])).
27.62/27.78	tff(f375,plain,(
27.62/27.78	  ( ! [X2:$int,X1:$int] : (sK6 != X1 | sK0 != X2 | $less(X1,$sum(X2,1))) )),
27.62/27.78	  inference(theory_flattening,[],[f239])).
27.62/27.78	tff(f378,plain,(
27.62/27.78	  ( ! [X2:$int,X3:$int,X1:$int] : (sK6 != X2 | sK3 != X1 | sK0 != X3 | $less($sum($difference(X1,1),$uminus(X2)),$sum(X3,1))) )),
27.62/27.78	  inference(theory_flattening,[],[f236])).
27.62/27.78	tff(f383,plain,(
27.62/27.78	  ( ! [X21:$int,X19:tree1,X22:$int,X20:tree1] : (size1(node1(X19,X20)) != sK3 | size1(X19) != X21 | sK6 != X22 | ~$less(X21,X22) | mem(tree,t2tb2(node1(X19,X20)),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) )),
27.62/27.78	  inference(theory_flattening,[],[f361])).
27.62/27.78	tff(f384,plain,(
27.62/27.78	  ( ! [X19:$int,X20:$int,X18:tree1] : (size1(sK12(X18)) != X19 | sK6 != X20 | $less(X19,X20) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) )),
27.62/27.78	  inference(theory_flattening,[],[f228])).
27.62/27.78	tff(f385,plain,(
27.62/27.78	  ( ! [X2:$int,X1:$int] : (sK3 != X1 | sK6 != X2 | ~$less($sum(X1,$uminus(1)),X2)) )),
27.62/27.78	  inference(theory_flattening,[],[f226])).
27.62/27.78	tff(f393,plain,(
27.62/27.78	  ( ! [X2:$int,X1:$int] : (sK3 != X2 | sK0 != X1 | ~$less(X1,X2)) )),
27.62/27.78	  inference(theory_flattening,[],[f217])).
27.62/27.78	tff(f394,plain,(
27.62/27.78	  ( ! [X1:$int] : (sK3 != X1 | ~$less(X1,1)) )),
27.62/27.78	  inference(theory_flattening,[],[f216])).
27.62/27.78	tff(f395,plain,(
27.62/27.78	  ( ! [X1:$int] : (sK0 != X1 | ~$less(X1,1)) )),
27.62/27.78	  inference(theory_flattening,[],[f215])).
27.62/27.78	tff(f397,plain,(
27.62/27.78	  ( ! [X1:$int] : (sK0 != X1 | $less(0,$sum(X1,1))) )),
27.62/27.78	  inference(theory_flattening,[],[f212])).
27.62/27.78	tff(f400,plain,(
27.62/27.78	  ( ! [X1:$int] : (sK0 != X1 | ~$less(X1,0)) )),
27.62/27.78	  inference(theory_flattening,[],[f208])).
27.62/27.78	tff(f402,plain,(
27.62/27.78	  ( ! [X4:$int,X2:$int,X0:tree1,X3:$int,X1:tree1] : (size1(node1(X0,X1)) != X2 | size1(X0) != X3 | size1(X1) != X4 | $sum($sum(1,X3),X4) = X2) )),
27.62/27.78	  inference(theory_flattening,[],[f257])).
27.62/27.78	tff(f403,plain,(
27.62/27.78	  ( ! [X0:tree1,X1:$int] : (size1(X0) != X1 | ~$less(X1,0)) )),
27.62/27.78	  inference(theory_flattening,[],[f260])).
27.62/27.78	tff(f407,plain,(
27.62/27.78	  ( ! [X0:tree1,X1:$int] : (size1(X0) != X1 | node1(sK14(X0),sK15(X0)) = X0 | ~$less(0,X1)) )),
27.62/27.78	  inference(theory_flattening,[],[f280])).
27.62/27.78	tff(f412,plain,(
27.62/27.78	  ( ! [X1:$int] : (sK0 != X1 | ~$less(X1,$uminus(1))) )),
27.62/27.78	  inference(evaluation,[],[f367])).
27.62/27.78	tff(f413,plain,(
27.62/27.78	  ( ! [X1:$int] : (sK0 != X1 | ~$less(X1,-1)) )),
27.62/27.78	  inference(evaluation,[],[f412])).
27.62/27.78	tff(f416,plain,(
27.62/27.78	  ( ! [X2:$int,X1:$int] : (sK6 != X2 | sK3 != X1 | ~$less($sum(X1,-1),X2)) )),
27.62/27.78	  inference(evaluation,[],[f385])).
27.62/27.78	tff(f425,plain,(
27.62/27.78	  ( ! [X1:$int] : (sK0 != X1 | $less($uminus(1),X1)) )),
27.62/27.78	  inference(evaluation,[],[f397])).
27.62/27.78	tff(f426,plain,(
27.62/27.78	  ( ! [X1:$int] : (sK0 != X1 | $less(-1,X1)) )),
27.62/27.78	  inference(evaluation,[],[f425])).
27.62/27.78	tff(f432,plain,(
27.62/27.78	  spl22_1 <=> ~distinct(tree,t2tb1(sK7))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_1])])).
27.62/27.78	tff(f435,plain,(
27.62/27.78	  spl22_0 <=> distinct(tree,t2tb1(sK7))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_0])])).
27.62/27.78	tff(f437,plain,(
27.62/27.78	  spl22_0),
27.62/27.78	  inference(avatar_split_clause,[],[f248,f435])).
27.62/27.78	tff(f438,plain,(
27.62/27.78	  ~$less(sK3,0)),
27.62/27.78	  inference(equality_resolution,[],[f369])).
27.62/27.78	tff(f443,plain,(
27.62/27.78	  spl22_3 <=> ~$less(sK3,0)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_3])])).
27.62/27.78	tff(f445,plain,(
27.62/27.78	  ~spl22_3),
27.62/27.78	  inference(avatar_split_clause,[],[f438,f443])).
27.62/27.78	tff(f446,plain,(
27.62/27.78	  ~$less(sK6,0)),
27.62/27.78	  inference(equality_resolution,[],[f372])).
27.62/27.78	tff(f451,plain,(
27.62/27.78	  spl22_5 <=> ~$less(sK6,0)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_5])])).
27.62/27.78	tff(f453,plain,(
27.62/27.78	  ~spl22_5),
27.62/27.78	  inference(avatar_split_clause,[],[f446,f451])).
27.62/27.78	tff(f454,plain,(
27.62/27.78	  ~$less(sK3,1)),
27.62/27.78	  inference(equality_resolution,[],[f394])).
27.62/27.78	tff(f459,plain,(
27.62/27.78	  spl22_7 <=> ~$less(sK3,1)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_7])])).
27.62/27.78	tff(f461,plain,(
27.62/27.78	  ~spl22_7),
27.62/27.78	  inference(avatar_split_clause,[],[f454,f459])).
27.62/27.78	tff(f462,plain,(
27.62/27.78	  ~$less(sK0,1)),
27.62/27.78	  inference(equality_resolution,[],[f395])).
27.62/27.78	tff(f463,plain,(
27.62/27.78	  ~$less(sK0,0)),
27.62/27.78	  inference(equality_resolution,[],[f400])).
27.62/27.78	tff(f468,plain,(
27.62/27.78	  spl22_9 <=> ~$less(sK0,1)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_9])])).
27.62/27.78	tff(f470,plain,(
27.62/27.78	  ~spl22_9),
27.62/27.78	  inference(avatar_split_clause,[],[f462,f468])).
27.62/27.78	tff(f475,plain,(
27.62/27.78	  spl22_11 <=> ~$less(sK0,0)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_11])])).
27.62/27.78	tff(f477,plain,(
27.62/27.78	  ~spl22_11),
27.62/27.78	  inference(avatar_split_clause,[],[f463,f475])).
27.62/27.78	tff(f478,plain,(
27.62/27.78	  ~$less(sK0,-1)),
27.62/27.78	  inference(equality_resolution,[],[f413])).
27.62/27.78	tff(f483,plain,(
27.62/27.78	  spl22_13 <=> ~$less(sK0,-1)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_13])])).
27.62/27.78	tff(f485,plain,(
27.62/27.78	  ~spl22_13),
27.62/27.78	  inference(avatar_split_clause,[],[f478,f483])).
27.62/27.78	tff(f486,plain,(
27.62/27.78	  $less(-1,sK0)),
27.62/27.78	  inference(equality_resolution,[],[f426])).
27.62/27.78	tff(f491,plain,(
27.62/27.78	  spl22_14 <=> $less(-1,sK0)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_14])])).
27.62/27.78	tff(f493,plain,(
27.62/27.78	  spl22_14),
27.62/27.78	  inference(avatar_split_clause,[],[f486,f491])).
27.62/27.78	tff(f494,plain,(
27.62/27.78	  ( ! [X0:$int] : (sK0 != X0 | ~$less(X0,sK3)) )),
27.62/27.78	  inference(equality_resolution,[],[f393])).
27.62/27.78	tff(f495,plain,(
27.62/27.78	  ~$less(sK0,sK3)),
27.62/27.78	  inference(equality_resolution,[],[f494])).
27.62/27.78	tff(f497,plain,(
27.62/27.78	  spl22_17 <=> ~distinct(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_17])])).
27.62/27.78	tff(f500,plain,(
27.62/27.78	  spl22_16 <=> distinct(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_16])])).
27.62/27.78	tff(f502,plain,(
27.62/27.78	  spl22_16),
27.62/27.78	  inference(avatar_split_clause,[],[f231,f500])).
27.62/27.78	tff(f507,plain,(
27.62/27.78	  spl22_19 <=> ~$less(sK0,sK3)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_19])])).
27.62/27.78	tff(f509,plain,(
27.62/27.78	  ~spl22_19),
27.62/27.78	  inference(avatar_split_clause,[],[f495,f507])).
27.62/27.78	tff(f514,plain,(
27.62/27.78	  spl22_20 <=> all_trees1(sK6,tb2t1(get(list(tree),int,t2tb3(sK5),t2tb(sK6))))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_20])])).
27.62/27.78	tff(f516,plain,(
27.62/27.78	  spl22_20),
27.62/27.78	  inference(avatar_split_clause,[],[f240,f514])).
27.62/27.78	tff(f517,plain,(
27.62/27.78	  ( ! [X0:tree1] : (size1(sK10(X0)) = sK6 | ~all_trees1(size1(X0),sK7)) )),
27.62/27.78	  inference(resolution,[],[f245,f363])).
27.62/27.78	tff(f518,plain,(
27.62/27.78	  ( ! [X0:uni] : (size1(sK10(tb2t2(X0))) = sK6 | ~mem(tree,X0,t2tb1(sK7))) )),
27.62/27.78	  inference(superposition,[],[f245,f270])).
27.62/27.78	tff(f520,plain,(
27.62/27.78	  ( ! [X2:tree1,X3:$int] : (sK6 != X3 | node1(sK14(sK10(X2)),sK15(sK10(X2))) = sK10(X2) | ~$less(0,X3) | ~all_trees1(size1(X2),sK7)) )),
27.62/27.78	  inference(superposition,[],[f407,f517])).
27.62/27.78	tff(f521,plain,(
27.62/27.78	  ( ! [X0:$int] : (sK0 != X0 | $less(sK3,$sum(X0,1))) )),
27.62/27.78	  inference(equality_resolution,[],[f368])).
27.62/27.78	tff(f522,plain,(
27.62/27.78	  $less(sK3,$sum(sK0,1))),
27.62/27.78	  inference(equality_resolution,[],[f521])).
27.62/27.78	tff(f527,plain,(
27.62/27.78	  spl22_22 <=> $less(sK3,$sum(sK0,1))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_22])])).
27.62/27.78	tff(f529,plain,(
27.62/27.78	  spl22_22),
27.62/27.78	  inference(avatar_split_clause,[],[f522,f527])).
27.62/27.78	tff(f530,plain,(
27.62/27.78	  ( ! [X0:$int] : (sK0 != X0 | $less(sK6,$sum(X0,1))) )),
27.62/27.78	  inference(equality_resolution,[],[f375])).
27.62/27.78	tff(f531,plain,(
27.62/27.78	  $less(sK6,$sum(sK0,1))),
27.62/27.78	  inference(equality_resolution,[],[f530])).
27.62/27.78	tff(f536,plain,(
27.62/27.78	  spl22_24 <=> $less(sK6,$sum(sK0,1))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_24])])).
27.62/27.78	tff(f538,plain,(
27.62/27.78	  spl22_24),
27.62/27.78	  inference(avatar_split_clause,[],[f531,f536])).
27.62/27.78	tff(f539,plain,(
27.62/27.78	  ( ! [X0:$int] : (sK3 != X0 | ~$less($sum(X0,-1),sK6)) )),
27.62/27.78	  inference(equality_resolution,[],[f416])).
27.62/27.78	tff(f540,plain,(
27.62/27.78	  ~$less($sum(sK3,-1),sK6)),
27.62/27.78	  inference(equality_resolution,[],[f539])).
27.62/27.78	tff(f545,plain,(
27.62/27.78	  spl22_27 <=> ~$less($sum(sK3,-1),sK6)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_27])])).
27.62/27.78	tff(f547,plain,(
27.62/27.78	  ~spl22_27),
27.62/27.78	  inference(avatar_split_clause,[],[f540,f545])).
27.62/27.78	tff(f550,plain,(
27.62/27.78	  ( ! [X4:$int,X3:uni] : (sK6 != X4 | node1(sK14(sK10(tb2t2(X3))),sK15(sK10(tb2t2(X3)))) = sK10(tb2t2(X3)) | ~$less(0,X4) | ~mem(tree,X3,t2tb1(sK7))) )),
27.62/27.78	  inference(superposition,[],[f407,f518])).
27.62/27.78	tff(f555,plain,(
27.62/27.78	  spl22_28 <=> mem(tree,t2tb2(sK9),get(list(tree),int,t2tb3(sK8),t2tb(sK3)))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_28])])).
27.62/27.78	tff(f556,plain,(
27.62/27.78	  mem(tree,t2tb2(sK9),get(list(tree),int,t2tb3(sK8),t2tb(sK3))) | ~spl22_28),
27.62/27.78	  inference(avatar_component_clause,[],[f555])).
27.62/27.78	tff(f557,plain,(
27.62/27.78	  spl22_28),
27.62/27.78	  inference(avatar_split_clause,[],[f253,f555])).
27.62/27.78	tff(f562,plain,(
27.62/27.78	  spl22_30 <=> tb2t3(set(list(tree),int,t2tb3(sK2),t2tb(sK3),nil(tree))) = sK4),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_30])])).
27.62/27.78	tff(f563,plain,(
27.62/27.78	  tb2t3(set(list(tree),int,t2tb3(sK2),t2tb(sK3),nil(tree))) = sK4 | ~spl22_30),
27.62/27.78	  inference(avatar_component_clause,[],[f562])).
27.62/27.78	tff(f564,plain,(
27.62/27.78	  spl22_30),
27.62/27.78	  inference(avatar_split_clause,[],[f223,f562])).
27.62/27.78	tff(f565,plain,(
27.62/27.78	  ( ! [X0:tree1] : (empty1 != X0 | ~mem(tree,t2tb2(X0),t2tb1(sK7))) )),
27.62/27.78	  inference(superposition,[],[f282,f244])).
27.62/27.78	tff(f566,plain,(
27.62/27.78	  ( ! [X1:tree1] : (~mem(tree,t2tb2(X1),t2tb1(sK7)) | node_proj_21(X1) = sK11(X1)) )),
27.62/27.78	  inference(superposition,[],[f285,f244])).
27.62/27.78	tff(f567,plain,(
27.62/27.78	  ( ! [X2:tree1] : (~mem(tree,t2tb2(X2),t2tb1(sK7)) | node_proj_11(X2) = sK10(X2)) )),
27.62/27.78	  inference(superposition,[],[f286,f244])).
27.62/27.78	tff(f571,plain,(
27.62/27.78	  ( ! [X14:$int,X15:$int,X13:tree1,X16:$int] : (size1(sK11(X13)) != X16 | size1(sK10(X13)) != X15 | size1(X13) != X14 | $sum($sum(1,X15),X16) = X14 | ~mem(tree,t2tb2(X13),t2tb1(sK7))) )),
27.62/27.78	  inference(superposition,[],[f402,f244])).
27.62/27.78	tff(f572,plain,(
27.62/27.78	  ~mem(tree,t2tb2(empty1),t2tb1(sK7))),
27.62/27.78	  inference(equality_resolution,[],[f565])).
27.62/27.78	tff(f577,plain,(
27.62/27.78	  spl22_33 <=> ~mem(tree,t2tb2(empty1),t2tb1(sK7))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_33])])).
27.62/27.78	tff(f578,plain,(
27.62/27.78	  ~mem(tree,t2tb2(empty1),t2tb1(sK7)) | ~spl22_33),
27.62/27.78	  inference(avatar_component_clause,[],[f577])).
27.62/27.78	tff(f579,plain,(
27.62/27.78	  ~spl22_33),
27.62/27.78	  inference(avatar_split_clause,[],[f572,f577])).
27.62/27.78	tff(f580,plain,(
27.62/27.78	  ~all_trees1(size1(empty1),sK7) | ~spl22_33),
27.62/27.78	  inference(resolution,[],[f578,f363])).
27.62/27.78	tff(f581,plain,(
27.62/27.78	  set(list(tree),int,t2tb3(sK2),t2tb(sK3),nil(tree)) = t2tb3(sK4) | ~spl22_30),
27.62/27.78	  inference(superposition,[],[f269,f563])).
27.62/27.78	tff(f586,plain,(
27.62/27.78	  spl22_35 <=> ~all_trees1(size1(empty1),sK7)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_35])])).
27.62/27.78	tff(f588,plain,(
27.62/27.78	  ~spl22_35 | spl22_33),
27.62/27.78	  inference(avatar_split_clause,[],[f580,f577,f586])).
27.62/27.78	tff(f590,plain,(
27.62/27.78	  ( ! [X0:uni] : (node_proj_21(tb2t2(X0)) = sK11(tb2t2(X0)) | ~mem(tree,X0,t2tb1(sK7))) )),
27.62/27.78	  inference(superposition,[],[f566,f270])).
27.62/27.78	tff(f592,plain,(
27.62/27.78	  ( ! [X0:$int] : (sK3 != X0 | ~$less($sum($difference(X0,1),$uminus(sK6)),0)) )),
27.62/27.78	  inference(equality_resolution,[],[f373])).
27.62/27.78	tff(f593,plain,(
27.62/27.78	  ( ! [X0:tree1] : (node_proj_11(X0) = sK10(X0) | ~all_trees1(size1(X0),sK7)) )),
27.62/27.78	  inference(resolution,[],[f567,f363])).
27.62/27.78	tff(f594,plain,(
27.62/27.78	  ( ! [X0:uni] : (node_proj_11(tb2t2(X0)) = sK10(tb2t2(X0)) | ~mem(tree,X0,t2tb1(sK7))) )),
27.62/27.78	  inference(superposition,[],[f567,f270])).
27.62/27.78	tff(f596,plain,(
27.62/27.78	  ( ! [X1:tree1] : (size1(node_proj_11(X1)) = sK6 | ~all_trees1(size1(X1),sK7) | ~all_trees1(size1(X1),sK7)) )),
27.62/27.78	  inference(superposition,[],[f517,f593])).
27.62/27.78	tff(f598,plain,(
27.62/27.78	  ( ! [X1:tree1] : (size1(node_proj_11(X1)) = sK6 | ~all_trees1(size1(X1),sK7)) )),
27.62/27.78	  inference(duplicate_literal_removal,[],[f596])).
27.62/27.78	tff(f604,plain,(
27.62/27.78	  ~$less($sum($difference(sK3,1),$uminus(sK6)),0)),
27.62/27.78	  inference(equality_resolution,[],[f592])).
27.62/27.78	tff(f609,plain,(
27.62/27.78	  spl22_37 <=> ~$less($sum($difference(sK3,1),$uminus(sK6)),0)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_37])])).
27.62/27.78	tff(f610,plain,(
27.62/27.78	  ~$less($sum($difference(sK3,1),$uminus(sK6)),0) | ~spl22_37),
27.62/27.78	  inference(avatar_component_clause,[],[f609])).
27.62/27.78	tff(f611,plain,(
27.62/27.78	  ~spl22_37),
27.62/27.78	  inference(avatar_split_clause,[],[f604,f609])).
27.62/27.78	tff(f613,plain,(
27.62/27.78	  ( ! [X1:uni] : (node1(sK10(tb2t2(X1)),node_proj_21(tb2t2(X1))) = tb2t2(X1) | ~mem(tree,t2tb2(tb2t2(X1)),t2tb1(sK7)) | ~mem(tree,X1,t2tb1(sK7))) )),
27.62/27.78	  inference(superposition,[],[f244,f590])).
27.62/27.78	tff(f614,plain,(
27.62/27.78	  ( ! [X1:uni] : (~mem(tree,X1,t2tb1(sK7)) | node1(sK10(tb2t2(X1)),node_proj_21(tb2t2(X1))) = tb2t2(X1) | ~mem(tree,X1,t2tb1(sK7))) )),
27.62/27.78	  inference(forward_demodulation,[],[f613,f270])).
27.62/27.78	tff(f615,plain,(
27.62/27.78	  ( ! [X1:uni] : (node1(sK10(tb2t2(X1)),node_proj_21(tb2t2(X1))) = tb2t2(X1) | ~mem(tree,X1,t2tb1(sK7))) )),
27.62/27.78	  inference(duplicate_literal_removal,[],[f614])).
27.62/27.78	tff(f616,plain,(
27.62/27.78	  ( ! [X0:uni] : (~mem(tree,X0,get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | size1(tb2t2(X0)) = sK3) )),
27.62/27.78	  inference(superposition,[],[f227,f270])).
27.62/27.78	tff(f618,plain,(
27.62/27.78	  ( ! [X0:uni] : (size1(node_proj_11(tb2t2(X0))) = sK6 | ~mem(tree,X0,t2tb1(sK7)) | ~mem(tree,X0,t2tb1(sK7))) )),
27.62/27.78	  inference(superposition,[],[f518,f594])).
27.62/27.78	tff(f621,plain,(
27.62/27.78	  ( ! [X0:uni] : (size1(node_proj_11(tb2t2(X0))) = sK6 | ~mem(tree,X0,t2tb1(sK7))) )),
27.62/27.78	  inference(duplicate_literal_removal,[],[f618])).
27.62/27.78	tff(f624,plain,(
27.62/27.78	  ( ! [X0:tree1] : (~mem(tree,t2tb2(X0),t2tb1(sK7)) | size1(node_proj_11(X0)) = sK6) )),
27.62/27.78	  inference(superposition,[],[f621,f271])).
27.62/27.78	tff(f634,plain,(
27.62/27.78	  spl22_38 <=> set(list(tree),int,t2tb3(sK2),t2tb(sK3),nil(tree)) = t2tb3(sK4)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_38])])).
27.62/27.78	tff(f635,plain,(
27.62/27.78	  set(list(tree),int,t2tb3(sK2),t2tb(sK3),nil(tree)) = t2tb3(sK4) | ~spl22_38),
27.62/27.78	  inference(avatar_component_clause,[],[f634])).
27.62/27.78	tff(f636,plain,(
27.62/27.78	  spl22_38 | ~spl22_30),
27.62/27.78	  inference(avatar_split_clause,[],[f581,f562,f634])).
27.62/27.78	tff(f637,plain,(
27.62/27.78	  ( ! [X0:uni] : (~mem(tree,X0,get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | node1(sK12(tb2t2(X0)),sK13(tb2t2(X0))) = tb2t2(X0)) )),
27.62/27.78	  inference(superposition,[],[f229,f270])).
27.62/27.78	tff(f638,plain,(
27.62/27.78	  nil(tree) = get(list(tree),int,t2tb3(sK4),t2tb(sK3)) | ~sort1(list(tree),nil(tree)) | ~spl22_38),
27.62/27.78	  inference(superposition,[],[f365,f635])).
27.62/27.78	tff(f639,plain,(
27.62/27.78	  ( ! [X0:uni] : (get(list(tree),int,t2tb3(sK2),X0) = get(list(tree),int,t2tb3(sK4),X0) | t2tb(sK3) = X0 | ~sort1(int,X0) | ~sort1(int,t2tb(sK3))) ) | ~spl22_38),
27.62/27.78	  inference(superposition,[],[f354,f635])).
27.62/27.78	tff(f641,plain,(
27.62/27.78	  ( ! [X0:uni] : (node1(node_proj_11(tb2t2(X0)),node_proj_21(tb2t2(X0))) = tb2t2(X0) | ~mem(tree,X0,t2tb1(sK7)) | ~mem(tree,X0,t2tb1(sK7))) )),
27.62/27.78	  inference(superposition,[],[f615,f594])).
27.62/27.78	tff(f646,plain,(
27.62/27.78	  ( ! [X4:tree1,X5:tree1,X3:uni] : (node1(X4,X5) != tb2t2(X3) | size1(X4) = size1(sK10(tb2t2(X3))) | ~mem(tree,X3,t2tb1(sK7))) )),
27.62/27.78	  inference(superposition,[],[f309,f615])).
27.62/27.78	tff(f651,plain,(
27.62/27.78	  ( ! [X0:uni] : (node1(node_proj_11(tb2t2(X0)),node_proj_21(tb2t2(X0))) = tb2t2(X0) | ~mem(tree,X0,t2tb1(sK7))) )),
27.62/27.78	  inference(duplicate_literal_removal,[],[f641])).
27.62/27.78	tff(f666,plain,(
27.62/27.78	  ( ! [X0:$int,X1:$int] : (sK3 != X0 | sK0 != X1 | $less($sum($difference(X0,1),$uminus(sK6)),$sum(X1,1))) )),
27.62/27.78	  inference(equality_resolution,[],[f378])).
27.62/27.78	tff(f711,plain,(
27.62/27.78	  ( ! [X0:uni] : (size1(tb2t2(sK19(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X0))) = sK3 | distinct(tree,infix_plpl(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X0)) | ~distinct(tree,X0) | ~distinct(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) )),
27.62/27.78	  inference(resolution,[],[f616,f328])).
27.62/27.78	tff(f712,plain,(
27.62/27.78	  ( ! [X1:uni] : (size1(tb2t2(sK19(tree,X1,get(list(tree),int,t2tb3(sK5),t2tb(sK3))))) = sK3 | distinct(tree,infix_plpl(tree,X1,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) | ~distinct(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | ~distinct(tree,X1)) )),
27.62/27.78	  inference(resolution,[],[f616,f329])).
27.62/27.78	tff(f713,plain,(
27.62/27.78	  ( ! [X0:uni] : (size1(tb2t2(sK19(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X0))) = sK3 | distinct(tree,infix_plpl(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X0)) | ~distinct(tree,X0)) )),
27.62/27.78	  inference(global_subsumption,[],[f231,f711])).
27.62/27.78	tff(f714,plain,(
27.62/27.78	  ( ! [X1:uni] : (size1(tb2t2(sK19(tree,X1,get(list(tree),int,t2tb3(sK5),t2tb(sK3))))) = sK3 | distinct(tree,infix_plpl(tree,X1,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) | ~distinct(tree,X1)) )),
27.62/27.78	  inference(global_subsumption,[],[f231,f712])).
27.62/27.78	tff(f715,plain,(
27.62/27.78	  ( ! [X0:$int] : (sK0 != X0 | $less($sum($difference(sK3,1),$uminus(sK6)),$sum(X0,1))) )),
27.62/27.78	  inference(equality_resolution,[],[f666])).
27.62/27.78	tff(f720,plain,(
27.62/27.78	  spl22_40 <=> tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = sK1),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_40])])).
27.62/27.78	tff(f721,plain,(
27.62/27.78	  tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = sK1 | ~spl22_40),
27.62/27.78	  inference(avatar_component_clause,[],[f720])).
27.62/27.78	tff(f722,plain,(
27.62/27.78	  spl22_40),
27.62/27.78	  inference(avatar_split_clause,[],[f213,f720])).
27.62/27.78	tff(f723,plain,(
27.62/27.78	  $less($sum($difference(sK3,1),$uminus(sK6)),$sum(sK0,1))),
27.62/27.78	  inference(equality_resolution,[],[f715])).
27.62/27.78	tff(f728,plain,(
27.62/27.78	  spl22_42 <=> $less($sum($difference(sK3,1),$uminus(sK6)),$sum(sK0,1))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_42])])).
27.62/27.78	tff(f730,plain,(
27.62/27.78	  spl22_42),
27.62/27.78	  inference(avatar_split_clause,[],[f723,f728])).
27.62/27.78	tff(f735,plain,(
27.62/27.78	  spl22_45 <=> ~sort1(list(tree),nil(tree))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_45])])).
27.62/27.78	tff(f736,plain,(
27.62/27.78	  ~sort1(list(tree),nil(tree)) | ~spl22_45),
27.62/27.78	  inference(avatar_component_clause,[],[f735])).
27.62/27.78	tff(f741,plain,(
27.62/27.78	  spl22_46 <=> nil(tree) = get(list(tree),int,t2tb3(sK4),t2tb(sK3))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_46])])).
27.62/27.78	tff(f743,plain,(
27.62/27.78	  ~spl22_45 | spl22_46 | ~spl22_38),
27.62/27.78	  inference(avatar_split_clause,[],[f638,f634,f741,f735])).
27.62/27.78	tff(f745,plain,(
27.62/27.78	  spl22_48 <=> size1(sK9) = sK3),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_48])])).
27.62/27.78	tff(f746,plain,(
27.62/27.78	  size1(sK9) = sK3 | ~spl22_48),
27.62/27.78	  inference(avatar_component_clause,[],[f745])).
27.62/27.78	tff(f748,plain,(
27.62/27.78	  spl22_49 <=> size1(sK9) != sK3),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_49])])).
27.62/27.78	tff(f751,plain,(
27.62/27.78	  spl22_50 <=> ! [X11 : tree1,X13 : $int,X10 : tree1,X12 : $int] : (node1(X10,X11) != sK9 | ~$less(X12,$sum(X13,1)) | sK6 != X13 | size1(X10) != X12)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_50])])).
27.62/27.78	tff(f752,plain,(
27.62/27.78	  ( ! [X12:$int,X10:tree1,X13:$int,X11:tree1] : (node1(X10,X11) != sK9 | ~$less(X12,$sum(X13,1)) | sK6 != X13 | size1(X10) != X12) ) | ~spl22_50),
27.62/27.78	  inference(avatar_component_clause,[],[f751])).
27.62/27.78	tff(f753,plain,(
27.62/27.78	  ~spl22_49 | spl22_50),
27.62/27.78	  inference(avatar_split_clause,[],[f366,f751,f748])).
27.62/27.78	tff(f754,plain,(
27.62/27.78	  $false | ~spl22_45),
27.62/27.78	  inference(resolution,[],[f736,f273])).
27.62/27.78	tff(f755,plain,(
27.62/27.78	  spl22_45),
27.62/27.78	  inference(avatar_contradiction_clause,[],[f754])).
27.62/27.78	tff(f757,plain,(
27.62/27.78	  set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree))) = t2tb3(sK1) | ~spl22_40),
27.62/27.78	  inference(superposition,[],[f269,f721])).
27.62/27.78	tff(f764,plain,(
27.62/27.78	  spl22_52 <=> tb2t3(set(list(tree),int,t2tb3(sK5),t2tb(sK3),infix_plpl(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3))))) = sK8),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_52])])).
27.62/27.78	tff(f765,plain,(
27.62/27.78	  tb2t3(set(list(tree),int,t2tb3(sK5),t2tb(sK3),infix_plpl(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3))))) = sK8 | ~spl22_52),
27.62/27.78	  inference(avatar_component_clause,[],[f764])).
27.62/27.78	tff(f766,plain,(
27.62/27.78	  spl22_52),
27.62/27.78	  inference(avatar_split_clause,[],[f251,f764])).
27.62/27.78	tff(f796,plain,(
27.62/27.78	  ( ! [X0:$int,X1:tree1] : (sK6 != X0 | $less(size1(sK12(X1)),X0) | ~mem(tree,t2tb2(X1),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) )),
27.62/27.78	  inference(equality_resolution,[],[f384])).
27.62/27.78	tff(f812,plain,(
27.62/27.78	  set(list(tree),int,t2tb3(sK5),t2tb(sK3),infix_plpl(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) = t2tb3(sK8) | ~spl22_52),
27.62/27.78	  inference(superposition,[],[f269,f765])).
27.62/27.78	tff(f846,plain,(
27.62/27.78	  ( ! [X2:tree1,X0:$int,X1:$int] : (sK6 != X1 | sK3 != X0 | size1(sK11(X2)) = $sum($difference(X0,1),$uminus(X1)) | ~mem(tree,t2tb2(X2),t2tb1(sK7))) )),
27.62/27.78	  inference(equality_resolution,[],[f371])).
27.62/27.78	tff(f883,plain,(
27.62/27.78	  ( ! [X2:$int,X0:tree1,X3:tree1,X1:$int] : (size1(X0) != $sum($difference(X1,1),$uminus(X2)) | sK3 != X1 | sK6 != X2 | mem(tree,t2tb2(node1(X3,X0)),t2tb1(sK7)) | size1(X3) != sK6) )),
27.62/27.78	  inference(equality_resolution,[],[f370])).
27.62/27.78	tff(f895,plain,(
27.62/27.78	  ( ! [X4:$int,X5:$int,X3:tree1] : (size1(node_proj_11(X3)) != X4 | size1(X3) != sK3 | sK6 != X5 | ~$less(X4,X5) | mem(tree,t2tb2(node1(node_proj_11(X3),node_proj_21(X3))),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | empty1 = X3) )),
27.62/27.78	  inference(superposition,[],[f383,f279])).
27.62/27.78	tff(f899,plain,(
27.62/27.78	  ( ! [X17:$int,X15:tree1,X16:$int] : (size1(sK10(X15)) != X16 | size1(X15) != sK3 | sK6 != X17 | ~$less(X16,X17) | mem(tree,t2tb2(node1(sK10(X15),sK11(X15))),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | ~mem(tree,t2tb2(X15),t2tb1(sK7))) )),
27.62/27.78	  inference(superposition,[],[f383,f244])).
27.62/27.78	tff(f912,plain,(
27.62/27.78	  ( ! [X0:tree1] : (~mem(tree,t2tb2(X0),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | $less(size1(sK12(X0)),sK6)) )),
27.62/27.78	  inference(equality_resolution,[],[f796])).
27.62/27.78	tff(f913,plain,(
27.62/27.78	  ( ! [X0:uni] : (~mem(tree,X0,get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | $less(size1(sK12(tb2t2(X0))),sK6)) )),
27.62/27.78	  inference(superposition,[],[f912,f270])).
27.62/27.78	tff(f977,plain,(
27.62/27.78	  spl22_54 <=> set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree))) = t2tb3(sK1)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_54])])).
27.62/27.78	tff(f978,plain,(
27.62/27.78	  set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree))) = t2tb3(sK1) | ~spl22_54),
27.62/27.78	  inference(avatar_component_clause,[],[f977])).
27.62/27.78	tff(f979,plain,(
27.62/27.78	  spl22_54 | ~spl22_40),
27.62/27.78	  inference(avatar_split_clause,[],[f757,f720,f977])).
27.62/27.78	tff(f1033,plain,(
27.62/27.78	  cons(tree,t2tb2(empty1),nil(tree)) = get(list(tree),int,t2tb3(sK1),t2tb(0)) | ~sort1(list(tree),cons(tree,t2tb2(empty1),nil(tree))) | ~spl22_54),
27.62/27.78	  inference(superposition,[],[f365,f978])).
27.62/27.78	tff(f1034,plain,(
27.62/27.78	  ( ! [X0:uni] : (get(list(tree),int,t2tb3(sK1),X0) = get(list(tree),int,const(list(tree),int,nil(tree)),X0) | t2tb(0) = X0 | ~sort1(int,X0) | ~sort1(int,t2tb(0))) ) | ~spl22_54),
27.62/27.78	  inference(superposition,[],[f354,f978])).
27.62/27.78	tff(f1060,plain,(
27.62/27.78	  ( ! [X0:$int,X1:tree1] : (sK3 != X0 | size1(sK11(X1)) = $sum($difference(X0,1),$uminus(sK6)) | ~mem(tree,t2tb2(X1),t2tb1(sK7))) )),
27.62/27.78	  inference(equality_resolution,[],[f846])).
27.62/27.78	tff(f1061,plain,(
27.62/27.78	  ( ! [X0:tree1] : (size1(sK11(X0)) = $sum($difference(sK3,1),$uminus(sK6)) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) )),
27.62/27.78	  inference(equality_resolution,[],[f1060])).
27.62/27.78	tff(f1063,plain,(
27.62/27.78	  ( ! [X1:uni] : (size1(node_proj_21(tb2t2(X1))) = $sum($difference(sK3,1),$uminus(sK6)) | ~mem(tree,t2tb2(tb2t2(X1)),t2tb1(sK7)) | ~mem(tree,X1,t2tb1(sK7))) )),
27.62/27.78	  inference(superposition,[],[f1061,f590])).
27.62/27.78	tff(f1069,plain,(
27.62/27.78	  ( ! [X1:tree1] : (~mem(tree,t2tb2(X1),t2tb1(sK7)) | ~$less(size1(sK11(X1)),0)) ) | ~spl22_37),
27.62/27.78	  inference(superposition,[],[f610,f1061])).
27.62/27.78	tff(f1075,plain,(
27.62/27.78	  ( ! [X1:uni] : (~mem(tree,X1,t2tb1(sK7)) | size1(node_proj_21(tb2t2(X1))) = $sum($difference(sK3,1),$uminus(sK6)) | ~mem(tree,X1,t2tb1(sK7))) )),
27.62/27.78	  inference(forward_demodulation,[],[f1063,f270])).
27.62/27.78	tff(f1076,plain,(
27.62/27.78	  ( ! [X1:uni] : (size1(node_proj_21(tb2t2(X1))) = $sum($difference(sK3,1),$uminus(sK6)) | ~mem(tree,X1,t2tb1(sK7))) )),
27.62/27.78	  inference(duplicate_literal_removal,[],[f1075])).
27.62/27.78	tff(f1088,plain,(
27.62/27.78	  spl22_56 <=> set(list(tree),int,t2tb3(sK5),t2tb(sK3),infix_plpl(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) = t2tb3(sK8)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_56])])).
27.62/27.78	tff(f1089,plain,(
27.62/27.78	  set(list(tree),int,t2tb3(sK5),t2tb(sK3),infix_plpl(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) = t2tb3(sK8) | ~spl22_56),
27.62/27.78	  inference(avatar_component_clause,[],[f1088])).
27.62/27.78	tff(f1090,plain,(
27.62/27.78	  spl22_56 | ~spl22_52),
27.62/27.78	  inference(avatar_split_clause,[],[f812,f764,f1088])).
27.62/27.78	tff(f1108,plain,(
27.62/27.78	  infix_plpl(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) = get(list(tree),int,t2tb3(sK8),t2tb(sK3)) | ~sort1(list(tree),infix_plpl(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) | ~spl22_56),
27.62/27.78	  inference(superposition,[],[f365,f1089])).
27.62/27.78	tff(f1109,plain,(
27.62/27.78	  ( ! [X0:uni] : (get(list(tree),int,t2tb3(sK5),X0) = get(list(tree),int,t2tb3(sK8),X0) | t2tb(sK3) = X0 | ~sort1(int,X0) | ~sort1(int,t2tb(sK3))) ) | ~spl22_56),
27.62/27.78	  inference(superposition,[],[f354,f1089])).
27.62/27.78	tff(f1124,plain,(
27.62/27.78	  ( ! [X2:$int,X0:tree1,X1:$int] : (size1(sK10(X0)) != X1 | size1(X0) != X2 | $sum($sum(1,X1),size1(sK11(X0))) = X2 | ~mem(tree,t2tb2(X0),t2tb1(sK7))) )),
27.62/27.78	  inference(equality_resolution,[],[f571])).
27.62/27.78	tff(f1157,plain,(
27.62/27.78	  ( ! [X0:tree1] : (size1(node_proj_21(X0)) = $sum($difference(sK3,1),$uminus(sK6)) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) )),
27.62/27.78	  inference(superposition,[],[f1076,f271])).
27.62/27.78	tff(f1165,plain,(
27.62/27.78	  ( ! [X6:$int,X5:uni] : ($sum($difference(sK3,1),$uminus(sK6)) != X6 | ~$less(X6,0) | ~mem(tree,X5,t2tb1(sK7))) )),
27.62/27.78	  inference(superposition,[],[f403,f1076])).
27.62/27.78	tff(f1181,plain,(
27.62/27.78	  ( ! [X23:tree1,X21:$int,X22:$int,X20:tree1] : ($sum($difference(X21,1),$uminus(X22)) != sK6 | sK3 != X21 | sK6 != X22 | mem(tree,t2tb2(node1(X23,sK10(X20))),t2tb1(sK7)) | size1(X23) != sK6 | ~all_trees1(size1(X20),sK7)) )),
27.62/27.78	  inference(superposition,[],[f883,f517])).
27.62/27.78	tff(f1183,plain,(
27.62/27.78	  ( ! [X30:$int,X28:uni,X31:tree1,X29:$int] : ($sum($difference(X29,1),$uminus(X30)) != sK6 | sK3 != X29 | sK6 != X30 | mem(tree,t2tb2(node1(X31,sK10(tb2t2(X28)))),t2tb1(sK7)) | size1(X31) != sK6 | ~mem(tree,X28,t2tb1(sK7))) )),
27.62/27.78	  inference(superposition,[],[f883,f518])).
27.62/27.78	tff(f1195,plain,(
27.62/27.78	  ( ! [X0:tree1,X1:tree1] : (size1(X1) = $sum($difference(sK3,1),$uminus(sK6)) | ~mem(tree,t2tb2(node1(X0,X1)),t2tb1(sK7))) )),
27.62/27.78	  inference(superposition,[],[f1157,f285])).
27.62/27.78	tff(f1219,plain,(
27.62/27.78	  spl22_58 <=> ! [X5 : uni] : ~mem(tree,X5,t2tb1(sK7))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_58])])).
27.62/27.78	tff(f1220,plain,(
27.62/27.78	  ( ! [X5:uni] : (~mem(tree,X5,t2tb1(sK7))) ) | ~spl22_58),
27.62/27.78	  inference(avatar_component_clause,[],[f1219])).
27.62/27.78	tff(f1222,plain,(
27.62/27.78	  spl22_60 <=> ! [X6 : $int] : ($sum($difference(sK3,1),$uminus(sK6)) != X6 | ~$less(X6,0))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_60])])).
27.62/27.78	tff(f1224,plain,(
27.62/27.78	  spl22_58 | spl22_60),
27.62/27.78	  inference(avatar_split_clause,[],[f1165,f1222,f1219])).
27.62/27.78	tff(f1230,plain,(
27.62/27.78	  ( ! [X2:$int,X0:tree1,X1:$int] : (sK6 != X1 | size1(X0) != sK3 | sK6 != X2 | ~$less(X1,X2) | mem(tree,t2tb2(node1(node_proj_11(X0),node_proj_21(X0))),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | empty1 = X0 | ~all_trees1(size1(X0),sK7)) )),
27.62/27.78	  inference(superposition,[],[f895,f598])).
27.62/27.78	tff(f1232,plain,(
27.62/27.78	  ( ! [X0:tree1,X1:$int] : (size1(X0) != sK3 | sK6 != X1 | ~$less(size1(node_proj_11(X0)),X1) | mem(tree,t2tb2(node1(node_proj_11(X0),node_proj_21(X0))),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | empty1 = X0) )),
27.62/27.78	  inference(equality_resolution,[],[f895])).
27.62/27.78	tff(f1235,plain,(
27.62/27.78	  ( ! [X2:$int,X0:tree1,X1:$int] : (sK6 != X1 | size1(X0) != sK3 | sK6 != X2 | ~$less(X1,X2) | mem(tree,t2tb2(node1(node_proj_11(X0),node_proj_21(X0))),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | empty1 = X0 | ~all_trees1(sK3,sK7)) )),
27.62/27.78	  inference(inner_rewriting,[],[f1230])).
27.62/27.78	tff(f1251,plain,(
27.62/27.78	  ( ! [X8:tree1,X7:uni,X9:tree1] : (~mem(tree,t2tb2(node1(X9,X8)),t2tb1(sK7)) | size1(X8) = size1(node_proj_21(tb2t2(X7))) | ~mem(tree,X7,t2tb1(sK7))) )),
27.62/27.78	  inference(superposition,[],[f1195,f1076])).
27.62/27.78	tff(f1322,plain,(
27.62/27.78	  spl22_63 <=> ~all_trees1(sK3,sK7)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_63])])).
27.62/27.78	tff(f1325,plain,(
27.62/27.78	  spl22_64 <=> ! [X0 : tree1] : (size1(X0) != sK3 | empty1 = X0 | mem(tree,t2tb2(node1(node_proj_11(X0),node_proj_21(X0))),get(list(tree),int,t2tb3(sK5),t2tb(sK3))))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_64])])).
27.62/27.78	tff(f1328,plain,(
27.62/27.78	  spl22_66 <=> ! [X1 : $int,X2 : $int] : (sK6 != X1 | ~$less(X1,X2) | sK6 != X2)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_66])])).
27.62/27.78	tff(f1329,plain,(
27.62/27.78	  ( ! [X2:$int,X1:$int] : (sK6 != X2 | ~$less(X1,X2) | sK6 != X1) ) | ~spl22_66),
27.62/27.78	  inference(avatar_component_clause,[],[f1328])).
27.62/27.78	tff(f1330,plain,(
27.62/27.78	  ~spl22_63 | spl22_64 | spl22_66),
27.62/27.78	  inference(avatar_split_clause,[],[f1235,f1328,f1325,f1322])).
27.62/27.78	tff(f1441,plain,(
27.62/27.78	  ( ! [X14:$int,X12:uni,X13:$int] : (sK6 != X13 | size1(tb2t2(X12)) != sK3 | sK6 != X14 | ~$less(X13,X14) | mem(tree,t2tb2(node1(sK10(tb2t2(X12)),sK11(tb2t2(X12)))),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | ~mem(tree,t2tb2(tb2t2(X12)),t2tb1(sK7)) | ~mem(tree,X12,t2tb1(sK7))) )),
27.62/27.78	  inference(superposition,[],[f899,f518])).
27.62/27.78	tff(f1461,plain,(
27.62/27.78	  ( ! [X14:$int,X12:uni,X13:$int] : (~mem(tree,X12,t2tb1(sK7)) | sK6 != X13 | size1(tb2t2(X12)) != sK3 | sK6 != X14 | ~$less(X13,X14) | mem(tree,t2tb2(node1(sK10(tb2t2(X12)),sK11(tb2t2(X12)))),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | ~mem(tree,X12,t2tb1(sK7))) )),
27.62/27.78	  inference(forward_demodulation,[],[f1441,f270])).
27.62/27.78	tff(f1462,plain,(
27.62/27.78	  ( ! [X14:$int,X12:uni,X13:$int] : (~mem(tree,X12,t2tb1(sK7)) | sK6 != X13 | size1(tb2t2(X12)) != sK3 | sK6 != X14 | ~$less(X13,X14) | mem(tree,t2tb2(node1(sK10(tb2t2(X12)),sK11(tb2t2(X12)))),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) )),
27.62/27.78	  inference(duplicate_literal_removal,[],[f1461])).
27.62/27.78	tff(f1538,plain,(
27.62/27.78	  spl22_68 <=> ! [X2 : tree1] : (node1(sK14(sK10(X2)),sK15(sK10(X2))) = sK10(X2) | ~all_trees1(size1(X2),sK7))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_68])])).
27.62/27.78	tff(f1541,plain,(
27.62/27.78	  spl22_70 <=> ! [X3 : $int] : (sK6 != X3 | ~$less(0,X3))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_70])])).
27.62/27.78	tff(f1542,plain,(
27.62/27.78	  ( ! [X3:$int] : (sK6 != X3 | ~$less(0,X3)) ) | ~spl22_70),
27.62/27.78	  inference(avatar_component_clause,[],[f1541])).
27.62/27.78	tff(f1543,plain,(
27.62/27.78	  spl22_68 | spl22_70),
27.62/27.78	  inference(avatar_split_clause,[],[f520,f1541,f1538])).
27.62/27.78	tff(f1544,plain,(
27.62/27.78	  ~$less(0,sK6) | ~spl22_70),
27.62/27.78	  inference(equality_resolution,[],[f1542])).
27.62/27.78	tff(f1549,plain,(
27.62/27.78	  spl22_73 <=> ~$less(0,sK6)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_73])])).
27.62/27.78	tff(f1551,plain,(
27.62/27.78	  ~spl22_73 | ~spl22_70),
27.62/27.78	  inference(avatar_split_clause,[],[f1544,f1541,f1549])).
27.62/27.78	tff(f1680,plain,(
27.62/27.78	  spl22_75 <=> ~sort1(list(tree),cons(tree,t2tb2(empty1),nil(tree)))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_75])])).
27.62/27.78	tff(f1681,plain,(
27.62/27.78	  ~sort1(list(tree),cons(tree,t2tb2(empty1),nil(tree))) | ~spl22_75),
27.62/27.78	  inference(avatar_component_clause,[],[f1680])).
27.62/27.78	tff(f1686,plain,(
27.62/27.78	  spl22_76 <=> cons(tree,t2tb2(empty1),nil(tree)) = get(list(tree),int,t2tb3(sK1),t2tb(0))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_76])])).
27.62/27.78	tff(f1688,plain,(
27.62/27.78	  ~spl22_75 | spl22_76 | ~spl22_54),
27.62/27.78	  inference(avatar_split_clause,[],[f1033,f977,f1686,f1680])).
27.62/27.78	tff(f1689,plain,(
27.62/27.78	  $false | ~spl22_75),
27.62/27.78	  inference(resolution,[],[f1681,f320])).
27.62/27.78	tff(f1690,plain,(
27.62/27.78	  spl22_75),
27.62/27.78	  inference(avatar_contradiction_clause,[],[f1689])).
27.62/27.78	tff(f1789,plain,(
27.62/27.78	  ( ! [X0:tree1,X1:$int] : (size1(X0) != X1 | $sum($sum(1,size1(sK10(X0))),size1(sK11(X0))) = X1 | ~mem(tree,t2tb2(X0),t2tb1(sK7))) )),
27.62/27.78	  inference(equality_resolution,[],[f1124])).
27.62/27.78	tff(f1881,plain,(
27.62/27.78	  spl22_79 <=> ~sort1(int,t2tb(sK3))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_79])])).
27.62/27.78	tff(f1882,plain,(
27.62/27.78	  ~sort1(int,t2tb(sK3)) | ~spl22_79),
27.62/27.78	  inference(avatar_component_clause,[],[f1881])).
27.62/27.78	tff(f1884,plain,(
27.62/27.78	  spl22_80 <=> ! [X0 : uni] : (get(list(tree),int,t2tb3(sK2),X0) = get(list(tree),int,t2tb3(sK4),X0) | ~sort1(int,X0) | t2tb(sK3) = X0)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_80])])).
27.62/27.78	tff(f1886,plain,(
27.62/27.78	  ~spl22_79 | spl22_80 | ~spl22_38),
27.62/27.78	  inference(avatar_split_clause,[],[f639,f634,f1884,f1881])).
27.62/27.78	tff(f1887,plain,(
27.62/27.78	  $false | ~spl22_79),
27.62/27.78	  inference(resolution,[],[f1882,f262])).
27.62/27.78	tff(f1888,plain,(
27.62/27.78	  spl22_79),
27.62/27.78	  inference(avatar_contradiction_clause,[],[f1887])).
27.62/27.78	tff(f1896,plain,(
27.62/27.78	  spl22_82 <=> ! [X0 : uni] : (get(list(tree),int,t2tb3(sK5),X0) = get(list(tree),int,t2tb3(sK8),X0) | ~sort1(int,X0) | t2tb(sK3) = X0)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_82])])).
27.62/27.78	tff(f1898,plain,(
27.62/27.78	  ~spl22_79 | spl22_82 | ~spl22_56),
27.62/27.78	  inference(avatar_split_clause,[],[f1109,f1088,f1896,f1881])).
27.62/27.78	tff(f1982,plain,(
27.62/27.78	  spl22_85 <=> ~sort1(int,t2tb(0))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_85])])).
27.62/27.78	tff(f1983,plain,(
27.62/27.78	  ~sort1(int,t2tb(0)) | ~spl22_85),
27.62/27.78	  inference(avatar_component_clause,[],[f1982])).
27.62/27.78	tff(f1985,plain,(
27.62/27.78	  spl22_86 <=> ! [X0 : uni] : (get(list(tree),int,t2tb3(sK1),X0) = get(list(tree),int,const(list(tree),int,nil(tree)),X0) | ~sort1(int,X0) | t2tb(0) = X0)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_86])])).
27.62/27.78	tff(f1986,plain,(
27.62/27.78	  ( ! [X0:uni] : (get(list(tree),int,t2tb3(sK1),X0) = get(list(tree),int,const(list(tree),int,nil(tree)),X0) | ~sort1(int,X0) | t2tb(0) = X0) ) | ~spl22_86),
27.62/27.78	  inference(avatar_component_clause,[],[f1985])).
27.62/27.78	tff(f1987,plain,(
27.62/27.78	  ~spl22_85 | spl22_86 | ~spl22_54),
27.62/27.78	  inference(avatar_split_clause,[],[f1034,f977,f1985,f1982])).
27.62/27.78	tff(f1988,plain,(
27.62/27.78	  $false | ~spl22_85),
27.62/27.78	  inference(resolution,[],[f1983,f262])).
27.62/27.78	tff(f1989,plain,(
27.62/27.78	  spl22_85),
27.62/27.78	  inference(avatar_contradiction_clause,[],[f1988])).
27.62/27.78	tff(f2043,plain,(
27.62/27.78	  ( ! [X1:uni] : (nil(tree) = get(list(tree),int,t2tb3(sK1),X1) | ~sort1(int,X1) | t2tb(0) = X1 | ~sort1(list(tree),nil(tree))) ) | ~spl22_86),
27.62/27.78	  inference(superposition,[],[f1986,f347])).
27.62/27.78	tff(f2096,plain,(
27.62/27.78	  ( ! [X4:$int,X2:uni,X5:tree1,X3:$int] : ($sum($difference(X3,1),$uminus(X4)) != sK3 | sK3 != X3 | sK6 != X4 | mem(tree,t2tb2(node1(X5,tb2t2(sK19(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X2)))),t2tb1(sK7)) | size1(X5) != sK6 | distinct(tree,infix_plpl(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X2)) | ~distinct(tree,X2)) )),
27.62/27.78	  inference(superposition,[],[f883,f713])).
27.62/27.78	tff(f2098,plain,(
27.62/27.78	  ( ! [X8:uni,X9:$int] : (sK3 != X9 | node1(sK14(tb2t2(sK19(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X8))),sK15(tb2t2(sK19(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X8)))) = tb2t2(sK19(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X8)) | ~$less(0,X9) | distinct(tree,infix_plpl(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X8)) | ~distinct(tree,X8)) )),
27.62/27.78	  inference(superposition,[],[f407,f713])).
27.62/27.78	tff(f2133,plain,(
27.62/27.78	  ( ! [X2:tree1,X0:tree1,X1:uni] : (size1(X0) = size1(node_proj_21(tb2t2(X1))) | ~mem(tree,X1,t2tb1(sK7)) | ~all_trees1(size1(node1(X2,X0)),sK7)) )),
27.62/27.78	  inference(resolution,[],[f1251,f363])).
27.62/27.78	tff(f2309,plain,(
27.62/27.78	  ( ! [X12:$int,X11:uni] : (sK3 != X12 | node1(sK14(tb2t2(sK19(tree,X11,get(list(tree),int,t2tb3(sK5),t2tb(sK3))))),sK15(tb2t2(sK19(tree,X11,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))))) = tb2t2(sK19(tree,X11,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) | ~$less(0,X12) | distinct(tree,infix_plpl(tree,X11,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) | ~distinct(tree,X11)) )),
27.62/27.78	  inference(superposition,[],[f407,f714])).
27.62/27.78	tff(f2311,plain,(
27.62/27.78	  spl22_88 <=> ! [X20 : tree1,X23 : tree1] : (mem(tree,t2tb2(node1(X23,sK10(X20))),t2tb1(sK7)) | ~all_trees1(size1(X20),sK7) | size1(X23) != sK6)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_88])])).
27.62/27.78	tff(f2314,plain,(
27.62/27.78	  spl22_90 <=> ! [X22 : $int,X21 : $int] : ($sum($difference(X21,1),$uminus(X22)) != sK6 | sK6 != X22 | sK3 != X21)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_90])])).
27.62/27.78	tff(f2315,plain,(
27.62/27.78	  ( ! [X21:$int,X22:$int] : ($sum($difference(X21,1),$uminus(X22)) != sK6 | sK6 != X22 | sK3 != X21) ) | ~spl22_90),
27.62/27.78	  inference(avatar_component_clause,[],[f2314])).
27.62/27.78	tff(f2316,plain,(
27.62/27.78	  spl22_88 | spl22_90),
27.62/27.78	  inference(avatar_split_clause,[],[f1181,f2314,f2311])).
27.62/27.78	tff(f2319,plain,(
27.62/27.78	  ( ! [X3:uni] : (size1(node_proj_21(tb2t2(X3))) != sK6 | sK6 != sK6 | sK3 != sK3 | ~mem(tree,X3,t2tb1(sK7))) ) | ~spl22_90),
27.62/27.78	  inference(superposition,[],[f2315,f1076])).
27.62/27.78	tff(f2322,plain,(
27.62/27.78	  ( ! [X3:uni] : (size1(node_proj_21(tb2t2(X3))) != sK6 | ~mem(tree,X3,t2tb1(sK7))) ) | ~spl22_90),
27.62/27.78	  inference(trivial_inequality_removal,[],[f2319])).
27.62/27.78	tff(f2342,plain,(
27.62/27.78	  ( ! [X2:tree1,X0:uni,X1:tree1] : (size1(X1) != sK6 | ~mem(tree,X0,t2tb1(sK7)) | ~mem(tree,X0,t2tb1(sK7)) | ~all_trees1(size1(node1(X2,X1)),sK7)) ) | ~spl22_90),
27.62/27.78	  inference(superposition,[],[f2322,f2133])).
27.62/27.78	tff(f2347,plain,(
27.62/27.78	  ( ! [X11:uni] : ($sum($difference(sK3,1),$uminus(sK6)) != sK6 | ~mem(tree,X11,t2tb1(sK7)) | ~mem(tree,X11,t2tb1(sK7))) ) | ~spl22_90),
27.62/27.78	  inference(superposition,[],[f2322,f1076])).
27.62/27.78	tff(f2355,plain,(
27.62/27.78	  ( ! [X11:uni] : ($sum($difference(sK3,1),$uminus(sK6)) != sK6 | ~mem(tree,X11,t2tb1(sK7))) ) | ~spl22_90),
27.62/27.78	  inference(duplicate_literal_removal,[],[f2347])).
27.62/27.78	tff(f2360,plain,(
27.62/27.78	  ( ! [X2:tree1,X0:uni,X1:tree1] : (size1(X1) != sK6 | ~mem(tree,X0,t2tb1(sK7)) | ~all_trees1(size1(node1(X2,X1)),sK7)) ) | ~spl22_90),
27.62/27.78	  inference(duplicate_literal_removal,[],[f2342])).
27.62/27.78	tff(f2369,plain,(
27.62/27.78	  ( ! [X8:$int,X7:tree1] : (sK3 != sK6 | sK6 != X8 | ~$less(size1(node_proj_11(node_proj_11(X7))),X8) | mem(tree,t2tb2(node1(node_proj_11(node_proj_11(X7)),node_proj_21(node_proj_11(X7)))),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | empty1 = node_proj_11(X7) | ~all_trees1(size1(X7),sK7)) )),
27.62/27.78	  inference(superposition,[],[f1232,f598])).
27.62/27.78	tff(f2405,plain,(
27.62/27.78	  ( ! [X8:$int,X7:tree1] : (sK3 != sK6 | sK3 != X8 | ~$less(size1(node_proj_11(node_proj_11(X7))),X8) | mem(tree,t2tb2(node1(node_proj_11(node_proj_11(X7)),node_proj_21(node_proj_11(X7)))),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | empty1 = node_proj_11(X7) | ~all_trees1(size1(X7),sK7)) )),
27.62/27.78	  inference(inner_rewriting,[],[f2369])).
27.62/27.78	tff(f2473,plain,(
27.62/27.78	  spl22_92 <=> ! [X7 : tree1,X8 : $int] : (sK3 != X8 | ~all_trees1(size1(X7),sK7) | empty1 = node_proj_11(X7) | mem(tree,t2tb2(node1(node_proj_11(node_proj_11(X7)),node_proj_21(node_proj_11(X7)))),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | ~$less(size1(node_proj_11(node_proj_11(X7))),X8))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_92])])).
27.62/27.78	tff(f2479,plain,(
27.62/27.78	  spl22_95 <=> sK3 != sK6),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_95])])).
27.62/27.78	tff(f2481,plain,(
27.62/27.78	  spl22_92 | ~spl22_95),
27.62/27.78	  inference(avatar_split_clause,[],[f2405,f2479,f2473])).
27.62/27.78	tff(f2486,plain,(
27.62/27.78	  spl22_97 <=> $sum($difference(sK3,1),$uminus(sK6)) != sK6),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_97])])).
27.62/27.78	tff(f2487,plain,(
27.62/27.78	  $sum($difference(sK3,1),$uminus(sK6)) != sK6 | ~spl22_97),
27.62/27.78	  inference(avatar_component_clause,[],[f2486])).
27.62/27.78	tff(f2488,plain,(
27.62/27.78	  spl22_58 | ~spl22_97 | ~spl22_90),
27.62/27.78	  inference(avatar_split_clause,[],[f2355,f2314,f2486,f1219])).
27.62/27.78	tff(f2489,plain,(
27.62/27.78	  ( ! [X0:tree1,X1:tree1] : (size1(X0) != sK6 | ~mem(tree,t2tb2(node1(X1,X0)),t2tb1(sK7))) ) | ~spl22_97),
27.62/27.78	  inference(superposition,[],[f2487,f1195])).
27.62/27.78	tff(f2571,plain,(
27.62/27.78	  spl22_98 <=> ! [X3 : uni] : (node1(sK14(sK10(tb2t2(X3))),sK15(sK10(tb2t2(X3)))) = sK10(tb2t2(X3)) | ~mem(tree,X3,t2tb1(sK7)))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_98])])).
27.62/27.78	tff(f2573,plain,(
27.62/27.78	  spl22_98 | spl22_70),
27.62/27.78	  inference(avatar_split_clause,[],[f550,f1541,f2571])).
27.62/27.78	tff(f2574,plain,(
27.62/27.78	  ~spl22_73 | ~spl22_70),
27.62/27.78	  inference(avatar_split_clause,[],[f1544,f1541,f1549])).
27.62/27.78	tff(f2676,plain,(
27.62/27.78	  spl22_101 <=> ~sort1(list(tree),infix_plpl(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3))))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_101])])).
27.62/27.78	tff(f2677,plain,(
27.62/27.78	  ~sort1(list(tree),infix_plpl(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) | ~spl22_101),
27.62/27.78	  inference(avatar_component_clause,[],[f2676])).
27.62/27.78	tff(f2682,plain,(
27.62/27.78	  spl22_102 <=> infix_plpl(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) = get(list(tree),int,t2tb3(sK8),t2tb(sK3))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_102])])).
27.62/27.78	tff(f2683,plain,(
27.62/27.78	  infix_plpl(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) = get(list(tree),int,t2tb3(sK8),t2tb(sK3)) | ~spl22_102),
27.62/27.78	  inference(avatar_component_clause,[],[f2682])).
27.62/27.78	tff(f2684,plain,(
27.62/27.78	  ~spl22_101 | spl22_102 | ~spl22_56),
27.62/27.78	  inference(avatar_split_clause,[],[f1108,f1088,f2682,f2676])).
27.62/27.78	tff(f2685,plain,(
27.62/27.78	  $false | ~spl22_101),
27.62/27.78	  inference(resolution,[],[f2677,f318])).
27.62/27.78	tff(f2686,plain,(
27.62/27.78	  spl22_101),
27.62/27.78	  inference(avatar_contradiction_clause,[],[f2685])).
27.62/27.78	tff(f2701,plain,(
27.62/27.78	  set(list(tree),int,t2tb3(sK5),t2tb(sK3),get(list(tree),int,t2tb3(sK8),t2tb(sK3))) = t2tb3(sK8) | (~spl22_56 | ~spl22_102)),
27.62/27.78	  inference(backward_demodulation,[],[f2683,f1089])).
27.62/27.78	tff(f2703,plain,(
27.62/27.78	  distinct(tree,get(list(tree),int,t2tb3(sK8),t2tb(sK3))) | sort1(tree,sK19(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) | ~distinct(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | ~distinct(tree,t2tb1(sK7)) | ~spl22_102),
27.62/27.78	  inference(superposition,[],[f327,f2683])).
27.62/27.78	tff(f2707,plain,(
27.62/27.78	  ( ! [X3:uni] : (~mem(tree,X3,get(list(tree),int,t2tb3(sK8),t2tb(sK3))) | mem(tree,X3,get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | mem(tree,X3,t2tb1(sK7))) ) | ~spl22_102),
27.62/27.78	  inference(superposition,[],[f350,f2683])).
27.62/27.78	tff(f2728,plain,(
27.62/27.78	  spl22_104 <=> set(list(tree),int,t2tb3(sK5),t2tb(sK3),get(list(tree),int,t2tb3(sK8),t2tb(sK3))) = t2tb3(sK8)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_104])])).
27.62/27.78	tff(f2730,plain,(
27.62/27.78	  spl22_104 | ~spl22_56 | ~spl22_102),
27.62/27.78	  inference(avatar_split_clause,[],[f2701,f2682,f1088,f2728])).
27.62/27.78	tff(f2755,plain,(
27.62/27.78	  spl22_106 <=> ! [X1 : tree1,X2 : tree1] : (size1(X1) != sK6 | ~all_trees1(size1(node1(X2,X1)),sK7))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_106])])).
27.62/27.78	tff(f2757,plain,(
27.62/27.78	  spl22_58 | spl22_106 | ~spl22_90),
27.62/27.78	  inference(avatar_split_clause,[],[f2360,f2314,f2755,f1219])).
27.62/27.78	tff(f2759,plain,(
27.62/27.78	  ( ! [X1:uni] : (distinct(tree,infix_plpl(tree,t2tb1(sK7),X1)) | ~distinct(tree,X1) | ~distinct(tree,t2tb1(sK7))) ) | ~spl22_58),
27.62/27.78	  inference(resolution,[],[f1220,f328])).
27.62/27.78	tff(f2801,plain,(
27.62/27.78	  spl22_108 <=> ! [X1 : uni] : (distinct(tree,infix_plpl(tree,t2tb1(sK7),X1)) | ~distinct(tree,X1))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_108])])).
27.62/27.78	tff(f2803,plain,(
27.62/27.78	  ~spl22_1 | spl22_108 | ~spl22_58),
27.62/27.78	  inference(avatar_split_clause,[],[f2759,f1219,f2801,f432])).
27.62/27.78	tff(f2953,plain,(
27.62/27.78	  spl22_110 <=> ! [X31 : tree1,X28 : uni] : (mem(tree,t2tb2(node1(X31,sK10(tb2t2(X28)))),t2tb1(sK7)) | ~mem(tree,X28,t2tb1(sK7)) | size1(X31) != sK6)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_110])])).
27.62/27.78	tff(f2955,plain,(
27.62/27.78	  spl22_110 | spl22_90),
27.62/27.78	  inference(avatar_split_clause,[],[f1183,f2314,f2953])).
27.62/27.78	tff(f3089,plain,(
27.62/27.78	  spl22_112 <=> ! [X12 : uni] : (~mem(tree,X12,t2tb1(sK7)) | mem(tree,t2tb2(node1(sK10(tb2t2(X12)),sK11(tb2t2(X12)))),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | size1(tb2t2(X12)) != sK3)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_112])])).
27.62/27.78	tff(f3091,plain,(
27.62/27.78	  spl22_66 | spl22_112),
27.62/27.78	  inference(avatar_split_clause,[],[f1462,f3089,f1328])).
27.62/27.78	tff(f3092,plain,(
27.62/27.78	  ( ! [X0:$int] : (sK6 != X0 | ~$less(X0,sK6)) ) | ~spl22_66),
27.62/27.78	  inference(equality_resolution,[],[f1329])).
27.62/27.78	tff(f3093,plain,(
27.62/27.78	  ~$less(sK6,sK6) | ~spl22_66),
27.62/27.78	  inference(equality_resolution,[],[f3092])).
27.62/27.78	tff(f3098,plain,(
27.62/27.78	  spl22_115 <=> ~$less(sK6,sK6)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_115])])).
27.62/27.78	tff(f3100,plain,(
27.62/27.78	  ~spl22_115 | ~spl22_66),
27.62/27.78	  inference(avatar_split_clause,[],[f3093,f1328,f3098])).
27.62/27.78	tff(f3227,plain,(
27.62/27.78	  ( ! [X0:tree1] : (size1(X0) = $sum($sum(1,size1(sK10(X0))),size1(sK11(X0))) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) )),
27.62/27.78	  inference(equality_resolution,[],[f1789])).
27.62/27.78	tff(f3251,plain,(
27.62/27.78	  spl22_116 <=> ! [X1 : uni] : (nil(tree) = get(list(tree),int,t2tb3(sK1),X1) | t2tb(0) = X1 | ~sort1(int,X1))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_116])])).
27.62/27.78	tff(f3253,plain,(
27.62/27.78	  ~spl22_45 | spl22_116 | ~spl22_86),
27.62/27.78	  inference(avatar_split_clause,[],[f2043,f1985,f3251,f735])).
27.62/27.78	tff(f3473,plain,(
27.62/27.78	  mem(tree,t2tb2(sK9),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_28 | ~spl22_102)),
27.62/27.78	  inference(resolution,[],[f2707,f556])).
27.62/27.78	tff(f3603,plain,(
27.62/27.78	  spl22_118 <=> sort1(tree,sK19(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3))))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_118])])).
27.62/27.78	tff(f3609,plain,(
27.62/27.78	  spl22_120 <=> distinct(tree,get(list(tree),int,t2tb3(sK8),t2tb(sK3)))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_120])])).
27.62/27.78	tff(f3611,plain,(
27.62/27.78	  ~spl22_1 | ~spl22_17 | spl22_118 | spl22_120 | ~spl22_102),
27.62/27.78	  inference(avatar_split_clause,[],[f2703,f2682,f3609,f3603,f497,f432])).
27.62/27.78	tff(f3627,plain,(
27.62/27.78	  ( ! [X4:uni] : (size1(tb2t2(X4)) = $sum($sum(1,sK6),size1(sK11(tb2t2(X4)))) | ~mem(tree,t2tb2(tb2t2(X4)),t2tb1(sK7)) | ~mem(tree,X4,t2tb1(sK7))) )),
27.62/27.78	  inference(superposition,[],[f3227,f518])).
27.62/27.78	tff(f3659,plain,(
27.62/27.78	  ( ! [X4:uni] : (~mem(tree,X4,t2tb1(sK7)) | size1(tb2t2(X4)) = $sum($sum(1,sK6),size1(sK11(tb2t2(X4)))) | ~mem(tree,X4,t2tb1(sK7))) )),
27.62/27.78	  inference(forward_demodulation,[],[f3627,f270])).
27.62/27.78	tff(f3660,plain,(
27.62/27.78	  ( ! [X4:uni] : (size1(tb2t2(X4)) = $sum($sum(1,sK6),size1(sK11(tb2t2(X4)))) | ~mem(tree,X4,t2tb1(sK7))) )),
27.62/27.78	  inference(duplicate_literal_removal,[],[f3659])).
27.62/27.78	tff(f3671,plain,(
27.62/27.78	  ( ! [X8:uni] : (size1(tb2t2(X8)) = $sum($sum(1,sK6),$sum($difference(sK3,1),$uminus(sK6))) | ~mem(tree,X8,t2tb1(sK7)) | ~mem(tree,t2tb2(tb2t2(X8)),t2tb1(sK7))) )),
27.62/27.78	  inference(superposition,[],[f3660,f1061])).
27.62/27.78	tff(f3684,plain,(
27.62/27.78	  ( ! [X8:uni] : (~mem(tree,X8,t2tb1(sK7)) | size1(tb2t2(X8)) = $sum($sum(1,sK6),$sum($difference(sK3,1),$uminus(sK6))) | ~mem(tree,X8,t2tb1(sK7))) )),
27.62/27.78	  inference(forward_demodulation,[],[f3671,f270])).
27.62/27.78	tff(f3685,plain,(
27.62/27.78	  ( ! [X8:uni] : (size1(tb2t2(X8)) = $sum($sum(1,sK6),$sum($difference(sK3,1),$uminus(sK6))) | ~mem(tree,X8,t2tb1(sK7))) )),
27.62/27.78	  inference(duplicate_literal_removal,[],[f3684])).
27.62/27.78	tff(f3782,plain,(
27.62/27.78	  spl22_123 <=> ~mem(tree,t2tb2(sK9),t2tb1(sK7))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_123])])).
27.62/27.78	tff(f3783,plain,(
27.62/27.78	  ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | ~spl22_123),
27.62/27.78	  inference(avatar_component_clause,[],[f3782])).
27.62/27.78	tff(f3785,plain,(
27.62/27.78	  spl22_122 <=> mem(tree,t2tb2(sK9),t2tb1(sK7))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_122])])).
27.62/27.78	tff(f3786,plain,(
27.62/27.78	  mem(tree,t2tb2(sK9),t2tb1(sK7)) | ~spl22_122),
27.62/27.78	  inference(avatar_component_clause,[],[f3785])).
27.62/27.78	tff(f3791,plain,(
27.62/27.78	  spl22_124 <=> mem(tree,t2tb2(sK9),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_124])])).
27.62/27.78	tff(f3792,plain,(
27.62/27.78	  mem(tree,t2tb2(sK9),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | ~spl22_124),
27.62/27.78	  inference(avatar_component_clause,[],[f3791])).
27.62/27.78	tff(f3793,plain,(
27.62/27.78	  spl22_122 | spl22_124 | ~spl22_28 | ~spl22_102),
27.62/27.78	  inference(avatar_split_clause,[],[f3473,f2682,f555,f3791,f3785])).
27.62/27.78	tff(f3795,plain,(
27.62/27.78	  ~$less(size1(sK11(sK9)),0) | (~spl22_37 | ~spl22_122)),
27.62/27.78	  inference(resolution,[],[f3786,f1069])).
27.62/27.78	tff(f3796,plain,(
27.62/27.78	  size1(node_proj_11(sK9)) = sK6 | ~spl22_122),
27.62/27.78	  inference(resolution,[],[f3786,f624])).
27.62/27.78	tff(f3797,plain,(
27.62/27.78	  node_proj_11(sK9) = sK10(sK9) | ~spl22_122),
27.62/27.78	  inference(resolution,[],[f3786,f567])).
27.62/27.78	tff(f3798,plain,(
27.62/27.78	  node_proj_21(sK9) = sK11(sK9) | ~spl22_122),
27.62/27.78	  inference(resolution,[],[f3786,f566])).
27.62/27.78	tff(f3805,plain,(
27.62/27.78	  spl22_127 <=> ~$less(size1(sK11(sK9)),0)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_127])])).
27.62/27.78	tff(f3806,plain,(
27.62/27.78	  ~$less(size1(sK11(sK9)),0) | ~spl22_127),
27.62/27.78	  inference(avatar_component_clause,[],[f3805])).
27.62/27.78	tff(f3807,plain,(
27.62/27.78	  ~spl22_127 | spl22_37 | ~spl22_122),
27.62/27.78	  inference(avatar_split_clause,[],[f3795,f3785,f609,f3805])).
27.62/27.78	tff(f3812,plain,(
27.62/27.78	  spl22_128 <=> size1(node_proj_11(sK9)) = sK6),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_128])])).
27.62/27.78	tff(f3813,plain,(
27.62/27.78	  size1(node_proj_11(sK9)) = sK6 | ~spl22_128),
27.62/27.78	  inference(avatar_component_clause,[],[f3812])).
27.62/27.78	tff(f3814,plain,(
27.62/27.78	  spl22_128 | ~spl22_122),
27.62/27.78	  inference(avatar_split_clause,[],[f3796,f3785,f3812])).
27.62/27.78	tff(f3824,plain,(
27.62/27.78	  ~all_trees1(size1(sK9),sK7) | ~spl22_123),
27.62/27.78	  inference(resolution,[],[f3783,f363])).
27.62/27.78	tff(f3829,plain,(
27.62/27.78	  spl22_131 <=> ~all_trees1(size1(sK9),sK7)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_131])])).
27.62/27.78	tff(f3831,plain,(
27.62/27.78	  ~spl22_131 | spl22_123),
27.62/27.78	  inference(avatar_split_clause,[],[f3824,f3782,f3829])).
27.62/27.78	tff(f3839,plain,(
27.62/27.78	  $less(size1(sK12(sK9)),sK6) | ~spl22_124),
27.62/27.78	  inference(resolution,[],[f3792,f912])).
27.62/27.78	tff(f3840,plain,(
27.62/27.78	  node1(sK12(sK9),sK13(sK9)) = sK9 | ~spl22_124),
27.62/27.78	  inference(resolution,[],[f3792,f229])).
27.62/27.78	tff(f3841,plain,(
27.62/27.78	  size1(sK9) = sK3 | ~spl22_124),
27.62/27.78	  inference(resolution,[],[f3792,f227])).
27.62/27.78	tff(f3843,plain,(
27.62/27.78	  node1(sK12(tb2t2(t2tb2(sK9))),sK13(tb2t2(t2tb2(sK9)))) = tb2t2(t2tb2(sK9)) | ~spl22_124),
27.62/27.78	  inference(resolution,[],[f3792,f637])).
27.62/27.78	tff(f3844,plain,(
27.62/27.78	  $less(size1(sK12(tb2t2(t2tb2(sK9)))),sK6) | ~spl22_124),
27.62/27.78	  inference(resolution,[],[f3792,f913])).
27.62/27.78	tff(f3846,plain,(
27.62/27.78	  node1(sK12(sK9),sK13(sK9)) = sK9 | ~spl22_124),
27.62/27.78	  inference(forward_demodulation,[],[f3843,f271])).
27.62/27.78	tff(f3847,plain,(
27.62/27.78	  $less(size1(sK12(sK9)),sK6) | ~spl22_124),
27.62/27.78	  inference(forward_demodulation,[],[f3844,f271])).
27.62/27.78	tff(f3850,plain,(
27.62/27.78	  spl22_48 | ~spl22_124),
27.62/27.78	  inference(avatar_split_clause,[],[f3841,f3791,f745])).
27.62/27.78	tff(f3851,plain,(
27.62/27.78	  spl22_128 | ~spl22_122),
27.62/27.78	  inference(avatar_split_clause,[],[f3796,f3785,f3812])).
27.62/27.78	tff(f3871,plain,(
27.62/27.78	  spl22_132 <=> node_proj_11(sK9) = sK10(sK9)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_132])])).
27.62/27.78	tff(f3873,plain,(
27.62/27.78	  spl22_132 | ~spl22_122),
27.62/27.78	  inference(avatar_split_clause,[],[f3797,f3785,f3871])).
27.62/27.78	tff(f3876,plain,(
27.62/27.78	  ( ! [X1:$int] : (sK3 != X1 | node1(sK14(sK9),sK15(sK9)) = sK9 | ~$less(0,X1)) ) | ~spl22_48),
27.62/27.78	  inference(superposition,[],[f407,f746])).
27.62/27.78	tff(f3888,plain,(
27.62/27.78	  ( ! [X12:$int,X10:uni,X11:$int] : (tb2t2(X10) != sK9 | ~$less(X11,$sum(X12,1)) | sK6 != X12 | size1(node_proj_11(tb2t2(X10))) != X11 | ~mem(tree,X10,t2tb1(sK7))) ) | ~spl22_50),
27.62/27.78	  inference(superposition,[],[f752,f651])).
27.62/27.78	tff(f3899,plain,(
27.62/27.78	  ( ! [X12:$int,X10:uni,X11:$int] : (tb2t2(X10) != sK9 | ~$less(X11,$sum(X12,1)) | sK6 != X12 | size1(node_proj_11(sK9)) != X11 | ~mem(tree,X10,t2tb1(sK7))) ) | ~spl22_50),
27.62/27.78	  inference(inner_rewriting,[],[f3888])).
27.62/27.78	tff(f3921,plain,(
27.62/27.78	  spl22_134 <=> $less(size1(sK12(sK9)),sK6)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_134])])).
27.62/27.78	tff(f3922,plain,(
27.62/27.78	  $less(size1(sK12(sK9)),sK6) | ~spl22_134),
27.62/27.78	  inference(avatar_component_clause,[],[f3921])).
27.62/27.78	tff(f3923,plain,(
27.62/27.78	  spl22_134 | ~spl22_124),
27.62/27.78	  inference(avatar_split_clause,[],[f3839,f3791,f3921])).
27.62/27.78	tff(f3925,plain,(
27.62/27.78	  spl22_132 | ~spl22_122),
27.62/27.78	  inference(avatar_split_clause,[],[f3797,f3785,f3871])).
27.62/27.78	tff(f3926,plain,(
27.62/27.78	  ~$less(size1(node_proj_21(sK9)),0) | (~spl22_122 | ~spl22_127)),
27.62/27.78	  inference(backward_demodulation,[],[f3798,f3806])).
27.62/27.78	tff(f3931,plain,(
27.62/27.78	  spl22_136 <=> node_proj_21(sK9) = sK11(sK9)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_136])])).
27.62/27.78	tff(f3933,plain,(
27.62/27.78	  spl22_136 | ~spl22_122),
27.62/27.78	  inference(avatar_split_clause,[],[f3798,f3785,f3931])).
27.62/27.78	tff(f3935,plain,(
27.62/27.78	  ( ! [X12:$int,X10:uni,X11:$int] : (sK6 != X11 | tb2t2(X10) != sK9 | ~$less(X11,$sum(X12,1)) | sK6 != X12 | ~mem(tree,X10,t2tb1(sK7))) ) | (~spl22_50 | ~spl22_128)),
27.62/27.78	  inference(forward_demodulation,[],[f3899,f3813])).
27.62/27.78	tff(f3940,plain,(
27.62/27.78	  spl22_134 | ~spl22_124),
27.62/27.78	  inference(avatar_split_clause,[],[f3839,f3791,f3921])).
27.62/27.78	tff(f3941,plain,(
27.62/27.78	  spl22_134 | ~spl22_124),
27.62/27.78	  inference(avatar_split_clause,[],[f3847,f3791,f3921])).
27.62/27.78	tff(f3962,plain,(
27.62/27.78	  spl22_138 <=> ! [X10 : uni] : (tb2t2(X10) != sK9 | ~mem(tree,X10,t2tb1(sK7)))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_138])])).
27.62/27.78	tff(f3965,plain,(
27.62/27.78	  spl22_140 <=> ! [X11 : $int,X12 : $int] : (sK6 != X11 | sK6 != X12 | ~$less(X11,$sum(X12,1)))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_140])])).
27.62/27.78	tff(f3967,plain,(
27.62/27.78	  spl22_138 | spl22_140 | ~spl22_50 | ~spl22_128),
27.62/27.78	  inference(avatar_split_clause,[],[f3935,f3812,f751,f3965,f3962])).
27.62/27.78	tff(f3983,plain,(
27.62/27.78	  spl22_142 <=> node1(sK12(sK9),sK13(sK9)) = sK9),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_142])])).
27.62/27.78	tff(f3984,plain,(
27.62/27.78	  node1(sK12(sK9),sK13(sK9)) = sK9 | ~spl22_142),
27.62/27.78	  inference(avatar_component_clause,[],[f3983])).
27.62/27.78	tff(f3985,plain,(
27.62/27.78	  spl22_142 | ~spl22_124),
27.62/27.78	  inference(avatar_split_clause,[],[f3840,f3791,f3983])).
27.62/27.78	tff(f3990,plain,(
27.62/27.78	  spl22_128 | ~spl22_122),
27.62/27.78	  inference(avatar_split_clause,[],[f3796,f3785,f3812])).
27.62/27.78	tff(f3991,plain,(
27.62/27.78	  ~$less(size1(node_proj_21(sK9)),0) | (~spl22_122 | ~spl22_127)),
27.62/27.78	  inference(backward_demodulation,[],[f3798,f3806])).
27.62/27.78	tff(f3992,plain,(
27.62/27.78	  spl22_136 | ~spl22_122),
27.62/27.78	  inference(avatar_split_clause,[],[f3798,f3785,f3931])).
27.62/27.78	tff(f4009,plain,(
27.62/27.78	  spl22_145 <=> ~$less(size1(node_proj_21(sK9)),0)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_145])])).
27.62/27.78	tff(f4011,plain,(
27.62/27.78	  ~spl22_145 | ~spl22_122 | spl22_127),
27.62/27.78	  inference(avatar_split_clause,[],[f3926,f3805,f3785,f4009])).
27.62/27.78	tff(f4033,plain,(
27.62/27.78	  ~spl22_145 | ~spl22_122 | spl22_127),
27.62/27.78	  inference(avatar_split_clause,[],[f3991,f3805,f3785,f4009])).
27.62/27.78	tff(f4082,plain,(
27.62/27.78	  spl22_146 <=> ! [X5 : tree1,X2 : uni] : (mem(tree,t2tb2(node1(X5,tb2t2(sK19(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X2)))),t2tb1(sK7)) | ~distinct(tree,X2) | distinct(tree,infix_plpl(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X2)) | size1(X5) != sK6)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_146])])).
27.62/27.78	tff(f4085,plain,(
27.62/27.78	  spl22_148 <=> ! [X3 : $int,X4 : $int] : ($sum($difference(X3,1),$uminus(X4)) != sK3 | sK6 != X4 | sK3 != X3)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_148])])).
27.62/27.78	tff(f4086,plain,(
27.62/27.78	  ( ! [X4:$int,X3:$int] : ($sum($difference(X3,1),$uminus(X4)) != sK3 | sK6 != X4 | sK3 != X3) ) | ~spl22_148),
27.62/27.78	  inference(avatar_component_clause,[],[f4085])).
27.62/27.78	tff(f4087,plain,(
27.62/27.78	  spl22_146 | spl22_148),
27.62/27.78	  inference(avatar_split_clause,[],[f2096,f4085,f4082])).
27.62/27.78	tff(f4090,plain,(
27.62/27.78	  ( ! [X3:uni] : (size1(node_proj_21(tb2t2(X3))) != sK3 | sK6 != sK6 | sK3 != sK3 | ~mem(tree,X3,t2tb1(sK7))) ) | ~spl22_148),
27.62/27.78	  inference(superposition,[],[f4086,f1076])).
27.62/27.78	tff(f4093,plain,(
27.62/27.78	  ( ! [X3:uni] : (size1(node_proj_21(tb2t2(X3))) != sK3 | ~mem(tree,X3,t2tb1(sK7))) ) | ~spl22_148),
27.62/27.78	  inference(trivial_inequality_removal,[],[f4090])).
27.62/27.78	tff(f4122,plain,(
27.62/27.78	  ( ! [X11:uni] : ($sum($difference(sK3,1),$uminus(sK6)) != sK3 | ~mem(tree,X11,t2tb1(sK7)) | ~mem(tree,X11,t2tb1(sK7))) ) | ~spl22_148),
27.62/27.78	  inference(superposition,[],[f4093,f1076])).
27.62/27.78	tff(f4130,plain,(
27.62/27.78	  ( ! [X11:uni] : ($sum($difference(sK3,1),$uminus(sK6)) != sK3 | ~mem(tree,X11,t2tb1(sK7))) ) | ~spl22_148),
27.62/27.78	  inference(duplicate_literal_removal,[],[f4122])).
27.62/27.78	tff(f4211,plain,(
27.62/27.78	  spl22_151 <=> $sum($difference(sK3,1),$uminus(sK6)) != sK3),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_151])])).
27.62/27.78	tff(f4213,plain,(
27.62/27.78	  spl22_58 | ~spl22_151 | ~spl22_148),
27.62/27.78	  inference(avatar_split_clause,[],[f4130,f4085,f4211,f1219])).
27.62/27.78	tff(f4219,plain,(
27.62/27.78	  spl22_152 <=> ! [X8 : uni] : (node1(sK14(tb2t2(sK19(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X8))),sK15(tb2t2(sK19(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X8)))) = tb2t2(sK19(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X8)) | ~distinct(tree,X8) | distinct(tree,infix_plpl(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X8)))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_152])])).
27.62/27.78	tff(f4222,plain,(
27.62/27.78	  spl22_154 <=> ! [X9 : $int] : (sK3 != X9 | ~$less(0,X9))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_154])])).
27.62/27.78	tff(f4223,plain,(
27.62/27.78	  ( ! [X9:$int] : (sK3 != X9 | ~$less(0,X9)) ) | ~spl22_154),
27.62/27.78	  inference(avatar_component_clause,[],[f4222])).
27.62/27.78	tff(f4224,plain,(
27.62/27.78	  spl22_152 | spl22_154),
27.62/27.78	  inference(avatar_split_clause,[],[f2098,f4222,f4219])).
27.62/27.78	tff(f4225,plain,(
27.62/27.78	  ~$less(0,sK3) | ~spl22_154),
27.62/27.78	  inference(equality_resolution,[],[f4223])).
27.62/27.78	tff(f4230,plain,(
27.62/27.78	  spl22_157 <=> ~$less(0,sK3)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_157])])).
27.62/27.78	tff(f4232,plain,(
27.62/27.78	  ~spl22_157 | ~spl22_154),
27.62/27.78	  inference(avatar_split_clause,[],[f4225,f4222,f4230])).
27.62/27.78	tff(f4276,plain,(
27.62/27.78	  spl22_158 <=> ! [X11 : uni] : (node1(sK14(tb2t2(sK19(tree,X11,get(list(tree),int,t2tb3(sK5),t2tb(sK3))))),sK15(tb2t2(sK19(tree,X11,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))))) = tb2t2(sK19(tree,X11,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) | ~distinct(tree,X11) | distinct(tree,infix_plpl(tree,X11,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_158])])).
27.62/27.78	tff(f4278,plain,(
27.62/27.78	  spl22_158 | spl22_154),
27.62/27.78	  inference(avatar_split_clause,[],[f2309,f4222,f4276])).
27.62/27.78	tff(f4416,plain,(
27.62/27.78	  ( ! [X0:uni,X1:uni] : (size1(tb2t2(X0)) = size1(tb2t2(X1)) | ~mem(tree,X1,t2tb1(sK7)) | ~mem(tree,X0,t2tb1(sK7))) )),
27.62/27.78	  inference(superposition,[],[f3685,f3685])).
27.62/27.78	tff(f4439,plain,(
27.62/27.78	  ( ! [X0:tree1,X1:uni] : (~mem(tree,t2tb2(X0),t2tb1(sK7)) | ~mem(tree,X1,t2tb1(sK7)) | size1(X0) = size1(tb2t2(X1))) )),
27.62/27.78	  inference(superposition,[],[f4416,f271])).
27.62/27.78	tff(f4550,plain,(
27.62/27.78	  ( ! [X0:uni] : (size1(sK9) = size1(tb2t2(X0)) | ~mem(tree,X0,t2tb1(sK7))) ) | ~spl22_122),
27.62/27.78	  inference(resolution,[],[f4439,f3786])).
27.62/27.78	tff(f4565,plain,(
27.62/27.78	  ( ! [X6:uni] : (size1(sK9) = $sum($sum(1,sK6),$sum($difference(sK3,1),$uminus(sK6))) | ~mem(tree,X6,t2tb1(sK7)) | ~mem(tree,X6,t2tb1(sK7))) ) | ~spl22_122),
27.62/27.78	  inference(superposition,[],[f3685,f4550])).
27.62/27.78	tff(f4575,plain,(
27.62/27.78	  ( ! [X30:tree1,X29:uni] : (size1(sK9) != sK6 | ~mem(tree,t2tb2(node1(X30,tb2t2(X29))),t2tb1(sK7)) | ~mem(tree,X29,t2tb1(sK7))) ) | (~spl22_97 | ~spl22_122)),
27.62/27.78	  inference(superposition,[],[f2489,f4550])).
27.62/27.78	tff(f4580,plain,(
27.62/27.78	  ( ! [X6:uni] : (size1(sK9) = $sum($sum(1,sK6),$sum($difference(sK3,1),$uminus(sK6))) | ~mem(tree,X6,t2tb1(sK7))) ) | ~spl22_122),
27.62/27.78	  inference(duplicate_literal_removal,[],[f4565])).
27.62/27.78	tff(f4596,plain,(
27.62/27.78	  spl22_160 <=> ! [X29 : uni,X30 : tree1] : (~mem(tree,t2tb2(node1(X30,tb2t2(X29))),t2tb1(sK7)) | ~mem(tree,X29,t2tb1(sK7)))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_160])])).
27.62/27.78	tff(f4602,plain,(
27.62/27.78	  spl22_163 <=> size1(sK9) != sK6),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_163])])).
27.62/27.78	tff(f4604,plain,(
27.62/27.78	  spl22_160 | ~spl22_163 | spl22_97 | ~spl22_122),
27.62/27.78	  inference(avatar_split_clause,[],[f4575,f3785,f2486,f4602,f4596])).
27.62/27.78	tff(f4610,plain,(
27.62/27.78	  spl22_164 <=> size1(sK9) = $sum($sum(1,sK6),$sum($difference(sK3,1),$uminus(sK6)))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_164])])).
27.62/27.78	tff(f4612,plain,(
27.62/27.78	  spl22_58 | spl22_164 | ~spl22_122),
27.62/27.78	  inference(avatar_split_clause,[],[f4580,f3785,f4610,f1219])).
27.62/27.78	tff(f4613,plain,(
27.62/27.78	  $false | (~spl22_58 | ~spl22_122)),
27.62/27.78	  inference(resolution,[],[f1220,f3786])).
27.62/27.78	tff(f4617,plain,(
27.62/27.78	  ~spl22_58 | ~spl22_122),
27.62/27.78	  inference(avatar_contradiction_clause,[],[f4613])).
27.62/27.78	tff(f4680,plain,(
27.62/27.78	  spl22_142 | ~spl22_124),
27.62/27.78	  inference(avatar_split_clause,[],[f3840,f3791,f3983])).
27.62/27.78	tff(f4681,plain,(
27.62/27.78	  spl22_142 | ~spl22_124),
27.62/27.78	  inference(avatar_split_clause,[],[f3846,f3791,f3983])).
27.62/27.78	tff(f4682,plain,(
27.62/27.78	  empty1 != sK9 | ~spl22_142),
27.62/27.78	  inference(superposition,[],[f282,f3984])).
27.62/27.78	tff(f4683,plain,(
27.62/27.78	  node_proj_21(sK9) = sK13(sK9) | ~spl22_142),
27.62/27.78	  inference(superposition,[],[f285,f3984])).
27.62/27.78	tff(f4684,plain,(
27.62/27.78	  node_proj_11(sK9) = sK12(sK9) | ~spl22_142),
27.62/27.78	  inference(superposition,[],[f286,f3984])).
27.62/27.78	tff(f4692,plain,(
27.62/27.78	  ( ! [X13:uni] : (tb2t2(X13) != sK9 | size1(sK12(sK9)) = size1(sK10(tb2t2(X13))) | ~mem(tree,X13,t2tb1(sK7))) ) | ~spl22_142),
27.62/27.78	  inference(superposition,[],[f646,f3984])).
27.62/27.78	tff(f4722,plain,(
27.62/27.78	  ( ! [X13:uni] : (tb2t2(X13) != sK9 | size1(sK10(sK9)) = size1(sK12(sK9)) | ~mem(tree,X13,t2tb1(sK7))) ) | ~spl22_142),
27.62/27.78	  inference(inner_rewriting,[],[f4692])).
27.62/27.78	tff(f4738,plain,(
27.62/27.78	  spl22_167 <=> empty1 != sK9),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_167])])).
27.62/27.78	tff(f4740,plain,(
27.62/27.78	  ~spl22_167 | ~spl22_142),
27.62/27.78	  inference(avatar_split_clause,[],[f4682,f3983,f4738])).
27.62/27.78	tff(f4745,plain,(
27.62/27.78	  spl22_168 <=> size1(sK10(sK9)) = size1(sK12(sK9))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_168])])).
27.62/27.78	tff(f4747,plain,(
27.62/27.78	  spl22_168 | spl22_138 | ~spl22_142),
27.62/27.78	  inference(avatar_split_clause,[],[f4722,f3983,f3962,f4745])).
27.62/27.78	tff(f4748,plain,(
27.62/27.78	  node1(sK12(sK9),node_proj_21(sK9)) = sK9 | ~spl22_142),
27.62/27.78	  inference(backward_demodulation,[],[f4683,f3984])).
27.62/27.78	tff(f4753,plain,(
27.62/27.78	  spl22_170 <=> node_proj_21(sK9) = sK13(sK9)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_170])])).
27.62/27.78	tff(f4755,plain,(
27.62/27.78	  spl22_170 | ~spl22_142),
27.62/27.78	  inference(avatar_split_clause,[],[f4683,f3983,f4753])).
27.62/27.78	tff(f4756,plain,(
27.62/27.78	  $less(size1(node_proj_11(sK9)),sK6) | (~spl22_134 | ~spl22_142)),
27.62/27.78	  inference(backward_demodulation,[],[f4684,f3922])).
27.62/27.78	tff(f4761,plain,(
27.62/27.78	  spl22_172 <=> node_proj_11(sK9) = sK12(sK9)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_172])])).
27.62/27.78	tff(f4762,plain,(
27.62/27.78	  node_proj_11(sK9) = sK12(sK9) | ~spl22_172),
27.62/27.78	  inference(avatar_component_clause,[],[f4761])).
27.62/27.78	tff(f4763,plain,(
27.62/27.78	  spl22_172 | ~spl22_142),
27.62/27.78	  inference(avatar_split_clause,[],[f4684,f3983,f4761])).
27.62/27.78	tff(f4768,plain,(
27.62/27.78	  spl22_174 <=> $less(size1(node_proj_11(sK9)),sK6)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_174])])).
27.62/27.78	tff(f4770,plain,(
27.62/27.78	  spl22_174 | ~spl22_134 | ~spl22_142),
27.62/27.78	  inference(avatar_split_clause,[],[f4756,f3983,f3921,f4768])).
27.62/27.78	tff(f4775,plain,(
27.62/27.78	  node1(node_proj_11(sK9),node_proj_21(sK9)) = sK9 | (~spl22_142 | ~spl22_172)),
27.62/27.78	  inference(forward_demodulation,[],[f4748,f4762])).
27.62/27.78	tff(f4780,plain,(
27.62/27.78	  spl22_176 <=> node1(node_proj_11(sK9),node_proj_21(sK9)) = sK9),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_176])])).
27.62/27.78	tff(f4782,plain,(
27.62/27.78	  spl22_176 | ~spl22_142 | ~spl22_172),
27.62/27.78	  inference(avatar_split_clause,[],[f4775,f4761,f3983,f4780])).
27.62/27.78	tff(f4937,plain,(
27.62/27.78	  spl22_178 <=> node1(sK14(sK9),sK15(sK9)) = sK9),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_178])])).
27.62/27.78	tff(f4938,plain,(
27.62/27.78	  node1(sK14(sK9),sK15(sK9)) = sK9 | ~spl22_178),
27.62/27.78	  inference(avatar_component_clause,[],[f4937])).
27.62/27.78	tff(f4939,plain,(
27.62/27.78	  spl22_178 | spl22_154 | ~spl22_48),
27.62/27.78	  inference(avatar_split_clause,[],[f3876,f745,f4222,f4937])).
27.62/27.78	tff(f4941,plain,(
27.62/27.78	  node_proj_21(sK9) = sK15(sK9) | ~spl22_178),
27.62/27.78	  inference(superposition,[],[f285,f4938])).
27.62/27.78	tff(f4942,plain,(
27.62/27.78	  node_proj_11(sK9) = sK14(sK9) | ~spl22_178),
27.62/27.78	  inference(superposition,[],[f286,f4938])).
27.62/27.78	tff(f4955,plain,(
27.62/27.78	  ( ! [X17:$int,X16:$int] : (sK9 != sK9 | ~$less(X16,$sum(X17,1)) | sK6 != X17 | size1(sK14(sK9)) != X16) ) | (~spl22_50 | ~spl22_178)),
27.62/27.78	  inference(superposition,[],[f752,f4938])).
27.62/27.78	tff(f4976,plain,(
27.62/27.78	  ( ! [X17:$int,X16:$int] : (~$less(X16,$sum(X17,1)) | sK6 != X17 | size1(sK14(sK9)) != X16) ) | (~spl22_50 | ~spl22_178)),
27.62/27.78	  inference(trivial_inequality_removal,[],[f4955])).
27.62/27.78	tff(f4997,plain,(
27.62/27.78	  spl22_180 <=> node_proj_21(sK9) = sK15(sK9)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_180])])).
27.62/27.78	tff(f4999,plain,(
27.62/27.78	  spl22_180 | ~spl22_178),
27.62/27.78	  inference(avatar_split_clause,[],[f4941,f4937,f4997])).
27.62/27.78	tff(f5004,plain,(
27.62/27.78	  spl22_182 <=> node_proj_11(sK9) = sK14(sK9)),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_182])])).
27.62/27.78	tff(f5005,plain,(
27.62/27.78	  node_proj_11(sK9) = sK14(sK9) | ~spl22_182),
27.62/27.78	  inference(avatar_component_clause,[],[f5004])).
27.62/27.78	tff(f5006,plain,(
27.62/27.78	  spl22_182 | ~spl22_178),
27.62/27.78	  inference(avatar_split_clause,[],[f4942,f4937,f5004])).
27.62/27.78	tff(f5015,plain,(
27.62/27.78	  ( ! [X17:$int,X16:$int] : (size1(node_proj_11(sK9)) != X16 | ~$less(X16,$sum(X17,1)) | sK6 != X17) ) | (~spl22_50 | ~spl22_178 | ~spl22_182)),
27.62/27.78	  inference(forward_demodulation,[],[f4976,f5005])).
27.62/27.78	tff(f5017,plain,(
27.62/27.78	  ( ! [X0:$int] : (sK6 != X0 | ~$less(size1(node_proj_11(sK9)),$sum(X0,1))) ) | (~spl22_50 | ~spl22_178 | ~spl22_182)),
27.62/27.78	  inference(equality_resolution,[],[f5015])).
27.62/27.78	tff(f5019,plain,(
27.62/27.78	  ~$less(size1(node_proj_11(sK9)),$sum(sK6,1)) | (~spl22_50 | ~spl22_178 | ~spl22_182)),
27.62/27.78	  inference(equality_resolution,[],[f5017])).
27.62/27.78	tff(f5024,plain,(
27.62/27.78	  spl22_185 <=> ~$less(size1(node_proj_11(sK9)),$sum(sK6,1))),
27.62/27.78	  introduced(avatar_definition,[new_symbols(naming,[spl22_185])])).
27.62/27.78	tff(f5026,plain,(
27.62/27.78	  ~spl22_185 | ~spl22_50 | ~spl22_178 | ~spl22_182),
27.62/27.78	  inference(avatar_split_clause,[],[f5019,f5004,f4937,f751,f5024])).
27.62/27.78	tff(f5027,plain,(
27.62/27.78	  $false),
27.62/27.78	  inference(avatar_sat_refutation,[],[f437,f445,f453,f461,f470,f477,f485,f493,f502,f509,f516,f529,f538,f547,f557,f564,f579,f588,f611,f636,f722,f730,f743,f753,f755,f766,f979,f1090,f1224,f1330,f1543,f1551,f1688,f1690,f1886,f1888,f1898,f1987,f1989,f2316,f2481,f2488,f2573,f2574,f2684,f2686,f2730,f2757,f2803,f2955,f3091,f3100,f3253,f3611,f3793,f3807,f3814,f3831,f3850,f3851,f3873,f3923,f3925,f3933,f3940,f3941,f3967,f3985,f3990,f3992,f4011,f4033,f4087,f4213,f4224,f4232,f4278,f4604,f4612,f4617,f4680,f4681,f4740,f4747,f4755,f4763,f4770,f4782,f4939,f4999,f5006,f5026])).
27.62/27.78	% SZS output end Proof for theBenchmark
27.62/27.78	% ------------------------------
27.62/27.78	% Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100)
27.62/27.78	% Termination reason: Refutation
27.62/27.78	
27.62/27.78	% Memory used [KB]: 9722
27.62/27.78	% Time elapsed: 0.248 s
27.62/27.78	% ------------------------------
27.62/27.78	% ------------------------------
27.62/27.78	% Success in time 27.542 s
27.62/27.79	EOF