Metrics for Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, A

analyze1.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)

sample8.2s (96.7%)

Results

1.0s	8256×	valid-rival
789.0ms	8210×	valid-sollya
230.0ms	46×	exit-sollya

Bogosity

preprocess223.0ms (2.6%)

Algorithm

1×	egg-herbie

Rules

360×	`fma-define`
206×	`fma-neg`
92×	`cancel-sign-sub-inv`
89×	`associate-r`
85×	`distribute-lft-neg-in`

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	34	332
1	103	314
2	247	276
3	629	276
4	1120	276
5	1518	276
6	1555	276
7	1560	276
8	1560	276
9	1560	276

Stop Event

1×

saturated

Calls

Call 1

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

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

Symmetry

(sort y z)

Compiler

Compiled 10 to 7 computations (30% 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
	100.0%	(-.f64 x (.f64 (.f64 y #s(literal 4 binary64)) z))

Compiler

Compiled 20 to 14 computations (30% saved)

simplify5.0ms (0.1%)

Algorithm

1×	egg-herbie

Rules

7×	`*-commutative`
6×	`sub-neg`
6×	`+-commutative`
5×	`neg-sub0`
5×	`neg-mul-1`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	28
1	21	28
2	39	28
3	49	28
4	57	28
5	60	28

Stop Event

1×

saturated

Calls

Call 1

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

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

soundness0.0ms (0%)

Stop Event

1×

fuel

Compiler

Compiled 10 to 7 computations (30% saved)

preprocess52.0ms (0.6%)

Remove: (sort y z)
Compiler: Compiled 80 to 56 computations (30% saved)

Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, A

analyze1.0ms (0%)

sample8.2s (96.7%)

preprocess223.0ms (2.6%)

eval0.0ms (0%)

prune2.0ms (0%)

simplify5.0ms (0.1%)

soundness0.0ms (0%)

preprocess52.0ms (0.6%)

end0.0ms (0%)

Profiling