Average Error: 0.1 → 0
Time: 3.0s
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 r302451 = d1;
        double r302452 = r302451 * r302451;
        double r302453 = r302452 * r302451;
        double r302454 = r302453 * r302451;
        return r302454;
}
↓
double f(double d1) {
        double r302455 = d1;
        double r302456 = 4.0;
        double r302457 = pow(r302455, r302456);
        return r302457;
}

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

  :herbie-target
  (pow d1 4)

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