Average Error: 0.1 → 0
Time: 798.0ms
Precision: 64
\[\left(d1 \cdot \left(\left(\left(\left(\left(d1 \cdot \left(d1 \cdot d1\right)\right) \cdot d1\right) \cdot d1\right) \cdot \left(d1 \cdot d1\right)\right) \cdot d1\right)\right) \cdot d1\]
↓
\[{d1}^{10}\]
\left(d1 \cdot \left(\left(\left(\left(\left(d1 \cdot \left(d1 \cdot d1\right)\right) \cdot d1\right) \cdot d1\right) \cdot \left(d1 \cdot d1\right)\right) \cdot d1\right)\right) \cdot d1
↓
{d1}^{10}
double f(double d1) {
        double r113830 = d1;
        double r113831 = r113830 * r113830;
        double r113832 = r113830 * r113831;
        double r113833 = r113832 * r113830;
        double r113834 = r113833 * r113830;
        double r113835 = r113834 * r113831;
        double r113836 = r113835 * r113830;
        double r113837 = r113830 * r113836;
        double r113838 = r113837 * r113830;
        return r113838;
}
↓
double f(double d1) {
        double r113839 = d1;
        double r113840 = 10.0;
        double r113841 = pow(r113839, r113840);
        return r113841;
}

Error

Bits error versus d1

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.1
Target0
Herbie0
\[{d1}^{10}\]

Derivation

  1. Initial program 0.1

    \[\left(d1 \cdot \left(\left(\left(\left(\left(d1 \cdot \left(d1 \cdot d1\right)\right) \cdot d1\right) \cdot d1\right) \cdot \left(d1 \cdot d1\right)\right) \cdot d1\right)\right) \cdot d1\]

  2. Simplified0

    \[\leadsto \color{blue}{{d1}^{10}}\]

  3. Final simplification0

    \[\leadsto {d1}^{10}\]

Reproduce

herbie shell --seed 2020059 +o rules:numerics
(FPCore (d1)
  :name "FastMath test5"
  :precision binary64

  :herbie-target
  (pow d1 10)

  (* (* d1 (* (* (* (* (* d1 (* d1 d1)) d1) d1) (* d1 d1)) d1)) d1))