Unverified Commit b75ed73c authored by zcxzcx1's avatar zcxzcx1 Committed by GitHub
Browse files

Add files via upload

parent 56d3c363
#--------------------------- Simulation variables -----------------------------#
# Simulation control parameters.
variable T equal 500
# Simulation steps (t_eq)
variable t_eq equal 100
variable output equal 1 #freq to print output
variable dumpstep equal 1
#------------------------------------------------------------------------------#
#---------------------------- Atomic setup ------------------------------------#
units metal
boundary p p p
# Create atoms.
box tilt large
read_data ./res.dat
replicate 2 2 2
# Define interatomic potential.
pair_style e3gnn
# The order of element should be the same as the order of elements in the data file (type)
# * * {path to deployed serial model} {elements}
pair_coeff * * ./deployed_serial.pt Hf O
timestep 0.002
#----------------------------- Run simulation ---------------------------------#
# Setup output
thermo ${output} #because it is realaxation
thermo_style custom step tpcpu pe ke vol press temp #record these value (custom setting)
dump mydump all custom 1 dump.traj id type x y z fx fy fz
dump_modify mydump sort id
fix f1 all nve
fix comfix all momentum 1 linear 1 1 1
velocity all create ${T} 1 dist gaussian mom yes
run 5
#------------------------------------------------------------------------------#
# generated from poscar module (Converted from VASP)
96 atoms
2 atom types
0.00000000 10.12978631 xlo xhi
0.00000000 10.37111894 ylo yhi
0.00000000 10.26314330 zlo zhi
1.73035484 0.00000000 0.00000000 xy xz yz
Masses
1 178.490000
2 16.000000
Atoms
1 1 10.07858846 8.73752520 7.46334159
2 1 9.43739481 3.62108575 2.41757962
3 1 8.95522965 1.01658239 0.30135971
4 1 10.05681289 8.87631272 2.35008881
5 1 9.75638582 6.30304558 0.18303097
6 1 8.91443797 1.06674577 5.54199800
7 1 9.79081409 6.26490552 5.22104118
8 1 4.41792703 3.81788503 2.39528244
9 1 2.17257241 4.11562894 4.98715163
10 1 1.66417958 1.51957159 2.91326352
11 1 5.17465464 8.94063393 2.34565890
12 1 2.85135280 9.31925586 4.96912733
13 1 5.06412333 8.89798173 7.34081071
14 1 2.43171878 6.73610078 7.90086842
15 1 4.79358115 6.33415175 5.30470215
16 1 4.38083973 3.71776573 7.50514775
17 1 2.16740031 4.19218670 10.14985882
18 1 1.72740111 1.53804994 8.11741499
19 1 3.81409500 1.12760478 5.36341140
20 1 2.91124600 9.28502610 10.05473353
21 1 2.43508812 6.79222574 2.84272933
22 1 4.63828767 6.35818290 0.06495312
23 1 3.96862029 1.21993115 0.31149240
24 1 7.95945527 9.30919854 9.99874912
25 1 7.20953615 4.10124686 10.06760490
26 1 7.97413259 9.31020496 4.88564505
27 1 7.48292324 6.67094881 2.71417363
28 1 7.22354435 4.09214379 4.91151391
29 1 6.77110223 1.50790865 2.82107672
30 1 7.60040235 6.67278986 7.89547614
31 1 9.41001699 3.69515647 7.55969566
32 1 6.77374601 1.50559611 7.98091486
33 2 10.09033948 1.85325366 6.96757279
34 2 10.99511263 7.08138493 6.69600728
35 2 11.28967512 9.60939027 6.04904275
36 2 10.78802723 6.95960696 1.75182521
37 2 8.32036165 2.47159112 3.91830180
38 2 10.07211065 1.65854646 1.87162718
39 2 10.48460341 4.35174196 0.83957607
40 2 9.58543540 10.25525675 3.81736961
41 2 9.15581971 7.61785575 3.82383341
42 2 11.28280065 9.42551408 0.89622391
43 2 10.61871694 4.46990764 6.09305074
44 2 3.63623823 5.03045204 3.82116882
45 2 3.22065417 2.54566037 3.96054713
46 2 5.13228413 1.96508633 1.75400085
47 2 0.49972311 0.85950986 4.41955106
48 2 4.49795126 10.25514684 3.94724065
49 2 4.08831630 7.74684459 3.86494489
50 2 5.90127151 7.07173966 1.66530214
51 2 6.32939463 9.71904813 0.93714394
52 2 5.44334962 4.45855194 0.80863483
53 2 3.54898001 7.91810753 6.27738026
54 2 3.21454568 5.33370189 6.39780696
55 2 4.08744202 7.79255573 8.94430580
56 2 5.89610679 7.08975961 6.71713664
57 2 1.22356400 5.98776133 9.31853387
58 2 6.36149555 9.67586631 6.06078686
59 2 3.62496983 5.17884441 8.87967862
60 2 2.79091790 2.70312051 6.50630496
61 2 2.20642369 0.12199325 6.50943225
62 2 3.36642075 2.52335751 9.09596150
63 2 5.04873139 1.85222299 6.87617402
64 2 0.50463414 0.78101050 9.52304998
65 2 0.95275450 3.34556660 8.69553848
66 2 5.46251140 4.47527874 6.00302102
67 2 4.49817894 10.30428629 8.95760259
68 2 1.73952474 8.56368775 8.58555417
69 2 3.62337333 7.98128068 1.17332847
70 2 3.16118634 5.40721734 1.22906859
71 2 1.31418904 5.97276567 4.19215008
72 2 2.79848347 2.74889192 1.27175505
73 2 2.29397766 0.16984188 1.46074130
74 2 0.96707618 3.44188647 3.47135866
75 2 1.75476287 8.54415321 3.43405286
76 2 9.58968370 10.11019896 9.02264863
77 2 9.12010305 7.60109276 8.90873480
78 2 8.21690550 5.34991345 1.37662298
79 2 6.43083748 5.94959474 4.24019201
80 2 8.69454708 4.99651781 3.88811596
81 2 7.96833563 2.69478887 1.20584684
82 2 7.33313963 0.16345962 1.36457040
83 2 5.57830829 0.81411424 4.28350294
84 2 6.12969978 3.45445964 3.35501959
85 2 8.55281287 7.89834015 1.15270373
86 2 6.84047748 8.56744003 3.45602018
87 2 7.33002089 0.08127731 6.53509276
88 2 5.55795729 0.84809385 9.39286244
89 2 8.58051171 7.87084401 6.29048766
90 2 8.28348300 5.22136388 6.47631887
91 2 6.42127905 6.05984919 9.37655897
92 2 6.82699499 8.52585391 8.47852948
93 2 8.68865624 5.09200133 8.99426977
94 2 7.84842127 2.70204335 6.42490863
95 2 8.25796997 2.46457586 9.01312304
96 2 6.08861225 3.44495302 8.57088233
# Example input.yaml for training SevenNet.
# '*' signifies default. You can check log.sevenn for defaults.
model:
chemical_species: 'Auto' # Elements model should know. [ 'Univ' | 'Auto' | manual_user_input ]
cutoff: 5.0 # Cutoff radius in Angstroms. If two atoms are within the cutoff, they are connected.
channel: 32 # The multiplicity(channel) of node features.
lmax: 2 # Maximum order of irreducible representations (rotation order).
num_convolution_layer: 3 # The number of message passing layers.
#irreps_manual: # Manually set irreps of the model in each layer
#- "128x0e"
#- "128x0e+64x1e+32x2e"
#- "128x0e+64x1e+32x2e"
#- "128x0e+64x1e+32x2e"
#- "128x0e+64x1e+32x2e"
#- "128x0e"
weight_nn_hidden_neurons: [64, 64] # Hidden neurons in convolution weight neural network
radial_basis: # Function and its parameters to encode radial distance
radial_basis_name: 'bessel' # Only 'bessel' is currently supported
bessel_basis_num: 8
cutoff_function: # Envelop function, multiplied to radial_basis functions to init edge features
cutoff_function_name: 'poly_cut' # {'poly_cut' and 'poly_cut_p_value'} or {'XPLOR' and 'cutoff_on'}
poly_cut_p_value: 6
act_gate: {'e': 'silu', 'o': 'tanh'} # Equivalent to 'nonlinearity_gates' in nequip
act_scalar: {'e': 'silu', 'o': 'tanh'} # Equivalent to 'nonlinearity_scalars' in nequip
is_parity: False # Pairy True (E(3) group) or False (to SE(3) group)
self_connection_type: 'nequip' # Default is 'nequip'. 'linear' is used for SevenNet-0. I recommend 'linear' for 'Univ' chemical_species
conv_denominator: "avg_num_neigh" # Valid options are "avg_num_neigh*", "sqrt_avg_num_neigh", or float
train_denominator: False # Enable training for denominator in convolution layer
train_shift_scale: False # Enable training for shift & scale in output layer
train:
random_seed: 1
is_train_stress: True # Includes stress in the loss function
epoch: 200 # Ends training after this number of epochs
#loss: 'Huber' # Default is 'mse' (mean squared error)
#loss_param:
#delta: 0.01
# Each optimizer and scheduler have different available parameters.
# You can refer to sevenn/train/optim.py for supporting optimizer & schedulers
optimizer: 'adam' # Options available are 'sgd', 'adagrad', 'adam', 'adamw', 'radam'
optim_param:
lr: 0.005
scheduler: 'exponentiallr' # 'steplr', 'multisteplr', 'exponentiallr', 'cosineannealinglr', 'reducelronplateau', 'linearlr'
scheduler_param:
gamma: 0.99
force_loss_weight: 0.1 # Coefficient for force loss
stress_loss_weight: 1e-06 # Coefficient for stress loss (to kbar unit)
per_epoch: 10 # Generate checkpoints every this epoch
# ['target y', 'metric']
# Target y: TotalEnergy, Energy, Force, Stress, Stress_GPa, TotalLoss
# Metric : RMSE, MAE, or Loss
error_record:
- ['Energy', 'RMSE']
- ['Force', 'RMSE']
- ['Stress', 'RMSE']
- ['TotalLoss', 'None']
# Continue training model from given checkpoint, or pre-trained model checkpoint for fine-tuning
#continue:
#checkpoint: 'checkpoint_best.pth' # Checkpoint of pre-trained model or a model want to continue training.
#reset_optimizer: False # Set True for fine-tuning
#reset_scheduler: False # Set True for fine-tuning
data:
batch_size: 4 # Per GPU batch size.
data_divide_ratio: 0.1 # Split dataset into training and validation sets by this ratio
shift: 'per_atom_energy_mean' # One of 'per_atom_energy_mean*', 'elemwise_reference_energies', float
scale: 'force_rms' # One of 'force_rms*', 'per_atom_energy_std', float
# SevenNet automatically matches data format from its filename.
# For those not `structure_list` or `.pt` files, assumes it is ASE readable
# In this case, below arguments are directly passed to `ase.io.read`
data_format_args:
index: ':' # see `https://wiki.fysik.dtu.dk/ase/ase/io/io.html` for more valid arguments
# validset is needed if you want '_best.pth' during training. If not, both validset and testset is optional.
load_trainset_path: ['./structure_list'] # Example of using ase as data_format, support multiple files and expansion(*)
#load_validset_path: ['./valid.extxyz']
#load_testset_path: ['./sevenn_data/mydata.pt'] # Graph can be preprocessed using `sevenn_graph_build` and accessible like this
[label_1]
../data/label_1/OUTCAR_{1..5} :
../data/label_1/OUTCAR_{1..5} :
[label_2]
../data/label_2/OUTCAR_{6..10} :
../data/label_2/OUTCAR_{6..10} :
[project]
name = "sevenn"
version = "0.11.1.dev3"
authors = [
{ name = "Yutack Park", email = "parkyutack@snu.ac.kr" },
{ name = "Haekwan Jeon", email = "haekwan98@snu.ac.kr" },
{ name = "Jaesun Kim" },
{ name = "Gijin Kim" },
{ name = "Hyungmin An" },
]
description = "Scalable EquiVariance Enabled Neural Network"
readme = "README.md"
license = { file = "LICENSE" }
requires-python = ">=3.8"
classifiers = [
"Programming Language :: Python :: 3",
"License :: OSI Approved :: GNU General Public License v3 (GPLv3)",
"Operating System :: POSIX :: Linux",
]
dependencies = [
"ase",
"braceexpand",
"pyyaml",
"e3nn>=0.5.0",
"tqdm",
"scikit-learn",
"torch_geometric>=2.5.0",
"numpy",
"matscipy",
"pandas",
"requests",
"setuptools>=61.0"
]
[project.optional-dependencies]
test = ["pytest", "pytest-cov>=5"]
cueq12 = ["cuequivariance>=0.4.0; python_version >= '3.10'", "cuequivariance-torch>=0.4.0; python_version >= '3.10'", "cuequivariance-ops-torch-cu12; python_version >= '3.10'"]
cueq11 = ["cuequivariance>=0.4.0; python_version >= '3.10'", "cuequivariance-torch>=0.4.0; python_version >= '3.10'", "cuequivariance-ops-torch-cu11; python_version >= '3.10'"]
[project.scripts]
sevenn = "sevenn.main.sevenn:main"
sevenn_get_model = "sevenn.main.sevenn_get_model:main"
sevenn_graph_build = "sevenn.main.sevenn_graph_build:main"
sevenn_inference = "sevenn.main.sevenn_inference:main"
sevenn_patch_lammps = "sevenn.main.sevenn_patch_lammps:main"
sevenn_preset = "sevenn.main.sevenn_preset:main"
sevenn_cp = "sevenn.main.sevenn_cp:main"
[project.urls]
Homepage = "https://github.com/MDIL-SNU/SevenNet"
Issues = "https://github.com/MDIL-SNU/SevenNet/issues"
[build-system]
build-backend = "setuptools.build_meta"
requires = ["setuptools>=61.0"]
[tool.setuptools.package-data]
sevenn = [
"logo_ascii",
"*.so",
"pair_e3gnn/*.cpp",
"pair_e3gnn/*.h",
"pair_e3gnn/*.cu",
"pair_e3gnn/patch_lammps.sh",
"presets/*.yaml",
"pretrained_potentials/SevenNet_0__11Jul2024/checkpoint_sevennet_0.pth",
"pretrained_potentials/SevenNet_0__22May2024/checkpoint_sevennet_0.pth",
"pretrained_potentials/SevenNet_l3i5/checkpoint_l3i5.pth",
"pretrained_potentials/SevenNet_MF_0/checkpoint_sevennet_mf_0.pth",
"py.typed",
]
[tool.setuptools.packages.find]
include = ["sevenn*"]
exclude = ["tests*", "example_inputs*", ]
[tool.pytest.ini_options]
log_cli = true
log_cli_format = "%(asctime)s [%(levelname)8s] %(message)s (%(filename)s:%(lineno)s)"
log_cli_date_format = "%Y-%m-%d %H:%M:%S"
[tool.ruff]
line-length = 85
[tool.ruff.lint]
extend-select = ["E501"]
[tool.ruff.format]
quote-style = "single"
docstring-code-format = true
[flake8]
max-line-length = 85
max-complexity = 12
select = C,E,F,W,B,B950
ignore = F401, W503, W605, E741, E203, C901, E722
[isort]
multi_line_output=3
include_trailing_comma=True
force_grid_wrap=0
use_parentheses=True
line_length=80
known_third_party=ase,braceexpand,e3nn,numpy,packaging,pandas,pytest,requests,sklearn,torch,torch_geometric,tqdm,yaml
known_first_party=
Metadata-Version: 2.4
Name: sevenn
Version: 0.11.1.dev3
Summary: Scalable EquiVariance Enabled Neural Network
Author: Jaesun Kim, Gijin Kim, Hyungmin An
Author-email: Yutack Park <parkyutack@snu.ac.kr>, Haekwan Jeon <haekwan98@snu.ac.kr>
License: GNU GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The GNU General Public License is a free, copyleft license for
software and other kinds of works.
The licenses for most software and other practical works are designed
to take away your freedom to share and change the works. By contrast,
the GNU General Public License is intended to guarantee your freedom to
share and change all versions of a program--to make sure it remains free
software for all its users. We, the Free Software Foundation, use the
GNU General Public License for most of our software; it applies also to
any other work released this way by its authors. You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
them if you wish), that you receive source code or can get it if you
want it, that you can change the software or use pieces of it in new
free programs, and that you know you can do these things.
To protect your rights, we need to prevent others from denying you
these rights or asking you to surrender the rights. Therefore, you have
certain responsibilities if you distribute copies of the software, or if
you modify it: responsibilities to respect the freedom of others.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must pass on to the recipients the same
freedoms that you received. You must make sure that they, too, receive
or can get the source code. And you must show them these terms so they
know their rights.
Developers that use the GNU GPL protect your rights with two steps:
(1) assert copyright on the software, and (2) offer you this License
giving you legal permission to copy, distribute and/or modify it.
For the developers' and authors' protection, the GPL clearly explains
that there is no warranty for this free software. For both users' and
authors' sake, the GPL requires that modified versions be marked as
changed, so that their problems will not be attributed erroneously to
authors of previous versions.
Some devices are designed to deny users access to install or run
modified versions of the software inside them, although the manufacturer
can do so. This is fundamentally incompatible with the aim of
protecting users' freedom to change the software. The systematic
pattern of such abuse occurs in the area of products for individuals to
use, which is precisely where it is most unacceptable. Therefore, we
have designed this version of the GPL to prohibit the practice for those
products. If such problems arise substantially in other domains, we
stand ready to extend this provision to those domains in future versions
of the GPL, as needed to protect the freedom of users.
Finally, every program is threatened constantly by software patents.
States should not allow patents to restrict development and use of
software on general-purpose computers, but in those that do, we wish to
avoid the special danger that patents applied to a free program could
make it effectively proprietary. To prevent this, the GPL assures that
patents cannot be used to render the program non-free.
The precise terms and conditions for copying, distribution and
modification follow.
TERMS AND CONDITIONS
0. Definitions.
"This License" refers to version 3 of the GNU General Public License.
"Copyright" also means copyright-like laws that apply to other kinds of
works, such as semiconductor masks.
"The Program" refers to any copyrightable work licensed under this
License. Each licensee is addressed as "you". "Licensees" and
"recipients" may be individuals or organizations.
To "modify" a work means to copy from or adapt all or part of the work
in a fashion requiring copyright permission, other than the making of an
exact copy. The resulting work is called a "modified version" of the
earlier work or a work "based on" the earlier work.
A "covered work" means either the unmodified Program or a work based
on the Program.
To "propagate" a work means to do anything with it that, without
permission, would make you directly or secondarily liable for
infringement under applicable copyright law, except executing it on a
computer or modifying a private copy. Propagation includes copying,
distribution (with or without modification), making available to the
public, and in some countries other activities as well.
To "convey" a work means any kind of propagation that enables other
parties to make or receive copies. Mere interaction with a user through
a computer network, with no transfer of a copy, is not conveying.
An interactive user interface displays "Appropriate Legal Notices"
to the extent that it includes a convenient and prominently visible
feature that (1) displays an appropriate copyright notice, and (2)
tells the user that there is no warranty for the work (except to the
extent that warranties are provided), that licensees may convey the
work under this License, and how to view a copy of this License. If
the interface presents a list of user commands or options, such as a
menu, a prominent item in the list meets this criterion.
1. Source Code.
The "source code" for a work means the preferred form of the work
for making modifications to it. "Object code" means any non-source
form of a work.
A "Standard Interface" means an interface that either is an official
standard defined by a recognized standards body, or, in the case of
interfaces specified for a particular programming language, one that
is widely used among developers working in that language.
The "System Libraries" of an executable work include anything, other
than the work as a whole, that (a) is included in the normal form of
packaging a Major Component, but which is not part of that Major
Component, and (b) serves only to enable use of the work with that
Major Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form. A
"Major Component", in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system
(if any) on which the executable work runs, or a compiler used to
produce the work, or an object code interpreter used to run it.
The "Corresponding Source" for a work in object code form means all
the source code needed to generate, install, and (for an executable
work) run the object code and to modify the work, including scripts to
control those activities. However, it does not include the work's
System Libraries, or general-purpose tools or generally available free
programs which are used unmodified in performing those activities but
which are not part of the work. For example, Corresponding Source
includes interface definition files associated with source files for
the work, and the source code for shared libraries and dynamically
linked subprograms that the work is specifically designed to require,
such as by intimate data communication or control flow between those
subprograms and other parts of the work.
The Corresponding Source need not include anything that users
can regenerate automatically from other parts of the Corresponding
Source.
The Corresponding Source for a work in source code form is that
same work.
2. Basic Permissions.
All rights granted under this License are granted for the term of
copyright on the Program, and are irrevocable provided the stated
conditions are met. This License explicitly affirms your unlimited
permission to run the unmodified Program. The output from running a
covered work is covered by this License only if the output, given its
content, constitutes a covered work. This License acknowledges your
rights of fair use or other equivalent, as provided by copyright law.
You may make, run and propagate covered works that you do not
convey, without conditions so long as your license otherwise remains
in force. You may convey covered works to others for the sole purpose
of having them make modifications exclusively for you, or provide you
with facilities for running those works, provided that you comply with
the terms of this License in conveying all material for which you do
not control copyright. Those thus making or running the covered works
for you must do so exclusively on your behalf, under your direction
and control, on terms that prohibit them from making any copies of
your copyrighted material outside their relationship with you.
Conveying under any other circumstances is permitted solely under
the conditions stated below. Sublicensing is not allowed; section 10
makes it unnecessary.
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
No covered work shall be deemed part of an effective technological
measure under any applicable law fulfilling obligations under article
11 of the WIPO copyright treaty adopted on 20 December 1996, or
similar laws prohibiting or restricting circumvention of such
measures.
When you convey a covered work, you waive any legal power to forbid
circumvention of technological measures to the extent such circumvention
is effected by exercising rights under this License with respect to
the covered work, and you disclaim any intention to limit operation or
modification of the work as a means of enforcing, against the work's
users, your or third parties' legal rights to forbid circumvention of
technological measures.
4. Conveying Verbatim Copies.
You may convey verbatim copies of the Program's source code as you
receive it, in any medium, provided that you conspicuously and
appropriately publish on each copy an appropriate copyright notice;
keep intact all notices stating that this License and any
non-permissive terms added in accord with section 7 apply to the code;
keep intact all notices of the absence of any warranty; and give all
recipients a copy of this License along with the Program.
You may charge any price or no price for each copy that you convey,
and you may offer support or warranty protection for a fee.
5. Conveying Modified Source Versions.
You may convey a work based on the Program, or the modifications to
produce it from the Program, in the form of source code under the
terms of section 4, provided that you also meet all of these conditions:
a) The work must carry prominent notices stating that you modified
it, and giving a relevant date.
b) The work must carry prominent notices stating that it is
released under this License and any conditions added under section
7. This requirement modifies the requirement in section 4 to
"keep intact all notices".
c) You must license the entire work, as a whole, under this
License to anyone who comes into possession of a copy. This
License will therefore apply, along with any applicable section 7
additional terms, to the whole of the work, and all its parts,
regardless of how they are packaged. This License gives no
permission to license the work in any other way, but it does not
invalidate such permission if you have separately received it.
d) If the work has interactive user interfaces, each must display
Appropriate Legal Notices; however, if the Program has interactive
interfaces that do not display Appropriate Legal Notices, your
work need not make them do so.
A compilation of a covered work with other separate and independent
works, which are not by their nature extensions of the covered work,
and which are not combined with it such as to form a larger program,
in or on a volume of a storage or distribution medium, is called an
"aggregate" if the compilation and its resulting copyright are not
used to limit the access or legal rights of the compilation's users
beyond what the individual works permit. Inclusion of a covered work
in an aggregate does not cause this License to apply to the other
parts of the aggregate.
6. Conveying Non-Source Forms.
You may convey a covered work in object code form under the terms
of sections 4 and 5, provided that you also convey the
machine-readable Corresponding Source under the terms of this License,
in one of these ways:
a) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by the
Corresponding Source fixed on a durable physical medium
customarily used for software interchange.
b) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by a
written offer, valid for at least three years and valid for as
long as you offer spare parts or customer support for that product
model, to give anyone who possesses the object code either (1) a
copy of the Corresponding Source for all the software in the
product that is covered by this License, on a durable physical
medium customarily used for software interchange, for a price no
more than your reasonable cost of physically performing this
conveying of source, or (2) access to copy the
Corresponding Source from a network server at no charge.
c) Convey individual copies of the object code with a copy of the
written offer to provide the Corresponding Source. This
alternative is allowed only occasionally and noncommercially, and
only if you received the object code with such an offer, in accord
with subsection 6b.
d) Convey the object code by offering access from a designated
place (gratis or for a charge), and offer equivalent access to the
Corresponding Source in the same way through the same place at no
further charge. You need not require recipients to copy the
Corresponding Source along with the object code. If the place to
copy the object code is a network server, the Corresponding Source
may be on a different server (operated by you or a third party)
that supports equivalent copying facilities, provided you maintain
clear directions next to the object code saying where to find the
Corresponding Source. Regardless of what server hosts the
Corresponding Source, you remain obligated to ensure that it is
available for as long as needed to satisfy these requirements.
e) Convey the object code using peer-to-peer transmission, provided
you inform other peers where the object code and Corresponding
Source of the work are being offered to the general public at no
charge under subsection 6d.
A separable portion of the object code, whose source code is excluded
from the Corresponding Source as a System Library, need not be
included in conveying the object code work.
A "User Product" is either (1) a "consumer product", which means any
tangible personal property which is normally used for personal, family,
or household purposes, or (2) anything designed or sold for incorporation
into a dwelling. In determining whether a product is a consumer product,
doubtful cases shall be resolved in favor of coverage. For a particular
product received by a particular user, "normally used" refers to a
typical or common use of that class of product, regardless of the status
of the particular user or of the way in which the particular user
actually uses, or expects or is expected to use, the product. A product
is a consumer product regardless of whether the product has substantial
commercial, industrial or non-consumer uses, unless such uses represent
the only significant mode of use of the product.
"Installation Information" for a User Product means any methods,
procedures, authorization keys, or other information required to install
and execute modified versions of a covered work in that User Product from
a modified version of its Corresponding Source. The information must
suffice to ensure that the continued functioning of the modified object
code is in no case prevented or interfered with solely because
modification has been made.
If you convey an object code work under this section in, or with, or
specifically for use in, a User Product, and the conveying occurs as
part of a transaction in which the right of possession and use of the
User Product is transferred to the recipient in perpetuity or for a
fixed term (regardless of how the transaction is characterized), the
Corresponding Source conveyed under this section must be accompanied
by the Installation Information. But this requirement does not apply
if neither you nor any third party retains the ability to install
modified object code on the User Product (for example, the work has
been installed in ROM).
The requirement to provide Installation Information does not include a
requirement to continue to provide support service, warranty, or updates
for a work that has been modified or installed by the recipient, or for
the User Product in which it has been modified or installed. Access to a
network may be denied when the modification itself materially and
adversely affects the operation of the network or violates the rules and
protocols for communication across the network.
Corresponding Source conveyed, and Installation Information provided,
in accord with this section must be in a format that is publicly
documented (and with an implementation available to the public in
source code form), and must require no special password or key for
unpacking, reading or copying.
7. Additional Terms.
"Additional permissions" are terms that supplement the terms of this
License by making exceptions from one or more of its conditions.
Additional permissions that are applicable to the entire Program shall
be treated as though they were included in this License, to the extent
that they are valid under applicable law. If additional permissions
apply only to part of the Program, that part may be used separately
under those permissions, but the entire Program remains governed by
this License without regard to the additional permissions.
When you convey a copy of a covered work, you may at your option
remove any additional permissions from that copy, or from any part of
it. (Additional permissions may be written to require their own
removal in certain cases when you modify the work.) You may place
additional permissions on material, added by you to a covered work,
for which you have or can give appropriate copyright permission.
Notwithstanding any other provision of this License, for material you
add to a covered work, you may (if authorized by the copyright holders of
that material) supplement the terms of this License with terms:
a) Disclaiming warranty or limiting liability differently from the
terms of sections 15 and 16 of this License; or
b) Requiring preservation of specified reasonable legal notices or
author attributions in that material or in the Appropriate Legal
Notices displayed by works containing it; or
c) Prohibiting misrepresentation of the origin of that material, or
requiring that modified versions of such material be marked in
reasonable ways as different from the original version; or
d) Limiting the use for publicity purposes of names of licensors or
authors of the material; or
e) Declining to grant rights under trademark law for use of some
trade names, trademarks, or service marks; or
f) Requiring indemnification of licensors and authors of that
material by anyone who conveys the material (or modified versions of
it) with contractual assumptions of liability to the recipient, for
any liability that these contractual assumptions directly impose on
those licensors and authors.
All other non-permissive additional terms are considered "further
restrictions" within the meaning of section 10. If the Program as you
received it, or any part of it, contains a notice stating that it is
governed by this License along with a term that is a further
restriction, you may remove that term. If a license document contains
a further restriction but permits relicensing or conveying under this
License, you may add to a covered work material governed by the terms
of that license document, provided that the further restriction does
not survive such relicensing or conveying.
If you add terms to a covered work in accord with this section, you
must place, in the relevant source files, a statement of the
additional terms that apply to those files, or a notice indicating
where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the
form of a separately written license, or stated as exceptions;
the above requirements apply either way.
8. Termination.
You may not propagate or modify a covered work except as expressly
provided under this License. Any attempt otherwise to propagate or
modify it is void, and will automatically terminate your rights under
this License (including any patent licenses granted under the third
paragraph of section 11).
However, if you cease all violation of this License, then your
license from a particular copyright holder is reinstated (a)
provisionally, unless and until the copyright holder explicitly and
finally terminates your license, and (b) permanently, if the copyright
holder fails to notify you of the violation by some reasonable means
prior to 60 days after the cessation.
Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.
Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License. If your rights have been terminated and not permanently
reinstated, you do not qualify to receive new licenses for the same
material under section 10.
9. Acceptance Not Required for Having Copies.
You are not required to accept this License in order to receive or
run a copy of the Program. Ancillary propagation of a covered work
occurring solely as a consequence of using peer-to-peer transmission
to receive a copy likewise does not require acceptance. However,
nothing other than this License grants you permission to propagate or
modify any covered work. These actions infringe copyright if you do
not accept this License. Therefore, by modifying or propagating a
covered work, you indicate your acceptance of this License to do so.
10. Automatic Licensing of Downstream Recipients.
Each time you convey a covered work, the recipient automatically
receives a license from the original licensors, to run, modify and
propagate that work, subject to this License. You are not responsible
for enforcing compliance by third parties with this License.
An "entity transaction" is a transaction transferring control of an
organization, or substantially all assets of one, or subdividing an
organization, or merging organizations. If propagation of a covered
work results from an entity transaction, each party to that
transaction who receives a copy of the work also receives whatever
licenses to the work the party's predecessor in interest had or could
give under the previous paragraph, plus a right to possession of the
Corresponding Source of the work from the predecessor in interest, if
the predecessor has it or can get it with reasonable efforts.
You may not impose any further restrictions on the exercise of the
rights granted or affirmed under this License. For example, you may
not impose a license fee, royalty, or other charge for exercise of
rights granted under this License, and you may not initiate litigation
(including a cross-claim or counterclaim in a lawsuit) alleging that
any patent claim is infringed by making, using, selling, offering for
sale, or importing the Program or any portion of it.
11. Patents.
A "contributor" is a copyright holder who authorizes use under this
License of the Program or a work on which the Program is based. The
work thus licensed is called the contributor's "contributor version".
A contributor's "essential patent claims" are all patent claims
owned or controlled by the contributor, whether already acquired or
hereafter acquired, that would be infringed by some manner, permitted
by this License, of making, using, or selling its contributor version,
but do not include claims that would be infringed only as a
consequence of further modification of the contributor version. For
purposes of this definition, "control" includes the right to grant
patent sublicenses in a manner consistent with the requirements of
this License.
Each contributor grants you a non-exclusive, worldwide, royalty-free
patent license under the contributor's essential patent claims, to
make, use, sell, offer for sale, import and otherwise run, modify and
propagate the contents of its contributor version.
In the following three paragraphs, a "patent license" is any express
agreement or commitment, however denominated, not to enforce a patent
(such as an express permission to practice a patent or covenant not to
sue for patent infringement). To "grant" such a patent license to a
party means to make such an agreement or commitment not to enforce a
patent against the party.
If you convey a covered work, knowingly relying on a patent license,
and the Corresponding Source of the work is not available for anyone
to copy, free of charge and under the terms of this License, through a
publicly available network server or other readily accessible means,
then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the
patent license for this particular work, or (3) arrange, in a manner
consistent with the requirements of this License, to extend the patent
license to downstream recipients. "Knowingly relying" means you have
actual knowledge that, but for the patent license, your conveying the
covered work in a country, or your recipient's use of the covered work
in a country, would infringe one or more identifiable patents in that
country that you have reason to believe are valid.
If, pursuant to or in connection with a single transaction or
arrangement, you convey, or propagate by procuring conveyance of, a
covered work, and grant a patent license to some of the parties
receiving the covered work authorizing them to use, propagate, modify
or convey a specific copy of the covered work, then the patent license
you grant is automatically extended to all recipients of the covered
work and works based on it.
A patent license is "discriminatory" if it does not include within
the scope of its coverage, prohibits the exercise of, or is
conditioned on the non-exercise of one or more of the rights that are
specifically granted under this License. You may not convey a covered
work if you are a party to an arrangement with a third party that is
in the business of distributing software, under which you make payment
to the third party based on the extent of your activity of conveying
the work, and under which the third party grants, to any of the
parties who would receive the covered work from you, a discriminatory
patent license (a) in connection with copies of the covered work
conveyed by you (or copies made from those copies), or (b) primarily
for and in connection with specific products or compilations that
contain the covered work, unless you entered into that arrangement,
or that patent license was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting
any implied license or other defenses to infringement that may
otherwise be available to you under applicable patent law.
12. No Surrender of Others' Freedom.
If conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot convey a
covered work so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you may
not convey it at all. For example, if you agree to terms that obligate you
to collect a royalty for further conveying from those to whom you convey
the Program, the only way you could satisfy both those terms and this
License would be to refrain entirely from conveying the Program.
13. Use with the GNU Affero General Public License.
Notwithstanding any other provision of this License, you have
permission to link or combine any covered work with a work licensed
under version 3 of the GNU Affero General Public License into a single
combined work, and to convey the resulting work. The terms of this
License will continue to apply to the part which is the covered work,
but the special requirements of the GNU Affero General Public License,
section 13, concerning interaction through a network will apply to the
combination as such.
14. Revised Versions of this License.
The Free Software Foundation may publish revised and/or new versions of
the GNU General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the
Program specifies that a certain numbered version of the GNU General
Public License "or any later version" applies to it, you have the
option of following the terms and conditions either of that numbered
version or of any later version published by the Free Software
Foundation. If the Program does not specify a version number of the
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.
If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.
Later license versions may give you additional or different
permissions. However, no additional obligations are imposed on any
author or copyright holder as a result of your choosing to follow a
later version.
15. Disclaimer of Warranty.
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
16. Limitation of Liability.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
SUCH DAMAGES.
17. Interpretation of Sections 15 and 16.
If the disclaimer of warranty and limitation of liability provided
above cannot be given local legal effect according to their terms,
reviewing courts shall apply local law that most closely approximates
an absolute waiver of all civil liability in connection with the
Program, unless a warranty or assumption of liability accompanies a
copy of the Program in return for a fee.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
state the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) <year> <name of author>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
Also add information on how to contact you by electronic and paper mail.
If the program does terminal interaction, make it output a short
notice like this when it starts in an interactive mode:
<program> Copyright (C) <year> <name of author>
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, your program's commands
might be different; for a GUI interface, you would use an "about box".
You should also get your employer (if you work as a programmer) or school,
if any, to sign a "copyright disclaimer" for the program, if necessary.
For more information on this, and how to apply and follow the GNU GPL, see
<https://www.gnu.org/licenses/>.
The GNU General Public License does not permit incorporating your program
into proprietary programs. If your program is a subroutine library, you
may consider it more useful to permit linking proprietary applications with
the library. If this is what you want to do, use the GNU Lesser General
Public License instead of this License. But first, please read
<https://www.gnu.org/licenses/why-not-lgpl.html>.
Project-URL: Homepage, https://github.com/MDIL-SNU/SevenNet
Project-URL: Issues, https://github.com/MDIL-SNU/SevenNet/issues
Classifier: Programming Language :: Python :: 3
Classifier: License :: OSI Approved :: GNU General Public License v3 (GPLv3)
Classifier: Operating System :: POSIX :: Linux
Requires-Python: >=3.8
Description-Content-Type: text/markdown
License-File: LICENSE
Requires-Dist: ase
Requires-Dist: braceexpand
Requires-Dist: pyyaml
Requires-Dist: e3nn>=0.5.0
Requires-Dist: tqdm
Requires-Dist: scikit-learn
Requires-Dist: torch_geometric>=2.5.0
Requires-Dist: numpy
Requires-Dist: matscipy
Requires-Dist: pandas
Requires-Dist: requests
Requires-Dist: setuptools>=61.0
Provides-Extra: test
Requires-Dist: pytest; extra == "test"
Requires-Dist: pytest-cov>=5; extra == "test"
Provides-Extra: cueq12
Requires-Dist: cuequivariance>=0.4.0; python_version >= "3.10" and extra == "cueq12"
Requires-Dist: cuequivariance-torch>=0.4.0; python_version >= "3.10" and extra == "cueq12"
Requires-Dist: cuequivariance-ops-torch-cu12; python_version >= "3.10" and extra == "cueq12"
Provides-Extra: cueq11
Requires-Dist: cuequivariance>=0.4.0; python_version >= "3.10" and extra == "cueq11"
Requires-Dist: cuequivariance-torch>=0.4.0; python_version >= "3.10" and extra == "cueq11"
Requires-Dist: cuequivariance-ops-torch-cu11; python_version >= "3.10" and extra == "cueq11"
Dynamic: license-file
<img src="SevenNet_logo.png" alt="Alt text" height="180">
# SevenNet
SevenNet (Scalable EquiVariance-Enabled Neural Network) is a graph neural network (GNN)-based interatomic potential package that supports parallel molecular dynamics simulations using [`LAMMPS`](https://lammps.org). Its core model is based on [`NequIP`](https://github.com/mir-group/nequip).
> [!NOTE]
> We will soon release a CUDA-accelerated version of SevenNet, which will significantly increase the speed of our pretrained models on [Matbench Discovery](https://matbench-discovery.materialsproject.org/).
## Features
- Pretrained GNN interatomic potential and fine-tuning interface
- Support for the Python [Atomic Simulation Environment (ASE)](https://wiki.fysik.dtu.dk/ase/) calculator
- GPU-parallelized molecular dynamics with LAMMPS
- CUDA-accelerated D3 (van der Waals) dispersion
- Multi-fidelity training for combining multiple databases with different calculation settings ([Usage](https://github.com/MDIL-SNU/SevenNet/blob/main/sevenn/pretrained_potentials/SevenNet_MF_0/README.md))
## Pretrained models
So far, we have released multiple pretrained SevenNet models. Each model has various hyperparameters and training sets, leading to different levels of accuracy and speed. Please read the descriptions below carefully and choose the model that best suits your purpose.
We provide the F1 score, and RMSD for the WBM dataset, along with $\kappa_{\mathrm{SRME}}$ from phononDB and CPS (Combined Performance Score). For details on these metrics and performance comparisons with other pretrained models, please visit [Matbench Discovery](https://matbench-discovery.materialsproject.org/).
These models can be used as interatomic potentials in LAMMPS and loaded through the ASE calculator using each model’s keywords. Please refer to the [ASE calculator](#ase_calculator) section for instructions on loading a model via the ASE calculator.
Additionally, `keywords` can be used in other parts of SevenNet, such as `sevenn_inference`, `sevenn_get_model`, and the `checkpoint` section in `input.yaml` for fine-tuning.
**Acknowledgments**: The models trained on [`MPtrj`](https://figshare.com/articles/dataset/Materials_Project_Trjectory_MPtrj_Dataset/23713842) were supported by the Neural Processing Research Center program at Samsung Advanced Institute of Technology, part of Samsung Electronics Co., Ltd. The computations for training models were carried out using the Samsung SSC-21 cluster.
---
### **SevenNet-MF-ompa (17Mar2025)**
> Model keywords: `7net-mf-ompa` | `SevenNet-mf-ompa`
**This is our recommended pretrained model**
This model leverages [multi-fidelity learning](https://pubs.acs.org/doi/10.1021/jacs.4c14455) to train simultaneously on the [MPtrj](https://figshare.com/articles/dataset/Materials_Project_Trjectory_MPtrj_Dataset/23713842), [sAlex](https://huggingface.co/datasets/fairchem/OMAT24), and [OMat24](https://huggingface.co/datasets/fairchem/OMAT24) datasets. This model is the best among our pretrained models and achieves a high ranking on the [Matbench Discovery]((https://matbench-discovery.materialsproject.org/)) leaderboard. Our evaluations show that it outperforms other models on most tasks, except for the isolated molecule energy task, where it performs slightly worse than `SevenNet-l3i5`.
```python
from sevenn.calculator import SevenNetCalculator
# "mpa" refers to the MPtrj + sAlex modal, used for evaluating Matbench Discovery.
calc = SevenNetCalculator('7net-mf-ompa', modal='mpa') # Use modal='omat24' for OMat24-trained modal weights.
```
> [!NOTE]
> Each modal is expected to produce results that are more consistent with the DFT settings in the training datasets (e.g., `mpa`, trained on the combined [MPtrj](https://figshare.com/articles/dataset/Materials_Project_Trjectory_MPtrj_Dataset/23713842) and [sAlex](https://huggingface.co/datasets/fairchem/OMAT24) datasets; `omat24`, trained on the [OMat24](https://huggingface.co/datasets/fairchem/OMAT24) dataset). For detailed DFT settings, please refer to their papers.
When using the command-line interface of SevenNet, include the `--modal mpa` or `--modal omat24` option to select the desired modality.
#### **Matbench Discovery**
| CPS | F1 | $\kappa_{\mathrm{SRME}}$ | RMSD |
|:---:|:---:|:---:|:---:|
|**0.883**|**0.901**|0.317| **0.0115** |
[Detailed instructions for multi-fidelity learning](https://github.com/MDIL-SNU/SevenNet/blob/main/sevenn/pretrained_potentials/SevenNet_MF_0/README.md)
[Download link for fully detailed checkpoint](https://figshare.com/articles/software/7net_MF_ompa/28590722?file=53029859)
---
### **SevenNet-omat (17Mar2025)**
> Model keywords: `7net-omat` | `SevenNet-omat`
This model was trained exclusively on the [OMat24](https://huggingface.co/datasets/fairchem/OMAT24) dataset. It achieves high performance in $\kappa_{\mathrm{SRME}}$ on [Matbench Discovery](https://matbench-discovery.materialsproject.org/), but its F1 score is unavailable due to a difference in the POTCAR version. Like `SevenNet-MF-ompa`, this model outperforms `SevenNet-l3i5` on most tasks, except for the isolated molecule energy.
[Download link for fully detailed checkpoint](https://figshare.com/articles/software/SevenNet_omat/28593938).
#### **Matbench Discovery**
* $\kappa_{\mathrm{SRME}}$: **0.221**
---
### **SevenNet-l3i5 (12Dec2024)**
> Model keywords: `7net-l3i5` | `SevenNet-l3i5`
This model increases the maximum spherical harmonic degree ($l_{\mathrm{max}}$) to 3, compared to `SevenNet-0`, which has an $l_{\mathrm{max}}$ of 2. While **l3i5** offers improved accuracy for various systems, it is approximately four times slower than `SevenNet-0`.
#### **Matbench Discovery**
| CPS | F1 | $\kappa_{\mathrm{SRME}}$ | RMSD |
|:---:|:---:|:---:|:---:|
|0.764 |0.76|0.55|0.0182|
---
### **SevenNet-0 (11Jul2024)**
> Model keywords:: `7net-0` | `SevenNet-0` | `7net-0_11Jul2024` | `SevenNet-0_11Jul2024`
This model is one of our earliest pretrained models. Although we recommend using newer and more accurate models, it can still be useful in certain cases due to its shortest inference time. The model was trained on the [MPtrj](https://figshare.com/articles/dataset/Materials_Project_Trjectory_MPtrj_Dataset/23713842) and is loaded as the default pretrained model in the ASE calculator.
For more information, click [here](sevenn/pretrained_potentials/SevenNet_0__11Jul2024).
#### **Matbench Discovery**
| F1 | $\kappa_{\mathrm{SRME}}$ |
|:---:|:---:|
|0.67|0.767|
---
You can find our legacy models in [pretrained_potentials](./sevenn/pretrained_potentials).
## Contents
- [Installation](#installation)
- [Usage](#usage)
- [ASE calculator](#ase-calculator)
- [Training & inference](#training-and-inference)
- [Notebook tutorials](#notebook-tutorial)
- [MD simulation with LAMMPS](#md-simulation-with-lammps)
- [Installation](#installation)
- [Single-GPU MD](#single-gpu-md)
- [Multi-GPU MD](#multi-gpu-md)
- [Application of SevenNet-0](#application-of-sevennet-0)
- [Citation](#citation)
## Installation<a name="installation"></a>
### Requirements
- Python >= 3.8
- PyTorch >= 2.0.0, PyTorch =< 2.5.2
For CUDA version, refer to PyTorch's compatibility matrix: https://github.com/pytorch/pytorch/blob/main/RELEASE.md#release-compatibility-matrix
> [!IMPORTANT]
> Please install PyTorch manually based on your hardware before installing SevenNet.
Once PyTorch is successfully installed, please run the following command:
```bash
pip install sevenn
pip install git+https://github.com/MDIL-SNU/SevenNet.git # for the latest main branch
```
We strongly recommend checking `CHANGELOG.md` for new features and changes, as SevenNet is under active development.
## Usage<a name="usage"></a>
### ASE calculator<a name="ase_calculator"></a>
SevenNet provides an ASE interface via the ASE calculator. Models can be loaded using the following Python code:
```python
from sevenn.calculator import SevenNetCalculator
# The 'modal' argument is required if the model is trained with multi-fidelity learning enabled.
calc_mf_ompa = SevenNetCalculator(model='7net-mf-ompa', modal='mpa')
```
SevenNet also supports CUDA-accelerated D3 calculations.
```python
from sevenn.calculator import SevenNetD3Calculator
calc = SevenNetD3Calculator(model='7net-0', device='cuda')
```
If you encounter the error `CUDA is not installed or nvcc is not available`, please ensure the `nvcc` compiler is available. Currently, CPU + D3 is not supported.
Various pretrained SevenNet models can be accessed by setting the model variable to predefined keywords like `7net-mf-ompa`, `7net-omat`, `7net-l3i5`, and `7net-0`.
Additionally, user-trained models can be applied with the ASE calculator. In this case, the `model` parameter should be set to the checkpoint path from training.
> [!TIP]
> When 'auto' is passed to the `device` parameter (the default setting), SevenNet utilizes GPU acceleration if available.
### Training and inference
SevenNet provides five commands for preprocessing, training, and deployment: `sevenn_preset`, `sevenn_graph_build`, `sevenn`, `sevenn_inference`, and `sevenn_get_model`.
#### 1. Input generation
With the `sevenn_preset` command, the input file setting the training parameters is generated automatically.
```bash
sevenn_preset {preset keyword} > input.yaml
```
Available preset keywords are: `base`, `fine_tune`, `multi_modal`, `sevennet-0`, and `sevennet-l3i5`.
Check comments in the preset YAML files for explanations. For fine-tuning, be aware that most model hyperparameters cannot be modified unless explicitly indicated.
To reuse a preprocessed training set, you can specify `sevenn_data/${dataset_name}.pt` for the `load_trainset_path:` in the `input.yaml`.
#### 2. Preprocess (optional)
To obtain the preprocessed data, `sevenn_data/graph.pt`, `sevenn_graph_build` command can be used.
The output files can be used for training (`sevenn`) or inference (`sevenn_inference`) to skip the graph build stage.
```bash
sevenn_graph_build {dataset path} {cutoff radius}
```
The output `sevenn_data/graph.yaml` contains statistics and meta information about the dataset.
These files must be located in the `sevenn_data` directory. If you move the dataset, move the entire `sevenn_data` directory without changing the contents.
See `sevenn_graph_build --help` for more information.
#### 3. Training
Given that `input.yaml` and `sevenn_data/graph.pt` are prepared, SevenNet can be trained by the following command:
```bash
sevenn input.yaml -s
```
We support multi-GPU training using PyTorch DDP (distributed data parallel) with a single process (or a CPU core) per GPU.
```bash
torchrun --standalone --nnodes {number of nodes} --nproc_per_node {number of GPUs} --no_python sevenn input.yaml -d
```
Please note that `batch_size` in `input.yaml` refers to the per-GPU batch size.
#### 4. Inference
Using the checkpoint after training, the properties such as energy, force, and stress can be inferred directly.
```bash
sevenn_inference checkpoint_best.pth path_to_my_structures/*
```
This will create the `sevenn_infer_result` directory, where CSV files contain predicted energy, force, stress, and their references (if available).
See `sevenn_inference --help` for more information.
#### 5. Deployment<a name="deployment"></a>
The checkpoint can be deployed as LAMMPS potentials. The argument is either the path to the checkpoint or the name of a pretrained potential.
```bash
sevenn_get_model 7net-0
sevenn_get_model {checkpoint path}
```
This will create `deployed_serial.pt`, which can be used as a LAMMPS potential with the `e3gnn` pair_style in LAMMPS.
The potential for parallel MD simulation can be obtained similarly.
```bash
sevenn_get_model 7net-0 -p
sevenn_get_model {checkpoint path} -p
```
This will create a directory with several `deployed_parallel_*.pt` files. The directory path itself is an argument for the LAMMPS script. Please do not modify or remove files in the directory.
These models can be used as LAMMPS potentials to run parallel MD simulations with a GNN potential across multiple GPUs.
### Notebook tutorials<a name="notebook-tutorial"></a>
If you want to learn how to use the `sevenn` Python library instead of the CLI command, please check out the notebook tutorials below.
| Notebooks | Google&nbsp;Colab | Descriptions |
|-----------|-------------------|--------------|
|[From scratch](https://github.com/MDIL-SNU/sevennet_tutorial/blob/main/notebooks/SevenNet_python_tutorial.ipynb)|[![Open in Google Colab]](https://colab.research.google.com/github/MDIL-SNU/sevennet_tutorial/blob/main/notebooks/SevenNet_python_tutorial.ipynb)|We can learn how to train the SevenNet from scratch, predict energy, forces, and stress using the trained model, perform structure relaxation, and draw EOS curves.|
|[Fine-tuning](https://github.com/MDIL-SNU/sevennet_tutorial/blob/main/notebooks/SevenNet_finetune_tutorial.ipynb)|[![Open in Google Colab]](https://colab.research.google.com/github/MDIL-SNU/sevennet_tutorial/blob/main/notebooks/SevenNet_finetune_tutorial.ipynb)|We can learn how to fine-tune the SevenNet and compare the results of the pretrained model with the fine-tuned model.|
[Open in Google Colab]: https://colab.research.google.com/assets/colab-badge.svg
Sometimes, the Colab environment may crash due to memory issues. If you have sufficient GPU resources in your local environment, we recommend downloading the tutorials from GitHub and running them on your machine.
```bash
git clone https://github.com/MDIL-SNU/sevennet_tutorial.git
```
### MD simulation with LAMMPS
#### Installation
##### Requirements
- PyTorch (it is recommended to use the same version as used during training)
- LAMMPS version of `stable_2Aug2023_update3`
- MKL library
- [`CUDA-aware OpenMPI`](https://www.open-mpi.org/faq/?category=buildcuda) for parallel MD (optional)
If your cluster supports the Intel MKL module (often included with Intel OneAPI, Intel Compiler, and other Intel-related modules), load that module.
CUDA-aware OpenMPI is optional but recommended for parallel MD. If it is not available, GPUs will communicate via the CPU when running in parallel mode. It is still faster than using only one GPU, but its efficiency is lower.
> [!IMPORTANT]
> CUDA-aware OpenMPI does not support NVIDIA gaming GPUs. Since the software is closely tied to hardware specifications, please consult your server administrator if CUDA-aware OpenMPI is unavailable.
###### 1. Build LAMMPS with cmake.
Ensure the LAMMPS version is `stable_2Aug2023_update3`. You can easily switch the version using Git. After switching the version, run `sevenn_patch_lammps` with the LAMMPS directory path as an argument.
```bash
git clone https://github.com/lammps/lammps.git lammps_sevenn --branch stable_2Aug2023_update3 --depth=1
sevenn_patch_lammps ./lammps_sevenn {--d3}
```
You can refer to `sevenn/pair_e3gnn/patch_lammps.sh` for details of the patch process.
> [!TIP]
> Add `--d3` option to install GPU-accelerated [Grimme's D3 method](https://doi.org/10.1063/1.3382344) pair style. For its usage and details, click [here](sevenn/pair_e3gnn).
```bash
cd ./lammps_sevenn
mkdir build
cd build
cmake ../cmake -DCMAKE_PREFIX_PATH=`python -c 'import torch;print(torch.utils.cmake_prefix_path)'`
make -j4
```
If the error `MKL_INCLUDE_DIR NOT-FOUND` occurs, please check the environment variable or read the `Possible solutions` section below.
If compilation completes without any errors, please skip this.
<details>
<summary><b>Possible solutions</b></summary>
###### 2. Install mkl-include via conda
```bash
conda install -c intel mkl-include
conda install mkl-include # if the above failed
```
###### 3. Append `DMKL_INCLUDE_DIR` to the cmake command and repeat step 1
```bash
cmake ../cmake -DCMAKE_PREFIX_PATH=`python -c 'import torch;print(torch.utils.cmake_prefix_path)'` -DMKL_INCLUDE_DIR=$CONDA_PREFIX/include
```
If the `undefined reference to XXX` error with `libtorch_cpu.so` occurs, check the `$LD_LIBRARY_PATH`.
If PyTorch is installed using Conda, `libmkl_*.so` files can be found in `$CONDA_PREFIX/lib`.
Ensure that `$LD_LIBRARY_PATH` includes `$CONDA_PREFIX/lib`.
For other error cases, solution can be found in the [`pair-nequip`](https://github.com/mir-group/pair_nequip) repository, as we share the same architecture.
</details>
If the compilation is successful, the executable `lmp` can be found at `{path_to_lammps_dir}/build`.
To use this binary easily, create a soft link to your bin directory, which should be included in your `$PATH`.
```bash
ln -s {absolute_path_to_lammps_directory}/build/lmp $HOME/.local/bin/lmp
```
This allows you to run the binary using `lmp -in my_lammps_script.lmp`.
#### Single-GPU MD
For single-GPU MD simulations, the `e3gnn` pair_style should be used. A minimal input script is provided below:
```txt
units metal
atom_style atomic
pair_style e3gnn
pair_coeff * * {path to serial model} {space separated chemical species}
```
#### Multi-GPU MD
For multi-GPU MD simulations, the `e3gnn/parallel` pair_style should be used. A minimal input script is provided below:
```txt
units metal
atom_style atomic
pair_style e3gnn/parallel
pair_coeff * * {number of message-passing layers} {directory of parallel model} {space separated chemical species}
```
For example,
```txt
pair_style e3gnn/parallel
pair_coeff * * 4 ./deployed_parallel Hf O
```
The number of message-passing layers corresponds to the number of `*.pt` files in the `./deployed_parallel` directory.
To deploy LAMMPS models from checkpoints for both serial and parallel execution, use [`sevenn_get_model`](#deployment).
It is expected that there is one GPU per MPI process. If the number of available GPUs is less than the number of MPI processes, the simulation may run inefficiently.
> [!CAUTION]
> Currently, the parallel version encounters an error when one of the subdomain cells contains no atoms. This issue can be addressed using the `processors` command and, more effectively, the `fix balance` command in LAMMPS. A patch for this issue will be released in a future update.
### Application of SevenNet-0
If you are interested in practical applications of SevenNet, please refer to [this paper](https://arxiv.org/abs/2501.05211) (data available on [Zenodo](https://doi.org/10.5281/zenodo.15205477)).
This study utilized SevenNet-0 for simulating liquid electrolytes.
The fine-tuning procedure and associated input files are accessible through the links above, specifically within the `Fine-tuning.tar.xz` archive on Zenodo.
The YAML file used for fine-tuning can be obtained using the following command:
```bash
sevenn_preset fine_tune_le > input.yaml
```
## Citation<a name="citation"></a>
If you use this code, please cite our paper:
```txt
@article{park_scalable_2024,
title = {Scalable Parallel Algorithm for Graph Neural Network Interatomic Potentials in Molecular Dynamics Simulations},
volume = {20},
doi = {10.1021/acs.jctc.4c00190},
number = {11},
journal = {J. Chem. Theory Comput.},
author = {Park, Yutack and Kim, Jaesun and Hwang, Seungwoo and Han, Seungwu},
year = {2024},
pages = {4857--4868},
}
```
If you utilize the multi-fidelity feature of this code or the pretrained model SevenNet-MF-ompa, please cite the following paper:
```txt
@article{kim_sevennet_mf_2024,
title = {Data-Efficient Multifidelity Training for High-Fidelity Machine Learning Interatomic Potentials},
volume = {147},
doi = {10.1021/jacs.4c14455},
number = {1},
journal = {J. Am. Chem. Soc.},
author = {Kim, Jaesun and Kim, Jisu and Kim, Jaehoon and Lee, Jiho and Park, Yutack and Kang, Youngho and Han, Seungwu},
year = {2024},
pages = {1042--1054},
```
LICENSE
README.md
pyproject.toml
setup.cfg
sevenn/__init__.py
sevenn/_const.py
sevenn/_keys.py
sevenn/atom_graph_data.py
sevenn/calculator.py
sevenn/checkpoint.py
sevenn/error_recorder.py
sevenn/logger.py
sevenn/logo_ascii
sevenn/model_build.py
sevenn/pair_d3.so
sevenn/parse_input.py
sevenn/py.typed
sevenn/sevenn_logger.py
sevenn/sevennet_calculator.py
sevenn/util.py
sevenn.egg-info/PKG-INFO
sevenn.egg-info/SOURCES.txt
sevenn.egg-info/dependency_links.txt
sevenn.egg-info/entry_points.txt
sevenn.egg-info/requires.txt
sevenn.egg-info/top_level.txt
sevenn/main/__init__.py
sevenn/main/sevenn.py
sevenn/main/sevenn_cp.py
sevenn/main/sevenn_get_model.py
sevenn/main/sevenn_graph_build.py
sevenn/main/sevenn_inference.py
sevenn/main/sevenn_patch_lammps.py
sevenn/main/sevenn_preset.py
sevenn/nn/__init__.py
sevenn/nn/activation.py
sevenn/nn/convolution.py
sevenn/nn/cue_helper.py
sevenn/nn/edge_embedding.py
sevenn/nn/equivariant_gate.py
sevenn/nn/force_output.py
sevenn/nn/interaction_blocks.py
sevenn/nn/linear.py
sevenn/nn/node_embedding.py
sevenn/nn/scale.py
sevenn/nn/self_connection.py
sevenn/nn/sequential.py
sevenn/nn/util.py
sevenn/pair_e3gnn/comm_brick.cpp
sevenn/pair_e3gnn/comm_brick.h
sevenn/pair_e3gnn/pair_d3.cu
sevenn/pair_e3gnn/pair_d3.h
sevenn/pair_e3gnn/pair_d3_for_ase.cu
sevenn/pair_e3gnn/pair_d3_for_ase.h
sevenn/pair_e3gnn/pair_d3_pars.h
sevenn/pair_e3gnn/pair_e3gnn.cpp
sevenn/pair_e3gnn/pair_e3gnn.h
sevenn/pair_e3gnn/pair_e3gnn_parallel.cpp
sevenn/pair_e3gnn/pair_e3gnn_parallel.h
sevenn/pair_e3gnn/patch_lammps.sh
sevenn/presets/MF_0.yaml
sevenn/presets/base.yaml
sevenn/presets/fine_tune.yaml
sevenn/presets/fine_tune_le.yaml
sevenn/presets/multi_modal.yaml
sevenn/presets/sevennet-0.yaml
sevenn/presets/sevennet-l3i5.yaml
sevenn/scripts/__init__.py
sevenn/scripts/backward_compatibility.py
sevenn/scripts/convert_model_modality.py
sevenn/scripts/deploy.py
sevenn/scripts/graph_build.py
sevenn/scripts/inference.py
sevenn/scripts/processing_continue.py
sevenn/scripts/processing_dataset.py
sevenn/scripts/processing_epoch.py
sevenn/scripts/train.py
sevenn/train/__init__.py
sevenn/train/atoms_dataset.py
sevenn/train/collate.py
sevenn/train/dataload.py
sevenn/train/dataset.py
sevenn/train/graph_dataset.py
sevenn/train/loss.py
sevenn/train/modal_dataset.py
sevenn/train/optim.py
sevenn/train/trainer.py
\ No newline at end of file
[console_scripts]
sevenn = sevenn.main.sevenn:main
sevenn_cp = sevenn.main.sevenn_cp:main
sevenn_get_model = sevenn.main.sevenn_get_model:main
sevenn_graph_build = sevenn.main.sevenn_graph_build:main
sevenn_inference = sevenn.main.sevenn_inference:main
sevenn_patch_lammps = sevenn.main.sevenn_patch_lammps:main
sevenn_preset = sevenn.main.sevenn_preset:main
ase
braceexpand
pyyaml
e3nn>=0.5.0
tqdm
scikit-learn
torch_geometric>=2.5.0
numpy
matscipy
pandas
requests
setuptools>=61.0
[cueq11]
[cueq11:python_version >= "3.10"]
cuequivariance>=0.4.0
cuequivariance-torch>=0.4.0
cuequivariance-ops-torch-cu11
[cueq12]
[cueq12:python_version >= "3.10"]
cuequivariance>=0.4.0
cuequivariance-torch>=0.4.0
cuequivariance-ops-torch-cu12
[test]
pytest
pytest-cov>=5
Energy_RMSE (eV/atom): 18.84848889028682
Force_RMSE (eV/Å): 0.2622841142173583
Stress_RMSE (kbar): 163.7362768581691
Energy_MAE (eV/atom): 18.848487854003906
Force_MAE (eV/Å): 0.116698424021403
Stress_MAE (kbar): 47.33086649576823
stct_id,atom_id,atomic_numbers,atomic_energy,pos_x,pos_y,pos_z,force_of_atoms_x,force_of_atoms_y,force_of_atoms_z,inferred_force_x,inferred_force_y,inferred_force_z
0,0,72,-14.758427,2.76422,4.14748,1.50037,-0.059786,0.151222,-0.085196,-0.18387456,0.4976529,-0.18538895
0,1,72,-14.758418,0.21835,1.30499,1.07094,-0.059786,-0.151222,0.085196,-0.18364179,-0.49762845,0.1854167
0,2,72,-14.75845,4.87338,4.57603,4.07176,0.059786,0.151222,-0.085196,0.18574518,0.49244216,-0.19169456
0,3,72,-14.758455,2.32752,1.73353,3.64233,0.059786,-0.151222,0.085196,0.18554506,-0.4924091,0.1916164
0,4,8,-7.969731,3.85655,0.67027,2.45893,-0.008711,0.112966,0.037362,0.038163364,0.27630207,0.100170046
0,5,8,-7.969726,1.31069,4.7822,0.11238,-0.008711,-0.112966,-0.037362,0.0380187,-0.27626732,-0.10015537
0,6,8,-7.696194,4.23542,2.98966,0.79342,-0.000366,-0.03082,0.075334,-0.0040642396,0.06838645,0.14082311
0,7,8,-7.6961865,1.68956,2.46281,1.77789,-0.000366,0.03082,-0.075334,-0.0042099506,-0.06848977,-0.14088435
0,8,8,-7.6973476,0.85631,2.89135,4.34928,0.000366,0.03082,-0.075334,0.0020455532,-0.06770688,-0.14164624
0,9,8,-7.697351,3.40218,3.41821,3.3648,0.000366,-0.03082,0.075334,0.0020625181,0.06768774,0.14173353
0,10,8,-7.9687324,3.78104,1.09881,5.03032,0.008711,0.112966,0.037362,-0.03782143,0.28077862,0.10171969
0,11,8,-7.968731,1.23518,5.21075,2.68377,0.008711,-0.112966,-0.037362,-0.03796852,-0.28074813,-0.10171008
1,0,72,-14.73119,2.7475,4.12239,1.49129,-0.107044,0.270498,-0.154141,-0.22496888,0.6460437,-0.24772969
1,1,72,-14.731192,0.21703,1.2971,1.06446,-0.107044,-0.270498,0.154141,-0.22493178,-0.64605427,0.24796319
1,2,72,-14.731257,4.84391,4.54835,4.04713,0.107044,0.270498,-0.154141,0.22658941,0.640341,-0.25407305
1,3,72,-14.731257,2.31344,1.72305,3.6203,0.107044,-0.270498,0.154141,0.22664651,-0.640331,0.25397068
1,4,8,-7.9511185,3.83323,0.66621,2.44406,-0.015569,0.202973,0.067068,0.04174666,0.369385,0.14108454
1,5,8,-7.9511194,1.30276,4.75328,0.1117,-0.015569,-0.202973,-0.067068,0.04180483,-0.36939618,-0.14114018
1,6,8,-7.6695013,4.20981,2.97158,0.78862,0.000396,-0.054872,0.138515,-0.011644345,0.080120645,0.18942688
1,7,8,-7.6695027,1.67934,2.44791,1.76714,0.000396,0.054872,-0.138515,-0.011605289,-0.08007531,-0.18946008
1,8,8,-7.670638,0.85113,2.87387,4.32298,-0.000396,0.054872,-0.138515,0.009096172,-0.07910344,-0.19031705
1,9,8,-7.670635,3.3816,3.39753,3.34445,-0.000396,-0.054872,0.138515,0.009038135,0.07907101,0.19029519
1,10,8,-7.950069,3.75818,1.09217,4.99989,0.015569,0.202973,0.067068,-0.040918212,0.37362093,0.14279541
1,11,8,-7.950064,1.22771,5.17923,2.66754,0.015569,-0.202973,-0.067068,-0.040852908,-0.37362194,-0.1428154
num_atoms,user_label,total_energy,inferred_total_energy,stress_xx,stress_yy,stress_zz,stress_xy,stress_yz,stress_zx,inferred_stress_xx,inferred_stress_yy,inferred_stress_zz,inferred_stress_xy,inferred_stress_yz,inferred_stress_zx,cell_lattice_vectors_a,cell_lattice_vectors_b,cell_lattice_vectors_c
12,-,-347.81223,-121.69777,74.372475,73.61505,70.034294,0.0,-4.38372,0.0,171.75166,180.33585,149.94254,-0.0007366179,-7.2767844,9.071616e-05,[5.091732 0. 0. ],[ 0.000000e+00 5.023922e+00 -7.948100e-05],[0. 0.85709256 5.1427774 ]
12,-,-347.6568,-121.40755,135.8412,134.45676,127.92448,0.0,-8.08666,0.0,231.50803,241.38077,203.83183,-0.001700722,-10.654452,-0.00061846955,[5.060935 0. 0. ],[ 0.000000e+00 4.993535e+00 -7.900000e-05],[0. 0.8519085 5.111672 ]
12
Lattice="5.091731935 0.0 0.0 0.0 5.023921826 -7.9481e-05 0.0 0.857092558 5.142777331" Properties=species:S:1:pos:R:3:forces:R:3 stress="-0.04641964502194789 -0.0 -0.0 -0.0 -0.04594690063773523 0.0027361028385316957 -0.0 0.0027361028385316957 -0.04371196601597546" free_energy=-347.81221934 energy=-347.81221934 pbc="T T T"
Hf 2.76422000 4.14748000 1.50037000 -0.05978600 0.15122200 -0.08519600
Hf 0.21835000 1.30499000 1.07094000 -0.05978600 -0.15122200 0.08519600
Hf 4.87338000 4.57603000 4.07176000 0.05978600 0.15122200 -0.08519600
Hf 2.32752000 1.73353000 3.64233000 0.05978600 -0.15122200 0.08519600
O 3.85655000 0.67027000 2.45893000 -0.00871100 0.11296600 0.03736200
O 1.31069000 4.78220000 0.11238000 -0.00871100 -0.11296600 -0.03736200
O 4.23542000 2.98966000 0.79342000 -0.00036600 -0.03082000 0.07533400
O 1.68956000 2.46281000 1.77789000 -0.00036600 0.03082000 -0.07533400
O 0.85631000 2.89135000 4.34928000 0.00036600 0.03082000 -0.07533400
O 3.40218000 3.41821000 3.36480000 0.00036600 -0.03082000 0.07533400
O 3.78104000 1.09881000 5.03032000 0.00871100 0.11296600 0.03736200
O 1.23518000 5.21075000 2.68377000 0.00871100 -0.11296600 -0.03736200
12
Lattice="5.06093517 0.0 0.0 0.0 4.993535202 -7.9e-05 0.0 0.85190853 5.111671823" Properties=species:S:1:pos:R:3:forces:R:3 stress="-0.08478540894709327 -0.0 -0.0 -0.0 -0.0839213094576695 0.0050472962187915115 -0.0 0.0050472962187915115 -0.07984417469287791" free_energy=-347.65678484 energy=-347.65678484 pbc="T T T"
Hf 2.74750000 4.12239000 1.49129000 -0.10704400 0.27049800 -0.15414100
Hf 0.21703000 1.29710000 1.06446000 -0.10704400 -0.27049800 0.15414100
Hf 4.84391000 4.54835000 4.04713000 0.10704400 0.27049800 -0.15414100
Hf 2.31344000 1.72305000 3.62030000 0.10704400 -0.27049800 0.15414100
O 3.83323000 0.66621000 2.44406000 -0.01556900 0.20297300 0.06706800
O 1.30276000 4.75328000 0.11170000 -0.01556900 -0.20297300 -0.06706800
O 4.20981000 2.97158000 0.78862000 0.00039600 -0.05487200 0.13851500
O 1.67934000 2.44791000 1.76714000 0.00039600 0.05487200 -0.13851500
O 0.85113000 2.87387000 4.32298000 -0.00039600 0.05487200 -0.13851500
O 3.38160000 3.39753000 3.34445000 -0.00039600 -0.05487200 0.13851500
O 3.75818000 1.09217000 4.99989000 0.01556900 0.20297300 0.06706800
O 1.22771000 5.17923000 2.66754000 0.01556900 -0.20297300 -0.06706800
import pytest
def pytest_addoption(parser):
parser.addoption('--lammps_cmd', default=None, help='Lammps binary to test')
parser.addoption(
'--mpirun_cmd', default=None, help='mpirun binary to test parallel'
)
@pytest.fixture
def lammps_cmd(request):
bin = request.config.getoption('lammps_cmd')
if bin is None:
pytest.skip('No LAMMPS binary given, skipping test')
return bin
@pytest.fixture
def mpirun_cmd(request):
bin = request.config.getoption('mpirun_cmd')
if bin is None:
pytest.skip('No mpirun cmd given, skipping test')
return bin
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment