Average Error: 0.2 → 0.2
Time: 3.4s
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 r190828 = x;
        double r190829 = 3.0;
        double r190830 = r190828 * r190829;
        double r190831 = r190830 * r190828;
        return r190831;
}
↓
double f(double x) {
        double r190832 = x;
        double r190833 = 3.0;
        double r190834 = r190832 * r190833;
        double r190835 = r190834 * r190832;
        return r190835;
}

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