Average Error: 0.1 → 0.1
Time: 4.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 r203880 = x;
        double r203881 = y;
        double r203882 = cos(r203881);
        double r203883 = r203880 + r203882;
        double r203884 = z;
        double r203885 = sin(r203881);
        double r203886 = r203884 * r203885;
        double r203887 = r203883 - r203886;
        return r203887;
}
↓
double f(double x, double y, double z) {
        double r203888 = x;
        double r203889 = y;
        double r203890 = cos(r203889);
        double r203891 = r203888 + r203890;
        double r203892 = z;
        double r203893 = sin(r203889);
        double r203894 = r203892 * r203893;
        double r203895 = r203891 - r203894;
        return r203895;
}

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 2020035 
(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))))