Average Error: 0.1 → 0.1
Time: 14.5s
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 r95700 = x;
        double r95701 = y;
        double r95702 = cos(r95701);
        double r95703 = r95700 + r95702;
        double r95704 = z;
        double r95705 = sin(r95701);
        double r95706 = r95704 * r95705;
        double r95707 = r95703 - r95706;
        return r95707;
}
↓
double f(double x, double y, double z) {
        double r95708 = x;
        double r95709 = y;
        double r95710 = cos(r95709);
        double r95711 = r95708 + r95710;
        double r95712 = z;
        double r95713 = sin(r95709);
        double r95714 = r95712 * r95713;
        double r95715 = r95711 - r95714;
        return r95715;
}

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