Diagrams.Solve.Polynomial:quartForm from diagrams-solve-0.1, D

Time bar (total: 1.0s)

analyze0.0ms (0%)

Algorithm
1×search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%99.9%0.1%0%0%0%0
100%99.9%0%0.1%0%0%0%1
Compiler

Compiled 13 to 10 computations (23.1% saved)

Precisions
Click to see histograms. Total time spent on operations: 0.0ms
ival-div: 0.0ms (0% of total)
ival-sub: 0.0ms (0% of total)
ival-mult: 0.0ms (0% of total)
const: 0.0ms (0% of total)
backward-pass: 0.0ms (0% of total)

sample767.0ms (75%)

Results
521.0ms8256×0valid
Precisions
Click to see histograms. Total time spent on operations: 262.0ms
ival-div: 127.0ms (48.4% of total)
ival-mult: 70.0ms (26.7% of total)
ival-sub: 46.0ms (17.5% of total)
const: 16.0ms (6.1% of total)
backward-pass: 3.0ms (1.1% of total)
Bogosity

preprocess103.0ms (10%)

Algorithm
1×egg-herbie
Rules
661×fma-define
378×fma-neg
86×unsub-neg
83×distribute-lft-neg-in
79×associate-*r*
Iterations

Useful iterations: 2 (0.0ms)

