0.06/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.12 % Command : vampire --mode casc -t %d %s 0.10/0.32 % Computer : n018.cluster.edu 0.10/0.32 % Model : x86_64 x86_64 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.32 % Memory : 8042.1875MB 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.32 % CPULimit : 960 0.10/0.32 % DateTime : Thu Jul 2 08:05:53 EDT 2020 0.10/0.32 % CPUTime : 0.17/0.40 % ott+10_3:2_aac=none:add=large:afp=10000:afq=2.0:amm=off:fsr=off:fde=none:gs=on:gsaa=from_current:gsem=off:lcm=reverse:lma=on:nm=0:nwc=4:sas=z3:updr=off_22 on theBenchmark 3.24/3.39 % Time limit reached! 3.24/3.39 % ------------------------------ 3.24/3.39 % Version: Vampire 4.4.0 (commit 7916d27 on 2019-08-23 08:50:16 +0100) 3.24/3.39 % Termination reason: Time limit 3.24/3.39 % Termination phase: Saturation 3.24/3.39 3.24/3.39 % Memory used [KB]: 34796 3.24/3.39 % Time elapsed: 3.0000 s 3.24/3.39 % ------------------------------ 3.24/3.39 % ------------------------------ 3.24/3.46 % ott+1_3:1_av=off:bd=off:fsr=off:fde=none:gs=on:inw=on:nm=2:nwc=1.5:sp=frequency:uwa=one_side_interpreted_22 on theBenchmark 6.24/6.46 % Time limit reached! 6.24/6.46 % ------------------------------ 6.24/6.46 % Version: Vampire 4.4.0 (commit 7916d27 on 2019-08-23 08:50:16 +0100) 6.24/6.46 % Termination reason: Time limit 6.24/6.46 % Termination phase: Saturation 6.24/6.46 6.24/6.46 % Memory used [KB]: 63325 6.24/6.46 % Time elapsed: 3.0000 s 6.24/6.46 % ------------------------------ 6.24/6.46 % ------------------------------ 6.39/6.54 % dis+1011_5_aac=none:add=large:afp=40000:afq=1.2:amm=off:anc=none:bd=off:fsr=off:gsp=input_only:inw=on:irw=on:lma=on:nm=64:nwc=1:sas=z3:sos=on:sp=occurrence:tha=off:updr=off_26 on theBenchmark 9.92/10.04 % Time limit reached! 9.92/10.04 % ------------------------------ 9.92/10.04 % Version: Vampire 4.4.0 (commit 7916d27 on 2019-08-23 08:50:16 +0100) 9.92/10.04 % Termination reason: Time limit 9.92/10.04 % Termination phase: Saturation 9.92/10.04 9.92/10.04 % Memory used [KB]: 7675 9.92/10.04 % Time elapsed: 3.500 s 9.92/10.04 % ------------------------------ 9.92/10.04 % ------------------------------ 9.92/10.10 % lrs+1_3_awrs=decay:awrsf=4:afp=10000:afq=1.0:amm=off:anc=none:bd=off:cond=on:fsr=off:fde=unused:gs=on:lwlo=on:nm=16:nwc=1:sas=z3:stl=30:ss=axioms:s2a=on:st=1.2:sos=theory:sp=frequency_29 on theBenchmark 13.90/14.00 % Time limit reached! 13.90/14.00 % ------------------------------ 13.90/14.00 % Version: Vampire 4.4.0 (commit 7916d27 on 2019-08-23 08:50:16 +0100) 13.90/14.00 % Termination reason: Time limit 13.90/14.00 % Termination phase: Saturation 13.90/14.00 13.90/14.00 % Memory used [KB]: 62301 13.90/14.00 % Time elapsed: 3.900 s 13.90/14.00 % ------------------------------ 13.90/14.00 % ------------------------------ 13.94/14.07 % 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_58 on theBenchmark 21.73/21.77 % Time limit reached! 21.73/21.77 % ------------------------------ 21.73/21.77 % Version: Vampire 4.4.0 (commit 7916d27 on 2019-08-23 08:50:16 +0100) 21.73/21.77 % Termination reason: Time limit 21.73/21.77 % Termination phase: Saturation 21.73/21.77 21.73/21.77 % Memory used [KB]: 24050 21.73/21.77 % Time elapsed: 7.700 s 21.73/21.77 % ------------------------------ 21.73/21.77 % ------------------------------ 21.75/21.84 % dis-3_4_add=off:afp=40000:afq=1.1:amm=off:anc=none:bs=unit_only:cond=fast:fsr=off:gs=on:inw=on:lma=on:nm=64:nwc=1.5:nicw=on:sas=z3:sp=reverse_arity:tha=off:thf=on:uhcvi=on_13 on theBenchmark 23.56/23.64 % Time limit reached! 23.56/23.64 % ------------------------------ 23.56/23.64 % Version: Vampire 4.4.0 (commit 7916d27 on 2019-08-23 08:50:16 +0100) 23.56/23.64 % Termination reason: Time limit 23.56/23.64 % Termination phase: Saturation 23.56/23.64 23.56/23.64 % Memory used [KB]: 19189 23.56/23.64 % Time elapsed: 1.800 s 23.56/23.64 % ------------------------------ 23.56/23.64 % ------------------------------ 23.65/23.70 % 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_3 on theBenchmark 24.27/24.30 % Time limit reached! 24.27/24.30 % ------------------------------ 24.27/24.30 % Version: Vampire 4.4.0 (commit 7916d27 on 2019-08-23 08:50:16 +0100) 24.27/24.30 % Termination reason: Time limit 24.27/24.30 % Termination phase: Saturation 24.27/24.30 24.27/24.30 % Memory used [KB]: 12665 24.27/24.30 % Time elapsed: 0.600 s 24.27/24.30 % ------------------------------ 24.27/24.30 % ------------------------------ 24.30/24.36 % dis+1002_8:1_awrs=converge:awrsf=256:anc=all_dependent:br=off:fsr=off:fde=none:gs=on:gsaa=from_current:gsem=on:irw=on:nm=64:nwc=1:sas=z3:s2a=on:sp=frequency:thf=on:uwa=interpreted_only:urr=on_7 on theBenchmark 25.36/25.44 % Time limit reached! 25.36/25.44 % ------------------------------ 25.36/25.44 % Version: Vampire 4.4.0 (commit 7916d27 on 2019-08-23 08:50:16 +0100) 25.36/25.44 % Termination reason: Time limit 25.36/25.44 % Termination phase: Saturation 25.36/25.44 25.36/25.44 % Memory used [KB]: 16502 25.36/25.44 % Time elapsed: 1.100 s 25.36/25.44 % ------------------------------ 25.36/25.44 % ------------------------------ 25.46/25.50 % dis+1_3_add=large:afp=4000:afq=1.0:anc=none:gs=on:gsem=off:inw=on:lcm=reverse:lwlo=on:nm=64:nwc=1:sas=z3:sos=all:sac=on:thi=all:uwa=all:updr=off:uhcvi=on_12 on theBenchmark 27.13/27.18 % Time limit reached! 27.13/27.18 % ------------------------------ 27.13/27.18 % Version: Vampire 4.4.0 (commit 7916d27 on 2019-08-23 08:50:16 +0100) 27.13/27.18 % Termination reason: Time limit 27.13/27.18 % Termination phase: Saturation 27.13/27.18 27.13/27.18 % Memory used [KB]: 6652 27.13/27.18 % Time elapsed: 1.700 s 27.13/27.18 % ------------------------------ 27.13/27.18 % ------------------------------ 27.21/27.24 % lrs+3_128_awrs=converge:awrsf=2:av=off:bs=on:cond=fast:fsr=off:fde=unused:gsp=input_only:irw=on:lma=on:nm=64:nwc=1.5:stl=30:sp=frequency:tha=some:updr=off_148 on theBenchmark 46.76/46.63 % Time limit reached! 46.76/46.63 % ------------------------------ 46.76/46.63 % Version: Vampire 4.4.0 (commit 7916d27 on 2019-08-23 08:50:16 +0100) 46.76/46.63 % Termination reason: Time limit 46.76/46.63 % Termination phase: Saturation 46.76/46.63 46.76/46.63 % Memory used [KB]: 254324 46.76/46.63 % Time elapsed: 19.400 s 46.76/46.63 % ------------------------------ 46.76/46.63 % ------------------------------ 46.77/46.71 % 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 47.34/47.21 % Time limit reached! 47.34/47.21 % ------------------------------ 47.34/47.21 % Version: Vampire 4.4.0 (commit 7916d27 on 2019-08-23 08:50:16 +0100) 47.34/47.21 % Termination reason: Time limit 47.34/47.21 % Termination phase: Saturation 47.34/47.21 47.34/47.21 % Memory used [KB]: 6268 47.34/47.21 % Time elapsed: 0.500 s 47.34/47.21 % ------------------------------ 47.34/47.21 % ------------------------------ 47.36/47.28 % 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 49.00/48.87 % Time limit reached! 49.00/48.87 % ------------------------------ 49.00/48.87 % Version: Vampire 4.4.0 (commit 7916d27 on 2019-08-23 08:50:16 +0100) 49.00/48.87 % Termination reason: Time limit 49.00/48.87 % Termination phase: Saturation 49.00/48.87 49.00/48.87 % Memory used [KB]: 23794 49.00/48.87 % Time elapsed: 1.600 s 49.00/48.87 % ------------------------------ 49.00/48.87 % ------------------------------ 49.03/48.94 % 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_5 on theBenchmark 49.97/49.84 % Time limit reached! 49.97/49.84 % ------------------------------ 49.97/49.84 % Version: Vampire 4.4.0 (commit 7916d27 on 2019-08-23 08:50:16 +0100) 49.97/49.84 % Termination reason: Time limit 49.97/49.84 % Termination phase: Saturation 49.97/49.84 49.97/49.84 % Memory used [KB]: 14328 49.97/49.84 % Time elapsed: 0.900 s 49.97/49.84 % ------------------------------ 49.97/49.84 % ------------------------------ 50.00/49.89 % 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 51.01/50.89 % Time limit reached! 51.01/50.89 % ------------------------------ 51.01/50.89 % Version: Vampire 4.4.0 (commit 7916d27 on 2019-08-23 08:50:16 +0100) 51.01/50.89 % Termination reason: Time limit 51.01/50.89 % Termination phase: Saturation 51.01/50.89 51.01/50.89 % Memory used [KB]: 7419 51.01/50.89 % Time elapsed: 1.0000 s 51.01/50.89 % ------------------------------ 51.01/50.89 % ------------------------------ 51.01/50.95 % 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 52.41/52.25 % Time limit reached! 52.41/52.25 % ------------------------------ 52.41/52.25 % Version: Vampire 4.4.0 (commit 7916d27 on 2019-08-23 08:50:16 +0100) 52.41/52.25 % Termination reason: Time limit 52.41/52.25 % Termination phase: Saturation 52.41/52.25 52.41/52.25 % Memory used [KB]: 21620 52.41/52.25 % Time elapsed: 1.300 s 52.41/52.25 % ------------------------------ 52.41/52.25 % ------------------------------ 52.42/52.31 % 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 53.44/53.31 % Time limit reached! 53.44/53.31 % ------------------------------ 53.44/53.31 % Version: Vampire 4.4.0 (commit 7916d27 on 2019-08-23 08:50:16 +0100) 53.44/53.31 % Termination reason: Time limit 53.44/53.31 % Termination phase: Saturation 53.44/53.31 53.44/53.31 % Memory used [KB]: 8699 53.44/53.31 % Time elapsed: 1.0000 s 53.44/53.31 % ------------------------------ 53.44/53.31 % ------------------------------ 53.49/53.38 % 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 54.11/53.98 % Time limit reached! 54.11/53.98 % ------------------------------ 54.11/53.98 % Version: Vampire 4.4.0 (commit 7916d27 on 2019-08-23 08:50:16 +0100) 54.11/53.98 % Termination reason: Time limit 54.11/53.98 % Termination phase: Saturation 54.11/53.98 54.11/53.98 % Memory used [KB]: 10362 54.11/53.98 % Time elapsed: 0.600 s 54.11/53.98 % ------------------------------ 54.11/53.98 % ------------------------------ 54.17/54.04 % 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 54.91/54.75 % Refutation found. Thanks to Tanya! 54.91/54.75 % SZS status Theorem for theBenchmark 54.91/54.75 % SZS output start Proof for theBenchmark 54.91/54.75 tff(type_def_5, type, uni: $tType). 54.91/54.75 tff(type_def_6, type, ty: $tType). 54.91/54.75 tff(type_def_7, type, bool1: $tType). 54.91/54.75 tff(type_def_8, type, tuple02: $tType). 54.91/54.75 tff(type_def_9, type, tree1: $tType). 54.91/54.75 tff(type_def_10, type, list_tree: $tType). 54.91/54.75 tff(type_def_11, type, map_int_lplist_treerp: $tType). 54.91/54.75 tff(func_def_0, type, witness1: ty > uni). 54.91/54.75 tff(func_def_1, type, int: ty). 54.91/54.75 tff(func_def_2, type, real: ty). 54.91/54.75 tff(func_def_3, type, bool: ty). 54.91/54.75 tff(func_def_4, type, true1: bool1). 54.91/54.75 tff(func_def_5, type, false1: bool1). 54.91/54.75 tff(func_def_6, type, match_bool1: (ty * bool1 * uni * uni) > uni). 54.91/54.75 tff(func_def_7, type, tuple0: ty). 54.91/54.75 tff(func_def_8, type, tuple03: tuple02). 54.91/54.75 tff(func_def_9, type, qtmark: ty). 54.91/54.75 tff(func_def_10, type, list: ty > ty). 54.91/54.75 tff(func_def_11, type, nil: ty > uni). 54.91/54.75 tff(func_def_12, type, cons: (ty * uni * uni) > uni). 54.91/54.75 tff(func_def_13, type, match_list1: (ty * ty * uni * uni * uni) > uni). 54.91/54.75 tff(func_def_14, type, cons_proj_11: (ty * uni) > uni). 54.91/54.75 tff(func_def_15, type, cons_proj_21: (ty * uni) > uni). 54.91/54.75 tff(func_def_16, type, infix_plpl: (ty * uni * uni) > uni). 54.91/54.75 tff(func_def_17, type, length2: (ty * uni) > $int). 54.91/54.75 tff(func_def_18, type, map: (ty * ty) > ty). 54.91/54.75 tff(func_def_19, type, get: (ty * ty * uni * uni) > uni). 54.91/54.75 tff(func_def_20, type, set: (ty * ty * uni * uni * uni) > uni). 54.91/54.75 tff(func_def_21, type, const: (ty * ty * uni) > uni). 54.91/54.75 tff(func_def_22, type, array: ty > ty). 54.91/54.75 tff(func_def_23, type, mk_array1: (ty * $int * uni) > uni). 54.91/54.75 tff(func_def_24, type, length3: (ty * uni) > $int). 54.91/54.75 tff(func_def_25, type, elts: (ty * uni) > uni). 54.91/54.75 tff(func_def_26, type, get2: (ty * uni * $int) > uni). 54.91/54.75 tff(func_def_27, type, t2tb: $int > uni). 54.91/54.75 tff(func_def_28, type, tb2t: uni > $int). 54.91/54.75 tff(func_def_29, type, set2: (ty * uni * $int * uni) > uni). 54.91/54.75 tff(func_def_30, type, make1: (ty * $int * uni) > uni). 54.91/54.75 tff(func_def_31, type, tree: ty). 54.91/54.75 tff(func_def_32, type, empty1: tree1). 54.91/54.75 tff(func_def_33, type, node1: (tree1 * tree1) > tree1). 54.91/54.75 tff(func_def_34, type, match_tree1: (ty * tree1 * uni * uni) > uni). 54.91/54.75 tff(func_def_35, type, node_proj_11: tree1 > tree1). 54.91/54.75 tff(func_def_36, type, node_proj_21: tree1 > tree1). 54.91/54.75 tff(func_def_37, type, size1: tree1 > $int). 54.91/54.75 tff(func_def_38, type, t2tb1: list_tree > uni). 54.91/54.75 tff(func_def_39, type, tb2t1: uni > list_tree). 54.91/54.75 tff(func_def_40, type, t2tb2: tree1 > uni). 54.91/54.75 tff(func_def_41, type, tb2t2: uni > tree1). 54.91/54.75 tff(func_def_42, type, t2tb3: map_int_lplist_treerp > uni). 54.91/54.75 tff(func_def_43, type, tb2t3: uni > map_int_lplist_treerp). 54.91/54.75 tff(func_def_50, type, sK0: $int). 54.91/54.75 tff(func_def_51, type, sK1: map_int_lplist_treerp). 54.91/54.75 tff(func_def_52, type, sK2: map_int_lplist_treerp). 54.91/54.75 tff(func_def_53, type, sK3: $int). 54.91/54.75 tff(func_def_54, type, sK4: map_int_lplist_treerp). 54.91/54.75 tff(func_def_55, type, sK5: map_int_lplist_treerp). 54.91/54.75 tff(func_def_56, type, sK6: $int). 54.91/54.75 tff(func_def_57, type, sK7: list_tree). 54.91/54.75 tff(func_def_58, type, sK8: map_int_lplist_treerp). 54.91/54.75 tff(func_def_59, type, sK9: tree1). 54.91/54.75 tff(func_def_60, type, sK10: tree1 > tree1). 54.91/54.75 tff(func_def_61, type, sK11: tree1 > tree1). 54.91/54.75 tff(func_def_62, type, sK12: tree1 > tree1). 54.91/54.75 tff(func_def_63, type, sK13: tree1 > tree1). 54.91/54.75 tff(func_def_64, type, sK14: tree1 > tree1). 54.91/54.75 tff(func_def_65, type, sK15: tree1 > tree1). 54.91/54.75 tff(func_def_66, type, sK16: (ty * uni) > uni). 54.91/54.75 tff(func_def_67, type, sK17: (ty * uni) > uni). 54.91/54.75 tff(func_def_68, type, sK18: (ty * uni) > uni). 54.91/54.75 tff(func_def_69, type, sK19: (ty * uni * uni) > uni). 54.91/54.75 tff(func_def_70, type, sK20: (ty * uni * uni) > uni). 54.91/54.75 tff(func_def_71, type, sK21: (ty * uni * uni) > uni). 54.91/54.75 tff(pred_def_1, type, sort1: (ty * uni) > $o). 54.91/54.75 tff(pred_def_2, type, mem: (ty * uni * uni) > $o). 54.91/54.75 tff(pred_def_3, type, distinct: (ty * uni) > $o). 54.91/54.75 tff(pred_def_4, type, all_trees1: ($int * list_tree) > $o). 54.91/54.75 tff(f10871,plain,( 54.91/54.75 $false), 54.91/54.75 inference(avatar_sat_refutation,[],[f440,f448,f456,f464,f473,f480,f488,f496,f505,f512,f519,f532,f541,f550,f560,f567,f582,f591,f614,f639,f725,f733,f746,f756,f758,f769,f982,f1093,f1227,f1333,f1546,f1554,f1691,f1693,f1889,f1891,f1901,f1990,f1992,f2319,f2484,f2491,f2576,f2877,f2948,f3152,f3280,f3289,f3890,f3894,f3941,f4109,f5379,f5859,f5985,f5995,f6002,f6055,f6117,f6121,f7113,f7117,f7179,f7190,f7211,f7219,f7231,f7232,f7248,f7356,f7357,f7364,f7367,f7375,f7402,f7469,f7476,f7482,f7489,f7517,f7518,f7574,f7581,f7589,f7597,f7605,f7616,f7754,f7831,f7887,f7894,f7914,f7919,f7920,f7921,f7922,f7923,f7987,f7988,f7989,f8049,f8050,f8096,f8129,f8336,f8625,f8627,f8893,f8974,f9000,f9285,f9382,f9441,f9946,f9958,f10006,f10054,f10061,f10183,f10284,f10389,f10398,f10410,f10434,f10443,f10454,f10519,f10530,f10541,f10870])). 54.91/54.75 tff(f10870,plain,( 54.91/54.75 spl22_58 | spl22_264 | ~spl22_144), 54.91/54.75 inference(avatar_split_clause,[],[f10850,f7171,f10868,f1222])). 54.91/54.75 tff(f1222,plain,( 54.91/54.75 spl22_58 <=> ! [X5 : uni] : ~mem(tree,X5,t2tb1(sK7))), 54.91/54.75 introduced(avatar_definition,[new_symbols(naming,[spl22_58])])). 54.91/54.75 tff(f10868,plain,( 54.91/54.75 spl22_264 <=> size1(sK9) = $sum($sum(sK6,sK3),$uminus(sK6))), 54.91/54.75 introduced(avatar_definition,[new_symbols(naming,[spl22_264])])). 54.91/54.75 tff(f7171,plain,( 54.91/54.75 spl22_144 <=> mem(tree,t2tb2(sK9),t2tb1(sK7))), 54.91/54.75 introduced(avatar_definition,[new_symbols(naming,[spl22_144])])). 54.91/54.75 tff(f10850,plain,( 54.91/54.75 ( ! [X7:uni] : (size1(sK9) = $sum($sum(sK6,sK3),$uminus(sK6)) | ~mem(tree,X7,t2tb1(sK7))) ) | ~spl22_144), 54.91/54.75 inference(duplicate_literal_removal,[],[f10828])). 54.91/54.75 tff(f10828,plain,( 54.91/54.75 ( ! [X7:uni] : (size1(sK9) = $sum($sum(sK6,sK3),$uminus(sK6)) | ~mem(tree,X7,t2tb1(sK7)) | ~mem(tree,X7,t2tb1(sK7))) ) | ~spl22_144), 54.91/54.75 inference(superposition,[],[f6871,f10814])). 54.91/54.75 tff(f10814,plain,( 54.91/54.75 ( ! [X0:uni] : (size1(sK9) = size1(tb2t2(X0)) | ~mem(tree,X0,t2tb1(sK7))) ) | ~spl22_144), 54.91/54.75 inference(superposition,[],[f10808,f274])). 54.91/54.75 tff(f274,plain,( 54.91/54.75 ( ! [X0:uni] : (t2tb2(tb2t2(X0)) = X0) )), 54.91/54.75 inference(cnf_transformation,[],[f74])). 54.91/54.75 tff(f74,axiom,( 54.91/54.75 ! [X0 : uni] : t2tb2(tb2t2(X0)) = X0), 54.91/54.75 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bridgeR2)). 54.91/54.75 tff(f10808,plain,( 54.91/54.75 ( ! [X0:tree1] : (~mem(tree,t2tb2(X0),t2tb1(sK7)) | size1(sK9) = size1(X0)) ) | ~spl22_144), 54.91/54.75 inference(resolution,[],[f6945,f7172])). 54.91/54.75 tff(f7172,plain,( 54.91/54.75 mem(tree,t2tb2(sK9),t2tb1(sK7)) | ~spl22_144), 54.91/54.75 inference(avatar_component_clause,[],[f7171])). 54.91/54.75 tff(f6945,plain,( 54.91/54.75 ( ! [X0:tree1,X1:tree1] : (~mem(tree,t2tb2(X1),t2tb1(sK7)) | size1(X0) = size1(X1) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) )), 54.91/54.75 inference(superposition,[],[f6872,f6872])). 54.91/54.75 tff(f6872,plain,( 54.91/54.75 ( ! [X0:tree1] : (size1(X0) = $sum($sum(sK6,sK3),$uminus(sK6)) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) )), 54.91/54.75 inference(superposition,[],[f6871,f276])). 54.91/54.75 tff(f276,plain,( 54.91/54.75 ( ! [X0:tree1] : (tb2t2(t2tb2(X0)) = X0) )), 54.91/54.75 inference(cnf_transformation,[],[f95])). 54.91/54.75 tff(f95,plain,( 54.91/54.75 ! [X0 : tree1] : tb2t2(t2tb2(X0)) = X0), 54.91/54.75 inference(rectify,[],[f41])). 54.91/54.75 tff(f41,axiom,( 54.91/54.75 ! [X5 : tree1] : tb2t2(t2tb2(X5)) = X5), 54.91/54.75 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bridgeL2)). 54.91/54.75 tff(f6871,plain,( 54.91/54.75 ( ! [X4:uni] : (size1(tb2t2(X4)) = $sum($sum(sK6,sK3),$uminus(sK6)) | ~mem(tree,X4,t2tb1(sK7))) )), 54.91/54.75 inference(duplicate_literal_removal,[],[f6870])). 54.91/54.75 tff(f6870,plain,( 54.91/54.75 ( ! [X4:uni] : (~mem(tree,X4,t2tb1(sK7)) | size1(tb2t2(X4)) = $sum($sum(sK6,sK3),$uminus(sK6)) | ~mem(tree,X4,t2tb1(sK7))) )), 54.91/54.75 inference(forward_demodulation,[],[f6848,f274])). 54.91/54.75 tff(f6848,plain,( 54.91/54.75 ( ! [X4:uni] : (size1(tb2t2(X4)) = $sum($sum(sK6,sK3),$uminus(sK6)) | ~mem(tree,t2tb2(tb2t2(X4)),t2tb1(sK7)) | ~mem(tree,X4,t2tb1(sK7))) )), 54.91/54.75 inference(superposition,[],[f6825,f521])). 54.91/54.75 tff(f521,plain,( 54.91/54.75 ( ! [X0:uni] : (size1(sK10(tb2t2(X0))) = sK6 | ~mem(tree,X0,t2tb1(sK7))) )), 54.91/54.75 inference(superposition,[],[f254,f274])). 54.91/54.75 tff(f254,plain,( 54.91/54.75 ( ! [X12:tree1] : (~mem(tree,t2tb2(X12),t2tb1(sK7)) | size1(sK10(X12)) = sK6) )), 54.91/54.75 inference(cnf_transformation,[],[f198])). 54.91/54.75 tff(f198,plain,( 54.91/54.75 (((((((! [X10 : tree1,X11 : tree1] : (size1(sK9) != sK3 | ~$less(size1(X10),$sum(sK6,1)) | node1(X10,X11) != sK9) & mem(tree,t2tb2(sK9),get(list(tree),int,t2tb3(sK8),t2tb(sK3)))) & tb2t3(set(list(tree),int,t2tb3(sK5),t2tb(sK3),infix_plpl(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3))))) = sK8 & ~$less($sum(sK0,1),0)) & ~$less(sK3,0) & $less(sK3,$sum(sK0,1)) & ! [X12 : tree1] : (((size1(sK10(X12)) = sK6 & size1(sK11(X12)) = $sum($sum(sK3,$uminus(1)),$uminus(sK6)) & node1(sK10(X12),sK11(X12)) = X12) | ~mem(tree,t2tb2(X12),t2tb1(sK7))) & (mem(tree,t2tb2(X12),t2tb1(sK7)) | ! [X15 : tree1,X16 : tree1] : (size1(X15) != sK6 | size1(X16) != $sum($sum(sK3,$uminus(1)),$uminus(sK6)) | node1(X15,X16) != X12))) & distinct(tree,t2tb1(sK7))) & all_trees1(sK6,tb2t1(get(list(tree),int,t2tb3(sK5),t2tb(sK6)))) & all_trees1($sum($sum(sK3,$uminus(1)),$uminus(sK6)),tb2t1(get(list(tree),int,t2tb3(sK5),t2tb($sum($sum(sK3,$uminus(1)),$uminus(sK6)))))) & ~$less($sum($sum(sK3,$uminus(1)),$uminus(sK6)),0) & ~$less(sK6,0) & ~$less(sK6,0) & $less(sK6,$sum(sK0,1)) & $less($sum($sum(sK3,$uminus(1)),$uminus(sK6)),$sum(sK0,1)) & ~$less($sum($sum(sK3,$uminus(1)),$uminus(sK6)),0) & ~$less(sK3,0) & $less(sK3,$sum(sK0,1)) & ~$less($sum(sK0,1),0) & ! [X17 : $int] : (all_trees1(X17,tb2t1(get(list(tree),int,t2tb3(sK5),t2tb(X17)))) | $less(X17,0) | ~$less(X17,sK3)) & distinct(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3))) & ! [X18 : tree1] : ((mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | ! [X19 : tree1,X20 : tree1] : (node1(X19,X20) != X18 | size1(X18) != sK3 | ~$less(size1(X19),sK6))) & ((node1(sK12(X18),sK13(X18)) = X18 & size1(X18) = sK3 & $less(size1(sK12(X18)),sK6)) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(sK5),t2tb(sK3))))) & ~$less($sum(sK3,$uminus(1)),sK6) & ~$less(sK6,0)) & ~$less($sum(sK3,$uminus(1)),0) & tb2t3(set(list(tree),int,t2tb3(sK2),t2tb(sK3),nil(tree))) = sK4 & ~$less($sum(sK0,1),0)) & ~$less($sum(sK0,1),0) & ~$less(sK3,0) & $less(sK3,$sum(sK0,1)) & ! [X23 : $int] : (all_trees1(X23,tb2t1(get(list(tree),int,t2tb3(sK2),t2tb(X23)))) | $less(X23,0) | ~$less(X23,sK3)) & ~$less(sK3,1) & ~$less(sK0,sK3)) & ~$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)), 54.91/54.75 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])). 54.91/54.75 tff(f188,plain,( 54.91/54.75 ? [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] : (size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1)) | node1(X10,X11) != X9) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(X3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(X5),t2tb(X3))))) = X8 & ~$less($sum(X0,1),0)) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ! [X12 : tree1] : ((? [X13 : tree1,X14 : tree1] : (size1(X13) = X6 & size1(X14) = $sum($sum(X3,$uminus(1)),$uminus(X6)) & node1(X13,X14) = X12) | ~mem(tree,t2tb2(X12),t2tb1(X7))) & (mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X15 : tree1,X16 : tree1] : (size1(X15) != X6 | size1(X16) != $sum($sum(X3,$uminus(1)),$uminus(X6)) | node1(X15,X16) != X12))) & distinct(tree,t2tb1(X7))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & all_trees1($sum($sum(X3,$uminus(1)),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($sum(X3,$uminus(1)),$uminus(X6)))))) & ~$less($sum($sum(X3,$uminus(1)),$uminus(X6)),0) & ~$less(X6,0) & ~$less(X6,0) & $less(X6,$sum(X0,1)) & $less($sum($sum(X3,$uminus(1)),$uminus(X6)),$sum(X0,1)) & ~$less($sum($sum(X3,$uminus(1)),$uminus(X6)),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X17 : $int] : (all_trees1(X17,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X17)))) | $less(X17,0) | ~$less(X17,X3)) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X18 : tree1] : ((mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X19 : tree1,X20 : tree1] : (node1(X19,X20) != X18 | size1(X18) != X3 | ~$less(size1(X19),X6))) & (? [X21 : tree1,X22 : tree1] : (node1(X21,X22) = X18 & size1(X18) = X3 & $less(size1(X21),X6)) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))))) & ~$less($sum(X3,$uminus(1)),X6) & ~$less(X6,0)) & ~$less($sum(X3,$uminus(1)),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X4 & ~$less($sum(X0,1),0)) & ~$less($sum(X0,1),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ! [X23 : $int] : (all_trees1(X23,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X23)))) | $less(X23,0) | ~$less(X23,X3)) & ~$less(X3,1) & ~$less(X0,X3)) & ~$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] : (size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1)) | node1(X10,X11) != X9) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(X3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(X5),t2tb(X3))))) = X8 & ~$less($sum(sK0,1),0)) & ~$less(X3,0) & $less(X3,$sum(sK0,1)) & ! [X12 : tree1] : ((? [X13 : tree1,X14 : tree1] : (size1(X13) = X6 & size1(X14) = $sum($sum(X3,$uminus(1)),$uminus(X6)) & node1(X13,X14) = X12) | ~mem(tree,t2tb2(X12),t2tb1(X7))) & (mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X15 : tree1,X16 : tree1] : (size1(X15) != X6 | size1(X16) != $sum($sum(X3,$uminus(1)),$uminus(X6)) | node1(X15,X16) != X12))) & distinct(tree,t2tb1(X7))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & all_trees1($sum($sum(X3,$uminus(1)),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($sum(X3,$uminus(1)),$uminus(X6)))))) & ~$less($sum($sum(X3,$uminus(1)),$uminus(X6)),0) & ~$less(X6,0) & ~$less(X6,0) & $less(X6,$sum(sK0,1)) & $less($sum($sum(X3,$uminus(1)),$uminus(X6)),$sum(sK0,1)) & ~$less($sum($sum(X3,$uminus(1)),$uminus(X6)),0) & ~$less(X3,0) & $less(X3,$sum(sK0,1)) & ~$less($sum(sK0,1),0) & ! [X17 : $int] : (all_trees1(X17,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X17)))) | $less(X17,0) | ~$less(X17,X3)) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X18 : tree1] : ((mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X19 : tree1,X20 : tree1] : (node1(X19,X20) != X18 | size1(X18) != X3 | ~$less(size1(X19),X6))) & (? [X21 : tree1,X22 : tree1] : (node1(X21,X22) = X18 & size1(X18) = X3 & $less(size1(X21),X6)) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))))) & ~$less($sum(X3,$uminus(1)),X6) & ~$less(X6,0)) & ~$less($sum(X3,$uminus(1)),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X4 & ~$less($sum(sK0,1),0)) & ~$less($sum(sK0,1),0) & ~$less(X3,0) & $less(X3,$sum(sK0,1)) & ! [X23 : $int] : (all_trees1(X23,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X23)))) | $less(X23,0) | ~$less(X23,X3)) & ~$less(X3,1) & ~$less(sK0,X3)) & ~$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))), 54.91/54.75 introduced(choice_axiom,[])). 54.91/54.75 tff(f189,plain,( 54.91/54.75 ( ! [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] : (size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1)) | node1(X10,X11) != X9) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(X3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(X5),t2tb(X3))))) = X8 & ~$less($sum(X0,1),0)) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ! [X12 : tree1] : ((? [X13 : tree1,X14 : tree1] : (size1(X13) = X6 & size1(X14) = $sum($sum(X3,$uminus(1)),$uminus(X6)) & node1(X13,X14) = X12) | ~mem(tree,t2tb2(X12),t2tb1(X7))) & (mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X15 : tree1,X16 : tree1] : (size1(X15) != X6 | size1(X16) != $sum($sum(X3,$uminus(1)),$uminus(X6)) | node1(X15,X16) != X12))) & distinct(tree,t2tb1(X7))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & all_trees1($sum($sum(X3,$uminus(1)),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($sum(X3,$uminus(1)),$uminus(X6)))))) & ~$less($sum($sum(X3,$uminus(1)),$uminus(X6)),0) & ~$less(X6,0) & ~$less(X6,0) & $less(X6,$sum(X0,1)) & $less($sum($sum(X3,$uminus(1)),$uminus(X6)),$sum(X0,1)) & ~$less($sum($sum(X3,$uminus(1)),$uminus(X6)),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X17 : $int] : (all_trees1(X17,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X17)))) | $less(X17,0) | ~$less(X17,X3)) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X18 : tree1] : ((mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X19 : tree1,X20 : tree1] : (node1(X19,X20) != X18 | size1(X18) != X3 | ~$less(size1(X19),X6))) & (? [X21 : tree1,X22 : tree1] : (node1(X21,X22) = X18 & size1(X18) = X3 & $less(size1(X21),X6)) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))))) & ~$less($sum(X3,$uminus(1)),X6) & ~$less(X6,0)) & ~$less($sum(X3,$uminus(1)),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X4 & ~$less($sum(X0,1),0)) & ~$less($sum(X0,1),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ! [X23 : $int] : (all_trees1(X23,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X23)))) | $less(X23,0) | ~$less(X23,X3)) & ~$less(X3,1) & ~$less(X0,X3)) & ~$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] : (size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1)) | node1(X10,X11) != X9) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(X3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(X5),t2tb(X3))))) = X8 & ~$less($sum(X0,1),0)) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ! [X12 : tree1] : ((? [X13 : tree1,X14 : tree1] : (size1(X13) = X6 & size1(X14) = $sum($sum(X3,$uminus(1)),$uminus(X6)) & node1(X13,X14) = X12) | ~mem(tree,t2tb2(X12),t2tb1(X7))) & (mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X15 : tree1,X16 : tree1] : (size1(X15) != X6 | size1(X16) != $sum($sum(X3,$uminus(1)),$uminus(X6)) | node1(X15,X16) != X12))) & distinct(tree,t2tb1(X7))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & all_trees1($sum($sum(X3,$uminus(1)),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($sum(X3,$uminus(1)),$uminus(X6)))))) & ~$less($sum($sum(X3,$uminus(1)),$uminus(X6)),0) & ~$less(X6,0) & ~$less(X6,0) & $less(X6,$sum(X0,1)) & $less($sum($sum(X3,$uminus(1)),$uminus(X6)),$sum(X0,1)) & ~$less($sum($sum(X3,$uminus(1)),$uminus(X6)),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X17 : $int] : (all_trees1(X17,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X17)))) | $less(X17,0) | ~$less(X17,X3)) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X18 : tree1] : ((mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X19 : tree1,X20 : tree1] : (node1(X19,X20) != X18 | size1(X18) != X3 | ~$less(size1(X19),X6))) & (? [X21 : tree1,X22 : tree1] : (node1(X21,X22) = X18 & size1(X18) = X3 & $less(size1(X21),X6)) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))))) & ~$less($sum(X3,$uminus(1)),X6) & ~$less(X6,0)) & ~$less($sum(X3,$uminus(1)),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X4 & ~$less($sum(X0,1),0)) & ~$less($sum(X0,1),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ! [X23 : $int] : (all_trees1(X23,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X23)))) | $less(X23,0) | ~$less(X23,X3)) & ~$less(X3,1) & ~$less(X0,X3)) & ~$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)) )), 54.91/54.75 introduced(choice_axiom,[])). 54.91/54.75 tff(f190,plain,( 54.91/54.75 ( ! [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] : (size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1)) | node1(X10,X11) != X9) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(X3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(X5),t2tb(X3))))) = X8 & ~$less($sum(X0,1),0)) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ! [X12 : tree1] : ((? [X13 : tree1,X14 : tree1] : (size1(X13) = X6 & size1(X14) = $sum($sum(X3,$uminus(1)),$uminus(X6)) & node1(X13,X14) = X12) | ~mem(tree,t2tb2(X12),t2tb1(X7))) & (mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X15 : tree1,X16 : tree1] : (size1(X15) != X6 | size1(X16) != $sum($sum(X3,$uminus(1)),$uminus(X6)) | node1(X15,X16) != X12))) & distinct(tree,t2tb1(X7))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & all_trees1($sum($sum(X3,$uminus(1)),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($sum(X3,$uminus(1)),$uminus(X6)))))) & ~$less($sum($sum(X3,$uminus(1)),$uminus(X6)),0) & ~$less(X6,0) & ~$less(X6,0) & $less(X6,$sum(X0,1)) & $less($sum($sum(X3,$uminus(1)),$uminus(X6)),$sum(X0,1)) & ~$less($sum($sum(X3,$uminus(1)),$uminus(X6)),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X17 : $int] : (all_trees1(X17,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X17)))) | $less(X17,0) | ~$less(X17,X3)) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X18 : tree1] : ((mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X19 : tree1,X20 : tree1] : (node1(X19,X20) != X18 | size1(X18) != X3 | ~$less(size1(X19),X6))) & (? [X21 : tree1,X22 : tree1] : (node1(X21,X22) = X18 & size1(X18) = X3 & $less(size1(X21),X6)) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))))) & ~$less($sum(X3,$uminus(1)),X6) & ~$less(X6,0)) & ~$less($sum(X3,$uminus(1)),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X4 & ~$less($sum(X0,1),0)) & ~$less($sum(X0,1),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ! [X23 : $int] : (all_trees1(X23,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X23)))) | $less(X23,0) | ~$less(X23,X3)) & ~$less(X3,1) & ~$less(X0,X3)) => (? [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] : (size1(X9) != sK3 | ~$less(size1(X10),$sum(X6,1)) | node1(X10,X11) != X9) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(sK3)))) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(sK3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(X5),t2tb(sK3))))) = X8 & ~$less($sum(X0,1),0)) & ~$less(sK3,0) & $less(sK3,$sum(X0,1)) & ! [X12 : tree1] : ((? [X14 : tree1,X13 : tree1] : (size1(X13) = X6 & size1(X14) = $sum($sum(sK3,$uminus(1)),$uminus(X6)) & node1(X13,X14) = X12) | ~mem(tree,t2tb2(X12),t2tb1(X7))) & (mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X16 : tree1,X15 : tree1] : (size1(X15) != X6 | size1(X16) != $sum($sum(sK3,$uminus(1)),$uminus(X6)) | node1(X15,X16) != X12))) & distinct(tree,t2tb1(X7))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & all_trees1($sum($sum(sK3,$uminus(1)),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($sum(sK3,$uminus(1)),$uminus(X6)))))) & ~$less($sum($sum(sK3,$uminus(1)),$uminus(X6)),0) & ~$less(X6,0) & ~$less(X6,0) & $less(X6,$sum(X0,1)) & $less($sum($sum(sK3,$uminus(1)),$uminus(X6)),$sum(X0,1)) & ~$less($sum($sum(sK3,$uminus(1)),$uminus(X6)),0) & ~$less(sK3,0) & $less(sK3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X17 : $int] : (all_trees1(X17,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X17)))) | $less(X17,0) | ~$less(X17,sK3)) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(sK3))) & ! [X18 : tree1] : ((mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(sK3))) | ! [X20 : tree1,X19 : tree1] : (node1(X19,X20) != X18 | size1(X18) != sK3 | ~$less(size1(X19),X6))) & (? [X22 : tree1,X21 : tree1] : (node1(X21,X22) = X18 & size1(X18) = sK3 & $less(size1(X21),X6)) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(sK3))))) & ~$less($sum(sK3,$uminus(1)),X6) & ~$less(X6,0)) & ~$less($sum(sK3,$uminus(1)),0) & tb2t3(set(list(tree),int,t2tb3(sK2),t2tb(sK3),nil(tree))) = X4 & ~$less($sum(X0,1),0)) & ~$less($sum(X0,1),0) & ~$less(sK3,0) & $less(sK3,$sum(X0,1)) & ! [X23 : $int] : (all_trees1(X23,tb2t1(get(list(tree),int,t2tb3(sK2),t2tb(X23)))) | $less(X23,0) | ~$less(X23,sK3)) & ~$less(sK3,1) & ~$less(X0,sK3))) )), 54.91/54.75 introduced(choice_axiom,[])). 54.91/54.75 tff(f191,plain,( 54.91/54.75 ( ! [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] : (size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1)) | node1(X10,X11) != X9) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(X3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(X5),t2tb(X3))))) = X8 & ~$less($sum(X0,1),0)) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ! [X12 : tree1] : ((? [X13 : tree1,X14 : tree1] : (size1(X13) = X6 & size1(X14) = $sum($sum(X3,$uminus(1)),$uminus(X6)) & node1(X13,X14) = X12) | ~mem(tree,t2tb2(X12),t2tb1(X7))) & (mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X15 : tree1,X16 : tree1] : (size1(X15) != X6 | size1(X16) != $sum($sum(X3,$uminus(1)),$uminus(X6)) | node1(X15,X16) != X12))) & distinct(tree,t2tb1(X7))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & all_trees1($sum($sum(X3,$uminus(1)),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($sum(X3,$uminus(1)),$uminus(X6)))))) & ~$less($sum($sum(X3,$uminus(1)),$uminus(X6)),0) & ~$less(X6,0) & ~$less(X6,0) & $less(X6,$sum(X0,1)) & $less($sum($sum(X3,$uminus(1)),$uminus(X6)),$sum(X0,1)) & ~$less($sum($sum(X3,$uminus(1)),$uminus(X6)),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X17 : $int] : (all_trees1(X17,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X17)))) | $less(X17,0) | ~$less(X17,X3)) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X18 : tree1] : ((mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X19 : tree1,X20 : tree1] : (node1(X19,X20) != X18 | size1(X18) != X3 | ~$less(size1(X19),X6))) & (? [X21 : tree1,X22 : tree1] : (node1(X21,X22) = X18 & size1(X18) = X3 & $less(size1(X21),X6)) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))))) & ~$less($sum(X3,$uminus(1)),X6) & ~$less(X6,0)) & ~$less($sum(X3,$uminus(1)),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X4 & ~$less($sum(X0,1),0)) => (? [X5 : map_int_lplist_treerp,X6 : $int] : (? [X7 : list_tree] : (? [X8 : map_int_lplist_treerp] : (? [X9 : tree1] : (! [X10 : tree1,X11 : tree1] : (size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1)) | node1(X10,X11) != X9) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(X3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(X5),t2tb(X3))))) = X8 & ~$less($sum(X0,1),0)) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ! [X12 : tree1] : ((? [X13 : tree1,X14 : tree1] : (size1(X13) = X6 & size1(X14) = $sum($sum(X3,$uminus(1)),$uminus(X6)) & node1(X13,X14) = X12) | ~mem(tree,t2tb2(X12),t2tb1(X7))) & (mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X15 : tree1,X16 : tree1] : (size1(X15) != X6 | size1(X16) != $sum($sum(X3,$uminus(1)),$uminus(X6)) | node1(X15,X16) != X12))) & distinct(tree,t2tb1(X7))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & all_trees1($sum($sum(X3,$uminus(1)),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($sum(X3,$uminus(1)),$uminus(X6)))))) & ~$less($sum($sum(X3,$uminus(1)),$uminus(X6)),0) & ~$less(X6,0) & ~$less(X6,0) & $less(X6,$sum(X0,1)) & $less($sum($sum(X3,$uminus(1)),$uminus(X6)),$sum(X0,1)) & ~$less($sum($sum(X3,$uminus(1)),$uminus(X6)),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X17 : $int] : (all_trees1(X17,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X17)))) | $less(X17,0) | ~$less(X17,X3)) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X18 : tree1] : ((mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X19 : tree1,X20 : tree1] : (node1(X19,X20) != X18 | size1(X18) != X3 | ~$less(size1(X19),X6))) & (? [X21 : tree1,X22 : tree1] : (node1(X21,X22) = X18 & size1(X18) = X3 & $less(size1(X21),X6)) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))))) & ~$less($sum(X3,$uminus(1)),X6) & ~$less(X6,0)) & ~$less($sum(X3,$uminus(1)),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = sK4 & ~$less($sum(X0,1),0))) )), 54.91/54.75 introduced(choice_axiom,[])). 54.91/54.75 tff(f192,plain,( 54.91/54.75 ( ! [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] : (size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1)) | node1(X10,X11) != X9) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(X3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(X5),t2tb(X3))))) = X8 & ~$less($sum(X0,1),0)) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ! [X12 : tree1] : ((? [X13 : tree1,X14 : tree1] : (size1(X13) = X6 & size1(X14) = $sum($sum(X3,$uminus(1)),$uminus(X6)) & node1(X13,X14) = X12) | ~mem(tree,t2tb2(X12),t2tb1(X7))) & (mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X15 : tree1,X16 : tree1] : (size1(X15) != X6 | size1(X16) != $sum($sum(X3,$uminus(1)),$uminus(X6)) | node1(X15,X16) != X12))) & distinct(tree,t2tb1(X7))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & all_trees1($sum($sum(X3,$uminus(1)),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($sum(X3,$uminus(1)),$uminus(X6)))))) & ~$less($sum($sum(X3,$uminus(1)),$uminus(X6)),0) & ~$less(X6,0) & ~$less(X6,0) & $less(X6,$sum(X0,1)) & $less($sum($sum(X3,$uminus(1)),$uminus(X6)),$sum(X0,1)) & ~$less($sum($sum(X3,$uminus(1)),$uminus(X6)),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X17 : $int] : (all_trees1(X17,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X17)))) | $less(X17,0) | ~$less(X17,X3)) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X18 : tree1] : ((mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X19 : tree1,X20 : tree1] : (node1(X19,X20) != X18 | size1(X18) != X3 | ~$less(size1(X19),X6))) & (? [X21 : tree1,X22 : tree1] : (node1(X21,X22) = X18 & size1(X18) = X3 & $less(size1(X21),X6)) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))))) & ~$less($sum(X3,$uminus(1)),X6) & ~$less(X6,0)) => (? [X7 : list_tree] : (? [X8 : map_int_lplist_treerp] : (? [X9 : tree1] : (! [X11 : tree1,X10 : tree1] : (size1(X9) != X3 | ~$less(size1(X10),$sum(sK6,1)) | node1(X10,X11) != X9) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) & tb2t3(set(list(tree),int,t2tb3(sK5),t2tb(X3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(sK5),t2tb(X3))))) = X8 & ~$less($sum(X0,1),0)) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ! [X12 : tree1] : ((? [X14 : tree1,X13 : tree1] : (size1(X13) = sK6 & size1(X14) = $sum($sum(X3,$uminus(1)),$uminus(sK6)) & node1(X13,X14) = X12) | ~mem(tree,t2tb2(X12),t2tb1(X7))) & (mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X16 : tree1,X15 : tree1] : (size1(X15) != sK6 | size1(X16) != $sum($sum(X3,$uminus(1)),$uminus(sK6)) | node1(X15,X16) != X12))) & distinct(tree,t2tb1(X7))) & all_trees1(sK6,tb2t1(get(list(tree),int,t2tb3(sK5),t2tb(sK6)))) & all_trees1($sum($sum(X3,$uminus(1)),$uminus(sK6)),tb2t1(get(list(tree),int,t2tb3(sK5),t2tb($sum($sum(X3,$uminus(1)),$uminus(sK6)))))) & ~$less($sum($sum(X3,$uminus(1)),$uminus(sK6)),0) & ~$less(sK6,0) & ~$less(sK6,0) & $less(sK6,$sum(X0,1)) & $less($sum($sum(X3,$uminus(1)),$uminus(sK6)),$sum(X0,1)) & ~$less($sum($sum(X3,$uminus(1)),$uminus(sK6)),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X17 : $int] : (all_trees1(X17,tb2t1(get(list(tree),int,t2tb3(sK5),t2tb(X17)))) | $less(X17,0) | ~$less(X17,X3)) & distinct(tree,get(list(tree),int,t2tb3(sK5),t2tb(X3))) & ! [X18 : tree1] : ((mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(sK5),t2tb(X3))) | ! [X20 : tree1,X19 : tree1] : (node1(X19,X20) != X18 | size1(X18) != X3 | ~$less(size1(X19),sK6))) & (? [X22 : tree1,X21 : tree1] : (node1(X21,X22) = X18 & size1(X18) = X3 & $less(size1(X21),sK6)) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(sK5),t2tb(X3))))) & ~$less($sum(X3,$uminus(1)),sK6) & ~$less(sK6,0))) )), 54.91/54.75 introduced(choice_axiom,[])). 54.91/54.75 tff(f193,plain,( 54.91/54.75 ( ! [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] : (size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1)) | node1(X10,X11) != X9) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(X3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(X5),t2tb(X3))))) = X8 & ~$less($sum(X0,1),0)) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ! [X12 : tree1] : ((? [X13 : tree1,X14 : tree1] : (size1(X13) = X6 & size1(X14) = $sum($sum(X3,$uminus(1)),$uminus(X6)) & node1(X13,X14) = X12) | ~mem(tree,t2tb2(X12),t2tb1(X7))) & (mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X15 : tree1,X16 : tree1] : (size1(X15) != X6 | size1(X16) != $sum($sum(X3,$uminus(1)),$uminus(X6)) | node1(X15,X16) != X12))) & distinct(tree,t2tb1(X7))) => (? [X8 : map_int_lplist_treerp] : (? [X9 : tree1] : (! [X10 : tree1,X11 : tree1] : (size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1)) | node1(X10,X11) != X9) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(X3),infix_plpl(tree,t2tb1(sK7),get(list(tree),int,t2tb3(X5),t2tb(X3))))) = X8 & ~$less($sum(X0,1),0)) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ! [X12 : tree1] : ((? [X13 : tree1,X14 : tree1] : (size1(X13) = X6 & size1(X14) = $sum($sum(X3,$uminus(1)),$uminus(X6)) & node1(X13,X14) = X12) | ~mem(tree,t2tb2(X12),t2tb1(sK7))) & (mem(tree,t2tb2(X12),t2tb1(sK7)) | ! [X15 : tree1,X16 : tree1] : (size1(X15) != X6 | size1(X16) != $sum($sum(X3,$uminus(1)),$uminus(X6)) | node1(X15,X16) != X12))) & distinct(tree,t2tb1(sK7)))) )), 54.91/54.75 introduced(choice_axiom,[])). 54.91/54.75 tff(f194,plain,( 54.91/54.75 ( ! [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] : (size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1)) | node1(X10,X11) != X9) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(X3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(X5),t2tb(X3))))) = X8 & ~$less($sum(X0,1),0)) => (? [X9 : tree1] : (! [X10 : tree1,X11 : tree1] : (size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1)) | node1(X10,X11) != X9) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(sK8),t2tb(X3)))) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(X3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(X5),t2tb(X3))))) = sK8 & ~$less($sum(X0,1),0))) )), 54.91/54.75 introduced(choice_axiom,[])). 54.91/54.75 tff(f195,plain,( 54.91/54.75 ( ! [X6:$int,X8:map_int_lplist_treerp,X3:$int] : (? [X9 : tree1] : (! [X10 : tree1,X11 : tree1] : (size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1)) | node1(X10,X11) != X9) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) => (! [X11 : tree1,X10 : tree1] : (size1(sK9) != X3 | ~$less(size1(X10),$sum(X6,1)) | node1(X10,X11) != sK9) & mem(tree,t2tb2(sK9),get(list(tree),int,t2tb3(X8),t2tb(X3))))) )), 54.91/54.75 introduced(choice_axiom,[])). 54.91/54.75 tff(f196,plain,( 54.91/54.75 ( ! [X6:$int,X3:$int] : (! [X12 : tree1] : (? [X13 : tree1,X14 : tree1] : (size1(X13) = X6 & size1(X14) = $sum($sum(X3,$uminus(1)),$uminus(X6)) & node1(X13,X14) = X12) => (size1(sK10(X12)) = X6 & size1(sK11(X12)) = $sum($sum(X3,$uminus(1)),$uminus(X6)) & node1(sK10(X12),sK11(X12)) = X12))) )), 54.91/54.75 introduced(choice_axiom,[])). 54.91/54.75 tff(f197,plain,( 54.91/54.75 ( ! [X6:$int,X3:$int] : (! [X18 : tree1] : (? [X21 : tree1,X22 : tree1] : (node1(X21,X22) = X18 & size1(X18) = X3 & $less(size1(X21),X6)) => (node1(sK12(X18),sK13(X18)) = X18 & size1(X18) = X3 & $less(size1(sK12(X18)),X6)))) )), 54.91/54.75 introduced(choice_axiom,[])). 54.91/54.75 tff(f187,plain,( 54.91/54.75 ? [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] : (size1(X9) != X3 | ~$less(size1(X10),$sum(X6,1)) | node1(X10,X11) != X9) & mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X8),t2tb(X3)))) & tb2t3(set(list(tree),int,t2tb3(X5),t2tb(X3),infix_plpl(tree,t2tb1(X7),get(list(tree),int,t2tb3(X5),t2tb(X3))))) = X8 & ~$less($sum(X0,1),0)) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ! [X12 : tree1] : ((? [X13 : tree1,X14 : tree1] : (size1(X13) = X6 & size1(X14) = $sum($sum(X3,$uminus(1)),$uminus(X6)) & node1(X13,X14) = X12) | ~mem(tree,t2tb2(X12),t2tb1(X7))) & (mem(tree,t2tb2(X12),t2tb1(X7)) | ! [X15 : tree1,X16 : tree1] : (size1(X15) != X6 | size1(X16) != $sum($sum(X3,$uminus(1)),$uminus(X6)) | node1(X15,X16) != X12))) & distinct(tree,t2tb1(X7))) & all_trees1(X6,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X6)))) & all_trees1($sum($sum(X3,$uminus(1)),$uminus(X6)),tb2t1(get(list(tree),int,t2tb3(X5),t2tb($sum($sum(X3,$uminus(1)),$uminus(X6)))))) & ~$less($sum($sum(X3,$uminus(1)),$uminus(X6)),0) & ~$less(X6,0) & ~$less(X6,0) & $less(X6,$sum(X0,1)) & $less($sum($sum(X3,$uminus(1)),$uminus(X6)),$sum(X0,1)) & ~$less($sum($sum(X3,$uminus(1)),$uminus(X6)),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X17 : $int] : (all_trees1(X17,tb2t1(get(list(tree),int,t2tb3(X5),t2tb(X17)))) | $less(X17,0) | ~$less(X17,X3)) & distinct(tree,get(list(tree),int,t2tb3(X5),t2tb(X3))) & ! [X18 : tree1] : ((mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))) | ! [X19 : tree1,X20 : tree1] : (node1(X19,X20) != X18 | size1(X18) != X3 | ~$less(size1(X19),X6))) & (? [X21 : tree1,X22 : tree1] : (node1(X21,X22) = X18 & size1(X18) = X3 & $less(size1(X21),X6)) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(X5),t2tb(X3))))) & ~$less($sum(X3,$uminus(1)),X6) & ~$less(X6,0)) & ~$less($sum(X3,$uminus(1)),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X4 & ~$less($sum(X0,1),0)) & ~$less($sum(X0,1),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ! [X23 : $int] : (all_trees1(X23,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X23)))) | $less(X23,0) | ~$less(X23,X3)) & ~$less(X3,1) & ~$less(X0,X3)) & ~$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))), 54.91/54.75 inference(rectify,[],[f186])). 54.91/54.75 tff(f186,plain,( 54.91/54.75 ? [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] : (size1(X17) != X3 | ~$less(size1(X18),$sum(X7,1)) | node1(X18,X19) != X17) & mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X16),t2tb(X3)))) & tb2t3(set(list(tree),int,t2tb3(X6),t2tb(X3),infix_plpl(tree,t2tb1(X12),get(list(tree),int,t2tb3(X6),t2tb(X3))))) = X16 & ~$less($sum(X0,1),0)) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ! [X13 : tree1] : ((? [X14 : tree1,X15 : tree1] : (size1(X14) = X7 & size1(X15) = $sum($sum(X3,$uminus(1)),$uminus(X7)) & node1(X14,X15) = X13) | ~mem(tree,t2tb2(X13),t2tb1(X12))) & (mem(tree,t2tb2(X13),t2tb1(X12)) | ! [X14 : tree1,X15 : tree1] : (size1(X14) != X7 | size1(X15) != $sum($sum(X3,$uminus(1)),$uminus(X7)) | node1(X14,X15) != X13))) & distinct(tree,t2tb1(X12))) & all_trees1(X7,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X7)))) & all_trees1($sum($sum(X3,$uminus(1)),$uminus(X7)),tb2t1(get(list(tree),int,t2tb3(X6),t2tb($sum($sum(X3,$uminus(1)),$uminus(X7)))))) & ~$less($sum($sum(X3,$uminus(1)),$uminus(X7)),0) & ~$less(X7,0) & ~$less(X7,0) & $less(X7,$sum(X0,1)) & $less($sum($sum(X3,$uminus(1)),$uminus(X7)),$sum(X0,1)) & ~$less($sum($sum(X3,$uminus(1)),$uminus(X7)),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X8 : $int] : (all_trees1(X8,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X8)))) | $less(X8,0) | ~$less(X8,X3)) & distinct(tree,get(list(tree),int,t2tb3(X6),t2tb(X3))) & ! [X9 : tree1] : ((mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X6),t2tb(X3))) | ! [X10 : tree1,X11 : tree1] : (node1(X10,X11) != X9 | size1(X9) != X3 | ~$less(size1(X10),X7))) & (? [X10 : tree1,X11 : tree1] : (node1(X10,X11) = X9 & size1(X9) = X3 & $less(size1(X10),X7)) | ~mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X6),t2tb(X3))))) & ~$less($sum(X3,$uminus(1)),X7) & ~$less(X7,0)) & ~$less($sum(X3,$uminus(1)),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X5 & ~$less($sum(X0,1),0)) & ~$less($sum(X0,1),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ! [X4 : $int] : (all_trees1(X4,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X4)))) | $less(X4,0) | ~$less(X4,X3)) & ~$less(X3,1) & ~$less(X0,X3)) & ~$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))), 54.91/54.75 inference(nnf_transformation,[],[f159])). 54.91/54.75 tff(f159,plain,( 54.91/54.75 ? [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] : (size1(X17) != X3 | ~$less(size1(X18),$sum(X7,1)) | node1(X18,X19) != X17) & mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X16),t2tb(X3)))) & tb2t3(set(list(tree),int,t2tb3(X6),t2tb(X3),infix_plpl(tree,t2tb1(X12),get(list(tree),int,t2tb3(X6),t2tb(X3))))) = X16 & ~$less($sum(X0,1),0)) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ! [X13 : tree1] : (? [X14 : tree1,X15 : tree1] : (size1(X14) = X7 & size1(X15) = $sum($sum(X3,$uminus(1)),$uminus(X7)) & node1(X14,X15) = X13) <=> 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($sum(X3,$uminus(1)),$uminus(X7)),tb2t1(get(list(tree),int,t2tb3(X6),t2tb($sum($sum(X3,$uminus(1)),$uminus(X7)))))) & ~$less($sum($sum(X3,$uminus(1)),$uminus(X7)),0) & ~$less(X7,0) & ~$less(X7,0) & $less(X7,$sum(X0,1)) & $less($sum($sum(X3,$uminus(1)),$uminus(X7)),$sum(X0,1)) & ~$less($sum($sum(X3,$uminus(1)),$uminus(X7)),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0) & ! [X8 : $int] : (all_trees1(X8,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X8)))) | $less(X8,0) | ~$less(X8,X3)) & distinct(tree,get(list(tree),int,t2tb3(X6),t2tb(X3))) & ! [X9 : tree1] : (mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X6),t2tb(X3))) <=> ? [X10 : tree1,X11 : tree1] : (node1(X10,X11) = X9 & size1(X9) = X3 & $less(size1(X10),X7))) & ~$less($sum(X3,$uminus(1)),X7) & ~$less(X7,0)) & ~$less($sum(X3,$uminus(1)),0) & tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X5 & ~$less($sum(X0,1),0)) & ~$less($sum(X0,1),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)) & ! [X4 : $int] : (all_trees1(X4,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X4)))) | $less(X4,0) | ~$less(X4,X3)) & ~$less(X3,1) & ~$less(X0,X3)) & ~$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))), 54.91/54.75 inference(flattening,[],[f158])). 54.91/54.75 tff(f158,plain,( 54.91/54.75 ? [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] : (size1(X17) != X3 | ~$less(size1(X18),$sum(X7,1)) | node1(X18,X19) != X17) & mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X16),t2tb(X3)))) & (tb2t3(set(list(tree),int,t2tb3(X6),t2tb(X3),infix_plpl(tree,t2tb1(X12),get(list(tree),int,t2tb3(X6),t2tb(X3))))) = X16 & ~$less($sum(X0,1),0))) & (~$less(X3,0) & $less(X3,$sum(X0,1)))) & (! [X13 : tree1] : (? [X14 : tree1,X15 : tree1] : (size1(X14) = X7 & size1(X15) = $sum($sum(X3,$uminus(1)),$uminus(X7)) & node1(X14,X15) = X13) <=> 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($sum(X3,$uminus(1)),$uminus(X7)),tb2t1(get(list(tree),int,t2tb3(X6),t2tb($sum($sum(X3,$uminus(1)),$uminus(X7)))))) & ~$less($sum($sum(X3,$uminus(1)),$uminus(X7)),0) & ~$less(X7,0))) & (~$less(X7,0) & $less(X7,$sum(X0,1)))) & ($less($sum($sum(X3,$uminus(1)),$uminus(X7)),$sum(X0,1)) & ~$less($sum($sum(X3,$uminus(1)),$uminus(X7)),0))) & (~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0))) & (! [X8 : $int] : (all_trees1(X8,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X8)))) | ($less(X8,0) | ~$less(X8,X3))) & distinct(tree,get(list(tree),int,t2tb3(X6),t2tb(X3))) & ! [X9 : tree1] : (mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X6),t2tb(X3))) <=> ? [X10 : tree1,X11 : tree1] : (node1(X10,X11) = X9 & size1(X9) = X3 & $less(size1(X10),X7))))) & (~$less($sum(X3,$uminus(1)),X7) & ~$less(X7,0))) & ~$less($sum(X3,$uminus(1)),0)) & (tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X5 & ~$less($sum(X0,1),0))) & (~$less($sum(X0,1),0) & ~$less(X3,0) & $less(X3,$sum(X0,1)))) & ! [X4 : $int] : (all_trees1(X4,tb2t1(get(list(tree),int,t2tb3(X2),t2tb(X4)))) | ($less(X4,0) | ~$less(X4,X3)))) & (~$less(X3,1) & ~$less(X0,X3))) & ~$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))), 54.91/54.75 inference(ennf_transformation,[],[f85])). 54.91/54.75 tff(f85,plain,( 54.91/54.75 ~! [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(X3,1) & ~$less(X0,X3)) => (! [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,0) & $less(X3,$sum(X0,1))) => ! [X5 : map_int_lplist_treerp] : ((tb2t3(set(list(tree),int,t2tb3(X2),t2tb(X3),nil(tree))) = X5 & ~$less($sum(X0,1),0)) => (~$less($sum(X3,$uminus(1)),0) => ! [X6 : map_int_lplist_treerp,X7 : $int] : ((~$less($sum(X3,$uminus(1)),X7) & ~$less(X7,0)) => ((! [X8 : $int] : ((~$less(X8,0) & $less(X8,X3)) => all_trees1(X8,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X8))))) & distinct(tree,get(list(tree),int,t2tb3(X6),t2tb(X3))) & ! [X9 : tree1] : (mem(tree,t2tb2(X9),get(list(tree),int,t2tb3(X6),t2tb(X3))) <=> ? [X10 : tree1,X11 : tree1] : (node1(X10,X11) = X9 & size1(X9) = X3 & $less(size1(X10),X7)))) => ((~$less(X3,0) & $less(X3,$sum(X0,1)) & ~$less($sum(X0,1),0)) => (($less($sum($sum(X3,$uminus(1)),$uminus(X7)),$sum(X0,1)) & ~$less($sum($sum(X3,$uminus(1)),$uminus(X7)),0)) => ((~$less(X7,0) & $less(X7,$sum(X0,1))) => ((all_trees1(X7,tb2t1(get(list(tree),int,t2tb3(X6),t2tb(X7)))) & all_trees1($sum($sum(X3,$uminus(1)),$uminus(X7)),tb2t1(get(list(tree),int,t2tb3(X6),t2tb($sum($sum(X3,$uminus(1)),$uminus(X7)))))) & ~$less($sum($sum(X3,$uminus(1)),$uminus(X7)),0) & ~$less(X7,0)) => ! [X12 : list_tree] : ((! [X13 : tree1] : (? [X14 : tree1,X15 : tree1] : (size1(X14) = X7 & size1(X15) = $sum($sum(X3,$uminus(1)),$uminus(X7)) & node1(X14,X15) = X13) <=> mem(tree,t2tb2(X13),t2tb1(X12))) & distinct(tree,t2tb1(X12))) => ((~$less(X3,0) & $less(X3,$sum(X0,1))) => ! [X16 : map_int_lplist_treerp] : ((tb2t3(set(list(tree),int,t2tb3(X6),t2tb(X3),infix_plpl(tree,t2tb1(X12),get(list(tree),int,t2tb3(X6),t2tb(X3))))) = X16 & ~$less($sum(X0,1),0)) => ! [X17 : tree1] : (mem(tree,t2tb2(X17),get(list(tree),int,t2tb3(X16),t2tb(X3))) => ? [X18 : tree1,X19 : tree1] : (size1(X17) = X3 & $less(size1(X18),$sum(X7,1)) & node1(X18,X19) = X17))))))))))))))))))))))), 54.91/54.75 inference(rectify,[],[f84])). 54.91/54.75 tff(f84,plain,( 54.91/54.75 ~! [X6 : $int] : (~$less(X6,0) => (~$less($sum(X6,1),0) => (~$less($sum(X6,1),0) => ((~$less(0,0) & $less(0,$sum(X6,1))) => ! [X4 : map_int_lplist_treerp] : ((~$less($sum(X6,1),0) & tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = X4) => (~$less(X6,1) => ! [X12 : map_int_lplist_treerp,X5 : $int] : ((~$less(X5,1) & ~$less(X6,X5)) => (! [X23 : $int] : ((~$less(X23,0) & $less(X23,X5)) => all_trees1(X23,tb2t1(get(list(tree),int,t2tb3(X12),t2tb(X23))))) => ((~$less($sum(X6,1),0) & ~$less(X5,0) & $less(X5,$sum(X6,1))) => ! [X13 : map_int_lplist_treerp] : ((tb2t3(set(list(tree),int,t2tb3(X12),t2tb(X5),nil(tree))) = X13 & ~$less($sum(X6,1),0)) => (~$less($sum(X5,$uminus(1)),0) => ! [X19 : map_int_lplist_treerp,X0 : $int] : ((~$less($sum(X5,$uminus(1)),X0) & ~$less(X0,0)) => ((! [X23 : $int] : ((~$less(X23,0) & $less(X23,X5)) => all_trees1(X23,tb2t1(get(list(tree),int,t2tb3(X19),t2tb(X23))))) & distinct(tree,get(list(tree),int,t2tb3(X19),t2tb(X5))) & ! [X8 : tree1] : (mem(tree,t2tb2(X8),get(list(tree),int,t2tb3(X19),t2tb(X5))) <=> ? [X7 : tree1,X22 : tree1] : (node1(X7,X22) = X8 & size1(X8) = X5 & $less(size1(X7),X0)))) => ((~$less(X5,0) & $less(X5,$sum(X6,1)) & ~$less($sum(X6,1),0)) => (($less($sum($sum(X5,$uminus(1)),$uminus(X0)),$sum(X6,1)) & ~$less($sum($sum(X5,$uminus(1)),$uminus(X0)),0)) => ((~$less(X0,0) & $less(X0,$sum(X6,1))) => ((all_trees1(X0,tb2t1(get(list(tree),int,t2tb3(X19),t2tb(X0)))) & all_trees1($sum($sum(X5,$uminus(1)),$uminus(X0)),tb2t1(get(list(tree),int,t2tb3(X19),t2tb($sum($sum(X5,$uminus(1)),$uminus(X0)))))) & ~$less($sum($sum(X5,$uminus(1)),$uminus(X0)),0) & ~$less(X0,0)) => ! [X20 : list_tree] : ((! [X8 : tree1] : (? [X7 : tree1,X22 : tree1] : (size1(X7) = X0 & size1(X22) = $sum($sum(X5,$uminus(1)),$uminus(X0)) & node1(X7,X22) = X8) <=> mem(tree,t2tb2(X8),t2tb1(X20))) & distinct(tree,t2tb1(X20))) => ((~$less(X5,0) & $less(X5,$sum(X6,1))) => ! [X21 : map_int_lplist_treerp] : ((tb2t3(set(list(tree),int,t2tb3(X19),t2tb(X5),infix_plpl(tree,t2tb1(X20),get(list(tree),int,t2tb3(X19),t2tb(X5))))) = X21 & ~$less($sum(X6,1),0)) => ! [X8 : tree1] : (mem(tree,t2tb2(X8),get(list(tree),int,t2tb3(X21),t2tb(X5))) => ? [X7 : tree1,X22 : tree1] : (size1(X8) = X5 & $less(size1(X7),$sum(X0,1)) & node1(X7,X22) = X8))))))))))))))))))))))), 54.91/54.75 inference(evaluation,[],[f80])). 54.91/54.75 tff(f80,plain,( 54.91/54.75 ~! [X6 : $int] : (~$less(X6,0) => (~$less($sum(X6,1),0) => (~$less($sum(X6,1),0) => ((~$less(0,0) & $less(0,$sum(X6,1))) => ! [X4 : map_int_lplist_treerp] : ((~$less($sum(X6,1),0) & tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = X4) => (~$less(X6,1) => ! [X12 : map_int_lplist_treerp,X5 : $int] : ((~$less(X5,1) & ~$less(X6,X5)) => (! [X23 : $int] : ((~$less(X23,0) & $less(X23,X5)) => all_trees1(X23,tb2t1(get(list(tree),int,t2tb3(X12),t2tb(X23))))) => ((~$less($sum(X6,1),0) & ~$less(X5,0) & $less(X5,$sum(X6,1))) => ! [X13 : map_int_lplist_treerp] : ((tb2t3(set(list(tree),int,t2tb3(X12),t2tb(X5),nil(tree))) = X13 & ~$less($sum(X6,1),0)) => (~$less($sum(X5,$uminus(1)),0) => ! [X19 : map_int_lplist_treerp,X0 : $int] : ((~$less($sum(X5,$uminus(1)),X0) & ~$less(X0,0)) => ((! [X23 : $int] : ((~$less(X23,0) & $less(X23,X5)) => all_trees1(X23,tb2t1(get(list(tree),int,t2tb3(X19),t2tb(X23))))) & distinct(tree,get(list(tree),int,t2tb3(X19),t2tb(X5))) & ! [X8 : tree1] : (mem(tree,t2tb2(X8),get(list(tree),int,t2tb3(X19),t2tb(X5))) <=> ? [X7 : tree1,X22 : tree1] : (node1(X7,X22) = X8 & size1(X8) = X5 & $less(size1(X7),X0)))) => ((~$less(X5,0) & $less(X5,$sum(X6,1)) & ~$less($sum(X6,1),0)) => (($less($sum($difference(X5,1),$uminus(X0)),$sum(X6,1)) & ~$less($sum($difference(X5,1),$uminus(X0)),0)) => ((~$less(X0,0) & $less(X0,$sum(X6,1))) => ((all_trees1(X0,tb2t1(get(list(tree),int,t2tb3(X19),t2tb(X0)))) & all_trees1($sum($difference(X5,1),$uminus(X0)),tb2t1(get(list(tree),int,t2tb3(X19),t2tb($sum($difference(X5,1),$uminus(X0)))))) & ~$less($sum($difference(X5,1),$uminus(X0)),0) & ~$less(X0,0)) => ! [X20 : list_tree] : ((! [X8 : tree1] : (? [X7 : tree1,X22 : tree1] : (size1(X7) = X0 & size1(X22) = $sum($difference(X5,1),$uminus(X0)) & node1(X7,X22) = X8) <=> mem(tree,t2tb2(X8),t2tb1(X20))) & distinct(tree,t2tb1(X20))) => ((~$less(X5,0) & $less(X5,$sum(X6,1))) => ! [X21 : map_int_lplist_treerp] : ((tb2t3(set(list(tree),int,t2tb3(X19),t2tb(X5),infix_plpl(tree,t2tb1(X20),get(list(tree),int,t2tb3(X19),t2tb(X5))))) = X21 & ~$less($sum(X6,1),0)) => ! [X8 : tree1] : (mem(tree,t2tb2(X8),get(list(tree),int,t2tb3(X21),t2tb(X5))) => ? [X7 : tree1,X22 : tree1] : (size1(X8) = X5 & $less(size1(X7),$sum(X0,1)) & node1(X7,X22) = X8))))))))))))))))))))))), 54.91/54.75 inference(evaluation,[],[f30])). 54.91/54.75 tff(f30,negated_conjecture,( 54.91/54.75 ~! [X6 : $int] : ($lesseq(0,X6) => ($lesseq(0,$sum(X6,1)) => ($lesseq(0,$sum(X6,1)) => (($lesseq(0,0) & $less(0,$sum(X6,1))) => ! [X4 : map_int_lplist_treerp] : (($lesseq(0,$sum(X6,1)) & tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = X4) => ($lesseq(1,X6) => ! [X12 : map_int_lplist_treerp,X5 : $int] : (($lesseq(1,X5) & $lesseq(X5,X6)) => (! [X23 : $int] : (($lesseq(0,X23) & $less(X23,X5)) => all_trees1(X23,tb2t1(get(list(tree),int,t2tb3(X12),t2tb(X23))))) => (($lesseq(0,$sum(X6,1)) & $lesseq(0,X5) & $less(X5,$sum(X6,1))) => ! [X13 : map_int_lplist_treerp] : ((tb2t3(set(list(tree),int,t2tb3(X12),t2tb(X5),nil(tree))) = X13 & $lesseq(0,$sum(X6,1))) => ($lesseq(0,$difference(X5,1)) => ! [X19 : map_int_lplist_treerp,X0 : $int] : (($lesseq(X0,$difference(X5,1)) & $lesseq(0,X0)) => ((! [X23 : $int] : (($lesseq(0,X23) & $less(X23,X5)) => all_trees1(X23,tb2t1(get(list(tree),int,t2tb3(X19),t2tb(X23))))) & distinct(tree,get(list(tree),int,t2tb3(X19),t2tb(X5))) & ! [X8 : tree1] : (mem(tree,t2tb2(X8),get(list(tree),int,t2tb3(X19),t2tb(X5))) <=> ? [X7 : tree1,X22 : tree1] : (node1(X7,X22) = X8 & size1(X8) = X5 & $less(size1(X7),X0)))) => (($lesseq(0,X5) & $less(X5,$sum(X6,1)) & $lesseq(0,$sum(X6,1))) => (($less($difference($difference(X5,1),X0),$sum(X6,1)) & $lesseq(0,$difference($difference(X5,1),X0))) => (($lesseq(0,X0) & $less(X0,$sum(X6,1))) => ((all_trees1(X0,tb2t1(get(list(tree),int,t2tb3(X19),t2tb(X0)))) & all_trees1($difference($difference(X5,1),X0),tb2t1(get(list(tree),int,t2tb3(X19),t2tb($difference($difference(X5,1),X0))))) & $lesseq(0,$difference($difference(X5,1),X0)) & $lesseq(0,X0)) => ! [X20 : list_tree] : ((! [X8 : tree1] : (? [X7 : tree1,X22 : tree1] : (size1(X7) = X0 & size1(X22) = $difference($difference(X5,1),X0) & node1(X7,X22) = X8) <=> mem(tree,t2tb2(X8),t2tb1(X20))) & distinct(tree,t2tb1(X20))) => (($lesseq(0,X5) & $less(X5,$sum(X6,1))) => ! [X21 : map_int_lplist_treerp] : ((tb2t3(set(list(tree),int,t2tb3(X19),t2tb(X5),infix_plpl(tree,t2tb1(X20),get(list(tree),int,t2tb3(X19),t2tb(X5))))) = X21 & $lesseq(0,$sum(X6,1))) => ! [X8 : tree1] : (mem(tree,t2tb2(X8),get(list(tree),int,t2tb3(X21),t2tb(X5))) => ? [X7 : tree1,X22 : tree1] : (size1(X8) = X5 & $less(size1(X7),$sum(X0,1)) & node1(X7,X22) = X8))))))))))))))))))))))), 54.91/54.75 inference(negated_conjecture,[],[f29])). 54.91/54.75 tff(f29,conjecture,( 54.91/54.75 ! [X6 : $int] : ($lesseq(0,X6) => ($lesseq(0,$sum(X6,1)) => ($lesseq(0,$sum(X6,1)) => (($lesseq(0,0) & $less(0,$sum(X6,1))) => ! [X4 : map_int_lplist_treerp] : (($lesseq(0,$sum(X6,1)) & tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = X4) => ($lesseq(1,X6) => ! [X12 : map_int_lplist_treerp,X5 : $int] : (($lesseq(1,X5) & $lesseq(X5,X6)) => (! [X23 : $int] : (($lesseq(0,X23) & $less(X23,X5)) => all_trees1(X23,tb2t1(get(list(tree),int,t2tb3(X12),t2tb(X23))))) => (($lesseq(0,$sum(X6,1)) & $lesseq(0,X5) & $less(X5,$sum(X6,1))) => ! [X13 : map_int_lplist_treerp] : ((tb2t3(set(list(tree),int,t2tb3(X12),t2tb(X5),nil(tree))) = X13 & $lesseq(0,$sum(X6,1))) => ($lesseq(0,$difference(X5,1)) => ! [X19 : map_int_lplist_treerp,X0 : $int] : (($lesseq(X0,$difference(X5,1)) & $lesseq(0,X0)) => ((! [X23 : $int] : (($lesseq(0,X23) & $less(X23,X5)) => all_trees1(X23,tb2t1(get(list(tree),int,t2tb3(X19),t2tb(X23))))) & distinct(tree,get(list(tree),int,t2tb3(X19),t2tb(X5))) & ! [X8 : tree1] : (mem(tree,t2tb2(X8),get(list(tree),int,t2tb3(X19),t2tb(X5))) <=> ? [X7 : tree1,X22 : tree1] : (node1(X7,X22) = X8 & size1(X8) = X5 & $less(size1(X7),X0)))) => (($lesseq(0,X5) & $less(X5,$sum(X6,1)) & $lesseq(0,$sum(X6,1))) => (($less($difference($difference(X5,1),X0),$sum(X6,1)) & $lesseq(0,$difference($difference(X5,1),X0))) => (($lesseq(0,X0) & $less(X0,$sum(X6,1))) => ((all_trees1(X0,tb2t1(get(list(tree),int,t2tb3(X19),t2tb(X0)))) & all_trees1($difference($difference(X5,1),X0),tb2t1(get(list(tree),int,t2tb3(X19),t2tb($difference($difference(X5,1),X0))))) & $lesseq(0,$difference($difference(X5,1),X0)) & $lesseq(0,X0)) => ! [X20 : list_tree] : ((! [X8 : tree1] : (? [X7 : tree1,X22 : tree1] : (size1(X7) = X0 & size1(X22) = $difference($difference(X5,1),X0) & node1(X7,X22) = X8) <=> mem(tree,t2tb2(X8),t2tb1(X20))) & distinct(tree,t2tb1(X20))) => (($lesseq(0,X5) & $less(X5,$sum(X6,1))) => ! [X21 : map_int_lplist_treerp] : ((tb2t3(set(list(tree),int,t2tb3(X19),t2tb(X5),infix_plpl(tree,t2tb1(X20),get(list(tree),int,t2tb3(X19),t2tb(X5))))) = X21 & $lesseq(0,$sum(X6,1))) => ! [X8 : tree1] : (mem(tree,t2tb2(X8),get(list(tree),int,t2tb3(X21),t2tb(X5))) => ? [X7 : tree1,X22 : tree1] : (size1(X8) = X5 & $less(size1(X7),$sum(X0,1)) & node1(X7,X22) = X8))))))))))))))))))))))), 54.91/54.75 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wP_parameter_all_trees)). 54.91/54.75 tff(f6825,plain,( 54.91/54.75 ( ! [X8:tree1] : (size1(X8) = $sum($sum(size1(sK10(X8)),sK3),$uminus(sK6)) | ~mem(tree,t2tb2(X8),t2tb1(sK7))) )), 54.91/54.75 inference(evaluation,[],[f6824])). 54.91/54.75 tff(f6824,plain,( 54.91/54.75 ( ! [X8:tree1] : (size1(X8) = $sum($sum(1,size1(sK10(X8))),$sum($sum(sK3,-1),$uminus(sK6))) | ~mem(tree,t2tb2(X8),t2tb1(sK7))) )), 54.91/54.75 inference(duplicate_literal_removal,[],[f6820])). 54.91/54.75 tff(f6820,plain,( 54.91/54.75 ( ! [X8:tree1] : (size1(X8) = $sum($sum(1,size1(sK10(X8))),$sum($sum(sK3,-1),$uminus(sK6))) | ~mem(tree,t2tb2(X8),t2tb1(sK7)) | ~mem(tree,t2tb2(X8),t2tb1(sK7))) )), 54.91/54.75 inference(superposition,[],[f3884,f1064])). 54.91/54.75 tff(f1064,plain,( 54.91/54.75 ( ! [X0:tree1] : (size1(sK11(X0)) = $sum($sum(sK3,-1),$uminus(sK6)) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) )), 54.91/54.75 inference(equality_resolution,[],[f1063])). 54.91/54.75 tff(f1063,plain,( 54.91/54.75 ( ! [X0:$int,X1:tree1] : (sK3 != X0 | size1(sK11(X1)) = $sum($sum(X0,-1),$uminus(sK6)) | ~mem(tree,t2tb2(X1),t2tb1(sK7))) )), 54.91/54.75 inference(equality_resolution,[],[f849])). 54.91/54.75 tff(f849,plain,( 54.91/54.75 ( ! [X2:tree1,X0:$int,X1:$int] : (sK6 != X1 | sK3 != X0 | size1(sK11(X2)) = $sum($sum(X0,-1),$uminus(X1)) | ~mem(tree,t2tb2(X2),t2tb1(sK7))) )), 54.91/54.75 inference(equality_resolution,[],[f419])). 54.91/54.75 tff(f419,plain,( 54.91/54.75 ( ! [X14:$int,X12:tree1,X15:$int,X13:$int] : (size1(sK11(X12)) != X13 | sK3 != X14 | sK6 != X15 | $sum($sum(X14,-1),$uminus(X15)) = X13 | ~mem(tree,t2tb2(X12),t2tb1(sK7))) )), 54.91/54.75 inference(evaluation,[],[f376])). 54.91/54.75 tff(f376,plain,( 54.91/54.75 ( ! [X14:$int,X12:tree1,X15:$int,X13:$int] : (size1(sK11(X12)) != X13 | sK3 != X14 | sK6 != X15 | $sum($sum(X14,$uminus(1)),$uminus(X15)) = X13 | ~mem(tree,t2tb2(X12),t2tb1(sK7))) )), 54.91/54.75 inference(theory_flattening,[],[f253])). 54.91/54.75 tff(f253,plain,( 54.91/54.75 ( ! [X12:tree1] : (size1(sK11(X12)) = $sum($sum(sK3,$uminus(1)),$uminus(sK6)) | ~mem(tree,t2tb2(X12),t2tb1(sK7))) )), 54.91/54.75 inference(cnf_transformation,[],[f198])). 54.91/54.75 tff(f3884,plain,( 54.91/54.75 ( ! [X0:tree1] : (size1(X0) = $sum($sum(1,size1(sK10(X0))),size1(sK11(X0))) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) )), 54.91/54.75 inference(equality_resolution,[],[f1792])). 54.91/54.75 tff(f1792,plain,( 54.91/54.75 ( ! [X0:tree1,X1:$int] : (size1(X0) != X1 | $sum($sum(1,size1(sK10(X0))),size1(sK11(X0))) = X1 | ~mem(tree,t2tb2(X0),t2tb1(sK7))) )), 54.91/54.75 inference(equality_resolution,[],[f1127])). 54.91/54.75 tff(f1127,plain,( 54.91/54.75 ( ! [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))) )), 54.91/54.75 inference(equality_resolution,[],[f574])). 54.91/54.75 tff(f574,plain,( 54.91/54.75 ( ! [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))) )), 54.91/54.75 inference(superposition,[],[f407,f252])). 54.91/54.75 tff(f252,plain,( 54.91/54.75 ( ! [X12:tree1] : (node1(sK10(X12),sK11(X12)) = X12 | ~mem(tree,t2tb2(X12),t2tb1(sK7))) )), 54.91/54.75 inference(cnf_transformation,[],[f198])). 54.91/54.75 tff(f407,plain,( 54.91/54.75 ( ! [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) )), 54.91/54.75 inference(theory_flattening,[],[f264])). 54.91/54.75 tff(f264,plain,( 54.91/54.75 ( ! [X0:tree1,X1:tree1] : (size1(node1(X0,X1)) = $sum($sum(1,size1(X0)),size1(X1))) )), 54.91/54.75 inference(cnf_transformation,[],[f86])). 54.91/54.75 tff(f86,plain,( 54.91/54.75 ! [X0 : tree1,X1 : tree1] : size1(node1(X0,X1)) = $sum($sum(1,size1(X0)),size1(X1)) & size1(empty1) = 0), 54.91/54.75 inference(rectify,[],[f3])). 54.91/54.75 tff(f3,axiom,( 54.91/54.75 ! [X2 : tree1,X3 : tree1] : size1(node1(X2,X3)) = $sum($sum(1,size1(X2)),size1(X3)) & size1(empty1) = 0), 54.91/54.75 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',size_def)). 54.91/54.75 tff(f10541,plain,( 54.91/54.75 spl22_260 | ~spl22_263 | ~spl22_90 | ~spl22_234), 54.91/54.75 inference(avatar_split_clause,[],[f10420,f10405,f2317,f10539,f10533])). 54.91/54.75 tff(f10533,plain,( 54.91/54.75 spl22_260 <=> ! [X13 : tree1] : ~mem(tree,t2tb2(node1(X13,sK12(node_proj_21(sK9)))),t2tb1(sK7))), 54.91/54.75 introduced(avatar_definition,[new_symbols(naming,[spl22_260])])). 54.91/54.75 tff(f10539,plain,( 54.91/54.75 spl22_263 <=> size1(node_proj_11(node_proj_21(sK9))) != sK6), 54.91/54.75 introduced(avatar_definition,[new_symbols(naming,[spl22_263])])). 54.91/54.75 tff(f2317,plain,( 54.91/54.75 spl22_90 <=> ! [X22 : $int,X21 : $int] : ($sum($sum(X21,-1),$uminus(X22)) != sK6 | sK6 != X22 | sK3 != X21)), 54.91/54.75 introduced(avatar_definition,[new_symbols(naming,[spl22_90])])). 54.91/54.75 tff(f10405,plain,( 54.91/54.75 spl22_234 <=> size1(node_proj_11(node_proj_21(sK9))) = size1(sK12(node_proj_21(sK9)))), 54.91/54.75 introduced(avatar_definition,[new_symbols(naming,[spl22_234])])). 54.91/54.75 tff(f10420,plain,( 54.91/54.75 ( ! [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_234)), 54.91/54.75 inference(superposition,[],[f2327,f10406])). 54.91/54.75 tff(f10406,plain,( 54.91/54.75 size1(node_proj_11(node_proj_21(sK9))) = size1(sK12(node_proj_21(sK9))) | ~spl22_234), 54.91/54.75 inference(avatar_component_clause,[],[f10405])). 54.91/54.75 tff(f2327,plain,( 54.91/54.75 ( ! [X0:tree1,X1:tree1] : (size1(X0) != sK6 | ~mem(tree,t2tb2(node1(X1,X0)),t2tb1(sK7))) ) | ~spl22_90), 54.91/54.75 inference(trivial_inequality_removal,[],[f2320])). 54.91/54.75 tff(f2320,plain,( 54.91/54.75 ( ! [X0:tree1,X1:tree1] : (size1(X0) != sK6 | sK6 != sK6 | sK3 != sK3 | ~mem(tree,t2tb2(node1(X1,X0)),t2tb1(sK7))) ) | ~spl22_90), 54.91/54.75 inference(superposition,[],[f2318,f1198])). 54.91/54.75 tff(f1198,plain,( 54.91/54.75 ( ! [X0:tree1,X1:tree1] : (size1(X1) = $sum($sum(sK3,-1),$uminus(sK6)) | ~mem(tree,t2tb2(node1(X0,X1)),t2tb1(sK7))) )), 54.91/54.75 inference(superposition,[],[f1160,f291])). 54.91/54.75 tff(f291,plain,( 54.91/54.75 ( ! [X0:tree1,X1:tree1] : (node_proj_21(node1(X0,X1)) = X1) )), 54.91/54.75 inference(cnf_transformation,[],[f107])). 54.91/54.75 tff(f107,plain,( 54.91/54.75 ! [X0 : tree1,X1 : tree1] : node_proj_21(node1(X0,X1)) = X1), 54.91/54.75 inference(rectify,[],[f44])). 54.91/54.75 tff(f44,axiom,( 54.91/54.75 ! [X1 : tree1,X15 : tree1] : node_proj_21(node1(X1,X15)) = X15), 54.91/54.75 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',node_proj_2_def1)). 54.91/54.75 tff(f1160,plain,( 54.91/54.75 ( ! [X0:tree1] : (size1(node_proj_21(X0)) = $sum($sum(sK3,-1),$uminus(sK6)) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) )), 54.91/54.75 inference(superposition,[],[f1079,f276])). 54.91/54.75 tff(f1079,plain,( 54.91/54.75 ( ! [X1:uni] : (size1(node_proj_21(tb2t2(X1))) = $sum($sum(sK3,-1),$uminus(sK6)) | ~mem(tree,X1,t2tb1(sK7))) )), 54.91/54.75 inference(duplicate_literal_removal,[],[f1078])). 54.91/54.75 tff(f1078,plain,( 54.91/54.75 ( ! [X1:uni] : (~mem(tree,X1,t2tb1(sK7)) | size1(node_proj_21(tb2t2(X1))) = $sum($sum(sK3,-1),$uminus(sK6)) | ~mem(tree,X1,t2tb1(sK7))) )), 54.91/54.75 inference(forward_demodulation,[],[f1066,f274])). 54.91/54.75 tff(f1066,plain,( 54.91/54.75 ( ! [X1:uni] : (size1(node_proj_21(tb2t2(X1))) = $sum($sum(sK3,-1),$uminus(sK6)) | ~mem(tree,t2tb2(tb2t2(X1)),t2tb1(sK7)) | ~mem(tree,X1,t2tb1(sK7))) )), 54.91/54.75 inference(superposition,[],[f1064,f593])). 54.91/54.75 tff(f593,plain,( 54.91/54.75 ( ! [X0:uni] : (node_proj_21(tb2t2(X0)) = sK11(tb2t2(X0)) | ~mem(tree,X0,t2tb1(sK7))) )), 54.91/54.75 inference(superposition,[],[f569,f274])). 54.91/54.75 tff(f569,plain,( 54.91/54.75 ( ! [X1:tree1] : (~mem(tree,t2tb2(X1),t2tb1(sK7)) | node_proj_21(X1) = sK11(X1)) )), 54.91/54.75 inference(superposition,[],[f291,f252])). 54.91/54.75 tff(f2318,plain,( 54.91/54.75 ( ! [X21:$int,X22:$int] : ($sum($sum(X21,-1),$uminus(X22)) != sK6 | sK6 != X22 | sK3 != X21) ) | ~spl22_90), 54.91/54.75 inference(avatar_component_clause,[],[f2317])). 54.91/54.75 tff(f10530,plain,( 54.91/54.75 ~spl22_257 | spl22_258 | ~spl22_234), 54.91/54.75 inference(avatar_split_clause,[],[f10421,f10405,f10528,f10525])). 54.91/54.75 tff(f10525,plain,( 54.91/54.75 spl22_257 <=> ~mem(tree,t2tb2(sK12(node_proj_21(sK9))),t2tb1(sK7))), 54.91/54.75 introduced(avatar_definition,[new_symbols(naming,[spl22_257])])). 54.91/54.75 tff(f10528,plain,( 54.91/54.75 spl22_258 <=> ! [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)), 54.91/54.75 introduced(avatar_definition,[new_symbols(naming,[spl22_258])])). 54.91/54.75 tff(f10421,plain,( 54.91/54.75 ( ! [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_234), 54.91/54.75 inference(superposition,[],[f4410,f10406])). 54.91/54.76 tff(f4410,plain,( 54.91/54.76 ( ! [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))) )), 54.91/54.76 inference(global_subsumption,[],[f4316])). 54.91/54.76 tff(f4316,plain,( 54.91/54.76 ( ! [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))) )), 54.91/54.76 inference(forward_demodulation,[],[f4310,f276])). 54.91/54.76 tff(f4310,plain,( 54.91/54.76 ( ! [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) )), 54.91/54.76 inference(superposition,[],[f1800,f276])). 54.91/54.76 tff(f1800,plain,( 54.91/54.76 ( ! [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) )), 54.91/54.76 inference(duplicate_literal_removal,[],[f1799])). 54.91/54.76 tff(f1799,plain,( 54.91/54.76 ( ! [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))) )), 54.91/54.76 inference(forward_demodulation,[],[f1781,f274])). 54.91/54.76 tff(f1781,plain,( 54.91/54.76 ( ! [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))) )), 54.91/54.76 inference(superposition,[],[f1127,f521])). 54.91/54.76 tff(f10519,plain,( 54.91/54.76 spl22_248 | spl22_250 | spl22_252 | ~spl22_255 | ~spl22_234), 54.91/54.76 inference(avatar_split_clause,[],[f10416,f10405,f10517,f10511,f10505,f10502])). 54.91/54.76 tff(f10502,plain,( 54.91/54.76 spl22_248 <=> empty1 = sK12(node_proj_21(sK9))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_248])])). 54.91/54.76 tff(f10505,plain,( 54.91/54.76 spl22_250 <=> ! [X8 : $int] : (sK6 != X8 | ~$less(size1(node_proj_11(sK12(node_proj_21(sK9)))),X8))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_250])])). 54.91/54.76 tff(f10511,plain,( 54.91/54.76 spl22_252 <=> 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)))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_252])])). 54.91/54.76 tff(f10517,plain,( 54.91/54.76 spl22_255 <=> size1(node_proj_11(node_proj_21(sK9))) != sK3), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_255])])). 54.91/54.76 tff(f10416,plain,( 54.91/54.76 ( ! [X8:$int] : (size1(node_proj_11(node_proj_21(sK9))) != sK3 | 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))) | sK6 != X8 | ~$less(size1(node_proj_11(sK12(node_proj_21(sK9)))),X8) | empty1 = sK12(node_proj_21(sK9))) ) | ~spl22_234), 54.91/54.76 inference(superposition,[],[f1235,f10406])). 54.91/54.76 tff(f1235,plain,( 54.91/54.76 ( ! [X0:tree1,X1:$int] : (size1(X0) != sK3 | mem(tree,t2tb2(node1(node_proj_11(X0),node_proj_21(X0))),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | sK6 != X1 | ~$less(size1(node_proj_11(X0)),X1) | empty1 = X0) )), 54.91/54.76 inference(equality_resolution,[],[f887])). 54.91/54.76 tff(f887,plain,( 54.91/54.76 ( ! [X4:$int,X5:$int,X3:tree1] : (size1(node_proj_11(X3)) != X4 | mem(tree,t2tb2(node1(node_proj_11(X3),node_proj_21(X3))),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | size1(X3) != sK3 | sK6 != X5 | ~$less(X4,X5) | empty1 = X3) )), 54.91/54.76 inference(superposition,[],[f389,f285])). 54.91/54.76 tff(f285,plain,( 54.91/54.76 ( ! [X0:tree1] : (node1(node_proj_11(X0),node_proj_21(X0)) = X0 | empty1 = X0) )), 54.91/54.76 inference(cnf_transformation,[],[f102])). 54.91/54.76 tff(f102,plain,( 54.91/54.76 ! [X0 : tree1] : (node1(node_proj_11(X0),node_proj_21(X0)) = X0 | empty1 = X0)), 54.91/54.76 inference(rectify,[],[f46])). 54.91/54.76 tff(f46,axiom,( 54.91/54.76 ! [X1 : tree1] : (node1(node_proj_11(X1),node_proj_21(X1)) = X1 | empty1 = X1)), 54.91/54.76 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tree_inversion1)). 54.91/54.76 tff(f389,plain,( 54.91/54.76 ( ! [X21:$int,X19:tree1,X22:$int,X20:tree1] : (size1(node1(X19,X20)) != sK3 | mem(tree,t2tb2(node1(X19,X20)),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | size1(X19) != X21 | sK6 != X22 | ~$less(X21,X22)) )), 54.91/54.76 inference(theory_flattening,[],[f367])). 54.91/54.76 tff(f367,plain,( 54.91/54.76 ( ! [X19:tree1,X20:tree1] : (mem(tree,t2tb2(node1(X19,X20)),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | size1(node1(X19,X20)) != sK3 | ~$less(size1(X19),sK6)) )), 54.91/54.76 inference(equality_resolution,[],[f236])). 54.91/54.76 tff(f236,plain,( 54.91/54.76 ( ! [X19:tree1,X20:tree1,X18:tree1] : (mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | node1(X19,X20) != X18 | size1(X18) != sK3 | ~$less(size1(X19),sK6)) )), 54.91/54.76 inference(cnf_transformation,[],[f198])). 54.91/54.76 tff(f10454,plain,( 54.91/54.76 ~spl22_245 | spl22_246 | ~spl22_234), 54.91/54.76 inference(avatar_split_clause,[],[f10412,f10405,f10452,f10449])). 54.91/54.76 tff(f10449,plain,( 54.91/54.76 spl22_245 <=> ~mem(tree,t2tb2(node_proj_21(sK9)),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_245])])). 54.91/54.76 tff(f10452,plain,( 54.91/54.76 spl22_246 <=> ! [X1 : $int,X0 : $int] : (size1(node_proj_11(node_proj_21(sK9))) != X0 | $less(X0,X1) | sK6 != X1)), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_246])])). 54.91/54.76 tff(f10412,plain,( 54.91/54.76 ( ! [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_234), 54.91/54.76 inference(superposition,[],[f390,f10406])). 54.91/54.76 tff(f390,plain,( 54.91/54.76 ( ! [X19:$int,X20:$int,X18:tree1] : (size1(sK12(X18)) != X19 | sK6 != X20 | $less(X19,X20) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) )), 54.91/54.76 inference(theory_flattening,[],[f233])). 54.91/54.76 tff(f233,plain,( 54.91/54.76 ( ! [X18:tree1] : ($less(size1(sK12(X18)),sK6) | ~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) )), 54.91/54.76 inference(cnf_transformation,[],[f198])). 54.91/54.76 tff(f10443,plain,( 54.91/54.76 ~spl22_243 | ~spl22_240), 54.91/54.76 inference(avatar_split_clause,[],[f10436,f10432,f10441])). 54.91/54.76 tff(f10441,plain,( 54.91/54.76 spl22_243 <=> ~$less(0,size1(node_proj_11(node_proj_21(sK9))))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_243])])). 54.91/54.76 tff(f10432,plain,( 54.91/54.76 spl22_240 <=> ! [X3 : $int] : (size1(node_proj_11(node_proj_21(sK9))) != X3 | ~$less(0,X3))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_240])])). 54.91/54.76 tff(f10436,plain,( 54.91/54.76 ~$less(0,size1(node_proj_11(node_proj_21(sK9)))) | ~spl22_240), 54.91/54.76 inference(equality_resolution,[],[f10433])). 54.91/54.76 tff(f10433,plain,( 54.91/54.76 ( ! [X3:$int] : (size1(node_proj_11(node_proj_21(sK9))) != X3 | ~$less(0,X3)) ) | ~spl22_240), 54.91/54.76 inference(avatar_component_clause,[],[f10432])). 54.91/54.76 tff(f10434,plain,( 54.91/54.76 spl22_238 | spl22_240 | ~spl22_234), 54.91/54.76 inference(avatar_split_clause,[],[f10414,f10405,f10432,f10429])). 54.91/54.76 tff(f10429,plain,( 54.91/54.76 spl22_238 <=> node1(sK14(sK12(node_proj_21(sK9))),sK15(sK12(node_proj_21(sK9)))) = sK12(node_proj_21(sK9))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_238])])). 54.91/54.76 tff(f10414,plain,( 54.91/54.76 ( ! [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_234), 54.91/54.76 inference(superposition,[],[f412,f10406])). 54.91/54.76 tff(f412,plain,( 54.91/54.76 ( ! [X0:tree1,X1:$int] : (size1(X0) != X1 | node1(sK14(X0),sK15(X0)) = X0 | ~$less(0,X1)) )), 54.91/54.76 inference(theory_flattening,[],[f287])). 54.91/54.76 tff(f287,plain,( 54.91/54.76 ( ! [X0:tree1] : (node1(sK14(X0),sK15(X0)) = X0 | ~$less(0,size1(X0))) )), 54.91/54.76 inference(cnf_transformation,[],[f200])). 54.91/54.76 tff(f200,plain,( 54.91/54.76 ! [X0 : tree1] : ((node1(sK14(X0),sK15(X0)) = X0 & $less(size1(sK14(X0)),size1(X0))) | ~$less(0,size1(X0)))), 54.91/54.76 inference(skolemisation,[status(esa),new_symbols(skolem,[sK14,sK15])],[f160,f199])). 54.91/54.76 tff(f199,plain,( 54.91/54.76 ! [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))))), 54.91/54.76 introduced(choice_axiom,[])). 54.91/54.76 tff(f160,plain,( 54.91/54.76 ! [X0 : tree1] : (? [X1 : tree1,X2 : tree1] : (node1(X1,X2) = X0 & $less(size1(X1),size1(X0))) | ~$less(0,size1(X0)))), 54.91/54.76 inference(ennf_transformation,[],[f103])). 54.91/54.76 tff(f103,plain,( 54.91/54.76 ! [X0 : tree1] : ($less(0,size1(X0)) => ? [X1 : tree1,X2 : tree1] : (node1(X1,X2) = X0 & $less(size1(X1),size1(X0))))), 54.91/54.76 inference(rectify,[],[f56])). 54.91/54.76 tff(f56,axiom,( 54.91/54.76 ! [X8 : tree1] : ($less(0,size1(X8)) => ? [X7 : tree1,X22 : tree1] : (node1(X7,X22) = X8 & $less(size1(X7),size1(X8))))), 54.91/54.76 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',size_left)). 54.91/54.76 tff(f10410,plain,( 54.91/54.76 spl22_234 | spl22_236 | ~spl22_226), 54.91/54.76 inference(avatar_split_clause,[],[f10374,f10282,f10408,f10405])). 54.91/54.76 tff(f10408,plain,( 54.91/54.76 spl22_236 <=> ! [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)))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_236])])). 54.91/54.76 tff(f10282,plain,( 54.91/54.76 spl22_226 <=> node1(node_proj_11(node_proj_21(sK9)),node_proj_21(node_proj_21(sK9))) = node_proj_21(sK9)), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_226])])). 54.91/54.76 tff(f10374,plain,( 54.91/54.76 ( ! [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_226), 54.91/54.76 inference(inner_rewriting,[],[f10366])). 54.91/54.76 tff(f10366,plain,( 54.91/54.76 ( ! [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_226), 54.91/54.76 inference(superposition,[],[f10318,f933])). 54.91/54.76 tff(f933,plain,( 54.91/54.76 ( ! [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)) )), 54.91/54.76 inference(global_subsumption,[],[f237,f931])). 54.91/54.76 tff(f931,plain,( 54.91/54.76 ( ! [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)))) )), 54.91/54.76 inference(resolution,[],[f640,f334])). 54.91/54.76 tff(f334,plain,( 54.91/54.76 ( ! [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)) )), 54.91/54.76 inference(cnf_transformation,[],[f209])). 54.91/54.76 tff(f209,plain,( 54.91/54.76 ! [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))), 54.91/54.76 inference(skolemisation,[status(esa),new_symbols(skolem,[sK19])],[f167,f208])). 54.91/54.76 tff(f208,plain,( 54.91/54.76 ! [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))))), 54.91/54.76 introduced(choice_axiom,[])). 54.91/54.76 tff(f167,plain,( 54.91/54.76 ! [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))), 54.91/54.76 inference(flattening,[],[f166])). 54.91/54.76 tff(f166,plain,( 54.91/54.76 ! [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))), 54.91/54.76 inference(ennf_transformation,[],[f133])). 54.91/54.76 tff(f133,plain,( 54.91/54.76 ! [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)))))), 54.91/54.76 inference(rectify,[],[f50])). 54.91/54.76 tff(f50,axiom,( 54.91/54.76 ! [X4 : ty,X27 : uni,X18 : uni] : (distinct(X4,X27) => (distinct(X4,X18) => (! [X2 : uni] : (sort1(X4,X2) => (mem(X4,X2,X27) => ~mem(X4,X2,X18))) => distinct(X4,infix_plpl(X4,X27,X18)))))), 54.91/54.76 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distinct_append)). 54.91/54.76 tff(f640,plain,( 54.91/54.76 ( ! [X0:uni] : (~mem(tree,X0,get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | node1(sK12(tb2t2(X0)),sK13(tb2t2(X0))) = tb2t2(X0)) )), 54.91/54.76 inference(superposition,[],[f235,f274])). 54.91/54.76 tff(f235,plain,( 54.91/54.76 ( ! [X18:tree1] : (~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | node1(sK12(X18),sK13(X18)) = X18) )), 54.91/54.76 inference(cnf_transformation,[],[f198])). 54.91/54.76 tff(f237,plain,( 54.91/54.76 distinct(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))), 54.91/54.76 inference(cnf_transformation,[],[f198])). 54.91/54.76 tff(f10318,plain,( 54.91/54.76 ( ! [X0:tree1,X1:tree1] : (node1(X0,X1) != node_proj_21(sK9) | size1(X0) = size1(node_proj_11(node_proj_21(sK9)))) ) | ~spl22_226), 54.91/54.76 inference(superposition,[],[f315,f10283])). 54.91/54.76 tff(f10283,plain,( 54.91/54.76 node1(node_proj_11(node_proj_21(sK9)),node_proj_21(node_proj_21(sK9))) = node_proj_21(sK9) | ~spl22_226), 54.91/54.76 inference(avatar_component_clause,[],[f10282])). 54.91/54.76 tff(f315,plain,( 54.91/54.76 ( ! [X2:tree1,X0:tree1,X3:tree1,X1:tree1] : (node1(X0,X2) != node1(X1,X3) | size1(X0) = size1(X1)) )), 54.91/54.76 inference(cnf_transformation,[],[f164])). 54.91/54.76 tff(f164,plain,( 54.91/54.76 ! [X0 : tree1,X1 : tree1] : (! [X2 : tree1,X3 : tree1] : node1(X0,X2) != node1(X1,X3) | size1(X0) = size1(X1))), 54.91/54.76 inference(ennf_transformation,[],[f118])). 54.91/54.76 tff(f118,plain,( 54.91/54.76 ! [X0 : tree1,X1 : tree1] : (size1(X0) != size1(X1) => ! [X2 : tree1,X3 : tree1] : node1(X0,X2) != node1(X1,X3))), 54.91/54.76 inference(rectify,[],[f68])). 54.91/54.76 tff(f68,axiom,( 54.91/54.76 ! [X27 : tree1,X18 : tree1] : (size1(X18) != size1(X27) => ! [X28 : tree1,X29 : tree1] : node1(X18,X29) != node1(X27,X28))), 54.91/54.76 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tree_diff)). 54.91/54.76 tff(f10398,plain,( 54.91/54.76 ~spl22_233 | ~spl22_230), 54.91/54.76 inference(avatar_split_clause,[],[f10391,f10387,f10396])). 54.91/54.76 tff(f10396,plain,( 54.91/54.76 spl22_233 <=> ~mem(tree,t2tb2(node_proj_21(sK9)),t2tb1(sK7))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_233])])). 54.91/54.76 tff(f10387,plain,( 54.91/54.76 spl22_230 <=> ! [X13 : uni] : (node_proj_21(sK9) != tb2t2(X13) | ~mem(tree,X13,t2tb1(sK7)))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_230])])). 54.91/54.76 tff(f10391,plain,( 54.91/54.76 ~mem(tree,t2tb2(node_proj_21(sK9)),t2tb1(sK7)) | ~spl22_230), 54.91/54.76 inference(equality_resolution,[],[f10390])). 54.91/54.76 tff(f10390,plain,( 54.91/54.76 ( ! [X0:tree1] : (node_proj_21(sK9) != X0 | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | ~spl22_230), 54.91/54.76 inference(superposition,[],[f10388,f276])). 54.91/54.76 tff(f10388,plain,( 54.91/54.76 ( ! [X13:uni] : (node_proj_21(sK9) != tb2t2(X13) | ~mem(tree,X13,t2tb1(sK7))) ) | ~spl22_230), 54.91/54.76 inference(avatar_component_clause,[],[f10387])). 54.91/54.76 tff(f10389,plain,( 54.91/54.76 spl22_228 | spl22_230 | ~spl22_226), 54.91/54.76 inference(avatar_split_clause,[],[f10347,f10282,f10387,f10384])). 54.91/54.76 tff(f10384,plain,( 54.91/54.76 spl22_228 <=> size1(node_proj_11(node_proj_21(sK9))) = size1(sK10(node_proj_21(sK9)))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_228])])). 54.91/54.76 tff(f10347,plain,( 54.91/54.76 ( ! [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_226), 54.91/54.76 inference(inner_rewriting,[],[f10325])). 54.91/54.76 tff(f10325,plain,( 54.91/54.76 ( ! [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_226), 54.91/54.76 inference(superposition,[],[f649,f10283])). 54.91/54.76 tff(f649,plain,( 54.91/54.76 ( ! [X4:tree1,X5:tree1,X3:uni] : (node1(X4,X5) != tb2t2(X3) | size1(X4) = size1(sK10(tb2t2(X3))) | ~mem(tree,X3,t2tb1(sK7))) )), 54.91/54.76 inference(superposition,[],[f315,f618])). 54.91/54.76 tff(f618,plain,( 54.91/54.76 ( ! [X1:uni] : (node1(sK10(tb2t2(X1)),node_proj_21(tb2t2(X1))) = tb2t2(X1) | ~mem(tree,X1,t2tb1(sK7))) )), 54.91/54.76 inference(duplicate_literal_removal,[],[f617])). 54.91/54.76 tff(f617,plain,( 54.91/54.76 ( ! [X1:uni] : (~mem(tree,X1,t2tb1(sK7)) | node1(sK10(tb2t2(X1)),node_proj_21(tb2t2(X1))) = tb2t2(X1) | ~mem(tree,X1,t2tb1(sK7))) )), 54.91/54.76 inference(forward_demodulation,[],[f616,f274])). 54.91/54.76 tff(f616,plain,( 54.91/54.76 ( ! [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))) )), 54.91/54.76 inference(superposition,[],[f252,f593])). 54.91/54.76 tff(f10284,plain,( 54.91/54.76 ~spl22_145 | spl22_226 | ~spl22_152 | ~spl22_212 | ~spl22_220 | ~spl22_222), 54.91/54.76 inference(avatar_split_clause,[],[f10197,f10059,f10052,f9941,f7246,f10282,f7168])). 54.91/54.76 tff(f7168,plain,( 54.91/54.76 spl22_145 <=> ~mem(tree,t2tb2(sK9),t2tb1(sK7))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_145])])). 54.91/54.76 tff(f7246,plain,( 54.91/54.76 spl22_152 <=> node_proj_21(sK9) = sK11(sK9)), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_152])])). 54.91/54.76 tff(f9941,plain,( 54.91/54.76 spl22_212 <=> ! [X6 : tree1] : (node1(sK14(sK11(X6)),sK15(sK11(X6))) = sK11(X6) | ~mem(tree,t2tb2(X6),t2tb1(sK7)))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_212])])). 54.91/54.76 tff(f10052,plain,( 54.91/54.76 spl22_220 <=> node_proj_21(node_proj_21(sK9)) = sK15(node_proj_21(sK9))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_220])])). 54.91/54.76 tff(f10059,plain,( 54.91/54.76 spl22_222 <=> node_proj_11(node_proj_21(sK9)) = sK14(node_proj_21(sK9))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_222])])). 54.91/54.76 tff(f10197,plain,( 54.91/54.76 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_152 | ~spl22_212 | ~spl22_220 | ~spl22_222)), 54.91/54.76 inference(forward_demodulation,[],[f10196,f10060])). 54.91/54.76 tff(f10060,plain,( 54.91/54.76 node_proj_11(node_proj_21(sK9)) = sK14(node_proj_21(sK9)) | ~spl22_222), 54.91/54.76 inference(avatar_component_clause,[],[f10059])). 54.91/54.76 tff(f10196,plain,( 54.91/54.76 node1(sK14(node_proj_21(sK9)),node_proj_21(node_proj_21(sK9))) = node_proj_21(sK9) | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_152 | ~spl22_212 | ~spl22_220)), 54.91/54.76 inference(forward_demodulation,[],[f9961,f10053])). 54.91/54.76 tff(f10053,plain,( 54.91/54.76 node_proj_21(node_proj_21(sK9)) = sK15(node_proj_21(sK9)) | ~spl22_220), 54.91/54.76 inference(avatar_component_clause,[],[f10052])). 54.91/54.76 tff(f9961,plain,( 54.91/54.76 node1(sK14(node_proj_21(sK9)),sK15(node_proj_21(sK9))) = node_proj_21(sK9) | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_152 | ~spl22_212)), 54.91/54.76 inference(superposition,[],[f9942,f7247])). 54.91/54.76 tff(f7247,plain,( 54.91/54.76 node_proj_21(sK9) = sK11(sK9) | ~spl22_152), 54.91/54.76 inference(avatar_component_clause,[],[f7246])). 54.91/54.76 tff(f9942,plain,( 54.91/54.76 ( ! [X6:tree1] : (node1(sK14(sK11(X6)),sK15(sK11(X6))) = sK11(X6) | ~mem(tree,t2tb2(X6),t2tb1(sK7))) ) | ~spl22_212), 54.91/54.76 inference(avatar_component_clause,[],[f9941])). 54.91/54.76 tff(f10183,plain,( 54.91/54.76 spl22_142 | spl22_224), 54.91/54.76 inference(avatar_split_clause,[],[f1077,f10181,f7115])). 54.91/54.76 tff(f7115,plain,( 54.91/54.76 spl22_142 <=> ! [X4 : tree1] : ~mem(tree,t2tb2(X4),t2tb1(sK7))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_142])])). 54.91/54.76 tff(f10181,plain,( 54.91/54.76 spl22_224 <=> ! [X1 : $int,X3 : $int,X2 : $int] : ($sum($sum(sK3,-1),$uminus(sK6)) != X1 | sK3 != X2 | $sum($sum(X2,-1),$uminus(X3)) = X1 | sK6 != X3)), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_224])])). 54.91/54.76 tff(f1077,plain,( 54.91/54.76 ( ! [X2:$int,X0:tree1,X3:$int,X1:$int] : ($sum($sum(sK3,-1),$uminus(sK6)) != X1 | sK3 != X2 | sK6 != X3 | $sum($sum(X2,-1),$uminus(X3)) = X1 | ~mem(tree,t2tb2(X0),t2tb1(sK7))) )), 54.91/54.76 inference(duplicate_literal_removal,[],[f1068])). 54.91/54.76 tff(f1068,plain,( 54.91/54.76 ( ! [X2:$int,X0:tree1,X3:$int,X1:$int] : ($sum($sum(sK3,-1),$uminus(sK6)) != X1 | sK3 != X2 | sK6 != X3 | $sum($sum(X2,-1),$uminus(X3)) = X1 | ~mem(tree,t2tb2(X0),t2tb1(sK7)) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) )), 54.91/54.76 inference(superposition,[],[f419,f1064])). 54.91/54.76 tff(f10061,plain,( 54.91/54.76 ~spl22_145 | spl22_222 | ~spl22_152 | ~spl22_212), 54.91/54.76 inference(avatar_split_clause,[],[f10042,f9941,f7246,f10059,f7168])). 54.91/54.76 tff(f10042,plain,( 54.91/54.76 node_proj_11(node_proj_21(sK9)) = sK14(node_proj_21(sK9)) | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_152 | ~spl22_212)), 54.91/54.76 inference(superposition,[],[f9964,f7247])). 54.91/54.76 tff(f9964,plain,( 54.91/54.76 ( ! [X2:tree1] : (node_proj_11(sK11(X2)) = sK14(sK11(X2)) | ~mem(tree,t2tb2(X2),t2tb1(sK7))) ) | ~spl22_212), 54.91/54.76 inference(superposition,[],[f292,f9942])). 54.91/54.76 tff(f292,plain,( 54.91/54.76 ( ! [X0:tree1,X1:tree1] : (node_proj_11(node1(X0,X1)) = X0) )), 54.91/54.76 inference(cnf_transformation,[],[f108])). 54.91/54.76 tff(f108,plain,( 54.91/54.76 ! [X0 : tree1,X1 : tree1] : node_proj_11(node1(X0,X1)) = X0), 54.91/54.76 inference(rectify,[],[f31])). 54.91/54.76 tff(f31,axiom,( 54.91/54.76 ! [X1 : tree1,X15 : tree1] : node_proj_11(node1(X1,X15)) = X1), 54.91/54.76 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',node_proj_1_def1)). 54.91/54.76 tff(f10054,plain,( 54.91/54.76 ~spl22_145 | spl22_220 | ~spl22_152 | ~spl22_212), 54.91/54.76 inference(avatar_split_clause,[],[f10035,f9941,f7246,f10052,f7168])). 54.91/54.76 tff(f10035,plain,( 54.91/54.76 node_proj_21(node_proj_21(sK9)) = sK15(node_proj_21(sK9)) | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_152 | ~spl22_212)), 54.91/54.76 inference(superposition,[],[f9963,f7247])). 54.91/54.76 tff(f9963,plain,( 54.91/54.76 ( ! [X1:tree1] : (node_proj_21(sK11(X1)) = sK15(sK11(X1)) | ~mem(tree,t2tb2(X1),t2tb1(sK7))) ) | ~spl22_212), 54.91/54.76 inference(superposition,[],[f291,f9942])). 54.91/54.76 tff(f10006,plain,( 54.91/54.76 ~spl22_145 | ~spl22_219 | ~spl22_152 | ~spl22_212), 54.91/54.76 inference(avatar_split_clause,[],[f9997,f9941,f7246,f10004,f7168])). 54.91/54.76 tff(f10004,plain,( 54.91/54.76 spl22_219 <=> empty1 != node_proj_21(sK9)), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_219])])). 54.91/54.76 tff(f9997,plain,( 54.91/54.76 empty1 != node_proj_21(sK9) | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_152 | ~spl22_212)), 54.91/54.76 inference(superposition,[],[f9962,f7247])). 54.91/54.76 tff(f9962,plain,( 54.91/54.76 ( ! [X0:tree1] : (empty1 != sK11(X0) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | ~spl22_212), 54.91/54.76 inference(superposition,[],[f288,f9942])). 54.91/54.76 tff(f288,plain,( 54.91/54.76 ( ! [X0:tree1,X1:tree1] : (empty1 != node1(X0,X1)) )), 54.91/54.76 inference(cnf_transformation,[],[f104])). 54.91/54.76 tff(f104,plain,( 54.91/54.76 ! [X0 : tree1,X1 : tree1] : empty1 != node1(X0,X1)), 54.91/54.76 inference(rectify,[],[f70])). 54.91/54.76 tff(f70,axiom,( 54.91/54.76 ! [X25 : tree1,X26 : tree1] : empty1 != node1(X25,X26)), 54.91/54.76 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_Node1)). 54.91/54.76 tff(f9958,plain,( 54.91/54.76 ~spl22_217 | ~spl22_214), 54.91/54.76 inference(avatar_split_clause,[],[f9951,f9944,f9956])). 54.91/54.76 tff(f9956,plain,( 54.91/54.76 spl22_217 <=> ~$less(0,$sum($sum(sK3,-1),$uminus(sK6)))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_217])])). 54.91/54.76 tff(f9944,plain,( 54.91/54.76 spl22_214 <=> ! [X7 : $int] : ($sum($sum(sK3,-1),$uminus(sK6)) != X7 | ~$less(0,X7))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_214])])). 54.91/54.76 tff(f9951,plain,( 54.91/54.76 ~$less(0,$sum($sum(sK3,-1),$uminus(sK6))) | ~spl22_214), 54.91/54.76 inference(equality_resolution,[],[f9945])). 54.91/54.76 tff(f9945,plain,( 54.91/54.76 ( ! [X7:$int] : ($sum($sum(sK3,-1),$uminus(sK6)) != X7 | ~$less(0,X7)) ) | ~spl22_214), 54.91/54.76 inference(avatar_component_clause,[],[f9944])). 54.91/54.76 tff(f9946,plain,( 54.91/54.76 spl22_212 | spl22_214), 54.91/54.76 inference(avatar_split_clause,[],[f1070,f9944,f9941])). 54.91/54.76 tff(f1070,plain,( 54.91/54.76 ( ! [X6:tree1,X7:$int] : ($sum($sum(sK3,-1),$uminus(sK6)) != X7 | node1(sK14(sK11(X6)),sK15(sK11(X6))) = sK11(X6) | ~$less(0,X7) | ~mem(tree,t2tb2(X6),t2tb1(sK7))) )), 54.91/54.76 inference(superposition,[],[f412,f1064])). 54.91/54.76 tff(f9441,plain,( 54.91/54.76 spl22_210 | ~spl22_144 | ~spl22_166 | ~spl22_208), 54.91/54.76 inference(avatar_split_clause,[],[f9425,f9380,f7487,f7171,f9439])). 54.91/54.76 tff(f9439,plain,( 54.91/54.76 spl22_210 <=> size1(node_proj_21(sK9)) = sK6), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_210])])). 54.91/54.76 tff(f7487,plain,( 54.91/54.76 spl22_166 <=> size1(node_proj_11(sK9)) = sK6), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_166])])). 54.91/54.76 tff(f9380,plain,( 54.91/54.76 spl22_208 <=> mem(tree,t2tb2(node1(node_proj_11(sK9),node_proj_11(sK9))),t2tb1(sK7))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_208])])). 54.91/54.76 tff(f9425,plain,( 54.91/54.76 size1(node_proj_21(sK9)) = sK6 | (~spl22_144 | ~spl22_166 | ~spl22_208)), 54.91/54.76 inference(resolution,[],[f9402,f7172])). 54.91/54.76 tff(f9402,plain,( 54.91/54.76 ( ! [X0:tree1] : (~mem(tree,t2tb2(X0),t2tb1(sK7)) | size1(node_proj_21(X0)) = sK6) ) | (~spl22_166 | ~spl22_208)), 54.91/54.76 inference(forward_demodulation,[],[f9385,f7488])). 54.91/54.76 tff(f7488,plain,( 54.91/54.76 size1(node_proj_11(sK9)) = sK6 | ~spl22_166), 54.91/54.76 inference(avatar_component_clause,[],[f7487])). 54.91/54.76 tff(f9385,plain,( 54.91/54.76 ( ! [X0:tree1] : (size1(node_proj_11(sK9)) = size1(node_proj_21(X0)) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | ~spl22_208), 54.91/54.76 inference(resolution,[],[f9381,f1253])). 54.91/54.76 tff(f1253,plain,( 54.91/54.76 ( ! [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))) )), 54.91/54.76 inference(superposition,[],[f1198,f1160])). 54.91/54.76 tff(f9381,plain,( 54.91/54.76 mem(tree,t2tb2(node1(node_proj_11(sK9),node_proj_11(sK9))),t2tb1(sK7)) | ~spl22_208), 54.91/54.76 inference(avatar_component_clause,[],[f9380])). 54.91/54.76 tff(f9382,plain,( 54.91/54.76 ~spl22_145 | spl22_208 | ~spl22_116 | ~spl22_160 | ~spl22_166), 54.91/54.76 inference(avatar_split_clause,[],[f9233,f7487,f7373,f4107,f9380,f7168])). 54.91/54.76 tff(f4107,plain,( 54.91/54.76 spl22_116 <=> ! [X31 : tree1,X28 : uni] : (size1(X31) != sK6 | ~mem(tree,X28,t2tb1(sK7)) | mem(tree,t2tb2(node1(X31,sK10(tb2t2(X28)))),t2tb1(sK7)))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_116])])). 54.91/54.76 tff(f7373,plain,( 54.91/54.76 spl22_160 <=> node_proj_11(sK9) = sK10(sK9)), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_160])])). 54.91/54.76 tff(f9233,plain,( 54.91/54.76 mem(tree,t2tb2(node1(node_proj_11(sK9),node_proj_11(sK9))),t2tb1(sK7)) | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_116 | ~spl22_160 | ~spl22_166)), 54.91/54.76 inference(superposition,[],[f8172,f7374])). 54.91/54.76 tff(f7374,plain,( 54.91/54.76 node_proj_11(sK9) = sK10(sK9) | ~spl22_160), 54.91/54.76 inference(avatar_component_clause,[],[f7373])). 54.91/54.76 tff(f8172,plain,( 54.91/54.76 ( ! [X0:tree1] : (mem(tree,t2tb2(node1(node_proj_11(sK9),sK10(X0))),t2tb1(sK7)) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | (~spl22_116 | ~spl22_166)), 54.91/54.76 inference(superposition,[],[f8047,f276])). 54.91/54.76 tff(f8047,plain,( 54.91/54.76 ( ! [X13:uni] : (mem(tree,t2tb2(node1(node_proj_11(sK9),sK10(tb2t2(X13)))),t2tb1(sK7)) | ~mem(tree,X13,t2tb1(sK7))) ) | (~spl22_116 | ~spl22_166)), 54.91/54.76 inference(trivial_inequality_removal,[],[f8042])). 54.91/54.76 tff(f8042,plain,( 54.91/54.76 ( ! [X13:uni] : (sK6 != sK6 | ~mem(tree,X13,t2tb1(sK7)) | mem(tree,t2tb2(node1(node_proj_11(sK9),sK10(tb2t2(X13)))),t2tb1(sK7))) ) | (~spl22_116 | ~spl22_166)), 54.91/54.76 inference(superposition,[],[f4108,f7488])). 54.91/54.76 tff(f4108,plain,( 54.91/54.76 ( ! [X28:uni,X31:tree1] : (size1(X31) != sK6 | ~mem(tree,X28,t2tb1(sK7)) | mem(tree,t2tb2(node1(X31,sK10(tb2t2(X28)))),t2tb1(sK7))) ) | ~spl22_116), 54.91/54.76 inference(avatar_component_clause,[],[f4107])). 54.91/54.76 tff(f9285,plain,( 54.91/54.76 ~spl22_145 | spl22_206 | ~spl22_116 | ~spl22_160 | ~spl22_166), 54.91/54.76 inference(avatar_split_clause,[],[f9251,f7487,f7373,f4107,f9283,f7168])). 54.91/54.76 tff(f9283,plain,( 54.91/54.76 spl22_206 <=> node_proj_11(sK9) = sK11(node1(node_proj_11(sK9),node_proj_11(sK9)))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_206])])). 54.91/54.76 tff(f9251,plain,( 54.91/54.76 node_proj_11(sK9) = sK11(node1(node_proj_11(sK9),node_proj_11(sK9))) | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_116 | ~spl22_160 | ~spl22_166)), 54.91/54.76 inference(superposition,[],[f9236,f7374])). 54.91/54.76 tff(f9236,plain,( 54.91/54.76 ( ! [X12:tree1] : (sK10(X12) = sK11(node1(node_proj_11(sK9),sK10(X12))) | ~mem(tree,t2tb2(X12),t2tb1(sK7))) ) | (~spl22_116 | ~spl22_166)), 54.91/54.76 inference(forward_demodulation,[],[f9217,f291])). 54.91/54.76 tff(f9217,plain,( 54.91/54.76 ( ! [X12:tree1] : (~mem(tree,t2tb2(X12),t2tb1(sK7)) | node_proj_21(node1(node_proj_11(sK9),sK10(X12))) = sK11(node1(node_proj_11(sK9),sK10(X12)))) ) | (~spl22_116 | ~spl22_166)), 54.91/54.76 inference(resolution,[],[f8172,f569])). 54.91/54.76 tff(f9000,plain,( 54.91/54.76 ~spl22_145 | spl22_204 | ~spl22_116 | ~spl22_160 | ~spl22_166), 54.91/54.76 inference(avatar_split_clause,[],[f8820,f7487,f7373,f4107,f8998,f7168])). 54.91/54.76 tff(f8998,plain,( 54.91/54.76 spl22_204 <=> node_proj_11(sK9) = sK10(node1(node_proj_11(sK9),node_proj_11(sK9)))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_204])])). 54.91/54.76 tff(f8820,plain,( 54.91/54.76 node_proj_11(sK9) = sK10(node1(node_proj_11(sK9),node_proj_11(sK9))) | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_116 | ~spl22_160 | ~spl22_166)), 54.91/54.76 inference(superposition,[],[f8683,f7374])). 54.91/54.76 tff(f8683,plain,( 54.91/54.76 ( ! [X0:tree1] : (node_proj_11(sK9) = sK10(node1(node_proj_11(sK9),sK10(X0))) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | (~spl22_116 | ~spl22_166)), 54.91/54.76 inference(superposition,[],[f8178,f276])). 54.91/54.76 tff(f8178,plain,( 54.91/54.76 ( ! [X11:uni] : (node_proj_11(sK9) = sK10(node1(node_proj_11(sK9),sK10(tb2t2(X11)))) | ~mem(tree,X11,t2tb1(sK7))) ) | (~spl22_116 | ~spl22_166)), 54.91/54.76 inference(forward_demodulation,[],[f8166,f292])). 54.91/54.76 tff(f8166,plain,( 54.91/54.76 ( ! [X11:uni] : (~mem(tree,X11,t2tb1(sK7)) | node_proj_11(node1(node_proj_11(sK9),sK10(tb2t2(X11)))) = sK10(node1(node_proj_11(sK9),sK10(tb2t2(X11))))) ) | (~spl22_116 | ~spl22_166)), 54.91/54.76 inference(resolution,[],[f8047,f570])). 54.91/54.76 tff(f570,plain,( 54.91/54.76 ( ! [X2:tree1] : (~mem(tree,t2tb2(X2),t2tb1(sK7)) | node_proj_11(X2) = sK10(X2)) )), 54.91/54.76 inference(superposition,[],[f292,f252])). 54.91/54.76 tff(f8974,plain,( 54.91/54.76 ~spl22_145 | ~spl22_203 | spl22_37 | ~spl22_116 | ~spl22_160 | ~spl22_166), 54.91/54.76 inference(avatar_split_clause,[],[f8794,f7487,f7373,f4107,f612,f8972,f7168])). 54.91/54.76 tff(f8972,plain,( 54.91/54.76 spl22_203 <=> ~$less(size1(sK11(node1(node_proj_11(sK9),node_proj_11(sK9)))),0)), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_203])])). 54.91/54.76 tff(f612,plain,( 54.91/54.76 spl22_37 <=> ~$less($sum($sum(sK3,-1),$uminus(sK6)),0)), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_37])])). 54.91/54.76 tff(f8794,plain,( 54.91/54.76 ~$less(size1(sK11(node1(node_proj_11(sK9),node_proj_11(sK9)))),0) | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_37 | ~spl22_116 | ~spl22_160 | ~spl22_166)), 54.91/54.76 inference(superposition,[],[f8670,f7374])). 54.91/54.76 tff(f8670,plain,( 54.91/54.76 ( ! [X0:tree1] : (~$less(size1(sK11(node1(node_proj_11(sK9),sK10(X0)))),0) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | (~spl22_37 | ~spl22_116 | ~spl22_166)), 54.91/54.76 inference(superposition,[],[f8168,f276])). 54.91/54.76 tff(f8168,plain,( 54.91/54.76 ( ! [X13:uni] : (~$less(size1(sK11(node1(node_proj_11(sK9),sK10(tb2t2(X13))))),0) | ~mem(tree,X13,t2tb1(sK7))) ) | (~spl22_37 | ~spl22_116 | ~spl22_166)), 54.91/54.76 inference(resolution,[],[f8047,f1072])). 54.91/54.76 tff(f1072,plain,( 54.91/54.76 ( ! [X1:tree1] : (~mem(tree,t2tb2(X1),t2tb1(sK7)) | ~$less(size1(sK11(X1)),0)) ) | ~spl22_37), 54.91/54.76 inference(superposition,[],[f613,f1064])). 54.91/54.76 tff(f613,plain,( 54.91/54.76 ~$less($sum($sum(sK3,-1),$uminus(sK6)),0) | ~spl22_37), 54.91/54.76 inference(avatar_component_clause,[],[f612])). 54.91/54.76 tff(f8893,plain,( 54.91/54.76 ~spl22_145 | spl22_200 | ~spl22_116 | ~spl22_160 | ~spl22_166), 54.91/54.76 inference(avatar_split_clause,[],[f8718,f7487,f7373,f4107,f8891,f7168])). 54.91/54.76 tff(f8891,plain,( 54.91/54.76 spl22_200 <=> size1(sK10(node1(node_proj_11(sK9),node_proj_11(sK9)))) = sK6), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_200])])). 54.91/54.76 tff(f8718,plain,( 54.91/54.76 size1(sK10(node1(node_proj_11(sK9),node_proj_11(sK9)))) = sK6 | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_116 | ~spl22_160 | ~spl22_166)), 54.91/54.76 inference(superposition,[],[f8632,f7374])). 54.91/54.76 tff(f8632,plain,( 54.91/54.76 ( ! [X0:tree1] : (size1(sK10(node1(node_proj_11(sK9),sK10(X0)))) = sK6 | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | (~spl22_116 | ~spl22_166)), 54.91/54.76 inference(superposition,[],[f8164,f276])). 54.91/54.76 tff(f8164,plain,( 54.91/54.76 ( ! [X9:uni] : (size1(sK10(node1(node_proj_11(sK9),sK10(tb2t2(X9))))) = sK6 | ~mem(tree,X9,t2tb1(sK7))) ) | (~spl22_116 | ~spl22_166)), 54.91/54.76 inference(resolution,[],[f8047,f254])). 54.91/54.76 tff(f8627,plain,( 54.91/54.76 ~spl22_73 | ~spl22_70), 54.91/54.76 inference(avatar_split_clause,[],[f1547,f1544,f1552])). 54.91/54.76 tff(f1552,plain,( 54.91/54.76 spl22_73 <=> ~$less(0,sK6)), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_73])])). 54.91/54.76 tff(f1544,plain,( 54.91/54.76 spl22_70 <=> ! [X3 : $int] : (sK6 != X3 | ~$less(0,X3))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_70])])). 54.91/54.76 tff(f1547,plain,( 54.91/54.76 ~$less(0,sK6) | ~spl22_70), 54.91/54.76 inference(equality_resolution,[],[f1545])). 54.91/54.76 tff(f1545,plain,( 54.91/54.76 ( ! [X3:$int] : (sK6 != X3 | ~$less(0,X3)) ) | ~spl22_70), 54.91/54.76 inference(avatar_component_clause,[],[f1544])). 54.91/54.76 tff(f8625,plain,( 54.91/54.76 spl22_58 | spl22_198 | ~spl22_98 | ~spl22_116 | ~spl22_166), 54.91/54.76 inference(avatar_split_clause,[],[f8590,f7487,f4107,f2574,f8623,f1222])). 54.91/54.76 tff(f8623,plain,( 54.91/54.76 spl22_198 <=> node_proj_21(node_proj_11(sK9)) = sK15(node_proj_11(sK9))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_198])])). 54.91/54.76 tff(f2574,plain,( 54.91/54.76 spl22_98 <=> ! [X3 : uni] : (node1(sK14(sK10(tb2t2(X3))),sK15(sK10(tb2t2(X3)))) = sK10(tb2t2(X3)) | ~mem(tree,X3,t2tb1(sK7)))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_98])])). 54.91/54.76 tff(f8590,plain,( 54.91/54.76 ( ! [X4:uni] : (node_proj_21(node_proj_11(sK9)) = sK15(node_proj_11(sK9)) | ~mem(tree,X4,t2tb1(sK7))) ) | (~spl22_98 | ~spl22_116 | ~spl22_166)), 54.91/54.76 inference(resolution,[],[f2919,f8047])). 54.91/54.76 tff(f2919,plain,( 54.91/54.76 ( ! [X0:tree1,X1:tree1] : (~mem(tree,t2tb2(node1(X0,X1)),t2tb1(sK7)) | node_proj_21(X0) = sK15(X0)) ) | ~spl22_98), 54.91/54.76 inference(superposition,[],[f2916,f292])). 54.91/54.76 tff(f2916,plain,( 54.91/54.76 ( ! [X0:tree1] : (node_proj_21(node_proj_11(X0)) = sK15(node_proj_11(X0)) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | ~spl22_98), 54.91/54.76 inference(superposition,[],[f2758,f276])). 54.91/54.76 tff(f2758,plain,( 54.91/54.76 ( ! [X0:uni] : (node_proj_21(node_proj_11(tb2t2(X0))) = sK15(node_proj_11(tb2t2(X0))) | ~mem(tree,X0,t2tb1(sK7))) ) | ~spl22_98), 54.91/54.76 inference(duplicate_literal_removal,[],[f2752])). 54.91/54.76 tff(f2752,plain,( 54.91/54.76 ( ! [X0:uni] : (node_proj_21(node_proj_11(tb2t2(X0))) = sK15(node_proj_11(tb2t2(X0))) | ~mem(tree,X0,t2tb1(sK7)) | ~mem(tree,X0,t2tb1(sK7))) ) | ~spl22_98), 54.91/54.76 inference(superposition,[],[f2597,f597])). 54.91/54.76 tff(f597,plain,( 54.91/54.76 ( ! [X0:uni] : (node_proj_11(tb2t2(X0)) = sK10(tb2t2(X0)) | ~mem(tree,X0,t2tb1(sK7))) )), 54.91/54.76 inference(superposition,[],[f570,f274])). 54.91/54.76 tff(f2597,plain,( 54.91/54.76 ( ! [X2:uni] : (node_proj_21(sK10(tb2t2(X2))) = sK15(sK10(tb2t2(X2))) | ~mem(tree,X2,t2tb1(sK7))) ) | ~spl22_98), 54.91/54.76 inference(superposition,[],[f291,f2575])). 54.91/54.76 tff(f2575,plain,( 54.91/54.76 ( ! [X3:uni] : (node1(sK14(sK10(tb2t2(X3))),sK15(sK10(tb2t2(X3)))) = sK10(tb2t2(X3)) | ~mem(tree,X3,t2tb1(sK7))) ) | ~spl22_98), 54.91/54.76 inference(avatar_component_clause,[],[f2574])). 54.91/54.76 tff(f8336,plain,( 54.91/54.76 ~spl22_145 | ~spl22_197 | ~spl22_116 | ~spl22_160 | ~spl22_166 | spl22_181), 54.91/54.76 inference(avatar_split_clause,[],[f8320,f7752,f7487,f7373,f4107,f8334,f7168])). 54.91/54.76 tff(f8334,plain,( 54.91/54.76 spl22_197 <=> ~$less(size1(node1(node_proj_11(sK9),node_proj_11(sK9))),0)), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_197])])). 54.91/54.76 tff(f7752,plain,( 54.91/54.76 spl22_181 <=> ~$less($sum($sum(sK6,sK3),$uminus(sK6)),0)), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_181])])). 54.91/54.76 tff(f8320,plain,( 54.91/54.76 ~$less(size1(node1(node_proj_11(sK9),node_proj_11(sK9))),0) | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_116 | ~spl22_160 | ~spl22_166 | ~spl22_181)), 54.91/54.76 inference(superposition,[],[f8280,f7374])). 54.91/54.76 tff(f8280,plain,( 54.91/54.76 ( ! [X0:tree1] : (~$less(size1(node1(node_proj_11(sK9),sK10(X0))),0) | ~mem(tree,t2tb2(X0),t2tb1(sK7))) ) | (~spl22_116 | ~spl22_166 | ~spl22_181)), 54.91/54.76 inference(superposition,[],[f8170,f276])). 54.91/54.76 tff(f8170,plain,( 54.91/54.76 ( ! [X15:uni] : (~$less(size1(node1(node_proj_11(sK9),sK10(tb2t2(X15)))),0) | ~mem(tree,X15,t2tb1(sK7))) ) | (~spl22_116 | ~spl22_166 | ~spl22_181)), 54.91/54.76 inference(resolution,[],[f8047,f7755])). 54.91/54.76 tff(f7755,plain,( 54.91/54.76 ( ! [X0:tree1] : (~mem(tree,t2tb2(X0),t2tb1(sK7)) | ~$less(size1(X0),0)) ) | ~spl22_181), 54.91/54.76 inference(superposition,[],[f7753,f6872])). 54.91/54.76 tff(f7753,plain,( 54.91/54.76 ~$less($sum($sum(sK6,sK3),$uminus(sK6)),0) | ~spl22_181), 54.91/54.76 inference(avatar_component_clause,[],[f7752])). 54.91/54.76 tff(f8129,plain,( 54.91/54.76 ~spl22_145 | spl22_194 | ~spl22_148 | ~spl22_152), 54.91/54.76 inference(avatar_split_clause,[],[f7461,f7246,f7209,f8127,f7168])). 54.91/54.76 tff(f8127,plain,( 54.91/54.76 spl22_194 <=> size1(sK9) = $sum($sum(1,sK6),size1(node_proj_21(sK9)))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_194])])). 54.91/54.76 tff(f7209,plain,( 54.91/54.76 spl22_148 <=> size1(sK10(sK9)) = sK6), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_148])])). 54.91/54.76 tff(f7461,plain,( 54.91/54.76 size1(sK9) = $sum($sum(1,sK6),size1(node_proj_21(sK9))) | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_148 | ~spl22_152)), 54.91/54.76 inference(forward_demodulation,[],[f7459,f7210])). 54.91/54.76 tff(f7210,plain,( 54.91/54.76 size1(sK10(sK9)) = sK6 | ~spl22_148), 54.91/54.76 inference(avatar_component_clause,[],[f7209])). 54.91/54.76 tff(f7459,plain,( 54.91/54.76 size1(sK9) = $sum($sum(1,size1(sK10(sK9))),size1(node_proj_21(sK9))) | ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | ~spl22_152), 54.91/54.76 inference(superposition,[],[f3884,f7247])). 54.91/54.76 tff(f8096,plain,( 54.91/54.76 ~spl22_193 | ~spl22_144 | spl22_181), 54.91/54.76 inference(avatar_split_clause,[],[f8086,f7752,f7171,f8094])). 54.91/54.76 tff(f8094,plain,( 54.91/54.76 spl22_193 <=> ~$less(size1(sK9),0)), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_193])])). 54.91/54.76 tff(f8086,plain,( 54.91/54.76 ~$less(size1(sK9),0) | (~spl22_144 | ~spl22_181)), 54.91/54.76 inference(resolution,[],[f7172,f7755])). 54.91/54.76 tff(f8050,plain,( 54.91/54.76 ~spl22_191 | spl22_37 | ~spl22_144 | ~spl22_152), 54.91/54.76 inference(avatar_split_clause,[],[f7917,f7246,f7171,f612,f7985])). 54.91/54.76 tff(f7985,plain,( 54.91/54.76 spl22_191 <=> ~$less(size1(node_proj_21(sK9)),0)), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_191])])). 54.91/54.76 tff(f7917,plain,( 54.91/54.76 ~$less(size1(node_proj_21(sK9)),0) | (~spl22_37 | ~spl22_144 | ~spl22_152)), 54.91/54.76 inference(forward_demodulation,[],[f7184,f7247])). 54.91/54.76 tff(f7184,plain,( 54.91/54.76 ~$less(size1(sK11(sK9)),0) | (~spl22_37 | ~spl22_144)), 54.91/54.76 inference(resolution,[],[f7172,f1072])). 54.91/54.76 tff(f8049,plain,( 54.91/54.76 ~spl22_191 | spl22_37 | ~spl22_144 | ~spl22_152), 54.91/54.76 inference(avatar_split_clause,[],[f7916,f7246,f7171,f612,f7985])). 54.91/54.76 tff(f7916,plain,( 54.91/54.76 ~$less(size1(node_proj_21(sK9)),0) | (~spl22_37 | ~spl22_144 | ~spl22_152)), 54.91/54.76 inference(forward_demodulation,[],[f7237,f7247])). 54.91/54.76 tff(f7237,plain,( 54.91/54.76 ~$less(size1(sK11(sK9)),0) | (~spl22_37 | ~spl22_144)), 54.91/54.76 inference(resolution,[],[f7172,f1072])). 54.91/54.76 tff(f7989,plain,( 54.91/54.76 spl22_166 | ~spl22_144 | ~spl22_148), 54.91/54.76 inference(avatar_split_clause,[],[f7481,f7209,f7171,f7487])). 54.91/54.76 tff(f7481,plain,( 54.91/54.76 size1(node_proj_11(sK9)) = sK6 | (~spl22_144 | ~spl22_148)), 54.91/54.76 inference(backward_demodulation,[],[f7182,f7210])). 54.91/54.76 tff(f7182,plain,( 54.91/54.76 node_proj_11(sK9) = sK10(sK9) | ~spl22_144), 54.91/54.76 inference(resolution,[],[f7172,f570])). 54.91/54.76 tff(f7988,plain,( 54.91/54.76 ~spl22_191 | spl22_37 | ~spl22_144 | ~spl22_152), 54.91/54.76 inference(avatar_split_clause,[],[f7480,f7246,f7171,f612,f7985])). 54.91/54.76 tff(f7480,plain,( 54.91/54.76 ~$less(size1(node_proj_21(sK9)),0) | (~spl22_37 | ~spl22_144 | ~spl22_152)), 54.91/54.76 inference(forward_demodulation,[],[f7184,f7247])). 54.91/54.76 tff(f7987,plain,( 54.91/54.76 ~spl22_191 | spl22_37 | ~spl22_144 | ~spl22_152), 54.91/54.76 inference(avatar_split_clause,[],[f7478,f7246,f7171,f612,f7985])). 54.91/54.76 tff(f7478,plain,( 54.91/54.76 ~$less(size1(node_proj_21(sK9)),0) | (~spl22_37 | ~spl22_144 | ~spl22_152)), 54.91/54.76 inference(forward_demodulation,[],[f7237,f7247])). 54.91/54.76 tff(f7923,plain,( 54.91/54.76 spl22_166 | ~spl22_144 | ~spl22_148), 54.91/54.76 inference(avatar_split_clause,[],[f7368,f7209,f7171,f7487])). 54.91/54.76 tff(f7368,plain,( 54.91/54.76 size1(node_proj_11(sK9)) = sK6 | (~spl22_144 | ~spl22_148)), 54.91/54.76 inference(backward_demodulation,[],[f7182,f7210])). 54.91/54.76 tff(f7922,plain,( 54.91/54.76 spl22_166 | ~spl22_144), 54.91/54.76 inference(avatar_split_clause,[],[f7236,f7171,f7487])). 54.91/54.76 tff(f7236,plain,( 54.91/54.76 size1(node_proj_11(sK9)) = sK6 | ~spl22_144), 54.91/54.76 inference(resolution,[],[f7172,f627])). 54.91/54.76 tff(f627,plain,( 54.91/54.76 ( ! [X0:tree1] : (~mem(tree,t2tb2(X0),t2tb1(sK7)) | size1(node_proj_11(X0)) = sK6) )), 54.91/54.76 inference(superposition,[],[f624,f276])). 54.91/54.76 tff(f624,plain,( 54.91/54.76 ( ! [X0:uni] : (size1(node_proj_11(tb2t2(X0))) = sK6 | ~mem(tree,X0,t2tb1(sK7))) )), 54.91/54.76 inference(duplicate_literal_removal,[],[f621])). 54.91/54.76 tff(f621,plain,( 54.91/54.76 ( ! [X0:uni] : (size1(node_proj_11(tb2t2(X0))) = sK6 | ~mem(tree,X0,t2tb1(sK7)) | ~mem(tree,X0,t2tb1(sK7))) )), 54.91/54.76 inference(superposition,[],[f521,f597])). 54.91/54.76 tff(f7921,plain,( 54.91/54.76 spl22_160 | ~spl22_144), 54.91/54.76 inference(avatar_split_clause,[],[f7235,f7171,f7373])). 54.91/54.76 tff(f7235,plain,( 54.91/54.76 node_proj_11(sK9) = sK10(sK9) | ~spl22_144), 54.91/54.76 inference(resolution,[],[f7172,f570])). 54.91/54.76 tff(f7920,plain,( 54.91/54.76 spl22_166 | ~spl22_144), 54.91/54.76 inference(avatar_split_clause,[],[f7183,f7171,f7487])). 54.91/54.76 tff(f7183,plain,( 54.91/54.76 size1(node_proj_11(sK9)) = sK6 | ~spl22_144), 54.91/54.76 inference(resolution,[],[f7172,f627])). 54.91/54.76 tff(f7919,plain,( 54.91/54.76 spl22_160 | ~spl22_144), 54.91/54.76 inference(avatar_split_clause,[],[f7182,f7171,f7373])). 54.91/54.76 tff(f7914,plain,( 54.91/54.76 ~spl22_189 | ~spl22_48 | ~spl22_182 | ~spl22_186), 54.91/54.76 inference(avatar_split_clause,[],[f7907,f7892,f7829,f748,f7912])). 54.91/54.76 tff(f7912,plain,( 54.91/54.76 spl22_189 <=> ~$less(size1(node_proj_11(sK9)),$sum(sK6,1))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_189])])). 54.91/54.76 tff(f748,plain,( 54.91/54.76 spl22_48 <=> ! [X11 : tree1,X13 : $int,X10 : tree1,X12 : $int] : (size1(X10) != X12 | node1(X10,X11) != sK9 | ~$less(X12,$sum(X13,1)) | sK6 != X13)), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_48])])). 54.91/54.76 tff(f7829,plain,( 54.91/54.76 spl22_182 <=> node1(sK14(sK9),sK15(sK9)) = sK9), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_182])])). 54.91/54.76 tff(f7892,plain,( 54.91/54.76 spl22_186 <=> node_proj_11(sK9) = sK14(sK9)), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_186])])). 54.91/54.76 tff(f7907,plain,( 54.91/54.76 ~$less(size1(node_proj_11(sK9)),$sum(sK6,1)) | (~spl22_48 | ~spl22_182 | ~spl22_186)), 54.91/54.76 inference(equality_resolution,[],[f7905])). 54.91/54.76 tff(f7905,plain,( 54.91/54.76 ( ! [X0:$int] : (sK6 != X0 | ~$less(size1(node_proj_11(sK9)),$sum(X0,1))) ) | (~spl22_48 | ~spl22_182 | ~spl22_186)), 54.91/54.76 inference(equality_resolution,[],[f7903])). 54.91/54.76 tff(f7903,plain,( 54.91/54.76 ( ! [X17:$int,X16:$int] : (size1(node_proj_11(sK9)) != X16 | ~$less(X16,$sum(X17,1)) | sK6 != X17) ) | (~spl22_48 | ~spl22_182 | ~spl22_186)), 54.91/54.76 inference(forward_demodulation,[],[f7864,f7893])). 54.91/54.76 tff(f7893,plain,( 54.91/54.76 node_proj_11(sK9) = sK14(sK9) | ~spl22_186), 54.91/54.76 inference(avatar_component_clause,[],[f7892])). 54.91/54.76 tff(f7864,plain,( 54.91/54.76 ( ! [X17:$int,X16:$int] : (size1(sK14(sK9)) != X16 | ~$less(X16,$sum(X17,1)) | sK6 != X17) ) | (~spl22_48 | ~spl22_182)), 54.91/54.76 inference(trivial_inequality_removal,[],[f7847])). 54.91/54.76 tff(f7847,plain,( 54.91/54.76 ( ! [X17:$int,X16:$int] : (sK9 != sK9 | size1(sK14(sK9)) != X16 | ~$less(X16,$sum(X17,1)) | sK6 != X17) ) | (~spl22_48 | ~spl22_182)), 54.91/54.76 inference(superposition,[],[f749,f7830])). 54.91/54.76 tff(f7830,plain,( 54.91/54.76 node1(sK14(sK9),sK15(sK9)) = sK9 | ~spl22_182), 54.91/54.76 inference(avatar_component_clause,[],[f7829])). 54.91/54.76 tff(f749,plain,( 54.91/54.76 ( ! [X12:$int,X10:tree1,X13:$int,X11:tree1] : (node1(X10,X11) != sK9 | size1(X10) != X12 | ~$less(X12,$sum(X13,1)) | sK6 != X13) ) | ~spl22_48), 54.91/54.76 inference(avatar_component_clause,[],[f748])). 54.91/54.76 tff(f7894,plain,( 54.91/54.76 spl22_186 | ~spl22_182), 54.91/54.76 inference(avatar_split_clause,[],[f7834,f7829,f7892])). 54.91/54.76 tff(f7834,plain,( 54.91/54.76 node_proj_11(sK9) = sK14(sK9) | ~spl22_182), 54.91/54.76 inference(superposition,[],[f292,f7830])). 54.91/54.76 tff(f7887,plain,( 54.91/54.76 spl22_184 | ~spl22_182), 54.91/54.76 inference(avatar_split_clause,[],[f7833,f7829,f7885])). 54.91/54.76 tff(f7885,plain,( 54.91/54.76 spl22_184 <=> node_proj_21(sK9) = sK15(sK9)), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_184])])). 54.91/54.76 tff(f7833,plain,( 54.91/54.76 node_proj_21(sK9) = sK15(sK9) | ~spl22_182), 54.91/54.76 inference(superposition,[],[f291,f7830])). 54.91/54.76 tff(f7831,plain,( 54.91/54.76 spl22_182 | spl22_132 | ~spl22_50), 54.91/54.76 inference(avatar_split_clause,[],[f7251,f751,f6000,f7829])). 54.91/54.76 tff(f6000,plain,( 54.91/54.76 spl22_132 <=> ! [X9 : $int] : (sK3 != X9 | ~$less(0,X9))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_132])])). 54.91/54.76 tff(f751,plain,( 54.91/54.76 spl22_50 <=> size1(sK9) = sK3), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_50])])). 54.91/54.76 tff(f7251,plain,( 54.91/54.76 ( ! [X1:$int] : (sK3 != X1 | node1(sK14(sK9),sK15(sK9)) = sK9 | ~$less(0,X1)) ) | ~spl22_50), 54.91/54.76 inference(superposition,[],[f412,f752])). 54.91/54.76 tff(f752,plain,( 54.91/54.76 size1(sK9) = sK3 | ~spl22_50), 54.91/54.76 inference(avatar_component_clause,[],[f751])). 54.91/54.76 tff(f7754,plain,( 54.91/54.76 ~spl22_181 | ~spl22_140), 54.91/54.76 inference(avatar_split_clause,[],[f7747,f7111,f7752])). 54.91/54.76 tff(f7111,plain,( 54.91/54.76 spl22_140 <=> ! [X6 : $int] : ($sum($sum(sK6,sK3),$uminus(sK6)) != X6 | ~$less(X6,0))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_140])])). 54.91/54.76 tff(f7747,plain,( 54.91/54.76 ~$less($sum($sum(sK6,sK3),$uminus(sK6)),0) | ~spl22_140), 54.91/54.76 inference(equality_resolution,[],[f7112])). 54.91/54.76 tff(f7112,plain,( 54.91/54.76 ( ! [X6:$int] : ($sum($sum(sK6,sK3),$uminus(sK6)) != X6 | ~$less(X6,0)) ) | ~spl22_140), 54.91/54.76 inference(avatar_component_clause,[],[f7111])). 54.91/54.76 tff(f7616,plain,( 54.91/54.76 spl22_178 | ~spl22_164 | ~spl22_174), 54.91/54.76 inference(avatar_split_clause,[],[f7609,f7595,f7474,f7614])). 54.91/54.76 tff(f7614,plain,( 54.91/54.76 spl22_178 <=> node1(node_proj_11(sK9),node_proj_21(sK9)) = sK9), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_178])])). 54.91/54.76 tff(f7474,plain,( 54.91/54.76 spl22_164 <=> node1(sK12(sK9),sK13(sK9)) = sK9), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_164])])). 54.91/54.76 tff(f7595,plain,( 54.91/54.76 spl22_174 <=> node_proj_11(sK9) = sK12(sK9)), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_174])])). 54.91/54.76 tff(f7609,plain,( 54.91/54.76 node1(node_proj_11(sK9),node_proj_21(sK9)) = sK9 | (~spl22_164 | ~spl22_174)), 54.91/54.76 inference(forward_demodulation,[],[f7582,f7596])). 54.91/54.76 tff(f7596,plain,( 54.91/54.76 node_proj_11(sK9) = sK12(sK9) | ~spl22_174), 54.91/54.76 inference(avatar_component_clause,[],[f7595])). 54.91/54.76 tff(f7582,plain,( 54.91/54.76 node1(sK12(sK9),node_proj_21(sK9)) = sK9 | ~spl22_164), 54.91/54.76 inference(backward_demodulation,[],[f7520,f7475])). 54.91/54.76 tff(f7475,plain,( 54.91/54.76 node1(sK12(sK9),sK13(sK9)) = sK9 | ~spl22_164), 54.91/54.76 inference(avatar_component_clause,[],[f7474])). 54.91/54.76 tff(f7520,plain,( 54.91/54.76 node_proj_21(sK9) = sK13(sK9) | ~spl22_164), 54.91/54.76 inference(superposition,[],[f291,f7475])). 54.91/54.76 tff(f7605,plain,( 54.91/54.76 spl22_176 | ~spl22_154 | ~spl22_164), 54.91/54.76 inference(avatar_split_clause,[],[f7590,f7474,f7354,f7603])). 54.91/54.76 tff(f7603,plain,( 54.91/54.76 spl22_176 <=> $less(size1(node_proj_11(sK9)),sK6)), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_176])])). 54.91/54.76 tff(f7354,plain,( 54.91/54.76 spl22_154 <=> $less(size1(sK12(sK9)),sK6)), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_154])])). 54.91/54.76 tff(f7590,plain,( 54.91/54.76 $less(size1(node_proj_11(sK9)),sK6) | (~spl22_154 | ~spl22_164)), 54.91/54.76 inference(backward_demodulation,[],[f7521,f7355])). 54.91/54.76 tff(f7355,plain,( 54.91/54.76 $less(size1(sK12(sK9)),sK6) | ~spl22_154), 54.91/54.76 inference(avatar_component_clause,[],[f7354])). 54.91/54.76 tff(f7521,plain,( 54.91/54.76 node_proj_11(sK9) = sK12(sK9) | ~spl22_164), 54.91/54.76 inference(superposition,[],[f292,f7475])). 54.91/54.76 tff(f7597,plain,( 54.91/54.76 spl22_174 | ~spl22_164), 54.91/54.76 inference(avatar_split_clause,[],[f7521,f7474,f7595])). 54.91/54.76 tff(f7589,plain,( 54.91/54.76 spl22_172 | ~spl22_164), 54.91/54.76 inference(avatar_split_clause,[],[f7520,f7474,f7587])). 54.91/54.76 tff(f7587,plain,( 54.91/54.76 spl22_172 <=> node_proj_21(sK9) = sK13(sK9)), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_172])])). 54.91/54.76 tff(f7581,plain,( 54.91/54.76 ~spl22_171 | ~spl22_164), 54.91/54.76 inference(avatar_split_clause,[],[f7519,f7474,f7579])). 54.91/54.76 tff(f7579,plain,( 54.91/54.76 spl22_171 <=> empty1 != sK9), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_171])])). 54.91/54.76 tff(f7519,plain,( 54.91/54.76 empty1 != sK9 | ~spl22_164), 54.91/54.76 inference(superposition,[],[f288,f7475])). 54.91/54.76 tff(f7574,plain,( 54.91/54.76 spl22_162 | spl22_168 | ~spl22_148 | ~spl22_164), 54.91/54.76 inference(avatar_split_clause,[],[f7556,f7474,f7209,f7572,f7467])). 54.91/54.76 tff(f7467,plain,( 54.91/54.76 spl22_162 <=> ! [X20 : uni] : (tb2t2(X20) != sK9 | ~mem(tree,X20,t2tb1(sK7)))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_162])])). 54.91/54.76 tff(f7572,plain,( 54.91/54.76 spl22_168 <=> size1(sK12(sK9)) = sK6), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_168])])). 54.91/54.76 tff(f7556,plain,( 54.91/54.76 ( ! [X13:uni] : (size1(sK12(sK9)) = sK6 | tb2t2(X13) != sK9 | ~mem(tree,X13,t2tb1(sK7))) ) | (~spl22_148 | ~spl22_164)), 54.91/54.76 inference(forward_demodulation,[],[f7555,f7210])). 54.91/54.76 tff(f7555,plain,( 54.91/54.76 ( ! [X13:uni] : (tb2t2(X13) != sK9 | size1(sK10(sK9)) = size1(sK12(sK9)) | ~mem(tree,X13,t2tb1(sK7))) ) | ~spl22_164), 54.91/54.76 inference(inner_rewriting,[],[f7529])). 54.91/54.76 tff(f7529,plain,( 54.91/54.76 ( ! [X13:uni] : (tb2t2(X13) != sK9 | size1(sK12(sK9)) = size1(sK10(tb2t2(X13))) | ~mem(tree,X13,t2tb1(sK7))) ) | ~spl22_164), 54.91/54.76 inference(superposition,[],[f649,f7475])). 54.91/54.76 tff(f7518,plain,( 54.91/54.76 spl22_164 | ~spl22_146), 54.91/54.76 inference(avatar_split_clause,[],[f7227,f7177,f7474])). 54.91/54.76 tff(f7177,plain,( 54.91/54.76 spl22_146 <=> mem(tree,t2tb2(sK9),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_146])])). 54.91/54.76 tff(f7227,plain,( 54.91/54.76 node1(sK12(sK9),sK13(sK9)) = sK9 | ~spl22_146), 54.91/54.76 inference(forward_demodulation,[],[f7224,f276])). 54.91/54.76 tff(f7224,plain,( 54.91/54.76 node1(sK12(tb2t2(t2tb2(sK9))),sK13(tb2t2(t2tb2(sK9)))) = tb2t2(t2tb2(sK9)) | ~spl22_146), 54.91/54.76 inference(resolution,[],[f7178,f640])). 54.91/54.76 tff(f7178,plain,( 54.91/54.76 mem(tree,t2tb2(sK9),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | ~spl22_146), 54.91/54.76 inference(avatar_component_clause,[],[f7177])). 54.91/54.76 tff(f7517,plain,( 54.91/54.76 spl22_164 | ~spl22_146), 54.91/54.76 inference(avatar_split_clause,[],[f7221,f7177,f7474])). 54.91/54.76 tff(f7221,plain,( 54.91/54.76 node1(sK12(sK9),sK13(sK9)) = sK9 | ~spl22_146), 54.91/54.76 inference(resolution,[],[f7178,f235])). 54.91/54.76 tff(f7489,plain,( 54.91/54.76 spl22_166 | ~spl22_144), 54.91/54.76 inference(avatar_split_clause,[],[f7183,f7171,f7487])). 54.91/54.76 tff(f7482,plain,( 54.91/54.76 spl22_160 | ~spl22_144), 54.91/54.76 inference(avatar_split_clause,[],[f7182,f7171,f7373])). 54.91/54.76 tff(f7476,plain,( 54.91/54.76 spl22_164 | ~spl22_146), 54.91/54.76 inference(avatar_split_clause,[],[f7221,f7177,f7474])). 54.91/54.76 tff(f7469,plain,( 54.91/54.76 spl22_156 | spl22_162 | ~spl22_48), 54.91/54.76 inference(avatar_split_clause,[],[f7303,f748,f7467,f7359])). 54.91/54.76 tff(f7359,plain,( 54.91/54.76 spl22_156 <=> ! [X18 : $int,X19 : $int] : (size1(node_proj_11(sK9)) != X18 | sK6 != X19 | ~$less(X18,$sum(X19,1)))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_156])])). 54.91/54.76 tff(f7303,plain,( 54.91/54.76 ( ! [X21:$int,X22:$int,X20:uni] : (tb2t2(X20) != sK9 | size1(node_proj_11(sK9)) != X21 | ~$less(X21,$sum(X22,1)) | sK6 != X22 | ~mem(tree,X20,t2tb1(sK7))) ) | ~spl22_48), 54.91/54.76 inference(inner_rewriting,[],[f7267])). 54.91/54.76 tff(f7267,plain,( 54.91/54.76 ( ! [X21:$int,X22:$int,X20:uni] : (tb2t2(X20) != sK9 | size1(node_proj_11(tb2t2(X20))) != X21 | ~$less(X21,$sum(X22,1)) | sK6 != X22 | ~mem(tree,X20,t2tb1(sK7))) ) | ~spl22_48), 54.91/54.76 inference(superposition,[],[f749,f654])). 54.91/54.76 tff(f654,plain,( 54.91/54.76 ( ! [X0:uni] : (node1(node_proj_11(tb2t2(X0)),node_proj_21(tb2t2(X0))) = tb2t2(X0) | ~mem(tree,X0,t2tb1(sK7))) )), 54.91/54.76 inference(duplicate_literal_removal,[],[f644])). 54.91/54.76 tff(f644,plain,( 54.91/54.76 ( ! [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))) )), 54.91/54.76 inference(superposition,[],[f618,f597])). 54.91/54.76 tff(f7402,plain,( 54.91/54.76 ~spl22_73 | ~spl22_70), 54.91/54.76 inference(avatar_split_clause,[],[f1547,f1544,f1552])). 54.91/54.76 tff(f7375,plain,( 54.91/54.76 spl22_160 | ~spl22_144), 54.91/54.76 inference(avatar_split_clause,[],[f7182,f7171,f7373])). 54.91/54.76 tff(f7367,plain,( 54.91/54.76 spl22_152 | ~spl22_144), 54.91/54.76 inference(avatar_split_clause,[],[f7181,f7171,f7246])). 54.91/54.76 tff(f7181,plain,( 54.91/54.76 node_proj_21(sK9) = sK11(sK9) | ~spl22_144), 54.91/54.76 inference(resolution,[],[f7172,f569])). 54.91/54.76 tff(f7364,plain,( 54.91/54.76 spl22_156 | spl22_158 | ~spl22_48 | ~spl22_68), 54.91/54.76 inference(avatar_split_clause,[],[f7302,f1541,f748,f7362,f7359])). 54.91/54.76 tff(f7362,plain,( 54.91/54.76 spl22_158 <=> ! [X17 : tree1] : (node_proj_11(X17) != sK9 | ~all_trees1(size1(X17),sK7))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_158])])). 54.91/54.76 tff(f1541,plain,( 54.91/54.76 spl22_68 <=> ! [X2 : tree1] : (node1(sK14(sK10(X2)),sK15(sK10(X2))) = sK10(X2) | ~all_trees1(size1(X2),sK7))), 54.91/54.76 introduced(avatar_definition,[new_symbols(naming,[spl22_68])])). 54.91/54.76 tff(f7302,plain,( 54.91/54.76 ( ! [X19:$int,X17:tree1,X18:$int] : (node_proj_11(X17) != sK9 | size1(node_proj_11(sK9)) != X18 | ~$less(X18,$sum(X19,1)) | sK6 != X19 | ~all_trees1(size1(X17),sK7)) ) | (~spl22_48 | ~spl22_68)), 54.91/54.76 inference(inner_rewriting,[],[f7266])). 54.91/54.76 tff(f7266,plain,( 54.91/54.76 ( ! [X19:$int,X17:tree1,X18:$int] : (node_proj_11(X17) != sK9 | size1(node_proj_11(node_proj_11(X17))) != X18 | ~$less(X18,$sum(X19,1)) | sK6 != X19 | ~all_trees1(size1(X17),sK7)) ) | (~spl22_48 | ~spl22_68)), 54.91/54.76 inference(superposition,[],[f749,f3027])). 54.91/54.76 tff(f3027,plain,( 54.91/54.76 ( ! [X1:tree1] : (node1(node_proj_11(node_proj_11(X1)),node_proj_21(node_proj_11(X1))) = node_proj_11(X1) | ~all_trees1(size1(X1),sK7)) ) | ~spl22_68), 54.91/54.76 inference(duplicate_literal_removal,[],[f2991])). 54.91/54.76 tff(f2991,plain,( 54.91/54.76 ( ! [X1:tree1] : (node1(node_proj_11(node_proj_11(X1)),node_proj_21(node_proj_11(X1))) = node_proj_11(X1) | ~all_trees1(size1(X1),sK7) | ~all_trees1(size1(X1),sK7)) ) | ~spl22_68), 54.91/54.76 inference(superposition,[],[f2713,f2587])). 54.91/54.76 tff(f2587,plain,( 54.91/54.76 ( ! [X0:tree1] : (node_proj_11(node_proj_11(X0)) = sK14(node_proj_11(X0)) | ~all_trees1(size1(X0),sK7)) ) | ~spl22_68), 54.91/54.76 inference(duplicate_literal_removal,[],[f2582])). 54.91/54.76 tff(f2582,plain,( 54.91/54.76 ( ! [X0:tree1] : (node_proj_11(node_proj_11(X0)) = sK14(node_proj_11(X0)) | ~all_trees1(size1(X0),sK7) | ~all_trees1(size1(X0),sK7)) ) | ~spl22_68), 54.91/54.76 inference(superposition,[],[f2536,f596])). 54.91/54.76 tff(f596,plain,( 54.91/54.76 ( ! [X0:tree1] : (node_proj_11(X0) = sK10(X0) | ~all_trees1(size1(X0),sK7)) )), 54.91/54.76 inference(resolution,[],[f570,f369])). 54.91/54.76 tff(f369,plain,( 54.91/54.76 ( ! [X2:tree1,X1:list_tree] : (mem(tree,t2tb2(X2),t2tb1(X1)) | ~all_trees1(size1(X2),X1)) )), 54.91/54.76 inference(equality_resolution,[],[f317])). 54.91/54.76 tff(f317,plain,( 54.91/54.76 ( ! [X2:tree1,X0:$int,X1:list_tree] : (mem(tree,t2tb2(X2),t2tb1(X1)) | size1(X2) != X0 | ~all_trees1(X0,X1)) )), 54.91/54.76 inference(cnf_transformation,[],[f206])). 54.91/54.76 tff(f206,plain,( 54.91/54.76 ! [X0 : $int,X1 : list_tree] : ((! [X2 : tree1] : ((size1(X2) = X0 | ~mem(tree,t2tb2(X2),t2tb1(X1))) & (mem(tree,t2tb2(X2),t2tb1(X1)) | size1(X2) != X0)) & distinct(tree,t2tb1(X1))) | ~all_trees1(X0,X1))), 54.91/54.76 inference(nnf_transformation,[],[f165])). 54.91/54.76 tff(f165,plain,( 54.91/54.76 ! [X0 : $int,X1 : list_tree] : ((! [X2 : tree1] : (size1(X2) = X0 <=> mem(tree,t2tb2(X2),t2tb1(X1))) & distinct(tree,t2tb1(X1))) | ~all_trees1(X0,X1))), 54.91/54.76 inference(ennf_transformation,[],[f157])). 54.91/54.76 tff(f157,plain,( 54.91/54.76 ! [X0 : $int,X1 : list_tree] : (all_trees1(X0,X1) => (! [X2 : tree1] : (size1(X2) = X0 <=> mem(tree,t2tb2(X2),t2tb1(X1))) & distinct(tree,t2tb1(X1))))), 54.91/54.76 inference(unused_predicate_definition_removal,[],[f119])). 54.91/54.76 tff(f119,plain,( 54.91/54.76 ! [X0 : $int,X1 : list_tree] : (all_trees1(X0,X1) <=> (! [X2 : tree1] : (size1(X2) = X0 <=> mem(tree,t2tb2(X2),t2tb1(X1))) & distinct(tree,t2tb1(X1))))), 54.91/54.76 inference(rectify,[],[f7])). 54.91/54.76 tff(f7,axiom,( 54.91/54.76 ! [X6 : $int,X7 : list_tree] : (all_trees1(X6,X7) <=> (! [X8 : tree1] : (size1(X8) = X6 <=> mem(tree,t2tb2(X8),t2tb1(X7))) & distinct(tree,t2tb1(X7))))), 54.91/54.76 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',all_trees_def)). 54.91/54.76 tff(f2536,plain,( 54.91/54.76 ( ! [X2:tree1] : (node_proj_11(sK10(X2)) = sK14(sK10(X2)) | ~all_trees1(size1(X2),sK7)) ) | ~spl22_68), 54.91/54.76 inference(superposition,[],[f292,f1542])). 54.91/54.76 tff(f1542,plain,( 54.91/54.76 ( ! [X2:tree1] : (node1(sK14(sK10(X2)),sK15(sK10(X2))) = sK10(X2) | ~all_trees1(size1(X2),sK7)) ) | ~spl22_68), 54.91/54.76 inference(avatar_component_clause,[],[f1541])). 54.91/54.76 tff(f2713,plain,( 54.91/54.76 ( ! [X0:tree1] : (node1(sK14(node_proj_11(X0)),node_proj_21(node_proj_11(X0))) = node_proj_11(X0) | ~all_trees1(size1(X0),sK7)) ) | ~spl22_68), 54.91/54.76 inference(duplicate_literal_removal,[],[f2680])). 54.91/54.76 tff(f2680,plain,( 54.91/54.76 ( ! [X0:tree1] : (node1(sK14(node_proj_11(X0)),node_proj_21(node_proj_11(X0))) = node_proj_11(X0) | ~all_trees1(size1(X0),sK7) | ~all_trees1(size1(X0),sK7)) ) | ~spl22_68), 54.91/54.76 inference(superposition,[],[f2564,f2581])). 54.91/54.76 tff(f2581,plain,( 54.91/54.76 ( ! [X0:tree1] : (node_proj_21(node_proj_11(X0)) = sK15(node_proj_11(X0)) | ~all_trees1(size1(X0),sK7)) ) | ~spl22_68), 54.91/54.76 inference(duplicate_literal_removal,[],[f2577])). 54.91/54.76 tff(f2577,plain,( 54.91/54.76 ( ! [X0:tree1] : (node_proj_21(node_proj_11(X0)) = sK15(node_proj_11(X0)) | ~all_trees1(size1(X0),sK7) | ~all_trees1(size1(X0),sK7)) ) | ~spl22_68), 54.91/54.76 inference(superposition,[],[f2535,f596])). 54.91/54.76 tff(f2535,plain,( 54.91/54.76 ( ! [X1:tree1] : (node_proj_21(sK10(X1)) = sK15(sK10(X1)) | ~all_trees1(size1(X1),sK7)) ) | ~spl22_68), 54.91/54.76 inference(superposition,[],[f291,f1542])). 54.91/54.76 tff(f2564,plain,( 54.91/54.76 ( ! [X0:tree1] : (node1(sK14(node_proj_11(X0)),sK15(node_proj_11(X0))) = node_proj_11(X0) | ~all_trees1(size1(X0),sK7)) ) | ~spl22_68), 54.91/54.76 inference(duplicate_literal_removal,[],[f2532])). 54.91/54.76 tff(f2532,plain,( 54.91/54.76 ( ! [X0:tree1] : (node1(sK14(node_proj_11(X0)),sK15(node_proj_11(X0))) = node_proj_11(X0) | ~all_trees1(size1(X0),sK7) | ~all_trees1(size1(X0),sK7)) ) | ~spl22_68), 54.91/54.76 inference(superposition,[],[f1542,f596])). 54.91/54.76 tff(f7357,plain,( 54.91/54.76 spl22_154 | ~spl22_146), 54.91/54.76 inference(avatar_split_clause,[],[f7228,f7177,f7354])). 54.91/54.76 tff(f7228,plain,( 54.91/54.76 $less(size1(sK12(sK9)),sK6) | ~spl22_146), 54.91/54.76 inference(forward_demodulation,[],[f7225,f276])). 54.91/54.76 tff(f7225,plain,( 54.91/54.76 $less(size1(sK12(tb2t2(t2tb2(sK9)))),sK6) | ~spl22_146), 54.91/54.76 inference(resolution,[],[f7178,f916])). 54.91/54.76 tff(f916,plain,( 54.91/54.76 ( ! [X0:uni] : (~mem(tree,X0,get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | $less(size1(sK12(tb2t2(X0))),sK6)) )), 54.91/54.76 inference(superposition,[],[f915,f274])). 54.91/54.76 tff(f915,plain,( 54.91/54.76 ( ! [X0:tree1] : (~mem(tree,t2tb2(X0),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | $less(size1(sK12(X0)),sK6)) )), 54.91/54.76 inference(equality_resolution,[],[f799])). 54.91/54.76 tff(f799,plain,( 54.91/54.76 ( ! [X0:$int,X1:tree1] : (sK6 != X0 | $less(size1(sK12(X1)),X0) | ~mem(tree,t2tb2(X1),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) )), 54.91/54.76 inference(equality_resolution,[],[f390])). 54.91/54.76 tff(f7356,plain,( 54.91/54.76 spl22_154 | ~spl22_146), 54.91/54.76 inference(avatar_split_clause,[],[f7220,f7177,f7354])). 54.91/54.76 tff(f7220,plain,( 54.91/54.76 $less(size1(sK12(sK9)),sK6) | ~spl22_146), 54.91/54.76 inference(resolution,[],[f7178,f915])). 54.91/54.76 tff(f7248,plain,( 54.91/54.76 spl22_152 | ~spl22_144), 54.91/54.76 inference(avatar_split_clause,[],[f7181,f7171,f7246])). 54.91/54.76 tff(f7232,plain,( 54.91/54.76 spl22_148 | ~spl22_144), 54.91/54.76 inference(avatar_split_clause,[],[f7180,f7171,f7209])). 54.91/54.76 tff(f7180,plain,( 54.91/54.76 size1(sK10(sK9)) = sK6 | ~spl22_144), 54.91/54.76 inference(resolution,[],[f7172,f254])). 54.91/54.76 tff(f7231,plain,( 54.91/54.76 spl22_50 | ~spl22_146), 54.91/54.76 inference(avatar_split_clause,[],[f7222,f7177,f751])). 54.91/54.76 tff(f7222,plain,( 54.91/54.76 size1(sK9) = sK3 | ~spl22_146), 54.91/54.76 inference(resolution,[],[f7178,f234])). 54.91/54.76 tff(f234,plain,( 54.91/54.76 ( ! [X18:tree1] : (~mem(tree,t2tb2(X18),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | size1(X18) = sK3) )), 54.91/54.76 inference(cnf_transformation,[],[f198])). 54.91/54.77 tff(f7219,plain,( 54.91/54.77 ~spl22_151 | spl22_145), 54.91/54.77 inference(avatar_split_clause,[],[f7212,f7168,f7217])). 54.91/54.77 tff(f7217,plain,( 54.91/54.77 spl22_151 <=> ~all_trees1(size1(sK9),sK7)), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_151])])). 54.91/54.77 tff(f7212,plain,( 54.91/54.77 ~all_trees1(size1(sK9),sK7) | ~spl22_145), 54.91/54.77 inference(resolution,[],[f7169,f369])). 54.91/54.77 tff(f7169,plain,( 54.91/54.77 ~mem(tree,t2tb2(sK9),t2tb1(sK7)) | ~spl22_145), 54.91/54.77 inference(avatar_component_clause,[],[f7168])). 54.91/54.77 tff(f7211,plain,( 54.91/54.77 spl22_148 | ~spl22_144), 54.91/54.77 inference(avatar_split_clause,[],[f7180,f7171,f7209])). 54.91/54.77 tff(f7190,plain,( 54.91/54.77 ~spl22_58 | ~spl22_144), 54.91/54.77 inference(avatar_contradiction_clause,[],[f7189])). 54.91/54.77 tff(f7189,plain,( 54.91/54.77 $false | (~spl22_58 | ~spl22_144)), 54.91/54.77 inference(resolution,[],[f7172,f1223])). 54.91/54.77 tff(f1223,plain,( 54.91/54.77 ( ! [X5:uni] : (~mem(tree,X5,t2tb1(sK7))) ) | ~spl22_58), 54.91/54.77 inference(avatar_component_clause,[],[f1222])). 54.91/54.77 tff(f7179,plain,( 54.91/54.77 spl22_144 | spl22_146 | ~spl22_28 | ~spl22_102), 54.91/54.77 inference(avatar_split_clause,[],[f4611,f2875,f558,f7177,f7171])). 54.91/54.77 tff(f558,plain,( 54.91/54.77 spl22_28 <=> mem(tree,t2tb2(sK9),get(list(tree),int,t2tb3(sK8),t2tb(sK3)))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_28])])). 54.91/54.77 tff(f2875,plain,( 54.91/54.77 spl22_102 <=> infix_plpl(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) = get(list(tree),int,t2tb3(sK8),t2tb(sK3))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_102])])). 54.91/54.77 tff(f4611,plain,( 54.91/54.77 mem(tree,t2tb2(sK9),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | mem(tree,t2tb2(sK9),t2tb1(sK7)) | (~spl22_28 | ~spl22_102)), 54.91/54.77 inference(resolution,[],[f2986,f559])). 54.91/54.77 tff(f559,plain,( 54.91/54.77 mem(tree,t2tb2(sK9),get(list(tree),int,t2tb3(sK8),t2tb(sK3))) | ~spl22_28), 54.91/54.77 inference(avatar_component_clause,[],[f558])). 54.91/54.77 tff(f2986,plain,( 54.91/54.77 ( ! [X1:uni] : (~mem(tree,X1,get(list(tree),int,t2tb3(sK8),t2tb(sK3))) | mem(tree,X1,get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | mem(tree,X1,t2tb1(sK7))) ) | ~spl22_102), 54.91/54.77 inference(superposition,[],[f354,f2876])). 54.91/54.77 tff(f2876,plain,( 54.91/54.77 infix_plpl(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) = get(list(tree),int,t2tb3(sK8),t2tb(sK3)) | ~spl22_102), 54.91/54.77 inference(avatar_component_clause,[],[f2875])). 54.91/54.77 tff(f354,plain,( 54.91/54.77 ( ! [X2:uni,X0:ty,X3:uni,X1:uni] : (~mem(X0,X1,infix_plpl(X0,X2,X3)) | mem(X0,X1,X3) | mem(X0,X1,X2)) )), 54.91/54.77 inference(cnf_transformation,[],[f213])). 54.91/54.77 tff(f213,plain,( 54.91/54.77 ! [X0 : ty,X1 : uni,X2 : uni,X3 : uni] : ((mem(X0,X1,infix_plpl(X0,X2,X3)) | (~mem(X0,X1,X2) & ~mem(X0,X1,X3))) & (mem(X0,X1,X2) | mem(X0,X1,X3) | ~mem(X0,X1,infix_plpl(X0,X2,X3))))), 54.91/54.77 inference(flattening,[],[f212])). 54.91/54.77 tff(f212,plain,( 54.91/54.77 ! [X0 : ty,X1 : uni,X2 : uni,X3 : uni] : ((mem(X0,X1,infix_plpl(X0,X2,X3)) | (~mem(X0,X1,X2) & ~mem(X0,X1,X3))) & ((mem(X0,X1,X2) | mem(X0,X1,X3)) | ~mem(X0,X1,infix_plpl(X0,X2,X3))))), 54.91/54.77 inference(nnf_transformation,[],[f150])). 54.91/54.77 tff(f150,plain,( 54.91/54.77 ! [X0 : ty,X1 : uni,X2 : uni,X3 : uni] : (mem(X0,X1,infix_plpl(X0,X2,X3)) <=> (mem(X0,X1,X2) | mem(X0,X1,X3)))), 54.91/54.77 inference(rectify,[],[f72])). 54.91/54.77 tff(f72,axiom,( 54.91/54.77 ! [X4 : ty,X2 : uni,X27 : uni,X18 : uni] : (mem(X4,X2,infix_plpl(X4,X27,X18)) <=> (mem(X4,X2,X27) | mem(X4,X2,X18)))), 54.91/54.77 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mem_append)). 54.91/54.77 tff(f7117,plain,( 54.91/54.77 spl22_142 | spl22_60), 54.91/54.77 inference(avatar_split_clause,[],[f1069,f1225,f7115])). 54.91/54.77 tff(f1225,plain,( 54.91/54.77 spl22_60 <=> ! [X6 : $int] : ($sum($sum(sK3,-1),$uminus(sK6)) != X6 | ~$less(X6,0))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_60])])). 54.91/54.77 tff(f1069,plain,( 54.91/54.77 ( ! [X4:tree1,X5:$int] : ($sum($sum(sK3,-1),$uminus(sK6)) != X5 | ~$less(X5,0) | ~mem(tree,t2tb2(X4),t2tb1(sK7))) )), 54.91/54.77 inference(superposition,[],[f409,f1064])). 54.91/54.77 tff(f409,plain,( 54.91/54.77 ( ! [X0:tree1,X1:$int] : (size1(X0) != X1 | ~$less(X1,0)) )), 54.91/54.77 inference(theory_flattening,[],[f266])). 54.91/54.77 tff(f266,plain,( 54.91/54.77 ( ! [X0:tree1] : (~$less(size1(X0),0)) )), 54.91/54.77 inference(cnf_transformation,[],[f88])). 54.91/54.77 tff(f88,plain,( 54.91/54.77 ! [X0 : tree1] : ~$less(size1(X0),0)), 54.91/54.77 inference(rectify,[],[f81])). 54.91/54.77 tff(f81,plain,( 54.91/54.77 ! [X8 : tree1] : ~$less(size1(X8),0)), 54.91/54.77 inference(evaluation,[],[f75])). 54.91/54.77 tff(f75,axiom,( 54.91/54.77 ! [X8 : tree1] : $lesseq(0,size1(X8))), 54.91/54.77 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',size_nonneg)). 54.91/54.77 tff(f7113,plain,( 54.91/54.77 spl22_58 | spl22_140), 54.91/54.77 inference(avatar_split_clause,[],[f6881,f7111,f1222])). 54.91/54.77 tff(f6881,plain,( 54.91/54.77 ( ! [X6:$int,X5:uni] : ($sum($sum(sK6,sK3),$uminus(sK6)) != X6 | ~$less(X6,0) | ~mem(tree,X5,t2tb1(sK7))) )), 54.91/54.77 inference(superposition,[],[f409,f6871])). 54.91/54.77 tff(f6121,plain,( 54.91/54.77 ~spl22_1 | spl22_138 | ~spl22_58), 54.91/54.77 inference(avatar_split_clause,[],[f3897,f1222,f6119,f435])). 54.91/54.77 tff(f435,plain,( 54.91/54.77 spl22_1 <=> ~distinct(tree,t2tb1(sK7))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_1])])). 54.91/54.77 tff(f6119,plain,( 54.91/54.77 spl22_138 <=> ! [X2 : uni] : (distinct(tree,infix_plpl(tree,X2,t2tb1(sK7))) | ~distinct(tree,X2))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_138])])). 54.91/54.77 tff(f3897,plain,( 54.91/54.77 ( ! [X2:uni] : (distinct(tree,infix_plpl(tree,X2,t2tb1(sK7))) | ~distinct(tree,t2tb1(sK7)) | ~distinct(tree,X2)) ) | ~spl22_58), 54.91/54.77 inference(resolution,[],[f1223,f335])). 54.91/54.77 tff(f335,plain,( 54.91/54.77 ( ! [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)) )), 54.91/54.77 inference(cnf_transformation,[],[f209])). 54.91/54.77 tff(f6117,plain,( 54.91/54.77 spl22_136 | spl22_132), 54.91/54.77 inference(avatar_split_clause,[],[f2312,f6000,f6115])). 54.91/54.77 tff(f6115,plain,( 54.91/54.77 spl22_136 <=> ! [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)))))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_136])])). 54.91/54.77 tff(f2312,plain,( 54.91/54.77 ( ! [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)) )), 54.91/54.77 inference(superposition,[],[f412,f717])). 54.91/54.77 tff(f717,plain,( 54.91/54.77 ( ! [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)) )), 54.91/54.77 inference(global_subsumption,[],[f237,f715])). 54.91/54.77 tff(f715,plain,( 54.91/54.77 ( ! [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)) )), 54.91/54.77 inference(resolution,[],[f619,f335])). 54.91/54.77 tff(f619,plain,( 54.91/54.77 ( ! [X0:uni] : (~mem(tree,X0,get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | size1(tb2t2(X0)) = sK3) )), 54.91/54.77 inference(superposition,[],[f234,f274])). 54.91/54.77 tff(f6055,plain,( 54.91/54.77 ~spl22_135 | ~spl22_132), 54.91/54.77 inference(avatar_split_clause,[],[f6048,f6000,f6053])). 54.91/54.77 tff(f6053,plain,( 54.91/54.77 spl22_135 <=> ~$less(0,sK3)), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_135])])). 54.91/54.77 tff(f6048,plain,( 54.91/54.77 ~$less(0,sK3) | ~spl22_132), 54.91/54.77 inference(equality_resolution,[],[f6001])). 54.91/54.77 tff(f6001,plain,( 54.91/54.77 ( ! [X9:$int] : (sK3 != X9 | ~$less(0,X9)) ) | ~spl22_132), 54.91/54.77 inference(avatar_component_clause,[],[f6000])). 54.91/54.77 tff(f6002,plain,( 54.91/54.77 spl22_130 | spl22_132), 54.91/54.77 inference(avatar_split_clause,[],[f2101,f6000,f5997])). 54.91/54.77 tff(f5997,plain,( 54.91/54.77 spl22_130 <=> ! [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)))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_130])])). 54.91/54.77 tff(f2101,plain,( 54.91/54.77 ( ! [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)) )), 54.91/54.77 inference(superposition,[],[f412,f716])). 54.91/54.77 tff(f716,plain,( 54.91/54.77 ( ! [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)) )), 54.91/54.77 inference(global_subsumption,[],[f237,f714])). 54.91/54.77 tff(f714,plain,( 54.91/54.77 ( ! [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)))) )), 54.91/54.77 inference(resolution,[],[f619,f334])). 54.91/54.77 tff(f5995,plain,( 54.91/54.77 spl22_58 | spl22_128 | ~spl22_124), 54.91/54.77 inference(avatar_split_clause,[],[f5903,f5857,f5993,f1222])). 54.91/54.77 tff(f5993,plain,( 54.91/54.77 spl22_128 <=> ! [X1 : tree1,X2 : tree1] : (size1(X1) != sK3 | ~all_trees1(size1(node1(X2,X1)),sK7))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_128])])). 54.91/54.77 tff(f5857,plain,( 54.91/54.77 spl22_124 <=> ! [X3 : $int,X4 : $int] : ($sum($sum(X3,-1),$uminus(X4)) != sK3 | sK6 != X4 | sK3 != X3)), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_124])])). 54.91/54.77 tff(f5903,plain,( 54.91/54.77 ( ! [X2:tree1,X0:uni,X1:tree1] : (size1(X1) != sK3 | ~mem(tree,X0,t2tb1(sK7)) | ~all_trees1(size1(node1(X2,X1)),sK7)) ) | ~spl22_124), 54.91/54.77 inference(duplicate_literal_removal,[],[f5885])). 54.91/54.77 tff(f5885,plain,( 54.91/54.77 ( ! [X2:tree1,X0:uni,X1:tree1] : (size1(X1) != sK3 | ~mem(tree,X0,t2tb1(sK7)) | ~mem(tree,X0,t2tb1(sK7)) | ~all_trees1(size1(node1(X2,X1)),sK7)) ) | ~spl22_124), 54.91/54.77 inference(superposition,[],[f5865,f2136])). 54.91/54.77 tff(f2136,plain,( 54.91/54.77 ( ! [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)) )), 54.91/54.77 inference(resolution,[],[f1254,f369])). 54.91/54.77 tff(f1254,plain,( 54.91/54.77 ( ! [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))) )), 54.91/54.77 inference(superposition,[],[f1198,f1079])). 54.91/54.77 tff(f5865,plain,( 54.91/54.77 ( ! [X3:uni] : (size1(node_proj_21(tb2t2(X3))) != sK3 | ~mem(tree,X3,t2tb1(sK7))) ) | ~spl22_124), 54.91/54.77 inference(trivial_inequality_removal,[],[f5862])). 54.91/54.77 tff(f5862,plain,( 54.91/54.77 ( ! [X3:uni] : (size1(node_proj_21(tb2t2(X3))) != sK3 | sK6 != sK6 | sK3 != sK3 | ~mem(tree,X3,t2tb1(sK7))) ) | ~spl22_124), 54.91/54.77 inference(superposition,[],[f5858,f1079])). 54.91/54.77 tff(f5858,plain,( 54.91/54.77 ( ! [X4:$int,X3:$int] : ($sum($sum(X3,-1),$uminus(X4)) != sK3 | sK6 != X4 | sK3 != X3) ) | ~spl22_124), 54.91/54.77 inference(avatar_component_clause,[],[f5857])). 54.91/54.77 tff(f5985,plain,( 54.91/54.77 spl22_58 | ~spl22_127 | ~spl22_124), 54.91/54.77 inference(avatar_split_clause,[],[f5898,f5857,f5983,f1222])). 54.91/54.77 tff(f5983,plain,( 54.91/54.77 spl22_127 <=> $sum($sum(sK3,-1),$uminus(sK6)) != sK3), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_127])])). 54.91/54.77 tff(f5898,plain,( 54.91/54.77 ( ! [X11:uni] : ($sum($sum(sK3,-1),$uminus(sK6)) != sK3 | ~mem(tree,X11,t2tb1(sK7))) ) | ~spl22_124), 54.91/54.77 inference(duplicate_literal_removal,[],[f5890])). 54.91/54.77 tff(f5890,plain,( 54.91/54.77 ( ! [X11:uni] : ($sum($sum(sK3,-1),$uminus(sK6)) != sK3 | ~mem(tree,X11,t2tb1(sK7)) | ~mem(tree,X11,t2tb1(sK7))) ) | ~spl22_124), 54.91/54.77 inference(superposition,[],[f5865,f1079])). 54.91/54.77 tff(f5859,plain,( 54.91/54.77 spl22_122 | spl22_124), 54.91/54.77 inference(avatar_split_clause,[],[f2099,f5857,f5854])). 54.91/54.77 tff(f5854,plain,( 54.91/54.77 spl22_122 <=> ! [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)))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_122])])). 54.91/54.77 tff(f2099,plain,( 54.91/54.77 ( ! [X4:$int,X2:uni,X5:tree1,X3:$int] : ($sum($sum(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)) )), 54.91/54.77 inference(superposition,[],[f904,f716])). 54.91/54.77 tff(f904,plain,( 54.91/54.77 ( ! [X2:$int,X0:tree1,X3:$int,X1:tree1] : (size1(X1) != $sum($sum(X2,-1),$uminus(X3)) | size1(X0) != sK6 | sK3 != X2 | sK6 != X3 | mem(tree,t2tb2(node1(X0,X1)),t2tb1(sK7))) )), 54.91/54.77 inference(equality_resolution,[],[f420])). 54.91/54.77 tff(f420,plain,( 54.91/54.77 ( ! [X19:$int,X17:$int,X15:tree1,X18:$int,X16:tree1] : ($sum($sum(X18,-1),$uminus(X19)) != X17 | size1(X15) != sK6 | size1(X16) != X17 | sK3 != X18 | sK6 != X19 | mem(tree,t2tb2(node1(X15,X16)),t2tb1(sK7))) )), 54.91/54.77 inference(evaluation,[],[f377])). 54.91/54.77 tff(f377,plain,( 54.91/54.77 ( ! [X19:$int,X17:$int,X15:tree1,X18:$int,X16:tree1] : (mem(tree,t2tb2(node1(X15,X16)),t2tb1(sK7)) | size1(X15) != sK6 | size1(X16) != X17 | sK3 != X18 | sK6 != X19 | $sum($sum(X18,$uminus(1)),$uminus(X19)) != X17) )), 54.91/54.77 inference(theory_flattening,[],[f366])). 54.91/54.77 tff(f366,plain,( 54.91/54.77 ( ! [X15:tree1,X16:tree1] : (mem(tree,t2tb2(node1(X15,X16)),t2tb1(sK7)) | size1(X15) != sK6 | size1(X16) != $sum($sum(sK3,$uminus(1)),$uminus(sK6))) )), 54.91/54.77 inference(equality_resolution,[],[f251])). 54.91/54.77 tff(f251,plain,( 54.91/54.77 ( ! [X12:tree1,X15:tree1,X16:tree1] : (mem(tree,t2tb2(X12),t2tb1(sK7)) | size1(X15) != sK6 | size1(X16) != $sum($sum(sK3,$uminus(1)),$uminus(sK6)) | node1(X15,X16) != X12) )), 54.91/54.77 inference(cnf_transformation,[],[f198])). 54.91/54.77 tff(f5379,plain,( 54.91/54.77 ~spl22_1 | ~spl22_17 | spl22_118 | spl22_120 | ~spl22_102), 54.91/54.77 inference(avatar_split_clause,[],[f2984,f2875,f5377,f5371,f500,f435])). 54.91/54.77 tff(f500,plain,( 54.91/54.77 spl22_17 <=> ~distinct(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_17])])). 54.91/54.77 tff(f5371,plain,( 54.91/54.77 spl22_118 <=> sort1(tree,sK19(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3))))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_118])])). 54.91/54.77 tff(f5377,plain,( 54.91/54.77 spl22_120 <=> distinct(tree,get(list(tree),int,t2tb3(sK8),t2tb(sK3)))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_120])])). 54.91/54.77 tff(f2984,plain,( 54.91/54.77 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), 54.91/54.77 inference(superposition,[],[f333,f2876])). 54.91/54.77 tff(f333,plain,( 54.91/54.77 ( ! [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)) )), 54.91/54.77 inference(cnf_transformation,[],[f209])). 54.91/54.77 tff(f4109,plain,( 54.91/54.77 spl22_116 | spl22_90), 54.91/54.77 inference(avatar_split_clause,[],[f1186,f2317,f4107])). 54.91/54.77 tff(f1186,plain,( 54.91/54.77 ( ! [X30:$int,X28:uni,X31:tree1,X29:$int] : ($sum($sum(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))) )), 54.91/54.77 inference(superposition,[],[f904,f521])). 54.91/54.77 tff(f3941,plain,( 54.91/54.77 ~spl22_1 | spl22_114 | ~spl22_58), 54.91/54.77 inference(avatar_split_clause,[],[f3896,f1222,f3939,f435])). 54.91/54.77 tff(f3939,plain,( 54.91/54.77 spl22_114 <=> ! [X1 : uni] : (distinct(tree,infix_plpl(tree,t2tb1(sK7),X1)) | ~distinct(tree,X1))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_114])])). 54.91/54.77 tff(f3896,plain,( 54.91/54.77 ( ! [X1:uni] : (distinct(tree,infix_plpl(tree,t2tb1(sK7),X1)) | ~distinct(tree,X1) | ~distinct(tree,t2tb1(sK7))) ) | ~spl22_58), 54.91/54.77 inference(resolution,[],[f1223,f334])). 54.91/54.77 tff(f3894,plain,( 54.91/54.77 ~spl22_45 | spl22_112 | ~spl22_86), 54.91/54.77 inference(avatar_split_clause,[],[f2046,f1988,f3892,f738])). 54.91/54.77 tff(f738,plain,( 54.91/54.77 spl22_45 <=> ~sort1(list(tree),nil(tree))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_45])])). 54.91/54.77 tff(f3892,plain,( 54.91/54.77 spl22_112 <=> ! [X1 : uni] : (nil(tree) = get(list(tree),int,t2tb3(sK1),X1) | t2tb(0) = X1 | ~sort1(int,X1))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_112])])). 54.91/54.77 tff(f1988,plain,( 54.91/54.77 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)), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_86])])). 54.91/54.77 tff(f2046,plain,( 54.91/54.77 ( ! [X1:uni] : (nil(tree) = get(list(tree),int,t2tb3(sK1),X1) | ~sort1(int,X1) | t2tb(0) = X1 | ~sort1(list(tree),nil(tree))) ) | ~spl22_86), 54.91/54.77 inference(superposition,[],[f1989,f353])). 54.91/54.77 tff(f353,plain,( 54.91/54.77 ( ! [X2:uni,X0:ty,X3:uni,X1:ty] : (get(X1,X0,const(X1,X0,X2),X3) = X2 | ~sort1(X1,X2)) )), 54.91/54.77 inference(cnf_transformation,[],[f179])). 54.91/54.77 tff(f179,plain,( 54.91/54.77 ! [X0 : ty,X1 : ty,X2 : uni,X3 : uni] : (get(X1,X0,const(X1,X0,X2),X3) = X2 | ~sort1(X1,X2))), 54.91/54.77 inference(ennf_transformation,[],[f149])). 54.91/54.77 tff(f149,plain,( 54.91/54.77 ! [X0 : ty,X1 : ty,X2 : uni,X3 : uni] : (sort1(X1,X2) => get(X1,X0,const(X1,X0,X2),X3) = X2)), 54.91/54.77 inference(rectify,[],[f43])). 54.91/54.77 tff(f43,axiom,( 54.91/54.77 ! [X4 : ty,X10 : ty,X14 : uni,X12 : uni] : (sort1(X10,X14) => get(X10,X4,const(X10,X4,X14),X12) = X14)), 54.91/54.77 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',const)). 54.91/54.77 tff(f1989,plain,( 54.91/54.77 ( ! [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), 54.91/54.77 inference(avatar_component_clause,[],[f1988])). 54.91/54.77 tff(f3890,plain,( 54.91/54.77 spl22_58 | spl22_110 | ~spl22_90), 54.91/54.77 inference(avatar_split_clause,[],[f2363,f2317,f3888,f1222])). 54.91/54.77 tff(f3888,plain,( 54.91/54.77 spl22_110 <=> ! [X1 : tree1,X2 : tree1] : (size1(X1) != sK6 | ~all_trees1(size1(node1(X2,X1)),sK7))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_110])])). 54.91/54.77 tff(f2363,plain,( 54.91/54.77 ( ! [X2:tree1,X0:uni,X1:tree1] : (size1(X1) != sK6 | ~mem(tree,X0,t2tb1(sK7)) | ~all_trees1(size1(node1(X2,X1)),sK7)) ) | ~spl22_90), 54.91/54.77 inference(duplicate_literal_removal,[],[f2345])). 54.91/54.77 tff(f2345,plain,( 54.91/54.77 ( ! [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), 54.91/54.77 inference(superposition,[],[f2325,f2136])). 54.91/54.77 tff(f2325,plain,( 54.91/54.77 ( ! [X3:uni] : (size1(node_proj_21(tb2t2(X3))) != sK6 | ~mem(tree,X3,t2tb1(sK7))) ) | ~spl22_90), 54.91/54.77 inference(trivial_inequality_removal,[],[f2322])). 54.91/54.77 tff(f2322,plain,( 54.91/54.77 ( ! [X3:uni] : (size1(node_proj_21(tb2t2(X3))) != sK6 | sK6 != sK6 | sK3 != sK3 | ~mem(tree,X3,t2tb1(sK7))) ) | ~spl22_90), 54.91/54.77 inference(superposition,[],[f2318,f1079])). 54.91/54.77 tff(f3289,plain,( 54.91/54.77 ~spl22_109 | ~spl22_66), 54.91/54.77 inference(avatar_split_clause,[],[f3282,f1331,f3287])). 54.91/54.77 tff(f3287,plain,( 54.91/54.77 spl22_109 <=> ~$less(sK6,sK6)), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_109])])). 54.91/54.77 tff(f1331,plain,( 54.91/54.77 spl22_66 <=> ! [X1 : $int,X2 : $int] : (sK6 != X1 | ~$less(X1,X2) | sK6 != X2)), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_66])])). 54.91/54.77 tff(f3282,plain,( 54.91/54.77 ~$less(sK6,sK6) | ~spl22_66), 54.91/54.77 inference(equality_resolution,[],[f3281])). 54.91/54.77 tff(f3281,plain,( 54.91/54.77 ( ! [X0:$int] : (sK6 != X0 | ~$less(X0,sK6)) ) | ~spl22_66), 54.91/54.77 inference(equality_resolution,[],[f1332])). 54.91/54.77 tff(f1332,plain,( 54.91/54.77 ( ! [X2:$int,X1:$int] : (sK6 != X2 | ~$less(X1,X2) | sK6 != X1) ) | ~spl22_66), 54.91/54.77 inference(avatar_component_clause,[],[f1331])). 54.91/54.77 tff(f3280,plain,( 54.91/54.77 spl22_66 | spl22_106), 54.91/54.77 inference(avatar_split_clause,[],[f1465,f3278,f1331])). 54.91/54.77 tff(f3278,plain,( 54.91/54.77 spl22_106 <=> ! [X12 : uni] : (~mem(tree,X12,t2tb1(sK7)) | size1(tb2t2(X12)) != sK3 | mem(tree,t2tb2(node1(sK10(tb2t2(X12)),sK11(tb2t2(X12)))),get(list(tree),int,t2tb3(sK5),t2tb(sK3))))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_106])])). 54.91/54.77 tff(f1465,plain,( 54.91/54.77 ( ! [X14:$int,X12:uni,X13:$int] : (~mem(tree,X12,t2tb1(sK7)) | sK6 != X13 | mem(tree,t2tb2(node1(sK10(tb2t2(X12)),sK11(tb2t2(X12)))),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | size1(tb2t2(X12)) != sK3 | sK6 != X14 | ~$less(X13,X14)) )), 54.91/54.77 inference(duplicate_literal_removal,[],[f1464])). 54.91/54.77 tff(f1464,plain,( 54.91/54.77 ( ! [X14:$int,X12:uni,X13:$int] : (~mem(tree,X12,t2tb1(sK7)) | sK6 != X13 | mem(tree,t2tb2(node1(sK10(tb2t2(X12)),sK11(tb2t2(X12)))),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | size1(tb2t2(X12)) != sK3 | sK6 != X14 | ~$less(X13,X14) | ~mem(tree,X12,t2tb1(sK7))) )), 54.91/54.77 inference(forward_demodulation,[],[f1444,f274])). 54.91/54.77 tff(f1444,plain,( 54.91/54.77 ( ! [X14:$int,X12:uni,X13:$int] : (sK6 != X13 | mem(tree,t2tb2(node1(sK10(tb2t2(X12)),sK11(tb2t2(X12)))),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | size1(tb2t2(X12)) != sK3 | sK6 != X14 | ~$less(X13,X14) | ~mem(tree,t2tb2(tb2t2(X12)),t2tb1(sK7)) | ~mem(tree,X12,t2tb1(sK7))) )), 54.91/54.77 inference(superposition,[],[f891,f521])). 54.91/54.77 tff(f891,plain,( 54.91/54.77 ( ! [X17:$int,X15:tree1,X16:$int] : (size1(sK10(X15)) != X16 | mem(tree,t2tb2(node1(sK10(X15),sK11(X15))),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | size1(X15) != sK3 | sK6 != X17 | ~$less(X16,X17) | ~mem(tree,t2tb2(X15),t2tb1(sK7))) )), 54.91/54.77 inference(superposition,[],[f389,f252])). 54.91/54.77 tff(f3152,plain,( 54.91/54.77 spl22_104 | ~spl22_56 | ~spl22_102), 54.91/54.77 inference(avatar_split_clause,[],[f2982,f2875,f1091,f3150])). 54.91/54.77 tff(f3150,plain,( 54.91/54.77 spl22_104 <=> set(list(tree),int,t2tb3(sK5),t2tb(sK3),get(list(tree),int,t2tb3(sK8),t2tb(sK3))) = t2tb3(sK8)), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_104])])). 54.91/54.77 tff(f1091,plain,( 54.91/54.77 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)), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_56])])). 54.91/54.77 tff(f2982,plain,( 54.91/54.77 set(list(tree),int,t2tb3(sK5),t2tb(sK3),get(list(tree),int,t2tb3(sK8),t2tb(sK3))) = t2tb3(sK8) | (~spl22_56 | ~spl22_102)), 54.91/54.77 inference(backward_demodulation,[],[f2876,f1092])). 54.91/54.77 tff(f1092,plain,( 54.91/54.77 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), 54.91/54.77 inference(avatar_component_clause,[],[f1091])). 54.91/54.77 tff(f2948,plain,( 54.91/54.77 spl22_101), 54.91/54.77 inference(avatar_contradiction_clause,[],[f2947])). 54.91/54.77 tff(f2947,plain,( 54.91/54.77 $false | ~spl22_101), 54.91/54.77 inference(resolution,[],[f2870,f324])). 54.91/54.77 tff(f324,plain,( 54.91/54.77 ( ! [X2:uni,X0:ty,X1:uni] : (sort1(list(X0),infix_plpl(X0,X1,X2))) )), 54.91/54.77 inference(cnf_transformation,[],[f124])). 54.91/54.77 tff(f124,plain,( 54.91/54.77 ! [X0 : ty,X1 : uni,X2 : uni] : sort1(list(X0),infix_plpl(X0,X1,X2))), 54.91/54.77 inference(rectify,[],[f9])). 54.91/54.77 tff(f9,axiom,( 54.91/54.77 ! [X4 : ty,X2 : uni,X3 : uni] : sort1(list(X4),infix_plpl(X4,X2,X3))), 54.91/54.77 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',infix_plpl_sort2)). 54.91/54.77 tff(f2870,plain,( 54.91/54.77 ~sort1(list(tree),infix_plpl(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3)))) | ~spl22_101), 54.91/54.77 inference(avatar_component_clause,[],[f2869])). 54.91/54.77 tff(f2869,plain,( 54.91/54.77 spl22_101 <=> ~sort1(list(tree),infix_plpl(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3))))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_101])])). 54.91/54.77 tff(f2877,plain,( 54.91/54.77 ~spl22_101 | spl22_102 | ~spl22_56), 54.91/54.77 inference(avatar_split_clause,[],[f1111,f1091,f2875,f2869])). 54.91/54.77 tff(f1111,plain,( 54.91/54.77 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), 54.91/54.77 inference(superposition,[],[f371,f1092])). 54.91/54.77 tff(f371,plain,( 54.91/54.77 ( ! [X4:uni,X2:uni,X0:ty,X5:uni,X1:ty] : (get(X1,X0,set(X1,X0,X2,X4,X5),X4) = X5 | ~sort1(X1,X5)) )), 54.91/54.77 inference(equality_resolution,[],[f362])). 54.91/54.77 tff(f362,plain,( 54.91/54.77 ( ! [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)) )), 54.91/54.77 inference(cnf_transformation,[],[f185])). 54.91/54.77 tff(f185,plain,( 54.91/54.77 ! [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))), 54.91/54.77 inference(flattening,[],[f184])). 54.91/54.77 tff(f184,plain,( 54.91/54.77 ! [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))), 54.91/54.77 inference(ennf_transformation,[],[f156])). 54.91/54.77 tff(f156,plain,( 54.91/54.77 ! [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))), 54.91/54.77 inference(rectify,[],[f15])). 54.91/54.77 tff(f15,axiom,( 54.91/54.77 ! [X4 : ty,X10 : ty,X11 : uni,X12 : uni,X13 : uni,X14 : uni] : (sort1(X10,X14) => (X12 = X13 => get(X10,X4,set(X10,X4,X11,X12,X14),X13) = X14))), 54.91/54.77 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',select_eq)). 54.91/54.77 tff(f2576,plain,( 54.91/54.77 spl22_98 | spl22_70), 54.91/54.77 inference(avatar_split_clause,[],[f553,f1544,f2574])). 54.91/54.77 tff(f553,plain,( 54.91/54.77 ( ! [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))) )), 54.91/54.77 inference(superposition,[],[f412,f521])). 54.91/54.77 tff(f2491,plain,( 54.91/54.77 spl22_58 | ~spl22_97 | ~spl22_90), 54.91/54.77 inference(avatar_split_clause,[],[f2358,f2317,f2489,f1222])). 54.91/54.77 tff(f2489,plain,( 54.91/54.77 spl22_97 <=> $sum($sum(sK3,-1),$uminus(sK6)) != sK6), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_97])])). 54.91/54.77 tff(f2358,plain,( 54.91/54.77 ( ! [X11:uni] : ($sum($sum(sK3,-1),$uminus(sK6)) != sK6 | ~mem(tree,X11,t2tb1(sK7))) ) | ~spl22_90), 54.91/54.77 inference(duplicate_literal_removal,[],[f2350])). 54.91/54.77 tff(f2350,plain,( 54.91/54.77 ( ! [X11:uni] : ($sum($sum(sK3,-1),$uminus(sK6)) != sK6 | ~mem(tree,X11,t2tb1(sK7)) | ~mem(tree,X11,t2tb1(sK7))) ) | ~spl22_90), 54.91/54.77 inference(superposition,[],[f2325,f1079])). 54.91/54.77 tff(f2484,plain,( 54.91/54.77 spl22_92 | ~spl22_95), 54.91/54.77 inference(avatar_split_clause,[],[f2408,f2482,f2476])). 54.91/54.77 tff(f2476,plain,( 54.91/54.77 spl22_92 <=> ! [X7 : tree1,X8 : $int] : (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))) | ~all_trees1(size1(X7),sK7) | empty1 = node_proj_11(X7) | ~$less(size1(node_proj_11(node_proj_11(X7))),X8) | sK3 != X8)), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_92])])). 54.91/54.77 tff(f2482,plain,( 54.91/54.77 spl22_95 <=> sK3 != sK6), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_95])])). 54.91/54.77 tff(f2408,plain,( 54.91/54.77 ( ! [X8:$int,X7:tree1] : (sK3 != sK6 | 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))) | sK3 != X8 | ~$less(size1(node_proj_11(node_proj_11(X7))),X8) | empty1 = node_proj_11(X7) | ~all_trees1(size1(X7),sK7)) )), 54.91/54.77 inference(inner_rewriting,[],[f2372])). 54.91/54.77 tff(f2372,plain,( 54.91/54.77 ( ! [X8:$int,X7:tree1] : (sK3 != sK6 | 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))) | sK6 != X8 | ~$less(size1(node_proj_11(node_proj_11(X7))),X8) | empty1 = node_proj_11(X7) | ~all_trees1(size1(X7),sK7)) )), 54.91/54.77 inference(superposition,[],[f1235,f601])). 54.91/54.77 tff(f601,plain,( 54.91/54.77 ( ! [X1:tree1] : (size1(node_proj_11(X1)) = sK6 | ~all_trees1(size1(X1),sK7)) )), 54.91/54.77 inference(duplicate_literal_removal,[],[f599])). 54.91/54.77 tff(f599,plain,( 54.91/54.77 ( ! [X1:tree1] : (size1(node_proj_11(X1)) = sK6 | ~all_trees1(size1(X1),sK7) | ~all_trees1(size1(X1),sK7)) )), 54.91/54.77 inference(superposition,[],[f520,f596])). 54.91/54.77 tff(f520,plain,( 54.91/54.77 ( ! [X0:tree1] : (size1(sK10(X0)) = sK6 | ~all_trees1(size1(X0),sK7)) )), 54.91/54.77 inference(resolution,[],[f254,f369])). 54.91/54.77 tff(f2319,plain,( 54.91/54.77 spl22_88 | spl22_90), 54.91/54.77 inference(avatar_split_clause,[],[f1184,f2317,f2314])). 54.91/54.77 tff(f2314,plain,( 54.91/54.77 spl22_88 <=> ! [X20 : tree1,X23 : tree1] : (size1(X23) != sK6 | ~all_trees1(size1(X20),sK7) | mem(tree,t2tb2(node1(X23,sK10(X20))),t2tb1(sK7)))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_88])])). 54.91/54.77 tff(f1184,plain,( 54.91/54.77 ( ! [X23:tree1,X21:$int,X22:$int,X20:tree1] : ($sum($sum(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)) )), 54.91/54.77 inference(superposition,[],[f904,f520])). 54.91/54.77 tff(f1992,plain,( 54.91/54.77 spl22_85), 54.91/54.77 inference(avatar_contradiction_clause,[],[f1991])). 54.91/54.77 tff(f1991,plain,( 54.91/54.77 $false | ~spl22_85), 54.91/54.77 inference(resolution,[],[f1986,f269])). 54.91/54.77 tff(f269,plain,( 54.91/54.77 ( ! [X0:$int] : (sort1(int,t2tb(X0))) )), 54.91/54.77 inference(cnf_transformation,[],[f91])). 54.91/54.77 tff(f91,plain,( 54.91/54.77 ! [X0 : $int] : sort1(int,t2tb(X0))), 54.91/54.77 inference(rectify,[],[f58])). 54.91/54.77 tff(f58,axiom,( 54.91/54.77 ! [X2 : $int] : sort1(int,t2tb(X2))), 54.91/54.77 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2tb_sort3)). 54.91/54.77 tff(f1986,plain,( 54.91/54.77 ~sort1(int,t2tb(0)) | ~spl22_85), 54.91/54.77 inference(avatar_component_clause,[],[f1985])). 54.91/54.77 tff(f1985,plain,( 54.91/54.77 spl22_85 <=> ~sort1(int,t2tb(0))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_85])])). 54.91/54.77 tff(f1990,plain,( 54.91/54.77 ~spl22_85 | spl22_86 | ~spl22_54), 54.91/54.77 inference(avatar_split_clause,[],[f1037,f980,f1988,f1985])). 54.91/54.77 tff(f980,plain,( 54.91/54.77 spl22_54 <=> set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree))) = t2tb3(sK1)), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_54])])). 54.91/54.77 tff(f1037,plain,( 54.91/54.77 ( ! [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), 54.91/54.77 inference(superposition,[],[f360,f981])). 54.91/54.77 tff(f981,plain,( 54.91/54.77 set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree))) = t2tb3(sK1) | ~spl22_54), 54.91/54.77 inference(avatar_component_clause,[],[f980])). 54.91/54.77 tff(f360,plain,( 54.91/54.77 ( ! [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)) )), 54.91/54.77 inference(cnf_transformation,[],[f182])). 54.91/54.77 tff(f182,plain,( 54.91/54.77 ! [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))), 54.91/54.77 inference(flattening,[],[f181])). 54.91/54.77 tff(f181,plain,( 54.91/54.77 ! [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))), 54.91/54.77 inference(ennf_transformation,[],[f154])). 54.91/54.77 tff(f154,plain,( 54.91/54.77 ! [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))))), 54.91/54.77 inference(rectify,[],[f49])). 54.91/54.77 tff(f49,axiom,( 54.91/54.77 ! [X4 : ty,X10 : ty,X11 : uni,X12 : uni,X13 : uni] : (sort1(X4,X12) => (sort1(X4,X13) => ! [X14 : uni] : (X12 != X13 => get(X10,X4,X11,X13) = get(X10,X4,set(X10,X4,X11,X12,X14),X13))))), 54.91/54.77 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',select_neq)). 54.91/54.77 tff(f1901,plain,( 54.91/54.77 ~spl22_79 | spl22_82 | ~spl22_56), 54.91/54.77 inference(avatar_split_clause,[],[f1112,f1091,f1899,f1884])). 54.91/54.77 tff(f1884,plain,( 54.91/54.77 spl22_79 <=> ~sort1(int,t2tb(sK3))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_79])])). 54.91/54.77 tff(f1899,plain,( 54.91/54.77 spl22_82 <=> ! [X0 : uni] : (get(list(tree),int,t2tb3(sK5),X0) = get(list(tree),int,t2tb3(sK8),X0) | ~sort1(int,X0) | t2tb(sK3) = X0)), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_82])])). 54.91/54.77 tff(f1112,plain,( 54.91/54.77 ( ! [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), 54.91/54.77 inference(superposition,[],[f360,f1092])). 54.91/54.77 tff(f1891,plain,( 54.91/54.77 spl22_79), 54.91/54.77 inference(avatar_contradiction_clause,[],[f1890])). 54.91/54.77 tff(f1890,plain,( 54.91/54.77 $false | ~spl22_79), 54.91/54.77 inference(resolution,[],[f1885,f269])). 54.91/54.77 tff(f1885,plain,( 54.91/54.77 ~sort1(int,t2tb(sK3)) | ~spl22_79), 54.91/54.77 inference(avatar_component_clause,[],[f1884])). 54.91/54.77 tff(f1889,plain,( 54.91/54.77 ~spl22_79 | spl22_80 | ~spl22_38), 54.91/54.77 inference(avatar_split_clause,[],[f642,f637,f1887,f1884])). 54.91/54.77 tff(f1887,plain,( 54.91/54.77 spl22_80 <=> ! [X0 : uni] : (get(list(tree),int,t2tb3(sK2),X0) = get(list(tree),int,t2tb3(sK4),X0) | ~sort1(int,X0) | t2tb(sK3) = X0)), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_80])])). 54.91/54.77 tff(f637,plain,( 54.91/54.77 spl22_38 <=> set(list(tree),int,t2tb3(sK2),t2tb(sK3),nil(tree)) = t2tb3(sK4)), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_38])])). 54.91/54.77 tff(f642,plain,( 54.91/54.77 ( ! [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), 54.91/54.77 inference(superposition,[],[f360,f638])). 54.91/54.77 tff(f638,plain,( 54.91/54.77 set(list(tree),int,t2tb3(sK2),t2tb(sK3),nil(tree)) = t2tb3(sK4) | ~spl22_38), 54.91/54.77 inference(avatar_component_clause,[],[f637])). 54.91/54.77 tff(f1693,plain,( 54.91/54.77 spl22_75), 54.91/54.77 inference(avatar_contradiction_clause,[],[f1692])). 54.91/54.77 tff(f1692,plain,( 54.91/54.77 $false | ~spl22_75), 54.91/54.77 inference(resolution,[],[f1684,f323])). 54.91/54.77 tff(f323,plain,( 54.91/54.77 ( ! [X2:uni,X0:ty,X1:uni] : (sort1(list(X0),cons(X0,X1,X2))) )), 54.91/54.77 inference(cnf_transformation,[],[f123])). 54.91/54.77 tff(f123,plain,( 54.91/54.77 ! [X0 : ty,X1 : uni,X2 : uni] : sort1(list(X0),cons(X0,X1,X2))), 54.91/54.77 inference(rectify,[],[f26])). 54.91/54.77 tff(f26,axiom,( 54.91/54.77 ! [X4 : ty,X2 : uni,X3 : uni] : sort1(list(X4),cons(X4,X2,X3))), 54.91/54.77 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cons_sort2)). 54.91/54.77 tff(f1684,plain,( 54.91/54.77 ~sort1(list(tree),cons(tree,t2tb2(empty1),nil(tree))) | ~spl22_75), 54.91/54.77 inference(avatar_component_clause,[],[f1683])). 54.91/54.77 tff(f1683,plain,( 54.91/54.77 spl22_75 <=> ~sort1(list(tree),cons(tree,t2tb2(empty1),nil(tree)))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_75])])). 54.91/54.77 tff(f1691,plain,( 54.91/54.77 ~spl22_75 | spl22_76 | ~spl22_54), 54.91/54.77 inference(avatar_split_clause,[],[f1036,f980,f1689,f1683])). 54.91/54.77 tff(f1689,plain,( 54.91/54.77 spl22_76 <=> cons(tree,t2tb2(empty1),nil(tree)) = get(list(tree),int,t2tb3(sK1),t2tb(0))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_76])])). 54.91/54.77 tff(f1036,plain,( 54.91/54.77 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), 54.91/54.77 inference(superposition,[],[f371,f981])). 54.91/54.77 tff(f1554,plain,( 54.91/54.77 ~spl22_73 | ~spl22_70), 54.91/54.77 inference(avatar_split_clause,[],[f1547,f1544,f1552])). 54.91/54.77 tff(f1546,plain,( 54.91/54.77 spl22_68 | spl22_70), 54.91/54.77 inference(avatar_split_clause,[],[f523,f1544,f1541])). 54.91/54.77 tff(f523,plain,( 54.91/54.77 ( ! [X2:tree1,X3:$int] : (sK6 != X3 | node1(sK14(sK10(X2)),sK15(sK10(X2))) = sK10(X2) | ~$less(0,X3) | ~all_trees1(size1(X2),sK7)) )), 54.91/54.77 inference(superposition,[],[f412,f520])). 54.91/54.77 tff(f1333,plain,( 54.91/54.77 ~spl22_63 | spl22_64 | spl22_66), 54.91/54.77 inference(avatar_split_clause,[],[f1238,f1331,f1328,f1325])). 54.91/54.77 tff(f1325,plain,( 54.91/54.77 spl22_63 <=> ~all_trees1(sK3,sK7)), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_63])])). 54.91/54.77 tff(f1328,plain,( 54.91/54.77 spl22_64 <=> ! [X0 : tree1] : (mem(tree,t2tb2(node1(node_proj_11(X0),node_proj_21(X0))),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | empty1 = X0 | size1(X0) != sK3)), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_64])])). 54.91/54.77 tff(f1238,plain,( 54.91/54.77 ( ! [X2:$int,X0:tree1,X1:$int] : (sK6 != X1 | mem(tree,t2tb2(node1(node_proj_11(X0),node_proj_21(X0))),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | size1(X0) != sK3 | sK6 != X2 | ~$less(X1,X2) | empty1 = X0 | ~all_trees1(sK3,sK7)) )), 54.91/54.77 inference(inner_rewriting,[],[f1233])). 54.91/54.77 tff(f1233,plain,( 54.91/54.77 ( ! [X2:$int,X0:tree1,X1:$int] : (sK6 != X1 | mem(tree,t2tb2(node1(node_proj_11(X0),node_proj_21(X0))),get(list(tree),int,t2tb3(sK5),t2tb(sK3))) | size1(X0) != sK3 | sK6 != X2 | ~$less(X1,X2) | empty1 = X0 | ~all_trees1(size1(X0),sK7)) )), 54.91/54.77 inference(superposition,[],[f887,f601])). 54.91/54.77 tff(f1227,plain,( 54.91/54.77 spl22_58 | spl22_60), 54.91/54.77 inference(avatar_split_clause,[],[f1168,f1225,f1222])). 54.91/54.77 tff(f1168,plain,( 54.91/54.77 ( ! [X6:$int,X5:uni] : ($sum($sum(sK3,-1),$uminus(sK6)) != X6 | ~$less(X6,0) | ~mem(tree,X5,t2tb1(sK7))) )), 54.91/54.77 inference(superposition,[],[f409,f1079])). 54.91/54.77 tff(f1093,plain,( 54.91/54.77 spl22_56 | ~spl22_52), 54.91/54.77 inference(avatar_split_clause,[],[f815,f767,f1091])). 54.91/54.77 tff(f767,plain,( 54.91/54.77 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), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_52])])). 54.91/54.77 tff(f815,plain,( 54.91/54.77 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), 54.91/54.77 inference(superposition,[],[f272,f768])). 54.91/54.77 tff(f768,plain,( 54.91/54.77 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), 54.91/54.77 inference(avatar_component_clause,[],[f767])). 54.91/54.77 tff(f272,plain,( 54.91/54.77 ( ! [X0:uni] : (t2tb3(tb2t3(X0)) = X0) )), 54.91/54.77 inference(cnf_transformation,[],[f67])). 54.91/54.77 tff(f67,axiom,( 54.91/54.77 ! [X0 : uni] : t2tb3(tb2t3(X0)) = X0), 54.91/54.77 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bridgeR3)). 54.91/54.77 tff(f982,plain,( 54.91/54.77 spl22_54 | ~spl22_40), 54.91/54.77 inference(avatar_split_clause,[],[f760,f723,f980])). 54.91/54.77 tff(f723,plain,( 54.91/54.77 spl22_40 <=> tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = sK1), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_40])])). 54.91/54.77 tff(f760,plain,( 54.91/54.77 set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree))) = t2tb3(sK1) | ~spl22_40), 54.91/54.77 inference(superposition,[],[f272,f724])). 54.91/54.77 tff(f724,plain,( 54.91/54.77 tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = sK1 | ~spl22_40), 54.91/54.77 inference(avatar_component_clause,[],[f723])). 54.91/54.77 tff(f769,plain,( 54.91/54.77 spl22_52), 54.91/54.77 inference(avatar_split_clause,[],[f258,f767])). 54.91/54.77 tff(f258,plain,( 54.91/54.77 tb2t3(set(list(tree),int,t2tb3(sK5),t2tb(sK3),infix_plpl(tree,t2tb1(sK7),get(list(tree),int,t2tb3(sK5),t2tb(sK3))))) = sK8), 54.91/54.77 inference(cnf_transformation,[],[f198])). 54.91/54.77 tff(f758,plain,( 54.91/54.77 spl22_45), 54.91/54.77 inference(avatar_contradiction_clause,[],[f757])). 54.91/54.77 tff(f757,plain,( 54.91/54.77 $false | ~spl22_45), 54.91/54.77 inference(resolution,[],[f739,f280])). 54.91/54.77 tff(f280,plain,( 54.91/54.77 ( ! [X0:ty] : (sort1(list(X0),nil(X0))) )), 54.91/54.77 inference(cnf_transformation,[],[f98])). 54.91/54.77 tff(f98,plain,( 54.91/54.77 ! [X0 : ty] : sort1(list(X0),nil(X0))), 54.91/54.77 inference(rectify,[],[f28])). 54.91/54.77 tff(f28,axiom,( 54.91/54.77 ! [X4 : ty] : sort1(list(X4),nil(X4))), 54.91/54.77 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nil_sort2)). 54.91/54.77 tff(f739,plain,( 54.91/54.77 ~sort1(list(tree),nil(tree)) | ~spl22_45), 54.91/54.77 inference(avatar_component_clause,[],[f738])). 54.91/54.77 tff(f756,plain,( 54.91/54.77 spl22_48 | ~spl22_51), 54.91/54.77 inference(avatar_split_clause,[],[f372,f754,f748])). 54.91/54.77 tff(f754,plain,( 54.91/54.77 spl22_51 <=> size1(sK9) != sK3), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_51])])). 54.91/54.77 tff(f372,plain,( 54.91/54.77 ( ! [X12:$int,X10:tree1,X13:$int,X11:tree1] : (size1(sK9) != sK3 | size1(X10) != X12 | sK6 != X13 | ~$less(X12,$sum(X13,1)) | node1(X10,X11) != sK9) )), 54.91/54.77 inference(theory_flattening,[],[f260])). 54.91/54.77 tff(f260,plain,( 54.91/54.77 ( ! [X10:tree1,X11:tree1] : (size1(sK9) != sK3 | ~$less(size1(X10),$sum(sK6,1)) | node1(X10,X11) != sK9) )), 54.91/54.77 inference(cnf_transformation,[],[f198])). 54.91/54.77 tff(f746,plain,( 54.91/54.77 ~spl22_45 | spl22_46 | ~spl22_38), 54.91/54.77 inference(avatar_split_clause,[],[f641,f637,f744,f738])). 54.91/54.77 tff(f744,plain,( 54.91/54.77 spl22_46 <=> nil(tree) = get(list(tree),int,t2tb3(sK4),t2tb(sK3))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_46])])). 54.91/54.77 tff(f641,plain,( 54.91/54.77 nil(tree) = get(list(tree),int,t2tb3(sK4),t2tb(sK3)) | ~sort1(list(tree),nil(tree)) | ~spl22_38), 54.91/54.77 inference(superposition,[],[f371,f638])). 54.91/54.77 tff(f733,plain,( 54.91/54.77 spl22_42), 54.91/54.77 inference(avatar_split_clause,[],[f726,f731])). 54.91/54.77 tff(f731,plain,( 54.91/54.77 spl22_42 <=> $less($sum($sum(sK3,-1),$uminus(sK6)),$sum(sK0,1))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_42])])). 54.91/54.77 tff(f726,plain,( 54.91/54.77 $less($sum($sum(sK3,-1),$uminus(sK6)),$sum(sK0,1))), 54.91/54.77 inference(equality_resolution,[],[f718])). 54.91/54.77 tff(f718,plain,( 54.91/54.77 ( ! [X0:$int] : (sK0 != X0 | $less($sum($sum(sK3,-1),$uminus(sK6)),$sum(X0,1))) )), 54.91/54.77 inference(equality_resolution,[],[f669])). 54.91/54.77 tff(f669,plain,( 54.91/54.77 ( ! [X0:$int,X1:$int] : (sK3 != X0 | sK0 != X1 | $less($sum($sum(X0,-1),$uminus(sK6)),$sum(X1,1))) )), 54.91/54.77 inference(equality_resolution,[],[f423])). 54.91/54.77 tff(f423,plain,( 54.91/54.77 ( ! [X2:$int,X3:$int,X1:$int] : (sK6 != X2 | sK3 != X1 | sK0 != X3 | $less($sum($sum(X1,-1),$uminus(X2)),$sum(X3,1))) )), 54.91/54.77 inference(evaluation,[],[f383])). 54.91/54.77 tff(f383,plain,( 54.91/54.77 ( ! [X2:$int,X3:$int,X1:$int] : (sK3 != X1 | sK6 != X2 | sK0 != X3 | $less($sum($sum(X1,$uminus(1)),$uminus(X2)),$sum(X3,1))) )), 54.91/54.77 inference(theory_flattening,[],[f243])). 54.91/54.77 tff(f243,plain,( 54.91/54.77 $less($sum($sum(sK3,$uminus(1)),$uminus(sK6)),$sum(sK0,1))), 54.91/54.77 inference(cnf_transformation,[],[f198])). 54.91/54.77 tff(f725,plain,( 54.91/54.77 spl22_40), 54.91/54.77 inference(avatar_split_clause,[],[f219,f723])). 54.91/54.77 tff(f219,plain,( 54.91/54.77 tb2t3(set(list(tree),int,const(list(tree),int,nil(tree)),t2tb(0),cons(tree,t2tb2(empty1),nil(tree)))) = sK1), 54.91/54.77 inference(cnf_transformation,[],[f198])). 54.91/54.77 tff(f639,plain,( 54.91/54.77 spl22_38 | ~spl22_30), 54.91/54.77 inference(avatar_split_clause,[],[f584,f565,f637])). 54.91/54.77 tff(f565,plain,( 54.91/54.77 spl22_30 <=> tb2t3(set(list(tree),int,t2tb3(sK2),t2tb(sK3),nil(tree))) = sK4), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_30])])). 54.91/54.77 tff(f584,plain,( 54.91/54.77 set(list(tree),int,t2tb3(sK2),t2tb(sK3),nil(tree)) = t2tb3(sK4) | ~spl22_30), 54.91/54.77 inference(superposition,[],[f272,f566])). 54.91/54.77 tff(f566,plain,( 54.91/54.77 tb2t3(set(list(tree),int,t2tb3(sK2),t2tb(sK3),nil(tree))) = sK4 | ~spl22_30), 54.91/54.77 inference(avatar_component_clause,[],[f565])). 54.91/54.77 tff(f614,plain,( 54.91/54.77 ~spl22_37), 54.91/54.77 inference(avatar_split_clause,[],[f607,f612])). 54.91/54.77 tff(f607,plain,( 54.91/54.77 ~$less($sum($sum(sK3,-1),$uminus(sK6)),0)), 54.91/54.77 inference(equality_resolution,[],[f595])). 54.91/54.77 tff(f595,plain,( 54.91/54.77 ( ! [X0:$int] : (sK3 != X0 | ~$less($sum($sum(X0,-1),$uminus(sK6)),0)) )), 54.91/54.77 inference(equality_resolution,[],[f422])). 54.91/54.77 tff(f422,plain,( 54.91/54.77 ( ! [X2:$int,X1:$int] : (sK6 != X2 | sK3 != X1 | ~$less($sum($sum(X1,-1),$uminus(X2)),0)) )), 54.91/54.77 inference(evaluation,[],[f379])). 54.91/54.77 tff(f379,plain,( 54.91/54.77 ( ! [X2:$int,X1:$int] : (sK3 != X1 | sK6 != X2 | ~$less($sum($sum(X1,$uminus(1)),$uminus(X2)),0)) )), 54.91/54.77 inference(theory_flattening,[],[f247])). 54.91/54.77 tff(f247,plain,( 54.91/54.77 ~$less($sum($sum(sK3,$uminus(1)),$uminus(sK6)),0)), 54.91/54.77 inference(cnf_transformation,[],[f198])). 54.91/54.77 tff(f591,plain,( 54.91/54.77 ~spl22_35 | spl22_33), 54.91/54.77 inference(avatar_split_clause,[],[f583,f580,f589])). 54.91/54.77 tff(f589,plain,( 54.91/54.77 spl22_35 <=> ~all_trees1(size1(empty1),sK7)), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_35])])). 54.91/54.77 tff(f580,plain,( 54.91/54.77 spl22_33 <=> ~mem(tree,t2tb2(empty1),t2tb1(sK7))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_33])])). 54.91/54.77 tff(f583,plain,( 54.91/54.77 ~all_trees1(size1(empty1),sK7) | ~spl22_33), 54.91/54.77 inference(resolution,[],[f581,f369])). 54.91/54.77 tff(f581,plain,( 54.91/54.77 ~mem(tree,t2tb2(empty1),t2tb1(sK7)) | ~spl22_33), 54.91/54.77 inference(avatar_component_clause,[],[f580])). 54.91/54.77 tff(f582,plain,( 54.91/54.77 ~spl22_33), 54.91/54.77 inference(avatar_split_clause,[],[f575,f580])). 54.91/54.77 tff(f575,plain,( 54.91/54.77 ~mem(tree,t2tb2(empty1),t2tb1(sK7))), 54.91/54.77 inference(equality_resolution,[],[f568])). 54.91/54.77 tff(f568,plain,( 54.91/54.77 ( ! [X0:tree1] : (empty1 != X0 | ~mem(tree,t2tb2(X0),t2tb1(sK7))) )), 54.91/54.77 inference(superposition,[],[f288,f252])). 54.91/54.77 tff(f567,plain,( 54.91/54.77 spl22_30), 54.91/54.77 inference(avatar_split_clause,[],[f229,f565])). 54.91/54.77 tff(f229,plain,( 54.91/54.77 tb2t3(set(list(tree),int,t2tb3(sK2),t2tb(sK3),nil(tree))) = sK4), 54.91/54.77 inference(cnf_transformation,[],[f198])). 54.91/54.77 tff(f560,plain,( 54.91/54.77 spl22_28), 54.91/54.77 inference(avatar_split_clause,[],[f259,f558])). 54.91/54.77 tff(f259,plain,( 54.91/54.77 mem(tree,t2tb2(sK9),get(list(tree),int,t2tb3(sK8),t2tb(sK3)))), 54.91/54.77 inference(cnf_transformation,[],[f198])). 54.91/54.77 tff(f550,plain,( 54.91/54.77 ~spl22_27), 54.91/54.77 inference(avatar_split_clause,[],[f543,f548])). 54.91/54.77 tff(f548,plain,( 54.91/54.77 spl22_27 <=> ~$less($sum(sK3,-1),sK6)), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_27])])). 54.91/54.77 tff(f543,plain,( 54.91/54.77 ~$less($sum(sK3,-1),sK6)), 54.91/54.77 inference(equality_resolution,[],[f542])). 54.91/54.77 tff(f542,plain,( 54.91/54.77 ( ! [X0:$int] : (sK3 != X0 | ~$less($sum(X0,-1),sK6)) )), 54.91/54.77 inference(equality_resolution,[],[f426])). 54.91/54.77 tff(f426,plain,( 54.91/54.77 ( ! [X2:$int,X1:$int] : (sK6 != X2 | sK3 != X1 | ~$less($sum(X1,-1),X2)) )), 54.91/54.77 inference(evaluation,[],[f391])). 54.91/54.77 tff(f391,plain,( 54.91/54.77 ( ! [X2:$int,X1:$int] : (sK3 != X1 | sK6 != X2 | ~$less($sum(X1,$uminus(1)),X2)) )), 54.91/54.77 inference(theory_flattening,[],[f232])). 54.91/54.77 tff(f232,plain,( 54.91/54.77 ~$less($sum(sK3,$uminus(1)),sK6)), 54.91/54.77 inference(cnf_transformation,[],[f198])). 54.91/54.77 tff(f541,plain,( 54.91/54.77 spl22_24), 54.91/54.77 inference(avatar_split_clause,[],[f534,f539])). 54.91/54.77 tff(f539,plain,( 54.91/54.77 spl22_24 <=> $less(sK6,$sum(sK0,1))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_24])])). 54.91/54.77 tff(f534,plain,( 54.91/54.77 $less(sK6,$sum(sK0,1))), 54.91/54.77 inference(equality_resolution,[],[f533])). 54.91/54.77 tff(f533,plain,( 54.91/54.77 ( ! [X0:$int] : (sK0 != X0 | $less(sK6,$sum(X0,1))) )), 54.91/54.77 inference(equality_resolution,[],[f382])). 54.91/54.77 tff(f382,plain,( 54.91/54.77 ( ! [X2:$int,X1:$int] : (sK6 != X1 | sK0 != X2 | $less(X1,$sum(X2,1))) )), 54.91/54.77 inference(theory_flattening,[],[f244])). 54.91/54.77 tff(f244,plain,( 54.91/54.77 $less(sK6,$sum(sK0,1))), 54.91/54.77 inference(cnf_transformation,[],[f198])). 54.91/54.77 tff(f532,plain,( 54.91/54.77 spl22_22), 54.91/54.77 inference(avatar_split_clause,[],[f525,f530])). 54.91/54.77 tff(f530,plain,( 54.91/54.77 spl22_22 <=> $less(sK3,$sum(sK0,1))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_22])])). 54.91/54.77 tff(f525,plain,( 54.91/54.77 $less(sK3,$sum(sK0,1))), 54.91/54.77 inference(equality_resolution,[],[f524])). 54.91/54.77 tff(f524,plain,( 54.91/54.77 ( ! [X0:$int] : (sK0 != X0 | $less(sK3,$sum(X0,1))) )), 54.91/54.77 inference(equality_resolution,[],[f375])). 54.91/54.77 tff(f375,plain,( 54.91/54.77 ( ! [X2:$int,X1:$int] : (sK3 != X1 | sK0 != X2 | $less(X1,$sum(X2,1))) )), 54.91/54.77 inference(theory_flattening,[],[f255])). 54.91/54.77 tff(f255,plain,( 54.91/54.77 $less(sK3,$sum(sK0,1))), 54.91/54.77 inference(cnf_transformation,[],[f198])). 54.91/54.77 tff(f519,plain,( 54.91/54.77 spl22_20), 54.91/54.77 inference(avatar_split_clause,[],[f249,f517])). 54.91/54.77 tff(f517,plain,( 54.91/54.77 spl22_20 <=> all_trees1(sK6,tb2t1(get(list(tree),int,t2tb3(sK5),t2tb(sK6))))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_20])])). 54.91/54.77 tff(f249,plain,( 54.91/54.77 all_trees1(sK6,tb2t1(get(list(tree),int,t2tb3(sK5),t2tb(sK6))))), 54.91/54.77 inference(cnf_transformation,[],[f198])). 54.91/54.77 tff(f512,plain,( 54.91/54.77 ~spl22_19), 54.91/54.77 inference(avatar_split_clause,[],[f498,f510])). 54.91/54.77 tff(f510,plain,( 54.91/54.77 spl22_19 <=> ~$less(sK0,sK3)), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_19])])). 54.91/54.77 tff(f498,plain,( 54.91/54.77 ~$less(sK0,sK3)), 54.91/54.77 inference(equality_resolution,[],[f497])). 54.91/54.77 tff(f497,plain,( 54.91/54.77 ( ! [X0:$int] : (sK0 != X0 | ~$less(X0,sK3)) )), 54.91/54.77 inference(equality_resolution,[],[f400])). 54.91/54.77 tff(f400,plain,( 54.91/54.77 ( ! [X2:$int,X1:$int] : (sK3 != X2 | sK0 != X1 | ~$less(X1,X2)) )), 54.91/54.77 inference(theory_flattening,[],[f222])). 54.91/54.77 tff(f222,plain,( 54.91/54.77 ~$less(sK0,sK3)), 54.91/54.77 inference(cnf_transformation,[],[f198])). 54.91/54.77 tff(f505,plain,( 54.91/54.77 spl22_16), 54.91/54.77 inference(avatar_split_clause,[],[f237,f503])). 54.91/54.77 tff(f503,plain,( 54.91/54.77 spl22_16 <=> distinct(tree,get(list(tree),int,t2tb3(sK5),t2tb(sK3)))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_16])])). 54.91/54.77 tff(f496,plain,( 54.91/54.77 spl22_14), 54.91/54.77 inference(avatar_split_clause,[],[f489,f494])). 54.91/54.77 tff(f494,plain,( 54.91/54.77 spl22_14 <=> $less(-1,sK0)), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_14])])). 54.91/54.77 tff(f489,plain,( 54.91/54.77 $less(-1,sK0)), 54.91/54.77 inference(equality_resolution,[],[f431])). 54.91/54.77 tff(f431,plain,( 54.91/54.77 ( ! [X1:$int] : (sK0 != X1 | $less(-1,X1)) )), 54.91/54.77 inference(evaluation,[],[f403])). 54.91/54.77 tff(f403,plain,( 54.91/54.77 ( ! [X1:$int] : (sK0 != X1 | $less(0,$sum(X1,1))) )), 54.91/54.77 inference(theory_flattening,[],[f217])). 54.91/54.77 tff(f217,plain,( 54.91/54.77 $less(0,$sum(sK0,1))), 54.91/54.77 inference(cnf_transformation,[],[f198])). 54.91/54.77 tff(f488,plain,( 54.91/54.77 ~spl22_13), 54.91/54.77 inference(avatar_split_clause,[],[f481,f486])). 54.91/54.77 tff(f486,plain,( 54.91/54.77 spl22_13 <=> ~$less(sK0,-1)), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_13])])). 54.91/54.77 tff(f481,plain,( 54.91/54.77 ~$less(sK0,-1)), 54.91/54.77 inference(equality_resolution,[],[f418])). 54.91/54.77 tff(f418,plain,( 54.91/54.77 ( ! [X1:$int] : (sK0 != X1 | ~$less(X1,-1)) )), 54.91/54.77 inference(evaluation,[],[f373])). 54.91/54.77 tff(f373,plain,( 54.91/54.77 ( ! [X1:$int] : (sK0 != X1 | ~$less($sum(X1,1),0)) )), 54.91/54.77 inference(theory_flattening,[],[f257])). 54.91/54.77 tff(f257,plain,( 54.91/54.77 ~$less($sum(sK0,1),0)), 54.91/54.77 inference(cnf_transformation,[],[f198])). 54.91/54.77 tff(f480,plain,( 54.91/54.77 ~spl22_11), 54.91/54.77 inference(avatar_split_clause,[],[f466,f478])). 54.91/54.77 tff(f478,plain,( 54.91/54.77 spl22_11 <=> ~$less(sK0,0)), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_11])])). 54.91/54.77 tff(f466,plain,( 54.91/54.77 ~$less(sK0,0)), 54.91/54.77 inference(equality_resolution,[],[f406])). 54.91/54.77 tff(f406,plain,( 54.91/54.77 ( ! [X1:$int] : (sK0 != X1 | ~$less(X1,0)) )), 54.91/54.77 inference(theory_flattening,[],[f214])). 54.91/54.77 tff(f214,plain,( 54.91/54.77 ~$less(sK0,0)), 54.91/54.77 inference(cnf_transformation,[],[f198])). 54.91/54.77 tff(f473,plain,( 54.91/54.77 ~spl22_9), 54.91/54.77 inference(avatar_split_clause,[],[f465,f471])). 54.91/54.77 tff(f471,plain,( 54.91/54.77 spl22_9 <=> ~$less(sK0,1)), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_9])])). 54.91/54.77 tff(f465,plain,( 54.91/54.77 ~$less(sK0,1)), 54.91/54.77 inference(equality_resolution,[],[f401])). 54.91/54.77 tff(f401,plain,( 54.91/54.77 ( ! [X1:$int] : (sK0 != X1 | ~$less(X1,1)) )), 54.91/54.77 inference(theory_flattening,[],[f221])). 54.91/54.77 tff(f221,plain,( 54.91/54.77 ~$less(sK0,1)), 54.91/54.77 inference(cnf_transformation,[],[f198])). 54.91/54.77 tff(f464,plain,( 54.91/54.77 ~spl22_7), 54.91/54.77 inference(avatar_split_clause,[],[f457,f462])). 54.91/54.77 tff(f462,plain,( 54.91/54.77 spl22_7 <=> ~$less(sK3,1)), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_7])])). 54.91/54.77 tff(f457,plain,( 54.91/54.77 ~$less(sK3,1)), 54.91/54.77 inference(equality_resolution,[],[f399])). 54.91/54.77 tff(f399,plain,( 54.91/54.77 ( ! [X1:$int] : (sK3 != X1 | ~$less(X1,1)) )), 54.91/54.77 inference(theory_flattening,[],[f223])). 54.91/54.77 tff(f223,plain,( 54.91/54.77 ~$less(sK3,1)), 54.91/54.77 inference(cnf_transformation,[],[f198])). 54.91/54.77 tff(f456,plain,( 54.91/54.77 ~spl22_5), 54.91/54.77 inference(avatar_split_clause,[],[f449,f454])). 54.91/54.77 tff(f454,plain,( 54.91/54.77 spl22_5 <=> ~$less(sK6,0)), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_5])])). 54.91/54.77 tff(f449,plain,( 54.91/54.77 ~$less(sK6,0)), 54.91/54.77 inference(equality_resolution,[],[f380])). 54.91/54.77 tff(f380,plain,( 54.91/54.77 ( ! [X1:$int] : (sK6 != X1 | ~$less(X1,0)) )), 54.91/54.77 inference(theory_flattening,[],[f246])). 54.91/54.77 tff(f246,plain,( 54.91/54.77 ~$less(sK6,0)), 54.91/54.77 inference(cnf_transformation,[],[f198])). 54.91/54.77 tff(f448,plain,( 54.91/54.77 ~spl22_3), 54.91/54.77 inference(avatar_split_clause,[],[f441,f446])). 54.91/54.77 tff(f446,plain,( 54.91/54.77 spl22_3 <=> ~$less(sK3,0)), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_3])])). 54.91/54.77 tff(f441,plain,( 54.91/54.77 ~$less(sK3,0)), 54.91/54.77 inference(equality_resolution,[],[f374])). 54.91/54.77 tff(f374,plain,( 54.91/54.77 ( ! [X1:$int] : (sK3 != X1 | ~$less(X1,0)) )), 54.91/54.77 inference(theory_flattening,[],[f256])). 54.91/54.77 tff(f256,plain,( 54.91/54.77 ~$less(sK3,0)), 54.91/54.77 inference(cnf_transformation,[],[f198])). 54.91/54.77 tff(f440,plain,( 54.91/54.77 spl22_0), 54.91/54.77 inference(avatar_split_clause,[],[f250,f438])). 54.91/54.77 tff(f438,plain,( 54.91/54.77 spl22_0 <=> distinct(tree,t2tb1(sK7))), 54.91/54.77 introduced(avatar_definition,[new_symbols(naming,[spl22_0])])). 54.91/54.77 tff(f250,plain,( 54.91/54.77 distinct(tree,t2tb1(sK7))), 54.91/54.77 inference(cnf_transformation,[],[f198])). 54.91/54.77 % SZS output end Proof for theBenchmark 54.91/54.77 % ------------------------------ 54.91/54.77 % Version: Vampire 4.4.0 (commit 7916d27 on 2019-08-23 08:50:16 +0100) 54.91/54.77 % Termination reason: Refutation 54.91/54.77 54.91/54.77 % Memory used [KB]: 13560 54.91/54.77 % Time elapsed: 0.732 s 54.91/54.77 % ------------------------------ 54.91/54.77 % ------------------------------ 54.91/54.77 % Success in time 54.441 s 54.91/54.77 EOF