###########################################################################
                    FASPR (Version 20200110)                 
  A method for fast and accurate protein side-chain packing, 
which is an important problem in protein structure prediction
and protein design.

Copyright (c) 2020 Xiaoqiang Huang
Yang Zhang Lab
Dept. of Computational Medicine and Bioinformatics
Medical School
University of Michigan
Email:tommyhuangthu@foxmail.com, xiaoqiah@umich.edu
###########################################################################
#residues in pdb: 56
#alanines and glycines: 8
#residues fixed during self-energy-check: 4
iter 1 DEEgoldstein eliminates 252 rotamers
iter 2 DEEgoldstein eliminates 28 rotamers
iter 3 DEEgoldstein eliminates 8 rotamers
iter 4 DEEgoldstein eliminates 0 rotamers
#residues fixed after DEE-Goldstein: 40
#residues unfixed after DEE-Goldstein: 4
iter 1 DEEsplit eliminates 0 rotamers
#residues fixed after DEE-split: 0
#residues unfixed after DEE-split: 4
iter 1 DEEgoldstein eliminates 0 rotamers
#residues fixed after DEE-Goldstein: 0
#residues unfixed after DEE-Goldstein: 4
iter 1 DEEsplit eliminates 0 rotamers
#residues fixed after DEE-split: 0
#residues unfixed after DEE-split: 4

construct adjacent matrix ...
remove edges (residue-residue interactions) with small energy values ... #edges removed: 3
remove the residues that have no interaction edge ... #residues without edges removed: 0
*subgraph 0:
18 => 20
20 => 18
*subgraph 1:
19 => 54
54 => 19

*subgraph 0 sorted (low-to-high degree):
18 =>  20
20 =>  18
@list bags (nodes) of the tree decomposition:
(20 | 18)
#treewidth = 3
current tree has been solved

*subgraph 1 sorted (low-to-high degree):
19 =>  54
54 =>  19
@list bags (nodes) of the tree decomposition:
(54 | 19)
#treewidth = 3
current tree has been solved
#computational time: 0.04 seconds