Average Error: 0.1 → 0.1
Time: 16.4s
Precision: 64
\[\left(x + \cos y\right) - z \cdot \sin y\]
↓
\[\left(x + \cos y\right) - z \cdot \sin y\]
\left(x + \cos y\right) - z \cdot \sin y
↓
\left(x + \cos y\right) - z \cdot \sin y
double f(double x, double y, double z) {
        double r113363 = x;
        double r113364 = y;
        double r113365 = cos(r113364);
        double r113366 = r113363 + r113365;
        double r113367 = z;
        double r113368 = sin(r113364);
        double r113369 = r113367 * r113368;
        double r113370 = r113366 - r113369;
        return r113370;
}
↓
double f(double x, double y, double z) {
        double r113371 = x;
        double r113372 = y;
        double r113373 = cos(r113372);
        double r113374 = r113371 + r113373;
        double r113375 = z;
        double r113376 = sin(r113372);
        double r113377 = r113375 * r113376;
        double r113378 = r113374 - r113377;
        return r113378;
}

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.1

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

  2. Final simplification0.1

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

Reproduce

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