Metrics for Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, B

analyze0.0ms (0%)

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 11 to 8 computations (27.3% saved)

sample9.7s (98.2%)

Results

1.0s	8256×	valid-rival
780.0ms	8205×	valid-sollya
255.0ms	51×	exit-sollya

Bogosity

preprocess119.0ms (1.2%)

Algorithm

1×	egg-herbie

Rules

835×	`fma-define`
358×	`fma-neg`
87×	`unsub-neg`
81×	`associate-r`
78×	`distribute-lft-in`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	34	332
1	85	296
2	199	296
3	522	296
4	1018	296
5	1664	296
6	2237	296
7	2243	296
8	2243	296

Stop Event

1×

saturated

Calls

Call 1

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

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

Symmetry

(sort x y)

Compiler

Compiled 10 to 7 computations (30% saved)

eval0.0ms (0%)

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

prune1.0ms (0%)

Alt Table

Click to see full alt table

Status	Accuracy	Program
	99.8%	(-.f64 (.f64 (.f64 x #s(literal 3 binary64)) y) z)

Compiler

Compiled 20 to 14 computations (30% saved)

simplify3.0ms (0%)

Algorithm

1×	egg-herbie

Rules

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	28
1	18	28
2	23	28
3	25	28
4	26	28

Stop Event

1×

saturated

Calls

Call 1

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

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

soundness0.0ms (0%)

Stop Event

1×

fuel

Compiler

Compiled 10 to 7 computations (30% saved)

preprocess56.0ms (0.6%)

Remove: (sort x y)
Compiler: Compiled 100 to 70 computations (30% saved)

Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, B

analyze0.0ms (0%)

sample9.7s (98.2%)

preprocess119.0ms (1.2%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify3.0ms (0%)

soundness0.0ms (0%)

preprocess56.0ms (0.6%)

end0.0ms (0%)

Profiling