Metrics for Diagrams.TwoD.Segment:bezierClip from diagrams-lib-1.3.0.3

analyze13.0ms (0.5%)

Memory

4.1MiB live, 4.1MiB allocated

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
100%	99.9%	0%	0.1%	0%	0%	0%	1

Compiler

Compiled 24 to 19 computations (20.8% saved)

sample2.2s (89.9%)

Memory

-2.8MiB live, 663.3MiB allocated

Samples

485.0ms	8 256×	valid-sollya
395.0ms	8 256×	valid-baseline
356.0ms	8 256×	valid-rival

Bogosity

preprocess202.0ms (8.4%)

Memory

7.3MiB live, 22.7MiB allocated

Algorithm

1×	egg-herbie

Rules

1 182×	`fmm-def`
299×	`fma-define`
196×	`distribute-rgt-in`
171×	`unsub-neg`
132×	`sub-neg`

Iterations

Useful iterations: 9 (0.0ms)

Iter	Nodes	Cost
0	40	399
1	100	387
2	237	379
3	683	351
4	1702	339
5	2858	337
6	3224	337
7	3264	337
8	3268	337
9	3268	317
10	3911	317
11	3911	317

Stop Event

1×

saturated

Calls

Call 1

Inputs
(+.f64 (.f64 x y) (.f64 z (-.f64 #s(literal 1 binary64) y)))
(+.f64 (.f64 x y) (.f64 z (-.f64 #s(literal 1 binary64) y)))
(+.f64 (.f64 (neg.f64 x) y) (.f64 z (-.f64 #s(literal 1 binary64) y)))
(+.f64 (.f64 x (neg.f64 y)) (.f64 z (-.f64 #s(literal 1 binary64) (neg.f64 y))))
(+.f64 (.f64 x y) (.f64 (neg.f64 z) (-.f64 #s(literal 1 binary64) y)))
(neg.f64 (+.f64 (.f64 (neg.f64 x) y) (.f64 z (-.f64 #s(literal 1 binary64) y))))
(neg.f64 (+.f64 (.f64 x (neg.f64 y)) (.f64 z (-.f64 #s(literal 1 binary64) (neg.f64 y)))))
(neg.f64 (+.f64 (.f64 x y) (.f64 (neg.f64 z) (-.f64 #s(literal 1 binary64) y))))
(+.f64 (.f64 y x) (.f64 z (-.f64 #s(literal 1 binary64) x)))
(+.f64 (.f64 z y) (.f64 x (-.f64 #s(literal 1 binary64) y)))
(+.f64 (.f64 x z) (.f64 y (-.f64 #s(literal 1 binary64) z)))

Outputs
(+.f64 (.f64 x y) (.f64 z (-.f64 #s(literal 1 binary64) y)))
(fma.f64 x y (*.f64 z (-.f64 #s(literal 1 binary64) y)))
(fma.f64 z (-.f64 #s(literal 1 binary64) y) (*.f64 x y))
(-.f64 z (*.f64 y (-.f64 z x)))
(+.f64 z (*.f64 y (-.f64 x z)))
(fma.f64 y (-.f64 x z) z)
(+.f64 (.f64 x y) (.f64 z (-.f64 #s(literal 1 binary64) y)))
(fma.f64 x y (*.f64 z (-.f64 #s(literal 1 binary64) y)))
(fma.f64 z (-.f64 #s(literal 1 binary64) y) (*.f64 x y))
(-.f64 z (*.f64 y (-.f64 z x)))
(+.f64 z (*.f64 y (-.f64 x z)))
(fma.f64 y (-.f64 x z) z)
(+.f64 (.f64 (neg.f64 x) y) (.f64 z (-.f64 #s(literal 1 binary64) y)))
(fma.f64 (neg.f64 x) y (*.f64 z (-.f64 #s(literal 1 binary64) y)))
(-.f64 (.f64 z (-.f64 #s(literal 1 binary64) y)) (.f64 x y))
(neg.f64 (fma.f64 z (+.f64 y #s(literal -1 binary64)) (*.f64 x y)))
(-.f64 z (*.f64 y (+.f64 z x)))
(-.f64 z (*.f64 y (+.f64 x z)))
(+.f64 (.f64 x (neg.f64 y)) (.f64 z (-.f64 #s(literal 1 binary64) (neg.f64 y))))
(fma.f64 x (neg.f64 y) (*.f64 z (-.f64 #s(literal 1 binary64) (neg.f64 y))))
(-.f64 (.f64 z (+.f64 y #s(literal 1 binary64))) (.f64 x y))
(+.f64 z (*.f64 y (-.f64 z x)))
(fma.f64 y (-.f64 z x) z)
(+.f64 (.f64 x y) (.f64 (neg.f64 z) (-.f64 #s(literal 1 binary64) y)))
(fma.f64 x y (*.f64 (-.f64 #s(literal 1 binary64) y) (neg.f64 z)))
(-.f64 (.f64 x y) (.f64 z (-.f64 #s(literal 1 binary64) y)))
(fma.f64 z (+.f64 y #s(literal -1 binary64)) (*.f64 x y))
(fma.f64 z #s(literal -1 binary64) (*.f64 y (+.f64 z x)))
(-.f64 (*.f64 y (+.f64 x z)) z)
(neg.f64 (+.f64 (.f64 (neg.f64 x) y) (.f64 z (-.f64 #s(literal 1 binary64) y))))
(fma.f64 x y (*.f64 (-.f64 #s(literal 1 binary64) y) (neg.f64 z)))
(-.f64 (.f64 x y) (.f64 z (-.f64 #s(literal 1 binary64) y)))
(fma.f64 z (+.f64 y #s(literal -1 binary64)) (*.f64 x y))
(fma.f64 z #s(literal -1 binary64) (*.f64 y (+.f64 z x)))
(-.f64 (*.f64 y (+.f64 x z)) z)
(neg.f64 (+.f64 (.f64 x (neg.f64 y)) (.f64 z (-.f64 #s(literal 1 binary64) (neg.f64 y)))))
(neg.f64 (fma.f64 x (neg.f64 y) (*.f64 z (-.f64 #s(literal 1 binary64) (neg.f64 y)))))
(-.f64 (.f64 x y) (.f64 z (+.f64 y #s(literal 1 binary64))))
(fma.f64 z (-.f64 #s(literal -1 binary64) y) (*.f64 x y))
(neg.f64 (fma.f64 y (-.f64 z x) z))
(neg.f64 (+.f64 (.f64 x y) (.f64 (neg.f64 z) (-.f64 #s(literal 1 binary64) y))))
(fma.f64 (neg.f64 x) y (*.f64 z (-.f64 #s(literal 1 binary64) y)))
(-.f64 (.f64 z (-.f64 #s(literal 1 binary64) y)) (.f64 x y))
(neg.f64 (fma.f64 z (+.f64 y #s(literal -1 binary64)) (*.f64 x y)))
(-.f64 z (*.f64 y (+.f64 z x)))
(-.f64 z (*.f64 y (+.f64 x z)))
(+.f64 (.f64 y x) (.f64 z (-.f64 #s(literal 1 binary64) x)))
(fma.f64 y x (*.f64 z (-.f64 #s(literal 1 binary64) x)))
(fma.f64 x y (*.f64 z (-.f64 #s(literal 1 binary64) x)))
(-.f64 z (*.f64 x (-.f64 z y)))
(+.f64 z (*.f64 x (-.f64 y z)))
(fma.f64 x (-.f64 y z) z)
(+.f64 (.f64 z y) (.f64 x (-.f64 #s(literal 1 binary64) y)))
(fma.f64 z y (*.f64 x (-.f64 #s(literal 1 binary64) y)))
(fma.f64 x (-.f64 #s(literal 1 binary64) y) (*.f64 y z))
(+.f64 x (*.f64 y (-.f64 z x)))
(fma.f64 y (-.f64 z x) x)
(+.f64 (.f64 x z) (.f64 y (-.f64 #s(literal 1 binary64) z)))
(fma.f64 x z (*.f64 y (-.f64 #s(literal 1 binary64) z)))
(+.f64 y (*.f64 z (-.f64 x y)))
(fma.f64 z (-.f64 x y) y)

Compiler

Compiled 12 to 8 computations (33.3% saved)

eval0.0ms (0%)

Memory: 0.2MiB live, 0.2MiB allocated
Compiler: Compiled 3 to 3 computations (0% saved)

prune1.0ms (0%)

Memory

0.9MiB live, 0.9MiB allocated

Alt Table

Click to see full alt table

Status	Accuracy	Program
	98.4%	(+.f64 (.f64 x y) (.f64 z (-.f64 #s(literal 1 binary64) y)))

Compiler

Compiled 24 to 16 computations (33.3% saved)

simplify2.0ms (0.1%)

Memory

0.4MiB live, 0.4MiB allocated

Algorithm

1×	egg-herbie

Rules

3×	`1-exp`
3×	`*-commutative`
3×	`+-commutative`
2×	`sub-neg`
1×	`neg-sub0`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	37
1	25	37
2	29	37
3	31	37
4	32	37

Stop Event

1×

saturated

Calls

Call 1

Inputs
(+.f64 (.f64 x y) (.f64 z (-.f64 #s(literal 1 binary64) y)))

Outputs
(+.f64 (.f64 x y) (.f64 z (-.f64 #s(literal 1 binary64) y)))

soundness0.0ms (0%)

Memory

0.4MiB live, 0.4MiB allocated

Stop Event

1×

fuel

Compiler

Compiled 12 to 8 computations (33.3% saved)

preprocess25.0ms (1.1%)

Memory: -3.9MiB live, 31.4MiB allocated
Compiler: Compiled 68 to 44 computations (35.3% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

analyze13.0ms (0.5%)

sample2.2s (89.9%)

preprocess202.0ms (8.4%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify2.0ms (0.1%)

soundness0.0ms (0%)

preprocess25.0ms (1.1%)

end0.0ms (0%)

Profiling