0.12/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.13 % Command : vampire --mode casc -t %d %s 0.13/0.34 % Computer : n011.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 180 0.13/0.34 % DateTime : Thu Aug 29 11:24:42 EDT 2019 0.13/0.34 % CPUTime : 0.20/0.42 % 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.75/0.91 % Time limit reached! 0.75/0.91 % ------------------------------ 0.75/0.91 % Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100) 0.75/0.91 % Termination reason: Time limit 0.75/0.91 % Termination phase: Saturation 0.75/0.91 0.75/0.91 % Memory used [KB]: 7164 0.75/0.91 % Time elapsed: 0.500 s 0.75/0.91 % ------------------------------ 0.75/0.91 % ------------------------------ 0.76/0.98 % 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.35/2.57 % Time limit reached! 2.35/2.57 % ------------------------------ 2.35/2.57 % Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100) 2.35/2.57 % Termination reason: Time limit 2.35/2.57 % Termination phase: Saturation 2.35/2.57 2.35/2.57 % Memory used [KB]: 38123 2.35/2.57 % Time elapsed: 1.600 s 2.35/2.57 % ------------------------------ 2.35/2.57 % ------------------------------ 2.45/2.61 % 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.40/3.61 % Time limit reached! 3.40/3.61 % ------------------------------ 3.40/3.61 % Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100) 3.40/3.61 % Termination reason: Time limit 3.40/3.61 % Termination phase: Saturation 3.40/3.61 3.40/3.61 % Memory used [KB]: 7803 3.40/3.61 % Time elapsed: 1.0000 s 3.40/3.61 % ------------------------------ 3.40/3.61 % ------------------------------ 3.49/3.64 % 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.48/13.44 % Time limit reached! 13.48/13.44 % ------------------------------ 13.48/13.44 % Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100) 13.48/13.44 % Termination reason: Time limit 13.48/13.44 % Termination phase: Saturation 13.48/13.44 13.48/13.44 % Memory used [KB]: 38762 13.48/13.44 % Time elapsed: 9.800 s 13.48/13.44 % ------------------------------ 13.48/13.44 % ------------------------------ 13.48/13.47 % 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 15.08/15.07 % Time limit reached! 15.08/15.07 % ------------------------------ 15.08/15.07 % Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100) 15.08/15.07 % Termination reason: Time limit 15.08/15.07 % Termination phase: Saturation 15.08/15.07 15.08/15.07 % Memory used [KB]: 41449 15.08/15.07 % Time elapsed: 1.600 s 15.08/15.07 % ------------------------------ 15.08/15.07 % ------------------------------ 15.16/15.10 % 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.43/16.40 % Time limit reached! 16.43/16.40 % ------------------------------ 16.43/16.40 % Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100) 16.43/16.40 % Termination reason: Time limit 16.43/16.40 % Termination phase: Saturation 16.43/16.40 16.43/16.40 % Memory used [KB]: 47206 16.43/16.40 % Time elapsed: 1.300 s 16.43/16.40 % ------------------------------ 16.43/16.40 % ------------------------------ 16.52/16.43 % 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.83/17.73 % Time limit reached! 17.83/17.73 % ------------------------------ 17.83/17.73 % Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100) 17.83/17.73 % Termination reason: Time limit 17.83/17.73 % Termination phase: Saturation 17.83/17.73 17.83/17.73 % Memory used [KB]: 53602 17.83/17.73 % Time elapsed: 1.300 s 17.83/17.73 % ------------------------------ 17.83/17.73 % ------------------------------ 17.83/17.76 % 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 20.26/20.16 % Time limit reached! 20.26/20.16 % ------------------------------ 20.26/20.16 % Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100) 20.26/20.16 % Termination reason: Time limit 20.26/20.16 % Termination phase: Saturation 20.26/20.16 20.26/20.16 % Memory used [KB]: 42600 20.26/20.16 % Time elapsed: 2.400 s 20.26/20.16 % ------------------------------ 20.26/20.16 % ------------------------------ 20.33/20.19 % 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 21.35/21.19 % Time limit reached! 21.35/21.19 % ------------------------------ 21.35/21.19 % Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100) 21.35/21.19 % Termination reason: Time limit 21.35/21.19 % Termination phase: Saturation 21.35/21.19 21.35/21.19 % Memory used [KB]: 14072 21.35/21.19 % Time elapsed: 1.0000 s 21.35/21.19 % ------------------------------ 21.35/21.19 % ------------------------------ 21.35/21.22 % 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 26.05/25.82 % Time limit reached! 26.05/25.82 % ------------------------------ 26.05/25.82 % Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100) 26.05/25.82 % Termination reason: Time limit 26.05/25.82 % Termination phase: Saturation 26.05/25.82 26.05/25.82 % Memory used [KB]: 86096 26.05/25.82 % Time elapsed: 4.600 s 26.05/25.82 % ------------------------------ 26.05/25.82 % ------------------------------ 26.09/25.86 % 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.65/26.45 % Time limit reached! 26.65/26.45 % ------------------------------ 26.65/26.45 % Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100) 26.65/26.45 % Termination reason: Time limit 26.65/26.45 % Termination phase: Saturation 26.65/26.45 26.65/26.45 % Memory used [KB]: 40169 26.65/26.45 % Time elapsed: 0.600 s 26.65/26.45 % ------------------------------ 26.65/26.45 % ------------------------------ 26.73/26.49 % 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 27.36/27.09 % Time limit reached! 27.36/27.09 % ------------------------------ 27.36/27.09 % Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100) 27.36/27.09 % Termination reason: Time limit 27.36/27.09 % Termination phase: Saturation 27.36/27.09 27.36/27.09 % Memory used [KB]: 12153 27.36/27.09 % Time elapsed: 0.600 s 27.36/27.09 % ------------------------------ 27.36/27.09 % ------------------------------ 27.37/27.12 % 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.88/27.62 % Time limit reached! 27.88/27.62 % ------------------------------ 27.88/27.62 % Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100) 27.88/27.62 % Termination reason: Time limit 27.88/27.62 % Termination phase: Saturation 27.88/27.62 27.88/27.62 % Memory used [KB]: 31470 27.88/27.62 % Time elapsed: 0.500 s 27.88/27.62 % ------------------------------ 27.88/27.62 % ------------------------------ 27.88/27.65 % 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.91/28.05 % Refutation found. Thanks to Tanya! 27.91/28.05 % SZS status Theorem for theBenchmark 27.91/28.05 % SZS output start Proof for theBenchmark 27.91/28.05 tff(type_def_5, type, uni: $tType). 27.91/28.05 tff(type_def_6, type, ty: $tType). 27.91/28.05 tff(type_def_7, type, bool1: $tType). 27.91/28.05 tff(type_def_8, type, tuple02: $tType). 27.91/28.05 tff(type_def_9, type, tree1: $tType). 27.91/28.05 tff(type_def_10, type, list_tree: $tType). 27.91/28.05 tff(type_def_11, type, map_int_lplist_treerp: $tType). 27.91/28.05 tff(func_def_0, type, witness1: ty > uni). 27.91/28.05 tff(func_def_1, type, int: ty). 27.91/28.05 tff(func_def_2, type, real: ty). 27.91/28.05 tff(func_def_3, type, bool: ty). 27.91/28.05 tff(func_def_4, type, true1: bool1). 27.91/28.05 tff(func_def_5, type, false1: bool1). 27.91/28.05 tff(func_def_6, type, match_bool1: (ty * bool1 * uni * uni) > uni). 27.91/28.05 tff(func_def_7, type, tuple0: ty). 27.91/28.05 tff(func_def_8, type, tuple03: tuple02). 27.91/28.05 tff(func_def_9, type, qtmark: ty). 27.91/28.05 tff(func_def_10, type, list: ty > ty). 27.91/28.05 tff(func_def_11, type, nil: ty > uni). 27.91/28.05 tff(func_def_12, type, cons: (ty * uni * uni) > uni). 27.91/28.05 tff(func_def_13, type, match_list1: (ty * ty * uni * uni * uni) > uni). 27.91/28.05 tff(func_def_14, type, cons_proj_11: (ty * uni) > uni). 27.91/28.05 tff(func_def_15, type, cons_proj_21: (ty * uni) > uni). 27.91/28.05 tff(func_def_16, type, infix_plpl: (ty * uni * uni) > uni). 27.91/28.05 tff(func_def_17, type, length2: (ty * uni) > $int). 27.91/28.05 tff(func_def_18, type, map: (ty * ty) > ty). 27.91/28.05 tff(func_def_19, type, get: (ty * ty * uni * uni) > uni). 27.91/28.05 tff(func_def_20, type, set: (ty * ty * uni * uni * uni) > uni). 27.91/28.05 tff(func_def_21, type, const: (ty * ty * uni) > uni). 27.91/28.05 tff(func_def_22, type, array: ty > ty). 27.91/28.05 tff(func_def_23, type, mk_array1: (ty * $int * uni) > uni). 27.91/28.05 tff(func_def_24, type, length3: (ty * uni) > $int). 27.91/28.05 tff(func_def_25, type, elts: (ty * uni) > uni). 27.91/28.05 tff(func_def_26, type, get2: (ty * uni * $int) > uni). 27.91/28.05 tff(func_def_27, type, t2tb: $int > uni). 27.91/28.05 tff(func_def_28, type, tb2t: uni > $int). 27.91/28.05 tff(func_def_29, type, set2: (ty * uni * $int * uni) > uni). 27.91/28.05 tff(func_def_30, type, make1: (ty * $int * uni) > uni). 27.91/28.05 tff(func_def_31, type, tree: ty). 27.91/28.05 tff(func_def_32, type, empty1: tree1). 27.91/28.05 tff(func_def_33, type, node1: (tree1 * tree1) > tree1). 27.91/28.05 tff(func_def_34, type, match_tree1: (ty * tree1 * uni * uni) > uni). 27.91/28.05 tff(func_def_35, type, node_proj_11: tree1 > tree1). 27.91/28.05 tff(func_def_36, type, node_proj_21: tree1 > tree1). 27.91/28.05 tff(func_def_37, type, size1: tree1 > $int). 27.91/28.05 tff(func_def_38, type, t2tb1: list_tree > uni). 27.91/28.05 tff(func_def_39, type, tb2t1: uni > list_tree). 27.91/28.05 tff(func_def_40, type, t2tb2: tree1 > uni). 27.91/28.05 tff(func_def_41, type, tb2t2: uni > tree1). 27.91/28.05 tff(func_def_42, type, t2tb3: map_int_lplist_treerp > uni). 27.91/28.05 tff(func_def_43, type, tb2t3: uni > map_int_lplist_treerp). 27.91/28.05 tff(func_def_50, type, sK0: $int). 27.91/28.05 tff(func_def_51, type, sK1: map_int_lplist_treerp). 27.91/28.05 tff(func_def_52, type, sK2: map_int_lplist_treerp). 27.91/28.05 tff(func_def_53, type, sK3: $int). 27.91/28.05 tff(func_def_54, type, sK4: map_int_lplist_treerp). 27.91/28.05 tff(func_def_55, type, sK5: map_int_lplist_treerp). 27.91/28.05 tff(func_def_56, type, sK6: $int). 27.91/28.05 tff(func_def_57, type, sK7: list_tree). 27.91/28.05 tff(func_def_58, type, sK8: map_int_lplist_treerp). 27.91/28.05 tff(func_def_59, type, sK9: tree1). 27.91/28.05 tff(func_def_60, type, sK10: tree1 > tree1). 27.91/28.05 tff(func_def_61, type, sK11: tree1 > tree1). 27.91/28.05 tff(func_def_62, type, sK12: tree1 > tree1). 27.91/28.05 tff(func_def_63, type, sK13: tree1 > tree1). 27.91/28.05 tff(func_def_64, type, sK14: tree1 > tree1). 27.91/28.05 tff(func_def_65, type, sK15: tree1 > tree1). 27.91/28.05 tff(func_def_66, type, sK16: (ty * uni) > uni). 27.91/28.05 tff(func_def_67, type, sK17: (ty * uni) > uni). 27.91/28.05 tff(func_def_68, type, sK18: (ty * uni) > uni). 27.91/28.05 tff(func_def_69, type, sK19: (ty * uni * uni) > uni). 27.91/28.05 tff(func_def_70, type, sK20: (ty * uni * uni) > uni). 27.91/28.05 tff(func_def_71, type, sK21: (ty * uni * uni) > uni). 27.91/28.05 tff(pred_def_1, type, sort1: (ty * uni) > $o). 27.91/28.05 tff(pred_def_2, type, mem: (ty * uni * uni) > $o). 27.91/28.05 tff(pred_def_3, type, distinct: (ty * uni) > $o). 27.91/28.05 tff(pred_def_4, type, all_trees1: ($int * list_tree) > $o). 27.91/28.05 tff(f2,axiom,( 27.91/28.05 ! [X1 : tree1,X2 : tree1] : (size1(X1) != size1(X2) => ! [X3 : tree1,X4 : tree1] : node1(X1,X3) != node1(X2,X4))), 27.91/28.05 file('/export/starexec/sandbox/benchmark/theBenchmark.p',tree_diff)). 27.91/28.05 tff(f3,axiom,( 27.91/28.05 ! [X5 : $int,X6 : list_tree] : ((! [X7 : tree1] : (mem(tree,t2tb2(X7),t2tb1(X6)) <=> size1(X7) = X5) & distinct(tree,t2tb1(X6))) <=> all_trees1(X5,X6))), 27.91/28.05 file('/export/starexec/sandbox/benchmark/theBenchmark.p',all_trees_def)). 27.91/28.05 tff(f4,axiom,( 27.91/28.05 ! [X8 : tree1] : tb2t2(t2tb2(X8)) = X8), 27.91/28.05 file('/export/starexec/sandbox/benchmark/theBenchmark.p',bridgeL2)). 27.91/28.05 tff(f6,axiom,( 27.91/28.05 ! [X9 : ty,X12 : uni,X1 : uni,X2 : uni] : (mem(X9,X12,infix_plpl(X9,X1,X2)) <=> (mem(X9,X12,X2) | mem(X9,X12,X1)))), 27.91/28.05 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mem_append)). 27.91/28.05 tff(f7,axiom,( 27.91/28.05 ! [X9 : ty,X12 : uni,X13 : uni] : sort1(list(X9),cons(X9,X12,X13))), 27.91/28.05 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cons_sort2)). 27.91/28.05 tff(f8,axiom,( 27.91/28.05 ! [X0 : tree1,X14 : tree1] : node_proj_11(node1(X0,X14)) = X0), 27.91/28.05 file('/export/starexec/sandbox/benchmark/theBenchmark.p',node_proj_1_def1)). 27.91/28.05 tff(f9,axiom,( 27.91/28.05 ! [X9 : ty,X15 : ty,X16 : uni,X17 : uni,X18 : uni,X19 : uni] : (sort1(X15,X19) => (X17 = X18 => get(X15,X9,set(X15,X9,X16,X17,X19),X18) = X19))), 27.91/28.05 file('/export/starexec/sandbox/benchmark/theBenchmark.p',select_eq)). 27.91/28.05 tff(f20,axiom,( 27.91/28.05 ! [X9 : ty,X1 : uni,X2 : uni] : (distinct(X9,X1) => (distinct(X9,X2) => (! [X12 : uni] : (sort1(X9,X12) => (mem(X9,X12,X1) => ~mem(X9,X12,X2))) => distinct(X9,infix_plpl(X9,X1,X2)))))), 27.91/28.05 file('/export/starexec/sandbox/benchmark/theBenchmark.p',distinct_append)). 27.91/28.05 tff(f24,axiom,( 27.91/28.05 ! [X7 : tree1] : $lesseq(0,size1(X7))), 27.91/28.05 file('/export/starexec/sandbox/benchmark/theBenchmark.p',size_nonneg)). 27.91/28.05 tff(f26,axiom,( 27.91/28.05 ! [X12 : $int] : sort1(int,t2tb(X12))), 27.91/28.05 file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2tb_sort3)). 27.91/28.05 tff(f29,axiom,( 27.91/28.05 ! [X0 : tree1] : (empty1 = X0 | node1(node_proj_11(X0),node_proj_21(X0)) = X0)), 27.91/28.05 file('/export/starexec/sandbox/benchmark/theBenchmark.p',tree_inversion1)). 27.91/28.05 tff(f36,conjecture,( 27.91/28.05 ! [X5 : $int] : ($lesseq(0,X5) => ($lesseq(0,$sum(X5,1)) => ($lesseq(0,$sum(X5,1)) => (($lesseq(0,0) & $less(0,$sum(X5,1))) => ! [X9 : map_int_lplist_treerp] : (($lesseq(0,$sum(X5,1)) & tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = X9) => ($lesseq(1,X5) => ! [X17 : map_int_lplist_treerp,X8 : $int] : (($lesseq(X8,X5) & $lesseq(1,X8)) => (! [X24 : $int] : (($lesseq(0,X24) & $less(X24,X8)) => all_trees1(X24,tb2t1(get(list(tree),int,t2tb3(X17),t2tb(X24))))) => (($lesseq(0,$sum(X5,1)) & $less(X8,$sum(X5,1)) & $lesseq(0,X8)) => ! [X18 : map_int_lplist_treerp] : (($lesseq(0,$sum(X5,1)) & tb2t3(set(list(tree),int,t2tb3(X17),t2tb(X8),nil(tree))) = X18) => ($lesseq(0,$difference(X8,1)) => ! [X25 : map_int_lplist_treerp,X26 : $int] : (($lesseq(0,X26) & $lesseq(X26,$difference(X8,1))) => ((! [X7 : tree1] : (? [X6 : tree1,X29 : tree1] : (node1(X6,X29) = X7 & $less(size1(X6),X26) & size1(X7) = X8) <=> mem(tree,t2tb2(X7),get(list(tree),int,t2tb3(X25),t2tb(X8)))) & distinct(tree,get(list(tree),int,t2tb3(X25),t2tb(X8))) & ! [X24 : $int] : (($lesseq(0,X24) & $less(X24,X8)) => all_trees1(X24,tb2t1(get(list(tree),int,t2tb3(X25),t2tb(X24)))))) => (($lesseq(0,X8) & $less(X8,$sum(X5,1)) & $lesseq(0,$sum(X5,1))) => (($less($difference($difference(X8,1),X26),$sum(X5,1)) & $lesseq(0,$difference($difference(X8,1),X26))) => (($less(X26,$sum(X5,1)) & $lesseq(0,X26)) => ((all_trees1(X26,tb2t1(get(list(tree),int,t2tb3(X25),t2tb(X26)))) & all_trees1($difference($difference(X8,1),X26),tb2t1(get(list(tree),int,t2tb3(X25),t2tb($difference($difference(X8,1),X26))))) & $lesseq(0,$difference($difference(X8,1),X26)) & $lesseq(0,X26)) => ! [X27 : list_tree] : ((! [X7 : tree1] : (? [X6 : tree1,X29 : tree1] : (node1(X6,X29) = X7 & size1(X6) = X26 & size1(X29) = $difference($difference(X8,1),X26)) <=> mem(tree,t2tb2(X7),t2tb1(X27))) & distinct(tree,t2tb1(X27))) => (($lesseq(0,X8) & $less(X8,$sum(X5,1))) => ! [X28 : map_int_lplist_treerp] : (($lesseq(0,$sum(X5,1)) & tb2t3(set(list(tree),int,t2tb3(X25),t2tb(X8),infix_plpl(tree,t2tb1(X27),get(list(tree),int,t2tb3(X25),t2tb(X8))))) = X28) => ! [X7 : tree1] : (mem(tree,t2tb2(X7),get(list(tree),int,t2tb3(X28),t2tb(X8))) => ? [X6 : tree1,X29 : tree1] : (node1(X6,X29) = X7 & $less(size1(X6),$sum(X26,1)) & size1(X7) = X8))))))))))))))))))))))), 27.91/28.05 file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_all_trees)). 27.91/28.05 tff(f37,negated_conjecture,( 27.91/28.05 ~! [X5 : $int] : ($lesseq(0,X5) => ($lesseq(0,$sum(X5,1)) => ($lesseq(0,$sum(X5,1)) => (($lesseq(0,0) & $less(0,$sum(X5,1))) => ! [X9 : map_int_lplist_treerp] : (($lesseq(0,$sum(X5,1)) & tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = X9) => ($lesseq(1,X5) => ! [X17 : map_int_lplist_treerp,X8 : $int] : (($lesseq(X8,X5) & $lesseq(1,X8)) => (! [X24 : $int] : (($lesseq(0,X24) & $less(X24,X8)) => all_trees1(X24,tb2t1(get(list(tree),int,t2tb3(X17),t2tb(X24))))) => (($lesseq(0,$sum(X5,1)) & $less(X8,$sum(X5,1)) & $lesseq(0,X8)) => ! [X18 : map_int_lplist_treerp] : (($lesseq(0,$sum(X5,1)) & tb2t3(set(list(tree),int,t2tb3(X17),t2tb(X8),nil(tree))) = X18) => ($lesseq(0,$difference(X8,1)) => ! [X25 : map_int_lplist_treerp,X26 : $int] : (($lesseq(0,X26) & $lesseq(X26,$difference(X8,1))) => ((! [X7 : tree1] : (? [X6 : tree1,X29 : tree1] : (node1(X6,X29) = X7 & $less(size1(X6),X26) & size1(X7) = X8) <=> mem(tree,t2tb2(X7),get(list(tree),int,t2tb3(X25),t2tb(X8)))) & distinct(tree,get(list(tree),int,t2tb3(X25),t2tb(X8))) & ! [X24 : $int] : (($lesseq(0,X24) & $less(X24,X8)) => all_trees1(X24,tb2t1(get(list(tree),int,t2tb3(X25),t2tb(X24)))))) => (($lesseq(0,X8) & $less(X8,$sum(X5,1)) & $lesseq(0,$sum(X5,1))) => (($less($difference($difference(X8,1),X26),$sum(X5,1)) & $lesseq(0,$difference($difference(X8,1),X26))) => (($less(X26,$sum(X5,1)) & $lesseq(0,X26)) => ((all_trees1(X26,tb2t1(get(list(tree),int,t2tb3(X25),t2tb(X26)))) & all_trees1($difference($difference(X8,1),X26),tb2t1(get(list(tree),int,t2tb3(X25),t2tb($difference($difference(X8,1),X26))))) & $lesseq(0,$difference($difference(X8,1),X26)) & $lesseq(0,X26)) => ! [X27 : list_tree] : ((! [X7 : tree1] : (? [X6 : tree1,X29 : tree1] : (node1(X6,X29) = X7 & size1(X6) = X26 & size1(X29) = $difference($difference(X8,1),X26)) <=> mem(tree,t2tb2(X7),t2tb1(X27))) & distinct(tree,t2tb1(X27))) => (($lesseq(0,X8) & $less(X8,$sum(X5,1))) => ! [X28 : map_int_lplist_treerp] : (($lesseq(0,$sum(X5,1)) & tb2t3(set(list(tree),int,t2tb3(X25),t2tb(X8),infix_plpl(tree,t2tb1(X27),get(list(tree),int,t2tb3(X25),t2tb(X8))))) = X28) => ! [X7 : tree1] : (mem(tree,t2tb2(X7),get(list(tree),int,t2tb3(X28),t2tb(X8))) => ? [X6 : tree1,X29 : tree1] : (node1(X6,X29) = X7 & $less(size1(X6),$sum(X26,1)) & size1(X7) = X8))))))))))))))))))))))), 27.91/28.05 inference(negated_conjecture,[],[f36])). 27.91/28.05 tff(f42,axiom,( 27.91/28.05 ! [X26 : uni] : t2tb3(tb2t3(X26)) = X26), 27.91/28.05 file('/export/starexec/sandbox/benchmark/theBenchmark.p',bridgeR3)). 27.91/28.05 tff(f49,axiom,( 27.91/28.05 ! [X9 : ty,X15 : ty,X19 : uni,X17 : uni] : (sort1(X15,X19) => get(X15,X9,const(X15,X9,X19),X17) = X19)), 27.91/28.05 file('/export/starexec/sandbox/benchmark/theBenchmark.p',const)). 27.91/28.05 tff(f51,axiom,( 27.91/28.05 ! [X12 : tree1,X13 : tree1] : size1(node1(X12,X13)) = $sum($sum(1,size1(X12)),size1(X13)) & size1(empty1) = 0), 27.91/28.05 file('/export/starexec/sandbox/benchmark/theBenchmark.p',size_def)). 27.91/28.05 tff(f52,axiom,( 27.91/28.05 ! [X9 : ty,X15 : ty,X16 : uni,X17 : uni,X18 : uni] : (sort1(X9,X17) => (sort1(X9,X18) => ! [X19 : uni] : (X17 != X18 => get(X15,X9,X16,X18) = get(X15,X9,set(X15,X9,X16,X17,X19),X18))))), 27.91/28.05 file('/export/starexec/sandbox/benchmark/theBenchmark.p',select_neq)). 27.91/28.05 tff(f53,axiom,( 27.91/28.05 ! [X0 : tree1,X14 : tree1] : node_proj_21(node1(X0,X14)) = X14), 27.91/28.05 file('/export/starexec/sandbox/benchmark/theBenchmark.p',node_proj_2_def1)). 27.91/28.05 tff(f62,axiom,( 27.91/28.05 ! [X9 : ty,X12 : uni,X13 : uni] : sort1(list(X9),infix_plpl(X9,X12,X13))), 27.91/28.05 file('/export/starexec/sandbox/benchmark/theBenchmark.p',infix_plpl_sort2)). 27.91/28.05 tff(f69,axiom,( 27.91/28.05 ! [X20 : tree1,X22 : tree1] : empty1 != node1(X20,X22)), 27.91/28.05 file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_Node1)). 27.91/28.05 tff(f70,axiom,( 27.91/28.05 ! [X9 : ty] : sort1(list(X9),nil(X9))), 27.91/28.05 file('/export/starexec/sandbox/benchmark/theBenchmark.p',nil_sort2)). 27.91/28.05 tff(f71,axiom,( 27.91/28.05 ! [X26 : uni] : t2tb2(tb2t2(X26)) = X26), 27.91/28.05 file('/export/starexec/sandbox/benchmark/theBenchmark.p',bridgeR2)). 27.91/28.05 tff(f79,axiom,( 27.91/28.05 ! [X7 : tree1] : ($less(0,size1(X7)) => ? [X6 : tree1,X29 : tree1] : (node1(X6,X29) = X7 & $less(size1(X6),size1(X7))))), 27.91/28.05 file('/export/starexec/sandbox/benchmark/theBenchmark.p',size_left)). 27.91/28.05 tff(f80,plain,( 27.91/28.05 ~! [X5 : $int] : (~$less(X5,0) => (~$less($sum(X5,1),0) => (~$less($sum(X5,1),0) => ((~$less(0,0) & $less(0,$sum(X5,1))) => ! [X9 : map_int_lplist_treerp] : ((~$less($sum(X5,1),0) & tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = X9) => (~$less(X5,1) => ! [X17 : map_int_lplist_treerp,X8 : $int] : ((~$less(X5,X8) & ~$less(X8,1)) => (! [X24 : $int] : ((~$less(X24,0) & $less(X24,X8)) => all_trees1(X24,tb2t1(get(list(tree),int,t2tb3(X17),t2tb(X24))))) => ((~$less($sum(X5,1),0) & $less(X8,$sum(X5,1)) & ~$less(X8,0)) => ! [X18 : map_int_lplist_treerp] : ((~$less($sum(X5,1),0) & tb2t3(set(list(tree),int,t2tb3(X17),t2tb(X8),nil(tree))) = X18) => (~$less($sum(X8,$uminus(1)),0) => ! [X25 : map_int_lplist_treerp,X26 : $int] : ((~$less(X26,0) & ~$less($sum(X8,$uminus(1)),X26)) => ((! [X7 : tree1] : (? [X6 : tree1,X29 : tree1] : (node1(X6,X29) = X7 & $less(size1(X6),X26) & size1(X7) = X8) <=> mem(tree,t2tb2(X7),get(list(tree),int,t2tb3(X25),t2tb(X8)))) & distinct(tree,get(list(tree),int,t2tb3(X25),t2tb(X8))) & ! [X24 : $int] : ((~$less(X24,0) & $less(X24,X8)) => all_trees1(X24,tb2t1(get(list(tree),int,t2tb3(X25),t2tb(X24)))))) => ((~$less(X8,0) & $less(X8,$sum(X5,1)) & ~$less($sum(X5,1),0)) => (($less($sum($difference(X8,1),$uminus(X26)),$sum(X5,1)) & ~$less($sum($difference(X8,1),$uminus(X26)),0)) => (($less(X26,$sum(X5,1)) & ~$less(X26,0)) => ((all_trees1(X26,tb2t1(get(list(tree),int,t2tb3(X25),t2tb(X26)))) & all_trees1($sum($difference(X8,1),$uminus(X26)),tb2t1(get(list(tree),int,t2tb3(X25),t2tb($sum($difference(X8,1),$uminus(X26)))))) & ~$less($sum($difference(X8,1),$uminus(X26)),0) & ~$less(X26,0)) => ! [X27 : list_tree] : ((! [X7 : tree1] : (? [X6 : tree1,X29 : tree1] : (node1(X6,X29) = X7 & size1(X6) = X26 & size1(X29) = $sum($difference(X8,1),$uminus(X26))) <=> mem(tree,t2tb2(X7),t2tb1(X27))) & distinct(tree,t2tb1(X27))) => ((~$less(X8,0) & $less(X8,$sum(X5,1))) => ! [X28 : map_int_lplist_treerp] : ((~$less($sum(X5,1),0) & tb2t3(set(list(tree),int,t2tb3(X25),t2tb(X8),infix_plpl(tree,t2tb1(X27),get(list(tree),int,t2tb3(X25),t2tb(X8))))) = X28) => ! [X7 : tree1] : (mem(tree,t2tb2(X7),get(list(tree),int,t2tb3(X28),t2tb(X8))) => ? [X6 : tree1,X29 : tree1] : (node1(X6,X29) = X7 & $less(size1(X6),$sum(X26,1)) & size1(X7) = X8))))))))))))))))))))))), 27.91/28.05 inference(evaluation,[],[f37])). 27.91/28.05 tff(f81,plain,( 27.91/28.05 ! [X7 : tree1] : ~$less(size1(X7),0)), 27.91/28.05 inference(evaluation,[],[f24])). 27.91/28.05 tff(f84,plain,( 27.91/28.05 ~! [X0 : $int] : (~$less(X0,0) => (~$less($sum(X0,1),0) => (~$less($sum(X0,1),0) => ((~$less(0,0) & $less(0,$sum(X0,1))) => ! [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($sum(X0,1),0) & $less(X3,$sum(X0,1)) & ~$less(X3,0)) => ! [X5 : map_int_lplist_treerp] : ((~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X5) => (~$less($sum(X3,$uminus(1)),0) => ! [X6 : map_int_lplist_treerp,X7 : $int] : ((~$less(X7,0) & ~$less($sum(X3,$uminus(1)),X7)) => ((! [X8 : tree1] : (? [X9 : tree1,X10 : tree1] : (node1(X9,X10) = X8 & $less(size1(X9),X7) & size1(X8) = X3) <=> mem(tree,t2tb2(X8),get(list(tree),int,t2tb3(X6),t2tb(X3)))) & distinct(tree,get(list(tree),int,t2tb3(X6),t2tb(X3))) & ! [X11 : $int] : ((~$less(X11,0) & $less(X11,X3)) => all_trees1(X11,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X11)))))) => ((~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0)) => (($less($sum($difference(X3,1),$uminus(X7)),$sum(X0,1)) & ~$less($sum($difference(X3,1),$uminus(X7)),0)) => (($less(X7,$sum(X0,1)) & ~$less(X7,0)) => ((all_trees1(X7,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X7)))) & all_trees1($sum($difference(X3,1),$uminus(X7)),tb2t1(get(list(tree),int,t2tb3(X6),t2tb($sum($difference(X3,1),$uminus(X7)))))) & ~$less($sum($difference(X3,1),$uminus(X7)),0) & ~$less(X7,0)) => ! [X12 : list_tree] : ((! [X13 : tree1] : (? [X14 : tree1,X15 : tree1] : (node1(X14,X15) = X13 & size1(X14) = X7 & size1(X15) = $sum($difference(X3,1),$uminus(X7))) <=> mem(tree,t2tb2(X13),t2tb1(X12))) & distinct(tree,t2tb1(X12))) => ((~$less(X3,0) & $less(X3,$sum(X0,1))) => ! [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 & $less(size1(X18),$sum(X7,1)) & size1(X17) = X3))))))))))))))))))))))), 27.91/28.05 inference(rectify,[],[f80])). 27.91/28.05 tff(f85,plain,( 27.91/28.05 ! [X0 : tree1,X1 : tree1] : size1(node1(X0,X1)) = $sum($sum(1,size1(X0)),size1(X1)) & size1(empty1) = 0), 27.91/28.05 inference(rectify,[],[f51])). 27.91/28.05 tff(f86,plain,( 27.91/28.05 ! [X0 : tree1] : ~$less(size1(X0),0)), 27.91/28.05 inference(rectify,[],[f81])). 27.91/28.05 tff(f88,plain,( 27.91/28.05 ! [X0 : $int] : sort1(int,t2tb(X0))), 27.91/28.05 inference(rectify,[],[f26])). 27.91/28.05 tff(f93,plain,( 27.91/28.05 ! [X0 : tree1] : tb2t2(t2tb2(X0)) = X0), 27.91/28.05 inference(rectify,[],[f4])). 27.91/28.05 tff(f94,plain,( 27.91/28.05 ! [X0 : uni] : t2tb3(tb2t3(X0)) = X0), 27.91/28.05 inference(rectify,[],[f42])). 27.91/28.05 tff(f97,plain,( 27.91/28.05 ! [X0 : uni] : t2tb2(tb2t2(X0)) = X0), 27.91/28.05 inference(rectify,[],[f71])). 27.91/28.05 tff(f100,plain,( 27.91/28.05 ! [X0 : ty] : sort1(list(X0),nil(X0))), 27.91/28.05 inference(rectify,[],[f70])). 27.91/28.05 tff(f103,plain,( 27.91/28.05 ! [X0 : tree1] : ($less(0,size1(X0)) => ? [X1 : tree1,X2 : tree1] : (node1(X1,X2) = X0 & $less(size1(X1),size1(X0))))), 27.91/28.05 inference(rectify,[],[f79])). 27.91/28.05 tff(f104,plain,( 27.91/28.05 ! [X0 : tree1,X1 : tree1] : empty1 != node1(X0,X1)), 27.91/28.05 inference(rectify,[],[f69])). 27.91/28.05 tff(f107,plain,( 27.91/28.05 ! [X0 : tree1,X1 : tree1] : node_proj_21(node1(X0,X1)) = X1), 27.91/28.05 inference(rectify,[],[f53])). 27.91/28.05 tff(f108,plain,( 27.91/28.05 ! [X0 : tree1,X1 : tree1] : node_proj_11(node1(X0,X1)) = X0), 27.91/28.05 inference(rectify,[],[f8])). 27.91/28.05 tff(f118,plain,( 27.91/28.05 ! [X0 : tree1,X1 : tree1] : (size1(X0) != size1(X1) => ! [X2 : tree1,X3 : tree1] : node1(X0,X2) != node1(X1,X3))), 27.91/28.05 inference(rectify,[],[f2])). 27.91/28.05 tff(f120,plain,( 27.91/28.05 ! [X0 : $int,X1 : list_tree] : ((! [X2 : tree1] : (mem(tree,t2tb2(X2),t2tb1(X1)) <=> size1(X2) = X0) & distinct(tree,t2tb1(X1))) <=> all_trees1(X0,X1))), 27.91/28.05 inference(rectify,[],[f3])). 27.91/28.05 tff(f124,plain,( 27.91/28.05 ! [X0 : ty,X1 : uni,X2 : uni] : sort1(list(X0),infix_plpl(X0,X1,X2))), 27.91/28.05 inference(rectify,[],[f62])). 27.91/28.05 tff(f125,plain,( 27.91/28.05 ! [X0 : ty,X1 : uni,X2 : uni] : sort1(list(X0),cons(X0,X1,X2))), 27.91/28.05 inference(rectify,[],[f7])). 27.91/28.05 tff(f133,plain,( 27.91/28.05 ! [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.91/28.05 inference(rectify,[],[f20])). 27.91/28.05 tff(f149,plain,( 27.91/28.05 ! [X0 : ty,X1 : ty,X2 : uni,X3 : uni] : (sort1(X1,X2) => get(X1,X0,const(X1,X0,X2),X3) = X2)), 27.91/28.05 inference(rectify,[],[f49])). 27.91/28.05 tff(f150,plain,( 27.91/28.05 ! [X0 : ty,X1 : uni,X2 : uni,X3 : uni] : (mem(X0,X1,infix_plpl(X0,X2,X3)) <=> (mem(X0,X1,X3) | mem(X0,X1,X2)))), 27.91/28.05 inference(rectify,[],[f6])). 27.91/28.05 tff(f154,plain,( 27.91/28.05 ! [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.91/28.05 inference(rectify,[],[f52])). 27.91/28.05 tff(f156,plain,( 27.91/28.05 ! [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.91/28.05 inference(rectify,[],[f9])). 27.91/28.05 tff(f157,plain,( 27.91/28.05 ! [X0 : $int,X1 : list_tree] : (all_trees1(X0,X1) => (! [X2 : tree1] : (mem(tree,t2tb2(X2),t2tb1(X1)) <=> size1(X2) = X0) & distinct(tree,t2tb1(X1))))), 27.91/28.05 inference(unused_predicate_definition_removal,[],[f120])). 27.91/28.05 tff(f158,plain,( 27.91/28.05 ? [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 | ~$less(size1(X18),$sum(X7,1)) | size1(X17) != X3) & 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,0) & $less(X3,$sum(X0,1)))) & (! [X13 : tree1] : (? [X14 : tree1,X15 : tree1] : (node1(X14,X15) = X13 & size1(X14) = X7 & size1(X15) = $sum($difference(X3,1),$uminus(X7))) <=> mem(tree,t2tb2(X13),t2tb1(X12))) & distinct(tree,t2tb1(X12)))) & (all_trees1(X7,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X7)))) & all_trees1($sum($difference(X3,1),$uminus(X7)),tb2t1(get(list(tree),int,t2tb3(X6),t2tb($sum($difference(X3,1),$uminus(X7)))))) & ~$less($sum($difference(X3,1),$uminus(X7)),0) & ~$less(X7,0))) & ($less(X7,$sum(X0,1)) & ~$less(X7,0))) & ($less($sum($difference(X3,1),$uminus(X7)),$sum(X0,1)) & ~$less($sum($difference(X3,1),$uminus(X7)),0))) & (~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0))) & (! [X8 : tree1] : (? [X9 : tree1,X10 : tree1] : (node1(X9,X10) = X8 & $less(size1(X9),X7) & size1(X8) = X3) <=> mem(tree,t2tb2(X8),get(list(tree),int,t2tb3(X6),t2tb(X3)))) & distinct(tree,get(list(tree),int,t2tb3(X6),t2tb(X3))) & ! [X11 : $int] : (all_trees1(X11,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X11)))) | ($less(X11,0) | ~$less(X11,X3))))) & (~$less(X7,0) & ~$less($sum(X3,$uminus(1)),X7))) & ~$less($sum(X3,$uminus(1)),0)) & (~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X5)) & (~$less($sum(X0,1),0) & $less(X3,$sum(X0,1)) & ~$less(X3,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,0) & $less(0,$sum(X0,1)))) & ~$less($sum(X0,1),0)) & ~$less($sum(X0,1),0)) & ~$less(X0,0))), 27.91/28.05 inference(ennf_transformation,[],[f84])). 27.91/28.05 tff(f159,plain,( 27.91/28.05 ? [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 | ~$less(size1(X18),$sum(X7,1)) | size1(X17) != X3) & 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,0) & $less(X3,$sum(X0,1)) & ! [X13 : tree1] : (? [X14 : tree1,X15 : tree1] : (node1(X14,X15) = X13 & size1(X14) = X7 & size1(X15) = $sum($difference(X3,1),$uminus(X7))) <=> mem(tree,t2tb2(X13),t2tb1(X12))) & distinct(tree,t2tb1(X12))) & all_trees1(X7,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X7)))) & all_trees1($sum($difference(X3,1),$uminus(X7)),tb2t1(get(list(tree),int,t2tb3(X6),t2tb($sum($difference(X3,1),$uminus(X7)))))) & ~$less($sum($difference(X3,1),$uminus(X7)),0) & ~$less(X7,0) & $less(X7,$sum(X0,1)) & ~$less(X7,0) & $less($sum($difference(X3,1),$uminus(X7)),$sum(X0,1)) & ~$less($sum($difference(X3,1),$uminus(X7)),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X8 : tree1] : (? [X9 : tree1,X10 : tree1] : (node1(X9,X10) = X8 & $less(size1(X9),X7) & size1(X8) = X3) <=> mem(tree,t2tb2(X8),get(list(tree),int,t2tb3(X6),t2tb(X3)))) & distinct(tree,get(list(tree),int,t2tb3(X6),t2tb(X3))) & ! [X11 : $int] : (all_trees1(X11,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X11)))) | $less(X11,0) | ~$less(X11,X3)) & ~$less(X7,0) & ~$less($sum(X3,$uminus(1)),X7)) & ~$less($sum(X3,$uminus(1)),0) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X5) & ~$less($sum(X0,1),0) & $less(X3,$sum(X0,1)) & ~$less(X3,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,0) & $less(0,$sum(X0,1)) & ~$less($sum(X0,1),0) & ~$less($sum(X0,1),0) & ~$less(X0,0))), 27.91/28.05 inference(flattening,[],[f158])). 27.91/28.05 tff(f160,plain,( 27.91/28.05 ! [X0 : tree1] : (? [X1 : tree1,X2 : tree1] : (node1(X1,X2) = X0 & $less(size1(X1),size1(X0))) | ~$less(0,size1(X0)))), 27.91/28.05 inference(ennf_transformation,[],[f103])). 27.91/28.05 tff(f164,plain,( 27.91/28.05 ! [X0 : tree1,X1 : tree1] : (! [X2 : tree1,X3 : tree1] : node1(X0,X2) != node1(X1,X3) | size1(X0) = size1(X1))), 27.91/28.05 inference(ennf_transformation,[],[f118])). 27.91/28.05 tff(f165,plain,( 27.91/28.05 ! [X0 : $int,X1 : list_tree] : ((! [X2 : tree1] : (mem(tree,t2tb2(X2),t2tb1(X1)) <=> size1(X2) = X0) & distinct(tree,t2tb1(X1))) | ~all_trees1(X0,X1))), 27.91/28.05 inference(ennf_transformation,[],[f157])). 27.91/28.05 tff(f166,plain,( 27.91/28.05 ! [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.91/28.05 inference(ennf_transformation,[],[f133])). 27.91/28.05 tff(f167,plain,( 27.91/28.05 ! [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.91/28.05 inference(flattening,[],[f166])). 27.91/28.05 tff(f179,plain,( 27.91/28.05 ! [X0 : ty,X1 : ty,X2 : uni,X3 : uni] : (get(X1,X0,const(X1,X0,X2),X3) = X2 | ~sort1(X1,X2))), 27.91/28.05 inference(ennf_transformation,[],[f149])). 27.91/28.05 tff(f181,plain,( 27.91/28.05 ! [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.91/28.05 inference(ennf_transformation,[],[f154])). 27.91/28.05 tff(f182,plain,( 27.91/28.05 ! [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.91/28.05 inference(flattening,[],[f181])). 27.91/28.05 tff(f184,plain,( 27.91/28.05 ! [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.91/28.05 inference(ennf_transformation,[],[f156])). 27.91/28.05 tff(f185,plain,( 27.91/28.05 ! [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.91/28.05 inference(flattening,[],[f184])). 27.91/28.05 tff(f186,plain,( 27.91/28.05 ? [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 | ~$less(size1(X18),$sum(X7,1)) | size1(X17) != X3) & 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,0) & $less(X3,$sum(X0,1)) & ! [X13 : tree1] : ((? [X14 : tree1,X15 : tree1] : (node1(X14,X15) = X13 & size1(X14) = X7 & size1(X15) = $sum($difference(X3,1),$uminus(X7))) | ~mem(tree,t2tb2(X13),t2tb1(X12))) & (mem(tree,t2tb2(X13),t2tb1(X12)) | ! [X14 : tree1,X15 : tree1] : (node1(X14,X15) != X13 | size1(X14) != X7 | size1(X15) != $sum($difference(X3,1),$uminus(X7))))) & distinct(tree,t2tb1(X12))) & all_trees1(X7,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X7)))) & all_trees1($sum($difference(X3,1),$uminus(X7)),tb2t1(get(list(tree),int,t2tb3(X6),t2tb($sum($difference(X3,1),$uminus(X7)))))) & ~$less($sum($difference(X3,1),$uminus(X7)),0) & ~$less(X7,0) & $less(X7,$sum(X0,1)) & ~$less(X7,0) & $less($sum($difference(X3,1),$uminus(X7)),$sum(X0,1)) & ~$less($sum($difference(X3,1),$uminus(X7)),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X8 : tree1] : ((? [X9 : tree1,X10 : tree1] : (node1(X9,X10) = X8 & $less(size1(X9),X7) & size1(X8) = X3) | ~mem(tree,t2tb2(X8),get(list(tree),int,t2tb3(X6),t2tb(X3)))) & (mem(tree,t2tb2(X8),get(list(tree),int,t2tb3(X6),t2tb(X3))) | ! [X9 : tree1,X10 : tree1] : (node1(X9,X10) != X8 | ~$less(size1(X9),X7) | size1(X8) != X3))) & distinct(tree,get(list(tree),int,t2tb3(X6),t2tb(X3))) & ! [X11 : $int] : (all_trees1(X11,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X11)))) | $less(X11,0) | ~$less(X11,X3)) & ~$less(X7,0) & ~$less($sum(X3,$uminus(1)),X7)) & ~$less($sum(X3,$uminus(1)),0) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X5) & ~$less($sum(X0,1),0) & $less(X3,$sum(X0,1)) & ~$less(X3,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,0) & $less(0,$sum(X0,1)) & ~$less($sum(X0,1),0) & ~$less($sum(X0,1),0) & ~$less(X0,0))), 27.91/28.05 inference(nnf_transformation,[],[f159])). 27.91/28.05 tff(f187,plain,( 27.91/28.05 ? [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 | ~$less(size1(X10),$sum(X6,1)) | size1(X9) != X3) & 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,0) & $less(X3,$sum(X0,1)) & ! [X12 : tree1] : ((? [X13 : tree1,X14 : tree1] : (node1(X13,X14) = X12 & size1(X13) = X6 & size1(X14) = $sum($difference(X3,1),$uminus(X6))) | ~mem(tree,t2tb2(X12),t2tb1(X7))) & (mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X15 : tree1,X16 : tree1] : (node1(X15,X16) != X12 | size1(X15) != X6 | size1(X16) != $sum($difference(X3,1),$uminus(X6))))) & distinct(tree,t2tb1(X7))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & all_trees1($sum($difference(X3,1),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($difference(X3,1),$uminus(X6)))))) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & ~$less(X6,0) & $less(X6,$sum(X0,1)) & ~$less(X6,0) & $less($sum($difference(X3,1),$uminus(X6)),$sum(X0,1)) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X17 : tree1] : ((? [X18 : tree1,X19 : tree1] : (node1(X18,X19) = X17 & $less(size1(X18),X6) & size1(X17) = X3) | ~mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X5),t2tb(X3)))) & (mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X20 : tree1,X21 : tree1] : (node1(X20,X21) != X17 | ~$less(size1(X20),X6) | size1(X17) != X3))) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X22 : $int] : (all_trees1(X22,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X22)))) | $less(X22,0) | ~$less(X22,X3)) & ~$less(X6,0) & ~$less($sum(X3,$uminus(1)),X6)) & ~$less($sum(X3,$uminus(1)),0) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X4) & ~$less($sum(X0,1),0) & $less(X3,$sum(X0,1)) & ~$less(X3,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,0) & $less(0,$sum(X0,1)) & ~$less($sum(X0,1),0) & ~$less($sum(X0,1),0) & ~$less(X0,0))), 27.91/28.05 inference(rectify,[],[f186])). 27.91/28.05 tff(f188,plain,( 27.91/28.05 ? [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 | ~$less(size1(X10),$sum(X6,1)) | size1(X9) != X3) & 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,0) & $less(X3,$sum(X0,1)) & ! [X12 : tree1] : ((? [X13 : tree1,X14 : tree1] : (node1(X13,X14) = X12 & size1(X13) = X6 & size1(X14) = $sum($difference(X3,1),$uminus(X6))) | ~mem(tree,t2tb2(X12),t2tb1(X7))) & (mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X15 : tree1,X16 : tree1] : (node1(X15,X16) != X12 | size1(X15) != X6 | size1(X16) != $sum($difference(X3,1),$uminus(X6))))) & distinct(tree,t2tb1(X7))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & all_trees1($sum($difference(X3,1),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($difference(X3,1),$uminus(X6)))))) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & ~$less(X6,0) & $less(X6,$sum(X0,1)) & ~$less(X6,0) & $less($sum($difference(X3,1),$uminus(X6)),$sum(X0,1)) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X17 : tree1] : ((? [X18 : tree1,X19 : tree1] : (node1(X18,X19) = X17 & $less(size1(X18),X6) & size1(X17) = X3) | ~mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X5),t2tb(X3)))) & (mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X20 : tree1,X21 : tree1] : (node1(X20,X21) != X17 | ~$less(size1(X20),X6) | size1(X17) != X3))) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X22 : $int] : (all_trees1(X22,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X22)))) | $less(X22,0) | ~$less(X22,X3)) & ~$less(X6,0) & ~$less($sum(X3,$uminus(1)),X6)) & ~$less($sum(X3,$uminus(1)),0) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X4) & ~$less($sum(X0,1),0) & $less(X3,$sum(X0,1)) & ~$less(X3,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,0) & $less(0,$sum(X0,1)) & ~$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 | ~$less(size1(X10),$sum(X6,1)) | size1(X9) != X3) & 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,0) & $less(X3,$sum(sK0,1)) & ! [X12 : tree1] : ((? [X13 : tree1,X14 : tree1] : (node1(X13,X14) = X12 & size1(X13) = X6 & size1(X14) = $sum($difference(X3,1),$uminus(X6))) | ~mem(tree,t2tb2(X12),t2tb1(X7))) & (mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X15 : tree1,X16 : tree1] : (node1(X15,X16) != X12 | size1(X15) != X6 | size1(X16) != $sum($difference(X3,1),$uminus(X6))))) & distinct(tree,t2tb1(X7))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & all_trees1($sum($difference(X3,1),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($difference(X3,1),$uminus(X6)))))) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & ~$less(X6,0) & $less(X6,$sum(sK0,1)) & ~$less(X6,0) & $less($sum($difference(X3,1),$uminus(X6)),$sum(sK0,1)) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & ~$less(X3,0) & $less(X3,$sum(sK0,1)) & ~$less($sum(sK0,1),0) & ! [X17 : tree1] : ((? [X18 : tree1,X19 : tree1] : (node1(X18,X19) = X17 & $less(size1(X18),X6) & size1(X17) = X3) | ~mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X5),t2tb(X3)))) & (mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X20 : tree1,X21 : tree1] : (node1(X20,X21) != X17 | ~$less(size1(X20),X6) | size1(X17) != X3))) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X22 : $int] : (all_trees1(X22,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X22)))) | $less(X22,0) | ~$less(X22,X3)) & ~$less(X6,0) & ~$less($sum(X3,$uminus(1)),X6)) & ~$less($sum(X3,$uminus(1)),0) & ~$less($sum(sK0,1),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X4) & ~$less($sum(sK0,1),0) & $less(X3,$sum(sK0,1)) & ~$less(X3,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,0) & $less(0,$sum(sK0,1)) & ~$less($sum(sK0,1),0) & ~$less($sum(sK0,1),0) & ~$less(sK0,0))), 27.91/28.05 introduced(choice_axiom,[])). 27.91/28.05 tff(f189,plain,( 27.91/28.05 ( ! [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 | ~$less(size1(X10),$sum(X6,1)) | size1(X9) != X3) & 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,0) & $less(X3,$sum(X0,1)) & ! [X12 : tree1] : ((? [X13 : tree1,X14 : tree1] : (node1(X13,X14) = X12 & size1(X13) = X6 & size1(X14) = $sum($difference(X3,1),$uminus(X6))) | ~mem(tree,t2tb2(X12),t2tb1(X7))) & (mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X15 : tree1,X16 : tree1] : (node1(X15,X16) != X12 | size1(X15) != X6 | size1(X16) != $sum($difference(X3,1),$uminus(X6))))) & distinct(tree,t2tb1(X7))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & all_trees1($sum($difference(X3,1),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($difference(X3,1),$uminus(X6)))))) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & ~$less(X6,0) & $less(X6,$sum(X0,1)) & ~$less(X6,0) & $less($sum($difference(X3,1),$uminus(X6)),$sum(X0,1)) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X17 : tree1] : ((? [X18 : tree1,X19 : tree1] : (node1(X18,X19) = X17 & $less(size1(X18),X6) & size1(X17) = X3) | ~mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X5),t2tb(X3)))) & (mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X20 : tree1,X21 : tree1] : (node1(X20,X21) != X17 | ~$less(size1(X20),X6) | size1(X17) != X3))) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X22 : $int] : (all_trees1(X22,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X22)))) | $less(X22,0) | ~$less(X22,X3)) & ~$less(X6,0) & ~$less($sum(X3,$uminus(1)),X6)) & ~$less($sum(X3,$uminus(1)),0) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X4) & ~$less($sum(X0,1),0) & $less(X3,$sum(X0,1)) & ~$less(X3,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 | ~$less(size1(X10),$sum(X6,1)) | size1(X9) != X3) & 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,0) & $less(X3,$sum(X0,1)) & ! [X12 : tree1] : ((? [X13 : tree1,X14 : tree1] : (node1(X13,X14) = X12 & size1(X13) = X6 & size1(X14) = $sum($difference(X3,1),$uminus(X6))) | ~mem(tree,t2tb2(X12),t2tb1(X7))) & (mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X15 : tree1,X16 : tree1] : (node1(X15,X16) != X12 | size1(X15) != X6 | size1(X16) != $sum($difference(X3,1),$uminus(X6))))) & distinct(tree,t2tb1(X7))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & all_trees1($sum($difference(X3,1),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($difference(X3,1),$uminus(X6)))))) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & ~$less(X6,0) & $less(X6,$sum(X0,1)) & ~$less(X6,0) & $less($sum($difference(X3,1),$uminus(X6)),$sum(X0,1)) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X17 : tree1] : ((? [X18 : tree1,X19 : tree1] : (node1(X18,X19) = X17 & $less(size1(X18),X6) & size1(X17) = X3) | ~mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X5),t2tb(X3)))) & (mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X20 : tree1,X21 : tree1] : (node1(X20,X21) != X17 | ~$less(size1(X20),X6) | size1(X17) != X3))) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X22 : $int] : (all_trees1(X22,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X22)))) | $less(X22,0) | ~$less(X22,X3)) & ~$less(X6,0) & ~$less($sum(X3,$uminus(1)),X6)) & ~$less($sum(X3,$uminus(1)),0) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X4) & ~$less($sum(X0,1),0) & $less(X3,$sum(X0,1)) & ~$less(X3,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.91/28.05 introduced(choice_axiom,[])). 27.91/28.05 tff(f190,plain,( 27.91/28.05 ( ! [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 | ~$less(size1(X10),$sum(X6,1)) | size1(X9) != X3) & 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,0) & $less(X3,$sum(X0,1)) & ! [X12 : tree1] : ((? [X13 : tree1,X14 : tree1] : (node1(X13,X14) = X12 & size1(X13) = X6 & size1(X14) = $sum($difference(X3,1),$uminus(X6))) | ~mem(tree,t2tb2(X12),t2tb1(X7))) & (mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X15 : tree1,X16 : tree1] : (node1(X15,X16) != X12 | size1(X15) != X6 | size1(X16) != $sum($difference(X3,1),$uminus(X6))))) & distinct(tree,t2tb1(X7))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & all_trees1($sum($difference(X3,1),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($difference(X3,1),$uminus(X6)))))) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & ~$less(X6,0) & $less(X6,$sum(X0,1)) & ~$less(X6,0) & $less($sum($difference(X3,1),$uminus(X6)),$sum(X0,1)) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X17 : tree1] : ((? [X18 : tree1,X19 : tree1] : (node1(X18,X19) = X17 & $less(size1(X18),X6) & size1(X17) = X3) | ~mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X5),t2tb(X3)))) & (mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X20 : tree1,X21 : tree1] : (node1(X20,X21) != X17 | ~$less(size1(X20),X6) | size1(X17) != X3))) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X22 : $int] : (all_trees1(X22,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X22)))) | $less(X22,0) | ~$less(X22,X3)) & ~$less(X6,0) & ~$less($sum(X3,$uminus(1)),X6)) & ~$less($sum(X3,$uminus(1)),0) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X4) & ~$less($sum(X0,1),0) & $less(X3,$sum(X0,1)) & ~$less(X3,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 | ~$less(size1(X10),$sum(X6,1)) | size1(X9) != sK3) & 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,0) & $less(sK3,$sum(X0,1)) & ! [X12 : tree1] : ((? [X14 : tree1,X13 : tree1] : (node1(X13,X14) = X12 & size1(X13) = X6 & size1(X14) = $sum($difference(sK3,1),$uminus(X6))) | ~mem(tree,t2tb2(X12),t2tb1(X7))) & (mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X16 : tree1,X15 : tree1] : (node1(X15,X16) != X12 | size1(X15) != X6 | size1(X16) != $sum($difference(sK3,1),$uminus(X6))))) & distinct(tree,t2tb1(X7))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & all_trees1($sum($difference(sK3,1),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($difference(sK3,1),$uminus(X6)))))) & ~$less($sum($difference(sK3,1),$uminus(X6)),0) & ~$less(X6,0) & $less(X6,$sum(X0,1)) & ~$less(X6,0) & $less($sum($difference(sK3,1),$uminus(X6)),$sum(X0,1)) & ~$less($sum($difference(sK3,1),$uminus(X6)),0) & ~$less(sK3,0) & $less(sK3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X17 : tree1] : ((? [X19 : tree1,X18 : tree1] : (node1(X18,X19) = X17 & $less(size1(X18),X6) & size1(X17) = sK3) | ~mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X5),t2tb(sK3)))) & (mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X5),t2tb(sK3))) | ! [X21 : tree1,X20 : tree1] : (node1(X20,X21) != X17 | ~$less(size1(X20),X6) | size1(X17) != sK3))) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(sK3))) & ! [X22 : $int] : (all_trees1(X22,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X22)))) | $less(X22,0) | ~$less(X22,sK3)) & ~$less(X6,0) & ~$less($sum(sK3,$uminus(1)),X6)) & ~$less($sum(sK3,$uminus(1)),0) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,t2tb3(sK2),t2tb(sK3),nil(tree))) = X4) & ~$less($sum(X0,1),0) & $less(sK3,$sum(X0,1)) & ~$less(sK3,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.91/28.05 introduced(choice_axiom,[])). 27.91/28.05 tff(f191,plain,( 27.91/28.05 ( ! [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 | ~$less(size1(X10),$sum(X6,1)) | size1(X9) != X3) & 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,0) & $less(X3,$sum(X0,1)) & ! [X12 : tree1] : ((? [X13 : tree1,X14 : tree1] : (node1(X13,X14) = X12 & size1(X13) = X6 & size1(X14) = $sum($difference(X3,1),$uminus(X6))) | ~mem(tree,t2tb2(X12),t2tb1(X7))) & (mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X15 : tree1,X16 : tree1] : (node1(X15,X16) != X12 | size1(X15) != X6 | size1(X16) != $sum($difference(X3,1),$uminus(X6))))) & distinct(tree,t2tb1(X7))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & all_trees1($sum($difference(X3,1),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($difference(X3,1),$uminus(X6)))))) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & ~$less(X6,0) & $less(X6,$sum(X0,1)) & ~$less(X6,0) & $less($sum($difference(X3,1),$uminus(X6)),$sum(X0,1)) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X17 : tree1] : ((? [X18 : tree1,X19 : tree1] : (node1(X18,X19) = X17 & $less(size1(X18),X6) & size1(X17) = X3) | ~mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X5),t2tb(X3)))) & (mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X20 : tree1,X21 : tree1] : (node1(X20,X21) != X17 | ~$less(size1(X20),X6) | size1(X17) != X3))) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X22 : $int] : (all_trees1(X22,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X22)))) | $less(X22,0) | ~$less(X22,X3)) & ~$less(X6,0) & ~$less($sum(X3,$uminus(1)),X6)) & ~$less($sum(X3,$uminus(1)),0) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X4) => (? [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 | ~$less(size1(X10),$sum(X6,1)) | size1(X9) != X3) & 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,0) & $less(X3,$sum(X0,1)) & ! [X12 : tree1] : ((? [X13 : tree1,X14 : tree1] : (node1(X13,X14) = X12 & size1(X13) = X6 & size1(X14) = $sum($difference(X3,1),$uminus(X6))) | ~mem(tree,t2tb2(X12),t2tb1(X7))) & (mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X15 : tree1,X16 : tree1] : (node1(X15,X16) != X12 | size1(X15) != X6 | size1(X16) != $sum($difference(X3,1),$uminus(X6))))) & distinct(tree,t2tb1(X7))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & all_trees1($sum($difference(X3,1),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($difference(X3,1),$uminus(X6)))))) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & ~$less(X6,0) & $less(X6,$sum(X0,1)) & ~$less(X6,0) & $less($sum($difference(X3,1),$uminus(X6)),$sum(X0,1)) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X17 : tree1] : ((? [X18 : tree1,X19 : tree1] : (node1(X18,X19) = X17 & $less(size1(X18),X6) & size1(X17) = X3) | ~mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X5),t2tb(X3)))) & (mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X20 : tree1,X21 : tree1] : (node1(X20,X21) != X17 | ~$less(size1(X20),X6) | size1(X17) != X3))) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X22 : $int] : (all_trees1(X22,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X22)))) | $less(X22,0) | ~$less(X22,X3)) & ~$less(X6,0) & ~$less($sum(X3,$uminus(1)),X6)) & ~$less($sum(X3,$uminus(1)),0) & ~$less($sum(X0,1),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = sK4)) )), 27.91/28.05 introduced(choice_axiom,[])). 27.91/28.05 tff(f192,plain,( 27.91/28.05 ( ! [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 | ~$less(size1(X10),$sum(X6,1)) | size1(X9) != X3) & 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,0) & $less(X3,$sum(X0,1)) & ! [X12 : tree1] : ((? [X13 : tree1,X14 : tree1] : (node1(X13,X14) = X12 & size1(X13) = X6 & size1(X14) = $sum($difference(X3,1),$uminus(X6))) | ~mem(tree,t2tb2(X12),t2tb1(X7))) & (mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X15 : tree1,X16 : tree1] : (node1(X15,X16) != X12 | size1(X15) != X6 | size1(X16) != $sum($difference(X3,1),$uminus(X6))))) & distinct(tree,t2tb1(X7))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & all_trees1($sum($difference(X3,1),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($difference(X3,1),$uminus(X6)))))) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & ~$less(X6,0) & $less(X6,$sum(X0,1)) & ~$less(X6,0) & $less($sum($difference(X3,1),$uminus(X6)),$sum(X0,1)) & ~$less($sum($difference(X3,1),$uminus(X6)),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X17 : tree1] : ((? [X18 : tree1,X19 : tree1] : (node1(X18,X19) = X17 & $less(size1(X18),X6) & size1(X17) = X3) | ~mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X5),t2tb(X3)))) & (mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X20 : tree1,X21 : tree1] : (node1(X20,X21) != X17 | ~$less(size1(X20),X6) | size1(X17) != X3))) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X22 : $int] : (all_trees1(X22,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X22)))) | $less(X22,0) | ~$less(X22,X3)) & ~$less(X6,0) & ~$less($sum(X3,$uminus(1)),X6)) => (? [X7 : list_tree] : (? [X8 : map_int_lplist_treerp] : (? [X9 : tree1] : (! [X11 : tree1,X10 : tree1] : (node1(X10,X11) != X9 | ~$less(size1(X10),$sum(sK6,1)) | size1(X9) != X3) & 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,0) & $less(X3,$sum(X0,1)) & ! [X12 : tree1] : ((? [X14 : tree1,X13 : tree1] : (node1(X13,X14) = X12 & size1(X13) = sK6 & size1(X14) = $sum($difference(X3,1),$uminus(sK6))) | ~mem(tree,t2tb2(X12),t2tb1(X7))) & (mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X16 : tree1,X15 : tree1] : (node1(X15,X16) != X12 | size1(X15) != sK6 | size1(X16) != $sum($difference(X3,1),$uminus(sK6))))) & distinct(tree,t2tb1(X7))) & all_trees1(sK6,tb2t1(get(list(tree),int,t2tb3(sK5),t2tb(sK6)))) & all_trees1($sum($difference(X3,1),$uminus(sK6)),tb2t1(get(list(tree),int,t2tb3(sK5),t2tb($sum($difference(X3,1),$uminus(sK6)))))) & ~$less($sum($difference(X3,1),$uminus(sK6)),0) & ~$less(sK6,0) & $less(sK6,$sum(X0,1)) & ~$less(sK6,0) & $less($sum($difference(X3,1),$uminus(sK6)),$sum(X0,1)) & ~$less($sum($difference(X3,1),$uminus(sK6)),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X17 : tree1] : ((? [X19 : tree1,X18 : tree1] : (node1(X18,X19) = X17 & $less(size1(X18),sK6) & size1(X17) = X3) | ~mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(sK5),t2tb(X3)))) & (mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(sK5),t2tb(X3))) | ! [X21 : tree1,X20 : tree1] : (node1(X20,X21) != X17 | ~$less(size1(X20),sK6) | size1(X17) != X3))) & distinct(tree,get(list(tree),int,t2tb3(sK5),t2tb(X3))) & ! [X22 : $int] : (all_trees1(X22,tb2t1(get(list(tree),int,t2tb3(sK5),t2tb(X22)))) | $less(X22,0) | ~$less(X22,X3)) & ~$less(sK6,0) & ~$less($sum(X3,$uminus(1)),sK6))) )), 27.91/28.05 introduced(choice_axiom,[])). 27.91/28.05 tff(f193,plain,( 27.91/28.05 ( ! [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 | ~$less(size1(X10),$sum(X6,1)) | size1(X9) != X3) & 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,0) & $less(X3,$sum(X0,1)) & ! [X12 : tree1] : ((? [X13 : tree1,X14 : tree1] : (node1(X13,X14) = X12 & size1(X13) = X6 & size1(X14) = $sum($difference(X3,1),$uminus(X6))) | ~mem(tree,t2tb2(X12),t2tb1(X7))) & (mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X15 : tree1,X16 : tree1] : (node1(X15,X16) != X12 | size1(X15) != X6 | size1(X16) != $sum($difference(X3,1),$uminus(X6))))) & distinct(tree,t2tb1(X7))) => (? [X8 : map_int_lplist_treerp] : (? [X9 : tree1] : (! [X10 : tree1,X11 : tree1] : (node1(X10,X11) != X9 | ~$less(size1(X10),$sum(X6,1)) | size1(X9) != X3) & 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,0) & $less(X3,$sum(X0,1)) & ! [X12 : tree1] : ((? [X13 : tree1,X14 : tree1] : (node1(X13,X14) = X12 & size1(X13) = X6 & size1(X14) = $sum($difference(X3,1),$uminus(X6))) | ~mem(tree,t2tb2(X12),t2tb1(sK7))) & (mem(tree,t2tb2(X12),t2tb1(sK7)) | ! [X15 : tree1,X16 : tree1] : (node1(X15,X16) != X12 | size1(X15) != X6 | size1(X16) != $sum($difference(X3,1),$uminus(X6))))) & distinct(tree,t2tb1(sK7)))) )), 27.91/28.05 introduced(choice_axiom,[])). 27.91/28.05 tff(f194,plain,( 27.91/28.05 ( ! [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 | ~$less(size1(X10),$sum(X6,1)) | size1(X9) != X3) & 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 | ~$less(size1(X10),$sum(X6,1)) | size1(X9) != X3) & 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.91/28.05 introduced(choice_axiom,[])). 27.91/28.05 tff(f195,plain,( 27.91/28.05 ( ! [X6:$int,X8:map_int_lplist_treerp,X3:$int] : (? [X9 : tree1] : (! [X10 : tree1,X11 : tree1] : (node1(X10,X11) != X9 | ~$less(size1(X10),$sum(X6,1)) | size1(X9) != X3) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) => (! [X11 : tree1,X10 : tree1] : (node1(X10,X11) != sK9 | ~$less(size1(X10),$sum(X6,1)) | size1(sK9) != X3) & mem(tree,t2tb2(sK9),get(list(tree),int,t2tb3(X8),t2tb(X3))))) )), 27.91/28.05 introduced(choice_axiom,[])). 27.91/28.05 tff(f196,plain,( 27.91/28.05 ( ! [X6:$int,X3:$int] : (! [X12 : tree1] : (? [X13 : tree1,X14 : tree1] : (node1(X13,X14) = X12 & size1(X13) = X6 & size1(X14) = $sum($difference(X3,1),$uminus(X6))) => (node1(sK10(X12),sK11(X12)) = X12 & size1(sK10(X12)) = X6 & size1(sK11(X12)) = $sum($difference(X3,1),$uminus(X6))))) )), 27.91/28.05 introduced(choice_axiom,[])). 27.91/28.05 tff(f197,plain,( 27.91/28.05 ( ! [X6:$int,X3:$int] : (! [X17 : tree1] : (? [X18 : tree1,X19 : tree1] : (node1(X18,X19) = X17 & $less(size1(X18),X6) & size1(X17) = X3) => (node1(sK12(X17),sK13(X17)) = X17 & $less(size1(sK12(X17)),X6) & size1(X17) = X3))) )), 27.91/28.05 introduced(choice_axiom,[])). 27.91/28.05 tff(f198,plain,( 27.91/28.05 (((((((! [X10 : tree1,X11 : tree1] : (node1(X10,X11) != sK9 | ~$less(size1(X10),$sum(sK6,1)) | size1(sK9) != sK3) & 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,0) & $less(sK3,$sum(sK0,1)) & ! [X12 : tree1] : (((node1(sK10(X12),sK11(X12)) = X12 & size1(sK10(X12)) = sK6 & size1(sK11(X12)) = $sum($difference(sK3,1),$uminus(sK6))) | ~mem(tree,t2tb2(X12),t2tb1(sK7))) & (mem(tree,t2tb2(X12),t2tb1(sK7)) | ! [X15 : tree1,X16 : tree1] : (node1(X15,X16) != X12 | size1(X15) != sK6 | size1(X16) != $sum($difference(sK3,1),$uminus(sK6))))) & distinct(tree,t2tb1(sK7))) & all_trees1(sK6,tb2t1(get(list(tree),int,t2tb3(sK5),t2tb(sK6)))) & all_trees1($sum($difference(sK3,1),$uminus(sK6)),tb2t1(get(list(tree),int,t2tb3(sK5),t2tb($sum($difference(sK3,1),$uminus(sK6)))))) & ~$less($sum($difference(sK3,1),$uminus(sK6)),0) & ~$less(sK6,0) & $less(sK6,$sum(sK0,1)) & ~$less(sK6,0) & $less($sum($difference(sK3,1),$uminus(sK6)),$sum(sK0,1)) & ~$less($sum($difference(sK3,1),$uminus(sK6)),0) & ~$less(sK3,0) & $less(sK3,$sum(sK0,1)) & ~$less($sum(sK0,1),0) & ! [X17 : tree1] : (((node1(sK12(X17),sK13(X17)) = X17 & $less(size1(sK12(X17)),sK6) & size1(X17) = sK3) | ~mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) & (mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | ! [X20 : tree1,X21 : tree1] : (node1(X20,X21) != X17 | ~$less(size1(X20),sK6) | size1(X17) != sK3))) & distinct(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3))) & ! [X22 : $int] : (all_trees1(X22,tb2t1(get(list(tree),int,t2tb3(sK5),t2tb(X22)))) | $less(X22,0) | ~$less(X22,sK3)) & ~$less(sK6,0) & ~$less($sum(sK3,$uminus(1)),sK6)) & ~$less($sum(sK3,$uminus(1)),0) & ~$less($sum(sK0,1),0) & tb2t3(set(list(tree),int,t2tb3(sK2),t2tb(sK3),nil(tree))) = sK4) & ~$less($sum(sK0,1),0) & $less(sK3,$sum(sK0,1)) & ~$less(sK3,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,0) & $less(0,$sum(sK0,1)) & ~$less($sum(sK0,1),0) & ~$less($sum(sK0,1),0) & ~$less(sK0,0)), 27.91/28.05 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8,sK9,sK10,sK11,sK12,sK13])],[f187,f197,f196,f195,f194,f193,f192,f191,f190,f189,f188])). 27.91/28.05 tff(f199,plain,( 27.91/28.05 ! [X0 : tree1] : (? [X1 : tree1,X2 : tree1] : (node1(X1,X2) = X0 & $less(size1(X1),size1(X0))) => (node1(sK14(X0),sK15(X0)) = X0 & $less(size1(sK14(X0)),size1(X0))))), 27.91/28.05 introduced(choice_axiom,[])). 27.91/28.05 tff(f200,plain,( 27.91/28.05 ! [X0 : tree1] : ((node1(sK14(X0),sK15(X0)) = X0 & $less(size1(sK14(X0)),size1(X0))) | ~$less(0,size1(X0)))), 27.91/28.05 inference(skolemisation,[status(esa),new_symbols(skolem,[sK14,sK15])],[f160,f199])). 27.91/28.05 tff(f207,plain,( 27.91/28.05 ! [X0 : $int,X1 : list_tree] : ((! [X2 : tree1] : ((mem(tree,t2tb2(X2),t2tb1(X1)) | size1(X2) != X0) & (size1(X2) = X0 | ~mem(tree,t2tb2(X2),t2tb1(X1)))) & distinct(tree,t2tb1(X1))) | ~all_trees1(X0,X1))), 27.91/28.05 inference(nnf_transformation,[],[f165])). 27.91/28.05 tff(f208,plain,( 27.91/28.05 ! [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.91/28.05 introduced(choice_axiom,[])). 27.91/28.05 tff(f209,plain,( 27.91/28.05 ! [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.91/28.05 inference(skolemisation,[status(esa),new_symbols(skolem,[sK19])],[f167,f208])). 27.91/28.05 tff(f212,plain,( 27.91/28.05 ! [X0 : ty,X1 : uni,X2 : uni,X3 : uni] : ((mem(X0,X1,infix_plpl(X0,X2,X3)) | (~mem(X0,X1,X3) & ~mem(X0,X1,X2))) & ((mem(X0,X1,X3) | mem(X0,X1,X2)) | ~mem(X0,X1,infix_plpl(X0,X2,X3))))), 27.91/28.05 inference(nnf_transformation,[],[f150])). 27.91/28.05 tff(f213,plain,( 27.91/28.05 ! [X0 : ty,X1 : uni,X2 : uni,X3 : uni] : ((mem(X0,X1,infix_plpl(X0,X2,X3)) | (~mem(X0,X1,X3) & ~mem(X0,X1,X2))) & (mem(X0,X1,X3) | mem(X0,X1,X2) | ~mem(X0,X1,infix_plpl(X0,X2,X3))))), 27.91/28.05 inference(flattening,[],[f212])). 27.91/28.05 tff(f214,plain,( 27.91/28.05 ~$less(sK0,0)), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f217,plain,( 27.91/28.05 $less(0,$sum(sK0,1))), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f219,plain,( 27.91/28.05 tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = sK1), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f221,plain,( 27.91/28.05 ~$less(sK0,1)), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f222,plain,( 27.91/28.05 ~$less(sK3,1)), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f223,plain,( 27.91/28.05 ~$less(sK0,sK3)), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f228,plain,( 27.91/28.05 tb2t3(set(list(tree),int,t2tb3(sK2),t2tb(sK3),nil(tree))) = sK4), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f231,plain,( 27.91/28.05 ~$less($sum(sK3,$uminus(1)),sK6)), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f234,plain,( 27.91/28.05 distinct(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f235,plain,( 27.91/28.05 ( ! [X21:tree1,X17:tree1,X20:tree1] : (mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | node1(X20,X21) != X17 | ~$less(size1(X20),sK6) | size1(X17) != sK3) )), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f236,plain,( 27.91/28.05 ( ! [X17:tree1] : (~mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | size1(X17) = sK3) )), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f237,plain,( 27.91/28.05 ( ! [X17:tree1] : ($less(size1(sK12(X17)),sK6) | ~mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) )), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f238,plain,( 27.91/28.05 ( ! [X17:tree1] : (~mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | node1(sK12(X17),sK13(X17)) = X17) )), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f243,plain,( 27.91/28.05 $less($sum($difference(sK3,1),$uminus(sK6)),$sum(sK0,1))), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f245,plain,( 27.91/28.05 $less(sK6,$sum(sK0,1))), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f246,plain,( 27.91/28.05 ~$less(sK6,0)), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f247,plain,( 27.91/28.05 ~$less($sum($difference(sK3,1),$uminus(sK6)),0)), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f249,plain,( 27.91/28.05 all_trees1(sK6,tb2t1(get(list(tree),int,t2tb3(sK5),t2tb(sK6))))), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f250,plain,( 27.91/28.05 distinct(tree,t2tb1(sK7))), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f251,plain,( 27.91/28.05 ( ! [X12:tree1,X15:tree1,X16:tree1] : (mem(tree,t2tb2(X12),t2tb1(sK7)) | node1(X15,X16) != X12 | size1(X15) != sK6 | size1(X16) != $sum($difference(sK3,1),$uminus(sK6))) )), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f252,plain,( 27.91/28.05 ( ! [X12:tree1] : (size1(sK11(X12)) = $sum($difference(sK3,1),$uminus(sK6)) | ~mem(tree,t2tb2(X12),t2tb1(sK7))) )), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f253,plain,( 27.91/28.05 ( ! [X12:tree1] : (~mem(tree,t2tb2(X12),t2tb1(sK7)) | size1(sK10(X12)) = sK6) )), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f254,plain,( 27.91/28.05 ( ! [X12:tree1] : (node1(sK10(X12),sK11(X12)) = X12 | ~mem(tree,t2tb2(X12),t2tb1(sK7))) )), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f255,plain,( 27.91/28.05 $less(sK3,$sum(sK0,1))), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f256,plain,( 27.91/28.05 ~$less(sK3,0)), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f257,plain,( 27.91/28.05 tb2t3(set(list(tree),int,t2tb3(sK5),t2tb(sK3),infix_plpl(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3))))) = sK8), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f258,plain,( 27.91/28.05 ~$less($sum(sK0,1),0)), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f259,plain,( 27.91/28.05 mem(tree,t2tb2(sK9),get(list(tree),int,t2tb3(sK8),t2tb(sK3)))), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f260,plain,( 27.91/28.05 ( ! [X10:tree1,X11:tree1] : (node1(X10,X11) != sK9 | ~$less(size1(X10),$sum(sK6,1)) | size1(sK9) != sK3) )), 27.91/28.05 inference(cnf_transformation,[],[f198])). 27.91/28.05 tff(f264,plain,( 27.91/28.05 ( ! [X0:tree1,X1:tree1] : (size1(node1(X0,X1)) = $sum($sum(1,size1(X0)),size1(X1))) )), 27.91/28.05 inference(cnf_transformation,[],[f85])). 27.91/28.05 tff(f266,plain,( 27.91/28.05 ( ! [X0:tree1] : (~$less(size1(X0),0)) )), 27.91/28.05 inference(cnf_transformation,[],[f86])). 27.91/28.05 tff(f268,plain,( 27.91/28.05 ( ! [X0:$int] : (sort1(int,t2tb(X0))) )), 27.91/28.05 inference(cnf_transformation,[],[f88])). 27.91/28.05 tff(f273,plain,( 27.91/28.05 ( ! [X0:tree1] : (tb2t2(t2tb2(X0)) = X0) )), 27.91/28.05 inference(cnf_transformation,[],[f93])). 27.91/28.05 tff(f274,plain,( 27.91/28.05 ( ! [X0:uni] : (t2tb3(tb2t3(X0)) = X0) )), 27.91/28.05 inference(cnf_transformation,[],[f94])). 27.91/28.05 tff(f277,plain,( 27.91/28.05 ( ! [X0:uni] : (t2tb2(tb2t2(X0)) = X0) )), 27.91/28.05 inference(cnf_transformation,[],[f97])). 27.91/28.05 tff(f280,plain,( 27.91/28.05 ( ! [X0:ty] : (sort1(list(X0),nil(X0))) )), 27.91/28.05 inference(cnf_transformation,[],[f100])). 27.91/28.05 tff(f285,plain,( 27.91/28.05 ( ! [X0:tree1] : (node1(node_proj_11(X0),node_proj_21(X0)) = X0 | empty1 = X0) )), 27.91/28.05 inference(cnf_transformation,[],[f29])). 27.91/28.05 tff(f287,plain,( 27.91/28.05 ( ! [X0:tree1] : (node1(sK14(X0),sK15(X0)) = X0 | ~$less(0,size1(X0))) )), 27.91/28.05 inference(cnf_transformation,[],[f200])). 27.91/28.05 tff(f288,plain,( 27.91/28.05 ( ! [X0:tree1,X1:tree1] : (empty1 != node1(X0,X1)) )), 27.91/28.05 inference(cnf_transformation,[],[f104])). 27.91/28.05 tff(f291,plain,( 27.91/28.05 ( ! [X0:tree1,X1:tree1] : (node_proj_21(node1(X0,X1)) = X1) )), 27.91/28.05 inference(cnf_transformation,[],[f107])). 27.91/28.05 tff(f292,plain,( 27.91/28.05 ( ! [X0:tree1,X1:tree1] : (node_proj_11(node1(X0,X1)) = X0) )), 27.91/28.05 inference(cnf_transformation,[],[f108])). 27.91/28.05 tff(f315,plain,( 27.91/28.05 ( ! [X2:tree1,X0:tree1,X3:tree1,X1:tree1] : (node1(X0,X2) != node1(X1,X3) | size1(X0) = size1(X1)) )), 27.91/28.05 inference(cnf_transformation,[],[f164])). 27.91/28.05 tff(f319,plain,( 27.91/28.05 ( ! [X2:tree1,X0:$int,X1:list_tree] : (~mem(tree,t2tb2(X2),t2tb1(X1)) | size1(X2) = X0 | ~all_trees1(X0,X1)) )), 27.91/28.05 inference(cnf_transformation,[],[f207])). 27.91/28.05 tff(f320,plain,( 27.91/28.05 ( ! [X2:tree1,X0:$int,X1:list_tree] : (mem(tree,t2tb2(X2),t2tb1(X1)) | size1(X2) != X0 | ~all_trees1(X0,X1)) )), 27.91/28.05 inference(cnf_transformation,[],[f207])). 27.91/28.05 tff(f324,plain,( 27.91/28.05 ( ! [X2:uni,X0:ty,X1:uni] : (sort1(list(X0),infix_plpl(X0,X1,X2))) )), 27.91/28.05 inference(cnf_transformation,[],[f124])). 27.91/28.05 tff(f325,plain,( 27.91/28.05 ( ! [X2:uni,X0:ty,X1:uni] : (sort1(list(X0),cons(X0,X1,X2))) )), 27.91/28.05 inference(cnf_transformation,[],[f125])). 27.91/28.05 tff(f333,plain,( 27.91/28.05 ( ! [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.91/28.05 inference(cnf_transformation,[],[f209])). 27.91/28.05 tff(f334,plain,( 27.91/28.05 ( ! [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.91/28.05 inference(cnf_transformation,[],[f209])). 27.91/28.05 tff(f335,plain,( 27.91/28.05 ( ! [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.91/28.05 inference(cnf_transformation,[],[f209])). 27.91/28.05 tff(f353,plain,( 27.91/28.05 ( ! [X2:uni,X0:ty,X3:uni,X1:ty] : (get(X1,X0,const(X1,X0,X2),X3) = X2 | ~sort1(X1,X2)) )), 27.91/28.05 inference(cnf_transformation,[],[f179])). 27.91/28.05 tff(f354,plain,( 27.91/28.05 ( ! [X2:uni,X0:ty,X3:uni,X1:uni] : (~mem(X0,X1,infix_plpl(X0,X2,X3)) | mem(X0,X1,X2) | mem(X0,X1,X3)) )), 27.91/28.05 inference(cnf_transformation,[],[f213])). 27.91/28.05 tff(f360,plain,( 27.91/28.05 ( ! [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.91/28.05 inference(cnf_transformation,[],[f182])). 27.91/28.05 tff(f362,plain,( 27.91/28.05 ( ! [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.91/28.05 inference(cnf_transformation,[],[f185])). 27.91/28.05 tff(f366,plain,( 27.91/28.05 ( ! [X15:tree1,X16:tree1] : (mem(tree,t2tb2(node1(X15,X16)),t2tb1(sK7)) | size1(X15) != sK6 | size1(X16) != $sum($difference(sK3,1),$uminus(sK6))) )), 27.91/28.05 inference(equality_resolution,[],[f251])). 27.91/28.05 tff(f367,plain,( 27.91/28.05 ( ! [X21:tree1,X20:tree1] : (mem(tree,t2tb2(node1(X20,X21)),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | ~$less(size1(X20),sK6) | size1(node1(X20,X21)) != sK3) )), 27.91/28.05 inference(equality_resolution,[],[f235])). 27.91/28.05 tff(f370,plain,( 27.91/28.05 ( ! [X2:tree1,X1:list_tree] : (mem(tree,t2tb2(X2),t2tb1(X1)) | ~all_trees1(size1(X2),X1)) )), 27.91/28.05 inference(equality_resolution,[],[f320])). 27.91/28.05 tff(f371,plain,( 27.91/28.05 ( ! [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.91/28.05 inference(equality_resolution,[],[f362])). 27.91/28.05 tff(f372,plain,( 27.91/28.05 ( ! [X12:$int,X10:tree1,X13:$int,X11:tree1] : (node1(X10,X11) != sK9 | size1(X10) != X12 | sK6 != X13 | ~$less(X12,$sum(X13,1)) | size1(sK9) != sK3) )), 27.91/28.05 inference(theory_flattening,[],[f260])). 27.91/28.05 tff(f373,plain,( 27.91/28.05 ( ! [X1:$int] : (sK0 != X1 | ~$less($sum(X1,1),0)) )), 27.91/28.05 inference(theory_flattening,[],[f258])). 27.91/28.05 tff(f374,plain,( 27.91/28.05 ( ! [X1:$int] : (sK3 != X1 | ~$less(X1,0)) )), 27.91/28.05 inference(theory_flattening,[],[f256])). 27.91/28.05 tff(f375,plain,( 27.91/28.05 ( ! [X2:$int,X1:$int] : (sK3 != X1 | sK0 != X2 | $less(X1,$sum(X2,1))) )), 27.91/28.05 inference(theory_flattening,[],[f255])). 27.91/28.05 tff(f376,plain,( 27.91/28.05 ( ! [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.91/28.05 inference(theory_flattening,[],[f252])). 27.91/28.05 tff(f377,plain,( 27.91/28.05 ( ! [X19:$int,X17:$int,X15:tree1,X18:$int,X16:tree1] : ($sum($difference(X18,1),$uminus(X19)) != X17 | size1(X15) != sK6 | size1(X16) != X17 | sK3 != X18 | sK6 != X19 | mem(tree,t2tb2(node1(X15,X16)),t2tb1(sK7))) )), 27.91/28.05 inference(theory_flattening,[],[f366])). 27.91/28.05 tff(f379,plain,( 27.91/28.05 ( ! [X2:$int,X1:$int] : (sK6 != X2 | sK3 != X1 | ~$less($sum($difference(X1,1),$uminus(X2)),0)) )), 27.91/28.05 inference(theory_flattening,[],[f247])). 27.91/28.05 tff(f380,plain,( 27.91/28.05 ( ! [X1:$int] : (sK6 != X1 | ~$less(X1,0)) )), 27.91/28.05 inference(theory_flattening,[],[f246])). 27.91/28.05 tff(f381,plain,( 27.91/28.05 ( ! [X2:$int,X1:$int] : (sK6 != X1 | sK0 != X2 | $less(X1,$sum(X2,1))) )), 27.91/28.05 inference(theory_flattening,[],[f245])). 27.91/28.05 tff(f383,plain,( 27.91/28.05 ( ! [X2:$int,X3:$int,X1:$int] : (sK6 != X2 | sK3 != X1 | sK0 != X3 | $less($sum($difference(X1,1),$uminus(X2)),$sum(X3,1))) )), 27.91/28.05 inference(theory_flattening,[],[f243])). 27.91/28.05 tff(f388,plain,( 27.91/28.05 ( ! [X19:$int,X17:tree1,X18:$int] : (size1(sK12(X17)) != X18 | sK6 != X19 | $less(X18,X19) | ~mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) )), 27.91/28.05 inference(theory_flattening,[],[f237])). 27.91/28.05 tff(f389,plain,( 27.91/28.05 ( ! [X23:$int,X21:tree1,X22:$int,X20:tree1] : (size1(node1(X20,X21)) != sK3 | size1(X20) != X22 | sK6 != X23 | ~$less(X22,X23) | mem(tree,t2tb2(node1(X20,X21)),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) )), 27.91/28.05 inference(theory_flattening,[],[f367])). 27.91/28.05 tff(f392,plain,( 27.91/28.05 ( ! [X2:$int,X1:$int] : (sK3 != X1 | sK6 != X2 | ~$less($sum(X1,$uminus(1)),X2)) )), 27.91/28.05 inference(theory_flattening,[],[f231])). 27.91/28.05 tff(f399,plain,( 27.91/28.05 ( ! [X2:$int,X1:$int] : (sK3 != X2 | sK0 != X1 | ~$less(X1,X2)) )), 27.91/28.05 inference(theory_flattening,[],[f223])). 27.91/28.05 tff(f400,plain,( 27.91/28.05 ( ! [X1:$int] : (sK3 != X1 | ~$less(X1,1)) )), 27.91/28.05 inference(theory_flattening,[],[f222])). 27.91/28.05 tff(f401,plain,( 27.91/28.05 ( ! [X1:$int] : (sK0 != X1 | ~$less(X1,1)) )), 27.91/28.05 inference(theory_flattening,[],[f221])). 27.91/28.05 tff(f403,plain,( 27.91/28.05 ( ! [X1:$int] : (sK0 != X1 | $less(0,$sum(X1,1))) )), 27.91/28.05 inference(theory_flattening,[],[f217])). 27.91/28.05 tff(f406,plain,( 27.91/28.05 ( ! [X1:$int] : (sK0 != X1 | ~$less(X1,0)) )), 27.91/28.05 inference(theory_flattening,[],[f214])). 27.91/28.05 tff(f407,plain,( 27.91/28.05 ( ! [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.91/28.05 inference(theory_flattening,[],[f264])). 27.91/28.05 tff(f409,plain,( 27.91/28.05 ( ! [X0:tree1,X1:$int] : (size1(X0) != X1 | ~$less(X1,0)) )), 27.91/28.05 inference(theory_flattening,[],[f266])). 27.91/28.05 tff(f412,plain,( 27.91/28.05 ( ! [X0:tree1,X1:$int] : (size1(X0) != X1 | node1(sK14(X0),sK15(X0)) = X0 | ~$less(0,X1)) )), 27.91/28.05 inference(theory_flattening,[],[f287])). 27.91/28.05 tff(f418,plain,( 27.91/28.05 ( ! [X1:$int] : (sK0 != X1 | ~$less(X1,$uminus(1))) )), 27.91/28.05 inference(evaluation,[],[f373])). 27.91/28.05 tff(f419,plain,( 27.91/28.05 ( ! [X1:$int] : (sK0 != X1 | ~$less(X1,-1)) )), 27.91/28.05 inference(evaluation,[],[f418])). 27.91/28.05 tff(f422,plain,( 27.91/28.05 ( ! [X2:$int,X1:$int] : (sK6 != X2 | sK3 != X1 | ~$less($sum(X1,-1),X2)) )), 27.91/28.05 inference(evaluation,[],[f392])). 27.91/28.05 tff(f431,plain,( 27.91/28.05 ( ! [X1:$int] : (sK0 != X1 | $less($uminus(1),X1)) )), 27.91/28.05 inference(evaluation,[],[f403])). 27.91/28.05 tff(f432,plain,( 27.91/28.05 ( ! [X1:$int] : (sK0 != X1 | $less(-1,X1)) )), 27.91/28.05 inference(evaluation,[],[f431])). 27.91/28.05 tff(f438,plain,( 27.91/28.05 spl22_1 <=> ~distinct(tree,t2tb1(sK7))), 27.91/28.05 introduced(avatar_definition,[new_symbols(naming,[spl22_1])])). 27.91/28.05 tff(f441,plain,( 27.91/28.05 spl22_0 <=> distinct(tree,t2tb1(sK7))), 27.91/28.05 introduced(avatar_definition,[new_symbols(naming,[spl22_0])])). 27.91/28.05 tff(f443,plain,( 27.91/28.05 spl22_0), 27.91/28.05 inference(avatar_split_clause,[],[f250,f441])). 27.91/28.05 tff(f444,plain,( 27.91/28.05 ~$less(sK3,0)), 27.91/28.05 inference(equality_resolution,[],[f374])). 27.91/28.05 tff(f449,plain,( 27.91/28.05 spl22_3 <=> ~$less(sK3,0)), 27.91/28.05 introduced(avatar_definition,[new_symbols(naming,[spl22_3])])). 27.91/28.05 tff(f451,plain,( 27.91/28.05 ~spl22_3), 27.91/28.05 inference(avatar_split_clause,[],[f444,f449])). 27.91/28.05 tff(f452,plain,( 27.91/28.05 ~$less(sK6,0)), 27.91/28.05 inference(equality_resolution,[],[f380])). 27.91/28.05 tff(f457,plain,( 27.91/28.05 spl22_5 <=> ~$less(sK6,0)), 27.91/28.05 introduced(avatar_definition,[new_symbols(naming,[spl22_5])])). 27.91/28.05 tff(f459,plain,( 27.91/28.05 ~spl22_5), 27.91/28.05 inference(avatar_split_clause,[],[f452,f457])). 27.91/28.05 tff(f460,plain,( 27.91/28.05 ~$less(sK3,1)), 27.91/28.05 inference(equality_resolution,[],[f400])). 27.91/28.05 tff(f465,plain,( 27.91/28.05 spl22_7 <=> ~$less(sK3,1)), 27.91/28.05 introduced(avatar_definition,[new_symbols(naming,[spl22_7])])). 27.91/28.05 tff(f467,plain,( 27.91/28.05 ~spl22_7), 27.91/28.05 inference(avatar_split_clause,[],[f460,f465])). 27.91/28.05 tff(f468,plain,( 27.91/28.05 ~$less(sK0,1)), 27.91/28.05 inference(equality_resolution,[],[f401])). 27.91/28.05 tff(f469,plain,( 27.91/28.05 ~$less(sK0,0)), 27.91/28.05 inference(equality_resolution,[],[f406])). 27.91/28.05 tff(f474,plain,( 27.91/28.05 spl22_9 <=> ~$less(sK0,1)), 27.91/28.05 introduced(avatar_definition,[new_symbols(naming,[spl22_9])])). 27.91/28.05 tff(f476,plain,( 27.91/28.05 ~spl22_9), 27.91/28.05 inference(avatar_split_clause,[],[f468,f474])). 27.91/28.05 tff(f481,plain,( 27.91/28.05 spl22_11 <=> ~$less(sK0,0)), 27.91/28.05 introduced(avatar_definition,[new_symbols(naming,[spl22_11])])). 27.91/28.05 tff(f483,plain,( 27.91/28.05 ~spl22_11), 27.91/28.05 inference(avatar_split_clause,[],[f469,f481])). 27.91/28.05 tff(f484,plain,( 27.91/28.05 ~$less(sK0,-1)), 27.91/28.05 inference(equality_resolution,[],[f419])). 27.91/28.05 tff(f489,plain,( 27.91/28.05 spl22_13 <=> ~$less(sK0,-1)), 27.91/28.05 introduced(avatar_definition,[new_symbols(naming,[spl22_13])])). 27.91/28.05 tff(f491,plain,( 27.91/28.05 ~spl22_13), 27.91/28.05 inference(avatar_split_clause,[],[f484,f489])). 27.91/28.05 tff(f492,plain,( 27.91/28.05 $less(-1,sK0)), 27.91/28.05 inference(equality_resolution,[],[f432])). 27.91/28.05 tff(f497,plain,( 27.91/28.05 spl22_14 <=> $less(-1,sK0)), 27.91/28.05 introduced(avatar_definition,[new_symbols(naming,[spl22_14])])). 27.91/28.05 tff(f499,plain,( 27.91/28.05 spl22_14), 27.91/28.05 inference(avatar_split_clause,[],[f492,f497])). 27.91/28.05 tff(f500,plain,( 27.91/28.05 ( ! [X0:$int] : (sK0 != X0 | ~$less(X0,sK3)) )), 27.91/28.05 inference(equality_resolution,[],[f399])). 27.91/28.05 tff(f501,plain,( 27.91/28.05 ~$less(sK0,sK3)), 27.91/28.05 inference(equality_resolution,[],[f500])). 27.91/28.05 tff(f503,plain,( 27.91/28.05 spl22_17 <=> ~distinct(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))), 27.91/28.05 introduced(avatar_definition,[new_symbols(naming,[spl22_17])])). 27.91/28.05 tff(f506,plain,( 27.91/28.05 spl22_16 <=> distinct(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))), 27.91/28.05 introduced(avatar_definition,[new_symbols(naming,[spl22_16])])). 27.91/28.05 tff(f508,plain,( 27.91/28.05 spl22_16), 27.91/28.05 inference(avatar_split_clause,[],[f234,f506])). 27.91/28.05 tff(f513,plain,( 27.91/28.05 spl22_19 <=> ~$less(sK0,sK3)), 27.91/28.05 introduced(avatar_definition,[new_symbols(naming,[spl22_19])])). 27.91/28.05 tff(f515,plain,( 27.91/28.05 ~spl22_19), 27.91/28.05 inference(avatar_split_clause,[],[f501,f513])). 27.91/28.05 tff(f520,plain,( 27.91/28.05 spl22_20 <=> all_trees1(sK6,tb2t1(get(list(tree),int,t2tb3(sK5),t2tb(sK6))))), 27.91/28.05 introduced(avatar_definition,[new_symbols(naming,[spl22_20])])). 27.91/28.05 tff(f522,plain,( 27.91/28.05 spl22_20), 27.91/28.05 inference(avatar_split_clause,[],[f249,f520])). 27.91/28.06 tff(f523,plain,( 27.91/28.06 ( ! [X0:tree1] : (size1(sK10(X0)) = sK6 | ~all_trees1(size1(X0),sK7)) )), 27.91/28.06 inference(resolution,[],[f253,f370])). 27.91/28.06 tff(f524,plain,( 27.91/28.06 ( ! [X0:uni] : (size1(sK10(tb2t2(X0))) = sK6 | ~mem(tree,X0,t2tb1(sK7))) )), 27.91/28.06 inference(superposition,[],[f253,f277])). 27.91/28.06 tff(f526,plain,( 27.91/28.06 ( ! [X2:tree1,X3:$int] : (sK6 != X3 | node1(sK14(sK10(X2)),sK15(sK10(X2))) = sK10(X2) | ~$less(0,X3) | ~all_trees1(size1(X2),sK7)) )), 27.91/28.06 inference(superposition,[],[f412,f523])). 27.91/28.06 tff(f527,plain,( 27.91/28.06 ( ! [X0:$int] : (sK0 != X0 | $less(sK3,$sum(X0,1))) )), 27.91/28.06 inference(equality_resolution,[],[f375])). 27.91/28.06 tff(f528,plain,( 27.91/28.06 $less(sK3,$sum(sK0,1))), 27.91/28.06 inference(equality_resolution,[],[f527])). 27.91/28.06 tff(f533,plain,( 27.91/28.06 spl22_22 <=> $less(sK3,$sum(sK0,1))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_22])])). 27.91/28.06 tff(f535,plain,( 27.91/28.06 spl22_22), 27.91/28.06 inference(avatar_split_clause,[],[f528,f533])). 27.91/28.06 tff(f536,plain,( 27.91/28.06 ( ! [X0:$int] : (sK0 != X0 | $less(sK6,$sum(X0,1))) )), 27.91/28.06 inference(equality_resolution,[],[f381])). 27.91/28.06 tff(f537,plain,( 27.91/28.06 $less(sK6,$sum(sK0,1))), 27.91/28.06 inference(equality_resolution,[],[f536])). 27.91/28.06 tff(f542,plain,( 27.91/28.06 spl22_24 <=> $less(sK6,$sum(sK0,1))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_24])])). 27.91/28.06 tff(f544,plain,( 27.91/28.06 spl22_24), 27.91/28.06 inference(avatar_split_clause,[],[f537,f542])). 27.91/28.06 tff(f545,plain,( 27.91/28.06 ( ! [X0:$int] : (sK3 != X0 | ~$less($sum(X0,-1),sK6)) )), 27.91/28.06 inference(equality_resolution,[],[f422])). 27.91/28.06 tff(f546,plain,( 27.91/28.06 ~$less($sum(sK3,-1),sK6)), 27.91/28.06 inference(equality_resolution,[],[f545])). 27.91/28.06 tff(f551,plain,( 27.91/28.06 spl22_27 <=> ~$less($sum(sK3,-1),sK6)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_27])])). 27.91/28.06 tff(f553,plain,( 27.91/28.06 ~spl22_27), 27.91/28.06 inference(avatar_split_clause,[],[f546,f551])). 27.91/28.06 tff(f556,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(superposition,[],[f412,f524])). 27.91/28.06 tff(f561,plain,( 27.91/28.06 spl22_28 <=> mem(tree,t2tb2(sK9),get(list(tree),int,t2tb3(sK8),t2tb(sK3)))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_28])])). 27.91/28.06 tff(f562,plain,( 27.91/28.06 mem(tree,t2tb2(sK9),get(list(tree),int,t2tb3(sK8),t2tb(sK3))) | ~spl22_28), 27.91/28.06 inference(avatar_component_clause,[],[f561])). 27.91/28.06 tff(f563,plain,( 27.91/28.06 spl22_28), 27.91/28.06 inference(avatar_split_clause,[],[f259,f561])). 27.91/28.06 tff(f568,plain,( 27.91/28.06 spl22_30 <=> tb2t3(set(list(tree),int,t2tb3(sK2),t2tb(sK3),nil(tree))) = sK4), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_30])])). 27.91/28.06 tff(f569,plain,( 27.91/28.06 tb2t3(set(list(tree),int,t2tb3(sK2),t2tb(sK3),nil(tree))) = sK4 | ~spl22_30), 27.91/28.06 inference(avatar_component_clause,[],[f568])). 27.91/28.06 tff(f570,plain,( 27.91/28.06 spl22_30), 27.91/28.06 inference(avatar_split_clause,[],[f228,f568])). 27.91/28.06 tff(f571,plain,( 27.91/28.06 ( ! [X0:tree1] : (empty1 != X0 | ~mem(tree,t2tb2(X0),t2tb1(sK7))) )), 27.91/28.06 inference(superposition,[],[f288,f254])). 27.91/28.06 tff(f572,plain,( 27.91/28.06 ( ! [X1:tree1] : (~mem(tree,t2tb2(X1),t2tb1(sK7)) | node_proj_21(X1) = sK11(X1)) )), 27.91/28.06 inference(superposition,[],[f291,f254])). 27.91/28.06 tff(f573,plain,( 27.91/28.06 ( ! [X2:tree1] : (~mem(tree,t2tb2(X2),t2tb1(sK7)) | node_proj_11(X2) = sK10(X2)) )), 27.91/28.06 inference(superposition,[],[f292,f254])). 27.91/28.06 tff(f577,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(superposition,[],[f407,f254])). 27.91/28.06 tff(f578,plain,( 27.91/28.06 ~mem(tree,t2tb2(empty1),t2tb1(sK7))), 27.91/28.06 inference(equality_resolution,[],[f571])). 27.91/28.06 tff(f583,plain,( 27.91/28.06 spl22_33 <=> ~mem(tree,t2tb2(empty1),t2tb1(sK7))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_33])])). 27.91/28.06 tff(f584,plain,( 27.91/28.06 ~mem(tree,t2tb2(empty1),t2tb1(sK7)) | ~spl22_33), 27.91/28.06 inference(avatar_component_clause,[],[f583])). 27.91/28.06 tff(f585,plain,( 27.91/28.06 ~spl22_33), 27.91/28.06 inference(avatar_split_clause,[],[f578,f583])). 27.91/28.06 tff(f586,plain,( 27.91/28.06 ~all_trees1(size1(empty1),sK7) | ~spl22_33), 27.91/28.06 inference(resolution,[],[f584,f370])). 27.91/28.06 tff(f587,plain,( 27.91/28.06 set(list(tree),int,t2tb3(sK2),t2tb(sK3),nil(tree)) = t2tb3(sK4) | ~spl22_30), 27.91/28.06 inference(superposition,[],[f274,f569])). 27.91/28.06 tff(f592,plain,( 27.91/28.06 spl22_35 <=> ~all_trees1(size1(empty1),sK7)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_35])])). 27.91/28.06 tff(f594,plain,( 27.91/28.06 ~spl22_35 | spl22_33), 27.91/28.06 inference(avatar_split_clause,[],[f586,f583,f592])). 27.91/28.06 tff(f596,plain,( 27.91/28.06 ( ! [X0:uni] : (node_proj_21(tb2t2(X0)) = sK11(tb2t2(X0)) | ~mem(tree,X0,t2tb1(sK7))) )), 27.91/28.06 inference(superposition,[],[f572,f277])). 27.91/28.06 tff(f598,plain,( 27.91/28.06 ( ! [X0:$int] : (sK3 != X0 | ~$less($sum($difference(X0,1),$uminus(sK6)),0)) )), 27.91/28.06 inference(equality_resolution,[],[f379])). 27.91/28.06 tff(f599,plain,( 27.91/28.06 ( ! [X0:tree1] : (node_proj_11(X0) = sK10(X0) | ~all_trees1(size1(X0),sK7)) )), 27.91/28.06 inference(resolution,[],[f573,f370])). 27.91/28.06 tff(f600,plain,( 27.91/28.06 ( ! [X0:uni] : (node_proj_11(tb2t2(X0)) = sK10(tb2t2(X0)) | ~mem(tree,X0,t2tb1(sK7))) )), 27.91/28.06 inference(superposition,[],[f573,f277])). 27.91/28.06 tff(f602,plain,( 27.91/28.06 ( ! [X1:tree1] : (size1(node_proj_11(X1)) = sK6 | ~all_trees1(size1(X1),sK7) | ~all_trees1(size1(X1),sK7)) )), 27.91/28.06 inference(superposition,[],[f523,f599])). 27.91/28.06 tff(f604,plain,( 27.91/28.06 ( ! [X1:tree1] : (size1(node_proj_11(X1)) = sK6 | ~all_trees1(size1(X1),sK7)) )), 27.91/28.06 inference(duplicate_literal_removal,[],[f602])). 27.91/28.06 tff(f610,plain,( 27.91/28.06 ~$less($sum($difference(sK3,1),$uminus(sK6)),0)), 27.91/28.06 inference(equality_resolution,[],[f598])). 27.91/28.06 tff(f615,plain,( 27.91/28.06 spl22_37 <=> ~$less($sum($difference(sK3,1),$uminus(sK6)),0)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_37])])). 27.91/28.06 tff(f616,plain,( 27.91/28.06 ~$less($sum($difference(sK3,1),$uminus(sK6)),0) | ~spl22_37), 27.91/28.06 inference(avatar_component_clause,[],[f615])). 27.91/28.06 tff(f617,plain,( 27.91/28.06 ~spl22_37), 27.91/28.06 inference(avatar_split_clause,[],[f610,f615])). 27.91/28.06 tff(f619,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(superposition,[],[f254,f596])). 27.91/28.06 tff(f620,plain,( 27.91/28.06 ( ! [X1:uni] : (~mem(tree,X1,t2tb1(sK7)) | node1(sK10(tb2t2(X1)),node_proj_21(tb2t2(X1))) = tb2t2(X1) | ~mem(tree,X1,t2tb1(sK7))) )), 27.91/28.06 inference(forward_demodulation,[],[f619,f277])). 27.91/28.06 tff(f621,plain,( 27.91/28.06 ( ! [X1:uni] : (node1(sK10(tb2t2(X1)),node_proj_21(tb2t2(X1))) = tb2t2(X1) | ~mem(tree,X1,t2tb1(sK7))) )), 27.91/28.06 inference(duplicate_literal_removal,[],[f620])). 27.91/28.06 tff(f622,plain,( 27.91/28.06 ( ! [X0:uni] : (~mem(tree,X0,get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | size1(tb2t2(X0)) = sK3) )), 27.91/28.06 inference(superposition,[],[f236,f277])). 27.91/28.06 tff(f624,plain,( 27.91/28.06 ( ! [X0:uni] : (size1(node_proj_11(tb2t2(X0))) = sK6 | ~mem(tree,X0,t2tb1(sK7)) | ~mem(tree,X0,t2tb1(sK7))) )), 27.91/28.06 inference(superposition,[],[f524,f600])). 27.91/28.06 tff(f627,plain,( 27.91/28.06 ( ! [X0:uni] : (size1(node_proj_11(tb2t2(X0))) = sK6 | ~mem(tree,X0,t2tb1(sK7))) )), 27.91/28.06 inference(duplicate_literal_removal,[],[f624])). 27.91/28.06 tff(f630,plain,( 27.91/28.06 ( ! [X0:tree1] : (~mem(tree,t2tb2(X0),t2tb1(sK7)) | size1(node_proj_11(X0)) = sK6) )), 27.91/28.06 inference(superposition,[],[f627,f273])). 27.91/28.06 tff(f640,plain,( 27.91/28.06 spl22_38 <=> set(list(tree),int,t2tb3(sK2),t2tb(sK3),nil(tree)) = t2tb3(sK4)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_38])])). 27.91/28.06 tff(f641,plain,( 27.91/28.06 set(list(tree),int,t2tb3(sK2),t2tb(sK3),nil(tree)) = t2tb3(sK4) | ~spl22_38), 27.91/28.06 inference(avatar_component_clause,[],[f640])). 27.91/28.06 tff(f642,plain,( 27.91/28.06 spl22_38 | ~spl22_30), 27.91/28.06 inference(avatar_split_clause,[],[f587,f568,f640])). 27.91/28.06 tff(f643,plain,( 27.91/28.06 ( ! [X0:uni] : (~mem(tree,X0,get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | node1(sK12(tb2t2(X0)),sK13(tb2t2(X0))) = tb2t2(X0)) )), 27.91/28.06 inference(superposition,[],[f238,f277])). 27.91/28.06 tff(f644,plain,( 27.91/28.06 nil(tree) = get(list(tree),int,t2tb3(sK4),t2tb(sK3)) | ~sort1(list(tree),nil(tree)) | ~spl22_38), 27.91/28.06 inference(superposition,[],[f371,f641])). 27.91/28.06 tff(f645,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(superposition,[],[f360,f641])). 27.91/28.06 tff(f647,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(superposition,[],[f621,f600])). 27.91/28.06 tff(f649,plain,( 27.91/28.06 ( ! [X0:tree1] : (node1(sK10(X0),node_proj_21(X0)) = X0 | ~mem(tree,t2tb2(X0),t2tb1(sK7))) )), 27.91/28.06 inference(superposition,[],[f621,f273])). 27.91/28.06 tff(f652,plain,( 27.91/28.06 ( ! [X4:tree1,X5:tree1,X3:uni] : (node1(X4,X5) != tb2t2(X3) | size1(X4) = size1(sK10(tb2t2(X3))) | ~mem(tree,X3,t2tb1(sK7))) )), 27.91/28.06 inference(superposition,[],[f315,f621])). 27.91/28.06 tff(f657,plain,( 27.91/28.06 ( ! [X0:uni] : (node1(node_proj_11(tb2t2(X0)),node_proj_21(tb2t2(X0))) = tb2t2(X0) | ~mem(tree,X0,t2tb1(sK7))) )), 27.91/28.06 inference(duplicate_literal_removal,[],[f647])). 27.91/28.06 tff(f662,plain,( 27.91/28.06 ( ! [X0:tree1,X1:tree1] : (node1(X0,X1) = node1(sK10(node1(X0,X1)),X1) | ~mem(tree,t2tb2(node1(X0,X1)),t2tb1(sK7))) )), 27.91/28.06 inference(superposition,[],[f649,f291])). 27.91/28.06 tff(f672,plain,( 27.91/28.06 ( ! [X0:$int,X1:$int] : (sK3 != X0 | sK0 != X1 | $less($sum($difference(X0,1),$uminus(sK6)),$sum(X1,1))) )), 27.91/28.06 inference(equality_resolution,[],[f383])). 27.91/28.06 tff(f717,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(resolution,[],[f622,f334])). 27.91/28.06 tff(f718,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(resolution,[],[f622,f335])). 27.91/28.06 tff(f719,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(global_subsumption,[],[f234,f717])). 27.91/28.06 tff(f720,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(global_subsumption,[],[f234,f718])). 27.91/28.06 tff(f721,plain,( 27.91/28.06 ( ! [X0:$int] : (sK0 != X0 | $less($sum($difference(sK3,1),$uminus(sK6)),$sum(X0,1))) )), 27.91/28.06 inference(equality_resolution,[],[f672])). 27.91/28.06 tff(f726,plain,( 27.91/28.06 spl22_40 <=> tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = sK1), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_40])])). 27.91/28.06 tff(f727,plain,( 27.91/28.06 tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = sK1 | ~spl22_40), 27.91/28.06 inference(avatar_component_clause,[],[f726])). 27.91/28.06 tff(f728,plain,( 27.91/28.06 spl22_40), 27.91/28.06 inference(avatar_split_clause,[],[f219,f726])). 27.91/28.06 tff(f729,plain,( 27.91/28.06 $less($sum($difference(sK3,1),$uminus(sK6)),$sum(sK0,1))), 27.91/28.06 inference(equality_resolution,[],[f721])). 27.91/28.06 tff(f734,plain,( 27.91/28.06 spl22_42 <=> $less($sum($difference(sK3,1),$uminus(sK6)),$sum(sK0,1))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_42])])). 27.91/28.06 tff(f735,plain,( 27.91/28.06 $less($sum($difference(sK3,1),$uminus(sK6)),$sum(sK0,1)) | ~spl22_42), 27.91/28.06 inference(avatar_component_clause,[],[f734])). 27.91/28.06 tff(f736,plain,( 27.91/28.06 spl22_42), 27.91/28.06 inference(avatar_split_clause,[],[f729,f734])). 27.91/28.06 tff(f741,plain,( 27.91/28.06 spl22_45 <=> ~sort1(list(tree),nil(tree))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_45])])). 27.91/28.06 tff(f742,plain,( 27.91/28.06 ~sort1(list(tree),nil(tree)) | ~spl22_45), 27.91/28.06 inference(avatar_component_clause,[],[f741])). 27.91/28.06 tff(f747,plain,( 27.91/28.06 spl22_46 <=> nil(tree) = get(list(tree),int,t2tb3(sK4),t2tb(sK3))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_46])])). 27.91/28.06 tff(f749,plain,( 27.91/28.06 ~spl22_45 | spl22_46 | ~spl22_38), 27.91/28.06 inference(avatar_split_clause,[],[f644,f640,f747,f741])). 27.91/28.06 tff(f751,plain,( 27.91/28.06 spl22_48 <=> size1(sK9) = sK3), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_48])])). 27.91/28.06 tff(f752,plain,( 27.91/28.06 size1(sK9) = sK3 | ~spl22_48), 27.91/28.06 inference(avatar_component_clause,[],[f751])). 27.91/28.06 tff(f754,plain,( 27.91/28.06 spl22_49 <=> size1(sK9) != sK3), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_49])])). 27.91/28.06 tff(f757,plain,( 27.91/28.06 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.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_50])])). 27.91/28.06 tff(f758,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(avatar_component_clause,[],[f757])). 27.91/28.06 tff(f759,plain,( 27.91/28.06 ~spl22_49 | spl22_50), 27.91/28.06 inference(avatar_split_clause,[],[f372,f757,f754])). 27.91/28.06 tff(f760,plain,( 27.91/28.06 $false | ~spl22_45), 27.91/28.06 inference(resolution,[],[f742,f280])). 27.91/28.06 tff(f761,plain,( 27.91/28.06 spl22_45), 27.91/28.06 inference(avatar_contradiction_clause,[],[f760])). 27.91/28.06 tff(f763,plain,( 27.91/28.06 set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree))) = t2tb3(sK1) | ~spl22_40), 27.91/28.06 inference(superposition,[],[f274,f727])). 27.91/28.06 tff(f770,plain,( 27.91/28.06 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.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_52])])). 27.91/28.06 tff(f771,plain,( 27.91/28.06 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.91/28.06 inference(avatar_component_clause,[],[f770])). 27.91/28.06 tff(f772,plain,( 27.91/28.06 spl22_52), 27.91/28.06 inference(avatar_split_clause,[],[f257,f770])). 27.91/28.06 tff(f802,plain,( 27.91/28.06 ( ! [X0:$int,X1:tree1] : (sK6 != X0 | $less(size1(sK12(X1)),X0) | ~mem(tree,t2tb2(X1),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) )), 27.91/28.06 inference(equality_resolution,[],[f388])). 27.91/28.06 tff(f818,plain,( 27.91/28.06 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.91/28.06 inference(superposition,[],[f274,f771])). 27.91/28.06 tff(f852,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(equality_resolution,[],[f376])). 27.91/28.06 tff(f889,plain,( 27.91/28.06 ( ! [X2:$int,X0:tree1,X3:$int,X1:tree1] : (size1(X1) != $sum($difference(X2,1),$uminus(X3)) | size1(X0) != sK6 | sK3 != X2 | sK6 != X3 | mem(tree,t2tb2(node1(X0,X1)),t2tb1(sK7))) )), 27.91/28.06 inference(equality_resolution,[],[f377])). 27.91/28.06 tff(f901,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(superposition,[],[f389,f285])). 27.91/28.06 tff(f905,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(superposition,[],[f389,f254])). 27.91/28.06 tff(f918,plain,( 27.91/28.06 ( ! [X0:tree1] : (~mem(tree,t2tb2(X0),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | $less(size1(sK12(X0)),sK6)) )), 27.91/28.06 inference(equality_resolution,[],[f802])). 27.91/28.06 tff(f919,plain,( 27.91/28.06 ( ! [X0:uni] : (~mem(tree,X0,get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | $less(size1(sK12(tb2t2(X0))),sK6)) )), 27.91/28.06 inference(superposition,[],[f918,f277])). 27.91/28.06 tff(f934,plain,( 27.91/28.06 ( ! [X0:uni] : (node1(sK12(tb2t2(sK19(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X0))),sK13(tb2t2(sK19(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X0)))) = tb2t2(sK19(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X0)) | 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.91/28.06 inference(resolution,[],[f643,f334])). 27.91/28.06 tff(f935,plain,( 27.91/28.06 ( ! [X1:uni] : (node1(sK12(tb2t2(sK19(tree,X1,get(list(tree),int,t2tb3(sK5),t2tb(sK3))))),sK13(tb2t2(sK19(tree,X1,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))))) = tb2t2(sK19(tree,X1,get(list(tree),int,t2tb3(sK5),t2tb(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.91/28.06 inference(resolution,[],[f643,f335])). 27.91/28.06 tff(f936,plain,( 27.91/28.06 ( ! [X0:uni] : (node1(sK12(tb2t2(sK19(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X0))),sK13(tb2t2(sK19(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X0)))) = tb2t2(sK19(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X0)) | distinct(tree,infix_plpl(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X0)) | ~distinct(tree,X0)) )), 27.91/28.06 inference(global_subsumption,[],[f234,f934])). 27.91/28.06 tff(f937,plain,( 27.91/28.06 ( ! [X1:uni] : (node1(sK12(tb2t2(sK19(tree,X1,get(list(tree),int,t2tb3(sK5),t2tb(sK3))))),sK13(tb2t2(sK19(tree,X1,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))))) = tb2t2(sK19(tree,X1,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) | distinct(tree,infix_plpl(tree,X1,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) | ~distinct(tree,X1)) )), 27.91/28.06 inference(global_subsumption,[],[f234,f935])). 27.91/28.06 tff(f983,plain,( 27.91/28.06 spl22_54 <=> set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree))) = t2tb3(sK1)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_54])])). 27.91/28.06 tff(f984,plain,( 27.91/28.06 set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree))) = t2tb3(sK1) | ~spl22_54), 27.91/28.06 inference(avatar_component_clause,[],[f983])). 27.91/28.06 tff(f985,plain,( 27.91/28.06 spl22_54 | ~spl22_40), 27.91/28.06 inference(avatar_split_clause,[],[f763,f726,f983])). 27.91/28.06 tff(f1039,plain,( 27.91/28.06 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.91/28.06 inference(superposition,[],[f371,f984])). 27.91/28.06 tff(f1040,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(superposition,[],[f360,f984])). 27.91/28.06 tff(f1066,plain,( 27.91/28.06 ( ! [X0:$int,X1:tree1] : (sK3 != X0 | size1(sK11(X1)) = $sum($difference(X0,1),$uminus(sK6)) | ~mem(tree,t2tb2(X1),t2tb1(sK7))) )), 27.91/28.06 inference(equality_resolution,[],[f852])). 27.91/28.06 tff(f1067,plain,( 27.91/28.06 ( ! [X0:tree1] : (size1(sK11(X0)) = $sum($difference(sK3,1),$uminus(sK6)) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) )), 27.91/28.06 inference(equality_resolution,[],[f1066])). 27.91/28.06 tff(f1069,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(superposition,[],[f1067,f596])). 27.91/28.06 tff(f1071,plain,( 27.91/28.06 ( ! [X2:$int,X0:tree1,X3:$int,X1:$int] : ($sum($difference(sK3,1),$uminus(sK6)) != X1 | sK3 != X2 | sK6 != X3 | $sum($difference(X2,1),$uminus(X3)) = X1 | ~mem(tree,t2tb2(X0),t2tb1(sK7)) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) )), 27.91/28.06 inference(superposition,[],[f376,f1067])). 27.91/28.06 tff(f1073,plain,( 27.91/28.06 ( ! [X6:tree1,X7:$int] : ($sum($difference(sK3,1),$uminus(sK6)) != X7 | node1(sK14(sK11(X6)),sK15(sK11(X6))) = sK11(X6) | ~$less(0,X7) | ~mem(tree,t2tb2(X6),t2tb1(sK7))) )), 27.91/28.06 inference(superposition,[],[f412,f1067])). 27.91/28.06 tff(f1074,plain,( 27.91/28.06 ( ! [X0:tree1] : ($less(size1(sK11(X0)),$sum(sK0,1)) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | ~spl22_42), 27.91/28.06 inference(superposition,[],[f735,f1067])). 27.91/28.06 tff(f1075,plain,( 27.91/28.06 ( ! [X1:tree1] : (~mem(tree,t2tb2(X1),t2tb1(sK7)) | ~$less(size1(sK11(X1)),0)) ) | ~spl22_37), 27.91/28.06 inference(superposition,[],[f616,f1067])). 27.91/28.06 tff(f1080,plain,( 27.91/28.06 ( ! [X2:$int,X0:tree1,X3:$int,X1:$int] : ($sum($difference(sK3,1),$uminus(sK6)) != X1 | sK3 != X2 | sK6 != X3 | $sum($difference(X2,1),$uminus(X3)) = X1 | ~mem(tree,t2tb2(X0),t2tb1(sK7))) )), 27.91/28.06 inference(duplicate_literal_removal,[],[f1071])). 27.91/28.06 tff(f1081,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(forward_demodulation,[],[f1069,f277])). 27.91/28.06 tff(f1082,plain,( 27.91/28.06 ( ! [X1:uni] : (size1(node_proj_21(tb2t2(X1))) = $sum($difference(sK3,1),$uminus(sK6)) | ~mem(tree,X1,t2tb1(sK7))) )), 27.91/28.06 inference(duplicate_literal_removal,[],[f1081])). 27.91/28.06 tff(f1094,plain,( 27.91/28.06 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.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_56])])). 27.91/28.06 tff(f1095,plain,( 27.91/28.06 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.91/28.06 inference(avatar_component_clause,[],[f1094])). 27.91/28.06 tff(f1096,plain,( 27.91/28.06 spl22_56 | ~spl22_52), 27.91/28.06 inference(avatar_split_clause,[],[f818,f770,f1094])). 27.91/28.06 tff(f1114,plain,( 27.91/28.06 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.91/28.06 inference(superposition,[],[f371,f1095])). 27.91/28.06 tff(f1115,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(superposition,[],[f360,f1095])). 27.91/28.06 tff(f1120,plain,( 27.91/28.06 ( ! [X1:uni] : ($less(size1(node_proj_21(tb2t2(X1))),$sum(sK0,1)) | ~mem(tree,t2tb2(tb2t2(X1)),t2tb1(sK7)) | ~mem(tree,X1,t2tb1(sK7))) ) | ~spl22_42), 27.91/28.06 inference(superposition,[],[f1074,f596])). 27.91/28.06 tff(f1123,plain,( 27.91/28.06 ( ! [X1:uni] : (~mem(tree,X1,t2tb1(sK7)) | $less(size1(node_proj_21(tb2t2(X1))),$sum(sK0,1)) | ~mem(tree,X1,t2tb1(sK7))) ) | ~spl22_42), 27.91/28.06 inference(forward_demodulation,[],[f1120,f277])). 27.91/28.06 tff(f1124,plain,( 27.91/28.06 ( ! [X1:uni] : ($less(size1(node_proj_21(tb2t2(X1))),$sum(sK0,1)) | ~mem(tree,X1,t2tb1(sK7))) ) | ~spl22_42), 27.91/28.06 inference(duplicate_literal_removal,[],[f1123])). 27.91/28.06 tff(f1125,plain,( 27.91/28.06 ( ! [X0:tree1] : ($less(size1(node_proj_21(X0)),$sum(sK0,1)) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | ~spl22_42), 27.91/28.06 inference(superposition,[],[f1124,f273])). 27.91/28.06 tff(f1126,plain,( 27.91/28.06 ( ! [X0:tree1,X1:tree1] : (~mem(tree,t2tb2(node1(X0,X1)),t2tb1(sK7)) | $less(size1(X1),$sum(sK0,1))) ) | ~spl22_42), 27.91/28.06 inference(superposition,[],[f1125,f291])). 27.91/28.06 tff(f1130,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(equality_resolution,[],[f577])). 27.91/28.06 tff(f1163,plain,( 27.91/28.06 ( ! [X0:tree1] : (size1(node_proj_21(X0)) = $sum($difference(sK3,1),$uminus(sK6)) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) )), 27.91/28.06 inference(superposition,[],[f1082,f273])). 27.91/28.06 tff(f1171,plain,( 27.91/28.06 ( ! [X6:$int,X5:uni] : ($sum($difference(sK3,1),$uminus(sK6)) != X6 | ~$less(X6,0) | ~mem(tree,X5,t2tb1(sK7))) )), 27.91/28.06 inference(superposition,[],[f409,f1082])). 27.91/28.06 tff(f1187,plain,( 27.91/28.06 ( ! [X23:tree1,X21:$int,X22:$int,X20:tree1] : ($sum($difference(X21,1),$uminus(X22)) != sK6 | size1(X23) != sK6 | sK3 != X21 | sK6 != X22 | mem(tree,t2tb2(node1(X23,sK10(X20))),t2tb1(sK7)) | ~all_trees1(size1(X20),sK7)) )), 27.91/28.06 inference(superposition,[],[f889,f523])). 27.91/28.06 tff(f1189,plain,( 27.91/28.06 ( ! [X30:$int,X28:uni,X31:tree1,X29:$int] : ($sum($difference(X29,1),$uminus(X30)) != sK6 | size1(X31) != sK6 | sK3 != X29 | sK6 != X30 | mem(tree,t2tb2(node1(X31,sK10(tb2t2(X28)))),t2tb1(sK7)) | ~mem(tree,X28,t2tb1(sK7))) )), 27.91/28.06 inference(superposition,[],[f889,f524])). 27.91/28.06 tff(f1198,plain,( 27.91/28.06 ( ! [X4:tree1,X5:tree1,X3:tree1] : (size1(X4) != size1(sK11(X3)) | size1(X5) != sK6 | sK3 != sK3 | sK6 != sK6 | mem(tree,t2tb2(node1(X5,X4)),t2tb1(sK7)) | ~mem(tree,t2tb2(X3),t2tb1(sK7))) )), 27.91/28.06 inference(superposition,[],[f889,f1067])). 27.91/28.06 tff(f1199,plain,( 27.91/28.06 ( ! [X4:tree1,X5:tree1,X3:tree1] : (size1(X4) != size1(sK11(X3)) | size1(X5) != sK6 | mem(tree,t2tb2(node1(X5,X4)),t2tb1(sK7)) | ~mem(tree,t2tb2(X3),t2tb1(sK7))) )), 27.91/28.06 inference(trivial_inequality_removal,[],[f1198])). 27.91/28.06 tff(f1201,plain,( 27.91/28.06 ( ! [X0:tree1,X1:tree1] : (size1(X1) = $sum($difference(sK3,1),$uminus(sK6)) | ~mem(tree,t2tb2(node1(X0,X1)),t2tb1(sK7))) )), 27.91/28.06 inference(superposition,[],[f1163,f291])). 27.91/28.06 tff(f1225,plain,( 27.91/28.06 spl22_58 <=> ! [X5 : uni] : ~mem(tree,X5,t2tb1(sK7))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_58])])). 27.91/28.06 tff(f1226,plain,( 27.91/28.06 ( ! [X5:uni] : (~mem(tree,X5,t2tb1(sK7))) ) | ~spl22_58), 27.91/28.06 inference(avatar_component_clause,[],[f1225])). 27.91/28.06 tff(f1228,plain,( 27.91/28.06 spl22_60 <=> ! [X6 : $int] : ($sum($difference(sK3,1),$uminus(sK6)) != X6 | ~$less(X6,0))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_60])])). 27.91/28.06 tff(f1230,plain,( 27.91/28.06 spl22_58 | spl22_60), 27.91/28.06 inference(avatar_split_clause,[],[f1171,f1228,f1225])). 27.91/28.06 tff(f1236,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(superposition,[],[f901,f604])). 27.91/28.06 tff(f1238,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(equality_resolution,[],[f901])). 27.91/28.06 tff(f1241,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(inner_rewriting,[],[f1236])). 27.91/28.06 tff(f1256,plain,( 27.91/28.06 ( ! [X6:tree1,X4:tree1,X5:tree1] : (~mem(tree,t2tb2(node1(X6,X5)),t2tb1(sK7)) | size1(X5) = size1(node_proj_21(X4)) | ~mem(tree,t2tb2(X4),t2tb1(sK7))) )), 27.91/28.06 inference(superposition,[],[f1201,f1163])). 27.91/28.06 tff(f1257,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(superposition,[],[f1201,f1082])). 27.91/28.06 tff(f1328,plain,( 27.91/28.06 spl22_63 <=> ~all_trees1(sK3,sK7)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_63])])). 27.91/28.06 tff(f1331,plain,( 27.91/28.06 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.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_64])])). 27.91/28.06 tff(f1334,plain,( 27.91/28.06 spl22_66 <=> ! [X1 : $int,X2 : $int] : (sK6 != X1 | ~$less(X1,X2) | sK6 != X2)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_66])])). 27.91/28.06 tff(f1335,plain,( 27.91/28.06 ( ! [X2:$int,X1:$int] : (sK6 != X2 | ~$less(X1,X2) | sK6 != X1) ) | ~spl22_66), 27.91/28.06 inference(avatar_component_clause,[],[f1334])). 27.91/28.06 tff(f1336,plain,( 27.91/28.06 ~spl22_63 | spl22_64 | spl22_66), 27.91/28.06 inference(avatar_split_clause,[],[f1241,f1334,f1331,f1328])). 27.91/28.06 tff(f1447,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(superposition,[],[f905,f524])). 27.91/28.06 tff(f1467,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(forward_demodulation,[],[f1447,f277])). 27.91/28.06 tff(f1468,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(duplicate_literal_removal,[],[f1467])). 27.91/28.06 tff(f1544,plain,( 27.91/28.06 spl22_68 <=> ! [X2 : tree1] : (node1(sK14(sK10(X2)),sK15(sK10(X2))) = sK10(X2) | ~all_trees1(size1(X2),sK7))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_68])])). 27.91/28.06 tff(f1547,plain,( 27.91/28.06 spl22_70 <=> ! [X3 : $int] : (sK6 != X3 | ~$less(0,X3))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_70])])). 27.91/28.06 tff(f1548,plain,( 27.91/28.06 ( ! [X3:$int] : (sK6 != X3 | ~$less(0,X3)) ) | ~spl22_70), 27.91/28.06 inference(avatar_component_clause,[],[f1547])). 27.91/28.06 tff(f1549,plain,( 27.91/28.06 spl22_68 | spl22_70), 27.91/28.06 inference(avatar_split_clause,[],[f526,f1547,f1544])). 27.91/28.06 tff(f1550,plain,( 27.91/28.06 ~$less(0,sK6) | ~spl22_70), 27.91/28.06 inference(equality_resolution,[],[f1548])). 27.91/28.06 tff(f1555,plain,( 27.91/28.06 spl22_73 <=> ~$less(0,sK6)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_73])])). 27.91/28.06 tff(f1557,plain,( 27.91/28.06 ~spl22_73 | ~spl22_70), 27.91/28.06 inference(avatar_split_clause,[],[f1550,f1547,f1555])). 27.91/28.06 tff(f1686,plain,( 27.91/28.06 spl22_75 <=> ~sort1(list(tree),cons(tree,t2tb2(empty1),nil(tree)))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_75])])). 27.91/28.06 tff(f1687,plain,( 27.91/28.06 ~sort1(list(tree),cons(tree,t2tb2(empty1),nil(tree))) | ~spl22_75), 27.91/28.06 inference(avatar_component_clause,[],[f1686])). 27.91/28.06 tff(f1692,plain,( 27.91/28.06 spl22_76 <=> cons(tree,t2tb2(empty1),nil(tree)) = get(list(tree),int,t2tb3(sK1),t2tb(0))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_76])])). 27.91/28.06 tff(f1694,plain,( 27.91/28.06 ~spl22_75 | spl22_76 | ~spl22_54), 27.91/28.06 inference(avatar_split_clause,[],[f1039,f983,f1692,f1686])). 27.91/28.06 tff(f1695,plain,( 27.91/28.06 $false | ~spl22_75), 27.91/28.06 inference(resolution,[],[f1687,f325])). 27.91/28.06 tff(f1696,plain,( 27.91/28.06 spl22_75), 27.91/28.06 inference(avatar_contradiction_clause,[],[f1695])). 27.91/28.06 tff(f1784,plain,( 27.91/28.06 ( ! [X14:$int,X12:uni,X13:$int] : (sK6 != X13 | size1(tb2t2(X12)) != X14 | $sum($sum(1,X13),size1(sK11(tb2t2(X12)))) = X14 | ~mem(tree,t2tb2(tb2t2(X12)),t2tb1(sK7)) | ~mem(tree,X12,t2tb1(sK7))) )), 27.91/28.06 inference(superposition,[],[f1130,f524])). 27.91/28.06 tff(f1795,plain,( 27.91/28.06 ( ! [X0:tree1,X1:$int] : (size1(X0) != X1 | $sum($sum(1,size1(sK10(X0))),size1(sK11(X0))) = X1 | ~mem(tree,t2tb2(X0),t2tb1(sK7))) )), 27.91/28.06 inference(equality_resolution,[],[f1130])). 27.91/28.06 tff(f1802,plain,( 27.91/28.06 ( ! [X14:$int,X12:uni,X13:$int] : (~mem(tree,X12,t2tb1(sK7)) | sK6 != X13 | size1(tb2t2(X12)) != X14 | $sum($sum(1,X13),size1(sK11(tb2t2(X12)))) = X14 | ~mem(tree,X12,t2tb1(sK7))) )), 27.91/28.06 inference(forward_demodulation,[],[f1784,f277])). 27.91/28.06 tff(f1803,plain,( 27.91/28.06 ( ! [X14:$int,X12:uni,X13:$int] : (size1(tb2t2(X12)) != X14 | sK6 != X13 | ~mem(tree,X12,t2tb1(sK7)) | $sum($sum(1,X13),size1(sK11(tb2t2(X12)))) = X14) )), 27.91/28.06 inference(duplicate_literal_removal,[],[f1802])). 27.91/28.06 tff(f1887,plain,( 27.91/28.06 spl22_79 <=> ~sort1(int,t2tb(sK3))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_79])])). 27.91/28.06 tff(f1888,plain,( 27.91/28.06 ~sort1(int,t2tb(sK3)) | ~spl22_79), 27.91/28.06 inference(avatar_component_clause,[],[f1887])). 27.91/28.06 tff(f1890,plain,( 27.91/28.06 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.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_80])])). 27.91/28.06 tff(f1892,plain,( 27.91/28.06 ~spl22_79 | spl22_80 | ~spl22_38), 27.91/28.06 inference(avatar_split_clause,[],[f645,f640,f1890,f1887])). 27.91/28.06 tff(f1893,plain,( 27.91/28.06 $false | ~spl22_79), 27.91/28.06 inference(resolution,[],[f1888,f268])). 27.91/28.06 tff(f1894,plain,( 27.91/28.06 spl22_79), 27.91/28.06 inference(avatar_contradiction_clause,[],[f1893])). 27.91/28.06 tff(f1902,plain,( 27.91/28.06 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.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_82])])). 27.91/28.06 tff(f1904,plain,( 27.91/28.06 ~spl22_79 | spl22_82 | ~spl22_56), 27.91/28.06 inference(avatar_split_clause,[],[f1115,f1094,f1902,f1887])). 27.91/28.06 tff(f1988,plain,( 27.91/28.06 spl22_85 <=> ~sort1(int,t2tb(0))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_85])])). 27.91/28.06 tff(f1989,plain,( 27.91/28.06 ~sort1(int,t2tb(0)) | ~spl22_85), 27.91/28.06 inference(avatar_component_clause,[],[f1988])). 27.91/28.06 tff(f1991,plain,( 27.91/28.06 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.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_86])])). 27.91/28.06 tff(f1992,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(avatar_component_clause,[],[f1991])). 27.91/28.06 tff(f1993,plain,( 27.91/28.06 ~spl22_85 | spl22_86 | ~spl22_54), 27.91/28.06 inference(avatar_split_clause,[],[f1040,f983,f1991,f1988])). 27.91/28.06 tff(f1994,plain,( 27.91/28.06 $false | ~spl22_85), 27.91/28.06 inference(resolution,[],[f1989,f268])). 27.91/28.06 tff(f1995,plain,( 27.91/28.06 spl22_85), 27.91/28.06 inference(avatar_contradiction_clause,[],[f1994])). 27.91/28.06 tff(f2049,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(superposition,[],[f1992,f353])). 27.91/28.06 tff(f2102,plain,( 27.91/28.06 ( ! [X4:$int,X2:uni,X5:tree1,X3:$int] : ($sum($difference(X3,1),$uminus(X4)) != sK3 | size1(X5) != sK6 | sK3 != X3 | sK6 != X4 | mem(tree,t2tb2(node1(X5,tb2t2(sK19(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X2)))),t2tb1(sK7)) | distinct(tree,infix_plpl(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X2)) | ~distinct(tree,X2)) )), 27.91/28.06 inference(superposition,[],[f889,f719])). 27.91/28.06 tff(f2104,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(superposition,[],[f412,f719])). 27.91/28.06 tff(f2139,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(resolution,[],[f1257,f370])). 27.91/28.06 tff(f2315,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(superposition,[],[f412,f720])). 27.91/28.06 tff(f2317,plain,( 27.91/28.06 spl22_88 <=> ! [X20 : tree1,X23 : tree1] : (size1(X23) != sK6 | ~all_trees1(size1(X20),sK7) | mem(tree,t2tb2(node1(X23,sK10(X20))),t2tb1(sK7)))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_88])])). 27.91/28.06 tff(f2318,plain,( 27.91/28.06 ( ! [X23:tree1,X20:tree1] : (size1(X23) != sK6 | ~all_trees1(size1(X20),sK7) | mem(tree,t2tb2(node1(X23,sK10(X20))),t2tb1(sK7))) ) | ~spl22_88), 27.91/28.06 inference(avatar_component_clause,[],[f2317])). 27.91/28.06 tff(f2320,plain,( 27.91/28.06 spl22_90 <=> ! [X22 : $int,X21 : $int] : ($sum($difference(X21,1),$uminus(X22)) != sK6 | sK6 != X22 | sK3 != X21)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_90])])). 27.91/28.06 tff(f2321,plain,( 27.91/28.06 ( ! [X21:$int,X22:$int] : ($sum($difference(X21,1),$uminus(X22)) != sK6 | sK6 != X22 | sK3 != X21) ) | ~spl22_90), 27.91/28.06 inference(avatar_component_clause,[],[f2320])). 27.91/28.06 tff(f2322,plain,( 27.91/28.06 spl22_88 | spl22_90), 27.91/28.06 inference(avatar_split_clause,[],[f1187,f2320,f2317])). 27.91/28.06 tff(f2323,plain,( 27.91/28.06 ( ! [X0:tree1,X1:tree1] : (size1(X0) != sK6 | sK6 != sK6 | sK3 != sK3 | ~mem(tree,t2tb2(node1(X1,X0)),t2tb1(sK7))) ) | ~spl22_90), 27.91/28.06 inference(superposition,[],[f2321,f1201])). 27.91/28.06 tff(f2325,plain,( 27.91/28.06 ( ! [X3:uni] : (size1(node_proj_21(tb2t2(X3))) != sK6 | sK6 != sK6 | sK3 != sK3 | ~mem(tree,X3,t2tb1(sK7))) ) | ~spl22_90), 27.91/28.06 inference(superposition,[],[f2321,f1082])). 27.91/28.06 tff(f2326,plain,( 27.91/28.06 ( ! [X4:tree1] : (size1(sK11(X4)) != sK6 | sK6 != sK6 | sK3 != sK3 | ~mem(tree,t2tb2(X4),t2tb1(sK7))) ) | ~spl22_90), 27.91/28.06 inference(superposition,[],[f2321,f1067])). 27.91/28.06 tff(f2327,plain,( 27.91/28.06 ( ! [X4:tree1] : (size1(sK11(X4)) != sK6 | ~mem(tree,t2tb2(X4),t2tb1(sK7))) ) | ~spl22_90), 27.91/28.06 inference(trivial_inequality_removal,[],[f2326])). 27.91/28.06 tff(f2328,plain,( 27.91/28.06 ( ! [X3:uni] : (size1(node_proj_21(tb2t2(X3))) != sK6 | ~mem(tree,X3,t2tb1(sK7))) ) | ~spl22_90), 27.91/28.06 inference(trivial_inequality_removal,[],[f2325])). 27.91/28.06 tff(f2330,plain,( 27.91/28.06 ( ! [X0:tree1,X1:tree1] : (size1(X0) != sK6 | ~mem(tree,t2tb2(node1(X1,X0)),t2tb1(sK7))) ) | ~spl22_90), 27.91/28.06 inference(trivial_inequality_removal,[],[f2323])). 27.91/28.06 tff(f2348,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(superposition,[],[f2328,f2139])). 27.91/28.06 tff(f2353,plain,( 27.91/28.06 ( ! [X11:uni] : ($sum($difference(sK3,1),$uminus(sK6)) != sK6 | ~mem(tree,X11,t2tb1(sK7)) | ~mem(tree,X11,t2tb1(sK7))) ) | ~spl22_90), 27.91/28.06 inference(superposition,[],[f2328,f1082])). 27.91/28.06 tff(f2361,plain,( 27.91/28.06 ( ! [X11:uni] : ($sum($difference(sK3,1),$uminus(sK6)) != sK6 | ~mem(tree,X11,t2tb1(sK7))) ) | ~spl22_90), 27.91/28.06 inference(duplicate_literal_removal,[],[f2353])). 27.91/28.06 tff(f2366,plain,( 27.91/28.06 ( ! [X2:tree1,X0:uni,X1:tree1] : (size1(X1) != sK6 | ~mem(tree,X0,t2tb1(sK7)) | ~all_trees1(size1(node1(X2,X1)),sK7)) ) | ~spl22_90), 27.91/28.06 inference(duplicate_literal_removal,[],[f2348])). 27.91/28.06 tff(f2375,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(superposition,[],[f1238,f604])). 27.91/28.06 tff(f2411,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(inner_rewriting,[],[f2375])). 27.91/28.06 tff(f2479,plain,( 27.91/28.06 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.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_92])])). 27.91/28.06 tff(f2485,plain,( 27.91/28.06 spl22_95 <=> sK3 != sK6), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_95])])). 27.91/28.06 tff(f2487,plain,( 27.91/28.06 spl22_92 | ~spl22_95), 27.91/28.06 inference(avatar_split_clause,[],[f2411,f2485,f2479])). 27.91/28.06 tff(f2489,plain,( 27.91/28.06 spl22_96 <=> $sum($difference(sK3,1),$uminus(sK6)) = sK6), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_96])])). 27.91/28.06 tff(f2490,plain,( 27.91/28.06 $sum($difference(sK3,1),$uminus(sK6)) = sK6 | ~spl22_96), 27.91/28.06 inference(avatar_component_clause,[],[f2489])). 27.91/28.06 tff(f2492,plain,( 27.91/28.06 spl22_97 <=> $sum($difference(sK3,1),$uminus(sK6)) != sK6), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_97])])). 27.91/28.06 tff(f2493,plain,( 27.91/28.06 $sum($difference(sK3,1),$uminus(sK6)) != sK6 | ~spl22_97), 27.91/28.06 inference(avatar_component_clause,[],[f2492])). 27.91/28.06 tff(f2494,plain,( 27.91/28.06 spl22_58 | ~spl22_97 | ~spl22_90), 27.91/28.06 inference(avatar_split_clause,[],[f2361,f2320,f2492,f1225])). 27.91/28.06 tff(f2495,plain,( 27.91/28.06 ( ! [X0:tree1,X1:tree1] : (size1(X0) != sK6 | ~mem(tree,t2tb2(node1(X1,X0)),t2tb1(sK7))) ) | ~spl22_97), 27.91/28.06 inference(superposition,[],[f2493,f1201])). 27.91/28.06 tff(f2577,plain,( 27.91/28.06 spl22_98 <=> ! [X3 : uni] : (node1(sK14(sK10(tb2t2(X3))),sK15(sK10(tb2t2(X3)))) = sK10(tb2t2(X3)) | ~mem(tree,X3,t2tb1(sK7)))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_98])])). 27.91/28.06 tff(f2579,plain,( 27.91/28.06 spl22_98 | spl22_70), 27.91/28.06 inference(avatar_split_clause,[],[f556,f1547,f2577])). 27.91/28.06 tff(f2580,plain,( 27.91/28.06 ~spl22_73 | ~spl22_70), 27.91/28.06 inference(avatar_split_clause,[],[f1550,f1547,f1555])). 27.91/28.06 tff(f2682,plain,( 27.91/28.06 spl22_101 <=> ~sort1(list(tree),infix_plpl(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3))))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_101])])). 27.91/28.06 tff(f2683,plain,( 27.91/28.06 ~sort1(list(tree),infix_plpl(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) | ~spl22_101), 27.91/28.06 inference(avatar_component_clause,[],[f2682])). 27.91/28.06 tff(f2688,plain,( 27.91/28.06 spl22_102 <=> infix_plpl(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) = get(list(tree),int,t2tb3(sK8),t2tb(sK3))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_102])])). 27.91/28.06 tff(f2689,plain,( 27.91/28.06 infix_plpl(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) = get(list(tree),int,t2tb3(sK8),t2tb(sK3)) | ~spl22_102), 27.91/28.06 inference(avatar_component_clause,[],[f2688])). 27.91/28.06 tff(f2690,plain,( 27.91/28.06 ~spl22_101 | spl22_102 | ~spl22_56), 27.91/28.06 inference(avatar_split_clause,[],[f1114,f1094,f2688,f2682])). 27.91/28.06 tff(f2691,plain,( 27.91/28.06 $false | ~spl22_101), 27.91/28.06 inference(resolution,[],[f2683,f324])). 27.91/28.06 tff(f2692,plain,( 27.91/28.06 spl22_101), 27.91/28.06 inference(avatar_contradiction_clause,[],[f2691])). 27.91/28.06 tff(f2707,plain,( 27.91/28.06 set(list(tree),int,t2tb3(sK5),t2tb(sK3),get(list(tree),int,t2tb3(sK8),t2tb(sK3))) = t2tb3(sK8) | (~spl22_56 | ~spl22_102)), 27.91/28.06 inference(backward_demodulation,[],[f2689,f1095])). 27.91/28.06 tff(f2709,plain,( 27.91/28.06 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.91/28.06 inference(superposition,[],[f333,f2689])). 27.91/28.06 tff(f2711,plain,( 27.91/28.06 ( ! [X1:uni] : (~mem(tree,X1,get(list(tree),int,t2tb3(sK8),t2tb(sK3))) | mem(tree,X1,t2tb1(sK7)) | mem(tree,X1,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) ) | ~spl22_102), 27.91/28.06 inference(superposition,[],[f354,f2689])). 27.91/28.06 tff(f2734,plain,( 27.91/28.06 spl22_104 <=> set(list(tree),int,t2tb3(sK5),t2tb(sK3),get(list(tree),int,t2tb3(sK8),t2tb(sK3))) = t2tb3(sK8)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_104])])). 27.91/28.06 tff(f2736,plain,( 27.91/28.06 spl22_104 | ~spl22_56 | ~spl22_102), 27.91/28.06 inference(avatar_split_clause,[],[f2707,f2688,f1094,f2734])). 27.91/28.06 tff(f2761,plain,( 27.91/28.06 spl22_106 <=> ! [X1 : tree1,X2 : tree1] : (size1(X1) != sK6 | ~all_trees1(size1(node1(X2,X1)),sK7))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_106])])). 27.91/28.06 tff(f2762,plain,( 27.91/28.06 ( ! [X2:tree1,X1:tree1] : (size1(X1) != sK6 | ~all_trees1(size1(node1(X2,X1)),sK7)) ) | ~spl22_106), 27.91/28.06 inference(avatar_component_clause,[],[f2761])). 27.91/28.06 tff(f2763,plain,( 27.91/28.06 spl22_58 | spl22_106 | ~spl22_90), 27.91/28.06 inference(avatar_split_clause,[],[f2366,f2320,f2761,f1225])). 27.91/28.06 tff(f2765,plain,( 27.91/28.06 ( ! [X1:uni] : (distinct(tree,infix_plpl(tree,t2tb1(sK7),X1)) | ~distinct(tree,X1) | ~distinct(tree,t2tb1(sK7))) ) | ~spl22_58), 27.91/28.06 inference(resolution,[],[f1226,f334])). 27.91/28.06 tff(f2807,plain,( 27.91/28.06 spl22_108 <=> ! [X1 : uni] : (distinct(tree,infix_plpl(tree,t2tb1(sK7),X1)) | ~distinct(tree,X1))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_108])])). 27.91/28.06 tff(f2809,plain,( 27.91/28.06 ~spl22_1 | spl22_108 | ~spl22_58), 27.91/28.06 inference(avatar_split_clause,[],[f2765,f1225,f2807,f438])). 27.91/28.06 tff(f2937,plain,( 27.91/28.06 ( ! [X52:tree1,X51:tree1] : (sK6 != sK6 | ~mem(tree,t2tb2(node1(X52,sK10(X51))),t2tb1(sK7)) | ~all_trees1(size1(X51),sK7)) ) | ~spl22_97), 27.91/28.06 inference(superposition,[],[f2495,f523])). 27.91/28.06 tff(f2939,plain,( 27.91/28.06 ( ! [X56:tree1,X55:uni] : (sK6 != sK6 | ~mem(tree,t2tb2(node1(X56,sK10(tb2t2(X55)))),t2tb1(sK7)) | ~mem(tree,X55,t2tb1(sK7))) ) | ~spl22_97), 27.91/28.06 inference(superposition,[],[f2495,f524])). 27.91/28.06 tff(f2954,plain,( 27.91/28.06 ( ! [X56:tree1,X55:uni] : (~mem(tree,t2tb2(node1(X56,sK10(tb2t2(X55)))),t2tb1(sK7)) | ~mem(tree,X55,t2tb1(sK7))) ) | ~spl22_97), 27.91/28.06 inference(trivial_inequality_removal,[],[f2939])). 27.91/28.06 tff(f2955,plain,( 27.91/28.06 ( ! [X52:tree1,X51:tree1] : (~mem(tree,t2tb2(node1(X52,sK10(X51))),t2tb1(sK7)) | ~all_trees1(size1(X51),sK7)) ) | ~spl22_97), 27.91/28.06 inference(trivial_inequality_removal,[],[f2937])). 27.91/28.06 tff(f2959,plain,( 27.91/28.06 spl22_110 <=> ! [X31 : tree1,X28 : uni] : (size1(X31) != sK6 | ~mem(tree,X28,t2tb1(sK7)) | mem(tree,t2tb2(node1(X31,sK10(tb2t2(X28)))),t2tb1(sK7)))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_110])])). 27.91/28.06 tff(f2960,plain,( 27.91/28.06 ( ! [X28:uni,X31:tree1] : (size1(X31) != sK6 | ~mem(tree,X28,t2tb1(sK7)) | mem(tree,t2tb2(node1(X31,sK10(tb2t2(X28)))),t2tb1(sK7))) ) | ~spl22_110), 27.91/28.06 inference(avatar_component_clause,[],[f2959])). 27.91/28.06 tff(f2961,plain,( 27.91/28.06 spl22_110 | spl22_90), 27.91/28.06 inference(avatar_split_clause,[],[f1189,f2320,f2959])). 27.91/28.06 tff(f3095,plain,( 27.91/28.06 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.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_112])])). 27.91/28.06 tff(f3097,plain,( 27.91/28.06 spl22_66 | spl22_112), 27.91/28.06 inference(avatar_split_clause,[],[f1468,f3095,f1334])). 27.91/28.06 tff(f3098,plain,( 27.91/28.06 ( ! [X0:$int] : (sK6 != X0 | ~$less(X0,sK6)) ) | ~spl22_66), 27.91/28.06 inference(equality_resolution,[],[f1335])). 27.91/28.06 tff(f3099,plain,( 27.91/28.06 ~$less(sK6,sK6) | ~spl22_66), 27.91/28.06 inference(equality_resolution,[],[f3098])). 27.91/28.06 tff(f3104,plain,( 27.91/28.06 spl22_115 <=> ~$less(sK6,sK6)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_115])])). 27.91/28.06 tff(f3106,plain,( 27.91/28.06 ~spl22_115 | ~spl22_66), 27.91/28.06 inference(avatar_split_clause,[],[f3099,f1334,f3104])). 27.91/28.06 tff(f3233,plain,( 27.91/28.06 ( ! [X0:tree1] : (size1(X0) = $sum($sum(1,size1(sK10(X0))),size1(sK11(X0))) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) )), 27.91/28.06 inference(equality_resolution,[],[f1795])). 27.91/28.06 tff(f3257,plain,( 27.91/28.06 spl22_116 <=> ! [X1 : uni] : (nil(tree) = get(list(tree),int,t2tb3(sK1),X1) | t2tb(0) = X1 | ~sort1(int,X1))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_116])])). 27.91/28.06 tff(f3259,plain,( 27.91/28.06 ~spl22_45 | spl22_116 | ~spl22_86), 27.91/28.06 inference(avatar_split_clause,[],[f2049,f1991,f3257,f741])). 27.91/28.06 tff(f3280,plain,( 27.91/28.06 ( ! [X2:$int,X0:tree1,X1:$int] : (size1(X0) != X1 | sK6 != X2 | ~mem(tree,t2tb2(X0),t2tb1(sK7)) | $sum($sum(1,X2),size1(sK11(tb2t2(t2tb2(X0))))) = X1) )), 27.91/28.06 inference(superposition,[],[f1803,f273])). 27.91/28.06 tff(f3286,plain,( 27.91/28.06 ( ! [X2:$int,X0:tree1,X1:$int] : ($sum($sum(1,X2),size1(sK11(X0))) = X1 | size1(X0) != X1 | sK6 != X2 | ~mem(tree,t2tb2(X0),t2tb1(sK7))) )), 27.91/28.06 inference(forward_demodulation,[],[f3280,f273])). 27.91/28.06 tff(f3338,plain,( 27.91/28.06 ( ! [X6:tree1,X8:$int,X7:$int] : (size1(X6) != X8 | sK6 != X7 | $sum($sum(1,X7),size1(sK11(X6))) = X8 | ~mem(tree,t2tb2(X6),t2tb1(sK7))) )), 27.91/28.06 inference(global_subsumption,[],[f3286])). 27.91/28.06 tff(f3479,plain,( 27.91/28.06 mem(tree,t2tb2(sK9),t2tb1(sK7)) | mem(tree,t2tb2(sK9),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | (~spl22_28 | ~spl22_102)), 27.91/28.06 inference(resolution,[],[f2711,f562])). 27.91/28.06 tff(f3609,plain,( 27.91/28.06 spl22_118 <=> sort1(tree,sK19(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3))))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_118])])). 27.91/28.06 tff(f3615,plain,( 27.91/28.06 spl22_120 <=> distinct(tree,get(list(tree),int,t2tb3(sK8),t2tb(sK3)))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_120])])). 27.91/28.06 tff(f3617,plain,( 27.91/28.06 ~spl22_1 | ~spl22_17 | spl22_118 | spl22_120 | ~spl22_102), 27.91/28.06 inference(avatar_split_clause,[],[f2709,f2688,f3615,f3609,f503,f438])). 27.91/28.06 tff(f3633,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(superposition,[],[f3233,f524])). 27.91/28.06 tff(f3665,plain,( 27.91/28.06 ( ! [X4:uni] : (~mem(tree,X4,t2tb1(sK7)) | size1(tb2t2(X4)) = $sum($sum(1,sK6),size1(sK11(tb2t2(X4)))) | ~mem(tree,X4,t2tb1(sK7))) )), 27.91/28.06 inference(forward_demodulation,[],[f3633,f277])). 27.91/28.06 tff(f3666,plain,( 27.91/28.06 ( ! [X4:uni] : (size1(tb2t2(X4)) = $sum($sum(1,sK6),size1(sK11(tb2t2(X4)))) | ~mem(tree,X4,t2tb1(sK7))) )), 27.91/28.06 inference(duplicate_literal_removal,[],[f3665])). 27.91/28.06 tff(f3671,plain,( 27.91/28.06 ( ! [X0:uni] : (size1(tb2t2(X0)) = $sum($sum(1,sK6),size1(node_proj_21(tb2t2(X0)))) | ~mem(tree,X0,t2tb1(sK7)) | ~mem(tree,X0,t2tb1(sK7))) )), 27.91/28.06 inference(superposition,[],[f3666,f596])). 27.91/28.06 tff(f3680,plain,( 27.91/28.06 ( ! [X0:uni] : (size1(tb2t2(X0)) = $sum($sum(1,sK6),size1(node_proj_21(tb2t2(X0)))) | ~mem(tree,X0,t2tb1(sK7))) )), 27.91/28.06 inference(duplicate_literal_removal,[],[f3671])). 27.91/28.06 tff(f3716,plain,( 27.91/28.06 ( ! [X0:tree1] : (size1(X0) = $sum($sum(1,sK6),size1(node_proj_21(X0))) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) )), 27.91/28.06 inference(superposition,[],[f3680,f273])). 27.91/28.06 tff(f3791,plain,( 27.91/28.06 spl22_122 <=> mem(tree,t2tb2(sK9),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_122])])). 27.91/28.06 tff(f3792,plain,( 27.91/28.06 mem(tree,t2tb2(sK9),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | ~spl22_122), 27.91/28.06 inference(avatar_component_clause,[],[f3791])). 27.91/28.06 tff(f3794,plain,( 27.91/28.06 spl22_125 <=> ~mem(tree,t2tb2(sK9),t2tb1(sK7))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_125])])). 27.91/28.06 tff(f3797,plain,( 27.91/28.06 spl22_124 <=> mem(tree,t2tb2(sK9),t2tb1(sK7))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_124])])). 27.91/28.06 tff(f3798,plain,( 27.91/28.06 mem(tree,t2tb2(sK9),t2tb1(sK7)) | ~spl22_124), 27.91/28.06 inference(avatar_component_clause,[],[f3797])). 27.91/28.06 tff(f3799,plain,( 27.91/28.06 spl22_122 | spl22_124 | ~spl22_28 | ~spl22_102), 27.91/28.06 inference(avatar_split_clause,[],[f3479,f2688,f561,f3797,f3791])). 27.91/28.06 tff(f3800,plain,( 27.91/28.06 $less(size1(sK12(sK9)),sK6) | ~spl22_122), 27.91/28.06 inference(resolution,[],[f3792,f918])). 27.91/28.06 tff(f3801,plain,( 27.91/28.06 node1(sK12(sK9),sK13(sK9)) = sK9 | ~spl22_122), 27.91/28.06 inference(resolution,[],[f3792,f238])). 27.91/28.06 tff(f3802,plain,( 27.91/28.06 size1(sK9) = sK3 | ~spl22_122), 27.91/28.06 inference(resolution,[],[f3792,f236])). 27.91/28.06 tff(f3804,plain,( 27.91/28.06 node1(sK12(tb2t2(t2tb2(sK9))),sK13(tb2t2(t2tb2(sK9)))) = tb2t2(t2tb2(sK9)) | ~spl22_122), 27.91/28.06 inference(resolution,[],[f3792,f643])). 27.91/28.06 tff(f3805,plain,( 27.91/28.06 $less(size1(sK12(tb2t2(t2tb2(sK9)))),sK6) | ~spl22_122), 27.91/28.06 inference(resolution,[],[f3792,f919])). 27.91/28.06 tff(f3807,plain,( 27.91/28.06 node1(sK12(sK9),sK13(sK9)) = sK9 | ~spl22_122), 27.91/28.06 inference(forward_demodulation,[],[f3804,f273])). 27.91/28.06 tff(f3808,plain,( 27.91/28.06 $less(size1(sK12(sK9)),sK6) | ~spl22_122), 27.91/28.06 inference(forward_demodulation,[],[f3805,f273])). 27.91/28.06 tff(f3810,plain,( 27.91/28.06 spl22_48 | ~spl22_122), 27.91/28.06 inference(avatar_split_clause,[],[f3802,f3791,f751])). 27.91/28.06 tff(f3812,plain,( 27.91/28.06 ( ! [X1:$int] : (sK3 != X1 | node1(sK14(sK9),sK15(sK9)) = sK9 | ~$less(0,X1)) ) | ~spl22_48), 27.91/28.06 inference(superposition,[],[f412,f752])). 27.91/28.06 tff(f3824,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(superposition,[],[f758,f657])). 27.91/28.06 tff(f3832,plain,( 27.91/28.06 ( ! [X37:$int,X35:tree1,X36:$int,X34:tree1] : (node1(X34,X35) != sK9 | ~$less(X36,$sum(X37,1)) | sK6 != X37 | size1(sK10(node1(X34,X35))) != X36 | ~mem(tree,t2tb2(node1(X34,X35)),t2tb1(sK7))) ) | ~spl22_50), 27.91/28.06 inference(superposition,[],[f758,f662])). 27.91/28.06 tff(f3835,plain,( 27.91/28.06 ( ! [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.91/28.06 inference(inner_rewriting,[],[f3824])). 27.91/28.06 tff(f3838,plain,( 27.91/28.06 ( ! [X37:$int,X35:tree1,X36:$int,X34:tree1] : (node1(X34,X35) != sK9 | ~$less(X36,$sum(X37,1)) | sK6 != X37 | size1(sK10(sK9)) != X36 | ~mem(tree,t2tb2(sK9),t2tb1(sK7))) ) | ~spl22_50), 27.91/28.06 inference(inner_rewriting,[],[f3832])). 27.91/28.06 tff(f3845,plain,( 27.91/28.06 spl22_126 <=> $less(size1(sK12(sK9)),sK6)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_126])])). 27.91/28.06 tff(f3846,plain,( 27.91/28.06 $less(size1(sK12(sK9)),sK6) | ~spl22_126), 27.91/28.06 inference(avatar_component_clause,[],[f3845])). 27.91/28.06 tff(f3847,plain,( 27.91/28.06 spl22_126 | ~spl22_122), 27.91/28.06 inference(avatar_split_clause,[],[f3800,f3791,f3845])). 27.91/28.06 tff(f3849,plain,( 27.91/28.06 ~$less(size1(sK11(sK9)),0) | (~spl22_37 | ~spl22_124)), 27.91/28.06 inference(resolution,[],[f3798,f1075])). 27.91/28.06 tff(f3850,plain,( 27.91/28.06 size1(node_proj_11(sK9)) = sK6 | ~spl22_124), 27.91/28.06 inference(resolution,[],[f3798,f630])). 27.91/28.06 tff(f3851,plain,( 27.91/28.06 node_proj_11(sK9) = sK10(sK9) | ~spl22_124), 27.91/28.06 inference(resolution,[],[f3798,f573])). 27.91/28.06 tff(f3852,plain,( 27.91/28.06 node_proj_21(sK9) = sK11(sK9) | ~spl22_124), 27.91/28.06 inference(resolution,[],[f3798,f572])). 27.91/28.06 tff(f3854,plain,( 27.91/28.06 ( ! [X0:$int] : (size1(sK9) = X0 | ~all_trees1(X0,sK7)) ) | ~spl22_124), 27.91/28.06 inference(resolution,[],[f3798,f319])). 27.91/28.06 tff(f3860,plain,( 27.91/28.06 spl22_129 <=> ~$less(size1(sK11(sK9)),0)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_129])])). 27.91/28.06 tff(f3861,plain,( 27.91/28.06 ~$less(size1(sK11(sK9)),0) | ~spl22_129), 27.91/28.06 inference(avatar_component_clause,[],[f3860])). 27.91/28.06 tff(f3862,plain,( 27.91/28.06 ~spl22_129 | spl22_37 | ~spl22_124), 27.91/28.06 inference(avatar_split_clause,[],[f3849,f3797,f615,f3860])). 27.91/28.06 tff(f3864,plain,( 27.91/28.06 spl22_130 <=> ! [X11 : $int,X12 : $int] : (~$less(X11,$sum(X12,1)) | size1(node_proj_11(sK9)) != X11 | sK6 != X12)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_130])])). 27.91/28.06 tff(f3865,plain,( 27.91/28.06 ( ! [X12:$int,X11:$int] : (~$less(X11,$sum(X12,1)) | size1(node_proj_11(sK9)) != X11 | sK6 != X12) ) | ~spl22_130), 27.91/28.06 inference(avatar_component_clause,[],[f3864])). 27.91/28.06 tff(f3867,plain,( 27.91/28.06 spl22_132 <=> ! [X10 : uni] : (tb2t2(X10) != sK9 | ~mem(tree,X10,t2tb1(sK7)))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_132])])). 27.91/28.06 tff(f3869,plain,( 27.91/28.06 spl22_130 | spl22_132 | ~spl22_50), 27.91/28.06 inference(avatar_split_clause,[],[f3835,f757,f3867,f3864])). 27.91/28.06 tff(f3871,plain,( 27.91/28.06 spl22_135 <=> size1(node_proj_11(sK9)) != sK6), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_135])])). 27.91/28.06 tff(f3874,plain,( 27.91/28.06 spl22_134 <=> size1(node_proj_11(sK9)) = sK6), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_134])])). 27.91/28.06 tff(f3875,plain,( 27.91/28.06 size1(node_proj_11(sK9)) = sK6 | ~spl22_134), 27.91/28.06 inference(avatar_component_clause,[],[f3874])). 27.91/28.06 tff(f3876,plain,( 27.91/28.06 spl22_134 | ~spl22_124), 27.91/28.06 inference(avatar_split_clause,[],[f3850,f3797,f3874])). 27.91/28.06 tff(f3896,plain,( 27.91/28.06 spl22_126 | ~spl22_122), 27.91/28.06 inference(avatar_split_clause,[],[f3800,f3791,f3845])). 27.91/28.06 tff(f3897,plain,( 27.91/28.06 spl22_126 | ~spl22_122), 27.91/28.06 inference(avatar_split_clause,[],[f3808,f3791,f3845])). 27.91/28.06 tff(f3922,plain,( 27.91/28.06 spl22_137 <=> node1(sK12(sK9),sK13(sK9)) != sK9), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_137])])). 27.91/28.06 tff(f3923,plain,( 27.91/28.06 node1(sK12(sK9),sK13(sK9)) != sK9 | ~spl22_137), 27.91/28.06 inference(avatar_component_clause,[],[f3922])). 27.91/28.06 tff(f3925,plain,( 27.91/28.06 spl22_136 <=> node1(sK12(sK9),sK13(sK9)) = sK9), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_136])])). 27.91/28.06 tff(f3926,plain,( 27.91/28.06 node1(sK12(sK9),sK13(sK9)) = sK9 | ~spl22_136), 27.91/28.06 inference(avatar_component_clause,[],[f3925])). 27.91/28.06 tff(f3927,plain,( 27.91/28.06 spl22_136 | ~spl22_122), 27.91/28.06 inference(avatar_split_clause,[],[f3801,f3791,f3925])). 27.91/28.06 tff(f3929,plain,( 27.91/28.06 spl22_134 | ~spl22_124), 27.91/28.06 inference(avatar_split_clause,[],[f3850,f3797,f3874])). 27.91/28.06 tff(f3934,plain,( 27.91/28.06 spl22_138 <=> node_proj_11(sK9) = sK10(sK9)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_138])])). 27.91/28.06 tff(f3935,plain,( 27.91/28.06 node_proj_11(sK9) = sK10(sK9) | ~spl22_138), 27.91/28.06 inference(avatar_component_clause,[],[f3934])). 27.91/28.06 tff(f3936,plain,( 27.91/28.06 spl22_138 | ~spl22_124), 27.91/28.06 inference(avatar_split_clause,[],[f3851,f3797,f3934])). 27.91/28.06 tff(f3952,plain,( 27.91/28.06 spl22_136 | ~spl22_122), 27.91/28.06 inference(avatar_split_clause,[],[f3801,f3791,f3925])). 27.91/28.06 tff(f3953,plain,( 27.91/28.06 spl22_136 | ~spl22_122), 27.91/28.06 inference(avatar_split_clause,[],[f3807,f3791,f3925])). 27.91/28.06 tff(f3954,plain,( 27.91/28.06 empty1 != sK9 | ~spl22_136), 27.91/28.06 inference(superposition,[],[f288,f3926])). 27.91/28.06 tff(f3955,plain,( 27.91/28.06 node_proj_21(sK9) = sK13(sK9) | ~spl22_136), 27.91/28.06 inference(superposition,[],[f291,f3926])). 27.91/28.06 tff(f3956,plain,( 27.91/28.06 node_proj_11(sK9) = sK12(sK9) | ~spl22_136), 27.91/28.06 inference(superposition,[],[f292,f3926])). 27.91/28.06 tff(f4005,plain,( 27.91/28.06 spl22_140 <=> empty1 = sK9), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_140])])). 27.91/28.06 tff(f4008,plain,( 27.91/28.06 spl22_141 <=> empty1 != sK9), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_141])])). 27.91/28.06 tff(f4010,plain,( 27.91/28.06 ~spl22_141 | ~spl22_136), 27.91/28.06 inference(avatar_split_clause,[],[f3954,f3925,f4008])). 27.91/28.06 tff(f4011,plain,( 27.91/28.06 node1(sK12(sK9),node_proj_21(sK9)) = sK9 | ~spl22_136), 27.91/28.06 inference(backward_demodulation,[],[f3955,f3926])). 27.91/28.06 tff(f4016,plain,( 27.91/28.06 spl22_142 <=> node_proj_21(sK9) = sK13(sK9)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_142])])). 27.91/28.06 tff(f4017,plain,( 27.91/28.06 node_proj_21(sK9) = sK13(sK9) | ~spl22_142), 27.91/28.06 inference(avatar_component_clause,[],[f4016])). 27.91/28.06 tff(f4018,plain,( 27.91/28.06 spl22_142 | ~spl22_136), 27.91/28.06 inference(avatar_split_clause,[],[f3955,f3925,f4016])). 27.91/28.06 tff(f4020,plain,( 27.91/28.06 spl22_138 | ~spl22_124), 27.91/28.06 inference(avatar_split_clause,[],[f3851,f3797,f3934])). 27.91/28.06 tff(f4021,plain,( 27.91/28.06 ~$less(size1(node_proj_21(sK9)),0) | (~spl22_124 | ~spl22_129)), 27.91/28.06 inference(backward_demodulation,[],[f3852,f3861])). 27.91/28.06 tff(f4026,plain,( 27.91/28.06 spl22_144 <=> node_proj_21(sK9) = sK11(sK9)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_144])])). 27.91/28.06 tff(f4027,plain,( 27.91/28.06 node_proj_21(sK9) = sK11(sK9) | ~spl22_144), 27.91/28.06 inference(avatar_component_clause,[],[f4026])). 27.91/28.06 tff(f4028,plain,( 27.91/28.06 spl22_144 | ~spl22_124), 27.91/28.06 inference(avatar_split_clause,[],[f3852,f3797,f4026])). 27.91/28.06 tff(f4066,plain,( 27.91/28.06 spl22_142 | ~spl22_136), 27.91/28.06 inference(avatar_split_clause,[],[f3955,f3925,f4016])). 27.91/28.06 tff(f4067,plain,( 27.91/28.06 $less(size1(node_proj_11(sK9)),sK6) | (~spl22_126 | ~spl22_136)), 27.91/28.06 inference(backward_demodulation,[],[f3956,f3846])). 27.91/28.06 tff(f4072,plain,( 27.91/28.06 spl22_146 <=> node_proj_11(sK9) = sK12(sK9)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_146])])). 27.91/28.06 tff(f4073,plain,( 27.91/28.06 node_proj_11(sK9) = sK12(sK9) | ~spl22_146), 27.91/28.06 inference(avatar_component_clause,[],[f4072])). 27.91/28.06 tff(f4074,plain,( 27.91/28.06 spl22_146 | ~spl22_136), 27.91/28.06 inference(avatar_split_clause,[],[f3956,f3925,f4072])). 27.91/28.06 tff(f4078,plain,( 27.91/28.06 ~$less(size1(node_proj_21(sK9)),0) | (~spl22_124 | ~spl22_129)), 27.91/28.06 inference(backward_demodulation,[],[f3852,f3861])). 27.91/28.06 tff(f4079,plain,( 27.91/28.06 spl22_144 | ~spl22_124), 27.91/28.06 inference(avatar_split_clause,[],[f3852,f3797,f4026])). 27.91/28.06 tff(f4084,plain,( 27.91/28.06 spl22_149 <=> ~$less(size1(node_proj_21(sK9)),0)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_149])])). 27.91/28.06 tff(f4086,plain,( 27.91/28.06 ~spl22_149 | ~spl22_124 | spl22_129), 27.91/28.06 inference(avatar_split_clause,[],[f4021,f3860,f3797,f4084])). 27.91/28.06 tff(f4108,plain,( 27.91/28.06 ~spl22_149 | ~spl22_124 | spl22_129), 27.91/28.06 inference(avatar_split_clause,[],[f4078,f3860,f3797,f4084])). 27.91/28.06 tff(f4121,plain,( 27.91/28.06 ( ! [X37:$int,X35:tree1,X36:$int,X34:tree1] : (size1(node_proj_11(sK9)) != X36 | node1(X34,X35) != sK9 | ~$less(X36,$sum(X37,1)) | sK6 != X37 | ~mem(tree,t2tb2(sK9),t2tb1(sK7))) ) | (~spl22_50 | ~spl22_138)), 27.91/28.06 inference(forward_demodulation,[],[f3838,f3935])). 27.91/28.06 tff(f4122,plain,( 27.91/28.06 ( ! [X37:$int,X35:tree1,X36:$int,X34:tree1] : (sK6 != X36 | node1(X34,X35) != sK9 | ~$less(X36,$sum(X37,1)) | sK6 != X37 | ~mem(tree,t2tb2(sK9),t2tb1(sK7))) ) | (~spl22_50 | ~spl22_134 | ~spl22_138)), 27.91/28.06 inference(forward_demodulation,[],[f4121,f3875])). 27.91/28.06 tff(f4124,plain,( 27.91/28.06 spl22_150 <=> ! [X34 : tree1,X35 : tree1] : node1(X34,X35) != sK9), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_150])])). 27.91/28.06 tff(f4125,plain,( 27.91/28.06 ( ! [X35:tree1,X34:tree1] : (node1(X34,X35) != sK9) ) | ~spl22_150), 27.91/28.06 inference(avatar_component_clause,[],[f4124])). 27.91/28.06 tff(f4127,plain,( 27.91/28.06 spl22_152 <=> ! [X36 : $int,X37 : $int] : (sK6 != X36 | sK6 != X37 | ~$less(X36,$sum(X37,1)))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_152])])). 27.91/28.06 tff(f4128,plain,( 27.91/28.06 ( ! [X37:$int,X36:$int] : (sK6 != X37 | sK6 != X36 | ~$less(X36,$sum(X37,1))) ) | ~spl22_152), 27.91/28.06 inference(avatar_component_clause,[],[f4127])). 27.91/28.06 tff(f4129,plain,( 27.91/28.06 ~spl22_125 | spl22_150 | spl22_152 | ~spl22_50 | ~spl22_134 | ~spl22_138), 27.91/28.06 inference(avatar_split_clause,[],[f4122,f3934,f3874,f757,f4127,f4124,f3794])). 27.91/28.06 tff(f4138,plain,( 27.91/28.06 ( ! [X19:$int,X20:tree1] : (sK6 != X19 | ~all_trees1(size1(node1(X20,sK9)),sK7) | ~all_trees1(X19,sK7)) ) | (~spl22_106 | ~spl22_124)), 27.91/28.06 inference(superposition,[],[f2762,f3854])). 27.91/28.06 tff(f4150,plain,( 27.91/28.06 node1(sK12(sK9),node_proj_21(sK9)) != sK9 | (~spl22_137 | ~spl22_142)), 27.91/28.06 inference(forward_demodulation,[],[f3923,f4017])). 27.91/28.06 tff(f4160,plain,( 27.91/28.06 spl22_155 <=> node1(sK12(sK9),node_proj_21(sK9)) != sK9), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_155])])). 27.91/28.06 tff(f4162,plain,( 27.91/28.06 ~spl22_155 | spl22_137 | ~spl22_142), 27.91/28.06 inference(avatar_split_clause,[],[f4150,f4016,f3922,f4160])). 27.91/28.06 tff(f4193,plain,( 27.91/28.06 spl22_156 <=> ! [X20 : tree1] : ~all_trees1(size1(node1(X20,sK9)),sK7)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_156])])). 27.91/28.06 tff(f4196,plain,( 27.91/28.06 spl22_158 <=> ! [X19 : $int] : (sK6 != X19 | ~all_trees1(X19,sK7))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_158])])). 27.91/28.06 tff(f4198,plain,( 27.91/28.06 spl22_156 | spl22_158 | ~spl22_106 | ~spl22_124), 27.91/28.06 inference(avatar_split_clause,[],[f4138,f3797,f2761,f4196,f4193])). 27.91/28.06 tff(f4210,plain,( 27.91/28.06 ( ! [X11:tree1] : (sK6 != sK6 | ~all_trees1(size1(X11),sK7) | mem(tree,t2tb2(node1(node_proj_11(sK9),sK10(X11))),t2tb1(sK7))) ) | (~spl22_88 | ~spl22_134)), 27.91/28.06 inference(superposition,[],[f2318,f3875])). 27.91/28.06 tff(f4246,plain,( 27.91/28.06 ( ! [X11:tree1] : (mem(tree,t2tb2(node1(node_proj_11(sK9),sK10(X11))),t2tb1(sK7)) | ~all_trees1(size1(X11),sK7)) ) | (~spl22_88 | ~spl22_134)), 27.91/28.06 inference(trivial_inequality_removal,[],[f4210])). 27.91/28.06 tff(f4289,plain,( 27.91/28.06 ( ! [X11:uni] : (sK6 != sK6 | ~mem(tree,X11,t2tb1(sK7)) | mem(tree,t2tb2(node1(node_proj_11(sK9),sK10(tb2t2(X11)))),t2tb1(sK7))) ) | (~spl22_110 | ~spl22_134)), 27.91/28.06 inference(superposition,[],[f2960,f3875])). 27.91/28.06 tff(f4308,plain,( 27.91/28.06 ( ! [X59:uni,X58:uni] : (sK6 != sK6 | ~mem(tree,X59,t2tb1(sK7)) | mem(tree,t2tb2(node1(sK10(tb2t2(X58)),sK10(tb2t2(X59)))),t2tb1(sK7)) | ~mem(tree,X58,t2tb1(sK7))) ) | ~spl22_110), 27.91/28.06 inference(superposition,[],[f2960,f524])). 27.91/28.06 tff(f4323,plain,( 27.91/28.06 ( ! [X59:uni,X58:uni] : (mem(tree,t2tb2(node1(sK10(tb2t2(X58)),sK10(tb2t2(X59)))),t2tb1(sK7)) | ~mem(tree,X59,t2tb1(sK7)) | ~mem(tree,X58,t2tb1(sK7))) ) | ~spl22_110), 27.91/28.06 inference(trivial_inequality_removal,[],[f4308])). 27.91/28.06 tff(f4325,plain,( 27.91/28.06 ( ! [X11:uni] : (mem(tree,t2tb2(node1(node_proj_11(sK9),sK10(tb2t2(X11)))),t2tb1(sK7)) | ~mem(tree,X11,t2tb1(sK7))) ) | (~spl22_110 | ~spl22_134)), 27.91/28.06 inference(trivial_inequality_removal,[],[f4289])). 27.91/28.06 tff(f4332,plain,( 27.91/28.06 ( ! [X0:tree1] : (~all_trees1(size1(X0),sK7) | ~all_trees1(size1(X0),sK7)) ) | (~spl22_88 | ~spl22_97 | ~spl22_134)), 27.91/28.06 inference(resolution,[],[f4246,f2955])). 27.91/28.06 tff(f4340,plain,( 27.91/28.06 ( ! [X11:tree1] : (~$less(size1(sK11(node1(node_proj_11(sK9),sK10(X11)))),0) | ~all_trees1(size1(X11),sK7)) ) | (~spl22_37 | ~spl22_88 | ~spl22_134)), 27.91/28.06 inference(resolution,[],[f4246,f1075])). 27.91/28.06 tff(f4350,plain,( 27.91/28.06 ( ! [X0:tree1] : (~all_trees1(size1(X0),sK7)) ) | (~spl22_88 | ~spl22_97 | ~spl22_134)), 27.91/28.06 inference(duplicate_literal_removal,[],[f4332])). 27.91/28.06 tff(f4360,plain,( 27.91/28.06 ~all_trees1(sK6,sK7) | (~spl22_88 | ~spl22_97 | ~spl22_134)), 27.91/28.06 inference(superposition,[],[f4350,f3875])). 27.91/28.06 tff(f4399,plain,( 27.91/28.06 spl22_161 <=> ~all_trees1(sK6,sK7)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_161])])). 27.91/28.06 tff(f4401,plain,( 27.91/28.06 ~spl22_161 | ~spl22_88 | spl22_97 | ~spl22_134), 27.91/28.06 inference(avatar_split_clause,[],[f4360,f3874,f2492,f2317,f4399])). 27.91/28.06 tff(f4414,plain,( 27.91/28.06 ( ! [X0:uni,X1:uni] : (~mem(tree,X0,t2tb1(sK7)) | ~mem(tree,X1,t2tb1(sK7)) | ~mem(tree,X0,t2tb1(sK7))) ) | (~spl22_97 | ~spl22_110)), 27.91/28.06 inference(resolution,[],[f4323,f2954])). 27.91/28.06 tff(f4437,plain,( 27.91/28.06 ( ! [X0:uni,X1:uni] : (~mem(tree,X0,t2tb1(sK7)) | ~mem(tree,X1,t2tb1(sK7))) ) | (~spl22_97 | ~spl22_110)), 27.91/28.06 inference(duplicate_literal_removal,[],[f4414])). 27.91/28.06 tff(f4442,plain,( 27.91/28.06 spl22_58 | spl22_58 | spl22_97 | ~spl22_110), 27.91/28.06 inference(avatar_split_clause,[],[f4437,f2959,f2492,f1225,f1225])). 27.91/28.06 tff(f4446,plain,( 27.91/28.06 ( ! [X0:tree1] : (~mem(tree,t2tb2(X0),t2tb1(sK7)) | size1(sK11(X0)) = sK6) ) | ~spl22_96), 27.91/28.06 inference(backward_demodulation,[],[f2490,f1067])). 27.91/28.06 tff(f4482,plain,( 27.91/28.06 size1(sK11(sK9)) = sK6 | (~spl22_96 | ~spl22_124)), 27.91/28.06 inference(resolution,[],[f4446,f3798])). 27.91/28.06 tff(f4486,plain,( 27.91/28.06 ( ! [X0:uni] : (size1(sK11(tb2t2(X0))) = sK6 | ~mem(tree,X0,t2tb1(sK7))) ) | ~spl22_96), 27.91/28.06 inference(superposition,[],[f4446,f277])). 27.91/28.06 tff(f4487,plain,( 27.91/28.06 size1(node_proj_21(sK9)) = sK6 | (~spl22_96 | ~spl22_124 | ~spl22_144)), 27.91/28.06 inference(forward_demodulation,[],[f4482,f4027])). 27.91/28.06 tff(f4493,plain,( 27.91/28.06 spl22_162 <=> size1(node_proj_21(sK9)) = sK6), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_162])])). 27.91/28.06 tff(f4494,plain,( 27.91/28.06 size1(node_proj_21(sK9)) = sK6 | ~spl22_162), 27.91/28.06 inference(avatar_component_clause,[],[f4493])). 27.91/28.06 tff(f4495,plain,( 27.91/28.06 spl22_162 | ~spl22_96 | ~spl22_124 | ~spl22_144), 27.91/28.06 inference(avatar_split_clause,[],[f4487,f4026,f3797,f2489,f4493])). 27.91/28.06 tff(f4535,plain,( 27.91/28.06 $false | (~spl22_58 | ~spl22_124)), 27.91/28.06 inference(resolution,[],[f1226,f3798])). 27.91/28.06 tff(f4541,plain,( 27.91/28.06 ~spl22_58 | ~spl22_124), 27.91/28.06 inference(avatar_contradiction_clause,[],[f4535])). 27.91/28.06 tff(f4551,plain,( 27.91/28.06 spl22_162 | ~spl22_96 | ~spl22_124 | ~spl22_144), 27.91/28.06 inference(avatar_split_clause,[],[f4487,f4026,f3797,f2489,f4493])). 27.91/28.06 tff(f4787,plain,( 27.91/28.06 ( ! [X0:uni] : (size1(tb2t2(X0)) = $sum($sum(1,sK6),sK6) | ~mem(tree,X0,t2tb1(sK7)) | ~mem(tree,X0,t2tb1(sK7))) ) | ~spl22_96), 27.91/28.06 inference(superposition,[],[f3666,f4486])). 27.91/28.06 tff(f4815,plain,( 27.91/28.06 ( ! [X0:uni] : (size1(tb2t2(X0)) = $sum($sum(1,sK6),sK6) | ~mem(tree,X0,t2tb1(sK7))) ) | ~spl22_96), 27.91/28.06 inference(duplicate_literal_removal,[],[f4787])). 27.91/28.06 tff(f4940,plain,( 27.91/28.06 ~$less(size1(sK11(node1(node_proj_11(sK9),node_proj_11(sK9)))),0) | ~all_trees1(size1(sK9),sK7) | (~spl22_37 | ~spl22_88 | ~spl22_134 | ~spl22_138)), 27.91/28.06 inference(superposition,[],[f4340,f3935])). 27.91/28.06 tff(f5114,plain,( 27.91/28.06 spl22_165 <=> ~all_trees1(size1(sK9),sK7)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_165])])). 27.91/28.06 tff(f5120,plain,( 27.91/28.06 spl22_167 <=> ~$less(size1(sK11(node1(node_proj_11(sK9),node_proj_11(sK9)))),0)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_167])])). 27.91/28.06 tff(f5122,plain,( 27.91/28.06 ~spl22_165 | ~spl22_167 | spl22_37 | ~spl22_88 | ~spl22_134 | ~spl22_138), 27.91/28.06 inference(avatar_split_clause,[],[f4940,f3934,f3874,f2317,f615,f5120,f5114])). 27.91/28.06 tff(f5125,plain,( 27.91/28.06 ( ! [X0:tree1] : (size1(X0) = $sum($sum(1,sK6),sK6) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | ~spl22_96), 27.91/28.06 inference(superposition,[],[f4815,f273])). 27.91/28.06 tff(f5133,plain,( 27.91/28.06 ( ! [X6:$int,X5:uni] : ($sum($sum(1,sK6),sK6) != X6 | ~$less(X6,0) | ~mem(tree,X5,t2tb1(sK7))) ) | ~spl22_96), 27.91/28.06 inference(superposition,[],[f409,f4815])). 27.91/28.06 tff(f5311,plain,( 27.91/28.06 spl22_168 <=> ! [X6 : $int] : ($sum($sum(1,sK6),sK6) != X6 | ~$less(X6,0))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_168])])). 27.91/28.06 tff(f5312,plain,( 27.91/28.06 ( ! [X6:$int] : ($sum($sum(1,sK6),sK6) != X6 | ~$less(X6,0)) ) | ~spl22_168), 27.91/28.06 inference(avatar_component_clause,[],[f5311])). 27.91/28.06 tff(f5313,plain,( 27.91/28.06 spl22_58 | spl22_168 | ~spl22_96), 27.91/28.06 inference(avatar_split_clause,[],[f5133,f2489,f5311,f1225])). 27.91/28.06 tff(f5316,plain,( 27.91/28.06 ~$less($sum($sum(1,sK6),sK6),0) | ~spl22_168), 27.91/28.06 inference(equality_resolution,[],[f5312])). 27.91/28.06 tff(f5318,plain,( 27.91/28.06 spl22_170 <=> ! [X5 : tree1,X2 : uni] : (size1(X5) != sK6 | ~distinct(tree,X2) | distinct(tree,infix_plpl(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X2)) | mem(tree,t2tb2(node1(X5,tb2t2(sK19(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X2)))),t2tb1(sK7)))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_170])])). 27.91/28.06 tff(f5321,plain,( 27.91/28.06 spl22_172 <=> ! [X3 : $int,X4 : $int] : ($sum($difference(X3,1),$uminus(X4)) != sK3 | sK6 != X4 | sK3 != X3)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_172])])). 27.91/28.06 tff(f5322,plain,( 27.91/28.06 ( ! [X4:$int,X3:$int] : ($sum($difference(X3,1),$uminus(X4)) != sK3 | sK6 != X4 | sK3 != X3) ) | ~spl22_172), 27.91/28.06 inference(avatar_component_clause,[],[f5321])). 27.91/28.06 tff(f5323,plain,( 27.91/28.06 spl22_170 | spl22_172), 27.91/28.06 inference(avatar_split_clause,[],[f2102,f5321,f5318])). 27.91/28.06 tff(f5328,plain,( 27.91/28.06 spl22_175 <=> ~$less($sum($sum(1,sK6),sK6),0)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_175])])). 27.91/28.06 tff(f5329,plain,( 27.91/28.06 ~$less($sum($sum(1,sK6),sK6),0) | ~spl22_175), 27.91/28.06 inference(avatar_component_clause,[],[f5328])). 27.91/28.06 tff(f5330,plain,( 27.91/28.06 ~spl22_175 | ~spl22_168), 27.91/28.06 inference(avatar_split_clause,[],[f5316,f5311,f5328])). 27.91/28.06 tff(f5331,plain,( 27.91/28.06 ( ! [X0:tree1] : (~mem(tree,t2tb2(X0),t2tb1(sK7)) | ~$less(size1(X0),0)) ) | (~spl22_96 | ~spl22_175)), 27.91/28.06 inference(superposition,[],[f5329,f5125])). 27.91/28.06 tff(f5333,plain,( 27.91/28.06 ~$less(size1(sK9),0) | (~spl22_96 | ~spl22_124 | ~spl22_175)), 27.91/28.06 inference(resolution,[],[f5331,f3798])). 27.91/28.06 tff(f5344,plain,( 27.91/28.06 spl22_177 <=> ~$less(size1(sK9),0)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_177])])). 27.91/28.06 tff(f5346,plain,( 27.91/28.06 ~spl22_177 | ~spl22_96 | ~spl22_124 | spl22_175), 27.91/28.06 inference(avatar_split_clause,[],[f5333,f5328,f3797,f2489,f5344])). 27.91/28.06 tff(f5368,plain,( 27.91/28.06 ( ! [X10:uni] : (size1(sK10(node1(node_proj_11(sK9),sK10(tb2t2(X10))))) = sK6 | ~mem(tree,X10,t2tb1(sK7))) ) | (~spl22_110 | ~spl22_134)), 27.91/28.06 inference(resolution,[],[f4325,f253])). 27.91/28.06 tff(f5372,plain,( 27.91/28.06 ( ! [X14:uni] : (~$less(size1(sK11(node1(node_proj_11(sK9),sK10(tb2t2(X14))))),0) | ~mem(tree,X14,t2tb1(sK7))) ) | (~spl22_37 | ~spl22_110 | ~spl22_134)), 27.91/28.06 inference(resolution,[],[f4325,f1075])). 27.91/28.06 tff(f5374,plain,( 27.91/28.06 ( ! [X16:uni] : (size1(sK11(node1(node_proj_11(sK9),sK10(tb2t2(X16))))) = sK6 | ~mem(tree,X16,t2tb1(sK7))) ) | (~spl22_96 | ~spl22_110 | ~spl22_134)), 27.91/28.06 inference(resolution,[],[f4325,f4446])). 27.91/28.06 tff(f5376,plain,( 27.91/28.06 ( ! [X18:uni] : (~$less(size1(node1(node_proj_11(sK9),sK10(tb2t2(X18)))),0) | ~mem(tree,X18,t2tb1(sK7))) ) | (~spl22_96 | ~spl22_110 | ~spl22_134 | ~spl22_175)), 27.91/28.06 inference(resolution,[],[f4325,f5331])). 27.91/28.06 tff(f5422,plain,( 27.91/28.06 spl22_178 <=> ! [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.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_178])])). 27.91/28.06 tff(f5423,plain,( 27.91/28.06 ( ! [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))) ) | ~spl22_178), 27.91/28.06 inference(avatar_component_clause,[],[f5422])). 27.91/28.06 tff(f5425,plain,( 27.91/28.06 spl22_180 <=> ! [X9 : $int] : (sK3 != X9 | ~$less(0,X9))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_180])])). 27.91/28.06 tff(f5426,plain,( 27.91/28.06 ( ! [X9:$int] : (sK3 != X9 | ~$less(0,X9)) ) | ~spl22_180), 27.91/28.06 inference(avatar_component_clause,[],[f5425])). 27.91/28.06 tff(f5427,plain,( 27.91/28.06 spl22_178 | spl22_180), 27.91/28.06 inference(avatar_split_clause,[],[f2104,f5425,f5422])). 27.91/28.06 tff(f5428,plain,( 27.91/28.06 ~$less(0,sK3) | ~spl22_180), 27.91/28.06 inference(equality_resolution,[],[f5426])). 27.91/28.06 tff(f5433,plain,( 27.91/28.06 spl22_183 <=> ~$less(0,sK3)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_183])])). 27.91/28.06 tff(f5435,plain,( 27.91/28.06 ~spl22_183 | ~spl22_180), 27.91/28.06 inference(avatar_split_clause,[],[f5428,f5425,f5433])). 27.91/28.06 tff(f5539,plain,( 27.91/28.06 spl22_184 <=> ! [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.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_184])])). 27.91/28.06 tff(f5541,plain,( 27.91/28.06 spl22_184 | spl22_180), 27.91/28.06 inference(avatar_split_clause,[],[f2315,f5425,f5539])). 27.91/28.06 tff(f5590,plain,( 27.91/28.06 ( ! [X0:tree1] : (~$less(size1(node1(node_proj_11(sK9),sK10(X0))),0) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | (~spl22_96 | ~spl22_110 | ~spl22_134 | ~spl22_175)), 27.91/28.06 inference(superposition,[],[f5376,f273])). 27.91/28.06 tff(f5632,plain,( 27.91/28.06 ~$less(size1(node1(node_proj_11(sK9),node_proj_11(sK9))),0) | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_96 | ~spl22_110 | ~spl22_134 | ~spl22_138 | ~spl22_175)), 27.91/28.06 inference(superposition,[],[f5590,f3935])). 27.91/28.06 tff(f5652,plain,( 27.91/28.06 spl22_187 <=> ~$less(size1(node1(node_proj_11(sK9),node_proj_11(sK9))),0)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_187])])). 27.91/28.06 tff(f5654,plain,( 27.91/28.06 ~spl22_125 | ~spl22_187 | ~spl22_96 | ~spl22_110 | ~spl22_134 | ~spl22_138 | spl22_175), 27.91/28.06 inference(avatar_split_clause,[],[f5632,f5328,f3934,f3874,f2959,f2489,f5652,f3794])). 27.91/28.06 tff(f5668,plain,( 27.91/28.06 ( ! [X0:tree1] : (size1(sK10(node1(node_proj_11(sK9),sK10(X0)))) = sK6 | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | (~spl22_110 | ~spl22_134)), 27.91/28.06 inference(superposition,[],[f5368,f273])). 27.91/28.06 tff(f5703,plain,( 27.91/28.06 ( ! [X0:tree1] : (~$less(size1(sK11(node1(node_proj_11(sK9),sK10(X0)))),0) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | (~spl22_37 | ~spl22_110 | ~spl22_134)), 27.91/28.06 inference(superposition,[],[f5372,f273])). 27.91/28.06 tff(f5717,plain,( 27.91/28.06 ( ! [X0:tree1] : (size1(sK11(node1(node_proj_11(sK9),sK10(X0)))) = sK6 | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | (~spl22_96 | ~spl22_110 | ~spl22_134)), 27.91/28.06 inference(superposition,[],[f5374,f273])). 27.91/28.06 tff(f5843,plain,( 27.91/28.06 size1(sK10(node1(node_proj_11(sK9),node_proj_11(sK9)))) = sK6 | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_110 | ~spl22_134 | ~spl22_138)), 27.91/28.06 inference(superposition,[],[f5668,f3935])). 27.91/28.06 tff(f5913,plain,( 27.91/28.06 ~$less(size1(sK11(node1(node_proj_11(sK9),node_proj_11(sK9)))),0) | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_37 | ~spl22_110 | ~spl22_134 | ~spl22_138)), 27.91/28.06 inference(superposition,[],[f5703,f3935])). 27.91/28.06 tff(f5983,plain,( 27.91/28.06 size1(sK11(node1(node_proj_11(sK9),node_proj_11(sK9)))) = sK6 | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_96 | ~spl22_110 | ~spl22_134 | ~spl22_138)), 27.91/28.06 inference(superposition,[],[f5717,f3935])). 27.91/28.06 tff(f6150,plain,( 27.91/28.06 spl22_188 <=> size1(sK10(node1(node_proj_11(sK9),node_proj_11(sK9)))) = sK6), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_188])])). 27.91/28.06 tff(f6152,plain,( 27.91/28.06 ~spl22_125 | spl22_188 | ~spl22_110 | ~spl22_134 | ~spl22_138), 27.91/28.06 inference(avatar_split_clause,[],[f5843,f3934,f3874,f2959,f6150,f3794])). 27.91/28.06 tff(f6218,plain,( 27.91/28.06 ~spl22_125 | ~spl22_167 | spl22_37 | ~spl22_110 | ~spl22_134 | ~spl22_138), 27.91/28.06 inference(avatar_split_clause,[],[f5913,f3934,f3874,f2959,f615,f5120,f3794])). 27.91/28.06 tff(f6242,plain,( 27.91/28.06 spl22_190 <=> size1(sK11(node1(node_proj_11(sK9),node_proj_11(sK9)))) = sK6), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_190])])). 27.91/28.06 tff(f6244,plain,( 27.91/28.06 ~spl22_125 | spl22_190 | ~spl22_96 | ~spl22_110 | ~spl22_134 | ~spl22_138), 27.91/28.06 inference(avatar_split_clause,[],[f5983,f3934,f3874,f2959,f2489,f6242,f3794])). 27.91/28.06 tff(f6429,plain,( 27.91/28.06 ( ! [X4:tree1] : (size1(sK11(X4)) != sK3 | sK6 != sK6 | sK3 != sK3 | ~mem(tree,t2tb2(X4),t2tb1(sK7))) ) | ~spl22_172), 27.91/28.06 inference(superposition,[],[f5322,f1067])). 27.91/28.06 tff(f6438,plain,( 27.91/28.06 ( ! [X4:tree1] : (size1(sK11(X4)) != sK3 | ~mem(tree,t2tb2(X4),t2tb1(sK7))) ) | ~spl22_172), 27.91/28.06 inference(trivial_inequality_removal,[],[f6429])). 27.91/28.06 tff(f6461,plain,( 27.91/28.06 size1(node_proj_21(sK9)) != sK6 | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_90 | ~spl22_144)), 27.91/28.06 inference(superposition,[],[f2327,f4027])). 27.91/28.06 tff(f6475,plain,( 27.91/28.06 sK6 != sK6 | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_90 | ~spl22_144 | ~spl22_162)), 27.91/28.06 inference(forward_demodulation,[],[f6461,f4494])). 27.91/28.06 tff(f6476,plain,( 27.91/28.06 ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_90 | ~spl22_144 | ~spl22_162)), 27.91/28.06 inference(trivial_inequality_removal,[],[f6475])). 27.91/28.06 tff(f6477,plain,( 27.91/28.06 ~spl22_125 | ~spl22_90 | ~spl22_144 | ~spl22_162), 27.91/28.06 inference(avatar_split_clause,[],[f6476,f4493,f4026,f2320,f3794])). 27.91/28.06 tff(f6491,plain,( 27.91/28.06 ( ! [X1:uni] : (size1(node_proj_21(tb2t2(X1))) != sK3 | ~mem(tree,t2tb2(tb2t2(X1)),t2tb1(sK7)) | ~mem(tree,X1,t2tb1(sK7))) ) | ~spl22_172), 27.91/28.06 inference(superposition,[],[f6438,f596])). 27.91/28.06 tff(f6492,plain,( 27.91/28.06 size1(node_proj_21(sK9)) != sK3 | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_144 | ~spl22_172)), 27.91/28.06 inference(superposition,[],[f6438,f4027])). 27.91/28.06 tff(f6504,plain,( 27.91/28.06 ( ! [X1:uni] : (~mem(tree,X1,t2tb1(sK7)) | size1(node_proj_21(tb2t2(X1))) != sK3 | ~mem(tree,X1,t2tb1(sK7))) ) | ~spl22_172), 27.91/28.06 inference(forward_demodulation,[],[f6491,f277])). 27.91/28.06 tff(f6505,plain,( 27.91/28.06 ( ! [X1:uni] : (size1(node_proj_21(tb2t2(X1))) != sK3 | ~mem(tree,X1,t2tb1(sK7))) ) | ~spl22_172), 27.91/28.06 inference(duplicate_literal_removal,[],[f6504])). 27.91/28.06 tff(f6618,plain,( 27.91/28.06 ( ! [X0:uni] : ($sum($difference(sK3,1),$uminus(sK6)) != sK3 | ~mem(tree,X0,t2tb1(sK7)) | ~mem(tree,X0,t2tb1(sK7))) ) | ~spl22_172), 27.91/28.06 inference(superposition,[],[f6505,f1082])). 27.91/28.06 tff(f6634,plain,( 27.91/28.06 ( ! [X0:uni] : ($sum($difference(sK3,1),$uminus(sK6)) != sK3 | ~mem(tree,X0,t2tb1(sK7))) ) | ~spl22_172), 27.91/28.06 inference(duplicate_literal_removal,[],[f6618])). 27.91/28.06 tff(f6659,plain,( 27.91/28.06 spl22_193 <=> size1(node_proj_21(sK9)) != sK3), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_193])])). 27.91/28.06 tff(f6661,plain,( 27.91/28.06 ~spl22_125 | ~spl22_193 | ~spl22_144 | ~spl22_172), 27.91/28.06 inference(avatar_split_clause,[],[f6492,f5321,f4026,f6659,f3794])). 27.91/28.06 tff(f6777,plain,( 27.91/28.06 spl22_195 <=> $sum($difference(sK3,1),$uminus(sK6)) != sK3), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_195])])). 27.91/28.06 tff(f6779,plain,( 27.91/28.06 spl22_58 | ~spl22_195 | ~spl22_172), 27.91/28.06 inference(avatar_split_clause,[],[f6634,f5321,f6777,f1225])). 27.91/28.06 tff(f6856,plain,( 27.91/28.06 ( ! [X0:tree1,X1:tree1] : (size1(X0) != sK6 | mem(tree,t2tb2(node1(X0,sK11(X1))),t2tb1(sK7)) | ~mem(tree,t2tb2(X1),t2tb1(sK7))) )), 27.91/28.06 inference(equality_resolution,[],[f1199])). 27.91/28.06 tff(f7098,plain,( 27.91/28.06 spl22_196 <=> ! [X6 : tree1] : (node1(sK14(sK11(X6)),sK15(sK11(X6))) = sK11(X6) | ~mem(tree,t2tb2(X6),t2tb1(sK7)))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_196])])). 27.91/28.06 tff(f7099,plain,( 27.91/28.06 ( ! [X6:tree1] : (node1(sK14(sK11(X6)),sK15(sK11(X6))) = sK11(X6) | ~mem(tree,t2tb2(X6),t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(avatar_component_clause,[],[f7098])). 27.91/28.06 tff(f7101,plain,( 27.91/28.06 spl22_198 <=> ! [X7 : $int] : ($sum($difference(sK3,1),$uminus(sK6)) != X7 | ~$less(0,X7))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_198])])). 27.91/28.06 tff(f7102,plain,( 27.91/28.06 ( ! [X7:$int] : ($sum($difference(sK3,1),$uminus(sK6)) != X7 | ~$less(0,X7)) ) | ~spl22_198), 27.91/28.06 inference(avatar_component_clause,[],[f7101])). 27.91/28.06 tff(f7103,plain,( 27.91/28.06 spl22_196 | spl22_198), 27.91/28.06 inference(avatar_split_clause,[],[f1073,f7101,f7098])). 27.91/28.06 tff(f7107,plain,( 27.91/28.06 ~$less(0,$sum($difference(sK3,1),$uminus(sK6))) | ~spl22_198), 27.91/28.06 inference(equality_resolution,[],[f7102])). 27.91/28.06 tff(f7112,plain,( 27.91/28.06 spl22_201 <=> ~$less(0,$sum($difference(sK3,1),$uminus(sK6)))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_201])])). 27.91/28.06 tff(f7114,plain,( 27.91/28.06 ~spl22_201 | ~spl22_198), 27.91/28.06 inference(avatar_split_clause,[],[f7107,f7101,f7112])). 27.91/28.06 tff(f7116,plain,( 27.91/28.06 ( ! [X1:uni] : (node1(sK14(node_proj_21(tb2t2(X1))),sK15(node_proj_21(tb2t2(X1)))) = node_proj_21(tb2t2(X1)) | ~mem(tree,t2tb2(tb2t2(X1)),t2tb1(sK7)) | ~mem(tree,X1,t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(superposition,[],[f7099,f596])). 27.91/28.06 tff(f7117,plain,( 27.91/28.06 node1(sK14(node_proj_21(sK9)),sK15(node_proj_21(sK9))) = node_proj_21(sK9) | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_144 | ~spl22_196)), 27.91/28.06 inference(superposition,[],[f7099,f4027])). 27.91/28.06 tff(f7118,plain,( 27.91/28.06 ( ! [X0:tree1] : (empty1 != sK11(X0) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(superposition,[],[f288,f7099])). 27.91/28.06 tff(f7119,plain,( 27.91/28.06 ( ! [X1:tree1] : (node_proj_21(sK11(X1)) = sK15(sK11(X1)) | ~mem(tree,t2tb2(X1),t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(superposition,[],[f291,f7099])). 27.91/28.06 tff(f7120,plain,( 27.91/28.06 ( ! [X2:tree1] : (node_proj_11(sK11(X2)) = sK14(sK11(X2)) | ~mem(tree,t2tb2(X2),t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(superposition,[],[f292,f7099])). 27.91/28.06 tff(f7149,plain,( 27.91/28.06 ( ! [X1:uni] : (~mem(tree,X1,t2tb1(sK7)) | node1(sK14(node_proj_21(tb2t2(X1))),sK15(node_proj_21(tb2t2(X1)))) = node_proj_21(tb2t2(X1)) | ~mem(tree,X1,t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(forward_demodulation,[],[f7116,f277])). 27.91/28.06 tff(f7150,plain,( 27.91/28.06 ( ! [X1:uni] : (node1(sK14(node_proj_21(tb2t2(X1))),sK15(node_proj_21(tb2t2(X1)))) = node_proj_21(tb2t2(X1)) | ~mem(tree,X1,t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(duplicate_literal_removal,[],[f7149])). 27.91/28.06 tff(f7153,plain,( 27.91/28.06 empty1 != node_proj_21(sK9) | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_144 | ~spl22_196)), 27.91/28.06 inference(superposition,[],[f7118,f4027])). 27.91/28.06 tff(f7177,plain,( 27.91/28.06 spl22_203 <=> empty1 != node_proj_21(sK9)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_203])])). 27.91/28.06 tff(f7179,plain,( 27.91/28.06 ~spl22_125 | ~spl22_203 | ~spl22_144 | ~spl22_196), 27.91/28.06 inference(avatar_split_clause,[],[f7153,f7098,f4026,f7177,f3794])). 27.91/28.06 tff(f7187,plain,( 27.91/28.06 ( ! [X1:uni] : (node_proj_21(node_proj_21(tb2t2(X1))) = sK15(node_proj_21(tb2t2(X1))) | ~mem(tree,t2tb2(tb2t2(X1)),t2tb1(sK7)) | ~mem(tree,X1,t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(superposition,[],[f7119,f596])). 27.91/28.06 tff(f7188,plain,( 27.91/28.06 node_proj_21(node_proj_21(sK9)) = sK15(node_proj_21(sK9)) | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_144 | ~spl22_196)), 27.91/28.06 inference(superposition,[],[f7119,f4027])). 27.91/28.06 tff(f7189,plain,( 27.91/28.06 ( ! [X0:tree1] : (node1(sK14(sK11(X0)),node_proj_21(sK11(X0))) = sK11(X0) | ~mem(tree,t2tb2(X0),t2tb1(sK7)) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(superposition,[],[f7099,f7119])). 27.91/28.06 tff(f7190,plain,( 27.91/28.06 ( ! [X0:tree1] : (node1(sK14(sK11(X0)),node_proj_21(sK11(X0))) = sK11(X0) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(duplicate_literal_removal,[],[f7189])). 27.91/28.06 tff(f7191,plain,( 27.91/28.06 ( ! [X1:uni] : (~mem(tree,X1,t2tb1(sK7)) | node_proj_21(node_proj_21(tb2t2(X1))) = sK15(node_proj_21(tb2t2(X1))) | ~mem(tree,X1,t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(forward_demodulation,[],[f7187,f277])). 27.91/28.06 tff(f7192,plain,( 27.91/28.06 ( ! [X1:uni] : (node_proj_21(node_proj_21(tb2t2(X1))) = sK15(node_proj_21(tb2t2(X1))) | ~mem(tree,X1,t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(duplicate_literal_removal,[],[f7191])). 27.91/28.06 tff(f7194,plain,( 27.91/28.06 ( ! [X1:uni] : (node_proj_11(node_proj_21(tb2t2(X1))) = sK14(node_proj_21(tb2t2(X1))) | ~mem(tree,t2tb2(tb2t2(X1)),t2tb1(sK7)) | ~mem(tree,X1,t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(superposition,[],[f7120,f596])). 27.91/28.06 tff(f7195,plain,( 27.91/28.06 node_proj_11(node_proj_21(sK9)) = sK14(node_proj_21(sK9)) | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_144 | ~spl22_196)), 27.91/28.06 inference(superposition,[],[f7120,f4027])). 27.91/28.06 tff(f7199,plain,( 27.91/28.06 ( ! [X1:uni] : (~mem(tree,X1,t2tb1(sK7)) | node_proj_11(node_proj_21(tb2t2(X1))) = sK14(node_proj_21(tb2t2(X1))) | ~mem(tree,X1,t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(forward_demodulation,[],[f7194,f277])). 27.91/28.06 tff(f7200,plain,( 27.91/28.06 ( ! [X1:uni] : (node_proj_11(node_proj_21(tb2t2(X1))) = sK14(node_proj_21(tb2t2(X1))) | ~mem(tree,X1,t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(duplicate_literal_removal,[],[f7199])). 27.91/28.06 tff(f7205,plain,( 27.91/28.06 spl22_204 <=> node_proj_21(node_proj_21(sK9)) = sK15(node_proj_21(sK9))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_204])])). 27.91/28.06 tff(f7206,plain,( 27.91/28.06 node_proj_21(node_proj_21(sK9)) = sK15(node_proj_21(sK9)) | ~spl22_204), 27.91/28.06 inference(avatar_component_clause,[],[f7205])). 27.91/28.06 tff(f7207,plain,( 27.91/28.06 ~spl22_125 | spl22_204 | ~spl22_144 | ~spl22_196), 27.91/28.06 inference(avatar_split_clause,[],[f7188,f7098,f4026,f7205,f3794])). 27.91/28.06 tff(f7212,plain,( 27.91/28.06 spl22_206 <=> node_proj_11(node_proj_21(sK9)) = sK14(node_proj_21(sK9))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_206])])). 27.91/28.06 tff(f7213,plain,( 27.91/28.06 node_proj_11(node_proj_21(sK9)) = sK14(node_proj_21(sK9)) | ~spl22_206), 27.91/28.06 inference(avatar_component_clause,[],[f7212])). 27.91/28.06 tff(f7214,plain,( 27.91/28.06 ~spl22_125 | spl22_206 | ~spl22_144 | ~spl22_196), 27.91/28.06 inference(avatar_split_clause,[],[f7195,f7098,f4026,f7212,f3794])). 27.91/28.06 tff(f7216,plain,( 27.91/28.06 ( ! [X0:tree1] : (node_proj_21(node_proj_21(X0)) = sK15(node_proj_21(X0)) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(superposition,[],[f7192,f273])). 27.91/28.06 tff(f7246,plain,( 27.91/28.06 ( ! [X0:tree1] : (node_proj_11(node_proj_21(X0)) = sK14(node_proj_21(X0)) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(superposition,[],[f7200,f273])). 27.91/28.06 tff(f7309,plain,( 27.91/28.06 node1(sK14(node_proj_21(sK9)),node_proj_21(node_proj_21(sK9))) = node_proj_21(sK9) | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_144 | ~spl22_196 | ~spl22_204)), 27.91/28.06 inference(forward_demodulation,[],[f7117,f7206])). 27.91/28.06 tff(f7310,plain,( 27.91/28.06 node1(node_proj_11(node_proj_21(sK9)),node_proj_21(node_proj_21(sK9))) = node_proj_21(sK9) | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_144 | ~spl22_196 | ~spl22_204 | ~spl22_206)), 27.91/28.06 inference(forward_demodulation,[],[f7309,f7213])). 27.91/28.06 tff(f7311,plain,( 27.91/28.06 ( ! [X0:tree1] : (node1(node_proj_11(sK11(X0)),node_proj_21(sK11(X0))) = sK11(X0) | ~mem(tree,t2tb2(X0),t2tb1(sK7)) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(superposition,[],[f7190,f7120])). 27.91/28.06 tff(f7347,plain,( 27.91/28.06 ( ! [X0:tree1] : (node1(node_proj_11(sK11(X0)),node_proj_21(sK11(X0))) = sK11(X0) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(duplicate_literal_removal,[],[f7311])). 27.91/28.06 tff(f7395,plain,( 27.91/28.06 spl22_208 <=> node1(node_proj_11(node_proj_21(sK9)),node_proj_21(node_proj_21(sK9))) = node_proj_21(sK9)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_208])])). 27.91/28.06 tff(f7396,plain,( 27.91/28.06 node1(node_proj_11(node_proj_21(sK9)),node_proj_21(node_proj_21(sK9))) = node_proj_21(sK9) | ~spl22_208), 27.91/28.06 inference(avatar_component_clause,[],[f7395])). 27.91/28.06 tff(f7397,plain,( 27.91/28.06 ~spl22_125 | spl22_208 | ~spl22_144 | ~spl22_196 | ~spl22_204 | ~spl22_206), 27.91/28.06 inference(avatar_split_clause,[],[f7310,f7212,f7205,f7098,f4026,f7395,f3794])). 27.91/28.06 tff(f7405,plain,( 27.91/28.06 ( ! [X0:tree1,X1:tree1] : (node1(X0,X1) != node_proj_21(sK9) | size1(X0) = size1(node_proj_11(node_proj_21(sK9)))) ) | ~spl22_208), 27.91/28.06 inference(superposition,[],[f315,f7396])). 27.91/28.06 tff(f7412,plain,( 27.91/28.06 ( ! [X13:uni] : (node_proj_21(sK9) != tb2t2(X13) | size1(node_proj_11(node_proj_21(sK9))) = size1(sK10(tb2t2(X13))) | ~mem(tree,X13,t2tb1(sK7))) ) | ~spl22_208), 27.91/28.06 inference(superposition,[],[f652,f7396])). 27.91/28.06 tff(f7433,plain,( 27.91/28.06 ( ! [X13:uni] : (node_proj_21(sK9) != tb2t2(X13) | size1(node_proj_11(node_proj_21(sK9))) = size1(sK10(node_proj_21(sK9))) | ~mem(tree,X13,t2tb1(sK7))) ) | ~spl22_208), 27.91/28.06 inference(inner_rewriting,[],[f7412])). 27.91/28.06 tff(f7441,plain,( 27.91/28.06 spl22_210 <=> size1(node_proj_11(node_proj_21(sK9))) = size1(sK10(node_proj_21(sK9)))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_210])])). 27.91/28.06 tff(f7444,plain,( 27.91/28.06 spl22_212 <=> ! [X13 : uni] : (node_proj_21(sK9) != tb2t2(X13) | ~mem(tree,X13,t2tb1(sK7)))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_212])])). 27.91/28.06 tff(f7445,plain,( 27.91/28.06 ( ! [X13:uni] : (node_proj_21(sK9) != tb2t2(X13) | ~mem(tree,X13,t2tb1(sK7))) ) | ~spl22_212), 27.91/28.06 inference(avatar_component_clause,[],[f7444])). 27.91/28.06 tff(f7446,plain,( 27.91/28.06 spl22_210 | spl22_212 | ~spl22_208), 27.91/28.06 inference(avatar_split_clause,[],[f7433,f7395,f7444,f7441])). 27.91/28.06 tff(f7447,plain,( 27.91/28.06 ( ! [X0:tree1] : (node_proj_21(sK9) != X0 | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | ~spl22_212), 27.91/28.06 inference(superposition,[],[f7445,f273])). 27.91/28.06 tff(f7448,plain,( 27.91/28.06 ~mem(tree,t2tb2(node_proj_21(sK9)),t2tb1(sK7)) | ~spl22_212), 27.91/28.06 inference(equality_resolution,[],[f7447])). 27.91/28.06 tff(f7453,plain,( 27.91/28.06 spl22_215 <=> ~mem(tree,t2tb2(node_proj_21(sK9)),t2tb1(sK7))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_215])])). 27.91/28.06 tff(f7454,plain,( 27.91/28.06 ~mem(tree,t2tb2(node_proj_21(sK9)),t2tb1(sK7)) | ~spl22_215), 27.91/28.06 inference(avatar_component_clause,[],[f7453])). 27.91/28.06 tff(f7455,plain,( 27.91/28.06 ~spl22_215 | ~spl22_212), 27.91/28.06 inference(avatar_split_clause,[],[f7448,f7444,f7453])). 27.91/28.06 tff(f7456,plain,( 27.91/28.06 ~all_trees1(size1(node_proj_21(sK9)),sK7) | ~spl22_215), 27.91/28.06 inference(resolution,[],[f7454,f370])). 27.91/28.06 tff(f7472,plain,( 27.91/28.06 ( ! [X15:uni] : (node_proj_21(sK9) != tb2t2(sK19(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X15)) | size1(node_proj_11(node_proj_21(sK9))) = size1(sK12(tb2t2(sK19(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X15)))) | distinct(tree,infix_plpl(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X15)) | ~distinct(tree,X15)) ) | ~spl22_208), 27.91/28.06 inference(superposition,[],[f7405,f936])). 27.91/28.06 tff(f7473,plain,( 27.91/28.06 ( ! [X16:uni] : (node_proj_21(sK9) != tb2t2(sK19(tree,X16,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) | size1(node_proj_11(node_proj_21(sK9))) = size1(sK12(tb2t2(sK19(tree,X16,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))))) | distinct(tree,infix_plpl(tree,X16,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) | ~distinct(tree,X16)) ) | ~spl22_208), 27.91/28.06 inference(superposition,[],[f7405,f937])). 27.91/28.06 tff(f7478,plain,( 27.91/28.06 ( ! [X15:uni] : (node_proj_21(sK9) != tb2t2(sK19(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X15)) | size1(node_proj_11(node_proj_21(sK9))) = size1(sK12(node_proj_21(sK9))) | distinct(tree,infix_plpl(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X15)) | ~distinct(tree,X15)) ) | ~spl22_208), 27.91/28.06 inference(inner_rewriting,[],[f7472])). 27.91/28.06 tff(f7479,plain,( 27.91/28.06 ( ! [X16:uni] : (node_proj_21(sK9) != tb2t2(sK19(tree,X16,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) | size1(node_proj_11(node_proj_21(sK9))) = size1(sK12(node_proj_21(sK9))) | distinct(tree,infix_plpl(tree,X16,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) | ~distinct(tree,X16)) ) | ~spl22_208), 27.91/28.06 inference(inner_rewriting,[],[f7473])). 27.91/28.06 tff(f7489,plain,( 27.91/28.06 spl22_216 <=> size1(node_proj_11(node_proj_21(sK9))) = size1(sK12(node_proj_21(sK9)))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_216])])). 27.91/28.06 tff(f7490,plain,( 27.91/28.06 size1(node_proj_11(node_proj_21(sK9))) = size1(sK12(node_proj_21(sK9))) | ~spl22_216), 27.91/28.06 inference(avatar_component_clause,[],[f7489])). 27.91/28.06 tff(f7492,plain,( 27.91/28.06 spl22_218 <=> ! [X15 : uni] : (node_proj_21(sK9) != tb2t2(sK19(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X15)) | ~distinct(tree,X15) | distinct(tree,infix_plpl(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X15)))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_218])])). 27.91/28.06 tff(f7494,plain,( 27.91/28.06 spl22_216 | spl22_218 | ~spl22_208), 27.91/28.06 inference(avatar_split_clause,[],[f7478,f7395,f7492,f7489])). 27.91/28.06 tff(f7496,plain,( 27.91/28.06 spl22_220 <=> ! [X16 : uni] : (node_proj_21(sK9) != tb2t2(sK19(tree,X16,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) | ~distinct(tree,X16) | distinct(tree,infix_plpl(tree,X16,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_220])])). 27.91/28.06 tff(f7498,plain,( 27.91/28.06 spl22_216 | spl22_220 | ~spl22_208), 27.91/28.06 inference(avatar_split_clause,[],[f7479,f7395,f7496,f7489])). 27.91/28.06 tff(f7500,plain,( 27.91/28.06 ( ! [X0:$int,X1:$int] : (size1(node_proj_11(node_proj_21(sK9))) != X0 | sK6 != X1 | $less(X0,X1) | ~mem(tree,t2tb2(node_proj_21(sK9)),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) ) | ~spl22_216), 27.91/28.06 inference(superposition,[],[f388,f7490])). 27.91/28.06 tff(f7502,plain,( 27.91/28.06 ( ! [X3:$int] : (size1(node_proj_11(node_proj_21(sK9))) != X3 | node1(sK14(sK12(node_proj_21(sK9))),sK15(sK12(node_proj_21(sK9)))) = sK12(node_proj_21(sK9)) | ~$less(0,X3)) ) | ~spl22_216), 27.91/28.06 inference(superposition,[],[f412,f7490])). 27.91/28.06 tff(f7504,plain,( 27.91/28.06 ( ! [X8:$int] : (size1(node_proj_11(node_proj_21(sK9))) != sK3 | sK6 != X8 | ~$less(size1(node_proj_11(sK12(node_proj_21(sK9)))),X8) | mem(tree,t2tb2(node1(node_proj_11(sK12(node_proj_21(sK9))),node_proj_21(sK12(node_proj_21(sK9))))),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | empty1 = sK12(node_proj_21(sK9))) ) | ~spl22_216), 27.91/28.06 inference(superposition,[],[f1238,f7490])). 27.91/28.06 tff(f7508,plain,( 27.91/28.06 ( ! [X13:tree1] : (size1(node_proj_11(node_proj_21(sK9))) != sK6 | ~mem(tree,t2tb2(node1(X13,sK12(node_proj_21(sK9)))),t2tb1(sK7))) ) | (~spl22_90 | ~spl22_216)), 27.91/28.06 inference(superposition,[],[f2330,f7490])). 27.91/28.06 tff(f7509,plain,( 27.91/28.06 ( ! [X14:$int,X15:$int] : (size1(node_proj_11(node_proj_21(sK9))) != X14 | sK6 != X15 | $sum($sum(1,X15),size1(sK11(sK12(node_proj_21(sK9))))) = X14 | ~mem(tree,t2tb2(sK12(node_proj_21(sK9))),t2tb1(sK7))) ) | ~spl22_216), 27.91/28.06 inference(superposition,[],[f3338,f7490])). 27.91/28.06 tff(f7512,plain,( 27.91/28.06 spl22_223 <=> node1(sK14(sK12(node_proj_21(sK9))),sK15(sK12(node_proj_21(sK9)))) != sK12(node_proj_21(sK9))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_223])])). 27.91/28.06 tff(f7513,plain,( 27.91/28.06 node1(sK14(sK12(node_proj_21(sK9))),sK15(sK12(node_proj_21(sK9)))) != sK12(node_proj_21(sK9)) | ~spl22_223), 27.91/28.06 inference(avatar_component_clause,[],[f7512])). 27.91/28.06 tff(f7515,plain,( 27.91/28.06 spl22_222 <=> node1(sK14(sK12(node_proj_21(sK9))),sK15(sK12(node_proj_21(sK9)))) = sK12(node_proj_21(sK9))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_222])])). 27.91/28.06 tff(f7516,plain,( 27.91/28.06 node1(sK14(sK12(node_proj_21(sK9))),sK15(sK12(node_proj_21(sK9)))) = sK12(node_proj_21(sK9)) | ~spl22_222), 27.91/28.06 inference(avatar_component_clause,[],[f7515])). 27.91/28.06 tff(f7518,plain,( 27.91/28.06 spl22_224 <=> ! [X3 : $int] : (size1(node_proj_11(node_proj_21(sK9))) != X3 | ~$less(0,X3))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_224])])). 27.91/28.06 tff(f7519,plain,( 27.91/28.06 ( ! [X3:$int] : (size1(node_proj_11(node_proj_21(sK9))) != X3 | ~$less(0,X3)) ) | ~spl22_224), 27.91/28.06 inference(avatar_component_clause,[],[f7518])). 27.91/28.06 tff(f7520,plain,( 27.91/28.06 spl22_222 | spl22_224 | ~spl22_216), 27.91/28.06 inference(avatar_split_clause,[],[f7502,f7489,f7518,f7515])). 27.91/28.06 tff(f7521,plain,( 27.91/28.06 empty1 != sK12(node_proj_21(sK9)) | ~spl22_222), 27.91/28.06 inference(superposition,[],[f288,f7516])). 27.91/28.06 tff(f7522,plain,( 27.91/28.06 node_proj_21(sK12(node_proj_21(sK9))) = sK15(sK12(node_proj_21(sK9))) | ~spl22_222), 27.91/28.06 inference(superposition,[],[f291,f7516])). 27.91/28.06 tff(f7562,plain,( 27.91/28.06 spl22_226 <=> empty1 = sK12(node_proj_21(sK9))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_226])])). 27.91/28.06 tff(f7565,plain,( 27.91/28.06 spl22_227 <=> empty1 != sK12(node_proj_21(sK9))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_227])])). 27.91/28.06 tff(f7567,plain,( 27.91/28.06 ~spl22_227 | ~spl22_222), 27.91/28.06 inference(avatar_split_clause,[],[f7521,f7515,f7565])). 27.91/28.06 tff(f7568,plain,( 27.91/28.06 node1(sK14(sK12(node_proj_21(sK9))),node_proj_21(sK12(node_proj_21(sK9)))) = sK12(node_proj_21(sK9)) | ~spl22_222), 27.91/28.06 inference(backward_demodulation,[],[f7522,f7516])). 27.91/28.06 tff(f7573,plain,( 27.91/28.06 spl22_228 <=> node_proj_21(sK12(node_proj_21(sK9))) = sK15(sK12(node_proj_21(sK9)))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_228])])). 27.91/28.06 tff(f7574,plain,( 27.91/28.06 node_proj_21(sK12(node_proj_21(sK9))) = sK15(sK12(node_proj_21(sK9))) | ~spl22_228), 27.91/28.06 inference(avatar_component_clause,[],[f7573])). 27.91/28.06 tff(f7575,plain,( 27.91/28.06 spl22_228 | ~spl22_222), 27.91/28.06 inference(avatar_split_clause,[],[f7522,f7515,f7573])). 27.91/28.06 tff(f7577,plain,( 27.91/28.06 spl22_231 <=> node1(sK14(sK12(node_proj_21(sK9))),node_proj_21(sK12(node_proj_21(sK9)))) != sK12(node_proj_21(sK9))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_231])])). 27.91/28.06 tff(f7580,plain,( 27.91/28.06 spl22_230 <=> node1(sK14(sK12(node_proj_21(sK9))),node_proj_21(sK12(node_proj_21(sK9)))) = sK12(node_proj_21(sK9))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_230])])). 27.91/28.06 tff(f7582,plain,( 27.91/28.06 spl22_230 | ~spl22_222), 27.91/28.06 inference(avatar_split_clause,[],[f7568,f7515,f7580])). 27.91/28.06 tff(f7584,plain,( 27.91/28.06 ~$less(0,size1(node_proj_11(node_proj_21(sK9)))) | ~spl22_224), 27.91/28.06 inference(equality_resolution,[],[f7519])). 27.91/28.06 tff(f7589,plain,( 27.91/28.06 spl22_233 <=> ~$less(0,size1(node_proj_11(node_proj_21(sK9))))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_233])])). 27.91/28.06 tff(f7591,plain,( 27.91/28.06 ~spl22_233 | ~spl22_224), 27.91/28.06 inference(avatar_split_clause,[],[f7584,f7518,f7589])). 27.91/28.06 tff(f7593,plain,( 27.91/28.06 node1(sK14(sK12(node_proj_21(sK9))),node_proj_21(sK12(node_proj_21(sK9)))) != sK12(node_proj_21(sK9)) | (~spl22_223 | ~spl22_228)), 27.91/28.06 inference(forward_demodulation,[],[f7513,f7574])). 27.91/28.06 tff(f7594,plain,( 27.91/28.06 ~spl22_231 | spl22_223 | ~spl22_228), 27.91/28.06 inference(avatar_split_clause,[],[f7593,f7573,f7512,f7577])). 27.91/28.06 tff(f7599,plain,( 27.91/28.06 spl22_235 <=> ~mem(tree,t2tb2(node_proj_21(sK9)),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_235])])). 27.91/28.06 tff(f7602,plain,( 27.91/28.06 spl22_236 <=> ! [X1 : $int,X0 : $int] : (size1(node_proj_11(node_proj_21(sK9))) != X0 | $less(X0,X1) | sK6 != X1)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_236])])). 27.91/28.06 tff(f7604,plain,( 27.91/28.06 ~spl22_235 | spl22_236 | ~spl22_216), 27.91/28.06 inference(avatar_split_clause,[],[f7500,f7489,f7602,f7599])). 27.91/28.06 tff(f7606,plain,( 27.91/28.06 ( ! [X1:uni] : (node1(node_proj_11(node_proj_21(tb2t2(X1))),node_proj_21(node_proj_21(tb2t2(X1)))) = node_proj_21(tb2t2(X1)) | ~mem(tree,t2tb2(tb2t2(X1)),t2tb1(sK7)) | ~mem(tree,X1,t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(superposition,[],[f7347,f596])). 27.91/28.06 tff(f7646,plain,( 27.91/28.06 ( ! [X1:uni] : (~mem(tree,X1,t2tb1(sK7)) | node1(node_proj_11(node_proj_21(tb2t2(X1))),node_proj_21(node_proj_21(tb2t2(X1)))) = node_proj_21(tb2t2(X1)) | ~mem(tree,X1,t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(forward_demodulation,[],[f7606,f277])). 27.91/28.06 tff(f7647,plain,( 27.91/28.06 ( ! [X1:uni] : (node1(node_proj_11(node_proj_21(tb2t2(X1))),node_proj_21(node_proj_21(tb2t2(X1)))) = node_proj_21(tb2t2(X1)) | ~mem(tree,X1,t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(duplicate_literal_removal,[],[f7646])). 27.91/28.06 tff(f7652,plain,( 27.91/28.06 spl22_238 <=> mem(tree,t2tb2(node1(node_proj_11(sK12(node_proj_21(sK9))),node_proj_21(sK12(node_proj_21(sK9))))),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_238])])). 27.91/28.06 tff(f7655,plain,( 27.91/28.06 spl22_240 <=> ! [X8 : $int] : (sK6 != X8 | ~$less(size1(node_proj_11(sK12(node_proj_21(sK9)))),X8))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_240])])). 27.91/28.06 tff(f7661,plain,( 27.91/28.06 spl22_243 <=> size1(node_proj_11(node_proj_21(sK9))) != sK3), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_243])])). 27.91/28.06 tff(f7663,plain,( 27.91/28.06 spl22_226 | spl22_238 | spl22_240 | ~spl22_243 | ~spl22_216), 27.91/28.06 inference(avatar_split_clause,[],[f7504,f7489,f7661,f7655,f7652,f7562])). 27.91/28.06 tff(f7666,plain,( 27.91/28.06 spl22_244 <=> ! [X0 : tree1] : ~mem(tree,t2tb2(X0),t2tb1(sK7))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_244])])). 27.91/28.06 tff(f7669,plain,( 27.91/28.06 spl22_246 <=> ! [X1 : $int,X3 : $int,X2 : $int] : ($sum($difference(sK3,1),$uminus(sK6)) != X1 | sK3 != X2 | $sum($difference(X2,1),$uminus(X3)) = X1 | sK6 != X3)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_246])])). 27.91/28.06 tff(f7671,plain,( 27.91/28.06 spl22_244 | spl22_246), 27.91/28.06 inference(avatar_split_clause,[],[f1080,f7669,f7666])). 27.91/28.06 tff(f7684,plain,( 27.91/28.06 spl22_248 <=> ! [X13 : tree1] : ~mem(tree,t2tb2(node1(X13,sK12(node_proj_21(sK9)))),t2tb1(sK7))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_248])])). 27.91/28.06 tff(f7690,plain,( 27.91/28.06 spl22_251 <=> size1(node_proj_11(node_proj_21(sK9))) != sK6), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_251])])). 27.91/28.06 tff(f7692,plain,( 27.91/28.06 spl22_248 | ~spl22_251 | ~spl22_90 | ~spl22_216), 27.91/28.06 inference(avatar_split_clause,[],[f7508,f7489,f2320,f7690,f7684])). 27.91/28.06 tff(f7731,plain,( 27.91/28.06 spl22_253 <=> ~mem(tree,t2tb2(sK12(node_proj_21(sK9))),t2tb1(sK7))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_253])])). 27.91/28.06 tff(f7732,plain,( 27.91/28.06 ~mem(tree,t2tb2(sK12(node_proj_21(sK9))),t2tb1(sK7)) | ~spl22_253), 27.91/28.06 inference(avatar_component_clause,[],[f7731])). 27.91/28.06 tff(f7734,plain,( 27.91/28.06 spl22_254 <=> ! [X15 : $int,X14 : $int] : (size1(node_proj_11(node_proj_21(sK9))) != X14 | sK6 != X15 | $sum($sum(1,X15),size1(sK11(sK12(node_proj_21(sK9))))) = X14)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_254])])). 27.91/28.06 tff(f7736,plain,( 27.91/28.06 ~spl22_253 | spl22_254 | ~spl22_216), 27.91/28.06 inference(avatar_split_clause,[],[f7509,f7489,f7734,f7731])). 27.91/28.06 tff(f7737,plain,( 27.91/28.06 ~all_trees1(size1(sK12(node_proj_21(sK9))),sK7) | ~spl22_253), 27.91/28.06 inference(resolution,[],[f7732,f370])). 27.91/28.06 tff(f8015,plain,( 27.91/28.06 ( ! [X0:tree1] : (node1(sK14(node_proj_21(X0)),sK15(node_proj_21(X0))) = node_proj_21(X0) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(superposition,[],[f7150,f273])). 27.91/28.06 tff(f8066,plain,( 27.91/28.06 ( ! [X1:tree1] : (node1(sK14(node_proj_21(X1)),node_proj_21(node_proj_21(X1))) = node_proj_21(X1) | ~mem(tree,t2tb2(X1),t2tb1(sK7)) | ~mem(tree,t2tb2(X1),t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(superposition,[],[f8015,f7216])). 27.91/28.06 tff(f8102,plain,( 27.91/28.06 ( ! [X1:tree1] : (node1(sK14(node_proj_21(X1)),node_proj_21(node_proj_21(X1))) = node_proj_21(X1) | ~mem(tree,t2tb2(X1),t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(duplicate_literal_removal,[],[f8066])). 27.91/28.06 tff(f8146,plain,( 27.91/28.06 ( ! [X1:tree1] : (node1(node_proj_11(node_proj_21(X1)),node_proj_21(node_proj_21(X1))) = node_proj_21(X1) | ~mem(tree,t2tb2(X1),t2tb1(sK7)) | ~mem(tree,t2tb2(X1),t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(superposition,[],[f8102,f7246])). 27.91/28.06 tff(f8183,plain,( 27.91/28.06 ( ! [X1:tree1] : (node1(node_proj_11(node_proj_21(X1)),node_proj_21(node_proj_21(X1))) = node_proj_21(X1) | ~mem(tree,t2tb2(X1),t2tb1(sK7))) ) | ~spl22_196), 27.91/28.06 inference(duplicate_literal_removal,[],[f8146])). 27.91/28.06 tff(f8588,plain,( 27.91/28.06 ( ! [X11:tree1] : (sK6 != sK6 | mem(tree,t2tb2(node1(node_proj_11(sK9),sK11(X11))),t2tb1(sK7)) | ~mem(tree,t2tb2(X11),t2tb1(sK7))) ) | ~spl22_134), 27.91/28.06 inference(superposition,[],[f6856,f3875])). 27.91/28.06 tff(f8629,plain,( 27.91/28.06 ( ! [X11:tree1] : (mem(tree,t2tb2(node1(node_proj_11(sK9),sK11(X11))),t2tb1(sK7)) | ~mem(tree,t2tb2(X11),t2tb1(sK7))) ) | ~spl22_134), 27.91/28.06 inference(trivial_inequality_removal,[],[f8588])). 27.91/28.06 tff(f8655,plain,( 27.91/28.06 ( ! [X21:tree1] : (size1(sK10(node1(node_proj_11(sK9),sK11(X21)))) = sK6 | ~mem(tree,t2tb2(X21),t2tb1(sK7))) ) | ~spl22_134), 27.91/28.06 inference(resolution,[],[f8629,f253])). 27.91/28.06 tff(f8656,plain,( 27.91/28.06 ( ! [X22:tree1] : (~mem(tree,t2tb2(X22),t2tb1(sK7)) | node_proj_21(node1(node_proj_11(sK9),sK11(X22))) = sK11(node1(node_proj_11(sK9),sK11(X22)))) ) | ~spl22_134), 27.91/28.06 inference(resolution,[],[f8629,f572])). 27.91/28.06 tff(f8657,plain,( 27.91/28.06 ( ! [X23:tree1] : (~mem(tree,t2tb2(X23),t2tb1(sK7)) | node_proj_11(node1(node_proj_11(sK9),sK11(X23))) = sK10(node1(node_proj_11(sK9),sK11(X23)))) ) | ~spl22_134), 27.91/28.06 inference(resolution,[],[f8629,f573])). 27.91/28.06 tff(f8659,plain,( 27.91/28.06 ( ! [X25:tree1] : (~$less(size1(sK11(node1(node_proj_11(sK9),sK11(X25)))),0) | ~mem(tree,t2tb2(X25),t2tb1(sK7))) ) | (~spl22_37 | ~spl22_134)), 27.91/28.06 inference(resolution,[],[f8629,f1075])). 27.91/28.06 tff(f8664,plain,( 27.91/28.06 mem(tree,t2tb2(node1(node_proj_11(sK9),node_proj_21(sK9))),t2tb1(sK7)) | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_134 | ~spl22_144)), 27.91/28.06 inference(superposition,[],[f8629,f4027])). 27.91/28.06 tff(f8671,plain,( 27.91/28.06 ( ! [X22:tree1] : (sK11(X22) = sK11(node1(node_proj_11(sK9),sK11(X22))) | ~mem(tree,t2tb2(X22),t2tb1(sK7))) ) | ~spl22_134), 27.91/28.06 inference(forward_demodulation,[],[f8656,f291])). 27.91/28.06 tff(f8672,plain,( 27.91/28.06 ( ! [X23:tree1] : (node_proj_11(sK9) = sK10(node1(node_proj_11(sK9),sK11(X23))) | ~mem(tree,t2tb2(X23),t2tb1(sK7))) ) | ~spl22_134), 27.91/28.06 inference(forward_demodulation,[],[f8657,f292])). 27.91/28.06 tff(f8679,plain,( 27.91/28.06 size1(sK10(node1(node_proj_11(sK9),node_proj_21(sK9)))) = sK6 | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_134 | ~spl22_144)), 27.91/28.06 inference(superposition,[],[f8655,f4027])). 27.91/28.06 tff(f8726,plain,( 27.91/28.06 ~$less(size1(sK11(node1(node_proj_11(sK9),node_proj_21(sK9)))),0) | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_37 | ~spl22_134 | ~spl22_144)), 27.91/28.06 inference(superposition,[],[f8659,f4027])). 27.91/28.06 tff(f8754,plain,( 27.91/28.06 node_proj_21(sK9) = sK11(node1(node_proj_11(sK9),node_proj_21(sK9))) | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_134 | ~spl22_144)), 27.91/28.06 inference(superposition,[],[f8671,f4027])). 27.91/28.06 tff(f8803,plain,( 27.91/28.06 node_proj_11(sK9) = sK10(node1(node_proj_11(sK9),node_proj_21(sK9))) | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_134 | ~spl22_144)), 27.91/28.06 inference(superposition,[],[f8672,f4027])). 27.91/28.06 tff(f8838,plain,( 27.91/28.06 spl22_256 <=> size1(sK10(node1(node_proj_11(sK9),node_proj_21(sK9)))) = sK6), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_256])])). 27.91/28.06 tff(f8840,plain,( 27.91/28.06 ~spl22_125 | spl22_256 | ~spl22_134 | ~spl22_144), 27.91/28.06 inference(avatar_split_clause,[],[f8679,f4026,f3874,f8838,f3794])). 27.91/28.06 tff(f8916,plain,( 27.91/28.06 spl22_259 <=> ~$less(size1(sK11(node1(node_proj_11(sK9),node_proj_21(sK9)))),0)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_259])])). 27.91/28.06 tff(f8918,plain,( 27.91/28.06 ~spl22_125 | ~spl22_259 | spl22_37 | ~spl22_134 | ~spl22_144), 27.91/28.06 inference(avatar_split_clause,[],[f8726,f4026,f3874,f615,f8916,f3794])). 27.91/28.06 tff(f8948,plain,( 27.91/28.06 spl22_260 <=> node_proj_21(sK9) = sK11(node1(node_proj_11(sK9),node_proj_21(sK9)))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_260])])). 27.91/28.06 tff(f8950,plain,( 27.91/28.06 ~spl22_125 | spl22_260 | ~spl22_134 | ~spl22_144), 27.91/28.06 inference(avatar_split_clause,[],[f8754,f4026,f3874,f8948,f3794])). 27.91/28.06 tff(f9004,plain,( 27.91/28.06 spl22_262 <=> node_proj_11(sK9) = sK10(node1(node_proj_11(sK9),node_proj_21(sK9)))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_262])])). 27.91/28.06 tff(f9006,plain,( 27.91/28.06 ~spl22_125 | spl22_262 | ~spl22_134 | ~spl22_144), 27.91/28.06 inference(avatar_split_clause,[],[f8803,f4026,f3874,f9004,f3794])). 27.91/28.06 tff(f9146,plain,( 27.91/28.06 spl22_264 <=> mem(tree,t2tb2(node1(node_proj_11(sK9),node_proj_21(sK9))),t2tb1(sK7))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_264])])). 27.91/28.06 tff(f9147,plain,( 27.91/28.06 mem(tree,t2tb2(node1(node_proj_11(sK9),node_proj_21(sK9))),t2tb1(sK7)) | ~spl22_264), 27.91/28.06 inference(avatar_component_clause,[],[f9146])). 27.91/28.06 tff(f9148,plain,( 27.91/28.06 ~spl22_125 | spl22_264 | ~spl22_134 | ~spl22_144), 27.91/28.06 inference(avatar_split_clause,[],[f8664,f4026,f3874,f9146,f3794])). 27.91/28.06 tff(f9152,plain,( 27.91/28.06 $less(size1(node_proj_21(sK9)),$sum(sK0,1)) | (~spl22_42 | ~spl22_264)), 27.91/28.06 inference(resolution,[],[f9147,f1126])). 27.91/28.06 tff(f9153,plain,( 27.91/28.06 ( ! [X0:tree1] : (size1(node_proj_21(sK9)) = size1(node_proj_21(X0)) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | ~spl22_264), 27.91/28.06 inference(resolution,[],[f9147,f1256])). 27.91/28.06 tff(f9190,plain,( 27.91/28.06 spl22_266 <=> $less(size1(node_proj_21(sK9)),$sum(sK0,1))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_266])])). 27.91/28.06 tff(f9192,plain,( 27.91/28.06 spl22_266 | ~spl22_42 | ~spl22_264), 27.91/28.06 inference(avatar_split_clause,[],[f9152,f9146,f734,f9190])). 27.91/28.06 tff(f9202,plain,( 27.91/28.06 ( ! [X0:uni] : (size1(node_proj_21(sK9)) = $sum($difference(sK3,1),$uminus(sK6)) | ~mem(tree,t2tb2(tb2t2(X0)),t2tb1(sK7)) | ~mem(tree,X0,t2tb1(sK7))) ) | ~spl22_264), 27.91/28.06 inference(superposition,[],[f9153,f1082])). 27.91/28.06 tff(f9253,plain,( 27.91/28.06 ( ! [X28:tree1] : (size1(X28) = $sum($sum(1,sK6),size1(node_proj_21(sK9))) | ~mem(tree,t2tb2(X28),t2tb1(sK7)) | ~mem(tree,t2tb2(X28),t2tb1(sK7))) ) | ~spl22_264), 27.91/28.06 inference(superposition,[],[f3716,f9153])). 27.91/28.06 tff(f9268,plain,( 27.91/28.06 ( ! [X60:uni] : (size1(tb2t2(X60)) = $sum($sum(1,sK6),size1(node_proj_21(sK9))) | ~mem(tree,X60,t2tb1(sK7)) | ~mem(tree,t2tb2(tb2t2(X60)),t2tb1(sK7))) ) | ~spl22_264), 27.91/28.06 inference(superposition,[],[f3680,f9153])). 27.91/28.06 tff(f9284,plain,( 27.91/28.06 ( ! [X28:tree1] : (size1(X28) = $sum($sum(1,sK6),size1(node_proj_21(sK9))) | ~mem(tree,t2tb2(X28),t2tb1(sK7))) ) | ~spl22_264), 27.91/28.06 inference(duplicate_literal_removal,[],[f9253])). 27.91/28.06 tff(f9301,plain,( 27.91/28.06 ( ! [X0:uni] : (~mem(tree,X0,t2tb1(sK7)) | size1(node_proj_21(sK9)) = $sum($difference(sK3,1),$uminus(sK6)) | ~mem(tree,X0,t2tb1(sK7))) ) | ~spl22_264), 27.91/28.06 inference(forward_demodulation,[],[f9202,f277])). 27.91/28.06 tff(f9302,plain,( 27.91/28.06 ( ! [X0:uni] : (~mem(tree,X0,t2tb1(sK7)) | size1(node_proj_21(sK9)) = $sum($difference(sK3,1),$uminus(sK6))) ) | ~spl22_264), 27.91/28.06 inference(duplicate_literal_removal,[],[f9301])). 27.91/28.06 tff(f9330,plain,( 27.91/28.06 ( ! [X60:uni] : (~mem(tree,X60,t2tb1(sK7)) | size1(tb2t2(X60)) = $sum($sum(1,sK6),size1(node_proj_21(sK9))) | ~mem(tree,X60,t2tb1(sK7))) ) | ~spl22_264), 27.91/28.06 inference(forward_demodulation,[],[f9268,f277])). 27.91/28.06 tff(f9331,plain,( 27.91/28.06 ( ! [X60:uni] : (size1(tb2t2(X60)) = $sum($sum(1,sK6),size1(node_proj_21(sK9))) | ~mem(tree,X60,t2tb1(sK7))) ) | ~spl22_264), 27.91/28.06 inference(duplicate_literal_removal,[],[f9330])). 27.91/28.06 tff(f9546,plain,( 27.91/28.06 spl22_268 <=> size1(node_proj_21(sK9)) = $sum($difference(sK3,1),$uminus(sK6))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_268])])). 27.91/28.06 tff(f9548,plain,( 27.91/28.06 spl22_268 | spl22_58 | ~spl22_264), 27.91/28.06 inference(avatar_split_clause,[],[f9302,f9146,f1225,f9546])). 27.91/28.06 tff(f9870,plain,( 27.91/28.06 ( ! [X0:tree1,X1:tree1] : (~mem(tree,t2tb2(X1),t2tb1(sK7)) | size1(X0) = size1(X1) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | ~spl22_264), 27.91/28.06 inference(superposition,[],[f9284,f9284])). 27.91/28.06 tff(f10249,plain,( 27.91/28.06 ( ! [X0:tree1] : (~mem(tree,t2tb2(X0),t2tb1(sK7)) | size1(sK9) = size1(X0)) ) | (~spl22_124 | ~spl22_264)), 27.91/28.06 inference(resolution,[],[f9870,f3798])). 27.91/28.06 tff(f10259,plain,( 27.91/28.06 size1(sK9) = size1(node1(node_proj_11(sK9),node_proj_21(sK9))) | (~spl22_124 | ~spl22_264)), 27.91/28.06 inference(resolution,[],[f10249,f9147])). 27.91/28.06 tff(f10264,plain,( 27.91/28.06 ( ! [X0:uni] : (size1(sK9) = size1(tb2t2(X0)) | ~mem(tree,X0,t2tb1(sK7))) ) | (~spl22_124 | ~spl22_264)), 27.91/28.06 inference(superposition,[],[f10249,f277])). 27.91/28.06 tff(f10269,plain,( 27.91/28.06 spl22_270 <=> size1(sK9) = size1(node1(node_proj_11(sK9),node_proj_21(sK9)))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_270])])). 27.91/28.06 tff(f10271,plain,( 27.91/28.06 spl22_270 | ~spl22_124 | ~spl22_264), 27.91/28.06 inference(avatar_split_clause,[],[f10259,f9146,f3797,f10269])). 27.91/28.06 tff(f10308,plain,( 27.91/28.06 ( ! [X2:uni] : (size1(sK9) = $sum($sum(1,sK6),size1(node_proj_21(sK9))) | ~mem(tree,X2,t2tb1(sK7)) | ~mem(tree,X2,t2tb1(sK7))) ) | (~spl22_124 | ~spl22_264)), 27.91/28.06 inference(superposition,[],[f9331,f10264])). 27.91/28.06 tff(f10326,plain,( 27.91/28.06 ( ! [X2:uni] : (size1(sK9) = $sum($sum(1,sK6),size1(node_proj_21(sK9))) | ~mem(tree,X2,t2tb1(sK7))) ) | (~spl22_124 | ~spl22_264)), 27.91/28.06 inference(duplicate_literal_removal,[],[f10308])). 27.91/28.06 tff(f10426,plain,( 27.91/28.06 spl22_272 <=> size1(sK9) = $sum($sum(1,sK6),size1(node_proj_21(sK9)))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_272])])). 27.91/28.06 tff(f10427,plain,( 27.91/28.06 size1(sK9) = $sum($sum(1,sK6),size1(node_proj_21(sK9))) | ~spl22_272), 27.91/28.06 inference(avatar_component_clause,[],[f10426])). 27.91/28.06 tff(f10428,plain,( 27.91/28.06 spl22_58 | spl22_272 | ~spl22_124 | ~spl22_264), 27.91/28.06 inference(avatar_split_clause,[],[f10326,f9146,f3797,f10426,f1225])). 27.91/28.06 tff(f10455,plain,( 27.91/28.06 ( ! [X12:$int,X11:$int] : (sK6 != X12 | ~$less(X11,$sum(X12,1)) | sK6 != X11) ) | (~spl22_130 | ~spl22_134)), 27.91/28.06 inference(forward_demodulation,[],[f3865,f3875])). 27.91/28.06 tff(f10497,plain,( 27.91/28.06 ( ! [X3:tree1] : (sK9 != X3 | empty1 = X3) ) | ~spl22_150), 27.91/28.06 inference(superposition,[],[f4125,f285])). 27.91/28.06 tff(f10498,plain,( 27.91/28.06 node_proj_21(sK9) != sK9 | (~spl22_150 | ~spl22_208)), 27.91/28.06 inference(superposition,[],[f4125,f7396])). 27.91/28.06 tff(f10528,plain,( 27.91/28.06 spl22_275 <=> node_proj_21(sK9) != sK9), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_275])])). 27.91/28.06 tff(f10530,plain,( 27.91/28.06 ~spl22_275 | ~spl22_150 | ~spl22_208), 27.91/28.06 inference(avatar_split_clause,[],[f10498,f7395,f4124,f10528])). 27.91/28.06 tff(f10531,plain,( 27.91/28.06 ( ! [X0:$int] : (sK6 != X0 | ~$less(X0,$sum(sK6,1))) ) | (~spl22_130 | ~spl22_134)), 27.91/28.06 inference(equality_resolution,[],[f10455])). 27.91/28.06 tff(f10532,plain,( 27.91/28.06 empty1 = sK9 | ~spl22_150), 27.91/28.06 inference(equality_resolution,[],[f10497])). 27.91/28.06 tff(f10616,plain,( 27.91/28.06 spl22_140 | ~spl22_150), 27.91/28.06 inference(avatar_split_clause,[],[f10532,f4124,f4005])). 27.91/28.06 tff(f10707,plain,( 27.91/28.06 ( ! [X12:$int,X10:uni,X11:$int] : (node_proj_21(tb2t2(X10)) != sK9 | ~$less(X11,$sum(X12,1)) | sK6 != X12 | size1(node_proj_11(node_proj_21(tb2t2(X10)))) != X11 | ~mem(tree,X10,t2tb1(sK7))) ) | (~spl22_50 | ~spl22_196)), 27.91/28.06 inference(superposition,[],[f758,f7647])). 27.91/28.06 tff(f10708,plain,( 27.91/28.06 ( ! [X14:$int,X15:$int,X13:tree1] : (node_proj_21(X13) != sK9 | ~$less(X14,$sum(X15,1)) | sK6 != X15 | size1(node_proj_11(node_proj_21(X13))) != X14 | ~mem(tree,t2tb2(X13),t2tb1(sK7))) ) | (~spl22_50 | ~spl22_196)), 27.91/28.06 inference(superposition,[],[f758,f8183])). 27.91/28.06 tff(f10710,plain,( 27.91/28.06 ( ! [X21:$int,X19:tree1,X20:$int] : (sK9 != sK11(X19) | ~$less(X20,$sum(X21,1)) | sK6 != X21 | size1(node_proj_11(sK11(X19))) != X20 | ~mem(tree,t2tb2(X19),t2tb1(sK7))) ) | (~spl22_50 | ~spl22_196)), 27.91/28.06 inference(superposition,[],[f758,f7347])). 27.91/28.06 tff(f10732,plain,( 27.91/28.06 ( ! [X12:$int,X10:uni,X11:$int] : (node_proj_21(tb2t2(X10)) != sK9 | ~$less(X11,$sum(X12,1)) | sK6 != X12 | size1(node_proj_11(sK9)) != X11 | ~mem(tree,X10,t2tb1(sK7))) ) | (~spl22_50 | ~spl22_196)), 27.91/28.06 inference(inner_rewriting,[],[f10707])). 27.91/28.06 tff(f10734,plain,( 27.91/28.06 ( ! [X14:$int,X15:$int,X13:tree1] : (node_proj_21(X13) != sK9 | ~$less(X14,$sum(X15,1)) | sK6 != X15 | size1(node_proj_11(sK9)) != X14 | ~mem(tree,t2tb2(X13),t2tb1(sK7))) ) | (~spl22_50 | ~spl22_196)), 27.91/28.06 inference(inner_rewriting,[],[f10708])). 27.91/28.06 tff(f10738,plain,( 27.91/28.06 ( ! [X21:$int,X19:tree1,X20:$int] : (sK9 != sK11(X19) | ~$less(X20,$sum(X21,1)) | sK6 != X21 | size1(node_proj_11(sK9)) != X20 | ~mem(tree,t2tb2(X19),t2tb1(sK7))) ) | (~spl22_50 | ~spl22_196)), 27.91/28.06 inference(inner_rewriting,[],[f10710])). 27.91/28.06 tff(f10776,plain,( 27.91/28.06 ~all_trees1(size1(node_proj_21(sK9)),sK7) | ~spl22_215), 27.91/28.06 inference(resolution,[],[f7454,f370])). 27.91/28.06 tff(f10784,plain,( 27.91/28.06 ~$less(sK6,$sum(sK6,1)) | (~spl22_130 | ~spl22_134)), 27.91/28.06 inference(equality_resolution,[],[f10531])). 27.91/28.06 tff(f10789,plain,( 27.91/28.06 spl22_277 <=> ~$less(sK6,$sum(sK6,1))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_277])])). 27.91/28.06 tff(f10791,plain,( 27.91/28.06 ~spl22_277 | ~spl22_130 | ~spl22_134), 27.91/28.06 inference(avatar_split_clause,[],[f10784,f3874,f3864,f10789])). 27.91/28.06 tff(f10792,plain,( 27.91/28.06 ~all_trees1(size1(sK12(node_proj_21(sK9))),sK7) | ~spl22_253), 27.91/28.06 inference(resolution,[],[f7732,f370])). 27.91/28.06 tff(f10794,plain,( 27.91/28.06 ( ! [X0:$int] : (sK6 != X0 | ~$less(X0,$sum(sK6,1))) ) | ~spl22_152), 27.91/28.06 inference(equality_resolution,[],[f4128])). 27.91/28.06 tff(f10795,plain,( 27.91/28.06 ~$less(sK6,$sum(sK6,1)) | ~spl22_152), 27.91/28.06 inference(equality_resolution,[],[f10794])). 27.91/28.06 tff(f10796,plain,( 27.91/28.06 ~spl22_277 | ~spl22_152), 27.91/28.06 inference(avatar_split_clause,[],[f10795,f4127,f10789])). 27.91/28.06 tff(f10804,plain,( 27.91/28.06 ~all_trees1(size1(node_proj_11(node_proj_21(sK9))),sK7) | (~spl22_216 | ~spl22_253)), 27.91/28.06 inference(forward_demodulation,[],[f10792,f7490])). 27.91/28.06 tff(f10814,plain,( 27.91/28.06 ~all_trees1(size1(node_proj_11(node_proj_21(sK9))),sK7) | (~spl22_216 | ~spl22_253)), 27.91/28.06 inference(forward_demodulation,[],[f7737,f7490])). 27.91/28.06 tff(f10856,plain,( 27.91/28.06 spl22_278 <=> ! [X10 : uni] : (node_proj_21(tb2t2(X10)) != sK9 | ~mem(tree,X10,t2tb1(sK7)))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_278])])). 27.91/28.06 tff(f10858,plain,( 27.91/28.06 spl22_130 | spl22_278 | ~spl22_50 | ~spl22_196), 27.91/28.06 inference(avatar_split_clause,[],[f10732,f7098,f757,f10856,f3864])). 27.91/28.06 tff(f10867,plain,( 27.91/28.06 spl22_281 <=> ~all_trees1(size1(node_proj_21(sK9)),sK7)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_281])])). 27.91/28.06 tff(f10869,plain,( 27.91/28.06 ~spl22_281 | spl22_215), 27.91/28.06 inference(avatar_split_clause,[],[f7456,f7453,f10867])). 27.91/28.06 tff(f10870,plain,( 27.91/28.06 ~spl22_281 | spl22_215), 27.91/28.06 inference(avatar_split_clause,[],[f10776,f7453,f10867])). 27.91/28.06 tff(f10877,plain,( 27.91/28.06 spl22_282 <=> $less(size1(node_proj_11(sK9)),sK6)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_282])])). 27.91/28.06 tff(f10879,plain,( 27.91/28.06 spl22_282 | ~spl22_126 | ~spl22_136), 27.91/28.06 inference(avatar_split_clause,[],[f4067,f3925,f3845,f10877])). 27.91/28.06 tff(f10881,plain,( 27.91/28.06 spl22_284 <=> ! [X13 : tree1] : (node_proj_21(X13) != sK9 | ~mem(tree,t2tb2(X13),t2tb1(sK7)))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_284])])). 27.91/28.06 tff(f10883,plain,( 27.91/28.06 spl22_130 | spl22_284 | ~spl22_50 | ~spl22_196), 27.91/28.06 inference(avatar_split_clause,[],[f10734,f7098,f757,f10881,f3864])). 27.91/28.06 tff(f10886,plain,( 27.91/28.06 spl22_142 | ~spl22_136), 27.91/28.06 inference(avatar_split_clause,[],[f3955,f3925,f4016])). 27.91/28.06 tff(f10888,plain,( 27.91/28.06 spl22_146 | ~spl22_136), 27.91/28.06 inference(avatar_split_clause,[],[f3956,f3925,f4072])). 27.91/28.06 tff(f10894,plain,( 27.91/28.06 spl22_286 <=> ! [X19 : tree1] : (sK9 != sK11(X19) | ~mem(tree,t2tb2(X19),t2tb1(sK7)))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_286])])). 27.91/28.06 tff(f10896,plain,( 27.91/28.06 spl22_130 | spl22_286 | ~spl22_50 | ~spl22_196), 27.91/28.06 inference(avatar_split_clause,[],[f10738,f7098,f757,f10894,f3864])). 27.91/28.06 tff(f10901,plain,( 27.91/28.06 spl22_289 <=> ~all_trees1(size1(node_proj_11(node_proj_21(sK9))),sK7)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_289])])). 27.91/28.06 tff(f10903,plain,( 27.91/28.06 ~spl22_289 | ~spl22_216 | spl22_253), 27.91/28.06 inference(avatar_split_clause,[],[f10804,f7731,f7489,f10901])). 27.91/28.06 tff(f10904,plain,( 27.91/28.06 ~spl22_289 | ~spl22_216 | spl22_253), 27.91/28.06 inference(avatar_split_clause,[],[f10814,f7731,f7489,f10901])). 27.91/28.06 tff(f10910,plain,( 27.91/28.06 node1(sK12(sK9),node_proj_21(sK9)) = sK9 | (~spl22_122 | ~spl22_142)), 27.91/28.06 inference(forward_demodulation,[],[f3801,f4017])). 27.91/28.06 tff(f10911,plain,( 27.91/28.06 node1(node_proj_11(sK9),node_proj_21(sK9)) = sK9 | (~spl22_122 | ~spl22_142 | ~spl22_146)), 27.91/28.06 inference(forward_demodulation,[],[f10910,f4073])). 27.91/28.06 tff(f10912,plain,( 27.91/28.06 node1(sK12(sK9),node_proj_21(sK9)) = sK9 | (~spl22_122 | ~spl22_142)), 27.91/28.06 inference(forward_demodulation,[],[f3807,f4017])). 27.91/28.06 tff(f10913,plain,( 27.91/28.06 node1(node_proj_11(sK9),node_proj_21(sK9)) = sK9 | (~spl22_122 | ~spl22_142 | ~spl22_146)), 27.91/28.06 inference(forward_demodulation,[],[f10912,f4073])). 27.91/28.06 tff(f10914,plain,( 27.91/28.06 node1(node_proj_11(sK9),node_proj_21(sK9)) = sK9 | (~spl22_136 | ~spl22_146)), 27.91/28.06 inference(forward_demodulation,[],[f4011,f4073])). 27.91/28.06 tff(f10919,plain,( 27.91/28.06 spl22_290 <=> node1(node_proj_11(sK9),node_proj_21(sK9)) = sK9), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_290])])). 27.91/28.06 tff(f10920,plain,( 27.91/28.06 node1(node_proj_11(sK9),node_proj_21(sK9)) = sK9 | ~spl22_290), 27.91/28.06 inference(avatar_component_clause,[],[f10919])). 27.91/28.06 tff(f10921,plain,( 27.91/28.06 spl22_290 | ~spl22_122 | ~spl22_142 | ~spl22_146), 27.91/28.06 inference(avatar_split_clause,[],[f10911,f4072,f4016,f3791,f10919])). 27.91/28.06 tff(f10922,plain,( 27.91/28.06 spl22_290 | ~spl22_122 | ~spl22_142 | ~spl22_146), 27.91/28.06 inference(avatar_split_clause,[],[f10913,f4072,f4016,f3791,f10919])). 27.91/28.06 tff(f10923,plain,( 27.91/28.06 spl22_290 | ~spl22_136 | ~spl22_146), 27.91/28.06 inference(avatar_split_clause,[],[f10914,f4072,f3925,f10919])). 27.91/28.06 tff(f10931,plain,( 27.91/28.06 ( ! [X0:tree1,X1:tree1] : (node1(X0,X1) != sK9 | size1(X0) = size1(node_proj_11(sK9))) ) | ~spl22_290), 27.91/28.06 inference(superposition,[],[f315,f10920])). 27.91/28.06 tff(f11130,plain,( 27.91/28.06 $sum($sum(1,sK6),size1(node_proj_21(sK9))) = sK3 | (~spl22_48 | ~spl22_272)), 27.91/28.06 inference(forward_demodulation,[],[f10427,f752])). 27.91/28.06 tff(f11135,plain,( 27.91/28.06 spl22_292 <=> $sum($sum(1,sK6),size1(node_proj_21(sK9))) = sK3), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_292])])). 27.91/28.06 tff(f11137,plain,( 27.91/28.06 spl22_292 | ~spl22_48 | ~spl22_272), 27.91/28.06 inference(avatar_split_clause,[],[f11130,f10426,f751,f11135])). 27.91/28.06 tff(f11168,plain,( 27.91/28.06 ( ! [X22:uni] : (tb2t2(sK19(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X22)) != sK9 | size1(node_proj_11(sK9)) = size1(sK14(tb2t2(sK19(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X22)))) | ~distinct(tree,X22) | distinct(tree,infix_plpl(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X22))) ) | (~spl22_178 | ~spl22_290)), 27.91/28.06 inference(superposition,[],[f10931,f5423])). 27.91/28.06 tff(f11178,plain,( 27.91/28.06 ( ! [X22:uni] : (tb2t2(sK19(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X22)) != sK9 | size1(node_proj_11(sK9)) = size1(sK14(sK9)) | ~distinct(tree,X22) | distinct(tree,infix_plpl(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X22))) ) | (~spl22_178 | ~spl22_290)), 27.91/28.06 inference(inner_rewriting,[],[f11168])). 27.91/28.06 tff(f11314,plain,( 27.91/28.06 spl22_294 <=> size1(node_proj_11(sK9)) = size1(sK14(sK9))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_294])])). 27.91/28.06 tff(f11315,plain,( 27.91/28.06 size1(node_proj_11(sK9)) = size1(sK14(sK9)) | ~spl22_294), 27.91/28.06 inference(avatar_component_clause,[],[f11314])). 27.91/28.06 tff(f11317,plain,( 27.91/28.06 spl22_296 <=> ! [X22 : uni] : (tb2t2(sK19(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X22)) != sK9 | distinct(tree,infix_plpl(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)),X22)) | ~distinct(tree,X22))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_296])])). 27.91/28.06 tff(f11319,plain,( 27.91/28.06 spl22_294 | spl22_296 | ~spl22_178 | ~spl22_290), 27.91/28.06 inference(avatar_split_clause,[],[f11178,f10919,f5422,f11317,f11314])). 27.91/28.06 tff(f11328,plain,( 27.91/28.06 ( ! [X14:tree1] : (size1(node_proj_11(sK9)) != sK6 | ~all_trees1(size1(node1(X14,sK14(sK9))),sK7)) ) | (~spl22_106 | ~spl22_294)), 27.91/28.06 inference(superposition,[],[f2762,f11315])). 27.91/28.06 tff(f11335,plain,( 27.91/28.06 spl22_298 <=> ! [X14 : tree1] : ~all_trees1(size1(node1(X14,sK14(sK9))),sK7)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_298])])). 27.91/28.06 tff(f11337,plain,( 27.91/28.06 spl22_298 | ~spl22_135 | ~spl22_106 | ~spl22_294), 27.91/28.06 inference(avatar_split_clause,[],[f11328,f11314,f2761,f3871,f11335])). 27.91/28.06 tff(f11345,plain,( 27.91/28.06 spl22_300 <=> node1(sK14(sK9),sK15(sK9)) = sK9), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_300])])). 27.91/28.06 tff(f11346,plain,( 27.91/28.06 node1(sK14(sK9),sK15(sK9)) = sK9 | ~spl22_300), 27.91/28.06 inference(avatar_component_clause,[],[f11345])). 27.91/28.06 tff(f11347,plain,( 27.91/28.06 spl22_300 | spl22_180 | ~spl22_48), 27.91/28.06 inference(avatar_split_clause,[],[f3812,f751,f5425,f11345])). 27.91/28.06 tff(f11349,plain,( 27.91/28.06 node_proj_21(sK9) = sK15(sK9) | ~spl22_300), 27.91/28.06 inference(superposition,[],[f291,f11346])). 27.91/28.06 tff(f11350,plain,( 27.91/28.06 node_proj_11(sK9) = sK14(sK9) | ~spl22_300), 27.91/28.06 inference(superposition,[],[f292,f11346])). 27.91/28.06 tff(f11363,plain,( 27.91/28.06 ( ! [X17:$int,X16:$int] : (sK9 != sK9 | ~$less(X16,$sum(X17,1)) | sK6 != X17 | size1(sK14(sK9)) != X16) ) | (~spl22_50 | ~spl22_300)), 27.91/28.06 inference(superposition,[],[f758,f11346])). 27.91/28.06 tff(f11391,plain,( 27.91/28.06 ( ! [X17:$int,X16:$int] : (~$less(X16,$sum(X17,1)) | sK6 != X17 | size1(sK14(sK9)) != X16) ) | (~spl22_50 | ~spl22_300)), 27.91/28.06 inference(trivial_inequality_removal,[],[f11363])). 27.91/28.06 tff(f11403,plain,( 27.91/28.06 ( ! [X17:$int,X16:$int] : (size1(node_proj_11(sK9)) != X16 | ~$less(X16,$sum(X17,1)) | sK6 != X17) ) | (~spl22_50 | ~spl22_294 | ~spl22_300)), 27.91/28.06 inference(forward_demodulation,[],[f11391,f11315])). 27.91/28.06 tff(f11423,plain,( 27.91/28.06 spl22_302 <=> node_proj_21(sK9) = sK15(sK9)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_302])])). 27.91/28.06 tff(f11425,plain,( 27.91/28.06 spl22_302 | ~spl22_300), 27.91/28.06 inference(avatar_split_clause,[],[f11349,f11345,f11423])). 27.91/28.06 tff(f11431,plain,( 27.91/28.06 spl22_304 <=> node_proj_11(sK9) = sK14(sK9)), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_304])])). 27.91/28.06 tff(f11433,plain,( 27.91/28.06 spl22_304 | ~spl22_300), 27.91/28.06 inference(avatar_split_clause,[],[f11350,f11345,f11431])). 27.91/28.06 tff(f11445,plain,( 27.91/28.06 ( ! [X0:$int] : (sK6 != X0 | ~$less(size1(node_proj_11(sK9)),$sum(X0,1))) ) | (~spl22_50 | ~spl22_294 | ~spl22_300)), 27.91/28.06 inference(equality_resolution,[],[f11403])). 27.91/28.06 tff(f11447,plain,( 27.91/28.06 ~$less(size1(node_proj_11(sK9)),$sum(sK6,1)) | (~spl22_50 | ~spl22_294 | ~spl22_300)), 27.91/28.06 inference(equality_resolution,[],[f11445])). 27.91/28.06 tff(f11452,plain,( 27.91/28.06 spl22_307 <=> ~$less(size1(node_proj_11(sK9)),$sum(sK6,1))), 27.91/28.06 introduced(avatar_definition,[new_symbols(naming,[spl22_307])])). 27.91/28.06 tff(f11454,plain,( 27.91/28.06 ~spl22_307 | ~spl22_50 | ~spl22_294 | ~spl22_300), 27.91/28.06 inference(avatar_split_clause,[],[f11447,f11345,f11314,f757,f11452])). 27.91/28.06 tff(f11455,plain,( 27.91/28.06 $false), 27.91/28.06 inference(avatar_sat_refutation,[],[f443,f451,f459,f467,f476,f483,f491,f499,f508,f515,f522,f535,f544,f553,f563,f570,f585,f594,f617,f642,f728,f736,f749,f759,f761,f772,f985,f1096,f1230,f1336,f1549,f1557,f1694,f1696,f1892,f1894,f1904,f1993,f1995,f2322,f2487,f2494,f2579,f2580,f2690,f2692,f2736,f2763,f2809,f2961,f3097,f3106,f3259,f3617,f3799,f3810,f3847,f3862,f3869,f3876,f3896,f3897,f3927,f3929,f3936,f3952,f3953,f4010,f4018,f4020,f4028,f4066,f4074,f4079,f4086,f4108,f4129,f4162,f4198,f4401,f4442,f4495,f4541,f4551,f5122,f5313,f5323,f5330,f5346,f5427,f5435,f5541,f5654,f6152,f6218,f6244,f6477,f6661,f6779,f7103,f7114,f7179,f7207,f7214,f7397,f7446,f7455,f7494,f7498,f7520,f7567,f7575,f7582,f7591,f7594,f7604,f7663,f7671,f7692,f7736,f8840,f8918,f8950,f9006,f9148,f9192,f9548,f10271,f10428,f10530,f10616,f10791,f10796,f10858,f10869,f10870,f10879,f10883,f10886,f10888,f10896,f10903,f10904,f10921,f10922,f10923,f11137,f11319,f11337,f11347,f11425,f11433,f11454])). 27.91/28.06 % SZS output end Proof for theBenchmark 27.91/28.06 % ------------------------------ 27.91/28.06 % Version: Vampire 4.2.2 (commit 552c234 on 2018-07-02 14:53:33 +0100) 27.91/28.06 % Termination reason: Refutation 27.91/28.06 27.91/28.06 % Memory used [KB]: 14711 27.91/28.06 % Time elapsed: 0.411 s 27.91/28.06 % ------------------------------ 27.91/28.06 % ------------------------------ 27.91/28.06 % Success in time 27.704 s 27.91/28.06 EOF