Average Error: 0.0 → 0.0
Time: 583.0ms
Precision: binary64
Cost: 320
\[x \cdot \left(y + y\right)\]
↓
\[x \cdot \left(y + y\right)\]
x \cdot \left(y + y\right)
↓
x \cdot \left(y + y\right)
(FPCore (x y) :precision binary64 (* x (+ y y)))
↓
(FPCore (x y) :precision binary64 (* x (+ y y)))
double code(double x, double y) {
	return x * (y + y);
}
↓
double code(double x, double y) {
	return x * (y + y);
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Alternatives

Alternative 1
Error53.4
Cost64
\[0\]
Alternative 2
Error61.6
Cost64
\[1\]

Error

Derivation

  1. Initial program 0.0

    \[x \cdot \left(y + y\right)\]

  2. Simplified0.0

    \[\leadsto \color{blue}{x \cdot \left(y + y\right)}\]

  3. Final simplification0.0

    \[\leadsto x \cdot \left(y + y\right)\]

Reproduce

herbie shell --seed 2021044 
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  :precision binary64
  (* x (+ y y)))