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

Time bar (total: 2.3s)

analyze0.0ms (0%)

Algorithm
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 22 to 16 computations (27.3% saved)

sample2.2s (94.9%)

Results
462.0ms8255×0valid-sollya
409.0ms8255×0valid-rival
367.0ms8255×0valid-baseline
0.0ms0valid-rival+baseline
0.0ms0valid-baseline+rival
Bogosity

preprocess88.0ms (3.8%)

Algorithm
egg-herbie
Rules
835×fma-define
358×fma-neg
87×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
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)

eval1.0ms (0%)

Compiler

Compiled 3 to 3 computations (0% saved)

prune2.0ms (0.1%)

Alt Table
Click to see full alt table
StatusAccuracyProgram
99.9%
(-.f64 (*.f64 (*.f64 x #s(literal 3 binary64)) y) z)
Compiler

Compiled 20 to 14 computations (30% saved)

simplify2.0ms (0.1%)

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

Useful iterations: 0 (0.0ms)

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

Stop Event
fuel
Compiler

Compiled 10 to 7 computations (30% saved)

preprocess23.0ms (1%)

Remove

(sort x y)

Compiler

Compiled 100 to 70 computations (30% saved)

end0.0ms (0%)

Profiling

Loading profile data...