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

Time bar (total: 8.9s)

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 10 to 8 computations (20% saved)

sample8.5s (96.4%)

Results
1.2s8256×0valid-rival
699.0ms8209×0valid-sollya
235.0ms47×0exit-sollya
Bogosity

preprocess216.0ms (2.4%)

Algorithm
1×egg-herbie
Rules
148×fma-neg
106×fma-define
27×distribute-lft-neg-in
23×distribute-lft-in
21×distribute-rgt-in
Iterations

Useful iterations: 1 (0.0ms)

IterNodesCost
024141
168133
2190133
3344133
4504133
5668133
6696133
7702133
Stop Event
1×saturated
Calls
Call 1
Inputs
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 x y))
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 x y))
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 (neg.f64 x) y))
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 x (neg.f64 y)))
(neg.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 (neg.f64 x) y)))
(neg.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 x (neg.f64 y))))
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 y x))
Outputs
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 x y))
(*.f64 #s(literal 1/2 binary64) (+.f64 x y))
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 x y))
(*.f64 #s(literal 1/2 binary64) (+.f64 x y))
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 (neg.f64 x) y))
(*.f64 #s(literal 1/2 binary64) (+.f64 y (neg.f64 x)))
(*.f64 #s(literal 1/2 binary64) (-.f64 y x))
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 x (neg.f64 y)))
(*.f64 #s(literal 1/2 binary64) (-.f64 x y))
(neg.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 (neg.f64 x) y)))
(*.f64 #s(literal 1/2 binary64) (-.f64 x y))
(neg.f64 (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 x (neg.f64 y))))
(*.f64 #s(literal 1/2 binary64) (+.f64 y (neg.f64 x)))
(*.f64 #s(literal 1/2 binary64) (-.f64 y x))
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 y x))
(*.f64 #s(literal 1/2 binary64) (+.f64 x y))
Symmetry

(sort x y)

Compiler

Compiled 9 to 7 computations (22.2% saved)

eval1.0ms (0%)

Compiler

Compiled 2 to 2 computations (0% saved)

prune3.0ms (0%)

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

Compiled 18 to 14 computations (22.2% saved)

simplify4.0ms (0%)

Algorithm
1×egg-herbie
Rules
3×1-exp
1×*-commutative
1×+-commutative
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01319
12119
Stop Event
1×saturated
Calls
Call 1
Inputs
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 x y))
Outputs
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 x y))
(*.f64 #s(literal 1/2 binary64) (+.f64 x y))

soundness1.0ms (0%)

Stop Event
1×fuel
Compiler

Compiled 7 to 5 computations (28.6% saved)

preprocess92.0ms (1%)

Remove

(sort x y)

Compiler

Compiled 74 to 54 computations (27% saved)

end0.0ms (0%)

Profiling

Loading profile data...