Average Error: 0.1 → 0
Time: 4.5s
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 r131069 = d1;
        double r131070 = r131069 * r131069;
        double r131071 = r131070 * r131069;
        double r131072 = r131071 * r131069;
        return r131072;
}
↓
double f(double d1) {
        double r131073 = d1;
        double r131074 = 4.0;
        double r131075 = pow(r131073, r131074);
        return r131075;
}

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

  :herbie-target
  (pow d1 4)

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