ferrotherm 0.33.0

Thermodynamic computing in pure Rust: sparse energy-based models, chromatic block-Gibbs, parallel tempering, thermodynamic linear algebra, stochastic differentiable programs, a variational compiler onto device topologies, exact inference by variable elimination, planted instances with known optima, sampler certificates, and a first-class joules ledger. std-only, zero dependencies, wasm-clean, deterministic by seed.
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
�

�ۀj�H���SrSSKrSSKJs Jr SSKrSSKrSSK	J
r
 SSKr\RRS\"\
"\5R!5R"55 SSKrSrSrSrSrSrS	rS
rSrSrS
rSrSrSr Sr!Sr"Sr#Sr$Sr%Sr&Sr'Sr(Sr)Sr*Sr+Sr,Sr-Sr.Sr/S r0S!r1S"r2S#r3S$r4g)%apTests for the modelling layer.

Run from the repository root, after `cargo build --release`:

    python3 -m pytest python/test_model.py -q

Each test names a way this layer can be wrong without looking wrong. Sampling is stochastic, so
nothing here asserts on a particular random draw: every assertion is about a property the answer
must have for any correct solver.
�N)�Pathc���[R"5nSVs0sHoURUS5_M nnURUSUS5 URUSUS5 URUSUS5 UR	5nUR
oD(d�[R"U5S-S[R"5;d[R"U5(a[R"U5OS[R"U5S.-n[[R"U55eSnUSUSUS1n[U5nSovU:Ho�(d�[R"S	U4S
Xg45S[R"5;d[R"[5(a[R"[5OS[R"U5[R"U5[R"U5S.-n	[R"U5S
-SU	0-n
[[R"U
55eS=n=n=p�gs snf)N)�west�middle�east�rrr�.
>assert %(py2)s
{%(py2)s = %(py0)s.feasible
}�a��py0�py2��==�z0%(py4)s
{%(py4)s = %(py0)s(%(py2)s)
} == %(py7)s�len�rr
�py4�py7�
>assert %(py9)s�py9)�ft�Problem�categorical�	not_equal�solve�feasible�
@pytest_ar�_format_assertmsg�@py_builtins�locals�_should_repr_global_name�	_saferepr�AssertionError�_format_explanationr�_call_reprcompare)�p�n�rr
�@py_assert1�@py_format3�@py_assert3�@py_assert6�@py_assert5�@py_format8�@py_format10s           �P/Users/dcharlot/vibe-coding/bmi-concept/research/ferrotherm/python/test_model.py�#test_a_triangle_needs_three_coloursr1s|��
�
�
��A�)C�D�)C�A�A�M�M�!�Q��	�)C�A�D��K�K��&�	�1�X�;�'��K�K��(��Q�v�Y�'��K�K��&�	�1�V�9�%�	���	�A��:�:��:���q�������1�����1����:��������&�	�1�X�;��&�	�2�;�3�2�3�;�q�;�q�8�;�;�;�;�3�;�;�;�;�;�;�3�;�;�;�;�3�;�;�;�2�;�;�;�3�;�;�;�q�;�;�;�;�!�;�;�;�;�;�;�;��
	Es�Ic��[R"5nURSSS5nURSUR	S5-5 UR5SnSo2U:HoD(do[R"SU4SX#45[R"U5[R"U5S.-nS	S
U0-n[[R"U55eS=n=pC[R"5nURSSS5n[R"[SS
9 URUS5 SSS5 g!,(df   g=f)zSThe trap: a variable over 10..=20 holds 13 in its fourth slot. The literal says 13.�temperature�
���
r�z%(py1)s == %(py4)s��py1r�assert %(py6)s�py6Nztemperature.*10\.\.=20��matchr)rr�integer�maximize�is_rrr%r"r#r$�pytest�raises�
ValueError�fix�r&�t�@py_assert0r+�@py_assert2�@py_format5�@py_format7s       r0�,test_an_integer_is_written_in_its_own_valuesrL!s���
�
�
��A�	�	�	�-��R�(�A��J�J�q�1�5�5��9�}���7�7�9�]�#�)�r�)�r�)�)�)�)�)�#�)�)�)�#�)�)�)�r�)�)�)�)�)�)�)�
�
�
��A�	�	�	�-��R�(�A�	���z�)B�	C�	���a���
D�	C�	C�s� D<�<
E
c��[R"5nURSSS5nURUS5 UR	5SnSo3*oBU:HoU(do[
R"SU4SX$45[
R"U5[
R"U5S.-nS	S
U0-n[[
R"U55eS=n=n=p4g)N�drifti����i����i�����r)z%(py1)s == -%(py4)sr9�assert %(py7)sr)
rrr?rErrr%r"r#r$)r&�drHr+r-rI�@py_format6r.s        r0�test_a_range_below_zero_worksrS.s���
�
�
��A�	�	�	�'�3��$�A��E�E�!�S�M��7�7�9�W��$�"�$��$��$�$�$�$�$��$�$�$��$�$�$�"�$�$�$�$�$�$�$�c�@�SnSnSo"7o0"X5nSoTU:Hof(d�[R"SU4SXE45S[R"5;d"U5(a[R
"U5OS[R
"U5[R
"U5[R
"U5[R
"U5S.-n[R"S	5S
-SU0-n[[R"U55eS=n=n=n=n=peSnSo"*o0"X5nS
oTU:Hof(d�[R"SU4SXE45S[R"5;d"U5(a[R
"U5OS[R
"U5[R
"U5[R
"U5[R
"U5S.-n[R"S5S
-SU0-n[[R"U55eS=n=n=n=n=peSnSo"*o0"X5nSoTU:Hof(d�[R"SU4SXE45S[R"5;d"U5(a[R
"U5OS[R
"U5[R
"U5[R
"U5[R
"U5S.-n[R"S5S
-SU0-n[[R"U55eS=n=n=n=n=peSnSo"7o0"X5nSoTU:Hof(d�[R"SU4SXE45S[R"5;d"U5(a[R
"U5OS[R
"U5[R
"U5[R
"U5[R
"U5S.-n[R"S5S
-SU0-n[[R"U55eS=n=n=n=n=peSnSo"*o0"X5nSoTU:Hof(d�[R"SU4SXE45S[R"5;d"U5(a[R
"U5OS[R
"U5[R
"U5[R
"U5[R
"U5S.-n[R"S5S
-SU0-n[[R"U55eS=n=n=n=n=peg)z�The distinction an inequality exists for, in the only case that shows it.

With every variable rewarded, `at most 2` and `exactly 2` agree. With every variable penalised,
they do not: an inequality is satisfied by taking none, an equality is not.
c�^^�[R"5n[S5Vs/sHo2RSU35PM nn[	X 5"US5 UR[
U4Sj[U5555 UR5mTRoU(d�[R"T5S-S[R"5;d[R"T5(a[R"T5OS[R"U5S.-n[![R""U55eSn[
U4SjU55$s snf)	N��v�c3�\># �UH!upTSU-
-URS5-v� M# g7f)rW�N�rA)�.0�irX�signs   �r0�	<genexpr>�Qtest_at_most_is_a_ceiling_and_at_least_is_a_floor.<locals>.run.<locals>.<genexpr>?s(����K�]�T�Q�t�q�1�u�~����a��0�]�s�),r	r
rc3�T># �UHnTUR(dMSv� M g7f�r[N��name)r]rXr
s  �r0r`raBs����.�b��A�a�f�f�I�1�1�b���(�	()rr�range�binary�getattrr@�sum�	enumeraterrrrrr r!r"r#r$)�kindr_r&r^�vsr)r*r
s `     @r0�run�>test_at_most_is_a_ceiling_and_at_least_is_a_floor.<locals>.run;s�����J�J�L��).�q��
2��A�h�h��1�#�w����
2�����Q��	�
�
�3�K�Y�r�]�K�K�L�
�G�G�I���z�z��z���1�������q�����q����z��������.�b�.�.�.��3s�E�at_mostr[rYr)z;%(py7)s
{%(py7)s = %(py0)s(%(py2)s, +%(py4)s)
} == %(py10)srn)rr
rr�py10z0a ceiling binds against a reward pushing past it�
>assert %(py12)s�py12Nr)z;%(py7)s
{%(py7)s = %(py0)s(%(py2)s, -%(py4)s)
} == %(py10)szand is satisfied by taking none�exactlyz'where an equality still has to take two�at_leastrWz#a floor does not forbid taking morez+and holds against a reward pushing below it�	rr%rr r!r"rr#r$)	rnr)r+r-r,�@py_assert9�@py_assert8�@py_format11�@py_format13s	         r0�1test_at_most_is_a_ceiling_and_at_least_is_a_floorr{5sG��/��V�1�V�"�V�3�y��V��V��"�V�V�V�V��V�V�V�V�V�V�3�V�V�V�V�3�V�V�V�y�V�V�V�1�V�V�V��V�V�V��V�V�V�V�$V�V�V�V�V�V�V�V��E�1�E�"�E�3�y��E��E��"�E�E�E�E��E�E�E�E�E�E�3�E�E�E�E�3�E�E�E�y�E�E�E�1�E�E�E��E�E�E��E�E�E�E�$E�E�E�E�E�E�E�E��M�1�M�"�M�3�y��M��M��"�M�M�M�M��M�M�M�M�M�M�3�M�M�M�M�3�M�M�M�y�M�M�M�1�M�M�M��M�M�M��M�M�M�M�$M�M�M�M�M�M�M�M��J�A�J�2�J�3�z��J�!�J�!�#�J�J�J�J��J�J�J�J�J�J�3�J�J�J�J�3�J�J�J�z�J�J�J�A�J�J�J��J�J�J�!�J�J�J�J�%J�J�J�J�J�J�J�J��R�A�R�2�R�3�z��R�!�R�!�#�R�R�R�R��R�R�R�R�R�R�3�R�R�R�R�3�R�R�R�z�R�R�R�A�R�R�R��R�R�R�!�R�R�R�R�%R�R�R�R�R�R�R�RrTc�^
�[R"5n[S5Vs/sHoRSU35PM nnUR	US5 UR[
S[U5555 UR5m
T
Ro3(d�[R"T
5S-S[R"5;d[R"T
5(a[R"T
5OS[R"U5S.-n[![R""U55eSnU
4S	jU5n[
U5nSoeU:How(d�[R$"S
U4SXV45S[R"5;d[R"[5(a[R"[5OS[R"U5[R"U5[R"U5S
.-n[R"T
5S-SU0-n	[![R""U	55eS=n=n=pvgs snf)zDNine shifts, at most two taken. The old binding capped this at four.�	�srYc3�T# �UHupSU-
URS5-v� M  g7f)r}r[Nr\)r]r^r~s   r0r`�?test_a_counting_constraint_can_be_any_length.<locals>.<genexpr>Ps#���@�-�$�!�A��E�Q�U�U�1�X�%�-�s�&(r	r
rNc3�T># �UHnTUR(dMSv� M g7frcrd�r]r~r
s  �r0r`r�Ss����*�"�Q��!�&�&�	�q�q�"�rfrrrjrrr)rrrgrhrpr@rjrkrrrrrr r!r"r#r$r%)r&r^�shr)r*r+r,r-r.r/r
s          @r0�,test_a_counting_constraint_can_be_any_lengthr�KsV���
�
�
��A�%*�1�X�	.�X��(�(�Q�q�c�7�
�X�B�	.��I�I�b�!���J�J�s�@�)�B�-�@�@�A�	���	�A��:�:��:���q�������1�����1����:�������*�"�*�2�3�*�*�2�a�2�a�/�2�2�2�2�*�2�2�2�2�2�2�3�2�2�2�2�3�2�2�2�*�2�2�2�*�2�2�2�a�2�2�2�2��2�2�2�2�2�2�2��
/s�Ic�|�[R"5nURSS5nURSSS5nUR	URS5URS5/S5 UR
S	URS5-SURS5--5 UR5nURoD(d�[R"U5S
-S[R"5;d[R"U5(a[R"U5OS[R"U5S.-n[[R "U55eS
nUSnSovU:Ho�Sn	So�U
:Ho�U-nSo�U
:*o�(Gd[R""SU4SXg45[R"U5[R"U5S.-n[R""SU4SX�45[R"U	5[R"U
5S.-n[R""SU4SX�45UU[R"U
5S.-n[R"U5S-SU0-n[[R "U55eS
=n=n=n=n	=n=n
=n=p�USnSovU:Ho�(d�[R""SU4SXg45[R"U5[R"U5S.-n[R"S5S-SU0-n[[R "U55eS
=n=p�g
)zH"At most one of a=3 and b=17" is not sayable with a single shared value.�xrW�yr4r5r�r[r6r	r
rNrr8r9)z%(py8)s == %(py11)s)�py8�py11)�<=)z (%(py6)s + %(py13)s) <= %(py17)s)r<�py13�py17z
>assert %(py19)s�py19z)and it keeps the more valuable of the two�
>assert %(py6)sr<)rrrr?rprAr@rrrrrr r!r"r#r$r%)r&r�r�r
r)r*rHr+rI�@py_assert7�@py_assert10rw�@py_assert14�@py_assert16�@py_assert15rJ�@py_format12�@py_format18�@py_format20rKs                    r0�9test_literals_in_one_constraint_may_name_different_valuesr�Vs���
�
�
��A�	�
�
�c�1��A�	�	�	�#�r�2��A��I�I�q�u�u�Q�x����r��#�Q�'��J�J�q�1�5�5��8�|�a�!�%�%��)�m�+�,�	���	�A��:�:��:���q�������1�����1����:�������
�c�F�1�a�1�a�K�1�c�F�1�b�1�b�L�1�)�1�Q�1�Q�.�1�1�1�1�F�1�1�1�F�1�1�1�a�1�1�1�1�F�1�1�1�F�1�1�1�b�1�1�1�1�)�1�1�1�Q�1�1�1�1��1�1�1�1�1�1�1�1��S�6�C�Q�C�Q�;�C�C�C�C�6�C�C�C�6�C�C�C�Q�C�C�C�C�C�C�C�C�C�C�C�CrTc���SnU"SS5SnSo!U:Ho3(d�[R"SU4SX45[R"U5[R"U5S.-n[R"S	5S
-SU0-n[	[R
"U55eS=n=p2U"SS5SnSo!U:Ho3(d�[R"SU4SX45[R"U5[R"U5S.-n[R"S
5S
-SU0-n[	[R
"U55eS=n=p2U"SS5SnSo!U:Ho3(d�[R"SU4SX45[R"U5[R"U5S.-n[R"S5S
-SU0-n[	[R
"U55eS=n=p2[R"5n[S5Vs/sHovRSU35PM nnURUS5 URo�"5o"Ro�"SS5So�U:�o�(d�[R"SU4SX�45S[R"5;d"U5(a[R"U5OS[R"U	5[R"U5[R"U
5[R"U5S.-n
[R"S5S-SU
0-n[	[R
"U55eS=n	=n=n
=p�gs snf)Nc�^^�[R"5n[S5Vs/sHo2RSU35PM nn[	X 5"U5 UR[
U4SjU555 UR5mTRoU(d�[R"T5S-S[R"5;d[R"T5(a[R"T5OS[R"U5S.-n[[R "U55eSn[
U4SjU55TR"4$s snf)Nr6rXc3�L># �UHnTURS5-v� M g7frcr\)r]r~r_s  �r0r`�@test_exactly_one_and_at_most_one.<locals>.run.<locals>.<genexpr>hs����2��1�t�a�e�e�A�h���s�!$r	r
rc3�T># �UHnTUR(dMSv� M g7frcrdr�s  �r0r`r�ks����-�a��1�Q�V�V�9�1�1�a�rf)rrrgrhrir@rjrrrrrr r!r"r#r$�spins)�methodr_r&r^rXr)r*r
s `     @r0rn�-test_exactly_one_and_at_most_one.<locals>.runds�����J�J�L��(-�a��1��1�X�X��!��g�
���1����1��	�
�
�3�2��2�2�3�
�G�G�I���z�z��z���1�������q�����q����z��������-�a�-�-�q�w�w�6�6��
2s�E�exactly_one�����rr[rr8r9zone, even pushed offr�r<�at_most_oneznone, when pushed offzand one when pulled onr6rX��>)z^%(py6)s
{%(py6)s = %(py4)s
{%(py4)s = %(py2)s
{%(py2)s = %(py0)s.solve
}()
}.spins
} > %(py9)sr&�rr
rr<rz-at_most k=1 costs slack; at_most_one does not�
>assert %(py11)sr�)rr%r"rr#r$rrrgrhrprr�rr r!)rnrHr+rIrJrKr&r^rXr)r-rxr�r/r�s               r0� test_exactly_one_and_at_most_oner�cs/��7��}�b�!�!�$�A��A��)�A�A�A�A�$�A�A�A�$�A�A�A��A�A�A�A�+A�A�A�A�A�A�A�A��}�b�!�!�$�B��B��)�B�B�B�B�$�B�B�B�$�B�B�B��B�B�B�B�+B�B�B�B�B�B�B�B��}�b�!�!�$�C��C��)�C�C�C�C�$�C�C�C�$�C�C�C��C�C�C�C�+C�C�C�C�C�C�C�C�	�
�
��A�$)�!�H�-�H�q���A�a�S�'�	�H�A�-��I�I�a��O��7�7�g�7�9�g�?�?�g�S���3�A�6�g�6�6�g�g�g�g�?�g�g�g�g�g�g�1�g�g�g�g�1�g�g�g�7�g�g�g�9�g�g�g�?�g�g�g�6�g�g�g�g�8g�g�g�g�g�g�g�g��	.s�M7c��[R"5nURSS5n[R"[
SS9 UR
U/S5 SSS5 [R"[
SS9 UR
XRSS5/S5 SSS5 [R"[S	S9 UR
US/S5 SSS5 g!,(df   N�=f!,(df   NV=f!,(df   g=f)
Nr�r�at least twor=r[z	k must ber�r}zvariables or literals)rrrrBrCrDrp�	TypeError�r&r�s  r0�7test_a_counting_constraint_refuses_what_it_cannot_countr�xs���
�
�
��A�	�
�
�c�1��A�	���z��	8�	�	�	�1�#�q��
9�	���z��	5�	�	�	�1�m�m�C��+�,�a�0�
6�	���y�(?�	@�	�	�	�1�c�(�A��
A�	@�	
9�	8��	5�	5��	@�	@�s$�C�6$C*�;C;�
C'�*
C8�;
D	c	���SnSo"U5nSo0"U5oBU:�oU(GdF[R"SU4SX$45S[R"5;d"U5(a[R
"U5OS[R
"U5[R
"U5S[R"5;d"U5(a[R
"U5OS[R
"U5[R
"U5S.-n[R"S5S	-S
U0-n[[R"U55eS=n=n=n=p4g)Nc���[R"5n[S5Vs/sHo!RSU35PM nn[	X5"US5 UR5nURn[U5n[S5Vs1sHnSU3iM
 nnXg:Ho�(Gd9[R"SU4SXg45S[R"5;d[R"[5(a[R"[5OSS[R"5;d[R"U5(a[R"U5OS[R"U5[R"U5[R"U5S.-n	[R"S	5S
-SU	0-n
[[R "U
55eS=n=n=p�UR"$s snfs snf)NrWrXrYr)zL%(py5)s
{%(py5)s = %(py0)s(%(py3)s
{%(py3)s = %(py1)s.values
})
} == %(py8)s�setr
�rr:�py3�py5r�zno slack in the answer�
>assert %(py10)srq)rrrgrhrir�valuesr�rr%rr r!r"rr#r$r�)rlr&r^rmr
rI�@py_assert4r�r,�@py_format9rys           r0r��Etest_slack_costs_spins_but_never_appears_in_the_answer.<locals>.spins�s-���J�J�L��).�q��
2��A�h�h��1�#�w����
2�����Q��
�G�G�I���8�8�U�s�8�}�U�%��(� ;�(�Q�1�Q�C��(�U� ;�}�;�U�U�U�U�}�U�U�U�U�U�U�s�U�U�U�U�s�U�U�U�U�U�U�1�U�U�U�U�1�U�U�U�8�U�U�U�}�U�U�U� ;�U�U�U�U�=U�U�U�U�U�U�U�U��w�w���	3��!<s�G0�G5rprtr�)zO%(py4)s
{%(py4)s = %(py0)s(%(py2)s)
} > %(py10)s
{%(py10)s = %(py6)s(%(py8)s)
}r�)rr
rr<r�rqz$an inequality needs a slack variablerrrsrv)r�r)r+r�rwr-ryrzs        r0�6test_slack_costs_spins_but_never_appears_in_the_answerr��s�����V�5���V�I�V�e�I�.�V�.�.�V�V�V�V��V�V�V�V�V�V�5�V�V�V�V�5�V�V�V��V�V�V��V�V�V�V�V�V�e�V�V�V�V�e�V�V�V�I�V�V�V�.�V�V�V�V�0V�V�V�V�V�V�V�VrTc�@�[R"5nURSS5URSS5p!URSUR	S5UR	S5--5 UR5nUSUS4nSoTU:Hof(d�[R"SU4SXE45[R"U5[R"U5S	.-n[R"U5S
-SU0-n[[R"U55eS=n=peg)Nr
r�brWrY)rYrYrr8r9r�r<)rrrr@rArrr%r"rr#r$)	r&r
r��ansrHr+rIrJrKs	         r0�'test_a_quadratic_term_rewards_agreementr��s���
�
�
��A��=�=��a� �!�-�-��Q�"7�q��J�J�q�A�E�E�!�H�q�u�u�Q�x�'�(�)�
�'�'�)�C���H�c�#�h��.�6�.�6�)�.�.�.�.��.�.�.��.�.�.�6�.�.�.�.�3�.�.�.�.�.�.�.rTc��[R"5nURSS5URSS5p!URX5 UR	SURS5-SURS5--5 UR
5nURoD(d�[R"U5S-S[R"5;d[R"U5(a[R"U5OS[R"U5S.-n[[R"U55eS	nUSocSovU:go�(d�[R "S
U4SXg45[R"U5[R"U5S.-n	[R"U5S
-SU	0-n
[[R"U
55eS	=n=p�URoD"5owR"nSo�U:�o�(d�[R "SU
4SX�45S[R"5;d[R"U5(a[R"U5OS[R"U5[R"U5[R"U5[R"U5S.-n[R"S5S-SU0-n[[R"U55eS	=n=n=n=p�g	)zZThe penalty scales above the largest objective coefficient, or a constraint is decorative.r
rr��2r[r	r�rN)�!=)z%(py1)s != %(py4)sr9r�r<�d)�>=)za%(py6)s
{%(py6)s = %(py4)s
{%(py4)s = %(py2)s
{%(py2)s = %(py0)s.solve
}()
}.penalty
} >= %(py9)sr&r�z&the penalty must outrank the objectiver�r�)rrrrr@rArrrrrr r!r"r#r$r%�penalty)r&r
r�r�r)r*rHr+rIrJrKr-rxr�r/r�s                r0�3test_a_constraint_cannot_be_outbid_by_the_objectiver��s���
�
�
��A��=�=��a� �!�-�-��Q�"7�q��K�K����J�J�r�A�E�E�!�H�}�r�A�E�E�!�H�}�,�-�
�'�'�)�C��<�<��<����������3�����3����<��������s�8�$�3�x�$�x��$�$�$�$�8�$�$�$�8�$�$�$�x�$�$�$�$��$�$�$�$�$�$�$��7�7�M�7�9�M���M��M��#�M�M�M�M��M�M�M�M�M�M�1�M�M�M�M�1�M�M�M�7�M�M�M�9�M�M�M��M�M�M��M�M�M�M�%M�M�M�M�M�M�M�MrTc���[R"5nURSS5URSS5p!URX5 UR	S5 URSUR
S5-SUR
S5--5 UR5nUSUS4nSoTU:Hof(d�[R"SU4S	XE45[R"U5[R"U5S
.-n[R"U5S-SU0-n[[R"U55eS
=n=peURn	/o�U
:HoU(d�[R"SU4SX�45S[R "5;d[R""U5(a[R"U5OS[R"U	5[R"U
5S.-n[R"S5S-SU0-n[[R"U55eS
=n	=pZUR$o�(+oU(d�[R"S5S-S[R "5;d[R""U5(a[R"U5OS[R"U	5S.-n
[[R"U
55eS
=p�UR&n[)U5n
So�U:Ho�(GdC[R"SU4SX�45S[R "5;d[R""[(5(a[R"[(5OSS[R "5;d[R""U5(a[R"U5OS[R"U5[R"U
5[R"U5S.-n[R"UR&5S-SU0-n[[R"U55eS
=n=n
=p�SoCR&SoUR*nUU;of(d�[R"SU4SUU45[R"U5[R"U5[R"U5S .-n[R"UR&S5S!-S"U0-n[[R"U55eS
=n=n=nnUR&SoDR,nSnUU:�o�(d�[R"S#U
4S$UU45[R"U5[R"U5[R"U5S%.-n[R"S&5S!-S"U0-n[[R"U55eS
=n=n=n
ng
)'z�A penalty makes a constraint expensive, not impossible.

Pin it below the objective and the sampler pays it: every variable decodes cleanly and the
constraint is broken. `feasible` used to be true for exactly that answer.
r
rr���?�(r[)r[r[rr8r9r�r<N)z1%(py2)s
{%(py2)s = %(py0)s.undecoded
} == %(py5)sr��rr
r�z every variable decoded perfectly�
>assert %(py7)srzand it is still not feasiblez2
>assert not %(py2)s
{%(py2)s = %(py0)s.feasible
}r)zN%(py5)s
{%(py5)s = %(py0)s(%(py3)s
{%(py3)s = %(py1)s.violated
})
} == %(py8)srr�r�rqzmust differr��in)z.%(py1)s in %(py6)s
{%(py6)s = %(py4)s.detail
})r:rr<�
>assert %(py8)sr�r�)z)%(py3)s
{%(py3)s = %(py1)s.by
} > %(py6)s�r:r�r<z'and by how much, not only that it broke)rrrrr�r@rArrr%r"rr#r$�	undecodedrr r!r�violatedr�detail�by)r&r
r�r�rHr+rIrJrKr)r�rRr.�@py_format4r�r,r�ryr-s                   r0�(test_feasible_means_the_constraints_holdr��sk��	�
�
��A��=�=��a� �!�-�-��Q�"7�q��K�K����I�I�c�N��J�J�r�A�E�E�!�H�}�r�A�E�E�!�H�}�,�-�
�'�'�)�C���H�c�#�h��.�6�.�6�)�.�.�.�.��.�.�.��.�.�.�6�.�.�.�.�3�.�.�.�.�.�.�.��=�=�B�B�B�B��B�B�B�B�=�B�B�B�B�B�B�3�B�B�B�B�3�B�B�B�=�B�B�B�B�B�B�B�B� B�B�B�B�B�B�B�B��|�|�;��;��;�;�;�;�;�;�;�;�;�s�;�;�;�;�s�;�;�;�|�;�;�;�;�;�;��|�|�/�3�|��/��/��!�/�/�/�/��/�/�/�/�/�/�3�/�/�/�/�3�/�/�/�/�/�/�s�/�/�/�/�s�/�/�/�|�/�/�/��/�/�/��/�/�/�/�3�<�<�/�/�/�/�/�/�/��C�L�L��O�C�2�2�C�=�2�2�C�C�C�C�=�2�C�C�C�=�C�C�C�O�C�C�C�2�C�C�C�C�C�L�L��O�C�C�C�C�C�C�C��<�<��?�L���L��L���!�L�L�L�L���L�L�L�?�L�L�L��L�L�L��L�L�L�L�#L�L�L�L�L�L�L�LrTc�z�SnSo"U5o"Ro3(+oD(d�[R"S5S-S[R"5;d[R
"U5(a[R"U5OS[R"U5[R"U5[R"U5S.-n[[R"U55eS=n=n=p4So"U5o"Ro3(d�[R"S5S	-S[R"5;d[R
"U5(a[R"U5OS[R"U5[R"U5[R"U5S.-n[[R"U55eS=n=p#So"U5o"Ro3(d�[R"S
5S	-S[R"5;d[R
"U5(a[R"U5OS[R"U5[R"U5[R"U5S.-n[[R"U55eS=n=p#SS[S
54H]n[R"5nURSS5 [R"[SS9 UR!U5 SSS5 M_ g!,(df   Mq=f)Nc�T�[R"5nURSS5URSS5p2URX#5 U(aUR	U5 URSUR
S5-SUR
S5--5 UR5$)Nr
rr�r�r[)rrrrr�r@rAr)�pinr&r
r�s    r0rn�<test_raising_the_penalty_wins_a_constraint_back.<locals>.run�sy���J�J�L���}�}�S�!�$�a�m�m�C��&;�1�	���A���
�I�I�c�N�	�
�
�2����a��=�2����a��=�0�1��w�w�y�rTr��outbidzP
>assert not %(py6)s
{%(py6)s = %(py4)s
{%(py4)s = %(py0)s(%(py2)s)
}.feasible
}rn�rr
rr<gi@zand won back by raising itzL
>assert %(py6)s
{%(py6)s = %(py4)s
{%(py4)s = %(py0)s(%(py2)s)
}.feasible
}z.the automatic scaling already handles this one�g��nanr�rzpositive numberr=)rrrrr r!r"r#r$�floatrrrrBrCrDr�)	rnr)r+r-r�r.rK�badr&s	         r0�/test_raising_the_penalty_wins_a_constraint_backr��s�����*�s�3�x�*� � �*� �*� �*�*�(�*�*�*�*�*�*�s�*�*�*�*�s�*�*�*�3�*�*�*�x�*�*�*� �*�*�*�*�*�*��<�3�u�:�<���<��<�<� <�<�<�<�<�<�<�3�<�<�<�<�3�<�<�<�u�<�<�<�:�<�<�<��<�<�<�<�<�<��O�3�t�9�O���O��O�O�O�O�O�O�O�O�O�3�O�O�O�O�3�O�O�O�t�O�O�O�9�O�O�O��O�O�O�O�O�O��T�5��<�(���J�J�L��	�
�
�c�1��
�]�]�:�->�
?�
�I�I�c�N�@�
?�)�@�
?�s�L+�+
L:	c�p�[R"5nURSS5nURUS5 UR	5 URSSS9nURo2RoCU:HoU(Gd[R"SU4SX445S	[R"5;d[R"U5(a[R"U5OS	[R"U5S	[R"5;d[R"U5(a[R"U5OS	[R"U5S
.-n[R"S5S-S
U0-n[[R"U55eS=n=pTUR nSo�U:�oU(d�[R"SU4SX845S	[R"5;d[R"U5(a[R"U5OS	[R"U5[R"U5S.-n	[R"U5S-SU	0-n
[[R"U
55eS=n=pXUR"n[%U[&5oD(Gd@SS[R"5;d[R"[$5(a[R"[$5OSS	[R"5;d[R"U5(a[R"U5OS	[R"U5S[R"5;d[R"[&5(a[R"[&5OS[R"U5S.-n[[R"U55eS=p�UR(o2R"oD(+o�U:HoU(Gd[R"SU4SX<45S	[R"5;d[R"U5(a[R"U5OS	[R"U5S	[R"5;d[R"U5(a[R"U5OS	[R"U5S
.-n
[R"S5S-SU
0-n
[[R"U
55eS=n=n=pLUR*b�UR,nSo�ULoU(d�[R"SU4SX845S	[R"5;d[R"U5(a[R"U5OS	[R"U5[R"U5S.-n	[R"S5S-SU	0-n
[[R"U
55eS=n=pXgg)Nr�rWrYr�i)�beta�drawsr)zN%(py2)s
{%(py2)s = %(py0)s.beta_eff
} == %(py6)s
{%(py6)s = %(py4)s.beta_eff
}�cr�zbeta_eff is a real numberr�r�rr�)z*%(py2)s
{%(py2)s = %(py0)s.ess
} > %(py5)sr�r�rzSassert %(py6)s
{%(py6)s = %(py0)s(%(py3)s
{%(py3)s = %(py1)s.findings
}, %(py4)s)
}�
isinstance�list)rr:r�rr<)zP%(py2)s
{%(py2)s = %(py0)s.passed
} == not %(py6)s
{%(py6)s = %(py4)s.findings
}z(passed is exactly an empty findings listrr��is not)z7%(py2)s
{%(py2)s = %(py0)s.noise_floor
} is not %(py5)sz+a TV without its floor is not a measurement)rrrrEr�certify�beta_effrr%rr r!r"rr#r$�ess�findingsr�r��passed�tv�noise_floor)r&r�r�r)r-r+rKr�r�rRr.rIr�r/s              r0�8test_a_certificate_reports_on_the_sampler_not_the_answerr��s?��
�
�
��A�	�
�
�c�1��A��E�E�!�Q�K��G�G�I�	�	�	�s�#�	�&�A��:�:�@���@��#�@�@�@�@�:�@�@�@�@�@�@�1�@�@�@�@�1�@�@�@�:�@�@�@�@�@�@��@�@�@�@��@�@�@��@�@�@�@�%@�@�@�@�@�@�@�@��5�5��1��1�9�����5�������1�����1����5����1�����a���������j�j�'�:�j�$�'�'�'�'�'�'�'�'�'�:�'�'�'�'�:�'�'�'�'�'�'�a�'�'�'�'�a�'�'�'�j�'�'�'�'�'�'�$�'�'�'�'�$�'�'�'�'�'�'�'�'�'�'��8�8�S�J�J�S��S��'�S�S�S�S�8�S�S�S�S�S�S�1�S�S�S�S�1�S�S�S�8�S�S�S�S�S�S�A�S�S�S�S�A�S�S�S�J�S�S�S�S�)S�S�S�S�S�S�S�S��t�t���}�}�W�D�W�D�(�W�W�W�W�}�W�W�W�W�W�W�q�W�W�W�W�q�W�W�W�}�W�W�W�D�W�W�W�W�*W�W�W�W�W�W�W�W�rTc
��Sup[R"5nURSX45n[U5H#nUR	URU55 M% [U5H#nUR
URU55 M% URSUSRS5-SUSRS5--5 URSS9nURow(d�[R"U5S	-S
[R"5;d[R "U5(a[R""U5OS
[R""U5S.-n[%[R&"U55eSn[U5GHxn[U5Vs/sHoVS
USUS3(dMUPM n	n[)U	5n
So�U:Ho�(Gd*[R*"SU4SX�45S[R"5;d[R "[(5(a[R""[(5OSS[R"5;d[R "U	5(a[R""U	5OS[R""U
5[R""U5S.-n
[R"SUSU	35S-SU
0-n[%[R&"U55eS=n
=p�GM{ USnSnUU:Ho�(d�[R*"SU
4SUU45[R""U5[R""U5S.-n[R"U5S-SU0-n
[%[R&"U
55eS=n=n
nUSnSnUU:Ho�(d�[R*"SU
4SUU45[R""U5[R""U5S.-n[R"U5S-SU0-n
[%[R&"U
55eS=n=n
ngs snf)zQThe shape most real models have, and the one that needs an index to write at all.)rr�assignr)rrYr[)r[r� ��triesr	r�rNzassign[�,�]r�z0%(py3)s
{%(py3)s = %(py0)s(%(py1)s)
} == %(py6)sr�taken�rr:r�r<zworker z takes exactly one shift: r�r�zassign[0,2]r8r9r�r<zassign[1,0])rr�gridrgr��rowr��columnr@rArrrrrr r!r"r#r$rr%)�workers�shiftsr&r
�wr~r�r)r*r�rIr-r�rKr�rHr+rJs                  r0�5test_a_grid_of_variables_models_an_assignment_problemr��s����O�G�
�
�
��A�	���x�'�*�+�A�
�7�^��	�
�
�a�e�e�A�h���
�6�]��	�
�
�a�h�h�q�k�"���J�J�q�1�T�7�;�;�q�>�!�A��$����A��$6�6�7�
�'�'��'�
�C��<�<��<����������3�����3����<�������
�7�^��!�&�M�E�M�q�7�1�#�Q�q�c��1C�-D��M��E��5�z�N�Q�N�Q��N�N�N�N�z�N�N�N�N�N�N�s�N�N�N�N�s�N�N�N�N�N�N�5�N�N�N�N�5�N�N�N�z�N�N�N�Q�N�N�N�N�'�!��,F�u�g� N�N�N�N�N�N�N�N���}��'��'���"�'�'�'�'���'�'�'��'�'�'��'�'�'�'�C�'�'�'�'�'�'�'��}��'��'���"�'�'�'�'���'�'�'��'�'�'��'�'�'�'�C�'�'�'�'�'�'�'��Fs�*Q�Qc�	�[R"5nURSS5n[U5nSo2U:HoD(Gd
[R
"SU4SX#45S[R"5;d[R"[5(a[R"[5OSS[R"5;d[R"U5(a[R"U5OS[R"U5[R"U5S.-nS	S
U0-n[[R"U55eS=n=pCURnSoGU:Ho�(d�[R
"SU4SXt45S[R"5;d[R"U5(a[R"U5OS[R"U5[R"U5S
.-n	SSU	0-n
[[R"U
55eS=n=p�USo�RnSo2U:HoD(d�[R
"SU4SX#45[R"U5[R"U5[R"U5S.-nS	S
U0-n[[R"U55eS=n=n=pC[R"[ SS9 US SSS5 [R"[ SS9 US SSS5 [R"[ SS9 US SSS5 UR#S5Vs/sHo�RPM nn/SQo�U:Ho"(do[R
"SU4SX�45[R"U5[R"U5S.-n
SSU
0-n[[R"U55eS=n=p(UR%S5Vs/sHo�RPM nnS S/o�U:Ho"(do[R
"SU4SX�45[R"U5[R"U5S.-n
SSU
0-n[[R"U55eS=n=p(g!,(df   GN�=f!,(df   GN�=f!,(df   GN�=fs snfs snf)!zTPython wraps a negative index. A wrap here is an off-by-one that reaches the answer.r�)rYr�rr�rr
r��assert %(py8)sr�N)z,%(py2)s
{%(py2)s = %(py0)s.dims
} == %(py5)sr�rPr)r[rY�x[1,2])z,%(py3)s
{%(py3)s = %(py1)s.name
} == %(py6)sr�zoutside dimensionr=)rr)r�rzdimensions and was givenr[)zx[1,0]zx[1,1]rr8r9r;r<rYzx[0,2])rrr�rrr%rr r!r"r#r$�dimsrerBrC�
IndexErrorr�r�)r&r
rIr-r�rKr�r)r+rRr.rHrXrJs              r0�:test_a_grid_index_outside_the_shape_is_refused_not_wrappedr�s���
�
�
��A�	���s�F��A��q�6��Q��Q�;�����6�������3�����3�������q�����q����6����Q���������6�6��V��V������6�������1�����1����6����V���������T�7�#�<�<�#�8�#�8�#�#�#�#�#�<�#�#�#�7�#�#�#�<�#�#�#�8�#�#�#�#�#�#�#�	���z�)<�	=�	�$��
>�	���z�)<�	=�	�%��
>�	���z�)C�	D�	�!��
E��E�E�!�H�%�H�q�F�F�H�G�%�)G�G�)G�G�G�G�G�G�%�G�G�G�%�G�G�G�)G�G�G�G�G�G�G�G��H�H�Q�K�(�K�q�F�F�K�@�(�X�x�,@�@�,@�@�@�@�@�@�(�@�@�@�(�@�@�@�,@�@�@�@�@�@�@�@�
>�	=��	=�	=��	D�	D��&��(s0�)R�R0�7S�S�S�
R-�0
R?�
Sc��[R"5nURSSS5nURUSS5 UR	5SnSo2U:HoD(do[
R"SU4SX#45[
R"U5[
R"U5S	.-nS
SU0-n[[
R"U55eS=n=pCg)N�temp)rc�(�URUSS5$)Nr4r5)r?)�prr's  r0�<lambda>�.test_a_grid_takes_any_domain.<locals>.<lambda>s��2�:�:�a��R�+@rTr[r�ztemp[1]rr8r9r;r<)
rrr�rErrr%r"r#r$rFs       r0�test_a_grid_takes_any_domainr
s���
�
�
��A�	���v�t�@�A�A��E�E�!�A�$��O��7�7�9�Y��%�2�%�2�%�%�%�%�%��%�%�%��%�%�%�2�%�%�%�%�%�%�%rTc�
�SnSo"U5nSo2U:HoD(d�[R"SU4SX#45S[R"5;d"U5(a[R
"U5OS[R
"U5[R
"U5[R
"U5S.-n[R"S5S	-S
U0-n[[R"U55eS=n=n=pCSo"U5nS
o2U:HoD(d�[R"SU4SX#45S[R"5;d"U5(a[R
"U5OS[R
"U5[R
"U5[R
"U5S.-n[R"S5S	-S
U0-n[[R"U55eS=n=n=pCSo"U5nSo2U:HoD(d�[R"SU4SX#45S[R"5;d"U5(a[R
"U5OS[R
"U5[R
"U5[R
"U5S.-n[R"S5S	-S
U0-n[[R"U55eS=n=n=pCSGH�n[R"5nURSSUS9n	URU	S5 URSS9n
U
Ro(d�[R"Xz45S-S[R"5;d"U
5(a[R
"U
5OS[R
"U5S.-n[[R"U55eSnU
SnSo,U:Ho�(d�[R"SU
4SX�45[R
"U5[R
"U5S.-n[R"Xz45S-SU0-n[[R"U55eS=n=p�GM� [R"5nURSSS SS9nURUS!5 URSS9n
U
SnS!o,U:Ho�(d�[R"SU
4SX�45[R
"U5[R
"U5S.-n[R"U
5S-SU0-n[[R"U55eS=n=p�U
R nSnUU:Ho"(d�[R"SU4S"UU45S[R"5;d"U
5(a[R
"U
5OS[R
"U5[R
"U5S#.-n[R"S$5S%-S&U0-n[[R"U55eS=n=nn["R$"[&S'S(9 [R"5RS)SS*S9 SSS5 g!,(df   g=f)+zVThe trade is the difference between a model that fits a machine and one that does not.c��[R"5nURSSUS9 URSS9R$)Nr
r��encodingrWr�)rrrrr�)�encr&s  r0r��Dtest_an_encoding_can_be_chosen_and_costs_what_it_says.<locals>.spinss6���J�J�L��	�
�
�c�1�s�
�+��w�w�Q�w��%�%�%rT�one-hotrrrr�rzone spin per valuerrN�domain-wallr6z	one fewerrhrz+log2 of the domain, and the cheapest by far)rrr
r�r�r	r�rr8r9r�r<rGr4r5r��z-%(py2)s
{%(py2)s = %(py0)s.spins
} == %(py5)sr�zeleven values in ten spinsr�rzunknown encodingr=r��rot13)rr%rr r!r"rr#r$rrrrErrr?r�rBrCrD)r�r)r+r,r-r.r/rr&r
r�r*rHrIrJrKrGr�rRs                   r0�5test_an_encoding_can_be_chosen_and_costs_what_it_saysr	s��&�
�6�5���6�q�6�q� �6�6�6�6��6�6�6�6�6�6�5�6�6�6�6�5�6�6�6��6�6�6��6�6�6�q�6�6�6�6�"6�6�6�6�6�6�6�6��1�5���1�1�1�1�$�1�1�1�1��1�1�1�1�1�1�5�1�1�1�1�5�1�1�1��1�1�1��1�1�1�1�1�1�1�1�k�1�1�1�1�1�1�1��N�5��?�N�a�N�a��N�N�N�N�?�N�N�N�N�N�N�5�N�N�N�N�5�N�N�N��N�N�N�?�N�N�N�a�N�N�N�N�!N�N�N�N�N�N�N�N�*���J�J�L��
�M�M�#�q�3�M�/��	���a����g�g�B�g����|�|�'�|�'�'�c�Z�'�'�'�'�'�'�s�'�'�'�'�s�'�'�'�|�'�'�'�'�'�'��3�x�(�1�(�1�}�(�(�(�(�x�(�(�(�x�(�(�(�1�(�(�(�(�s�j�(�(�(�(�(�(�(�
*�	�
�
��A�	�	�	�#�r�2�
�	�6�A��E�E�!�R�L�
�'�'��'�
�C��s�8��r��r�>�����8����8����r�����3���������9�9�8��8�9��?�8�8�8�8�9��8�8�8�8�8�8�3�8�8�8�8�3�8�8�8�9�8�8�8��8�8�8�8�8�8�8�8�8�8�8�8�	���z�);�	<�
�
�
�� � ��a�'� �:�
=�	<�	<�s�%[�
[c���[R"5nURSSSS9nURUS5 [R
"[SS9 UR5 SSS5 g!,(df   g=f)	zMIts indicator is a product of every bit, so its degree grows with the domain.r
�rhrrzOneHot|one-hotr=N)rrrrErBrCrDr)r&r
s  r0�5test_a_binary_encoded_variable_cannot_carry_a_literalr)sR��
�
�
��A�	�
�
�c�1�x�
�0�A��E�E�!�Q�K�	���z�)9�	:�	���	�
;�	:�	:�s�A,�,
A:c�z�[R"5nURSS5n[R"[
SS9 URSS5 SSS5 [R"[
SS9 UR
US5 SSS5 [R"[
SS9 URU/S5 SSS5 [R"[SS9 URS	5 SSS5 g!,(df   N�=f!,(df   N�=f!,(df   Nd=f!,(df   g=f)
N�colourrzalready declaredr=r}r�r[znot a bare numberr6)
rrrrBrCrDrErpr�r@r�s  r0�&test_errors_name_what_the_caller_wroter2s���
�
�
��A�	�
�
�h��"�A�	���z�);�	<�	�
�
�h��"�
=�	���z��	2�	���a���
3�	���z��	8�	�	�	�1�#�q��
9�	���y�(;�	<�	�
�
�1�
�
=�	<�

=�	<��	2�	2��	8�	8��	<�	<�s0�C9�5D
�)D�D,�9
D�

D�
D)�,
D:c��[R"5nURSS5nURUS5 UR	SSSSS9SnSo2U:HoD(do[
R"S	U4S
X#45[
R"U5[
R"U5S.-nSS
U0-n[[
R"U55eS=n=pCUR	5SnSo2U:HoD(d�[
R"S	U4S
X#45[
R"U5[
R"U5S.-n[
R"S5S-S
U0-n[[
R"U55eS=n=pC[R"[SS9 UR	SSS9 SSS5 [R"[SS9 UR	[S5SS9 SSS5 g!,(df   NJ=f!,(df   g=f)Nr�rr[g�������?g@r�r5)�beta_hot�	beta_cold�stages�sweepsrr8r9r;r<z#zeros mean the library's own ladderr�zbeta_cold must exceedr=g @)r!r"r�)rrrrErrr%r"r#r$rrBrCrDr�)r&r�rHr+rIrJrKs       r0�<test_a_bad_annealing_ladder_is_refused_rather_than_defaultedr%?sO��
�
�
��A�	�
�
�c�1��A��E�E�!�Q�K��7�7�D�C��2�7�F�s�K�P�q�P�q�P�P�P�P�P�K�P�P�P�K�P�P�P�q�P�P�P�P�P�P�P��7�7�9�S�>�E�Q�E�Q��E�E�E�E�>�E�E�E�>�E�E�E�Q�E�E�E�E� E�E�E�E�E�E�E�E�	���z�)@�	A�	������-�
B�	���z�)@�	A�	����u����5�
B�	A�
B�	A��	A�	A�s�G'�G8�'
G5�8
Hc��^�[R"5nURSS5mUR[	U4Sj[S5555 UR
5SnSo!U:Ho3(do[R"SU4SX45[R"U5[R"U5S.-nSS	U0-n[[R"U55eS
=n=p2g
)zV`sum()` starts from 0, which is the natural Python idiom and must not be a type error.r�rc3�J># �UHoTRU5-v� M g7f�Nr\)r]rXr�s  �r0r`�5test_summing_terms_in_a_loop_works.<locals>.<genexpr>Os����2��A�q�u�u�Q�x�<��s� #r6rr8r9r;r<N)rrrr@rjrgrrr%r"r#r$)r&rHr+rIrJrKr�s      @r0�"test_summing_terms_in_a_loop_worksr*Ks����
�
�
��A�	�
�
�c�1��A��J�J�s�2��q��2�2�3��7�7�9�S�>��Q��Q������>����>����Q�������rTc�D�[R"5nURSS5URSS5p!URX5 UR	5 UR5nURnSoT"U5of(d�[R"USS5S-S[R"5;d[R"U5(a[R"U5OS[R"U5[R"U5[R"U5S.-n[[R"U55eS=n=pVS	o�U;o�(d�[R"S
U	4SX�45[R"U5S[R"5;d[R"U5(a[R"U5OSS.-n
[R"USS
5S-SU
0-n[[R"U55eS=p�g)Nr
rr�zftp 1r�zN
>assert %(py6)s
{%(py6)s = %(py2)s
{%(py2)s = %(py0)s.startswith
}(%(py4)s)
}�textr�zspins 6r�)z%(py1)s in %(py3)s)r:r��Pz
>assert %(py5)sr�)rrrrr�ftp�
startswithrrrr r!r"r#r$r%)r&r
r�r,r)r+r-rKrHrIr�rRs            r0�%test_the_compiled_program_is_readabler0Ss6��
�
�
��A��=�=��a� �!�-�-��Q�"7�q��K�K����G�G�I��5�5�7�D��?�?�.�7�.�?�7�#�.�#�.�.�T�#�2�Y�.�.�.�.�.�.�4�.�.�.�.�4�.�.�.�?�.�.�.�7�.�.�.�#�.�.�.�.�.�.��'���'�'�'�'�9�'�'�'�9�'�'�'�'�'�'��'�'�'�'��'�'�'�'�d�3�B�i�'�'�'�'�'�'rTc
�t�SnU"SS9nURo"(d�[R"U5S-S[R"5;d[R
"U5(a[R"U5OS[R"U5S.-n[[R"U55eSn/o!Rn[U5nSoeU:Howo�(a!URSo�Ro�(+o�nU(Gd�[R"S	U4S
XV45S[R"5;d[R
"[5(a[R"[5OSS[R"5;d[R
"U5(a[R"U5OS[R"U5[R"U5[R"U5S.-nS
SU0-o�RU
5 U(a@S[R"W	5[R"W
5S.-o�RU5 [R"US50-n[R"U5S-SU0-n[[R"U55eS=n=n=n=n=n=n=n	=p�URnSoBU:HnU(d�[R"S	U4SX$45S[R"5;d[R
"U5(a[R"U5OS[R"U5[R"U5S.-n[R"U5S-SU0-n[[R"U55eS=n=nnSn[!U5nUU;nU(Gd.[R"SU4SUU45[R"U5S[R"5;d[R
"[ 5(a[R"[ 5OSS[R"5;d[R
"U5(a[R"U5OS[R"U5S.-n[R"[!U55S-SU0-n[[R"U55eS=n=nnU"SS9nURn/oBU:HnU(d�[R"S	U4SX$45S [R"5;d[R
"U5(a[R"U5OS [R"U5[R"U5S.-n[R"U5S-SU0-n[[R"U55eS=n=nnURnS!oBU:HnU(d�[R"S	U4SX$45S [R"5;d[R
"U5(a[R"U5OS [R"U5[R"U5S.-nS"SU0-n[[R"U55eS=n=nn["R$nSnURoR"UU5nSnUU:nU(+nU(Gdw[R"S#U4S$UU45S%[R"5;d[R
"["5(a[R"["5OS%[R"U5[R"U5S [R"5;d[R
"U5(a[R"U5OS [R"U5[R"U5[R"U5S&.-n
[R"['UR55S'-S(U
0-n[[R"U55eS=n=n=n=n=n=nnU"5n/nURnUnU(aURn/nUU:HofnU(Gd�S)S*[R"5;d[R
"U5(a[R"U5OS*[R"U5S+.-nURU5 U(a�[R"S	U4S,WU45S*[R"5;d[R
"U5(a[R"U5OS*[R"U5[R"U5S-.-n S.S/U 0-n!URU!5 [R"US50-n"[R"U5S0-S1U"0-n#[[R"U#55eS=n=n=n=n=nnURnS!oBU:HnU(d�[R"S	U4SX$45S*[R"5;d[R
"U5(a[R"U5OS*[R"U5[R"U5S.-nS"SU0-n[[R"U55eS=n=nng)2Nc�&�[R"5nURSS5URSS5p2UR"X#40UD6 UR	SURS5-SURS5--5 UR
SS9$)Nr
rYr�r6r�r�)rrrrr@rAr)�kwr&r
r�s    r0�build�<test_a_preference_is_traded_and_a_rule_is_not.<locals>.buildbsu���J�J�L���}�}�S�!�$�a�m�m�C��&;�1�	���A��B��	�
�
�1�q�u�u�Q�x�<�!�a�e�e�A�h�,�.�/��w�w�R�w� � rTr���softr	�cheaprr[rr)zO%(py7)s
{%(py7)s = %(py2)s(%(py5)s
{%(py5)s = %(py3)s.violated
})
} == %(py10)sr)r
r�r�rrqz%(py12)srsz(not %(py17)s
{%(py17)s = %(py15)s.hard
})�py15r�z
>assert %(py21)s�py21�z1%(py2)s
{%(py2)s = %(py0)s.soft_cost
} == %(py5)sr�r�r�tradedr��z0%(py1)s in %(py6)s
{%(py6)s = %(py3)s(%(py4)s)
}�str�r:r�rr<r�r�gI@)z0%(py2)s
{%(py2)s = %(py0)s.violated
} == %(py5)s�dearr�rP)�<)zv%(py9)s
{%(py9)s = %(py2)s
{%(py2)s = %(py0)s.copysign
}(%(py4)s, %(py7)s
{%(py7)s = %(py5)s.soft_cost
})
} < %(py12)s�math)rr
rr�rrrsz
>assert not %(py14)s�py14z%%(py4)s
{%(py4)s = %(py2)s.feasible
}�rule)r
r)z1%(py8)s
{%(py8)s = %(py6)s.violated
} == %(py11)s)r<r�r�z%(py13)sr�z
>assert %(py16)s�py16)rrrrr r!r"r#r$r�r�hardr%�append�_format_boolop�	soft_costr?rC�copysign�repr)$r5r9r)r*r�r,rwrxrHr�r��@py_assert18ryrz�@py_format19r��@py_format22r+rRr.r-rIrKr�rA�@py_assert11r�r��@py_format16rEr�rJr��@py_format14�@py_format15�@py_format17s$                                    r0�-test_a_preference_is_traded_and_a_rule_is_notrU]s���
!�
�s�O�E��>�>� �>� � �5� � � � � � �5� � � � �5� � � �>� � � � � � �I�~�~�I�3�~��I�!�I�!�#�I�E�N�N�1�,=�I�,B�,B�I�(B�I�I�I�I��I�I�I�I�I�I�3�I�I�I�I�3�I�I�I�I�I�I�u�I�I�I�I�u�I�I�I�~�I�I�I��I�I�I�!�I�I�I�I�I�I�I�,=�I�I�I�,B�I�I�I�I�I�I�I�I�I�E�I�I�I�I�I�I�I�I��?�?�(�c�(�c�!�(�(�(�(�?�(�(�(�(�(�(�5�(�(�(�(�5�(�(�(�?�(�(�(�c�(�(�(�(�5�(�(�(�(�(�(�(��-�s�5�z�-�8�z�!�-�-�-�-�8�z�-�-�-�8�-�-�-�-�-�-�s�-�-�-�-�s�-�-�-�-�-�-�5�-�-�-�-�5�-�-�-�z�-�-�-�-�3�u�:�-�-�-�-�-�-�-��d��D��=�=�$�B�$�B��$�$�$�$�=�$�$�$�$�$�$�4�$�$�$�$�4�$�$�$�=�$�$�$�B�$�$�$�$��$�$�$�$�$�$�$��>�>� �S� �S� � � � � �>� � � � � � �4� � � � �4� � � �>� � � �S� � � � � � � ��}�}�K�S�K�$�.�.�K�}�S�.�1�K�A�K�1�A�5�K�5�K�5�K�K�K�1�A�K�K�K�K�K�K�t�K�K�K�K�t�K�K�K�}�K�K�K�S�K�K�K�K�K�K�$�K�K�K�K�$�K�K�K�.�K�K�K�1�K�K�K�A�K�K�K�K�t�D�N�N�7K�K�K�K�K�K�K�K�K��7�D�6�4�=�=�6�=�6�=�T�]�]�6�b�6�]�b�0�6�6�6�6�6�6�6�4�6�6�6�6�4�6�6�6�=�6�6�6�6�=�6�6�6�]�b�6�6�6�6�6�6�T�6�6�6�6�T�6�6�6�]�6�6�6�b�6�6�6�6�6�6�6�6�6�6�$�6�6�6�6�6�6�6��>�>� �S� �S� � � � � �>� � � � � � �4� � � � �4� � � �>� � � �S� � � � � � � rTc�N�[R"5n[S5Vs/sHoRSU35PM nnUR	USSS9 UR[
SU555 URSS9nURoD(d�[R"U5S	-S
[R"5;d[R"U5(a[R"U5OS
[R"U5S.-n[[R "U55eSnUR"nSodU:How(d�[R$"S
U4SXF45S
[R"5;d[R"U5(a[R"U5OS
[R"U5[R"U5S.-n[R"U5S-SU0-n	[[R "U	55eS=n=pvgs snf)NrWrXr[r�r7c3�J# �UHnSURS5-v� M g7f)r5r[Nr\)r]rXs  r0r`�Ftest_a_soft_price_is_squared_because_the_penalty_is.<locals>.<genexpr>s���-�"�Q�2����a��=�"�s�!#r3r�r	r
rg"@rr<r�r�r)rrrgrhrpr@rjrrrrrr r!r"r#r$rJr%)
r&r^rmr
r)r*r�r+rRr.s
          r0�3test_a_soft_price_is_squared_because_the_penalty_isrY{sB��
�
�
��A�%*�1�X�	.�X��(�(�Q�q�c�7�
�X�B�	.��I�I�b�!�#�I���J�J�s�-�"�-�-�.�	���b���A��:�:��:���q�������1�����1����:�������
�;�;� �#� �#�� � � � �;� � � � � � �1� � � � �1� � � �;� � � �#� � � � �q� � � � � � � ��
/s�H"c�D�[R"S5n[S5HnURXS-S-S5 M UR	SSS9n/SQUlURnSoD*oSU:Hof(d�[R"SU4S	X545S
[R"5;d[R"U5(a[R"U5OS
[R"U5[R"U5S.-nSS
U0-n[[R"U55eS=n=n=pE[R "["SS9 /SQUlSSS5 [R "["SS9 /SQUlSSS5 URnSoD*oSU:Hof(d�[R"SU4S	X545S
[R"5;d[R"U5(a[R"U5OS
[R"U5[R"U5S.-n[R$"S5S-S
U0-n[[R"U55eS=n=n=pEg!,(df   GN-=f!,(df   GN=f)NrWr[r���r��seed)r[r[r[r[g@r)z/%(py2)s
{%(py2)s = %(py0)s.energy
} == -%(py5)s�simr�rr�z4 nodesr=)r[r[r[z-1/\+1)r[rr[r[z#a refused write must not half-applyr�)r�Modelrg�coupler5r��energyrr%rr r!r"r#r$rBrCrDr)	�mr^r^r)r�r,r+rKr�s	         r0�Etest_a_state_computed_elsewhere_is_scored_by_the_same_code_or_refusedrc�s���	�����A�
�1�X��	�����U�a�K��%��
�'�'�s��'�
#�C��C�I��:�:��#����������:�������3�����3����:����#��������
���z��	3���	�
4�	���z��	3� ��	�
4��:�:�D�#�D��D���D�D�D�D�:�D�D�D�D�D�D�3�D�D�D�D�3�D�D�D�:�D�D�D�#�D�D�D�D�D�D�D�D�D�D�D�D�	
4�	3��	3�	3�s�
I>�9
J�>
J
�
Jc�^	�[R"5m	U	4SjS5upnT	RSURS5-URS5-URS5-5 T	R	SS9nUR
nSoTU:Hof(d�[R"SU4SXE45S	[R"5;d[R"U5(a[R"U5OS	[R"U5[R"U5S
.-n[R"U5S-SU0-n[[R"U55eS=n=peURnS
oTU:Hof(d�[R"SU4SXE45S	[R"5;d[R"U5(a[R"U5OS	[R"U5[R"U5S
.-n[R"U5S-SU0-n[[R"U55eS=n=peg)Nc3�F># �UHnTRU5v� M g7fr()rh)r]r'r&s  �r0r`�ctest_the_ancilla_count_is_readable_because_sampling_a_reduced_model_is_not_sound.<locals>.<genexpr>�s����*�E�q�q�x�x��{�{�E�s�!�abcrr[rr�r)z0%(py2)s
{%(py2)s = %(py0)s.ancillas
} == %(py5)sr�r�r�rr[r)rrr@rAr�ancillasrr%rr r!r"rr#r$r�)
r
r�r�r�r)r�r+rRr.r&s
         @r0�Ptest_the_ancilla_count_is_readable_because_sampling_a_reduced_model_is_not_soundri�s[���
�
�
��A�*�E�*�G�A�!��J�J�q�1�5�5��8�|�a�e�e�A�h�&����q��1�2�
�'�'��'�
�C��<�<�!�1�!�1��!�!�!�!�<�!�!�!�!�!�!�3�!�!�!�!�3�!�!�!�<�!�!�!�1�!�!�!�!�c�!�!�!�!�!�!�!��9�9�����>�����9�������3�����3����9���������3�������rTc	���[R"S5n[S5HnURXS-S5 M UR	SSS9nUR5n/nSoSULofov(a[
U5n[U5n	So�U
:Ho�nU(Gd\[R"SU4SX545S[R"5;d[R"U5(a[R"U5OS[R"U5S	.-nS
SU0-o�RU
5 U(Gag[R"SW4S
W	W
45S[R"5;d[R"[5(a[R"[5OSS[R"5;d[R"[5(a[R"[5OSS[R"5;d[R"U5(a[R"U5OS[R"W5[R"U	5[R"U
5S.-nSSU0-o�RU5 [R"US50-n[R "U5S-SU0-n[#[R$"U55eS=n=n=n=n=n=n	=p�UR&oD"5nSnU*nUU:HnU(d�[R"SU4SUU45S[R"5;d[R"U5(a[R"U5OS[R"U5[R"U5[R"U5S.-nSSU0-n[#[R$"U55eS=n=n=n=nng)Nrr6r[r�r\r�)z%(py2)s is not %(py5)s�state)r
r�z%(py7)srr)zU%(py15)s
{%(py15)s = %(py9)s(%(py13)s
{%(py13)s = %(py10)s(%(py11)s)
})
} == %(py18)srr�)rrqr�r�r:�py18z%(py20)s�py20rz
>assert %(py23)s�py23g@)zS%(py4)s
{%(py4)s = %(py2)s
{%(py2)s = %(py0)s.exact_ground_energy
}()
} == -%(py7)sr^rzassert %(py10)srq)rr_rgr`r5�exact_ground_stater�rrr%rr r!r"rHrIrr#r$�exact_ground_energy)rbr^r^rkr)r�r+rH�@py_assert12r��@py_assert17r�rRr.rN�@py_format21rO�@py_format24r,rxr-r�rys                       r0�;test_the_exact_ground_state_is_readable_not_only_its_energyru�s(��
�����A�
�1�X��	�����E�3���
�'�'�s��'�
#�C��"�"�$�E�<��<���<�S��Z�<��Z��<�A�<�A�!5�<�<�<�<�5�<�<�<�<�<�<�5�<�<�<�<�5�<�<�<��<�<�<�<�<�<�<�<��A�<�<�<�<�<�<��<�<�<�<��<�<�<�<�<�<�S�<�<�<�<�S�<�<�<�<�<�<��<�<�<�<��<�<�<�Z�<�<�<��<�<�<�A�<�<�<�<�<�<�<�<�<�<�u�<�<�<�<�<�<�<�<��"�"�,�"�$�,��,���,�$��,�,�,�,�,�$��,�,�,�,�,�,�3�,�,�,�,�3�,�,�,�"�,�,�,�$�,�,�,��,�,�,�,�,�,�,�,rTc�z^
�[R"5n[S5Vs/sHoRSU3S5PM nnUR	U5 URSS9m
T
Ro3(d�[R"T
5S-S[R"5;d[R"T
5(a[R"T
5OS[R"U5S.-n[[R"U55eSnU
4Sj[S55n[U5n/S	QoeU:How(d�[R "S
U4SXV45S[R"5;d[R"[5(a[R"[5OS[R"U5[R"U5[R"U5S
.-n[R"T
5S-SU0-n	[[R"U	55eS=n=n=pvgs snf)NrWr��<r�r	r
rc3�4># �UH
nTSU3v� M g7f)r�N�)r]r^r
s  �r0r`�Stest_all_different_solves_a_latin_square_row_and_names_the_clash.<locals>.<genexpr>�s����/�h��!�a��s�G�*�h�s�)rr[rYrrr�sortedrrr)rrrgr�
all_differentrrrrrr r!r"r#r$r{r%)r&r^rXr)r*r+r,r-r.r/r
s          @r0�@test_all_different_solves_a_latin_square_row_and_names_the_clashr}�sD���
�
�
��A�,1�!�H�5�H�q����1�#�w��	"�H�A�5��O�O�A��	���b���A��:�:��:���q�������1�����1����:�������/�e�A�h�/�B�6�/�/�B�<�B�<�?�B�B�B�B�/�B�B�B�B�B�B�6�B�B�B�B�6�B�B�B�/�B�B�B�/�B�B�B�<�B�B�B�B��B�B�B�B�B�B�B��		6s�H8c�8�[R"5n[S5Vs/sHoRSU3S5PM nnUR	U5 [
R"[SS9 URSS9 SSS5 gs snf!,(df   g=f)Nr6r�rzNo assignment can satisfyr=rr�)	rrrgrr|rBrCrDr)r&r^�xss   r0�@test_an_impossible_all_different_is_refused_rather_than_annealedr��st��	�
�
��A�-2�1�X�	6�X��-�-�!�A�3���
#�X�B�	6��O�O�B��	���z�)D�	E�	���a���
F�	E��
7�	E�	E�s�B�-B�
Bc
���[R"5oRSSS5oRSSS5nURX/5 [R"5o3RSSS5 URSSS5 URnSoT"US9ofR
osRnSo�"U	S9o�R
o�U:Ho�(Gd�[R"S	U4S
X{45S[R"5;d[R"U5(a[R"U5OS[R"U5[R"U5[R"U5[R"U5S[R"5;d[R"U5(a[R"U5OS[R"U5[R"U	5[R"U
5[R"U5S.
-n
SS
U
0-n[[R"U55eS=n=n=n=n=n=n=n	=p�g)Nr
rrr�r4r7rWr�r)z�%(py8)s
{%(py8)s = %(py6)s
{%(py6)s = %(py2)s
{%(py2)s = %(py0)s.solve
}(tries=%(py4)s)
}.spins
} == %(py18)s
{%(py18)s = %(py16)s
{%(py16)s = %(py12)s
{%(py12)s = %(py10)s.solve
}(tries=%(py14)s)
}.spins
})
rr
rr<r�rqrsrDrFrlzassert %(py20)srm)rrr?r|rr�rr%rr r!r"r#r$)r
r�r�r�r)r+r-r�rP�@py_assert13r�rrrwrNrss               r0�0test_all_different_over_disjoint_domains_is_freer��ss��	�
�
��A�)�)�C��A�.�a�I�I�c�2�r�4J���O�O�Q�F��
�
�
��A�i�i��Q��*�A�I�I�c�2�r�,B��7�7�;��;�7���;�!�!�;�W�W�;�1�;�W�1�%5�;�%;�%;�;�%;�;�;�;�;�;�!�;�;�;�;�;�;�1�;�;�;�;�1�;�;�;�7�;�;�;��;�;�;��;�;�;�!�;�;�;�;�;�;�Q�;�;�;�;�Q�;�;�;�W�;�;�;�1�;�;�;�%5�;�;�;�%;�;�;�;�;�;�;�;�;�;rTc�	�[R"5nURSSSS9 URSSSS9 URSS5 URSS	9nURn[U5nS
oCU:HoU(GdC[R"SU4SX445S
[R"5;d[R"[
5(a[R"[
5OS
S[R"5;d[R"U5(a[R"U5OS[R"U5[R"U5[R"U5S.-n[R"UR5S-SU0-n[[R"U55eS=n=n=pTSo�RSo�U	;o"(do[R"SU4SX�45[R"U5[R"U	5S.-n
SSU
0-n[[R"U55eS=n=p)/nSo!RSo�U
;o3o�(dSo�RSo�U;nUnU(Gd	[R"SU4SX-45[R"U5[R"U
5S.-nSSU0-olRU5 U(db[R"SW4SWW45[R"U5[R"U5S .-nS!S"U0-nURU5 [R "US
50-nS#S$U0-n[[R"U55eS=n=n=n=n=n
=n=nnS%n[#U5o�U
;o"(Gd
[R"SU4S&X�45[R"U5S'[R"5;d[R"["5(a[R"["5OS'S[R"5;d[R"U5(a[R"U5OS[R"U
5S(.-nS)SU0-n[[R"U55eS=n=p-g)*Nr�rrhrr�r�zrWr�r[r)zM%(py5)s
{%(py5)s = %(py0)s(%(py3)s
{%(py3)s = %(py1)s.caveats
})
} == %(py8)srr
r�r�rqz'x'rr�)z%(py1)s in %(py4)sr9r;r<rzpower of two)z%(py3)s in %(py6)s)r�r<z%(py8)sr�)z%(py11)s in %(py14)s)r�rDz%(py16)srFzassert %(py19)sr�zcaveat:r>r?r@r)rrrr�caveatsrrr%rr r!r"rr#r$rHrIr?)r&r
rIr�r�r,r�ryrHr+rJrKr)r-r�r�rqrSrTr�r�s                     r0�<test_an_encoding_that_cannot_be_exact_is_reported_not_hiddenr��s���	�
�
��A��M�M�#�q�8�M�,��M�M�#�q�8�M�,��M�M�#�q��	���a���A��y�y�)�3�y�>�)�Q�)�Q��)�)�)�)�>�)�)�)�)�)�)�3�)�)�)�)�3�)�)�)�)�)�)�q�)�)�)�)�q�)�)�)�y�)�)�)�>�)�)�)�Q�)�)�)�)��	�	�)�)�)�)�)�)�)�� �I�I�a�L� �L� � � � � �5� � � �5� � � �L� � � � � � � �F�9�F�	�	�!��F��$�F��F�)�)�A�,�F�,�(F�F�F�F�F�9�F�F�F�9�F�F�F��F�F�F�F�F�F�F�F��,�F�F�F��F�F�F�,�F�F�F�F�F�F�F�F�F�F�F�F�F�F�F����A���������9����9�������������������A�����A�����������rTc	���[R"5nURSS5 URSSS5 URnSo!"US9o3R
n/oTU:Hof(d�[R"SU4S	XE45S
[R"5;d[R"U5(a[R"U5OS
[R"U5[R"U5[R"U5[R"U5[R"U5S.-nSS
U0-n[[R"U55eS=n=n=n=n=peg)Nr
r6r�rr[rWr�r)zo%(py8)s
{%(py8)s = %(py6)s
{%(py6)s = %(py2)s
{%(py2)s = %(py0)s.solve
}(tries=%(py4)s)
}.caveats
} == %(py11)sr&)rr
rr<r�r�zassert %(py13)sr�)rrrr?rr�rr%rr r!r"r#r$)	r&r)r+r-r�r�rwr�rRs	         r0�&test_an_exact_model_carries_no_caveatsr��s���
�
�
��A��M�M�#�q���I�I�c�1�a���7�7�)��)�7���)�#�#�)�r�)�r�)�)�)�)�)�#�)�)�)�)�)�)�1�)�)�)�)�1�)�)�)�7�)�)�)��)�)�)��)�)�)�#�)�)�)�r�)�)�)�)�)�)�)�)rT)5�__doc__�builtinsr�_pytest.assertion.rewrite�	assertion�rewriterrC�sys�pathlibrrB�path�insertr?�__file__�resolve�parent�
ferrothermrr1rLrSr{r�r�r�r�r�r�r�r�r�r�r�rr
rrrr%r*r0rUrYrcrirur}r�r�r�r�ryrTr0�<module>r�s���	����
��
�������3�t�H�~�-�-�/�6�6�7�8��<�
�%�S�,3�
D�h�*�	W�/�	N�M�(�*X�(�(A�(&�;�@�
�	6��(�!�<
!�E�,�-�C��<��*rT