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

Percentage Accurate: 99.9% → 99.9%

Time: 7.0s

Alternatives: 12

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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    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(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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    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]

Derivation

1. Initial program 99.9%

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

Alternative 2: 74.4% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (- (+ x (cos y)) (* z (sin y)))) (t_1 (fma (- z) y (+ 1.0 x))))
   (if (<= t_0 -100000.0)
     t_1
     (if (<= t_0 0.998) (cos y) (if (<= t_0 2e+142) t_1 (+ 1.0 x))))))

C

double code(double x, double y, double z) {
	double t_0 = (x + cos(y)) - (z * sin(y));
	double t_1 = fma(-z, y, (1.0 + x));
	double tmp;
	if (t_0 <= -100000.0) {
		tmp = t_1;
	} else if (t_0 <= 0.998) {
		tmp = cos(y);
	} else if (t_0 <= 2e+142) {
		tmp = t_1;
	} else {
		tmp = 1.0 + x;
	}
	return tmp;
}

Julia

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

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(x + N[Cos[y], $MachinePrecision]), $MachinePrecision] - N[(z * N[Sin[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[((-z) * y + N[(1.0 + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -100000.0], t$95$1, If[LessEqual[t$95$0, 0.998], N[Cos[y], $MachinePrecision], If[LessEqual[t$95$0, 2e+142], 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))) < -1e5 or 0.998 < (-.f64 (+.f64 x (cos.f64 y)) (*.f64 z (sin.f64 y))) < 2.0000000000000001e142

   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

   5. Applied rewrites 80.6%

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

   if -1e5 < (-.f64 (+.f64 x (cos.f64 y)) (*.f64 z (sin.f64 y))) < 0.998

   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

   5. Applied rewrites 97.3%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 93.0%

      \[\leadsto \cos y \]

   if 2.0000000000000001e142 < (-.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

   5. Applied rewrites 64.7%

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

Alternative 3: 98.6% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := z \cdot \sin y\\ t_1 := \left(x + \cos y\right) - t\_0\\ \mathbf{if}\;t\_1 \leq -5000000 \lor \neg \left(t\_1 \leq 1000000\right):\\ \;\;\;\;x - t\_0\\ \mathbf{else}:\\ \;\;\;\;\cos y + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* z (sin y))) (t_1 (- (+ x (cos y)) t_0)))
   (if (or (<= t_1 -5000000.0) (not (<= t_1 1000000.0)))
     (- x t_0)
     (+ (cos y) x))))

C

double code(double x, double y, double z) {
	double t_0 = z * sin(y);
	double t_1 = (x + cos(y)) - t_0;
	double tmp;
	if ((t_1 <= -5000000.0) || !(t_1 <= 1000000.0)) {
		tmp = x - t_0;
	} else {
		tmp = cos(y) + x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    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) :: tmp
    t_0 = z * sin(y)
    t_1 = (x + cos(y)) - t_0
    if ((t_1 <= (-5000000.0d0)) .or. (.not. (t_1 <= 1000000.0d0))) then
        tmp = x - t_0
    else
        tmp = cos(y) + x
    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 t_1 = (x + Math.cos(y)) - t_0;
	double tmp;
	if ((t_1 <= -5000000.0) || !(t_1 <= 1000000.0)) {
		tmp = x - t_0;
	} else {
		tmp = Math.cos(y) + x;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = z * math.sin(y)
	t_1 = (x + math.cos(y)) - t_0
	tmp = 0
	if (t_1 <= -5000000.0) or not (t_1 <= 1000000.0):
		tmp = x - t_0
	else:
		tmp = math.cos(y) + x
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(z * sin(y))
	t_1 = Float64(Float64(x + cos(y)) - t_0)
	tmp = 0.0
	if ((t_1 <= -5000000.0) || !(t_1 <= 1000000.0))
		tmp = Float64(x - t_0);
	else
		tmp = Float64(cos(y) + x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = z * sin(y);
	t_1 = (x + cos(y)) - t_0;
	tmp = 0.0;
	if ((t_1 <= -5000000.0) || ~((t_1 <= 1000000.0)))
		tmp = x - t_0;
	else
		tmp = cos(y) + x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (-.f64 (+.f64 x (cos.f64 y)) (*.f64 z (sin.f64 y))) < -5e6 or 1e6 < (-.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 x around inf

      \[\leadsto \color{blue}{x} - z \cdot \sin y \]
   4. Step-by-step derivation

   5. Applied rewrites 99.1%

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

   if -5e6 < (-.f64 (+.f64 x (cos.f64 y)) (*.f64 z (sin.f64 y))) < 1e6

   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

   5. Applied rewrites 95.9%

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

4. Final simplification 98.1%

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

Alternative 4: 61.4% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(x + \cos y\right) - z \cdot \sin y\\ \mathbf{if}\;t\_0 \leq -0.01:\\ \;\;\;\;x\\ \mathbf{elif}\;t\_0 \leq 2000:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (- (+ x (cos y)) (* z (sin y)))))
   (if (<= t_0 -0.01) x (if (<= t_0 2000.0) 1.0 x))))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (x + cos(y)) - (z * sin(y))
    if (t_0 <= (-0.01d0)) then
        tmp = x
    else if (t_0 <= 2000.0d0) then
        tmp = 1.0d0
    else
        tmp = x
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z):
	t_0 = (x + math.cos(y)) - (z * math.sin(y))
	tmp = 0
	if t_0 <= -0.01:
		tmp = x
	elif t_0 <= 2000.0:
		tmp = 1.0
	else:
		tmp = x
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (x + cos(y)) - (z * sin(y));
	tmp = 0.0;
	if (t_0 <= -0.01)
		tmp = x;
	elseif (t_0 <= 2000.0)
		tmp = 1.0;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (-.f64 (+.f64 x (cos.f64 y)) (*.f64 z (sin.f64 y))) < -0.0100000000000000002 or 2e3 < (-.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 x around inf

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

   5. Applied rewrites 57.2%

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

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

   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

   5. Applied rewrites 94.3%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 85.3%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 84.6%

       \[\leadsto 1 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 98.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := z \cdot \sin y\\ \mathbf{if}\;x \leq -8200 \lor \neg \left(x \leq 0.00115\right):\\ \;\;\;\;x - t\_0\\ \mathbf{else}:\\ \;\;\;\;\cos y - t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* z (sin y))))
   (if (or (<= x -8200.0) (not (<= x 0.00115))) (- x t_0) (- (cos y) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = z * sin(y);
	double tmp;
	if ((x <= -8200.0) || !(x <= 0.00115)) {
		tmp = x - t_0;
	} else {
		tmp = cos(y) - t_0;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    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 ((x <= (-8200.0d0)) .or. (.not. (x <= 0.00115d0))) then
        tmp = x - t_0
    else
        tmp = cos(y) - 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 ((x <= -8200.0) || !(x <= 0.00115)) {
		tmp = x - t_0;
	} else {
		tmp = Math.cos(y) - t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = z * math.sin(y)
	tmp = 0
	if (x <= -8200.0) or not (x <= 0.00115):
		tmp = x - t_0
	else:
		tmp = math.cos(y) - t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(z * sin(y))
	tmp = 0.0
	if ((x <= -8200.0) || !(x <= 0.00115))
		tmp = Float64(x - t_0);
	else
		tmp = Float64(cos(y) - t_0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = z * sin(y);
	tmp = 0.0;
	if ((x <= -8200.0) || ~((x <= 0.00115)))
		tmp = x - t_0;
	else
		tmp = cos(y) - t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(z * N[Sin[y], $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[x, -8200.0], N[Not[LessEqual[x, 0.00115]], $MachinePrecision]], N[(x - t$95$0), $MachinePrecision], N[(N[Cos[y], $MachinePrecision] - t$95$0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -8200 or 0.00115 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x} - z \cdot \sin y \]
   4. Step-by-step derivation

   5. Applied rewrites 98.8%

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

   if -8200 < x < 0.00115

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\cos y} - z \cdot \sin y \]
   4. Step-by-step derivation

   5. Applied rewrites 98.6%

      \[\leadsto \color{blue}{\cos y} - z \cdot \sin y \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -8200 \lor \neg \left(x \leq 0.00115\right):\\ \;\;\;\;x - z \cdot \sin y\\ \mathbf{else}:\\ \;\;\;\;\cos y - z \cdot \sin y\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 82.1% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.6 \cdot 10^{+112} \lor \neg \left(z \leq 2.3 \cdot 10^{+181}\right):\\ \;\;\;\;\left(-z\right) \cdot \sin y\\ \mathbf{else}:\\ \;\;\;\;\cos y + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -1.6e+112) (not (<= z 2.3e+181)))
   (* (- z) (sin y))
   (+ (cos y) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -1.6e+112) || !(z <= 2.3e+181)) {
		tmp = -z * sin(y);
	} else {
		tmp = cos(y) + x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((z <= (-1.6d+112)) .or. (.not. (z <= 2.3d+181))) then
        tmp = -z * sin(y)
    else
        tmp = cos(y) + x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -1.6e+112) || !(z <= 2.3e+181)) {
		tmp = -z * Math.sin(y);
	} else {
		tmp = Math.cos(y) + x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -1.6e+112) or not (z <= 2.3e+181):
		tmp = -z * math.sin(y)
	else:
		tmp = math.cos(y) + x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -1.6e+112) || !(z <= 2.3e+181))
		tmp = Float64(Float64(-z) * sin(y));
	else
		tmp = Float64(cos(y) + x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -1.6e+112) || ~((z <= 2.3e+181)))
		tmp = -z * sin(y);
	else
		tmp = cos(y) + x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -1.6e+112], N[Not[LessEqual[z, 2.3e+181]], $MachinePrecision]], N[((-z) * N[Sin[y], $MachinePrecision]), $MachinePrecision], N[(N[Cos[y], $MachinePrecision] + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.59999999999999993e112 or 2.2999999999999999e181 < z

   1. Initial program 99.8%

      \[\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

   5. Applied rewrites 70.6%

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

   if -1.59999999999999993e112 < z < 2.2999999999999999e181

   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

   5. Applied rewrites 89.5%

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

4. Final simplification 84.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.6 \cdot 10^{+112} \lor \neg \left(z \leq 2.3 \cdot 10^{+181}\right):\\ \;\;\;\;\left(-z\right) \cdot \sin y\\ \mathbf{else}:\\ \;\;\;\;\cos y + x\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 79.6% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -26.5 \lor \neg \left(y \leq 1.8 \cdot 10^{+63}\right):\\ \;\;\;\;\cos y + x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-z, y, 1 + x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -26.5) (not (<= y 1.8e+63)))
   (+ (cos y) x)
   (fma (- z) y (+ 1.0 x))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -26.5) || !(y <= 1.8e+63)) {
		tmp = cos(y) + x;
	} else {
		tmp = fma(-z, y, (1.0 + x));
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -26.5) || !(y <= 1.8e+63))
		tmp = Float64(cos(y) + x);
	else
		tmp = fma(Float64(-z), y, Float64(1.0 + x));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -26.5 or 1.79999999999999999e63 < 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

   5. Applied rewrites 67.8%

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

   if -26.5 < y < 1.79999999999999999e63

   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

   5. Applied rewrites 97.4%

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

