Average Error: 0.2 → 0.2
Time: 3.2s
Precision: 64
\[\left(x \cdot 3\right) \cdot x\]
↓
\[\left(x \cdot 3\right) \cdot x\]
\left(x \cdot 3\right) \cdot x
↓
\left(x \cdot 3\right) \cdot x
double f(double x) {
        double r250250 = x;
        double r250251 = 3.0;
        double r250252 = r250250 * r250251;
        double r250253 = r250252 * r250250;
        return r250253;
}
↓
double f(double x) {
        double r250254 = x;
        double r250255 = 3.0;
        double r250256 = r250254 * r250255;
        double r250257 = r250256 * r250254;
        return r250257;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.2

    \[\left(x \cdot 3\right) \cdot x\]

  2. Final simplification0.2

    \[\leadsto \left(x \cdot 3\right) \cdot x\]

Reproduce

herbie shell --seed 2020083 +o rules:numerics
(FPCore (x)
  :name "Diagrams.Tangent:$catParam from diagrams-lib-1.3.0.3, F"
  :precision binary64
  (* (* x 3) x))