IterNodesCost
041398
183342
2171330
3373330
4780330
51448330
62207330
72262330
82268330
92268330
Stop Event
1×saturated
Calls
Call 1
Inputs
(-.f64 (/.f64 (*.f64 x y) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
(-.f64 (/.f64 (*.f64 x y) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
(-.f64 (/.f64 (*.f64 (neg.f64 x) y) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
(-.f64 (/.f64 (*.f64 x (neg.f64 y)) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
(-.f64 (/.f64 (*.f64 x y) #s(literal 2 binary64)) (/.f64 (neg.f64 z) #s(literal 8 binary64)))
(neg.f64 (-.f64 (/.f64 (*.f64 (neg.f64 x) y) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64))))
(neg.f64 (-.f64 (/.f64 (*.f64 x (neg.f64 y)) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64))))
(neg.f64 (-.f64 (/.f64 (*.f64 x y) #s(literal 2 binary64)) (/.f64 (neg.f64 z) #s(literal 8 binary64))))
(-.f64 (/.f64 (*.f64 y x) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
(-.f64 (/.f64 (*.f64 z y) #s(literal 2 binary64)) (/.f64 x #s(literal 8 binary64)))
(-.f64 (/.f64 (*.f64 x z) #s(literal 2 binary64)) (/.f64 y #s(literal 8 binary64)))
Outputs
(-.f64 (/.f64 (*.f64 x y) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
(-.f64 (*.f64 x (/.f64 y #s(literal 2 binary64))) (/.f64 z #s(literal 8 binary64)))
(fma.f64 y (/.f64 x #s(literal 2 binary64)) (/.f64 z #s(literal -8 binary64)))
(fma.f64 y (/.f64 x #s(literal 2 binary64)) (*.f64 z #s(literal -1/8 binary64)))
(fma.f64 x (*.f64 y #s(literal 1/2 binary64)) (*.f64 z #s(literal -1/8 binary64)))
(-.f64 (/.f64 (*.f64 x y) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
(-.f64 (*.f64 x (/.f64 y #s(literal 2 binary64))) (/.f64 z #s(literal 8 binary64)))
(fma.f64 y (/.f64 x #s(literal 2 binary64)) (/.f64 z #s(literal -8 binary64)))
(fma.f64 y (/.f64 x #s(literal 2 binary64)) (*.f64 z #s(literal -1/8 binary64)))
(fma.f64 x (*.f64 y #s(literal 1/2 binary64)) (*.f64 z #s(literal -1/8 binary64)))
(-.f64 (/.f64 (*.f64 (neg.f64 x) y) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
(-.f64 (*.f64 x (/.f64 (neg.f64 y) #s(literal 2 binary64))) (/.f64 z #s(literal 8 binary64)))
(neg.f64 (fma.f64 y (/.f64 x #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64))))
(fma.f64 x (*.f64 y #s(literal -1/2 binary64)) (*.f64 z #s(literal -1/8 binary64)))
(-.f64 (/.f64 (*.f64 x (neg.f64 y)) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
(-.f64 (*.f64 x (/.f64 (neg.f64 y) #s(literal 2 binary64))) (/.f64 z #s(literal 8 binary64)))
(neg.f64 (fma.f64 y (/.f64 x #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64))))
(fma.f64 x (*.f64 y #s(literal -1/2 binary64)) (*.f64 z #s(literal -1/8 binary64)))
(-.f64 (/.f64 (*.f64 x y) #s(literal 2 binary64)) (/.f64 (neg.f64 z) #s(literal 8 binary64)))
(-.f64 (*.f64 x (/.f64 y #s(literal 2 binary64))) (/.f64 (neg.f64 z) #s(literal 8 binary64)))
(fma.f64 y (/.f64 x #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
(fma.f64 y (/.f64 x #s(literal 2 binary64)) (*.f64 z #s(literal 1/8 binary64)))
(fma.f64 y (*.f64 x #s(literal 1/2 binary64)) (*.f64 z #s(literal 1/8 binary64)))
(neg.f64 (-.f64 (/.f64 (*.f64 (neg.f64 x) y) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64))))
(-.f64 (*.f64 x (/.f64 y #s(literal 2 binary64))) (/.f64 (neg.f64 z) #s(literal 8 binary64)))
(fma.f64 y (/.f64 x #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
(fma.f64 y (/.f64 x #s(literal 2 binary64)) (*.f64 z #s(literal 1/8 binary64)))
(fma.f64 y (*.f64 x #s(literal 1/2 binary64)) (*.f64 z #s(literal 1/8 binary64)))
(neg.f64 (-.f64 (/.f64 (*.f64 x (neg.f64 y)) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64))))
(-.f64 (*.f64 x (/.f64 y #s(literal 2 binary64))) (/.f64 (neg.f64 z) #s(literal 8 binary64)))
(fma.f64 y (/.f64 x #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
(fma.f64 y (/.f64 x #s(literal 2 binary64)) (*.f64 z #s(literal 1/8 binary64)))
(fma.f64 y (*.f64 x #s(literal 1/2 binary64)) (*.f64 z #s(literal 1/8 binary64)))
(neg.f64 (-.f64 (/.f64 (*.f64 x y) #s(literal 2 binary64)) (/.f64 (neg.f64 z) #s(literal 8 binary64))))
(-.f64 (*.f64 x (/.f64 (neg.f64 y) #s(literal 2 binary64))) (/.f64 z #s(literal 8 binary64)))
(neg.f64 (fma.f64 y (/.f64 x #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64))))
(fma.f64 x (*.f64 y #s(literal -1/2 binary64)) (*.f64 z #s(literal -1/8 binary64)))
(-.f64 (/.f64 (*.f64 y x) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
(-.f64 (*.f64 x (/.f64 y #s(literal 2 binary64))) (/.f64 z #s(literal 8 binary64)))
(fma.f64 y (/.f64 x #s(literal 2 binary64)) (/.f64 z #s(literal -8 binary64)))
(fma.f64 y (/.f64 x #s(literal 2 binary64)) (*.f64 z #s(literal -1/8 binary64)))
(fma.f64 x (*.f64 y #s(literal 1/2 binary64)) (*.f64 z #s(literal -1/8 binary64)))
(-.f64 (/.f64 (*.f64 z y) #s(literal 2 binary64)) (/.f64 x #s(literal 8 binary64)))
(-.f64 (*.f64 z (/.f64 y #s(literal 2 binary64))) (/.f64 x #s(literal 8 binary64)))
(fma.f64 z (/.f64 y #s(literal 2 binary64)) (/.f64 x #s(literal -8 binary64)))
(fma.f64 y (/.f64 z #s(literal 2 binary64)) (*.f64 x #s(literal -1/8 binary64)))
(fma.f64 y (*.f64 z #s(literal 1/2 binary64)) (*.f64 x #s(literal -1/8 binary64)))
(-.f64 (/.f64 (*.f64 x z) #s(literal 2 binary64)) (/.f64 y #s(literal 8 binary64)))
(-.f64 (*.f64 x (/.f64 z #s(literal 2 binary64))) (/.f64 y #s(literal 8 binary64)))
(fma.f64 x (/.f64 z #s(literal 2 binary64)) (/.f64 y #s(literal -8 binary64)))
(fma.f64 x (/.f64 z #s(literal 2 binary64)) (*.f64 y #s(literal -1/8 binary64)))
(fma.f64 x (*.f64 z #s(literal 1/2 binary64)) (*.f64 y #s(literal -1/8 binary64)))
Symmetry

(sort x y)

explain84.0ms (8.2%)

FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
00-0-x
00-0-(/.f64 z #s(literal 8 binary64))
00-0-#s(literal 2 binary64)
00-0-y
00-0-(-.f64 (/.f64 (*.f64 x y) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
00-0-(*.f64 x y)
00-0-z
00-0-(/.f64 (*.f64 x y) #s(literal 2 binary64))
00-0-#s(literal 8 binary64)
Results
50.0ms512×0valid
Compiler

Compiled 70 to 41 computations (41.4% saved)

Precisions
Click to see histograms. Total time spent on operations: 22.0ms
ival-div: 13.0ms (58.9% of total)
ival-mult: 4.0ms (18.1% of total)
ival-sub: 3.0ms (13.6% of total)
const: 2.0ms (9.1% of total)
backward-pass: 0.0ms (0% of total)

eval5.0ms (0.5%)

Compiler

Compiled 36 to 24 computations (33.3% saved)

prune1.0ms (0.1%)

Alt Table
Click to see full alt table
StatusAccuracyProgram
▶100.0%
(-.f64 (/.f64 (*.f64 x y) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
Compiler

Compiled 12 to 9 computations (25% saved)

localize37.0ms (3.6%)

Results
26.0ms256×0valid
Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions
Click to see histograms. Total time spent on operations: 11.0ms
ival-div: 6.0ms (54.9% of total)
ival-mult: 2.0ms (18.3% of total)
ival-sub: 1.0ms (9.1% of total)
const: 1.0ms (9.1% of total)
backward-pass: 0.0ms (0% of total)

eval0.0ms (0%)

Compiler

Compiled 3 to 3 computations (0% saved)

prune1.0ms (0.1%)

Pruning

1 alts after pruning (0 fresh and 1 done)

PrunedKeptTotal
New000
Fresh000
Picked011
Done000
Total011
Accuracy
100.0%
Counts
1 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
✓100.0%
(-.f64 (/.f64 (*.f64 x y) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
Compiler

Compiled 24 to 18 computations (25% saved)

simplify3.0ms (0.3%)

Algorithm
1×egg-herbie
Rules
4×sub-neg
4×*-commutative
4×+-commutative
3×neg-sub0
3×neg-mul-1
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01534
11934
22834
33434
43934
54134
Stop Event
1×saturated
Calls
Call 1
Inputs
(-.f64 (/.f64 (*.f64 x y) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))
Outputs
(-.f64 (/.f64 (*.f64 x y) #s(literal 2 binary64)) (/.f64 z #s(literal 8 binary64)))

soundness0.0ms (0%)

Stop Event
1×done
Compiler

Compiled 12 to 9 computations (25% saved)

preprocess22.0ms (2.2%)

Remove

(sort x y)

Compiler

Compiled 96 to 72 computations (25% saved)

end0.0ms (0%)

Profiling

Loading profile data...