Average Error: 0.1 → 0
Time: 8.1s
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 r9162870 = d1;
        double r9162871 = r9162870 * r9162870;
        double r9162872 = r9162871 * r9162870;
        double r9162873 = r9162872 * r9162870;
        return r9162873;
}
↓
double f(double d1) {
        double r9162874 = d1;
        double r9162875 = 4.0;
        double r9162876 = pow(r9162874, r9162875);
        return r9162876;
}

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. Using strategy rm

  3. Applied pow10.1

    \[\leadsto \left(\left(d1 \cdot d1\right) \cdot d1\right) \cdot \color{blue}{{d1}^{1}}\]

  4. Applied pow10.1

    \[\leadsto \left(\left(d1 \cdot d1\right) \cdot \color{blue}{{d1}^{1}}\right) \cdot {d1}^{1}\]

  5. Applied pow10.1

    \[\leadsto \left(\left(d1 \cdot \color{blue}{{d1}^{1}}\right) \cdot {d1}^{1}\right) \cdot {d1}^{1}\]

  6. Applied pow10.1

    \[\leadsto \left(\left(\color{blue}{{d1}^{1}} \cdot {d1}^{1}\right) \cdot {d1}^{1}\right) \cdot {d1}^{1}\]

  7. Applied pow-prod-up0.1

    \[\leadsto \left(\color{blue}{{d1}^{\left(1 + 1\right)}} \cdot {d1}^{1}\right) \cdot {d1}^{1}\]

  8. Applied pow-prod-up0.1

    \[\leadsto \color{blue}{{d1}^{\left(\left(1 + 1\right) + 1\right)}} \cdot {d1}^{1}\]

  9. Applied pow-prod-up0

    \[\leadsto \color{blue}{{d1}^{\left(\left(\left(1 + 1\right) + 1\right) + 1\right)}}\]

  10. Simplified0

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

  11. Final simplification0

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

Reproduce

herbie shell --seed 2019152 +o rules:numerics
(FPCore (d1)
  :name "FastMath repmul"

  :herbie-target
  (pow d1 4)

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