Average Error: 0.3 → 0
Time: 360.0ms
Precision: binary64
\[d \cdot 10 + d \cdot 20\]
↓
\[30 \cdot d\]
d \cdot 10 + d \cdot 20
↓
30 \cdot d
(FPCore (d) :precision binary64 (+ (* d 10.0) (* d 20.0)))
↓
(FPCore (d) :precision binary64 (* 30.0 d))
double code(double d) {
	return (d * 10.0) + (d * 20.0);
}
↓
double code(double d) {
	return 30.0 * d;
}

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. Taylor expanded around 0 0

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

  3. Final simplification0

    \[\leadsto 30 \cdot d\]

Reproduce

herbie shell --seed 2020253 
(FPCore (d)
  :name "FastMath test1"
  :precision binary64

  :herbie-target
  (* d 30.0)

  (+ (* d 10.0) (* d 20.0)))