Average Error: 0.1 → 0
Time: 3.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 r269686 = d1;
        double r269687 = r269686 * r269686;
        double r269688 = r269686 * r269687;
        double r269689 = r269688 * r269686;
        double r269690 = r269689 * r269686;
        double r269691 = r269690 * r269687;
        double r269692 = r269691 * r269686;
        double r269693 = r269686 * r269692;
        double r269694 = r269693 * r269686;
        return r269694;
}
↓
double f(double d1) {
        double r269695 = d1;
        double r269696 = 10.0;
        double r269697 = pow(r269695, r269696);
        return r269697;
}

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