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

Time bar (total: 4.4s)

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

sample4.3s (97.3%)

Results
1.0s8256×0valid-rival
581.0ms8254×0valid-sollya
10.0ms2×0exit-sollya
Bogosity

preprocess83.0ms (1.9%)

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)))
(+.f64 x (/.f64 y #s(literal -4 binary64)))
(+.f64 x (*.f64 y #s(literal -1/4 binary64)))
(fma.f64 y #s(literal -1/4 binary64) x)
(-.f64 x (/.f64 y #s(literal 4 binary64)))
(+.f64 x (/.f64 y #s(literal -4 binary64)))
(+.f64 x (*.f64 y #s(literal -1/4 binary64)))
(fma.f64 y #s(literal -1/4 binary64) x)
(-.f64 (neg.f64 x) (/.f64 y #s(literal 4 binary64)))
(fma.f64 #s(literal -1 binary64) 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)))
(+.f64 x (/.f64 y #s(literal 4 binary64)))
(+.f64 x (*.f64 y #s(literal 1/4 binary64)))
(fma.f64 y #s(literal 1/4 binary64) x)
(neg.f64 (-.f64 (neg.f64 x) (/.f64 y #s(literal 4 binary64))))
(-.f64 x (/.f64 (neg.f64 y) #s(literal 4 binary64)))
(+.f64 x (/.f64 y #s(literal 4 binary64)))
(+.f64 x (*.f64 y #s(literal 1/4 binary64)))
(fma.f64 y #s(literal 1/4 binary64) x)
(neg.f64 (-.f64 x (/.f64 (neg.f64 y) #s(literal 4 binary64))))
(-.f64 (neg.f64 x) (/.f64 y #s(literal 4 binary64)))
(fma.f64 #s(literal -1 binary64) x (/.f64 y #s(literal -4 binary64)))
(-.f64 (*.f64 y #s(literal -1/4 binary64)) x)
(-.f64 y (/.f64 x #s(literal 4 binary64)))
(+.f64 y (/.f64 x #s(literal -4 binary64)))
(+.f64 y (*.f64 x #s(literal -1/4 binary64)))
(fma.f64 x #s(literal -1/4 binary64) y)
Compiler

Compiled 7 to 5 computations (28.6% saved)

eval0.0ms (0%)

Compiler

Compiled 2 to 2 computations (0% 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 14 to 10 computations (28.6% saved)

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

soundness1.0ms (0%)

Stop Event
1×fuel
Compiler

Compiled 7 to 5 computations (28.6% saved)

preprocess30.0ms (0.7%)

Compiler

Compiled 28 to 20 computations (28.6% saved)

end0.0ms (0%)

Profiling

Loading profile data...