Graphics.Rasterific.Svg.PathConverter:segmentToBezier from rasterific-svg-0.2.3.1, B

Percentage Accurate: 99.9% → 99.9%

Time: 8.3s

Alternatives: 14

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \left(x + \cos y\right) - z \cdot \sin y \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (- (+ x (cos y)) (* z (sin y))))

C

double code(double x, double y, double z) {
	return (x + cos(y)) - (z * sin(y));
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x + cos(y)) - (z * sin(y))
end function

Java

public static double code(double x, double y, double z) {
	return (x + Math.cos(y)) - (z * Math.sin(y));
}

Python

def code(x, y, z):
	return (x + math.cos(y)) - (z * math.sin(y))

Julia

function code(x, y, z)
	return Float64(Float64(x + cos(y)) - Float64(z * sin(y)))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (x + cos(y)) - (z * sin(y));
end

Wolfram

code[x_, y_, z_] := N[(N[(x + N[Cos[y], $MachinePrecision]), $MachinePrecision] - N[(z * N[Sin[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(x + \cos y\right) - z \cdot \sin y \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (- (+ x (cos y)) (* z (sin y))))

C

double code(double x, double y, double z) {
	return (x + cos(y)) - (z * sin(y));
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x + cos(y)) - (z * sin(y))
end function

Java

public static double code(double x, double y, double z) {
	return (x + Math.cos(y)) - (z * Math.sin(y));
}

Python

def code(x, y, z):
	return (x + math.cos(y)) - (z * math.sin(y))

Julia

function code(x, y, z)
	return Float64(Float64(x + cos(y)) - Float64(z * sin(y)))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (x + cos(y)) - (z * sin(y));
end

Wolfram

code[x_, y_, z_] := N[(N[(x + N[Cos[y], $MachinePrecision]), $MachinePrecision] - N[(z * N[Sin[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\cos y + x\right) - \sin y \cdot z \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (- (+ (cos y) x) (* (sin y) z)))

C

double code(double x, double y, double z) {
	return (cos(y) + x) - (sin(y) * z);
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (cos(y) + x) - (sin(y) * z)
end function

Java

public static double code(double x, double y, double z) {
	return (Math.cos(y) + x) - (Math.sin(y) * z);
}

Python

def code(x, y, z):
	return (math.cos(y) + x) - (math.sin(y) * z)

Julia

function code(x, y, z)
	return Float64(Float64(cos(y) + x) - Float64(sin(y) * z))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (cos(y) + x) - (sin(y) * z);
end

Wolfram

code[x_, y_, z_] := N[(N[(N[Cos[y], $MachinePrecision] + x), $MachinePrecision] - N[(N[Sin[y], $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[\left(x + \cos y\right) - z \cdot \sin y \]
2. Add Preprocessing

3. Final simplification 99.9%

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

Alternative 2: 74.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\cos y + x\right) - \sin y \cdot z\\ t_1 := x - \mathsf{fma}\left(z, y, -1\right)\\ \mathbf{if}\;t\_0 \leq -40000000000:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_0 \leq 0.9996554221240338:\\ \;\;\;\;\cos y\\ \mathbf{elif}\;t\_0 \leq 5 \cdot 10^{+151}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;1 + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (- (+ (cos y) x) (* (sin y) z))) (t_1 (- x (fma z y -1.0))))
   (if (<= t_0 -40000000000.0)
     t_1
     (if (<= t_0 0.9996554221240338)
       (cos y)
       (if (<= t_0 5e+151) t_1 (+ 1.0 x))))))

C

double code(double x, double y, double z) {
	double t_0 = (cos(y) + x) - (sin(y) * z);
	double t_1 = x - fma(z, y, -1.0);
	double tmp;
	if (t_0 <= -40000000000.0) {
		tmp = t_1;
	} else if (t_0 <= 0.9996554221240338) {
		tmp = cos(y);
	} else if (t_0 <= 5e+151) {
		tmp = t_1;
	} else {
		tmp = 1.0 + x;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(cos(y) + x) - Float64(sin(y) * z))
	t_1 = Float64(x - fma(z, y, -1.0))
	tmp = 0.0
	if (t_0 <= -40000000000.0)
		tmp = t_1;
	elseif (t_0 <= 0.9996554221240338)
		tmp = cos(y);
	elseif (t_0 <= 5e+151)
		tmp = t_1;
	else
		tmp = Float64(1.0 + x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(N[Cos[y], $MachinePrecision] + x), $MachinePrecision] - N[(N[Sin[y], $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(x - N[(z * y + -1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -40000000000.0], t$95$1, If[LessEqual[t$95$0, 0.9996554221240338], N[Cos[y], $MachinePrecision], If[LessEqual[t$95$0, 5e+151], t$95$1, N[(1.0 + x), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 (+.f64 x (cos.f64 y)) (*.f64 z (sin.f64 y))) < -4e10 or 0.999655422124033799 < (-.f64 (+.f64 x (cos.f64 y)) (*.f64 z (sin.f64 y))) < 5.0000000000000002e151

   1. Initial program 100.0%

      \[\left(x + \cos y\right) - z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{1 + \left(x + -1 \cdot \left(y \cdot z\right)\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. unsub-neg N/A

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

      4. associate-+l- N/A

         \[\leadsto \color{blue}{x - \left(y \cdot z - 1\right)} \]

      5. lower--.f64 N/A

         \[\leadsto \color{blue}{x - \left(y \cdot z - 1\right)} \]

      6. sub-neg N/A

         \[\leadsto x - \color{blue}{\left(y \cdot z + \left(\mathsf{neg}\left(1\right)\right)\right)} \]

      7. *-commutative N/A

         \[\leadsto x - \left(\color{blue}{z \cdot y} + \left(\mathsf{neg}\left(1\right)\right)\right) \]

      8. metadata-eval N/A

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

      9. lower-fma.f64 77.1

         \[\leadsto x - \color{blue}{\mathsf{fma}\left(z, y, -1\right)} \]

   5. Applied rewrites 77.1%

      \[\leadsto \color{blue}{x - \mathsf{fma}\left(z, y, -1\right)} \]

   if -4e10 < (-.f64 (+.f64 x (cos.f64 y)) (*.f64 z (sin.f64 y))) < 0.999655422124033799

   1. Initial program 99.9%

      \[\left(x + \cos y\right) - z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{x + \cos y} \]
   4. Step-by-step derivation

      1. lower-+.f64 N/A

         \[\leadsto \color{blue}{x + \cos y} \]

      2. lower-cos.f64 96.3

         \[\leadsto x + \color{blue}{\cos y} \]

   5. Applied rewrites 96.3%

      \[\leadsto \color{blue}{x + \cos y} \]

   6. Taylor expanded in x around 0

      \[\leadsto \cos y \]
   7. Step-by-step derivation

   8. Applied rewrites 93.7%

      \[\leadsto \cos y \]

   if 5.0000000000000002e151 < (-.f64 (+.f64 x (cos.f64 y)) (*.f64 z (sin.f64 y)))

   1. Initial program 99.9%

      \[\left(x + \cos y\right) - z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{1 + x} \]
   4. Step-by-step derivation

      1. lower-+.f64 71.9

         \[\leadsto \color{blue}{1 + x} \]

   5. Applied rewrites 71.9%

      \[\leadsto \color{blue}{1 + x} \]
3. Recombined 3 regimes into one program.

4. Final simplification 78.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(\cos y + x\right) - \sin y \cdot z \leq -40000000000:\\ \;\;\;\;x - \mathsf{fma}\left(z, y, -1\right)\\ \mathbf{elif}\;\left(\cos y + x\right) - \sin y \cdot z \leq 0.9996554221240338:\\ \;\;\;\;\cos y\\ \mathbf{elif}\;\left(\cos y + x\right) - \sin y \cdot z \leq 5 \cdot 10^{+151}:\\ \;\;\;\;x - \mathsf{fma}\left(z, y, -1\right)\\ \mathbf{else}:\\ \;\;\;\;1 + x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 98.6% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \cos y + x\\ t_1 := \sin y \cdot z\\ t_2 := t\_0 - t\_1\\ t_3 := \left(1 + x\right) - t\_1\\ \mathbf{if}\;t\_2 \leq -40000000000:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_2 \leq 0.9996554221240338:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;t\_3\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (+ (cos y) x))
        (t_1 (* (sin y) z))
        (t_2 (- t_0 t_1))
        (t_3 (- (+ 1.0 x) t_1)))
   (if (<= t_2 -40000000000.0) t_3 (if (<= t_2 0.9996554221240338) t_0 t_3))))

C

double code(double x, double y, double z) {
	double t_0 = cos(y) + x;
	double t_1 = sin(y) * z;
	double t_2 = t_0 - t_1;
	double t_3 = (1.0 + x) - t_1;
	double tmp;
	if (t_2 <= -40000000000.0) {
		tmp = t_3;
	} else if (t_2 <= 0.9996554221240338) {
		tmp = t_0;
	} else {
		tmp = t_3;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_0 = cos(y) + x
    t_1 = sin(y) * z
    t_2 = t_0 - t_1
    t_3 = (1.0d0 + x) - t_1
    if (t_2 <= (-40000000000.0d0)) then
        tmp = t_3
    else if (t_2 <= 0.9996554221240338d0) then
        tmp = t_0
    else
        tmp = t_3
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = Math.cos(y) + x;
	double t_1 = Math.sin(y) * z;
	double t_2 = t_0 - t_1;
	double t_3 = (1.0 + x) - t_1;
	double tmp;
	if (t_2 <= -40000000000.0) {
		tmp = t_3;
	} else if (t_2 <= 0.9996554221240338) {
		tmp = t_0;
	} else {
		tmp = t_3;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = math.cos(y) + x
	t_1 = math.sin(y) * z
	t_2 = t_0 - t_1
	t_3 = (1.0 + x) - t_1
	tmp = 0
	if t_2 <= -40000000000.0:
		tmp = t_3
	elif t_2 <= 0.9996554221240338:
		tmp = t_0
	else:
		tmp = t_3
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(cos(y) + x)
	t_1 = Float64(sin(y) * z)
	t_2 = Float64(t_0 - t_1)
	t_3 = Float64(Float64(1.0 + x) - t_1)
	tmp = 0.0
	if (t_2 <= -40000000000.0)
		tmp = t_3;
	elseif (t_2 <= 0.9996554221240338)
		tmp = t_0;
	else
		tmp = t_3;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = cos(y) + x;
	t_1 = sin(y) * z;
	t_2 = t_0 - t_1;
	t_3 = (1.0 + x) - t_1;
	tmp = 0.0;
	if (t_2 <= -40000000000.0)
		tmp = t_3;
	elseif (t_2 <= 0.9996554221240338)
		tmp = t_0;
	else
		tmp = t_3;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[Cos[y], $MachinePrecision] + x), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sin[y], $MachinePrecision] * z), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$0 - t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(N[(1.0 + x), $MachinePrecision] - t$95$1), $MachinePrecision]}, If[LessEqual[t$95$2, -40000000000.0], t$95$3, If[LessEqual[t$95$2, 0.9996554221240338], t$95$0, t$95$3]]]]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (+.f64 x (cos.f64 y)) (*.f64 z (sin.f64 y))) < -4e10 or 0.999655422124033799 < (-.f64 (+.f64 x (cos.f64 y)) (*.f64 z (sin.f64 y)))

   1. Initial program 99.9%

      \[\left(x + \cos y\right) - z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \left(x + \color{blue}{1}\right) - z \cdot \sin y \]
   4. Step-by-step derivation

   5. Applied rewrites 99.9%

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

   if -4e10 < (-.f64 (+.f64 x (cos.f64 y)) (*.f64 z (sin.f64 y))) < 0.999655422124033799

   1. Initial program 99.9%

      \[\left(x + \cos y\right) - z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{x + \cos y} \]
   4. Step-by-step derivation

      1. lower-+.f64 N/A

         \[\leadsto \color{blue}{x + \cos y} \]

      2. lower-cos.f64 96.3

         \[\leadsto x + \color{blue}{\cos y} \]

   5. Applied rewrites 96.3%

      \[\leadsto \color{blue}{x + \cos y} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(\cos y + x\right) - \sin y \cdot z \leq -40000000000:\\ \;\;\;\;\left(1 + x\right) - \sin y \cdot z\\ \mathbf{elif}\;\left(\cos y + x\right) - \sin y \cdot z \leq 0.9996554221240338:\\ \;\;\;\;\cos y + x\\ \mathbf{else}:\\ \;\;\;\;\left(1 + x\right) - \sin y \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 98.1% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \cos y + x\\ t_1 := t\_0 - \sin y \cdot z\\ t_2 := \mathsf{fma}\left(-\sin y, z, x\right)\\ \mathbf{if}\;t\_1 \leq -40000000000:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 2:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (+ (cos y) x))
        (t_1 (- t_0 (* (sin y) z)))
        (t_2 (fma (- (sin y)) z x)))
   (if (<= t_1 -40000000000.0) t_2 (if (<= t_1 2.0) t_0 t_2))))

C

double code(double x, double y, double z) {
	double t_0 = cos(y) + x;
	double t_1 = t_0 - (sin(y) * z);
	double t_2 = fma(-sin(y), z, x);
	double tmp;
	if (t_1 <= -40000000000.0) {
		tmp = t_2;
	} else if (t_1 <= 2.0) {
		tmp = t_0;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(cos(y) + x)
	t_1 = Float64(t_0 - Float64(sin(y) * z))
	t_2 = fma(Float64(-sin(y)), z, x)
	tmp = 0.0
	if (t_1 <= -40000000000.0)
		tmp = t_2;
	elseif (t_1 <= 2.0)
		tmp = t_0;
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[Cos[y], $MachinePrecision] + x), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 - N[(N[Sin[y], $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[((-N[Sin[y], $MachinePrecision]) * z + x), $MachinePrecision]}, If[LessEqual[t$95$1, -40000000000.0], t$95$2, If[LessEqual[t$95$1, 2.0], t$95$0, t$95$2]]]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (+.f64 x (cos.f64 y)) (*.f64 z (sin.f64 y))) < -4e10 or 2 < (-.f64 (+.f64 x (cos.f64 y)) (*.f64 z (sin.f64 y)))

   1. Initial program 99.9%

      \[\left(x + \cos y\right) - z \cdot \sin y \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift--.f64 N/A

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

      2. flip-- N/A

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

      3. clear-num N/A

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

      4. lower-/.f64 N/A

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

      5. clear-num N/A

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

      6. flip-- N/A

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

      7. lift--.f64 N/A

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

      8. lower-/.f64 99.7

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

      9. lift--.f64 N/A

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

      10. sub-neg N/A

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

      11. +-commutative N/A

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

      12. lift-*.f64 N/A

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

      13. distribute-lft-neg-in N/A

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

      14. lower-fma.f64 N/A

          \[\leadsto \frac{1}{\frac{1}{\color{blue}{\mathsf{fma}\left(\mathsf{neg}\left(z\right), \sin y, x + \cos y\right)}}} \]

   4. Applied rewrites 99.7%

      \[\leadsto \color{blue}{\frac{1}{\frac{1}{\mathsf{fma}\left(-z, \sin y, \cos y + x\right)}}} \]

   5. Taylor expanded in z around inf

      \[\leadsto \color{blue}{z \cdot \left(-1 \cdot \sin y + \left(\frac{x}{z} + \frac{\cos y}{z}\right)\right)} \]
   6. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. mul-1-neg N/A

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

      5. sub-neg N/A

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

      6. lower--.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-cos.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lower-sin.f64 83.5

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

   7. Applied rewrites 83.5%

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

   8. Taylor expanded in x around 0

      \[\leadsto x + \color{blue}{z \cdot \left(\frac{\cos y}{z} - \sin y\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 99.9%

       \[\leadsto \mathsf{fma}\left(\frac{\cos y}{z} - \sin y, \color{blue}{z}, x\right) \]

   11. Taylor expanded in z around inf

       \[\leadsto \mathsf{fma}\left(-1 \cdot \sin y, z, x\right) \]
   12. Step-by-step derivation

   13. Applied rewrites 99.6%

       \[\leadsto \mathsf{fma}\left(-\sin y, z, x\right) \]

   if -4e10 < (-.f64 (+.f64 x (cos.f64 y)) (*.f64 z (sin.f64 y))) < 2

   1. Initial program 100.0%

      \[\left(x + \cos y\right) - z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{x + \cos y} \]
   4. Step-by-step derivation

      1. lower-+.f64 N/A

         \[\leadsto \color{blue}{x + \cos y} \]

      2. lower-cos.f64 98.3

         \[\leadsto x + \color{blue}{\cos y} \]

   5. Applied rewrites 98.3%

      \[\leadsto \color{blue}{x + \cos y} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(\cos y + x\right) - \sin y \cdot z \leq -40000000000:\\ \;\;\;\;\mathsf{fma}\left(-\sin y, z, x\right)\\ \mathbf{elif}\;\left(\cos y + x\right) - \sin y \cdot z \leq 2:\\ \;\;\;\;\cos y + x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-\sin y, z, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 81.7% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(-z\right) \cdot \sin y\\ \mathbf{if}\;z \leq -4.2 \cdot 10^{+105}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 5.5 \cdot 10^{+152}:\\ \;\;\;\;\cos y + x\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (- z) (sin y))))
   (if (<= z -4.2e+105) t_0 (if (<= z 5.5e+152) (+ (cos y) x) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = -z * sin(y);
	double tmp;
	if (z <= -4.2e+105) {
		tmp = t_0;
	} else if (z <= 5.5e+152) {
		tmp = cos(y) + x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = -z * sin(y)
    if (z <= (-4.2d+105)) then
        tmp = t_0
    else if (z <= 5.5d+152) then
        tmp = cos(y) + x
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = -z * Math.sin(y);
	double tmp;
	if (z <= -4.2e+105) {
		tmp = t_0;
	} else if (z <= 5.5e+152) {
		tmp = Math.cos(y) + x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = -z * math.sin(y)
	tmp = 0
	if z <= -4.2e+105:
		tmp = t_0
	elif z <= 5.5e+152:
		tmp = math.cos(y) + x
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(-z) * sin(y))
	tmp = 0.0
	if (z <= -4.2e+105)
		tmp = t_0;
	elseif (z <= 5.5e+152)
		tmp = Float64(cos(y) + x);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = -z * sin(y);
	tmp = 0.0;
	if (z <= -4.2e+105)
		tmp = t_0;
	elseif (z <= 5.5e+152)
		tmp = cos(y) + x;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[((-z) * N[Sin[y], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -4.2e+105], t$95$0, If[LessEqual[z, 5.5e+152], N[(N[Cos[y], $MachinePrecision] + x), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if z < -4.2000000000000002e105 or 5.4999999999999999e152 < z

   1. Initial program 99.9%

      \[\left(x + \cos y\right) - z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{-1 \cdot \left(z \cdot \sin y\right)} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(z \cdot \sin y\right)} \]

      2. distribute-lft-neg-in N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(z\right)\right) \cdot \sin y} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(z\right)\right) \cdot \sin y} \]

      4. lower-neg.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(z\right)\right)} \cdot \sin y \]

      5. lower-sin.f64 70.7

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

   5. Applied rewrites 70.7%

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

   if -4.2000000000000002e105 < z < 5.4999999999999999e152

   1. Initial program 100.0%

      \[\left(x + \cos y\right) - z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{x + \cos y} \]
   4. Step-by-step derivation

      1. lower-+.f64 N/A

         \[\leadsto \color{blue}{x + \cos y} \]

      2. lower-cos.f64 92.1

         \[\leadsto x + \color{blue}{\cos y} \]

   5. Applied rewrites 92.1%

      \[\leadsto \color{blue}{x + \cos y} \]
3. Recombined 2 regimes into one program.

4. Final simplification 86.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -4.2 \cdot 10^{+105}:\\ \;\;\;\;\left(-z\right) \cdot \sin y\\ \mathbf{elif}\;z \leq 5.5 \cdot 10^{+152}:\\ \;\;\;\;\cos y + x\\ \mathbf{else}:\\ \;\;\;\;\left(-z\right) \cdot \sin y\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 81.3% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \cos y + x\\ \mathbf{if}\;y \leq -0.0098:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 55000000:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, z \cdot y, -0.5\right) \cdot y - z, y, 1 + x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (+ (cos y) x)))
   (if (<= y -0.0098)
     t_0
     (if (<= y 55000000.0)
       (fma (- (* (fma 0.16666666666666666 (* z y) -0.5) y) z) y (+ 1.0 x))
       t_0))))

C

double code(double x, double y, double z) {
	double t_0 = cos(y) + x;
	double tmp;
	if (y <= -0.0098) {
		tmp = t_0;
	} else if (y <= 55000000.0) {
		tmp = fma(((fma(0.16666666666666666, (z * y), -0.5) * y) - z), y, (1.0 + x));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(cos(y) + x)
	tmp = 0.0
	if (y <= -0.0098)
		tmp = t_0;
	elseif (y <= 55000000.0)
		tmp = fma(Float64(Float64(fma(0.16666666666666666, Float64(z * y), -0.5) * y) - z), y, Float64(1.0 + x));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[Cos[y], $MachinePrecision] + x), $MachinePrecision]}, If[LessEqual[y, -0.0098], t$95$0, If[LessEqual[y, 55000000.0], N[(N[(N[(N[(0.16666666666666666 * N[(z * y), $MachinePrecision] + -0.5), $MachinePrecision] * y), $MachinePrecision] - z), $MachinePrecision] * y + N[(1.0 + x), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -0.0097999999999999997 or 5.5e7 < y

   1. Initial program 99.9%

      \[\left(x + \cos y\right) - z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{x + \cos y} \]
   4. Step-by-step derivation

      1. lower-+.f64 N/A

         \[\leadsto \color{blue}{x + \cos y} \]

      2. lower-cos.f64 70.0

         \[\leadsto x + \color{blue}{\cos y} \]

   5. Applied rewrites 70.0%

      \[\leadsto \color{blue}{x + \cos y} \]

   if -0.0097999999999999997 < y < 5.5e7

   1. Initial program 100.0%

      \[\left(x + \cos y\right) - z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{1 + \left(x + y \cdot \left(y \cdot \left(\frac{1}{6} \cdot \left(y \cdot z\right) - \frac{1}{2}\right) - z\right)\right)} \]
   4. Step-by-step derivation

      1. associate-+r+ N/A

         \[\leadsto \color{blue}{\left(1 + x\right) + y \cdot \left(y \cdot \left(\frac{1}{6} \cdot \left(y \cdot z\right) - \frac{1}{2}\right) - z\right)} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{y \cdot \left(y \cdot \left(\frac{1}{6} \cdot \left(y \cdot z\right) - \frac{1}{2}\right) - z\right) + \left(1 + x\right)} \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{\left(y \cdot \left(\frac{1}{6} \cdot \left(y \cdot z\right) - \frac{1}{2}\right) - z\right) \cdot y} + \left(1 + x\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(y \cdot \left(\frac{1}{6} \cdot \left(y \cdot z\right) - \frac{1}{2}\right) - z, y, 1 + x\right)} \]

      5. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{y \cdot \left(\frac{1}{6} \cdot \left(y \cdot z\right) - \frac{1}{2}\right) - z}, y, 1 + x\right) \]

      6. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\frac{1}{6} \cdot \left(y \cdot z\right) - \frac{1}{2}\right) \cdot y} - z, y, 1 + x\right) \]

      7. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\frac{1}{6} \cdot \left(y \cdot z\right) - \frac{1}{2}\right) \cdot y} - z, y, 1 + x\right) \]

      8. sub-neg N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\frac{1}{6} \cdot \left(y \cdot z\right) + \left(\mathsf{neg}\left(\frac{1}{2}\right)\right)\right)} \cdot y - z, y, 1 + x\right) \]

      9. metadata-eval N/A

         \[\leadsto \mathsf{fma}\left(\left(\frac{1}{6} \cdot \left(y \cdot z\right) + \color{blue}{\frac{-1}{2}}\right) \cdot y - z, y, 1 + x\right) \]

      10. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{1}{6}, y \cdot z, \frac{-1}{2}\right)} \cdot y - z, y, 1 + x\right) \]

      11. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{6}, \color{blue}{z \cdot y}, \frac{-1}{2}\right) \cdot y - z, y, 1 + x\right) \]

      12. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{6}, \color{blue}{z \cdot y}, \frac{-1}{2}\right) \cdot y - z, y, 1 + x\right) \]

      13. lower-+.f64 99.3

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, z \cdot y, -0.5\right) \cdot y - z, y, \color{blue}{1 + x}\right) \]

   5. Applied rewrites 99.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, z \cdot y, -0.5\right) \cdot y - z, y, 1 + x\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 84.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -0.0098:\\ \;\;\;\;\cos y + x\\ \mathbf{elif}\;y \leq 55000000:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, z \cdot y, -0.5\right) \cdot y - z, y, 1 + x\right)\\ \mathbf{else}:\\ \;\;\;\;\cos y + x\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 69.9% accurate, 5.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -6 \cdot 10^{+26}:\\ \;\;\;\;1 + x\\ \mathbf{elif}\;y \leq 1.4 \cdot 10^{+25}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, z \cdot y, -0.5\right) \cdot y - z, y, 1 + x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{1}{x}, x, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -6e+26)
   (+ 1.0 x)
   (if (<= y 1.4e+25)
     (fma (- (* (fma 0.16666666666666666 (* z y) -0.5) y) z) y (+ 1.0 x))
     (fma (/ 1.0 x) x x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -6e+26) {
		tmp = 1.0 + x;
	} else if (y <= 1.4e+25) {
		tmp = fma(((fma(0.16666666666666666, (z * y), -0.5) * y) - z), y, (1.0 + x));
	} else {
		tmp = fma((1.0 / x), x, x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -6e+26)
		tmp = Float64(1.0 + x);
	elseif (y <= 1.4e+25)
		tmp = fma(Float64(Float64(fma(0.16666666666666666, Float64(z * y), -0.5) * y) - z), y, Float64(1.0 + x));
	else
		tmp = fma(Float64(1.0 / x), x, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -6e+26], N[(1.0 + x), $MachinePrecision], If[LessEqual[y, 1.4e+25], N[(N[(N[(N[(0.16666666666666666 * N[(z * y), $MachinePrecision] + -0.5), $MachinePrecision] * y), $MachinePrecision] - z), $MachinePrecision] * y + N[(1.0 + x), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / x), $MachinePrecision] * x + x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -5.99999999999999994e26

   1. Initial program 99.8%

      \[\left(x + \cos y\right) - z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{1 + x} \]
   4. Step-by-step derivation

      1. lower-+.f64 44.5

         \[\leadsto \color{blue}{1 + x} \]

   5. Applied rewrites 44.5%

      \[\leadsto \color{blue}{1 + x} \]

   if -5.99999999999999994e26 < y < 1.4000000000000001e25

   1. Initial program 100.0%

      \[\left(x + \cos y\right) - z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{1 + \left(x + y \cdot \left(y \cdot \left(\frac{1}{6} \cdot \left(y \cdot z\right) - \frac{1}{2}\right) - z\right)\right)} \]
   4. Step-by-step derivation

      1. associate-+r+ N/A

         \[\leadsto \color{blue}{\left(1 + x\right) + y \cdot \left(y \cdot \left(\frac{1}{6} \cdot \left(y \cdot z\right) - \frac{1}{2}\right) - z\right)} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{y \cdot \left(y \cdot \left(\frac{1}{6} \cdot \left(y \cdot z\right) - \frac{1}{2}\right) - z\right) + \left(1 + x\right)} \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{\left(y \cdot \left(\frac{1}{6} \cdot \left(y \cdot z\right) - \frac{1}{2}\right) - z\right) \cdot y} + \left(1 + x\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(y \cdot \left(\frac{1}{6} \cdot \left(y \cdot z\right) - \frac{1}{2}\right) - z, y, 1 + x\right)} \]

      5. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{y \cdot \left(\frac{1}{6} \cdot \left(y \cdot z\right) - \frac{1}{2}\right) - z}, y, 1 + x\right) \]

      6. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\frac{1}{6} \cdot \left(y \cdot z\right) - \frac{1}{2}\right) \cdot y} - z, y, 1 + x\right) \]

      7. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\frac{1}{6} \cdot \left(y \cdot z\right) - \frac{1}{2}\right) \cdot y} - z, y, 1 + x\right) \]

      8. sub-neg N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\frac{1}{6} \cdot \left(y \cdot z\right) + \left(\mathsf{neg}\left(\frac{1}{2}\right)\right)\right)} \cdot y - z, y, 1 + x\right) \]

      9. metadata-eval N/A

         \[\leadsto \mathsf{fma}\left(\left(\frac{1}{6} \cdot \left(y \cdot z\right) + \color{blue}{\frac{-1}{2}}\right) \cdot y - z, y, 1 + x\right) \]

      10. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{1}{6}, y \cdot z, \frac{-1}{2}\right)} \cdot y - z, y, 1 + x\right) \]

      11. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{6}, \color{blue}{z \cdot y}, \frac{-1}{2}\right) \cdot y - z, y, 1 + x\right) \]

      12. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{6}, \color{blue}{z \cdot y}, \frac{-1}{2}\right) \cdot y - z, y, 1 + x\right) \]

      13. lower-+.f64 95.7

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, z \cdot y, -0.5\right) \cdot y - z, y, \color{blue}{1 + x}\right) \]

   5. Applied rewrites 95.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, z \cdot y, -0.5\right) \cdot y - z, y, 1 + x\right)} \]

   if 1.4000000000000001e25 < y

   1. Initial program 99.9%

      \[\left(x + \cos y\right) - z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{x + \cos y} \]
   4. Step-by-step derivation

      1. lower-+.f64 N/A

         \[\leadsto \color{blue}{x + \cos y} \]

      2. lower-cos.f64 73.2

         \[\leadsto x + \color{blue}{\cos y} \]

   5. Applied rewrites 73.2%

      \[\leadsto \color{blue}{x + \cos y} \]

   6. Taylor expanded in x around inf

      \[\leadsto x \cdot \color{blue}{\left(1 + \frac{\cos y}{x}\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 73.1%

      \[\leadsto \mathsf{fma}\left(\frac{\cos y}{x}, \color{blue}{x}, x\right) \]

   9. Taylor expanded in y around 0

      \[\leadsto \mathsf{fma}\left(\frac{1}{x}, x, x\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 43.5%

       \[\leadsto \mathsf{fma}\left(\frac{1}{x}, x, x\right) \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 8: 69.9% accurate, 7.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -460000:\\ \;\;\;\;1 + x\\ \mathbf{elif}\;y \leq 2.4 \cdot 10^{+21}:\\ \;\;\;\;\mathsf{fma}\left(-0.5 \cdot y - z, y, 1 + x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{1}{x}, x, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -460000.0)
   (+ 1.0 x)
   (if (<= y 2.4e+21) (fma (- (* -0.5 y) z) y (+ 1.0 x)) (fma (/ 1.0 x) x x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -460000.0) {
		tmp = 1.0 + x;
	} else if (y <= 2.4e+21) {
		tmp = fma(((-0.5 * y) - z), y, (1.0 + x));
	} else {
		tmp = fma((1.0 / x), x, x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -460000.0)
		tmp = Float64(1.0 + x);
	elseif (y <= 2.4e+21)
		tmp = fma(Float64(Float64(-0.5 * y) - z), y, Float64(1.0 + x));
	else
		tmp = fma(Float64(1.0 / x), x, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -460000.0], N[(1.0 + x), $MachinePrecision], If[LessEqual[y, 2.4e+21], N[(N[(N[(-0.5 * y), $MachinePrecision] - z), $MachinePrecision] * y + N[(1.0 + x), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / x), $MachinePrecision] * x + x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -4.6e5

   1. Initial program 99.8%

      \[\left(x + \cos y\right) - z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{1 + x} \]
   4. Step-by-step derivation

      1. lower-+.f64 45.1

         \[\leadsto \color{blue}{1 + x} \]

   5. Applied rewrites 45.1%

      \[\leadsto \color{blue}{1 + x} \]

   if -4.6e5 < y < 2.4e21

   1. Initial program 100.0%

      \[\left(x + \cos y\right) - z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{1 + \left(x + y \cdot \left(\frac{-1}{2} \cdot y - z\right)\right)} \]
   4. Step-by-step derivation

      1. associate-+r+ N/A

         \[\leadsto \color{blue}{\left(1 + x\right) + y \cdot \left(\frac{-1}{2} \cdot y - z\right)} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{y \cdot \left(\frac{-1}{2} \cdot y - z\right) + \left(1 + x\right)} \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{\left(\frac{-1}{2} \cdot y - z\right) \cdot y} + \left(1 + x\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{-1}{2} \cdot y - z, y, 1 + x\right)} \]

      5. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{-1}{2} \cdot y - z}, y, 1 + x\right) \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{-1}{2} \cdot y} - z, y, 1 + x\right) \]

      7. lower-+.f64 97.6

         \[\leadsto \mathsf{fma}\left(-0.5 \cdot y - z, y, \color{blue}{1 + x}\right) \]

   5. Applied rewrites 97.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-0.5 \cdot y - z, y, 1 + x\right)} \]

   if 2.4e21 < y

   1. Initial program 99.9%

      \[\left(x + \cos y\right) - z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{x + \cos y} \]
   4. Step-by-step derivation

      1. lower-+.f64 N/A

         \[\leadsto \color{blue}{x + \cos y} \]

      2. lower-cos.f64 72.2

         \[\leadsto x + \color{blue}{\cos y} \]

   5. Applied rewrites 72.2%

      \[\leadsto \color{blue}{x + \cos y} \]

   6. Taylor expanded in x around inf

      \[\leadsto x \cdot \color{blue}{\left(1 + \frac{\cos y}{x}\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 72.1%

      \[\leadsto \mathsf{fma}\left(\frac{\cos y}{x}, \color{blue}{x}, x\right) \]

   9. Taylor expanded in y around 0

      \[\leadsto \mathsf{fma}\left(\frac{1}{x}, x, x\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 42.9%

       \[\leadsto \mathsf{fma}\left(\frac{1}{x}, x, x\right) \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 9: 69.8% accurate, 7.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(\frac{1}{x}, x, x\right)\\ \mathbf{if}\;y \leq -0.026:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 2 \cdot 10^{-9}:\\ \;\;\;\;\mathsf{fma}\left(-z, y, 1 + x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (fma (/ 1.0 x) x x)))
   (if (<= y -0.026) t_0 (if (<= y 2e-9) (fma (- z) y (+ 1.0 x)) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = fma((1.0 / x), x, x);
	double tmp;
	if (y <= -0.026) {
		tmp = t_0;
	} else if (y <= 2e-9) {
		tmp = fma(-z, y, (1.0 + x));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = fma(Float64(1.0 / x), x, x)
	tmp = 0.0
	if (y <= -0.026)
		tmp = t_0;
	elseif (y <= 2e-9)
		tmp = fma(Float64(-z), y, Float64(1.0 + x));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(1.0 / x), $MachinePrecision] * x + x), $MachinePrecision]}, If[LessEqual[y, -0.026], t$95$0, If[LessEqual[y, 2e-9], N[((-z) * y + N[(1.0 + x), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -0.0259999999999999988 or 2.00000000000000012e-9 < y

   1. Initial program 99.9%

      \[\left(x + \cos y\right) - z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{x + \cos y} \]
   4. Step-by-step derivation

      1. lower-+.f64 N/A

         \[\leadsto \color{blue}{x + \cos y} \]

      2. lower-cos.f64 70.0

         \[\leadsto x + \color{blue}{\cos y} \]

   5. Applied rewrites 70.0%

      \[\leadsto \color{blue}{x + \cos y} \]

   6. Taylor expanded in x around inf

      \[\leadsto x \cdot \color{blue}{\left(1 + \frac{\cos y}{x}\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 69.9%

      \[\leadsto \mathsf{fma}\left(\frac{\cos y}{x}, \color{blue}{x}, x\right) \]

   9. Taylor expanded in y around 0

      \[\leadsto \mathsf{fma}\left(\frac{1}{x}, x, x\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 44.6%

       \[\leadsto \mathsf{fma}\left(\frac{1}{x}, x, x\right) \]

   if -0.0259999999999999988 < y < 2.00000000000000012e-9

   1. Initial program 100.0%

      \[\left(x + \cos y\right) - z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{1 + \left(x + y \cdot \left(\frac{-1}{2} \cdot y - z\right)\right)} \]
   4. Step-by-step derivation

      1. associate-+r+ N/A

         \[\leadsto \color{blue}{\left(1 + x\right) + y \cdot \left(\frac{-1}{2} \cdot y - z\right)} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{y \cdot \left(\frac{-1}{2} \cdot y - z\right) + \left(1 + x\right)} \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{\left(\frac{-1}{2} \cdot y - z\right) \cdot y} + \left(1 + x\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{-1}{2} \cdot y - z, y, 1 + x\right)} \]

      5. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{-1}{2} \cdot y - z}, y, 1 + x\right) \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{-1}{2} \cdot y} - z, y, 1 + x\right) \]

      7. lower-+.f64 100.0

         \[\leadsto \mathsf{fma}\left(-0.5 \cdot y - z, y, \color{blue}{1 + x}\right) \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-0.5 \cdot y - z, y, 1 + x\right)} \]

   6. Taylor expanded in y around 0

      \[\leadsto \mathsf{fma}\left(-1 \cdot z, y, 1 + x\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 100.0%

      \[\leadsto \mathsf{fma}\left(-z, y, 1 + x\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 10: 69.8% accurate, 8.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -0.026:\\ \;\;\;\;1 + x\\ \mathbf{elif}\;y \leq 2 \cdot 10^{-9}:\\ \;\;\;\;\mathsf{fma}\left(-z, y, 1 + x\right)\\ \mathbf{else}:\\ \;\;\;\;1 + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -0.026)
   (+ 1.0 x)
   (if (<= y 2e-9) (fma (- z) y (+ 1.0 x)) (+ 1.0 x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -0.026) {
		tmp = 1.0 + x;
	} else if (y <= 2e-9) {
		tmp = fma(-z, y, (1.0 + x));
	} else {
		tmp = 1.0 + x;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -0.026)
		tmp = Float64(1.0 + x);
	elseif (y <= 2e-9)
		tmp = fma(Float64(-z), y, Float64(1.0 + x));
	else
		tmp = Float64(1.0 + x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -0.026], N[(1.0 + x), $MachinePrecision], If[LessEqual[y, 2e-9], N[((-z) * y + N[(1.0 + x), $MachinePrecision]), $MachinePrecision], N[(1.0 + x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -0.0259999999999999988 or 2.00000000000000012e-9 < y

   1. Initial program 99.9%

      \[\left(x + \cos y\right) - z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{1 + x} \]
   4. Step-by-step derivation

      1. lower-+.f64 44.6

         \[\leadsto \color{blue}{1 + x} \]

   5. Applied rewrites 44.6%

      \[\leadsto \color{blue}{1 + x} \]

   if -0.0259999999999999988 < y < 2.00000000000000012e-9

   1. Initial program 100.0%

      \[\left(x + \cos y\right) - z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{1 + \left(x + y \cdot \left(\frac{-1}{2} \cdot y - z\right)\right)} \]
   4. Step-by-step derivation

      1. associate-+r+ N/A

         \[\leadsto \color{blue}{\left(1 + x\right) + y \cdot \left(\frac{-1}{2} \cdot y - z\right)} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{y \cdot \left(\frac{-1}{2} \cdot y - z\right) + \left(1 + x\right)} \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{\left(\frac{-1}{2} \cdot y - z\right) \cdot y} + \left(1 + x\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{-1}{2} \cdot y - z, y, 1 + x\right)} \]

      5. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{-1}{2} \cdot y - z}, y, 1 + x\right) \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{-1}{2} \cdot y} - z, y, 1 + x\right) \]

      7. lower-+.f64 100.0

         \[\leadsto \mathsf{fma}\left(-0.5 \cdot y - z, y, \color{blue}{1 + x}\right) \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-0.5 \cdot y - z, y, 1 + x\right)} \]

   6. Taylor expanded in y around 0

      \[\leadsto \mathsf{fma}\left(-1 \cdot z, y, 1 + x\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 100.0%

      \[\leadsto \mathsf{fma}\left(-z, y, 1 + x\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 11: 69.8% accurate, 9.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -0.026:\\ \;\;\;\;1 + x\\ \mathbf{elif}\;y \leq 2 \cdot 10^{-9}:\\ \;\;\;\;x - \mathsf{fma}\left(z, y, -1\right)\\ \mathbf{else}:\\ \;\;\;\;1 + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -0.026) (+ 1.0 x) (if (<= y 2e-9) (- x (fma z y -1.0)) (+ 1.0 x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -0.026) {
		tmp = 1.0 + x;
	} else if (y <= 2e-9) {
		tmp = x - fma(z, y, -1.0);
	} else {
		tmp = 1.0 + x;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -0.026)
		tmp = Float64(1.0 + x);
	elseif (y <= 2e-9)
		tmp = Float64(x - fma(z, y, -1.0));
	else
		tmp = Float64(1.0 + x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -0.026], N[(1.0 + x), $MachinePrecision], If[LessEqual[y, 2e-9], N[(x - N[(z * y + -1.0), $MachinePrecision]), $MachinePrecision], N[(1.0 + x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -0.0259999999999999988 or 2.00000000000000012e-9 < y

   1. Initial program 99.9%

      \[\left(x + \cos y\right) - z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{1 + x} \]
   4. Step-by-step derivation

      1. lower-+.f64 44.6

         \[\leadsto \color{blue}{1 + x} \]

   5. Applied rewrites 44.6%

      \[\leadsto \color{blue}{1 + x} \]

   if -0.0259999999999999988 < y < 2.00000000000000012e-9

   1. Initial program 100.0%

      \[\left(x + \cos y\right) - z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{1 + \left(x + -1 \cdot \left(y \cdot z\right)\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. unsub-neg N/A

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

      4. associate-+l- N/A

         \[\leadsto \color{blue}{x - \left(y \cdot z - 1\right)} \]

      5. lower--.f64 N/A

         \[\leadsto \color{blue}{x - \left(y \cdot z - 1\right)} \]

      6. sub-neg N/A

         \[\leadsto x - \color{blue}{\left(y \cdot z + \left(\mathsf{neg}\left(1\right)\right)\right)} \]

      7. *-commutative N/A

         \[\leadsto x - \left(\color{blue}{z \cdot y} + \left(\mathsf{neg}\left(1\right)\right)\right) \]

      8. metadata-eval N/A

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

      9. lower-fma.f64 100.0

         \[\leadsto x - \color{blue}{\mathsf{fma}\left(z, y, -1\right)} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{x - \mathsf{fma}\left(z, y, -1\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 12: 61.6% accurate, 15.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -9.6 \cdot 10^{+188}:\\ \;\;\;\;\left(-y\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;1 + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -9.6e+188) (* (- y) z) (+ 1.0 x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -9.6e+188) {
		tmp = -y * z;
	} else {
		tmp = 1.0 + x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-9.6d+188)) then
        tmp = -y * z
    else
        tmp = 1.0d0 + x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -9.6e+188) {
		tmp = -y * z;
	} else {
		tmp = 1.0 + x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -9.6e+188:
		tmp = -y * z
	else:
		tmp = 1.0 + x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -9.6e+188)
		tmp = Float64(Float64(-y) * z);
	else
		tmp = Float64(1.0 + x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -9.6e+188)
		tmp = -y * z;
	else
		tmp = 1.0 + x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -9.6e+188], N[((-y) * z), $MachinePrecision], N[(1.0 + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -9.5999999999999997e188

   1. Initial program 99.9%

      \[\left(x + \cos y\right) - z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{1 + \left(x + y \cdot \left(\frac{-1}{2} \cdot y - z\right)\right)} \]
   4. Step-by-step derivation

      1. associate-+r+ N/A

         \[\leadsto \color{blue}{\left(1 + x\right) + y \cdot \left(\frac{-1}{2} \cdot y - z\right)} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{y \cdot \left(\frac{-1}{2} \cdot y - z\right) + \left(1 + x\right)} \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{\left(\frac{-1}{2} \cdot y - z\right) \cdot y} + \left(1 + x\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{-1}{2} \cdot y - z, y, 1 + x\right)} \]

      5. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{-1}{2} \cdot y - z}, y, 1 + x\right) \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{-1}{2} \cdot y} - z, y, 1 + x\right) \]

      7. lower-+.f64 48.4

         \[\leadsto \mathsf{fma}\left(-0.5 \cdot y - z, y, \color{blue}{1 + x}\right) \]

   5. Applied rewrites 48.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-0.5 \cdot y - z, y, 1 + x\right)} \]

   6. Taylor expanded in z around inf

      \[\leadsto -1 \cdot \color{blue}{\left(y \cdot z\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 35.1%

      \[\leadsto \left(-y\right) \cdot \color{blue}{z} \]

   if -9.5999999999999997e188 < z

   1. Initial program 99.9%

      \[\left(x + \cos y\right) - z \cdot \sin y \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{1 + x} \]
   4. Step-by-step derivation

      1. lower-+.f64 67.3

         \[\leadsto \color{blue}{1 + x} \]

   5. Applied rewrites 67.3%

      \[\leadsto \color{blue}{1 + x} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 13: 61.5% accurate, 53.0× speedup

Math

\[\begin{array}{l} \\ 1 + x \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (+ 1.0 x))

C

double code(double x, double y, double z) {
	return 1.0 + x;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = 1.0d0 + x
end function

Java

public static double code(double x, double y, double z) {
	return 1.0 + x;
}

Python

def code(x, y, z):
	return 1.0 + x

Julia

function code(x, y, z)
	return Float64(1.0 + x)
end

MATLAB

function tmp = code(x, y, z)
	tmp = 1.0 + x;
end

Wolfram

code[x_, y_, z_] := N[(1.0 + x), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[\left(x + \cos y\right) - z \cdot \sin y \]
2. Add Preprocessing

3. Taylor expanded in y around 0

   \[\leadsto \color{blue}{1 + x} \]
4. Step-by-step derivation

   1. lower-+.f64 62.8

      \[\leadsto \color{blue}{1 + x} \]

5. Applied rewrites 62.8%

   \[\leadsto \color{blue}{1 + x} \]
6. Add Preprocessing

Alternative 14: 21.1% accurate, 212.0× speedup

Math

\[\begin{array}{l} \\ 1 \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 1.0)

C

double code(double x, double y, double z) {
	return 1.0;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = 1.0d0
end function

Java

public static double code(double x, double y, double z) {
	return 1.0;
}

Python

def code(x, y, z):
	return 1.0

Julia

function code(x, y, z)
	return 1.0
end

MATLAB

function tmp = code(x, y, z)
	tmp = 1.0;
end

Wolfram

code[x_, y_, z_] := 1.0

Derivation

1. Initial program 99.9%

   \[\left(x + \cos y\right) - z \cdot \sin y \]
2. Add Preprocessing

3. Taylor expanded in y around 0

   \[\leadsto \color{blue}{1 + x} \]
4. Step-by-step derivation

   1. lower-+.f64 62.8

      \[\leadsto \color{blue}{1 + x} \]

5. Applied rewrites 62.8%

   \[\leadsto \color{blue}{1 + x} \]

6. Taylor expanded in x around 0

   \[\leadsto 1 \]
7. Step-by-step derivation

8. Applied rewrites 21.9%

   \[\leadsto 1 \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2024235 
(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))))