Diagrams.Solve.Polynomial:quartForm from diagrams-solve-0.1, B

Percentage Accurate: 100.0% → 100.0%

Time: 5.4s

Alternatives: 7

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \left(\frac{1}{8} \cdot x - \frac{y \cdot z}{2}\right) + t \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (+ (- (* (/ 1.0 8.0) x) (/ (* y z) 2.0)) t))

C

double code(double x, double y, double z, double t) {
	return (((1.0 / 8.0) * x) - ((y * z) / 2.0)) + t;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (((1.0d0 / 8.0d0) * x) - ((y * z) / 2.0d0)) + t
end function

Java

public static double code(double x, double y, double z, double t) {
	return (((1.0 / 8.0) * x) - ((y * z) / 2.0)) + t;
}

Python

def code(x, y, z, t):
	return (((1.0 / 8.0) * x) - ((y * z) / 2.0)) + t

Julia

function code(x, y, z, t)
	return Float64(Float64(Float64(Float64(1.0 / 8.0) * x) - Float64(Float64(y * z) / 2.0)) + t)
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = (((1.0 / 8.0) * x) - ((y * z) / 2.0)) + t;
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(N[(N[(1.0 / 8.0), $MachinePrecision] * x), $MachinePrecision] - N[(N[(y * z), $MachinePrecision] / 2.0), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\frac{1}{8} \cdot x - \frac{y \cdot z}{2}\right) + t \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (+ (- (* (/ 1.0 8.0) x) (/ (* y z) 2.0)) t))

C

double code(double x, double y, double z, double t) {
	return (((1.0 / 8.0) * x) - ((y * z) / 2.0)) + t;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (((1.0d0 / 8.0d0) * x) - ((y * z) / 2.0d0)) + t
end function

Java

public static double code(double x, double y, double z, double t) {
	return (((1.0 / 8.0) * x) - ((y * z) / 2.0)) + t;
}

Python

def code(x, y, z, t):
	return (((1.0 / 8.0) * x) - ((y * z) / 2.0)) + t

Julia

function code(x, y, z, t)
	return Float64(Float64(Float64(Float64(1.0 / 8.0) * x) - Float64(Float64(y * z) / 2.0)) + t)
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = (((1.0 / 8.0) * x) - ((y * z) / 2.0)) + t;
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(N[(N[(1.0 / 8.0), $MachinePrecision] * x), $MachinePrecision] - N[(N[(y * z), $MachinePrecision] / 2.0), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]

Alternative 1: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\frac{1}{8} \cdot x - \frac{y \cdot z}{2}\right) + t \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (+ (- (* (/ 1.0 8.0) x) (/ (* y z) 2.0)) t))

C

double code(double x, double y, double z, double t) {
	return (((1.0 / 8.0) * x) - ((y * z) / 2.0)) + t;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (((1.0d0 / 8.0d0) * x) - ((y * z) / 2.0d0)) + t
end function

Java

public static double code(double x, double y, double z, double t) {
	return (((1.0 / 8.0) * x) - ((y * z) / 2.0)) + t;
}

Python

def code(x, y, z, t):
	return (((1.0 / 8.0) * x) - ((y * z) / 2.0)) + t

Julia

function code(x, y, z, t)
	return Float64(Float64(Float64(Float64(1.0 / 8.0) * x) - Float64(Float64(y * z) / 2.0)) + t)
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = (((1.0 / 8.0) * x) - ((y * z) / 2.0)) + t;
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(N[(N[(1.0 / 8.0), $MachinePrecision] * x), $MachinePrecision] - N[(N[(y * z), $MachinePrecision] / 2.0), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\left(\frac{1}{8} \cdot x - \frac{y \cdot z}{2}\right) + t \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 2: 50.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{1}{8} \cdot x\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+68}:\\ \;\;\;\;x \cdot 0.125\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-8}:\\ \;\;\;\;t\\ \mathbf{else}:\\ \;\;\;\;x \cdot 0.125\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (/ 1.0 8.0) x)))
   (if (<= t_1 -2e+68) (* x 0.125) (if (<= t_1 2e-8) t (* x 0.125)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (1.0 / 8.0) * x;
	double tmp;
	if (t_1 <= -2e+68) {
		tmp = x * 0.125;
	} else if (t_1 <= 2e-8) {
		tmp = t;
	} else {
		tmp = x * 0.125;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (1.0d0 / 8.0d0) * x
    if (t_1 <= (-2d+68)) then
        tmp = x * 0.125d0
    else if (t_1 <= 2d-8) then
        tmp = t
    else
        tmp = x * 0.125d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (1.0 / 8.0) * x;
	double tmp;
	if (t_1 <= -2e+68) {
		tmp = x * 0.125;
	} else if (t_1 <= 2e-8) {
		tmp = t;
	} else {
		tmp = x * 0.125;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (1.0 / 8.0) * x
	tmp = 0
	if t_1 <= -2e+68:
		tmp = x * 0.125
	elif t_1 <= 2e-8:
		tmp = t
	else:
		tmp = x * 0.125
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(1.0 / 8.0) * x)
	tmp = 0.0
	if (t_1 <= -2e+68)
		tmp = Float64(x * 0.125);
	elseif (t_1 <= 2e-8)
		tmp = t;
	else
		tmp = Float64(x * 0.125);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (1.0 / 8.0) * x;
	tmp = 0.0;
	if (t_1 <= -2e+68)
		tmp = x * 0.125;
	elseif (t_1 <= 2e-8)
		tmp = t;
	else
		tmp = x * 0.125;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(1.0 / 8.0), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+68], N[(x * 0.125), $MachinePrecision], If[LessEqual[t$95$1, 2e-8], t, N[(x * 0.125), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 8 binary64)) x) < -1.99999999999999991e68 or 2e-8 < (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 8 binary64)) x)

   1. Initial program 100.0%

      \[\left(\frac{1}{8} \cdot x - \frac{y \cdot z}{2}\right) + t \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. *-lowering-*.f64 63.3

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

   5. Simplified 63.3%

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

   if -1.99999999999999991e68 < (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 8 binary64)) x) < 2e-8

   1. Initial program 100.0%

      \[\left(\frac{1}{8} \cdot x - \frac{y \cdot z}{2}\right) + t \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

   5. Simplified 44.1%

      \[\leadsto \color{blue}{t} \]
3. Recombined 2 regimes into one program.

4. Final simplification 52.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{1}{8} \cdot x \leq -2 \cdot 10^{+68}:\\ \;\;\;\;x \cdot 0.125\\ \mathbf{elif}\;\frac{1}{8} \cdot x \leq 2 \cdot 10^{-8}:\\ \;\;\;\;t\\ \mathbf{else}:\\ \;\;\;\;x \cdot 0.125\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 87.9% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \cdot z \leq -4 \cdot 10^{-16}:\\ \;\;\;\;\mathsf{fma}\left(y, z \cdot -0.5, x \cdot 0.125\right)\\ \mathbf{elif}\;y \cdot z \leq 4 \cdot 10^{+56}:\\ \;\;\;\;\mathsf{fma}\left(0.125, x, t\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, z \cdot -0.5, t\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (* y z) -4e-16)
   (fma y (* z -0.5) (* x 0.125))
   (if (<= (* y z) 4e+56) (fma 0.125 x t) (fma y (* z -0.5) t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((y * z) <= -4e-16) {
		tmp = fma(y, (z * -0.5), (x * 0.125));
	} else if ((y * z) <= 4e+56) {
		tmp = fma(0.125, x, t);
	} else {
		tmp = fma(y, (z * -0.5), t);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(y * z) <= -4e-16)
		tmp = fma(y, Float64(z * -0.5), Float64(x * 0.125));
	elseif (Float64(y * z) <= 4e+56)
		tmp = fma(0.125, x, t);
	else
		tmp = fma(y, Float64(z * -0.5), t);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(y * z), $MachinePrecision], -4e-16], N[(y * N[(z * -0.5), $MachinePrecision] + N[(x * 0.125), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(y * z), $MachinePrecision], 4e+56], N[(0.125 * x + t), $MachinePrecision], N[(y * N[(z * -0.5), $MachinePrecision] + t), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 y z) < -3.9999999999999999e-16

   1. Initial program 100.0%

      \[\left(\frac{1}{8} \cdot x - \frac{y \cdot z}{2}\right) + t \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

      1. cancel-sign-sub-inv N/A

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. accelerator-lowering-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. *-lowering-*.f64 N/A

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

      10. *-lowering-*.f64 87.0

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

   5. Simplified 87.0%

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

   if -3.9999999999999999e-16 < (*.f64 y z) < 4.00000000000000037e56

   1. Initial program 100.0%

      \[\left(\frac{1}{8} \cdot x - \frac{y \cdot z}{2}\right) + t \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{1}{8} \cdot x + t} \]

      2. accelerator-lowering-fma.f64 94.1

         \[\leadsto \color{blue}{\mathsf{fma}\left(0.125, x, t\right)} \]

   5. Simplified 94.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(0.125, x, t\right)} \]

   if 4.00000000000000037e56 < (*.f64 y z)

   1. Initial program 100.0%

      \[\left(\frac{1}{8} \cdot x - \frac{y \cdot z}{2}\right) + t \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. cancel-sign-sub-inv N/A

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. accelerator-lowering-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. *-lowering-*.f64 89.6

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

   5. Simplified 89.6%

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

4. Final simplification 91.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \cdot z \leq -4 \cdot 10^{-16}:\\ \;\;\;\;\mathsf{fma}\left(y, z \cdot -0.5, x \cdot 0.125\right)\\ \mathbf{elif}\;y \cdot z \leq 4 \cdot 10^{+56}:\\ \;\;\;\;\mathsf{fma}\left(0.125, x, t\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, z \cdot -0.5, t\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 87.5% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(y, z \cdot -0.5, t\right)\\ \mathbf{if}\;y \cdot z \leq -2 \cdot 10^{-9}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \cdot z \leq 4 \cdot 10^{+56}:\\ \;\;\;\;\mathsf{fma}\left(0.125, x, t\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (fma y (* z -0.5) t)))
   (if (<= (* y z) -2e-9) t_1 (if (<= (* y z) 4e+56) (fma 0.125 x t) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = fma(y, (z * -0.5), t);
	double tmp;
	if ((y * z) <= -2e-9) {
		tmp = t_1;
	} else if ((y * z) <= 4e+56) {
		tmp = fma(0.125, x, t);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = fma(y, Float64(z * -0.5), t)
	tmp = 0.0
	if (Float64(y * z) <= -2e-9)
		tmp = t_1;
	elseif (Float64(y * z) <= 4e+56)
		tmp = fma(0.125, x, t);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(y * N[(z * -0.5), $MachinePrecision] + t), $MachinePrecision]}, If[LessEqual[N[(y * z), $MachinePrecision], -2e-9], t$95$1, If[LessEqual[N[(y * z), $MachinePrecision], 4e+56], N[(0.125 * x + t), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y z) < -2.00000000000000012e-9 or 4.00000000000000037e56 < (*.f64 y z)

   1. Initial program 100.0%

      \[\left(\frac{1}{8} \cdot x - \frac{y \cdot z}{2}\right) + t \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. cancel-sign-sub-inv N/A

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. accelerator-lowering-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. *-lowering-*.f64 85.8

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

   5. Simplified 85.8%

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

   if -2.00000000000000012e-9 < (*.f64 y z) < 4.00000000000000037e56

   1. Initial program 100.0%

      \[\left(\frac{1}{8} \cdot x - \frac{y \cdot z}{2}\right) + t \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{1}{8} \cdot x + t} \]

      2. accelerator-lowering-fma.f64 93.5

         \[\leadsto \color{blue}{\mathsf{fma}\left(0.125, x, t\right)} \]

   5. Simplified 93.5%

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

Alternative 5: 82.7% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := y \cdot \left(z \cdot -0.5\right)\\ \mathbf{if}\;y \cdot z \leq -2 \cdot 10^{+49}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \cdot z \leq 4 \cdot 10^{+60}:\\ \;\;\;\;\mathsf{fma}\left(0.125, x, t\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* y (* z -0.5))))
   (if (<= (* y z) -2e+49) t_1 (if (<= (* y z) 4e+60) (fma 0.125 x t) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = y * (z * -0.5);
	double tmp;
	if ((y * z) <= -2e+49) {
		tmp = t_1;
	} else if ((y * z) <= 4e+60) {
		tmp = fma(0.125, x, t);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(y * Float64(z * -0.5))
	tmp = 0.0
	if (Float64(y * z) <= -2e+49)
		tmp = t_1;
	elseif (Float64(y * z) <= 4e+60)
		tmp = fma(0.125, x, t);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(y * N[(z * -0.5), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(y * z), $MachinePrecision], -2e+49], t$95$1, If[LessEqual[N[(y * z), $MachinePrecision], 4e+60], N[(0.125 * x + t), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y z) < -1.99999999999999989e49 or 3.9999999999999998e60 < (*.f64 y z)

   1. Initial program 100.0%

      \[\left(\frac{1}{8} \cdot x - \frac{y \cdot z}{2}\right) + t \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. *-lowering-*.f64 N/A

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

      5. *-commutative N/A

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

      6. *-lowering-*.f64 80.4

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

   5. Simplified 80.4%

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

   if -1.99999999999999989e49 < (*.f64 y z) < 3.9999999999999998e60

   1. Initial program 100.0%

      \[\left(\frac{1}{8} \cdot x - \frac{y \cdot z}{2}\right) + t \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{1}{8} \cdot x + t} \]

      2. accelerator-lowering-fma.f64 89.0

         \[\leadsto \color{blue}{\mathsf{fma}\left(0.125, x, t\right)} \]

   5. Simplified 89.0%

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

Alternative 6: 64.5% accurate, 5.6× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(0.125, x, t\right) \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (fma 0.125 x t))

C

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

Julia

function code(x, y, z, t)
	return fma(0.125, x, t)
end

Wolfram

code[x_, y_, z_, t_] := N[(0.125 * x + t), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\left(\frac{1}{8} \cdot x - \frac{y \cdot z}{2}\right) + t \]
2. Add Preprocessing

3. Taylor expanded in y around 0

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

   1. +-commutative N/A

      \[\leadsto \color{blue}{\frac{1}{8} \cdot x + t} \]

   2. accelerator-lowering-fma.f64 62.4

      \[\leadsto \color{blue}{\mathsf{fma}\left(0.125, x, t\right)} \]

5. Simplified 62.4%

   \[\leadsto \color{blue}{\mathsf{fma}\left(0.125, x, t\right)} \]
6. Add Preprocessing

Alternative 7: 32.6% accurate, 39.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := t

Derivation

1. Initial program 100.0%

   \[\left(\frac{1}{8} \cdot x - \frac{y \cdot z}{2}\right) + t \]
2. Add Preprocessing

3. Taylor expanded in t around inf

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

5. Simplified 31.0%

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

Developer Target 1: 100.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \left(\frac{x}{8} + t\right) - \frac{z}{2} \cdot y \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (- (+ (/ x 8.0) t) (* (/ z 2.0) y)))

C

double code(double x, double y, double z, double t) {
	return ((x / 8.0) + t) - ((z / 2.0) * y);
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = ((x / 8.0d0) + t) - ((z / 2.0d0) * y)
end function

Java

public static double code(double x, double y, double z, double t) {
	return ((x / 8.0) + t) - ((z / 2.0) * y);
}

Python

def code(x, y, z, t):
	return ((x / 8.0) + t) - ((z / 2.0) * y)

Julia

function code(x, y, z, t)
	return Float64(Float64(Float64(x / 8.0) + t) - Float64(Float64(z / 2.0) * y))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = ((x / 8.0) + t) - ((z / 2.0) * y);
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(N[(x / 8.0), $MachinePrecision] + t), $MachinePrecision] - N[(N[(z / 2.0), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2024205 
(FPCore (x y z t)
  :name "Diagrams.Solve.Polynomial:quartForm  from diagrams-solve-0.1, B"
  :precision binary64

  :alt
  (! :herbie-platform default (- (+ (/ x 8) t) (* (/ z 2) y)))

  (+ (- (* (/ 1.0 8.0) x) (/ (* y z) 2.0)) t))