Average Error: 0.1 → 0
Time: 3.2s
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 r213143 = d1;
        double r213144 = r213143 * r213143;
        double r213145 = r213144 * r213143;
        double r213146 = r213145 * r213143;
        return r213146;
}
↓
double f(double d1) {
        double r213147 = d1;
        double r213148 = 4.0;
        double r213149 = pow(r213147, r213148);
        return r213149;
}

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

  :herbie-target
  (pow d1 4)

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