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

Percentage Accurate: 99.9% → 99.9%

Time: 9.4s

Alternatives: 13

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} \\ \mathsf{fma}\left(\sin y, -z, x + \cos y\right) \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

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. sub-neg N/A

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

   3. +-commutative N/A

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

   4. lift-*.f64 N/A

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

   5. *-commutative N/A

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

   6. distribute-rgt-neg-in N/A

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

   7. lower-fma.f64 N/A

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

   8. lower-neg.f64 99.9

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

4. Applied rewrites 99.9%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\sin y, -z, x + \cos y\right)} \]
5. Add Preprocessing

Alternative 2: 98.9% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   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.2%

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

   if -100 < (-.f64 (+.f64 x (cos.f64 y)) (*.f64 z (sin.f64 y))) < 0.99980000000000002

   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. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. lower-cos.f64 100.0

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

   5. Applied rewrites 100.0%

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

   if 0.99980000000000002 < (-.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. sub-neg N/A

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

      3. +-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. distribute-rgt-neg-in N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-neg.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in y around 0

      \[\leadsto \mathsf{fma}\left(\sin y, \mathsf{neg}\left(z\right), x + \color{blue}{1}\right) \]
   6. Step-by-step derivation

   7. Applied rewrites 99.9%

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

4. Final simplification 99.7%

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

Alternative 3: 98.9% accurate, 0.4× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	double t_0 = x + cos(y);
	double t_1 = sin(y) * z;
	double t_2 = t_0 - t_1;
	double t_3 = (x + 1.0) - t_1;
	double tmp;
	if (t_2 <= -100.0) {
		tmp = t_3;
	} else if (t_2 <= 0.9998) {
		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 = x + cos(y)
    t_1 = sin(y) * z
    t_2 = t_0 - t_1
    t_3 = (x + 1.0d0) - t_1
    if (t_2 <= (-100.0d0)) then
        tmp = t_3
    else if (t_2 <= 0.9998d0) 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 = x + Math.cos(y);
	double t_1 = Math.sin(y) * z;
	double t_2 = t_0 - t_1;
	double t_3 = (x + 1.0) - t_1;
	double tmp;
	if (t_2 <= -100.0) {
		tmp = t_3;
	} else if (t_2 <= 0.9998) {
		tmp = t_0;
	} else {
		tmp = t_3;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(x + N[Cos[y], $MachinePrecision]), $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[(x + 1.0), $MachinePrecision] - t$95$1), $MachinePrecision]}, If[LessEqual[t$95$2, -100.0], t$95$3, If[LessEqual[t$95$2, 0.9998], 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))) < -100 or 0.99980000000000002 < (-.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.6%

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

   if -100 < (-.f64 (+.f64 x (cos.f64 y)) (*.f64 z (sin.f64 y))) < 0.99980000000000002

   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. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. lower-cos.f64 100.0

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

   5. Applied rewrites 100.0%

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

4. Final simplification 99.7%

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

Alternative 4: 74.4% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (- (+ x (cos y)) (* (sin y) z))) (t_1 (- x (fma y z -1.0))))
   (if (<= t_0 -100.0) t_1 (if (<= t_0 0.9998) (cos y) t_1))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (-.f64 (+.f64 x (cos.f64 y)) (*.f64 z (sin.f64 y))) < -100 or 0.99980000000000002 < (-.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 + \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. metadata-eval N/A

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

      8. lower-fma.f64 71.4

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

   5. Applied rewrites 71.4%

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

   if -100 < (-.f64 (+.f64 x (cos.f64 y)) (*.f64 z (sin.f64 y))) < 0.99980000000000002

   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. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. lower-cos.f64 100.0

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 87.9%

      \[\leadsto \cos y \]
3. Recombined 2 regimes into one program.

4. Final simplification 73.5%

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

Alternative 5: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return (x + cos(y)) - (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 = (x + cos(y)) - (sin(y) * z)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := N[(N[(x + N[Cos[y], $MachinePrecision]), $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(x + \cos y\right) - \sin y \cdot z \]
4. Add Preprocessing

Alternative 6: 82.3% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := -\sin y \cdot z\\ \mathbf{if}\;z \leq -5.2 \cdot 10^{+97}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 3.5 \cdot 10^{+120}:\\ \;\;\;\;x + \cos y\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (- (* (sin y) z))))
   (if (<= z -5.2e+97) t_0 (if (<= z 3.5e+120) (+ x (cos y)) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = -(sin(y) * z);
	double tmp;
	if (z <= -5.2e+97) {
		tmp = t_0;
	} else if (z <= 3.5e+120) {
		tmp = x + cos(y);
	} 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 = -(sin(y) * z)
    if (z <= (-5.2d+97)) then
        tmp = t_0
    else if (z <= 3.5d+120) then
        tmp = x + cos(y)
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = -(Math.sin(y) * z);
	double tmp;
	if (z <= -5.2e+97) {
		tmp = t_0;
	} else if (z <= 3.5e+120) {
		tmp = x + Math.cos(y);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = -(math.sin(y) * z)
	tmp = 0
	if z <= -5.2e+97:
		tmp = t_0
	elif z <= 3.5e+120:
		tmp = x + math.cos(y)
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(-Float64(sin(y) * z))
	tmp = 0.0
	if (z <= -5.2e+97)
		tmp = t_0;
	elseif (z <= 3.5e+120)
		tmp = Float64(x + cos(y));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = -(sin(y) * z);
	tmp = 0.0;
	if (z <= -5.2e+97)
		tmp = t_0;
	elseif (z <= 3.5e+120)
		tmp = x + cos(y);
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = (-N[(N[Sin[y], $MachinePrecision] * z), $MachinePrecision])}, If[LessEqual[z, -5.2e+97], t$95$0, If[LessEqual[z, 3.5e+120], N[(x + N[Cos[y], $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if z < -5.2e97 or 3.50000000000000007e120 < z

   1. Initial program 99.7%

      \[\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. lower-neg.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-sin.f64 68.5

         \[\leadsto -z \cdot \color{blue}{\sin y} \]

   5. Applied rewrites 68.5%

      \[\leadsto \color{blue}{-z \cdot \sin y} \]

   if -5.2e97 < z < 3.50000000000000007e120

   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. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. lower-cos.f64 93.8

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

   5. Applied rewrites 93.8%

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

4. Final simplification 85.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -5.2 \cdot 10^{+97}:\\ \;\;\;\;-\sin y \cdot z\\ \mathbf{elif}\;z \leq 3.5 \cdot 10^{+120}:\\ \;\;\;\;x + \cos y\\ \mathbf{else}:\\ \;\;\;\;-\sin y \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 81.2% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (+ x (cos y))))
   (if (<= y -1.25)
     t_0
     (if (<= y 2.8)
       (-
        (+ x 1.0)
        (*
         y
         (fma
          (* y (* y z))
          (fma
           (* y y)
           (fma (* y y) -0.0001984126984126984 0.008333333333333333)
           -0.16666666666666666)
          z)))
       t_0))))

C

double code(double x, double y, double z) {
	double t_0 = x + cos(y);
	double tmp;
	if (y <= -1.25) {
		tmp = t_0;
	} else if (y <= 2.8) {
		tmp = (x + 1.0) - (y * fma((y * (y * z)), fma((y * y), fma((y * y), -0.0001984126984126984, 0.008333333333333333), -0.16666666666666666), z));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(x + cos(y))
	tmp = 0.0
	if (y <= -1.25)
		tmp = t_0;
	elseif (y <= 2.8)
		tmp = Float64(Float64(x + 1.0) - Float64(y * fma(Float64(y * Float64(y * z)), fma(Float64(y * y), fma(Float64(y * y), -0.0001984126984126984, 0.008333333333333333), -0.16666666666666666), z)));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1.25 or 2.7999999999999998 < y

   1. Initial program 99.8%

      \[\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. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. lower-cos.f64 60.4

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

   5. Applied rewrites 60.4%

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

   if -1.25 < y < 2.7999999999999998

   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 \left(x + \color{blue}{1}\right) - z \cdot \sin y \]
   4. Step-by-step derivation

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 99.4%

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

4. Final simplification 80.5%

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

Alternative 8: 69.7% accurate, 5.2× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -2.3e+21)
   (+ x 1.0)
   (if (<= y 3e+18)
     (+ 1.0 (fma y (fma y (fma y (* z 0.16666666666666666) -0.5) (- z)) x))
     (+ x 1.0))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -2.3e+21) {
		tmp = x + 1.0;
	} else if (y <= 3e+18) {
		tmp = 1.0 + fma(y, fma(y, fma(y, (z * 0.16666666666666666), -0.5), -z), x);
	} else {
		tmp = x + 1.0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -2.3e+21)
		tmp = Float64(x + 1.0);
	elseif (y <= 3e+18)
		tmp = Float64(1.0 + fma(y, fma(y, fma(y, Float64(z * 0.16666666666666666), -0.5), Float64(-z)), x));
	else
		tmp = Float64(x + 1.0);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -2.3e+21], N[(x + 1.0), $MachinePrecision], If[LessEqual[y, 3e+18], N[(1.0 + N[(y * N[(y * N[(y * N[(z * 0.16666666666666666), $MachinePrecision] + -0.5), $MachinePrecision] + (-z)), $MachinePrecision] + x), $MachinePrecision]), $MachinePrecision], N[(x + 1.0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -2.3e21 or 3e18 < y

   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. +-commutative N/A

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

      2. lower-+.f64 37.6

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

   5. Applied rewrites 37.6%

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

   if -2.3e21 < y < 3e18

   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. lower-+.f64 N/A

         \[\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)} \]

      2. +-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sub-neg N/A

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

      5. lower-fma.f64 N/A

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

      6. sub-neg N/A

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

      7. associate-*r* N/A

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

      8. *-commutative N/A

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

      9. associate-*l* N/A

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

      10. metadata-eval N/A

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

      11. lower-fma.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 N/A

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

      14. lower-neg.f64 96.0

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

   5. Applied rewrites 96.0%

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

Alternative 9: 69.5% accurate, 7.1× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -2.1e+20)
   (+ x 1.0)
   (if (<= y 3.9e+35) (fma y (- (* y -0.5) z) (+ x 1.0)) (+ x 1.0))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -2.1e+20) {
		tmp = x + 1.0;
	} else if (y <= 3.9e+35) {
		tmp = fma(y, ((y * -0.5) - z), (x + 1.0));
	} else {
		tmp = x + 1.0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -2.1e+20)
		tmp = Float64(x + 1.0);
	elseif (y <= 3.9e+35)
		tmp = fma(y, Float64(Float64(y * -0.5) - z), Float64(x + 1.0));
	else
		tmp = Float64(x + 1.0);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -2.1e+20], N[(x + 1.0), $MachinePrecision], If[LessEqual[y, 3.9e+35], N[(y * N[(N[(y * -0.5), $MachinePrecision] - z), $MachinePrecision] + N[(x + 1.0), $MachinePrecision]), $MachinePrecision], N[(x + 1.0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -2.1e20 or 3.8999999999999999e35 < y

   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. +-commutative N/A

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

      2. lower-+.f64 37.9

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

   5. Applied rewrites 37.9%

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

   if -2.1e20 < y < 3.8999999999999999e35

   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. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 95.2

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

   5. Applied rewrites 95.2%

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

Alternative 10: 69.5% accurate, 9.6× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -13500000.0)
   (+ x 1.0)
   (if (<= y 2.45e+54) (- x (fma y z -1.0)) (+ x 1.0))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -13500000.0) {
		tmp = x + 1.0;
	} else if (y <= 2.45e+54) {
		tmp = x - fma(y, z, -1.0);
	} else {
		tmp = x + 1.0;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1.35e7 or 2.45e54 < y

   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. +-commutative N/A

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

      2. lower-+.f64 40.5

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

   5. Applied rewrites 40.5%

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

   if -1.35e7 < y < 2.45e54

   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. metadata-eval N/A

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

      8. lower-fma.f64 93.7

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

   5. Applied rewrites 93.7%

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

Alternative 11: 60.9% accurate, 15.1× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= 1.8e+155) {
		tmp = x + 1.0;
	} else {
		tmp = y * -z;
	}
	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 <= 1.8d+155) then
        tmp = x + 1.0d0
    else
        tmp = y * -z
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 1.80000000000000004e155

   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. +-commutative N/A

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

      2. lower-+.f64 69.2

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

   5. Applied rewrites 69.2%

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

   if 1.80000000000000004e155 < z

   1. Initial program 99.7%

      \[\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. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 39.0

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

   5. Applied rewrites 39.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, y \cdot -0.5 - z, x + 1\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 27.9%

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

Alternative 12: 61.7% accurate, 53.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return x + 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 = x + 1.0d0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := N[(x + 1.0), $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. +-commutative N/A

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

   2. lower-+.f64 61.1

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

5. Applied rewrites 61.1%

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

Alternative 13: 21.4% 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. +-commutative N/A

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

   2. lower-+.f64 61.1

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

5. Applied rewrites 61.1%

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

6. Taylor expanded in x around 0

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

8. Applied rewrites 23.3%

   \[\leadsto 1 \]
9. Add Preprocessing

Reproduce

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