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

Time bar (total: 2.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 8 to 6 computations (25% 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)
const: 0.0ms (0% of total)

sample1.8s (90.8%)

Results
1.2s8256×0valid
Precisions
Click to see histograms. Total time spent on operations: 290.0ms
ival-div: 170.0ms (58.7% of total)
ival-sub: 105.0ms (36.3% of total)
const: 11.0ms (3.8% of total)
backward-pass: 4.0ms (1.4% of total)
Bogosity

preprocess54.0ms (2.8%)

Algorithm
1×egg-herbie
Rules
118×fma-neg
41×fma-define
22×sub-neg
18×distribute-lft-neg-in
18×cancel-sign-sub-inv
Iterations

Useful iterations: 3 (0.0ms)

IterNodesCost
020149
139137
286133
3179113
4350113
5465113
6502113
7505113
Stop Event
1×saturated
Calls
Call 1
Inputs
(-.f64 x (/.f64 y #s(literal 4 binary64)))
(-.f64 x (/.f64 y #s(literal 4 binary64)))
(-.f64 (neg.f64 x) (/.f64 y #s(literal 4 binary64)))
(-.f64 x (/.f64 (neg.f64 y) #s(literal 4 binary64)))
(neg.f64 (-.f64 (neg.f64 x) (/.f64 y #s(literal 4 binary64))))
(neg.f64 (-.f64 x (/.f64 (neg.f64 y) #s(literal 4 binary64))))
(-.f64 y (/.f64 x #s(literal 4 binary64)))
Outputs
(-.f64 x (/.f64 y #s(literal 4 binary64)))
(fma.f64 y #s(literal -1/4 binary64) x)
(-.f64 x (/.f64 y #s(literal 4 binary64)))
(fma.f64 y #s(literal -1/4 binary64) x)
(-.f64 (neg.f64 x) (/.f64 y #s(literal 4 binary64)))
(-.f64 (*.f64 y #s(literal -1/4 binary64)) x)
(-.f64 x (/.f64 (neg.f64 y) #s(literal 4 binary64)))
(fma.f64 y #s(literal 1/4 binary64) x)
(neg.f64 (-.f64 (neg.f64 x) (/.f64 y #s(literal 4 binary64))))
(fma.f64 y #s(literal 1/4 binary64) x)
(neg.f64 (-.f64 x (/.f64 (neg.f64 y) #s(literal 4 binary64))))
(-.f64 (*.f64 y #s(literal -1/4 binary64)) x)
(-.f64 y (/.f64 x #s(literal 4 binary64)))
(fma.f64 x #s(literal -1/4 binary64) y)

explain70.0ms (3.5%)

FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
00-0-x
00-0-(/.f64 y #s(literal 4 binary64))
00-0-#s(literal 4 binary64)
00-0-y
00-0-(-.f64 x (/.f64 y #s(literal 4 binary64)))
Results
46.0ms512×256valid
Compiler

Compiled 35 to 23 computations (34.3% saved)

Precisions
Click to see histograms. Total time spent on operations: 12.0ms
ival-div: 8.0ms (67.9% of total)
ival-sub: 3.0ms (25.5% of total)
const: 1.0ms (8.5% of total)

eval0.0ms (0%)

Compiler

Compiled 6 to 4 computations (33.3% saved)

prune1.0ms (0%)

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

Compiled 7 to 5 computations (28.6% saved)

localize32.0ms (1.6%)

Results
24.0ms256×256valid
Compiler

Compiled 14 to 9 computations (35.7% saved)

Precisions
Click to see histograms. Total time spent on operations: 6.0ms
ival-div: 4.0ms (71.7% of total)
ival-sub: 1.0ms (17.9% of total)
const: 1.0ms (17.9% of total)

eval0.0ms (0%)

Compiler

Compiled 2 to 2 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 x (/.f64 y #s(literal 4 binary64)))
Compiler

Compiled 14 to 10 computations (28.6% saved)

simplify2.0ms (0.1%)

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

Useful iterations: 0 (0.0ms)

IterNodesCost
01019
11319
22219
32819
43319
53519
Stop Event
1×saturated
Calls
Call 1
Inputs
(-.f64 x (/.f64 y #s(literal 4 binary64)))
Outputs
(-.f64 x (/.f64 y #s(literal 4 binary64)))

soundness0.0ms (0%)

Stop Event
1×done
Compiler

Compiled 7 to 5 computations (28.6% saved)

preprocess21.0ms (1.1%)

Compiler

Compiled 28 to 20 computations (28.6% saved)

end0.0ms (0%)

Profiling

Loading profile data...