Average Error: 0.1 → 0
Time: 6.9s
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 r119427 = d1;
        double r119428 = r119427 * r119427;
        double r119429 = r119427 * r119428;
        double r119430 = r119429 * r119427;
        double r119431 = r119430 * r119427;
        double r119432 = r119431 * r119428;
        double r119433 = r119432 * r119427;
        double r119434 = r119427 * r119433;
        double r119435 = r119434 * r119427;
        return r119435;
}

double f(double d1) {
        double r119436 = d1;
        double r119437 = 10.0;
        double r119438 = pow(r119436, r119437);
        return r119438;
}

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 2019325 
(FPCore (d1)
  :name "FastMath test5"
  :precision binary64

  :herbie-target
  (pow d1 10)

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