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

Time bar (total: 2.3s)

analyze15.0ms (0.7%)

Memory
4.6MiB live, 4.6MiB allocated
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 20 to 17 computations (15% saved)

sample2.1s (93.8%)

Memory
-7.2MiB live, 672.2MiB allocated
Samples
458.0ms8 256×0valid-sollya
351.0ms8 256×0valid-baseline
318.0ms8 256×0valid-rival
Bogosity

preprocess89.0ms (3.9%)

Memory
5.9MiB live, 21.4MiB allocated
Algorithm
1×egg-herbie
Rules
835×fma-define
358×fmm-def
82×unsub-neg
81×associate-*r*
78×distribute-lft-in
Iterations

Useful iterations: 1 (0.0ms)

IterNodesCost
034332
185296
2199296
3522296
41018296
51664296
62237296
72243296
82243296
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%)

Memory
0.3MiB live, 0.3MiB allocated
Compiler

Compiled 3 to 3 computations (0% saved)

prune1.0ms (0%)

Memory
0.9MiB live, 0.9MiB allocated
Alt Table
Click to see full alt table
StatusAccuracyProgram
99.8%
(-.f64 (*.f64 (*.f64 x #s(literal 3 binary64)) y) z)
Compiler

Compiled 20 to 14 computations (30% saved)

simplify2.0ms (0.1%)

Memory
0.4MiB live, 0.4MiB allocated
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)

IterNodesCost
01328
11828
22328
32528
42628
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%)

Memory
0.3MiB live, 0.3MiB allocated
Stop Event
1×fuel
Compiler

Compiled 10 to 7 computations (30% saved)

preprocess33.0ms (1.5%)

Memory
-10.2MiB live, 38.8MiB allocated
Compiler

Compiled 100 to 70 computations (30% saved)

end0.0ms (0%)

Memory
0.0MiB live, 0.0MiB allocated

Profiling

Loading profile data...