Average Error: 0.1 → 0
Time: 791.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 r293342 = d1;
        double r293343 = r293342 * r293342;
        double r293344 = r293342 * r293343;
        double r293345 = r293344 * r293342;
        double r293346 = r293345 * r293342;
        double r293347 = r293346 * r293343;
        double r293348 = r293347 * r293342;
        double r293349 = r293342 * r293348;
        double r293350 = r293349 * r293342;
        return r293350;
}
↓
double f(double d1) {
        double r293351 = d1;
        double r293352 = 10.0;
        double r293353 = pow(r293351, r293352);
        return r293353;
}

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 2020056 +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))