Average Error: 0.1 → 0
Time: 3.7s
Precision: 64
\[\left(\left(d1 \cdot d1\right) \cdot d1\right) \cdot d1\]
↓
\[{d1}^{4}\]
\left(\left(d1 \cdot d1\right) \cdot d1\right) \cdot d1
↓
{d1}^{4}
double f(double d1) {
        double r283605 = d1;
        double r283606 = r283605 * r283605;
        double r283607 = r283606 * r283605;
        double r283608 = r283607 * r283605;
        return r283608;
}
↓
double f(double d1) {
        double r283609 = d1;
        double r283610 = 4.0;
        double r283611 = pow(r283609, r283610);
        return r283611;
}

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}^{4}\]

Derivation

  1. Initial program 0.1

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

  2. Simplified0

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

  3. Final simplification0

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

Reproduce

herbie shell --seed 2019323 
(FPCore (d1)
  :name "FastMath repmul"
  :precision binary64

  :herbie-target
  (pow d1 4)

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