4. Final simplification 84.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -26.5 \lor \neg \left(y \leq 1.8 \cdot 10^{+63}\right):\\ \;\;\;\;\cos y + x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-z, y, 1 + x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 69.9% accurate, 7.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -9.6 \cdot 10^{+48} \lor \neg \left(y \leq 5.8 \cdot 10^{+16}\right):\\ \;\;\;\;1 + x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-0.5 \cdot y - z, y, 1 + x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -9.6e+48) (not (<= y 5.8e+16)))
   (+ 1.0 x)
   (fma (- (* -0.5 y) z) y (+ 1.0 x))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -9.6e+48) || !(y <= 5.8e+16)) {
		tmp = 1.0 + x;
	} else {
		tmp = fma(((-0.5 * y) - z), y, (1.0 + x));
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -9.6e+48) || !(y <= 5.8e+16))
		tmp = Float64(1.0 + x);
	else
		tmp = fma(Float64(Float64(-0.5 * y) - z), y, Float64(1.0 + x));
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -9.6e+48], N[Not[LessEqual[y, 5.8e+16]], $MachinePrecision]], N[(1.0 + x), $MachinePrecision], N[(N[(N[(-0.5 * y), $MachinePrecision] - z), $MachinePrecision] * y + N[(1.0 + x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -9.6000000000000004e48 or 5.8e16 < 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

   5. Applied rewrites 45.6%

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

   if -9.6000000000000004e48 < y < 5.8e16

   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

   5. Applied rewrites 96.2%

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

4. Final simplification 74.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -9.6 \cdot 10^{+48} \lor \neg \left(y \leq 5.8 \cdot 10^{+16}\right):\\ \;\;\;\;1 + x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-0.5 \cdot y - z, y, 1 + x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 69.5% accurate, 8.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -8 \cdot 10^{+125} \lor \neg \left(y \leq 3.05 \cdot 10^{+63}\right):\\ \;\;\;\;1 + x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-z, y, 1 + x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -8e+125) (not (<= y 3.05e+63)))
   (+ 1.0 x)
   (fma (- z) y (+ 1.0 x))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -8e+125) || !(y <= 3.05e+63)) {
		tmp = 1.0 + x;
	} else {
		tmp = fma(-z, y, (1.0 + x));
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -8e+125) || !(y <= 3.05e+63))
		tmp = Float64(1.0 + x);
	else
		tmp = fma(Float64(-z), y, Float64(1.0 + x));
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -8e+125], N[Not[LessEqual[y, 3.05e+63]], $MachinePrecision]], N[(1.0 + x), $MachinePrecision], N[((-z) * y + N[(1.0 + x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -7.9999999999999994e125 or 3.04999999999999984e63 < 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

   5. Applied rewrites 46.2%

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

   if -7.9999999999999994e125 < y < 3.04999999999999984e63

   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

   5. Applied rewrites 89.2%

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

4. Final simplification 74.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -8 \cdot 10^{+125} \lor \neg \left(y \leq 3.05 \cdot 10^{+63}\right):\\ \;\;\;\;1 + x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-z, y, 1 + x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 67.5% accurate, 10.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -8200 \lor \neg \left(x \leq 2.7 \cdot 10^{-11}\right):\\ \;\;\;\;1 + x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-z, y, 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -8200.0) (not (<= x 2.7e-11))) (+ 1.0 x) (fma (- z) y 1.0)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -8200.0) || !(x <= 2.7e-11)) {
		tmp = 1.0 + x;
	} else {
		tmp = fma(-z, y, 1.0);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -8200.0) || !(x <= 2.7e-11))
		tmp = Float64(1.0 + x);
	else
		tmp = fma(Float64(-z), y, 1.0);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -8200.0], N[Not[LessEqual[x, 2.7e-11]], $MachinePrecision]], N[(1.0 + x), $MachinePrecision], N[((-z) * y + 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -8200 or 2.70000000000000005e-11 < x

   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 + x} \]
   4. Step-by-step derivation

   5. Applied rewrites 84.3%

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

   if -8200 < x < 2.70000000000000005e-11

   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

   5. Applied rewrites 58.5%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 58.5%

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

4. Final simplification 72.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -8200 \lor \neg \left(x \leq 2.7 \cdot 10^{-11}\right):\\ \;\;\;\;1 + x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-z, y, 1\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 62.0% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    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

5. Applied rewrites 64.4%

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

Alternative 12: 43.3% accurate, 212.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := x

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in x around inf

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

5. Applied rewrites 44.8%

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

Reproduce

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