Average Error: 0.1 → 0
Time: 2.1s
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 r243811 = d1;
        double r243812 = r243811 * r243811;
        double r243813 = r243811 * r243812;
        double r243814 = r243813 * r243811;
        double r243815 = r243814 * r243811;
        double r243816 = r243815 * r243812;
        double r243817 = r243816 * r243811;
        double r243818 = r243811 * r243817;
        double r243819 = r243818 * r243811;
        return r243819;
}
↓
double f(double d1) {
        double r243820 = d1;
        double r243821 = 10.0;
        double r243822 = pow(r243820, r243821);
        return r243822;
}

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

  :herbie-target
  (pow d1 10)

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