Average Error: 0.0 → 0.0
Time: 3.8s
Precision: binary64
\[\left(x + \sin y\right) + z \cdot \cos y\]
↓
\[\left(\sin y + x\right) + z \cdot \cos y\]
\left(x + \sin y\right) + z \cdot \cos y
↓
\left(\sin y + x\right) + z \cdot \cos y
(FPCore (x y z) :precision binary64 (+ (+ x (sin y)) (* z (cos y))))
↓
(FPCore (x y z) :precision binary64 (+ (+ (sin y) x) (* z (cos y))))
double code(double x, double y, double z) {
	return (x + sin(y)) + (z * cos(y));
}
↓
double code(double x, double y, double z) {
	return (sin(y) + x) + (z * cos(y));
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(x + \sin y\right) + z \cdot \cos y\]
  2. Using strategy rm

  3. Applied +-commutative_binary640.0

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

  4. Final simplification0.0

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

Alternatives

Reproduce

herbie shell --seed 2021118 
(FPCore (x y z)
  :name "Graphics.Rasterific.Svg.PathConverter:segmentToBezier from rasterific-svg-0.2.3.1, C"
  :precision binary64
  (+ (+ x (sin y)) (* z (cos y))))