Metrics for Diagrams.Tangent:$catParam from diagrams-lib-1.3.0.3, E

analyze13.0ms (0.6%)

Memory

4.2MiB live, 4.2MiB allocated

Algorithm

1×

Search

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

Compiler

Compiled 22 to 17 computations (22.7% saved)

sample1.9s (92.9%)

Memory

-11.2MiB live, 600.3MiB allocated

Samples

342.0ms	7 588×	0	valid-sollya
311.0ms	7 588×	0	valid-baseline
291.0ms	7 588×	0	valid-rival
57.0ms	302×	2	valid-baseline
47.0ms	366×	1	valid-baseline
31.0ms	302×	2	valid-rival
27.0ms	366×	1	valid-rival
16.0ms	366×	1	valid-sollya
14.0ms	302×	2	valid-sollya

Bogosity

preprocess106.0ms (5.1%)

Memory

1.9MiB live, 19.4MiB allocated

Algorithm

1×	egg-herbie

Rules

859×	`fma-define`
186×	`distribute-lft-in`
160×	`distribute-rgt-in`
158×	`fmm-def`
153×	`associate-r`

Iterations

Useful iterations: 3 (0.0ms)

Iter	Nodes	Cost
0	18	136
1	48	124
2	122	100
3	431	84
4	1390	84
5	2587	84
6	2865	84
7	2878	84
8	2879	84
9	2879	84

Stop Event

1×

saturated

Calls

Call 1

Inputs
(.f64 (.f64 #s(literal 3 binary64) (-.f64 #s(literal 2 binary64) (*.f64 x #s(literal 3 binary64)))) x)
(.f64 (.f64 #s(literal 3 binary64) (-.f64 #s(literal 2 binary64) (*.f64 x #s(literal 3 binary64)))) x)
(.f64 (.f64 #s(literal 3 binary64) (-.f64 #s(literal 2 binary64) (*.f64 (neg.f64 x) #s(literal 3 binary64)))) (neg.f64 x))
(neg.f64 (.f64 (.f64 #s(literal 3 binary64) (-.f64 #s(literal 2 binary64) (*.f64 (neg.f64 x) #s(literal 3 binary64)))) (neg.f64 x)))

Outputs
(.f64 (.f64 #s(literal 3 binary64) (-.f64 #s(literal 2 binary64) (*.f64 x #s(literal 3 binary64)))) x)
(.f64 #s(literal 3 binary64) (.f64 (-.f64 #s(literal 2 binary64) (*.f64 #s(literal 3 binary64) x)) x))
(.f64 #s(literal 3 binary64) (.f64 x (+.f64 #s(literal 2 binary64) (*.f64 x #s(literal -3 binary64)))))
(.f64 x (+.f64 #s(literal 6 binary64) (.f64 x #s(literal -9 binary64))))
(*.f64 x (fma.f64 x #s(literal -9 binary64) #s(literal 6 binary64)))
(.f64 (.f64 #s(literal 3 binary64) (-.f64 #s(literal 2 binary64) (*.f64 x #s(literal 3 binary64)))) x)
(.f64 #s(literal 3 binary64) (.f64 (-.f64 #s(literal 2 binary64) (*.f64 #s(literal 3 binary64) x)) x))
(.f64 #s(literal 3 binary64) (.f64 x (+.f64 #s(literal 2 binary64) (*.f64 x #s(literal -3 binary64)))))
(.f64 x (+.f64 #s(literal 6 binary64) (.f64 x #s(literal -9 binary64))))
(*.f64 x (fma.f64 x #s(literal -9 binary64) #s(literal 6 binary64)))
(.f64 (.f64 #s(literal 3 binary64) (-.f64 #s(literal 2 binary64) (*.f64 (neg.f64 x) #s(literal 3 binary64)))) (neg.f64 x))
(.f64 (neg.f64 x) (.f64 #s(literal 3 binary64) (+.f64 #s(literal 2 binary64) (*.f64 #s(literal 3 binary64) x))))
(.f64 (.f64 x #s(literal -3 binary64)) (+.f64 #s(literal 2 binary64) (*.f64 #s(literal 3 binary64) x)))
(.f64 x (+.f64 (.f64 x #s(literal -9 binary64)) #s(literal -6 binary64)))
(*.f64 x (fma.f64 x #s(literal -9 binary64) #s(literal -6 binary64)))
(neg.f64 (.f64 (.f64 #s(literal 3 binary64) (-.f64 #s(literal 2 binary64) (*.f64 (neg.f64 x) #s(literal 3 binary64)))) (neg.f64 x)))
(neg.f64 (.f64 (neg.f64 x) (.f64 #s(literal 3 binary64) (+.f64 #s(literal 2 binary64) (*.f64 #s(literal 3 binary64) x)))))
(.f64 (+.f64 #s(literal 2 binary64) (.f64 #s(literal 3 binary64) x)) (*.f64 #s(literal 3 binary64) x))
(.f64 x (+.f64 #s(literal 6 binary64) (.f64 x #s(literal 9 binary64))))
(*.f64 x (fma.f64 x #s(literal 9 binary64) #s(literal 6 binary64)))

Compiler

Compiled 10 to 7 computations (30% saved)

eval0.0ms (0%)

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

prune1.0ms (0%)

Memory

0.9MiB live, 0.9MiB allocated

Alt Table

Click to see full alt table

Status	Accuracy	Program
	99.7%	(.f64 (.f64 #s(literal 3 binary64) (-.f64 #s(literal 2 binary64) (*.f64 x #s(literal 3 binary64)))) x)

Compiler

Compiled 20 to 14 computations (30% saved)

simplify2.0ms (0.1%)

Memory

0.4MiB live, 0.4MiB allocated

Algorithm

1×	egg-herbie

Rules

6×	`*-commutative`
4×	`sub-neg`
4×	`+-commutative`
3×	`neg-sub0`
3×	`neg-mul-1`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	31
1	20	31
2	32	31
3	38	31
4	42	31
5	43	31

Stop Event

1×

saturated

Calls

Call 1

Inputs
(.f64 (.f64 #s(literal 3 binary64) (-.f64 #s(literal 2 binary64) (*.f64 x #s(literal 3 binary64)))) x)

Outputs

(*.f64 (*.f64 #s(literal 3 binary64) (-.f64 #s(literal 2 binary64) (*.f64 x #s(literal 3 binary64)))) x)

(*.f64 x (*.f64 #s(literal 3 binary64) (-.f64 #s(literal 2 binary64) (*.f64 #s(literal 3 binary64) x))))

soundness0.0ms (0%)

Memory

0.4MiB live, 0.4MiB allocated

Stop Event

1×

fuel

Compiler

Compiled 10 to 7 computations (30% saved)

preprocess24.0ms (1.1%)

Memory: 1.8MiB live, 32.8MiB allocated
Compiler: Compiled 60 to 42 computations (30% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

analyze13.0ms (0.6%)

sample1.9s (92.9%)

preprocess106.0ms (5.1%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify2.0ms (0.1%)

soundness0.0ms (0%)

preprocess24.0ms (1.1%)

end0.0ms (0%)

Profiling