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

analyze114.0ms (1.8%)

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
0%	0%	99.9%	0.1%	0%	0%	0%	1
0%	0%	99.9%	0.1%	0%	0%	0%	2
0%	0%	99.9%	0.1%	0%	0%	0%	3
50%	49.9%	49.9%	0.1%	0%	0%	0%	4
50%	49.9%	49.9%	0.1%	0%	0%	0%	5
50%	49.9%	49.9%	0.1%	0%	0%	0%	6
75%	74.9%	25%	0.1%	0%	0%	0%	7
75%	74.9%	25%	0.1%	0%	0%	0%	8
75%	74.9%	25%	0.1%	0%	0%	0%	9
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	10
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	11
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	12

Compiler

Compiled 13 to 9 computations (30.8% saved)

sample5.9s (92.6%)

Results

881.0ms	8254×	0	valid-sollya
1.4s	8254×	0	valid-rival

Bogosity

preprocess234.0ms (3.7%)

Algorithm

1×	egg-herbie

Rules

652×	`fma-define`
505×	`unsub-neg`
478×	`distribute-lft-in`
407×	`distribute-rgt-in`
294×	`div-sub`

Iterations

Useful iterations: 4 (0.0ms)

Iter	Nodes	Cost
0	43	443
1	152	416
2	467	407
3	2015	383
4	6023	374

Stop Event

1×	node limit

Calls

Call 1

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

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

Symmetry

(negabs x)

Compiler

Compiled 12 to 8 computations (33.3% saved)

eval0.0ms (0%)

Compiler: Compiled 3 to 3 computations (0% saved)

prune2.0ms (0%)

Alt Table

Click to see full alt table

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

Compiler

Compiled 24 to 16 computations (33.3% saved)

simplify6.0ms (0.1%)

Algorithm

1×	egg-herbie

Rules

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	37
1	24	37
2	28	37
3	30	37
4	31	37

Stop Event

1×

saturated

Calls

Call 1

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

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

soundness1.0ms (0%)

Stop Event

1×

fuel

Compiler

Compiled 12 to 8 computations (33.3% saved)

preprocess116.0ms (1.8%)

Remove: (negabs x)
Compiler: Compiled 176 to 102 computations (42% saved)

Diagrams.TwoD.Segment.Bernstein:evaluateBernstein from diagrams-lib-1.3.0.3

analyze114.0ms (1.8%)

sample5.9s (92.6%)

preprocess234.0ms (3.7%)

eval0.0ms (0%)

prune2.0ms (0%)

simplify6.0ms (0.1%)

soundness1.0ms (0%)

preprocess116.0ms (1.8%)

end0.0ms (0%)

Profiling