Average Error: 0.3 → 0
Time: 938.0ms
Precision: 64
\[d \cdot 10 + d \cdot 20\]
↓
\[d \cdot 30\]
d \cdot 10 + d \cdot 20
↓
d \cdot 30
double f(double d) {
        double r7563038 = d;
        double r7563039 = 10.0;
        double r7563040 = r7563038 * r7563039;
        double r7563041 = 20.0;
        double r7563042 = r7563038 * r7563041;
        double r7563043 = r7563040 + r7563042;
        return r7563043;
}
↓
double f(double d) {
        double r7563044 = d;
        double r7563045 = 30.0;
        double r7563046 = r7563044 * r7563045;
        return r7563046;
}

Error

Bits error versus d

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.3
Target0
Herbie0
\[d \cdot 30\]

Derivation

  1. Initial program 0.3

    \[d \cdot 10 + d \cdot 20\]

  2. Simplified0

    \[\leadsto \color{blue}{d \cdot 30}\]

  3. Final simplification0

    \[\leadsto d \cdot 30\]

Reproduce

herbie shell --seed 2019130 +o rules:numerics
(FPCore (d)
  :name "FastMath test1"

  :herbie-target
  (* d 30)

  (+ (* d 10) (* d 20)))