Average Error: 0.2 → 0.2
Time: 3.1s
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 r166401 = x;
        double r166402 = 3.0;
        double r166403 = r166401 * r166402;
        double r166404 = r166403 * r166401;
        return r166404;
}
↓
double f(double x) {
        double r166405 = x;
        double r166406 = 3.0;
        double r166407 = r166405 * r166406;
        double r166408 = r166407 * r166405;
        return r166408;
}

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 2020039 +o rules:numerics
(FPCore (x)
  :name "Diagrams.Tangent:$catParam from diagrams-lib-1.3.0.3, F"
  :precision binary64
  (* (* x 3) x))