FastMath dist4

Percentage Accurate: 87.6% → 100.0%

Time: 13.0s

Alternatives: 10

Speedup: 2.0×

• 66.1% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

FPCore

(FPCore (d1 d2 d3 d4)
  :precision binary64
  (- (+ (- (* d1 d2) (* d1 d3)) (* d4 d1)) (* d1 d1)))

C

double code(double d1, double d2, double d3, double d4) {
	return (((d1 * d2) - (d1 * d3)) + (d4 * d1)) - (d1 * d1);
}

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(d1, d2, d3, d4)
use fmin_fmax_functions
    real(8), intent (in) :: d1
    real(8), intent (in) :: d2
    real(8), intent (in) :: d3
    real(8), intent (in) :: d4
    code = (((d1 * d2) - (d1 * d3)) + (d4 * d1)) - (d1 * d1)
end function

Java

public static double code(double d1, double d2, double d3, double d4) {
	return (((d1 * d2) - (d1 * d3)) + (d4 * d1)) - (d1 * d1);
}

Python

def code(d1, d2, d3, d4):
	return (((d1 * d2) - (d1 * d3)) + (d4 * d1)) - (d1 * d1)

Julia

function code(d1, d2, d3, d4)
	return Float64(Float64(Float64(Float64(d1 * d2) - Float64(d1 * d3)) + Float64(d4 * d1)) - Float64(d1 * d1))
end

MATLAB

function tmp = code(d1, d2, d3, d4)
	tmp = (((d1 * d2) - (d1 * d3)) + (d4 * d1)) - (d1 * d1);
end

Wolfram

code[d1_, d2_, d3_, d4_] := N[(N[(N[(N[(d1 * d2), $MachinePrecision] - N[(d1 * d3), $MachinePrecision]), $MachinePrecision] + N[(d4 * d1), $MachinePrecision]), $MachinePrecision] - N[(d1 * d1), $MachinePrecision]), $MachinePrecision]

Initial Program: 87.6% accurate, 1.0× speedup

Math

\[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

FPCore

(FPCore (d1 d2 d3 d4)
  :precision binary64
  (- (+ (- (* d1 d2) (* d1 d3)) (* d4 d1)) (* d1 d1)))

C

double code(double d1, double d2, double d3, double d4) {
	return (((d1 * d2) - (d1 * d3)) + (d4 * d1)) - (d1 * d1);
}

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(d1, d2, d3, d4)
use fmin_fmax_functions
    real(8), intent (in) :: d1
    real(8), intent (in) :: d2
    real(8), intent (in) :: d3
    real(8), intent (in) :: d4
    code = (((d1 * d2) - (d1 * d3)) + (d4 * d1)) - (d1 * d1)
end function

Java

public static double code(double d1, double d2, double d3, double d4) {
	return (((d1 * d2) - (d1 * d3)) + (d4 * d1)) - (d1 * d1);
}

Python

def code(d1, d2, d3, d4):
	return (((d1 * d2) - (d1 * d3)) + (d4 * d1)) - (d1 * d1)

Julia

function code(d1, d2, d3, d4)
	return Float64(Float64(Float64(Float64(d1 * d2) - Float64(d1 * d3)) + Float64(d4 * d1)) - Float64(d1 * d1))
end

MATLAB

function tmp = code(d1, d2, d3, d4)
	tmp = (((d1 * d2) - (d1 * d3)) + (d4 * d1)) - (d1 * d1);
end

Wolfram

code[d1_, d2_, d3_, d4_] := N[(N[(N[(N[(d1 * d2), $MachinePrecision] - N[(d1 * d3), $MachinePrecision]), $MachinePrecision] + N[(d4 * d1), $MachinePrecision]), $MachinePrecision] - N[(d1 * d1), $MachinePrecision]), $MachinePrecision]

Alternative 1: 100.0% accurate, 1.1× speedup

Math

\[\mathsf{134\_z0z1z2z3z4}\left(1, \left(d2 - \left(d1 - d4\right)\right), d1, d3, d1\right) \]

FPCore

(FPCore (d1 d2 d3 d4)
  :precision binary64
  (134-z0z1z2z3z4 1 (- d2 (- d1 d4)) d1 d3 d1))

Derivation

1. Initial program 87.6%

   \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
2. Step-by-step derivation

   1. lift--.f64 N/A

      \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1} \]

   2. lift-+.f64 N/A

      \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right)} - d1 \cdot d1 \]

   3. associate--l+ N/A

      \[\leadsto \color{blue}{\left(d1 \cdot d2 - d1 \cdot d3\right) + \left(d4 \cdot d1 - d1 \cdot d1\right)} \]

   4. lift--.f64 N/A

      \[\leadsto \color{blue}{\left(d1 \cdot d2 - d1 \cdot d3\right)} + \left(d4 \cdot d1 - d1 \cdot d1\right) \]

   5. lift-*.f64 N/A

      \[\leadsto \left(d1 \cdot d2 - \color{blue}{d1 \cdot d3}\right) + \left(d4 \cdot d1 - d1 \cdot d1\right) \]

   6. fp-cancel-sub-sign-inv N/A

      \[\leadsto \color{blue}{\left(d1 \cdot d2 + \left(\mathsf{neg}\left(d1\right)\right) \cdot d3\right)} + \left(d4 \cdot d1 - d1 \cdot d1\right) \]

   7. +-commutative N/A

      \[\leadsto \color{blue}{\left(\left(\mathsf{neg}\left(d1\right)\right) \cdot d3 + d1 \cdot d2\right)} + \left(d4 \cdot d1 - d1 \cdot d1\right) \]

   8. associate-+l+ N/A

      \[\leadsto \color{blue}{\left(\mathsf{neg}\left(d1\right)\right) \cdot d3 + \left(d1 \cdot d2 + \left(d4 \cdot d1 - d1 \cdot d1\right)\right)} \]

   9. sum-to-mult N/A

      \[\leadsto \color{blue}{\left(1 + \frac{d1 \cdot d2 + \left(d4 \cdot d1 - d1 \cdot d1\right)}{\left(\mathsf{neg}\left(d1\right)\right) \cdot d3}\right) \cdot \left(\left(\mathsf{neg}\left(d1\right)\right) \cdot d3\right)} \]

   10. add-flip-rev N/A

       \[\leadsto \left(1 + \frac{\color{blue}{d1 \cdot d2 - \left(\mathsf{neg}\left(\left(d4 \cdot d1 - d1 \cdot d1\right)\right)\right)}}{\left(\mathsf{neg}\left(d1\right)\right) \cdot d3}\right) \cdot \left(\left(\mathsf{neg}\left(d1\right)\right) \cdot d3\right) \]

   11. sub-negate-rev N/A

       \[\leadsto \left(1 + \frac{d1 \cdot d2 - \color{blue}{\left(d1 \cdot d1 - d4 \cdot d1\right)}}{\left(\mathsf{neg}\left(d1\right)\right) \cdot d3}\right) \cdot \left(\left(\mathsf{neg}\left(d1\right)\right) \cdot d3\right) \]

   12. lower-unsound-*.f64 N/A

       \[\leadsto \color{blue}{\left(1 + \frac{d1 \cdot d2 - \left(d1 \cdot d1 - d4 \cdot d1\right)}{\left(\mathsf{neg}\left(d1\right)\right) \cdot d3}\right) \cdot \left(\left(\mathsf{neg}\left(d1\right)\right) \cdot d3\right)} \]

3. Applied rewrites 70.4%

   \[\leadsto \color{blue}{\left(1 + \frac{d1 \cdot \left(d2 - \left(d1 - d4\right)\right)}{\left(-d1\right) \cdot d3}\right) \cdot \left(\left(-d1\right) \cdot d3\right)} \]
4. Step-by-step derivation

   1. lift-*.f64 N/A

      \[\leadsto \color{blue}{\left(1 + \frac{d1 \cdot \left(d2 - \left(d1 - d4\right)\right)}{\left(-d1\right) \cdot d3}\right) \cdot \left(\left(-d1\right) \cdot d3\right)} \]

   2. *-commutative N/A

      \[\leadsto \color{blue}{\left(\left(-d1\right) \cdot d3\right) \cdot \left(1 + \frac{d1 \cdot \left(d2 - \left(d1 - d4\right)\right)}{\left(-d1\right) \cdot d3}\right)} \]

   3. lift-+.f64 N/A

      \[\leadsto \left(\left(-d1\right) \cdot d3\right) \cdot \color{blue}{\left(1 + \frac{d1 \cdot \left(d2 - \left(d1 - d4\right)\right)}{\left(-d1\right) \cdot d3}\right)} \]

   4. lift-/.f64 N/A

      \[\leadsto \left(\left(-d1\right) \cdot d3\right) \cdot \left(1 + \color{blue}{\frac{d1 \cdot \left(d2 - \left(d1 - d4\right)\right)}{\left(-d1\right) \cdot d3}}\right) \]

   5. add-to-fraction N/A

      \[\leadsto \left(\left(-d1\right) \cdot d3\right) \cdot \color{blue}{\frac{1 \cdot \left(\left(-d1\right) \cdot d3\right) + d1 \cdot \left(d2 - \left(d1 - d4\right)\right)}{\left(-d1\right) \cdot d3}} \]

   6. associate-*r/ N/A

      \[\leadsto \color{blue}{\frac{\left(\left(-d1\right) \cdot d3\right) \cdot \left(1 \cdot \left(\left(-d1\right) \cdot d3\right) + d1 \cdot \left(d2 - \left(d1 - d4\right)\right)\right)}{\left(-d1\right) \cdot d3}} \]

   7. *-rgt-identity N/A

      \[\leadsto \frac{\left(\left(-d1\right) \cdot d3\right) \cdot \left(1 \cdot \left(\left(-d1\right) \cdot d3\right) + d1 \cdot \left(d2 - \left(d1 - d4\right)\right)\right)}{\color{blue}{\left(\left(-d1\right) \cdot d3\right) \cdot 1}} \]

   8. times-frac N/A

      \[\leadsto \color{blue}{\frac{\left(-d1\right) \cdot d3}{\left(-d1\right) \cdot d3} \cdot \frac{1 \cdot \left(\left(-d1\right) \cdot d3\right) + d1 \cdot \left(d2 - \left(d1 - d4\right)\right)}{1}} \]

   9. *-inverses N/A

      \[\leadsto \color{blue}{1} \cdot \frac{1 \cdot \left(\left(-d1\right) \cdot d3\right) + d1 \cdot \left(d2 - \left(d1 - d4\right)\right)}{1} \]

5. Applied rewrites 100.0%

   \[\leadsto \color{blue}{\mathsf{134\_z0z1z2z3z4}\left(1, \left(d2 - \left(d1 - d4\right)\right), d1, d3, d1\right)} \]
6. Add Preprocessing

Alternative 2: 100.0% accurate, 2.0× speedup

Math

\[d1 \cdot \left(\left(d4 - \left(d3 - d2\right)\right) - d1\right) \]

FPCore

(FPCore (d1 d2 d3 d4)
  :precision binary64
  (* d1 (- (- d4 (- d3 d2)) d1)))

C

double code(double d1, double d2, double d3, double d4) {
	return d1 * ((d4 - (d3 - d2)) - d1);
}

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(d1, d2, d3, d4)
use fmin_fmax_functions
    real(8), intent (in) :: d1
    real(8), intent (in) :: d2
    real(8), intent (in) :: d3
    real(8), intent (in) :: d4
    code = d1 * ((d4 - (d3 - d2)) - d1)
end function

Java

public static double code(double d1, double d2, double d3, double d4) {
	return d1 * ((d4 - (d3 - d2)) - d1);
}

Python

def code(d1, d2, d3, d4):
	return d1 * ((d4 - (d3 - d2)) - d1)

Julia

function code(d1, d2, d3, d4)
	return Float64(d1 * Float64(Float64(d4 - Float64(d3 - d2)) - d1))
end

MATLAB

function tmp = code(d1, d2, d3, d4)
	tmp = d1 * ((d4 - (d3 - d2)) - d1);
end

Wolfram

code[d1_, d2_, d3_, d4_] := N[(d1 * N[(N[(d4 - N[(d3 - d2), $MachinePrecision]), $MachinePrecision] - d1), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 87.6%

   \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
2. Step-by-step derivation

   1. lift--.f64 N/A

      \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1} \]

   2. lift-*.f64 N/A

      \[\leadsto \left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - \color{blue}{d1 \cdot d1} \]

   3. lift-+.f64 N/A

      \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right)} - d1 \cdot d1 \]

   4. lift--.f64 N/A

      \[\leadsto \left(\color{blue}{\left(d1 \cdot d2 - d1 \cdot d3\right)} + d4 \cdot d1\right) - d1 \cdot d1 \]

   5. lift-*.f64 N/A

      \[\leadsto \left(\left(\color{blue}{d1 \cdot d2} - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

   6. lift-*.f64 N/A

      \[\leadsto \left(\left(d1 \cdot d2 - \color{blue}{d1 \cdot d3}\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

   7. distribute-lft-out-- N/A

      \[\leadsto \left(\color{blue}{d1 \cdot \left(d2 - d3\right)} + d4 \cdot d1\right) - d1 \cdot d1 \]

   8. lift-*.f64 N/A

      \[\leadsto \left(d1 \cdot \left(d2 - d3\right) + \color{blue}{d4 \cdot d1}\right) - d1 \cdot d1 \]

   9. *-commutative N/A

      \[\leadsto \left(d1 \cdot \left(d2 - d3\right) + \color{blue}{d1 \cdot d4}\right) - d1 \cdot d1 \]

   10. distribute-lft-out N/A

       \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 - d3\right) + d4\right)} - d1 \cdot d1 \]

   11. *-commutative N/A

       \[\leadsto \color{blue}{\left(\left(d2 - d3\right) + d4\right) \cdot d1} - d1 \cdot d1 \]

   12. distribute-rgt-out-- N/A

       \[\leadsto \color{blue}{d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

   13. lower-*.f64 N/A

       \[\leadsto \color{blue}{d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

   14. lower--.f64 N/A

       \[\leadsto d1 \cdot \color{blue}{\left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

   15. +-commutative N/A

       \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 + \left(d2 - d3\right)\right)} - d1\right) \]

   16. sub-negate-rev N/A

       \[\leadsto d1 \cdot \left(\left(d4 + \color{blue}{\left(\mathsf{neg}\left(\left(d3 - d2\right)\right)\right)}\right) - d1\right) \]

   17. sub-flip-reverse N/A

       \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 - \left(d3 - d2\right)\right)} - d1\right) \]

   18. lower--.f64 N/A

       \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 - \left(d3 - d2\right)\right)} - d1\right) \]

   19. lower--.f64 100.0%

       \[\leadsto d1 \cdot \left(\left(d4 - \color{blue}{\left(d3 - d2\right)}\right) - d1\right) \]

3. Applied rewrites 100.0%

   \[\leadsto \color{blue}{d1 \cdot \left(\left(d4 - \left(d3 - d2\right)\right) - d1\right)} \]
4. Add Preprocessing

Alternative 3: 92.8% accurate, 1.2× speedup

Math

\[\begin{array}{l} t_0 := d1 \cdot \left(\left(d2 + d4\right) - d3\right)\\ \mathbf{if}\;d3 \leq -229999999999999999290359762639025511268071539853072692112773550985996570528611298045047912140485482102443255603953099588199002533076664320:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;d3 \leq 174999999999999995069302646809894275956724709459585730600186872097406976:\\ \;\;\;\;d1 \cdot \left(\left(d2 + d4\right) - d1\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \]

FPCore

(FPCore (d1 d2 d3 d4)
  :precision binary64
  (let* ((t_0 (* d1 (- (+ d2 d4) d3))))
  (if (<=
       d3
       -229999999999999999290359762639025511268071539853072692112773550985996570528611298045047912140485482102443255603953099588199002533076664320)
    t_0
    (if (<=
         d3
         174999999999999995069302646809894275956724709459585730600186872097406976)
      (* d1 (- (+ d2 d4) d1))
      t_0))))

C

double code(double d1, double d2, double d3, double d4) {
	double t_0 = d1 * ((d2 + d4) - d3);
	double tmp;
	if (d3 <= -2.3e+137) {
		tmp = t_0;
	} else if (d3 <= 1.75e+71) {
		tmp = d1 * ((d2 + d4) - d1);
	} else {
		tmp = 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(d1, d2, d3, d4)
use fmin_fmax_functions
    real(8), intent (in) :: d1
    real(8), intent (in) :: d2
    real(8), intent (in) :: d3
    real(8), intent (in) :: d4
    real(8) :: t_0
    real(8) :: tmp
    t_0 = d1 * ((d2 + d4) - d3)
    if (d3 <= (-2.3d+137)) then
        tmp = t_0
    else if (d3 <= 1.75d+71) then
        tmp = d1 * ((d2 + d4) - d1)
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double d1, double d2, double d3, double d4) {
	double t_0 = d1 * ((d2 + d4) - d3);
	double tmp;
	if (d3 <= -2.3e+137) {
		tmp = t_0;
	} else if (d3 <= 1.75e+71) {
		tmp = d1 * ((d2 + d4) - d1);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(d1, d2, d3, d4):
	t_0 = d1 * ((d2 + d4) - d3)
	tmp = 0
	if d3 <= -2.3e+137:
		tmp = t_0
	elif d3 <= 1.75e+71:
		tmp = d1 * ((d2 + d4) - d1)
	else:
		tmp = t_0
	return tmp

Julia

function code(d1, d2, d3, d4)
	t_0 = Float64(d1 * Float64(Float64(d2 + d4) - d3))
	tmp = 0.0
	if (d3 <= -2.3e+137)
		tmp = t_0;
	elseif (d3 <= 1.75e+71)
		tmp = Float64(d1 * Float64(Float64(d2 + d4) - d1));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(d1, d2, d3, d4)
	t_0 = d1 * ((d2 + d4) - d3);
	tmp = 0.0;
	if (d3 <= -2.3e+137)
		tmp = t_0;
	elseif (d3 <= 1.75e+71)
		tmp = d1 * ((d2 + d4) - d1);
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[d1_, d2_, d3_, d4_] := Block[{t$95$0 = N[(d1 * N[(N[(d2 + d4), $MachinePrecision] - d3), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[d3, -229999999999999999290359762639025511268071539853072692112773550985996570528611298045047912140485482102443255603953099588199002533076664320], t$95$0, If[LessEqual[d3, 174999999999999995069302646809894275956724709459585730600186872097406976], N[(d1 * N[(N[(d2 + d4), $MachinePrecision] - d1), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if d3 < -2.3e137 or 1.75e71 < d3

   1. Initial program 87.6%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1} \]

      2. lift-*.f64 N/A

         \[\leadsto \left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - \color{blue}{d1 \cdot d1} \]

      3. lift-+.f64 N/A

         \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right)} - d1 \cdot d1 \]

      4. lift--.f64 N/A

         \[\leadsto \left(\color{blue}{\left(d1 \cdot d2 - d1 \cdot d3\right)} + d4 \cdot d1\right) - d1 \cdot d1 \]

      5. lift-*.f64 N/A

         \[\leadsto \left(\left(\color{blue}{d1 \cdot d2} - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

      6. lift-*.f64 N/A

         \[\leadsto \left(\left(d1 \cdot d2 - \color{blue}{d1 \cdot d3}\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

      7. distribute-lft-out-- N/A

         \[\leadsto \left(\color{blue}{d1 \cdot \left(d2 - d3\right)} + d4 \cdot d1\right) - d1 \cdot d1 \]

      8. lift-*.f64 N/A

         \[\leadsto \left(d1 \cdot \left(d2 - d3\right) + \color{blue}{d4 \cdot d1}\right) - d1 \cdot d1 \]

      9. *-commutative N/A

         \[\leadsto \left(d1 \cdot \left(d2 - d3\right) + \color{blue}{d1 \cdot d4}\right) - d1 \cdot d1 \]

      10. distribute-lft-out N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 - d3\right) + d4\right)} - d1 \cdot d1 \]

      11. *-commutative N/A

          \[\leadsto \color{blue}{\left(\left(d2 - d3\right) + d4\right) \cdot d1} - d1 \cdot d1 \]

      12. distribute-rgt-out-- N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      13. lower-*.f64 N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      14. lower--.f64 N/A

          \[\leadsto d1 \cdot \color{blue}{\left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      15. +-commutative N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 + \left(d2 - d3\right)\right)} - d1\right) \]

      16. sub-negate-rev N/A

          \[\leadsto d1 \cdot \left(\left(d4 + \color{blue}{\left(\mathsf{neg}\left(\left(d3 - d2\right)\right)\right)}\right) - d1\right) \]

      17. sub-flip-reverse N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 - \left(d3 - d2\right)\right)} - d1\right) \]

      18. lower--.f64 N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 - \left(d3 - d2\right)\right)} - d1\right) \]

      19. lower--.f64 100.0%

          \[\leadsto d1 \cdot \left(\left(d4 - \color{blue}{\left(d3 - d2\right)}\right) - d1\right) \]

   3. Applied rewrites 100.0%

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d4 - \left(d3 - d2\right)\right) - d1\right)} \]

   4. Taylor expanded in d1 around 0

      \[\leadsto d1 \cdot \color{blue}{\left(\left(d2 + d4\right) - d3\right)} \]
   5. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto d1 \cdot \left(\left(d2 + d4\right) - \color{blue}{d3}\right) \]

      2. lower-+.f64 80.7%

         \[\leadsto d1 \cdot \left(\left(d2 + d4\right) - d3\right) \]

   6. Applied rewrites 80.7%

      \[\leadsto d1 \cdot \color{blue}{\left(\left(d2 + d4\right) - d3\right)} \]

   if -2.3e137 < d3 < 1.75e71

   1. Initial program 87.6%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1} \]

      2. lift-*.f64 N/A

         \[\leadsto \left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - \color{blue}{d1 \cdot d1} \]

      3. lift-+.f64 N/A

         \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right)} - d1 \cdot d1 \]

      4. lift--.f64 N/A

         \[\leadsto \left(\color{blue}{\left(d1 \cdot d2 - d1 \cdot d3\right)} + d4 \cdot d1\right) - d1 \cdot d1 \]

      5. lift-*.f64 N/A

         \[\leadsto \left(\left(\color{blue}{d1 \cdot d2} - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

      6. lift-*.f64 N/A

         \[\leadsto \left(\left(d1 \cdot d2 - \color{blue}{d1 \cdot d3}\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

      7. distribute-lft-out-- N/A

         \[\leadsto \left(\color{blue}{d1 \cdot \left(d2 - d3\right)} + d4 \cdot d1\right) - d1 \cdot d1 \]

      8. lift-*.f64 N/A

         \[\leadsto \left(d1 \cdot \left(d2 - d3\right) + \color{blue}{d4 \cdot d1}\right) - d1 \cdot d1 \]

      9. *-commutative N/A

         \[\leadsto \left(d1 \cdot \left(d2 - d3\right) + \color{blue}{d1 \cdot d4}\right) - d1 \cdot d1 \]

      10. distribute-lft-out N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 - d3\right) + d4\right)} - d1 \cdot d1 \]

      11. *-commutative N/A

          \[\leadsto \color{blue}{\left(\left(d2 - d3\right) + d4\right) \cdot d1} - d1 \cdot d1 \]

      12. distribute-rgt-out-- N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      13. lower-*.f64 N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      14. lower--.f64 N/A

          \[\leadsto d1 \cdot \color{blue}{\left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      15. +-commutative N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 + \left(d2 - d3\right)\right)} - d1\right) \]

      16. sub-negate-rev N/A

          \[\leadsto d1 \cdot \left(\left(d4 + \color{blue}{\left(\mathsf{neg}\left(\left(d3 - d2\right)\right)\right)}\right) - d1\right) \]

      17. sub-flip-reverse N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 - \left(d3 - d2\right)\right)} - d1\right) \]

      18. lower--.f64 N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 - \left(d3 - d2\right)\right)} - d1\right) \]

      19. lower--.f64 100.0%

          \[\leadsto d1 \cdot \left(\left(d4 - \color{blue}{\left(d3 - d2\right)}\right) - d1\right) \]

   3. Applied rewrites 100.0%

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d4 - \left(d3 - d2\right)\right) - d1\right)} \]

   4. Taylor expanded in d3 around 0

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 + d4\right) - d1\right)} \]
   5. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto d1 \cdot \color{blue}{\left(\left(d2 + d4\right) - d1\right)} \]

      2. lower--.f64 N/A

         \[\leadsto d1 \cdot \left(\left(d2 + d4\right) - \color{blue}{d1}\right) \]

      3. lower-+.f64 77.0%

         \[\leadsto d1 \cdot \left(\left(d2 + d4\right) - d1\right) \]

   6. Applied rewrites 77.0%

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

Alternative 4: 89.4% accurate, 0.1× speedup

Math

\[\begin{array}{l} t_0 := d1 \cdot \left(\mathsf{max}\left(d2, d4\right) - d3\right)\\ \mathbf{if}\;d3 \leq -229999999999999999290359762639025511268071539853072692112773550985996570528611298045047912140485482102443255603953099588199002533076664320:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;d3 \leq 1999999999999999876516601650563957080654054728944248956588832425077742983649199427273641055007816510603264:\\ \;\;\;\;d1 \cdot \left(\left(\mathsf{min}\left(d2, d4\right) + \mathsf{max}\left(d2, d4\right)\right) - d1\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \]

FPCore

(FPCore (d1 d2 d3 d4)
  :precision binary64
  (let* ((t_0 (* d1 (- (fmax d2 d4) d3))))
  (if (<=
       d3
       -229999999999999999290359762639025511268071539853072692112773550985996570528611298045047912140485482102443255603953099588199002533076664320)
    t_0
    (if (<=
         d3
         1999999999999999876516601650563957080654054728944248956588832425077742983649199427273641055007816510603264)
      (* d1 (- (+ (fmin d2 d4) (fmax d2 d4)) d1))
      t_0))))

C

double code(double d1, double d2, double d3, double d4) {
	double t_0 = d1 * (fmax(d2, d4) - d3);
	double tmp;
	if (d3 <= -2.3e+137) {
		tmp = t_0;
	} else if (d3 <= 2e+105) {
		tmp = d1 * ((fmin(d2, d4) + fmax(d2, d4)) - d1);
	} else {
		tmp = 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(d1, d2, d3, d4)
use fmin_fmax_functions
    real(8), intent (in) :: d1
    real(8), intent (in) :: d2
    real(8), intent (in) :: d3
    real(8), intent (in) :: d4
    real(8) :: t_0
    real(8) :: tmp
    t_0 = d1 * (fmax(d2, d4) - d3)
    if (d3 <= (-2.3d+137)) then
        tmp = t_0
    else if (d3 <= 2d+105) then
        tmp = d1 * ((fmin(d2, d4) + fmax(d2, d4)) - d1)
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double d1, double d2, double d3, double d4) {
	double t_0 = d1 * (fmax(d2, d4) - d3);
	double tmp;
	if (d3 <= -2.3e+137) {
		tmp = t_0;
	} else if (d3 <= 2e+105) {
		tmp = d1 * ((fmin(d2, d4) + fmax(d2, d4)) - d1);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(d1, d2, d3, d4):
	t_0 = d1 * (fmax(d2, d4) - d3)
	tmp = 0
	if d3 <= -2.3e+137:
		tmp = t_0
	elif d3 <= 2e+105:
		tmp = d1 * ((fmin(d2, d4) + fmax(d2, d4)) - d1)
	else:
		tmp = t_0
	return tmp

Julia

function code(d1, d2, d3, d4)
	t_0 = Float64(d1 * Float64(fmax(d2, d4) - d3))
	tmp = 0.0
	if (d3 <= -2.3e+137)
		tmp = t_0;
	elseif (d3 <= 2e+105)
		tmp = Float64(d1 * Float64(Float64(fmin(d2, d4) + fmax(d2, d4)) - d1));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(d1, d2, d3, d4)
	t_0 = d1 * (max(d2, d4) - d3);
	tmp = 0.0;
	if (d3 <= -2.3e+137)
		tmp = t_0;
	elseif (d3 <= 2e+105)
		tmp = d1 * ((min(d2, d4) + max(d2, d4)) - d1);
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[d1_, d2_, d3_, d4_] := Block[{t$95$0 = N[(d1 * N[(N[Max[d2, d4], $MachinePrecision] - d3), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[d3, -229999999999999999290359762639025511268071539853072692112773550985996570528611298045047912140485482102443255603953099588199002533076664320], t$95$0, If[LessEqual[d3, 1999999999999999876516601650563957080654054728944248956588832425077742983649199427273641055007816510603264], N[(d1 * N[(N[(N[Min[d2, d4], $MachinePrecision] + N[Max[d2, d4], $MachinePrecision]), $MachinePrecision] - d1), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if d3 < -2.3e137 or 1.9999999999999999e105 < d3

   1. Initial program 87.6%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1} \]

      2. lift-*.f64 N/A

         \[\leadsto \left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - \color{blue}{d1 \cdot d1} \]

      3. lift-+.f64 N/A

         \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right)} - d1 \cdot d1 \]

      4. lift--.f64 N/A

         \[\leadsto \left(\color{blue}{\left(d1 \cdot d2 - d1 \cdot d3\right)} + d4 \cdot d1\right) - d1 \cdot d1 \]

      5. lift-*.f64 N/A

         \[\leadsto \left(\left(\color{blue}{d1 \cdot d2} - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

      6. lift-*.f64 N/A

         \[\leadsto \left(\left(d1 \cdot d2 - \color{blue}{d1 \cdot d3}\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

      7. distribute-lft-out-- N/A

         \[\leadsto \left(\color{blue}{d1 \cdot \left(d2 - d3\right)} + d4 \cdot d1\right) - d1 \cdot d1 \]

      8. lift-*.f64 N/A

         \[\leadsto \left(d1 \cdot \left(d2 - d3\right) + \color{blue}{d4 \cdot d1}\right) - d1 \cdot d1 \]

      9. *-commutative N/A

         \[\leadsto \left(d1 \cdot \left(d2 - d3\right) + \color{blue}{d1 \cdot d4}\right) - d1 \cdot d1 \]

      10. distribute-lft-out N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 - d3\right) + d4\right)} - d1 \cdot d1 \]

      11. *-commutative N/A

          \[\leadsto \color{blue}{\left(\left(d2 - d3\right) + d4\right) \cdot d1} - d1 \cdot d1 \]

      12. distribute-rgt-out-- N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      13. lower-*.f64 N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      14. lower--.f64 N/A

          \[\leadsto d1 \cdot \color{blue}{\left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      15. +-commutative N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 + \left(d2 - d3\right)\right)} - d1\right) \]

      16. sub-negate-rev N/A

          \[\leadsto d1 \cdot \left(\left(d4 + \color{blue}{\left(\mathsf{neg}\left(\left(d3 - d2\right)\right)\right)}\right) - d1\right) \]

      17. sub-flip-reverse N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 - \left(d3 - d2\right)\right)} - d1\right) \]

      18. lower--.f64 N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 - \left(d3 - d2\right)\right)} - d1\right) \]

      19. lower--.f64 100.0%

          \[\leadsto d1 \cdot \left(\left(d4 - \color{blue}{\left(d3 - d2\right)}\right) - d1\right) \]

   3. Applied rewrites 100.0%

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d4 - \left(d3 - d2\right)\right) - d1\right)} \]

   4. Taylor expanded in d1 around 0

      \[\leadsto d1 \cdot \color{blue}{\left(\left(d2 + d4\right) - d3\right)} \]
   5. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto d1 \cdot \left(\left(d2 + d4\right) - \color{blue}{d3}\right) \]

      2. lower-+.f64 80.7%

         \[\leadsto d1 \cdot \left(\left(d2 + d4\right) - d3\right) \]

   6. Applied rewrites 80.7%

      \[\leadsto d1 \cdot \color{blue}{\left(\left(d2 + d4\right) - d3\right)} \]

   7. Taylor expanded in d2 around 0

      \[\leadsto d1 \cdot \left(d4 - d3\right) \]
   8. Step-by-step derivation

   9. Applied rewrites 56.9%

      \[\leadsto d1 \cdot \left(d4 - d3\right) \]

   if -2.3e137 < d3 < 1.9999999999999999e105

   1. Initial program 87.6%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1} \]

      2. lift-*.f64 N/A

         \[\leadsto \left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - \color{blue}{d1 \cdot d1} \]

      3. lift-+.f64 N/A

         \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right)} - d1 \cdot d1 \]

      4. lift--.f64 N/A

         \[\leadsto \left(\color{blue}{\left(d1 \cdot d2 - d1 \cdot d3\right)} + d4 \cdot d1\right) - d1 \cdot d1 \]

      5. lift-*.f64 N/A

         \[\leadsto \left(\left(\color{blue}{d1 \cdot d2} - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

      6. lift-*.f64 N/A

         \[\leadsto \left(\left(d1 \cdot d2 - \color{blue}{d1 \cdot d3}\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

      7. distribute-lft-out-- N/A

         \[\leadsto \left(\color{blue}{d1 \cdot \left(d2 - d3\right)} + d4 \cdot d1\right) - d1 \cdot d1 \]

      8. lift-*.f64 N/A

         \[\leadsto \left(d1 \cdot \left(d2 - d3\right) + \color{blue}{d4 \cdot d1}\right) - d1 \cdot d1 \]

      9. *-commutative N/A

         \[\leadsto \left(d1 \cdot \left(d2 - d3\right) + \color{blue}{d1 \cdot d4}\right) - d1 \cdot d1 \]

      10. distribute-lft-out N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 - d3\right) + d4\right)} - d1 \cdot d1 \]

      11. *-commutative N/A

          \[\leadsto \color{blue}{\left(\left(d2 - d3\right) + d4\right) \cdot d1} - d1 \cdot d1 \]

      12. distribute-rgt-out-- N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      13. lower-*.f64 N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      14. lower--.f64 N/A

          \[\leadsto d1 \cdot \color{blue}{\left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      15. +-commutative N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 + \left(d2 - d3\right)\right)} - d1\right) \]

      16. sub-negate-rev N/A

          \[\leadsto d1 \cdot \left(\left(d4 + \color{blue}{\left(\mathsf{neg}\left(\left(d3 - d2\right)\right)\right)}\right) - d1\right) \]

      17. sub-flip-reverse N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 - \left(d3 - d2\right)\right)} - d1\right) \]

      18. lower--.f64 N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 - \left(d3 - d2\right)\right)} - d1\right) \]

      19. lower--.f64 100.0%

          \[\leadsto d1 \cdot \left(\left(d4 - \color{blue}{\left(d3 - d2\right)}\right) - d1\right) \]

   3. Applied rewrites 100.0%

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d4 - \left(d3 - d2\right)\right) - d1\right)} \]

   4. Taylor expanded in d3 around 0

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 + d4\right) - d1\right)} \]
   5. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto d1 \cdot \color{blue}{\left(\left(d2 + d4\right) - d1\right)} \]

      2. lower--.f64 N/A

         \[\leadsto d1 \cdot \left(\left(d2 + d4\right) - \color{blue}{d1}\right) \]

      3. lower-+.f64 77.0%

         \[\leadsto d1 \cdot \left(\left(d2 + d4\right) - d1\right) \]

   6. Applied rewrites 77.0%

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

Alternative 5: 73.2% accurate, 0.1× speedup

Math

\[\begin{array}{l} \mathbf{if}\;\mathsf{max}\left(d2, d4\right) \leq 9800000000000000587202560:\\ \;\;\;\;d1 \cdot \left(\mathsf{min}\left(d2, d4\right) - d1\right)\\ \mathbf{else}:\\ \;\;\;\;d1 \cdot \left(\mathsf{max}\left(d2, d4\right) - d3\right)\\ \end{array} \]

FPCore

(FPCore (d1 d2 d3 d4)
  :precision binary64
  (if (<= (fmax d2 d4) 9800000000000000587202560)
  (* d1 (- (fmin d2 d4) d1))
  (* d1 (- (fmax d2 d4) d3))))

C

double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (fmax(d2, d4) <= 9.8e+24) {
		tmp = d1 * (fmin(d2, d4) - d1);
	} else {
		tmp = d1 * (fmax(d2, d4) - d3);
	}
	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(d1, d2, d3, d4)
use fmin_fmax_functions
    real(8), intent (in) :: d1
    real(8), intent (in) :: d2
    real(8), intent (in) :: d3
    real(8), intent (in) :: d4
    real(8) :: tmp
    if (fmax(d2, d4) <= 9.8d+24) then
        tmp = d1 * (fmin(d2, d4) - d1)
    else
        tmp = d1 * (fmax(d2, d4) - d3)
    end if
    code = tmp
end function

Java

public static double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (fmax(d2, d4) <= 9.8e+24) {
		tmp = d1 * (fmin(d2, d4) - d1);
	} else {
		tmp = d1 * (fmax(d2, d4) - d3);
	}
	return tmp;
}

Python

def code(d1, d2, d3, d4):
	tmp = 0
	if fmax(d2, d4) <= 9.8e+24:
		tmp = d1 * (fmin(d2, d4) - d1)
	else:
		tmp = d1 * (fmax(d2, d4) - d3)
	return tmp

Julia

function code(d1, d2, d3, d4)
	tmp = 0.0
	if (fmax(d2, d4) <= 9.8e+24)
		tmp = Float64(d1 * Float64(fmin(d2, d4) - d1));
	else
		tmp = Float64(d1 * Float64(fmax(d2, d4) - d3));
	end
	return tmp
end

MATLAB

function tmp_2 = code(d1, d2, d3, d4)
	tmp = 0.0;
	if (max(d2, d4) <= 9.8e+24)
		tmp = d1 * (min(d2, d4) - d1);
	else
		tmp = d1 * (max(d2, d4) - d3);
	end
	tmp_2 = tmp;
end

Wolfram

code[d1_, d2_, d3_, d4_] := If[LessEqual[N[Max[d2, d4], $MachinePrecision], 9800000000000000587202560], N[(d1 * N[(N[Min[d2, d4], $MachinePrecision] - d1), $MachinePrecision]), $MachinePrecision], N[(d1 * N[(N[Max[d2, d4], $MachinePrecision] - d3), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if d4 < 9.8000000000000006e24

   1. Initial program 87.6%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1} \]

      2. lift-*.f64 N/A

         \[\leadsto \left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - \color{blue}{d1 \cdot d1} \]

      3. lift-+.f64 N/A

         \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right)} - d1 \cdot d1 \]

      4. lift--.f64 N/A

         \[\leadsto \left(\color{blue}{\left(d1 \cdot d2 - d1 \cdot d3\right)} + d4 \cdot d1\right) - d1 \cdot d1 \]

      5. lift-*.f64 N/A

         \[\leadsto \left(\left(\color{blue}{d1 \cdot d2} - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

      6. lift-*.f64 N/A

         \[\leadsto \left(\left(d1 \cdot d2 - \color{blue}{d1 \cdot d3}\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

      7. distribute-lft-out-- N/A

         \[\leadsto \left(\color{blue}{d1 \cdot \left(d2 - d3\right)} + d4 \cdot d1\right) - d1 \cdot d1 \]

      8. lift-*.f64 N/A

         \[\leadsto \left(d1 \cdot \left(d2 - d3\right) + \color{blue}{d4 \cdot d1}\right) - d1 \cdot d1 \]

      9. *-commutative N/A

         \[\leadsto \left(d1 \cdot \left(d2 - d3\right) + \color{blue}{d1 \cdot d4}\right) - d1 \cdot d1 \]

      10. distribute-lft-out N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 - d3\right) + d4\right)} - d1 \cdot d1 \]

      11. *-commutative N/A

          \[\leadsto \color{blue}{\left(\left(d2 - d3\right) + d4\right) \cdot d1} - d1 \cdot d1 \]

      12. distribute-rgt-out-- N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      13. lower-*.f64 N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      14. lower--.f64 N/A

          \[\leadsto d1 \cdot \color{blue}{\left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      15. +-commutative N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 + \left(d2 - d3\right)\right)} - d1\right) \]

      16. sub-negate-rev N/A

          \[\leadsto d1 \cdot \left(\left(d4 + \color{blue}{\left(\mathsf{neg}\left(\left(d3 - d2\right)\right)\right)}\right) - d1\right) \]

      17. sub-flip-reverse N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 - \left(d3 - d2\right)\right)} - d1\right) \]

      18. lower--.f64 N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 - \left(d3 - d2\right)\right)} - d1\right) \]

      19. lower--.f64 100.0%

          \[\leadsto d1 \cdot \left(\left(d4 - \color{blue}{\left(d3 - d2\right)}\right) - d1\right) \]

   3. Applied rewrites 100.0%

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d4 - \left(d3 - d2\right)\right) - d1\right)} \]

   4. Taylor expanded in d3 around 0

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 + d4\right) - d1\right)} \]
   5. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto d1 \cdot \color{blue}{\left(\left(d2 + d4\right) - d1\right)} \]

      2. lower--.f64 N/A

         \[\leadsto d1 \cdot \left(\left(d2 + d4\right) - \color{blue}{d1}\right) \]

      3. lower-+.f64 77.0%

         \[\leadsto d1 \cdot \left(\left(d2 + d4\right) - d1\right) \]

   6. Applied rewrites 77.0%

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 + d4\right) - d1\right)} \]

   7. Taylor expanded in d4 around 0

      \[\leadsto d1 \cdot \color{blue}{\left(d2 - d1\right)} \]
   8. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto d1 \cdot \left(d2 - \color{blue}{d1}\right) \]

      2. lower--.f64 54.2%

         \[\leadsto d1 \cdot \left(d2 - d1\right) \]

   9. Applied rewrites 54.2%

      \[\leadsto d1 \cdot \color{blue}{\left(d2 - d1\right)} \]

   if 9.8000000000000006e24 < d4

   1. Initial program 87.6%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1} \]

      2. lift-*.f64 N/A

         \[\leadsto \left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - \color{blue}{d1 \cdot d1} \]

      3. lift-+.f64 N/A

         \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right)} - d1 \cdot d1 \]

      4. lift--.f64 N/A

         \[\leadsto \left(\color{blue}{\left(d1 \cdot d2 - d1 \cdot d3\right)} + d4 \cdot d1\right) - d1 \cdot d1 \]

      5. lift-*.f64 N/A

         \[\leadsto \left(\left(\color{blue}{d1 \cdot d2} - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

      6. lift-*.f64 N/A

         \[\leadsto \left(\left(d1 \cdot d2 - \color{blue}{d1 \cdot d3}\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

      7. distribute-lft-out-- N/A

         \[\leadsto \left(\color{blue}{d1 \cdot \left(d2 - d3\right)} + d4 \cdot d1\right) - d1 \cdot d1 \]

      8. lift-*.f64 N/A

         \[\leadsto \left(d1 \cdot \left(d2 - d3\right) + \color{blue}{d4 \cdot d1}\right) - d1 \cdot d1 \]

      9. *-commutative N/A

         \[\leadsto \left(d1 \cdot \left(d2 - d3\right) + \color{blue}{d1 \cdot d4}\right) - d1 \cdot d1 \]

      10. distribute-lft-out N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 - d3\right) + d4\right)} - d1 \cdot d1 \]

      11. *-commutative N/A

          \[\leadsto \color{blue}{\left(\left(d2 - d3\right) + d4\right) \cdot d1} - d1 \cdot d1 \]

      12. distribute-rgt-out-- N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      13. lower-*.f64 N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      14. lower--.f64 N/A

          \[\leadsto d1 \cdot \color{blue}{\left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      15. +-commutative N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 + \left(d2 - d3\right)\right)} - d1\right) \]

      16. sub-negate-rev N/A

          \[\leadsto d1 \cdot \left(\left(d4 + \color{blue}{\left(\mathsf{neg}\left(\left(d3 - d2\right)\right)\right)}\right) - d1\right) \]

      17. sub-flip-reverse N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 - \left(d3 - d2\right)\right)} - d1\right) \]

      18. lower--.f64 N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 - \left(d3 - d2\right)\right)} - d1\right) \]

      19. lower--.f64 100.0%

          \[\leadsto d1 \cdot \left(\left(d4 - \color{blue}{\left(d3 - d2\right)}\right) - d1\right) \]

   3. Applied rewrites 100.0%

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d4 - \left(d3 - d2\right)\right) - d1\right)} \]

   4. Taylor expanded in d1 around 0

      \[\leadsto d1 \cdot \color{blue}{\left(\left(d2 + d4\right) - d3\right)} \]
   5. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto d1 \cdot \left(\left(d2 + d4\right) - \color{blue}{d3}\right) \]

      2. lower-+.f64 80.7%

         \[\leadsto d1 \cdot \left(\left(d2 + d4\right) - d3\right) \]

   6. Applied rewrites 80.7%

      \[\leadsto d1 \cdot \color{blue}{\left(\left(d2 + d4\right) - d3\right)} \]

   7. Taylor expanded in d2 around 0

      \[\leadsto d1 \cdot \left(d4 - d3\right) \]
   8. Step-by-step derivation

   9. Applied rewrites 56.9%

      \[\leadsto d1 \cdot \left(d4 - d3\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 71.1% accurate, 0.1× speedup

Math

\[\begin{array}{l} \mathbf{if}\;\mathsf{max}\left(d2, d4\right) \leq \frac{1107467480703865}{748288838313422294120286634350736906063837462003712}:\\ \;\;\;\;d1 \cdot \left(\mathsf{min}\left(d2, d4\right) - d1\right)\\ \mathbf{else}:\\ \;\;\;\;d1 \cdot \left(\mathsf{max}\left(d2, d4\right) - d1\right)\\ \end{array} \]

FPCore

(FPCore (d1 d2 d3 d4)
  :precision binary64
  (if (<=
     (fmax d2 d4)
     1107467480703865/748288838313422294120286634350736906063837462003712)
  (* d1 (- (fmin d2 d4) d1))
  (* d1 (- (fmax d2 d4) d1))))

C

double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (fmax(d2, d4) <= 1.48e-36) {
		tmp = d1 * (fmin(d2, d4) - d1);
	} else {
		tmp = d1 * (fmax(d2, d4) - d1);
	}
	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(d1, d2, d3, d4)
use fmin_fmax_functions
    real(8), intent (in) :: d1
    real(8), intent (in) :: d2
    real(8), intent (in) :: d3
    real(8), intent (in) :: d4
    real(8) :: tmp
    if (fmax(d2, d4) <= 1.48d-36) then
        tmp = d1 * (fmin(d2, d4) - d1)
    else
        tmp = d1 * (fmax(d2, d4) - d1)
    end if
    code = tmp
end function

Java

public static double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (fmax(d2, d4) <= 1.48e-36) {
		tmp = d1 * (fmin(d2, d4) - d1);
	} else {
		tmp = d1 * (fmax(d2, d4) - d1);
	}
	return tmp;
}

Python

def code(d1, d2, d3, d4):
	tmp = 0
	if fmax(d2, d4) <= 1.48e-36:
		tmp = d1 * (fmin(d2, d4) - d1)
	else:
		tmp = d1 * (fmax(d2, d4) - d1)
	return tmp

Julia

function code(d1, d2, d3, d4)
	tmp = 0.0
	if (fmax(d2, d4) <= 1.48e-36)
		tmp = Float64(d1 * Float64(fmin(d2, d4) - d1));
	else
		tmp = Float64(d1 * Float64(fmax(d2, d4) - d1));
	end
	return tmp
end

MATLAB

function tmp_2 = code(d1, d2, d3, d4)
	tmp = 0.0;
	if (max(d2, d4) <= 1.48e-36)
		tmp = d1 * (min(d2, d4) - d1);
	else
		tmp = d1 * (max(d2, d4) - d1);
	end
	tmp_2 = tmp;
end

Wolfram

code[d1_, d2_, d3_, d4_] := If[LessEqual[N[Max[d2, d4], $MachinePrecision], 1107467480703865/748288838313422294120286634350736906063837462003712], N[(d1 * N[(N[Min[d2, d4], $MachinePrecision] - d1), $MachinePrecision]), $MachinePrecision], N[(d1 * N[(N[Max[d2, d4], $MachinePrecision] - d1), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if d4 < 1.48e-36

   1. Initial program 87.6%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1} \]

      2. lift-*.f64 N/A

         \[\leadsto \left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - \color{blue}{d1 \cdot d1} \]

      3. lift-+.f64 N/A

         \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right)} - d1 \cdot d1 \]

      4. lift--.f64 N/A

         \[\leadsto \left(\color{blue}{\left(d1 \cdot d2 - d1 \cdot d3\right)} + d4 \cdot d1\right) - d1 \cdot d1 \]

      5. lift-*.f64 N/A

         \[\leadsto \left(\left(\color{blue}{d1 \cdot d2} - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

      6. lift-*.f64 N/A

         \[\leadsto \left(\left(d1 \cdot d2 - \color{blue}{d1 \cdot d3}\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

      7. distribute-lft-out-- N/A

         \[\leadsto \left(\color{blue}{d1 \cdot \left(d2 - d3\right)} + d4 \cdot d1\right) - d1 \cdot d1 \]

      8. lift-*.f64 N/A

         \[\leadsto \left(d1 \cdot \left(d2 - d3\right) + \color{blue}{d4 \cdot d1}\right) - d1 \cdot d1 \]

      9. *-commutative N/A

         \[\leadsto \left(d1 \cdot \left(d2 - d3\right) + \color{blue}{d1 \cdot d4}\right) - d1 \cdot d1 \]

      10. distribute-lft-out N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 - d3\right) + d4\right)} - d1 \cdot d1 \]

      11. *-commutative N/A

          \[\leadsto \color{blue}{\left(\left(d2 - d3\right) + d4\right) \cdot d1} - d1 \cdot d1 \]

      12. distribute-rgt-out-- N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      13. lower-*.f64 N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      14. lower--.f64 N/A

          \[\leadsto d1 \cdot \color{blue}{\left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      15. +-commutative N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 + \left(d2 - d3\right)\right)} - d1\right) \]

      16. sub-negate-rev N/A

          \[\leadsto d1 \cdot \left(\left(d4 + \color{blue}{\left(\mathsf{neg}\left(\left(d3 - d2\right)\right)\right)}\right) - d1\right) \]

      17. sub-flip-reverse N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 - \left(d3 - d2\right)\right)} - d1\right) \]

      18. lower--.f64 N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 - \left(d3 - d2\right)\right)} - d1\right) \]

      19. lower--.f64 100.0%

          \[\leadsto d1 \cdot \left(\left(d4 - \color{blue}{\left(d3 - d2\right)}\right) - d1\right) \]

   3. Applied rewrites 100.0%

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d4 - \left(d3 - d2\right)\right) - d1\right)} \]

   4. Taylor expanded in d3 around 0

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 + d4\right) - d1\right)} \]
   5. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto d1 \cdot \color{blue}{\left(\left(d2 + d4\right) - d1\right)} \]

      2. lower--.f64 N/A

         \[\leadsto d1 \cdot \left(\left(d2 + d4\right) - \color{blue}{d1}\right) \]

      3. lower-+.f64 77.0%

         \[\leadsto d1 \cdot \left(\left(d2 + d4\right) - d1\right) \]

   6. Applied rewrites 77.0%

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 + d4\right) - d1\right)} \]

   7. Taylor expanded in d4 around 0

      \[\leadsto d1 \cdot \color{blue}{\left(d2 - d1\right)} \]
   8. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto d1 \cdot \left(d2 - \color{blue}{d1}\right) \]

      2. lower--.f64 54.2%

         \[\leadsto d1 \cdot \left(d2 - d1\right) \]

   9. Applied rewrites 54.2%

      \[\leadsto d1 \cdot \color{blue}{\left(d2 - d1\right)} \]

   if 1.48e-36 < d4

   1. Initial program 87.6%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1} \]

      2. lift-*.f64 N/A

         \[\leadsto \left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - \color{blue}{d1 \cdot d1} \]

      3. lift-+.f64 N/A

         \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right)} - d1 \cdot d1 \]

      4. lift--.f64 N/A

         \[\leadsto \left(\color{blue}{\left(d1 \cdot d2 - d1 \cdot d3\right)} + d4 \cdot d1\right) - d1 \cdot d1 \]

      5. lift-*.f64 N/A

         \[\leadsto \left(\left(\color{blue}{d1 \cdot d2} - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

      6. lift-*.f64 N/A

         \[\leadsto \left(\left(d1 \cdot d2 - \color{blue}{d1 \cdot d3}\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

      7. distribute-lft-out-- N/A

         \[\leadsto \left(\color{blue}{d1 \cdot \left(d2 - d3\right)} + d4 \cdot d1\right) - d1 \cdot d1 \]

      8. lift-*.f64 N/A

         \[\leadsto \left(d1 \cdot \left(d2 - d3\right) + \color{blue}{d4 \cdot d1}\right) - d1 \cdot d1 \]

      9. *-commutative N/A

         \[\leadsto \left(d1 \cdot \left(d2 - d3\right) + \color{blue}{d1 \cdot d4}\right) - d1 \cdot d1 \]

      10. distribute-lft-out N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 - d3\right) + d4\right)} - d1 \cdot d1 \]

      11. *-commutative N/A

          \[\leadsto \color{blue}{\left(\left(d2 - d3\right) + d4\right) \cdot d1} - d1 \cdot d1 \]

      12. distribute-rgt-out-- N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      13. lower-*.f64 N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      14. lower--.f64 N/A

          \[\leadsto d1 \cdot \color{blue}{\left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      15. +-commutative N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 + \left(d2 - d3\right)\right)} - d1\right) \]

      16. sub-negate-rev N/A

          \[\leadsto d1 \cdot \left(\left(d4 + \color{blue}{\left(\mathsf{neg}\left(\left(d3 - d2\right)\right)\right)}\right) - d1\right) \]

      17. sub-flip-reverse N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 - \left(d3 - d2\right)\right)} - d1\right) \]

      18. lower--.f64 N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 - \left(d3 - d2\right)\right)} - d1\right) \]

      19. lower--.f64 100.0%

          \[\leadsto d1 \cdot \left(\left(d4 - \color{blue}{\left(d3 - d2\right)}\right) - d1\right) \]

   3. Applied rewrites 100.0%

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d4 - \left(d3 - d2\right)\right) - d1\right)} \]

   4. Taylor expanded in d3 around 0

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 + d4\right) - d1\right)} \]
   5. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto d1 \cdot \color{blue}{\left(\left(d2 + d4\right) - d1\right)} \]

      2. lower--.f64 N/A

         \[\leadsto d1 \cdot \left(\left(d2 + d4\right) - \color{blue}{d1}\right) \]

      3. lower-+.f64 77.0%

         \[\leadsto d1 \cdot \left(\left(d2 + d4\right) - d1\right) \]

   6. Applied rewrites 77.0%

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 + d4\right) - d1\right)} \]

   7. Taylor expanded in d2 around 0

      \[\leadsto d1 \cdot \left(d4 - d1\right) \]
   8. Step-by-step derivation

   9. Applied rewrites 55.1%

      \[\leadsto d1 \cdot \left(d4 - d1\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 69.7% accurate, 0.1× speedup

Math

\[\begin{array}{l} \mathbf{if}\;\mathsf{max}\left(d2, d4\right) \leq \frac{8302889752870899}{1361129467683753853853498429727072845824}:\\ \;\;\;\;d1 \cdot \left(\mathsf{min}\left(d2, d4\right) - d1\right)\\ \mathbf{else}:\\ \;\;\;\;d1 \cdot \left(\mathsf{min}\left(d2, d4\right) + \mathsf{max}\left(d2, d4\right)\right)\\ \end{array} \]

FPCore

(FPCore (d1 d2 d3 d4)
  :precision binary64
  (if (<=
     (fmax d2 d4)
     8302889752870899/1361129467683753853853498429727072845824)
  (* d1 (- (fmin d2 d4) d1))
  (* d1 (+ (fmin d2 d4) (fmax d2 d4)))))

C

double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (fmax(d2, d4) <= 6.1e-24) {
		tmp = d1 * (fmin(d2, d4) - d1);
	} else {
		tmp = d1 * (fmin(d2, d4) + fmax(d2, d4));
	}
	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(d1, d2, d3, d4)
use fmin_fmax_functions
    real(8), intent (in) :: d1
    real(8), intent (in) :: d2
    real(8), intent (in) :: d3
    real(8), intent (in) :: d4
    real(8) :: tmp
    if (fmax(d2, d4) <= 6.1d-24) then
        tmp = d1 * (fmin(d2, d4) - d1)
    else
        tmp = d1 * (fmin(d2, d4) + fmax(d2, d4))
    end if
    code = tmp
end function

Java

public static double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (fmax(d2, d4) <= 6.1e-24) {
		tmp = d1 * (fmin(d2, d4) - d1);
	} else {
		tmp = d1 * (fmin(d2, d4) + fmax(d2, d4));
	}
	return tmp;
}

Python

def code(d1, d2, d3, d4):
	tmp = 0
	if fmax(d2, d4) <= 6.1e-24:
		tmp = d1 * (fmin(d2, d4) - d1)
	else:
		tmp = d1 * (fmin(d2, d4) + fmax(d2, d4))
	return tmp

Julia

function code(d1, d2, d3, d4)
	tmp = 0.0
	if (fmax(d2, d4) <= 6.1e-24)
		tmp = Float64(d1 * Float64(fmin(d2, d4) - d1));
	else
		tmp = Float64(d1 * Float64(fmin(d2, d4) + fmax(d2, d4)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(d1, d2, d3, d4)
	tmp = 0.0;
	if (max(d2, d4) <= 6.1e-24)
		tmp = d1 * (min(d2, d4) - d1);
	else
		tmp = d1 * (min(d2, d4) + max(d2, d4));
	end
	tmp_2 = tmp;
end

Wolfram

code[d1_, d2_, d3_, d4_] := If[LessEqual[N[Max[d2, d4], $MachinePrecision], 8302889752870899/1361129467683753853853498429727072845824], N[(d1 * N[(N[Min[d2, d4], $MachinePrecision] - d1), $MachinePrecision]), $MachinePrecision], N[(d1 * N[(N[Min[d2, d4], $MachinePrecision] + N[Max[d2, d4], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if d4 < 6.1000000000000004e-24

   1. Initial program 87.6%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1} \]

      2. lift-*.f64 N/A

         \[\leadsto \left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - \color{blue}{d1 \cdot d1} \]

      3. lift-+.f64 N/A

         \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right)} - d1 \cdot d1 \]

      4. lift--.f64 N/A

         \[\leadsto \left(\color{blue}{\left(d1 \cdot d2 - d1 \cdot d3\right)} + d4 \cdot d1\right) - d1 \cdot d1 \]

      5. lift-*.f64 N/A

         \[\leadsto \left(\left(\color{blue}{d1 \cdot d2} - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

      6. lift-*.f64 N/A

         \[\leadsto \left(\left(d1 \cdot d2 - \color{blue}{d1 \cdot d3}\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

      7. distribute-lft-out-- N/A

         \[\leadsto \left(\color{blue}{d1 \cdot \left(d2 - d3\right)} + d4 \cdot d1\right) - d1 \cdot d1 \]

      8. lift-*.f64 N/A

         \[\leadsto \left(d1 \cdot \left(d2 - d3\right) + \color{blue}{d4 \cdot d1}\right) - d1 \cdot d1 \]

      9. *-commutative N/A

         \[\leadsto \left(d1 \cdot \left(d2 - d3\right) + \color{blue}{d1 \cdot d4}\right) - d1 \cdot d1 \]

      10. distribute-lft-out N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 - d3\right) + d4\right)} - d1 \cdot d1 \]

      11. *-commutative N/A

          \[\leadsto \color{blue}{\left(\left(d2 - d3\right) + d4\right) \cdot d1} - d1 \cdot d1 \]

      12. distribute-rgt-out-- N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      13. lower-*.f64 N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      14. lower--.f64 N/A

          \[\leadsto d1 \cdot \color{blue}{\left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      15. +-commutative N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 + \left(d2 - d3\right)\right)} - d1\right) \]

      16. sub-negate-rev N/A

          \[\leadsto d1 \cdot \left(\left(d4 + \color{blue}{\left(\mathsf{neg}\left(\left(d3 - d2\right)\right)\right)}\right) - d1\right) \]

      17. sub-flip-reverse N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 - \left(d3 - d2\right)\right)} - d1\right) \]

      18. lower--.f64 N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 - \left(d3 - d2\right)\right)} - d1\right) \]

      19. lower--.f64 100.0%

          \[\leadsto d1 \cdot \left(\left(d4 - \color{blue}{\left(d3 - d2\right)}\right) - d1\right) \]

   3. Applied rewrites 100.0%

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d4 - \left(d3 - d2\right)\right) - d1\right)} \]

   4. Taylor expanded in d3 around 0

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 + d4\right) - d1\right)} \]
   5. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto d1 \cdot \color{blue}{\left(\left(d2 + d4\right) - d1\right)} \]

      2. lower--.f64 N/A

         \[\leadsto d1 \cdot \left(\left(d2 + d4\right) - \color{blue}{d1}\right) \]

      3. lower-+.f64 77.0%

         \[\leadsto d1 \cdot \left(\left(d2 + d4\right) - d1\right) \]

   6. Applied rewrites 77.0%

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 + d4\right) - d1\right)} \]

   7. Taylor expanded in d4 around 0

      \[\leadsto d1 \cdot \color{blue}{\left(d2 - d1\right)} \]
   8. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto d1 \cdot \left(d2 - \color{blue}{d1}\right) \]

      2. lower--.f64 54.2%

         \[\leadsto d1 \cdot \left(d2 - d1\right) \]

   9. Applied rewrites 54.2%

      \[\leadsto d1 \cdot \color{blue}{\left(d2 - d1\right)} \]

   if 6.1000000000000004e-24 < d4

   1. Initial program 87.6%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1} \]

      2. lift-*.f64 N/A

         \[\leadsto \left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - \color{blue}{d1 \cdot d1} \]

      3. lift-+.f64 N/A

         \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right)} - d1 \cdot d1 \]

      4. lift--.f64 N/A

         \[\leadsto \left(\color{blue}{\left(d1 \cdot d2 - d1 \cdot d3\right)} + d4 \cdot d1\right) - d1 \cdot d1 \]

      5. lift-*.f64 N/A

         \[\leadsto \left(\left(\color{blue}{d1 \cdot d2} - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

      6. lift-*.f64 N/A

         \[\leadsto \left(\left(d1 \cdot d2 - \color{blue}{d1 \cdot d3}\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

      7. distribute-lft-out-- N/A

         \[\leadsto \left(\color{blue}{d1 \cdot \left(d2 - d3\right)} + d4 \cdot d1\right) - d1 \cdot d1 \]

      8. lift-*.f64 N/A

         \[\leadsto \left(d1 \cdot \left(d2 - d3\right) + \color{blue}{d4 \cdot d1}\right) - d1 \cdot d1 \]

      9. *-commutative N/A

         \[\leadsto \left(d1 \cdot \left(d2 - d3\right) + \color{blue}{d1 \cdot d4}\right) - d1 \cdot d1 \]

      10. distribute-lft-out N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 - d3\right) + d4\right)} - d1 \cdot d1 \]

      11. *-commutative N/A

          \[\leadsto \color{blue}{\left(\left(d2 - d3\right) + d4\right) \cdot d1} - d1 \cdot d1 \]

      12. distribute-rgt-out-- N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      13. lower-*.f64 N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      14. lower--.f64 N/A

          \[\leadsto d1 \cdot \color{blue}{\left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      15. +-commutative N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 + \left(d2 - d3\right)\right)} - d1\right) \]

      16. sub-negate-rev N/A

          \[\leadsto d1 \cdot \left(\left(d4 + \color{blue}{\left(\mathsf{neg}\left(\left(d3 - d2\right)\right)\right)}\right) - d1\right) \]

      17. sub-flip-reverse N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 - \left(d3 - d2\right)\right)} - d1\right) \]

      18. lower--.f64 N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 - \left(d3 - d2\right)\right)} - d1\right) \]

      19. lower--.f64 100.0%

          \[\leadsto d1 \cdot \left(\left(d4 - \color{blue}{\left(d3 - d2\right)}\right) - d1\right) \]

   3. Applied rewrites 100.0%

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d4 - \left(d3 - d2\right)\right) - d1\right)} \]

   4. Taylor expanded in d3 around 0

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 + d4\right) - d1\right)} \]
   5. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto d1 \cdot \color{blue}{\left(\left(d2 + d4\right) - d1\right)} \]

      2. lower--.f64 N/A

         \[\leadsto d1 \cdot \left(\left(d2 + d4\right) - \color{blue}{d1}\right) \]

      3. lower-+.f64 77.0%

         \[\leadsto d1 \cdot \left(\left(d2 + d4\right) - d1\right) \]

   6. Applied rewrites 77.0%

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 + d4\right) - d1\right)} \]

   7. Taylor expanded in d4 around 0

      \[\leadsto d1 \cdot \color{blue}{\left(d2 - d1\right)} \]
   8. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto d1 \cdot \left(d2 - \color{blue}{d1}\right) \]

      2. lower--.f64 54.2%

         \[\leadsto d1 \cdot \left(d2 - d1\right) \]

   9. Applied rewrites 54.2%

      \[\leadsto d1 \cdot \color{blue}{\left(d2 - d1\right)} \]

   10. Taylor expanded in d1 around 0

       \[\leadsto d1 \cdot \color{blue}{\left(d2 + d4\right)} \]
   11. Step-by-step derivation

       1. lower-*.f64 N/A

          \[\leadsto d1 \cdot \left(d2 + \color{blue}{d4}\right) \]

       2. lower-+.f64 56.1%

          \[\leadsto d1 \cdot \left(d2 + d4\right) \]

   12. Applied rewrites 56.1%

       \[\leadsto d1 \cdot \color{blue}{\left(d2 + d4\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 56.1% accurate, 3.3× speedup

Math

\[d1 \cdot \left(d2 + d4\right) \]

FPCore

(FPCore (d1 d2 d3 d4)
  :precision binary64
  (* d1 (+ d2 d4)))

C

double code(double d1, double d2, double d3, double d4) {
	return d1 * (d2 + d4);
}

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(d1, d2, d3, d4)
use fmin_fmax_functions
    real(8), intent (in) :: d1
    real(8), intent (in) :: d2
    real(8), intent (in) :: d3
    real(8), intent (in) :: d4
    code = d1 * (d2 + d4)
end function

Java

public static double code(double d1, double d2, double d3, double d4) {
	return d1 * (d2 + d4);
}

Python

def code(d1, d2, d3, d4):
	return d1 * (d2 + d4)

Julia

function code(d1, d2, d3, d4)
	return Float64(d1 * Float64(d2 + d4))
end

MATLAB

function tmp = code(d1, d2, d3, d4)
	tmp = d1 * (d2 + d4);
end

Wolfram

code[d1_, d2_, d3_, d4_] := N[(d1 * N[(d2 + d4), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 87.6%

   \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
2. Step-by-step derivation

   1. lift--.f64 N/A

      \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1} \]

   2. lift-*.f64 N/A

      \[\leadsto \left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - \color{blue}{d1 \cdot d1} \]

   3. lift-+.f64 N/A

      \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right)} - d1 \cdot d1 \]

   4. lift--.f64 N/A

      \[\leadsto \left(\color{blue}{\left(d1 \cdot d2 - d1 \cdot d3\right)} + d4 \cdot d1\right) - d1 \cdot d1 \]

   5. lift-*.f64 N/A

      \[\leadsto \left(\left(\color{blue}{d1 \cdot d2} - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

   6. lift-*.f64 N/A

      \[\leadsto \left(\left(d1 \cdot d2 - \color{blue}{d1 \cdot d3}\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

   7. distribute-lft-out-- N/A

      \[\leadsto \left(\color{blue}{d1 \cdot \left(d2 - d3\right)} + d4 \cdot d1\right) - d1 \cdot d1 \]

   8. lift-*.f64 N/A

      \[\leadsto \left(d1 \cdot \left(d2 - d3\right) + \color{blue}{d4 \cdot d1}\right) - d1 \cdot d1 \]

   9. *-commutative N/A

      \[\leadsto \left(d1 \cdot \left(d2 - d3\right) + \color{blue}{d1 \cdot d4}\right) - d1 \cdot d1 \]

   10. distribute-lft-out N/A

       \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 - d3\right) + d4\right)} - d1 \cdot d1 \]

   11. *-commutative N/A

       \[\leadsto \color{blue}{\left(\left(d2 - d3\right) + d4\right) \cdot d1} - d1 \cdot d1 \]

   12. distribute-rgt-out-- N/A

       \[\leadsto \color{blue}{d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

   13. lower-*.f64 N/A

       \[\leadsto \color{blue}{d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

   14. lower--.f64 N/A

       \[\leadsto d1 \cdot \color{blue}{\left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

   15. +-commutative N/A

       \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 + \left(d2 - d3\right)\right)} - d1\right) \]

   16. sub-negate-rev N/A

       \[\leadsto d1 \cdot \left(\left(d4 + \color{blue}{\left(\mathsf{neg}\left(\left(d3 - d2\right)\right)\right)}\right) - d1\right) \]

   17. sub-flip-reverse N/A

       \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 - \left(d3 - d2\right)\right)} - d1\right) \]

   18. lower--.f64 N/A

       \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 - \left(d3 - d2\right)\right)} - d1\right) \]

   19. lower--.f64 100.0%

       \[\leadsto d1 \cdot \left(\left(d4 - \color{blue}{\left(d3 - d2\right)}\right) - d1\right) \]

3. Applied rewrites 100.0%

   \[\leadsto \color{blue}{d1 \cdot \left(\left(d4 - \left(d3 - d2\right)\right) - d1\right)} \]

4. Taylor expanded in d3 around 0

   \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 + d4\right) - d1\right)} \]
5. Step-by-step derivation

   1. lower-*.f64 N/A

      \[\leadsto d1 \cdot \color{blue}{\left(\left(d2 + d4\right) - d1\right)} \]

   2. lower--.f64 N/A

      \[\leadsto d1 \cdot \left(\left(d2 + d4\right) - \color{blue}{d1}\right) \]

   3. lower-+.f64 77.0%

      \[\leadsto d1 \cdot \left(\left(d2 + d4\right) - d1\right) \]

6. Applied rewrites 77.0%

   \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 + d4\right) - d1\right)} \]

7. Taylor expanded in d4 around 0

   \[\leadsto d1 \cdot \color{blue}{\left(d2 - d1\right)} \]
8. Step-by-step derivation

   1. lower-*.f64 N/A

      \[\leadsto d1 \cdot \left(d2 - \color{blue}{d1}\right) \]

   2. lower--.f64 54.2%

      \[\leadsto d1 \cdot \left(d2 - d1\right) \]

9. Applied rewrites 54.2%

   \[\leadsto d1 \cdot \color{blue}{\left(d2 - d1\right)} \]

10. Taylor expanded in d1 around 0

    \[\leadsto d1 \cdot \color{blue}{\left(d2 + d4\right)} \]
11. Step-by-step derivation

    1. lower-*.f64 N/A

       \[\leadsto d1 \cdot \left(d2 + \color{blue}{d4}\right) \]

    2. lower-+.f64 56.1%

       \[\leadsto d1 \cdot \left(d2 + d4\right) \]

12. Applied rewrites 56.1%

    \[\leadsto d1 \cdot \color{blue}{\left(d2 + d4\right)} \]
13. Add Preprocessing

Alternative 9: 50.0% accurate, 0.1× speedup

Math

\[\begin{array}{l} \mathbf{if}\;\mathsf{max}\left(d2, d4\right) \leq \frac{2589569785738035}{1125899906842624}:\\ \;\;\;\;d1 \cdot \mathsf{min}\left(d2, d4\right)\\ \mathbf{else}:\\ \;\;\;\;d1 \cdot \mathsf{max}\left(d2, d4\right)\\ \end{array} \]

FPCore

(FPCore (d1 d2 d3 d4)
  :precision binary64
  (if (<= (fmax d2 d4) 2589569785738035/1125899906842624)
  (* d1 (fmin d2 d4))
  (* d1 (fmax d2 d4))))

C

double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (fmax(d2, d4) <= 2.3) {
		tmp = d1 * fmin(d2, d4);
	} else {
		tmp = d1 * fmax(d2, d4);
	}
	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(d1, d2, d3, d4)
use fmin_fmax_functions
    real(8), intent (in) :: d1
    real(8), intent (in) :: d2
    real(8), intent (in) :: d3
    real(8), intent (in) :: d4
    real(8) :: tmp
    if (fmax(d2, d4) <= 2.3d0) then
        tmp = d1 * fmin(d2, d4)
    else
        tmp = d1 * fmax(d2, d4)
    end if
    code = tmp
end function

Java

public static double code(double d1, double d2, double d3, double d4) {
	double tmp;
	if (fmax(d2, d4) <= 2.3) {
		tmp = d1 * fmin(d2, d4);
	} else {
		tmp = d1 * fmax(d2, d4);
	}
	return tmp;
}

Python

def code(d1, d2, d3, d4):
	tmp = 0
	if fmax(d2, d4) <= 2.3:
		tmp = d1 * fmin(d2, d4)
	else:
		tmp = d1 * fmax(d2, d4)
	return tmp

Julia

function code(d1, d2, d3, d4)
	tmp = 0.0
	if (fmax(d2, d4) <= 2.3)
		tmp = Float64(d1 * fmin(d2, d4));
	else
		tmp = Float64(d1 * fmax(d2, d4));
	end
	return tmp
end

MATLAB

function tmp_2 = code(d1, d2, d3, d4)
	tmp = 0.0;
	if (max(d2, d4) <= 2.3)
		tmp = d1 * min(d2, d4);
	else
		tmp = d1 * max(d2, d4);
	end
	tmp_2 = tmp;
end

Wolfram

code[d1_, d2_, d3_, d4_] := If[LessEqual[N[Max[d2, d4], $MachinePrecision], 2589569785738035/1125899906842624], N[(d1 * N[Min[d2, d4], $MachinePrecision]), $MachinePrecision], N[(d1 * N[Max[d2, d4], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if d4 < 2.2999999999999998

   1. Initial program 87.6%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1} \]

      2. lift-*.f64 N/A

         \[\leadsto \left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - \color{blue}{d1 \cdot d1} \]

      3. lift-+.f64 N/A

         \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right)} - d1 \cdot d1 \]

      4. lift--.f64 N/A

         \[\leadsto \left(\color{blue}{\left(d1 \cdot d2 - d1 \cdot d3\right)} + d4 \cdot d1\right) - d1 \cdot d1 \]

      5. lift-*.f64 N/A

         \[\leadsto \left(\left(\color{blue}{d1 \cdot d2} - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

      6. lift-*.f64 N/A

         \[\leadsto \left(\left(d1 \cdot d2 - \color{blue}{d1 \cdot d3}\right) + d4 \cdot d1\right) - d1 \cdot d1 \]

      7. distribute-lft-out-- N/A

         \[\leadsto \left(\color{blue}{d1 \cdot \left(d2 - d3\right)} + d4 \cdot d1\right) - d1 \cdot d1 \]

      8. lift-*.f64 N/A

         \[\leadsto \left(d1 \cdot \left(d2 - d3\right) + \color{blue}{d4 \cdot d1}\right) - d1 \cdot d1 \]

      9. *-commutative N/A

         \[\leadsto \left(d1 \cdot \left(d2 - d3\right) + \color{blue}{d1 \cdot d4}\right) - d1 \cdot d1 \]

      10. distribute-lft-out N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(d2 - d3\right) + d4\right)} - d1 \cdot d1 \]

      11. *-commutative N/A

          \[\leadsto \color{blue}{\left(\left(d2 - d3\right) + d4\right) \cdot d1} - d1 \cdot d1 \]

      12. distribute-rgt-out-- N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      13. lower-*.f64 N/A

          \[\leadsto \color{blue}{d1 \cdot \left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      14. lower--.f64 N/A

          \[\leadsto d1 \cdot \color{blue}{\left(\left(\left(d2 - d3\right) + d4\right) - d1\right)} \]

      15. +-commutative N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 + \left(d2 - d3\right)\right)} - d1\right) \]

      16. sub-negate-rev N/A

          \[\leadsto d1 \cdot \left(\left(d4 + \color{blue}{\left(\mathsf{neg}\left(\left(d3 - d2\right)\right)\right)}\right) - d1\right) \]

      17. sub-flip-reverse N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 - \left(d3 - d2\right)\right)} - d1\right) \]

      18. lower--.f64 N/A

          \[\leadsto d1 \cdot \left(\color{blue}{\left(d4 - \left(d3 - d2\right)\right)} - d1\right) \]

      19. lower--.f64 100.0%

          \[\leadsto d1 \cdot \left(\left(d4 - \color{blue}{\left(d3 - d2\right)}\right) - d1\right) \]

   3. Applied rewrites 100.0%

      \[\leadsto \color{blue}{d1 \cdot \left(\left(d4 - \left(d3 - d2\right)\right) - d1\right)} \]

   4. Taylor expanded in d2 around inf

      \[\leadsto \color{blue}{d1 \cdot d2} \]
   5. Step-by-step derivation

      1. lower-*.f64 30.5%

         \[\leadsto d1 \cdot \color{blue}{d2} \]

   6. Applied rewrites 30.5%

      \[\leadsto \color{blue}{d1 \cdot d2} \]

   if 2.2999999999999998 < d4

   1. Initial program 87.6%

      \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
   2. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1} \]

      2. lift-+.f64 N/A

         \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right)} - d1 \cdot d1 \]

      3. associate--l+ N/A

         \[\leadsto \color{blue}{\left(d1 \cdot d2 - d1 \cdot d3\right) + \left(d4 \cdot d1 - d1 \cdot d1\right)} \]

      4. lift--.f64 N/A

         \[\leadsto \color{blue}{\left(d1 \cdot d2 - d1 \cdot d3\right)} + \left(d4 \cdot d1 - d1 \cdot d1\right) \]

      5. lift-*.f64 N/A

         \[\leadsto \left(d1 \cdot d2 - \color{blue}{d1 \cdot d3}\right) + \left(d4 \cdot d1 - d1 \cdot d1\right) \]

      6. fp-cancel-sub-sign-inv N/A

         \[\leadsto \color{blue}{\left(d1 \cdot d2 + \left(\mathsf{neg}\left(d1\right)\right) \cdot d3\right)} + \left(d4 \cdot d1 - d1 \cdot d1\right) \]

      7. +-commutative N/A

         \[\leadsto \color{blue}{\left(\left(\mathsf{neg}\left(d1\right)\right) \cdot d3 + d1 \cdot d2\right)} + \left(d4 \cdot d1 - d1 \cdot d1\right) \]

      8. associate-+l+ N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(d1\right)\right) \cdot d3 + \left(d1 \cdot d2 + \left(d4 \cdot d1 - d1 \cdot d1\right)\right)} \]

      9. sum-to-mult N/A

         \[\leadsto \color{blue}{\left(1 + \frac{d1 \cdot d2 + \left(d4 \cdot d1 - d1 \cdot d1\right)}{\left(\mathsf{neg}\left(d1\right)\right) \cdot d3}\right) \cdot \left(\left(\mathsf{neg}\left(d1\right)\right) \cdot d3\right)} \]

      10. add-flip-rev N/A

          \[\leadsto \left(1 + \frac{\color{blue}{d1 \cdot d2 - \left(\mathsf{neg}\left(\left(d4 \cdot d1 - d1 \cdot d1\right)\right)\right)}}{\left(\mathsf{neg}\left(d1\right)\right) \cdot d3}\right) \cdot \left(\left(\mathsf{neg}\left(d1\right)\right) \cdot d3\right) \]

      11. sub-negate-rev N/A

          \[\leadsto \left(1 + \frac{d1 \cdot d2 - \color{blue}{\left(d1 \cdot d1 - d4 \cdot d1\right)}}{\left(\mathsf{neg}\left(d1\right)\right) \cdot d3}\right) \cdot \left(\left(\mathsf{neg}\left(d1\right)\right) \cdot d3\right) \]

      12. lower-unsound-*.f64 N/A

          \[\leadsto \color{blue}{\left(1 + \frac{d1 \cdot d2 - \left(d1 \cdot d1 - d4 \cdot d1\right)}{\left(\mathsf{neg}\left(d1\right)\right) \cdot d3}\right) \cdot \left(\left(\mathsf{neg}\left(d1\right)\right) \cdot d3\right)} \]

   3. Applied rewrites 70.4%

      \[\leadsto \color{blue}{\left(1 + \frac{d1 \cdot \left(d2 - \left(d1 - d4\right)\right)}{\left(-d1\right) \cdot d3}\right) \cdot \left(\left(-d1\right) \cdot d3\right)} \]
   4. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{\left(1 + \frac{d1 \cdot \left(d2 - \left(d1 - d4\right)\right)}{\left(-d1\right) \cdot d3}\right) \cdot \left(\left(-d1\right) \cdot d3\right)} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\left(\left(-d1\right) \cdot d3\right) \cdot \left(1 + \frac{d1 \cdot \left(d2 - \left(d1 - d4\right)\right)}{\left(-d1\right) \cdot d3}\right)} \]

      3. lift-+.f64 N/A

         \[\leadsto \left(\left(-d1\right) \cdot d3\right) \cdot \color{blue}{\left(1 + \frac{d1 \cdot \left(d2 - \left(d1 - d4\right)\right)}{\left(-d1\right) \cdot d3}\right)} \]

      4. lift-/.f64 N/A

         \[\leadsto \left(\left(-d1\right) \cdot d3\right) \cdot \left(1 + \color{blue}{\frac{d1 \cdot \left(d2 - \left(d1 - d4\right)\right)}{\left(-d1\right) \cdot d3}}\right) \]

      5. add-to-fraction N/A

         \[\leadsto \left(\left(-d1\right) \cdot d3\right) \cdot \color{blue}{\frac{1 \cdot \left(\left(-d1\right) \cdot d3\right) + d1 \cdot \left(d2 - \left(d1 - d4\right)\right)}{\left(-d1\right) \cdot d3}} \]

      6. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{\left(\left(-d1\right) \cdot d3\right) \cdot \left(1 \cdot \left(\left(-d1\right) \cdot d3\right) + d1 \cdot \left(d2 - \left(d1 - d4\right)\right)\right)}{\left(-d1\right) \cdot d3}} \]

      7. *-rgt-identity N/A

         \[\leadsto \frac{\left(\left(-d1\right) \cdot d3\right) \cdot \left(1 \cdot \left(\left(-d1\right) \cdot d3\right) + d1 \cdot \left(d2 - \left(d1 - d4\right)\right)\right)}{\color{blue}{\left(\left(-d1\right) \cdot d3\right) \cdot 1}} \]

      8. times-frac N/A

         \[\leadsto \color{blue}{\frac{\left(-d1\right) \cdot d3}{\left(-d1\right) \cdot d3} \cdot \frac{1 \cdot \left(\left(-d1\right) \cdot d3\right) + d1 \cdot \left(d2 - \left(d1 - d4\right)\right)}{1}} \]

      9. *-inverses N/A

         \[\leadsto \color{blue}{1} \cdot \frac{1 \cdot \left(\left(-d1\right) \cdot d3\right) + d1 \cdot \left(d2 - \left(d1 - d4\right)\right)}{1} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\mathsf{134\_z0z1z2z3z4}\left(1, \left(d2 - \left(d1 - d4\right)\right), d1, d3, d1\right)} \]

   6. Taylor expanded in d4 around inf

      \[\leadsto \color{blue}{d1 \cdot d4} \]
   7. Step-by-step derivation

      1. lower-*.f64 31.4%

         \[\leadsto d1 \cdot \color{blue}{d4} \]

   8. Applied rewrites 31.4%

      \[\leadsto \color{blue}{d1 \cdot d4} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 10: 30.7% accurate, 0.3× speedup

Math

\[d1 \cdot \mathsf{max}\left(d2, d4\right) \]

FPCore

(FPCore (d1 d2 d3 d4)
  :precision binary64
  (* d1 (fmax d2 d4)))

C

double code(double d1, double d2, double d3, double d4) {
	return d1 * fmax(d2, d4);
}

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(d1, d2, d3, d4)
use fmin_fmax_functions
    real(8), intent (in) :: d1
    real(8), intent (in) :: d2
    real(8), intent (in) :: d3
    real(8), intent (in) :: d4
    code = d1 * fmax(d2, d4)
end function

Java

public static double code(double d1, double d2, double d3, double d4) {
	return d1 * fmax(d2, d4);
}

Python

def code(d1, d2, d3, d4):
	return d1 * fmax(d2, d4)

Julia

function code(d1, d2, d3, d4)
	return Float64(d1 * fmax(d2, d4))
end

MATLAB

function tmp = code(d1, d2, d3, d4)
	tmp = d1 * max(d2, d4);
end

Wolfram

code[d1_, d2_, d3_, d4_] := N[(d1 * N[Max[d2, d4], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 87.6%

   \[\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1 \]
2. Step-by-step derivation

   1. lift--.f64 N/A

      \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right) - d1 \cdot d1} \]

   2. lift-+.f64 N/A

      \[\leadsto \color{blue}{\left(\left(d1 \cdot d2 - d1 \cdot d3\right) + d4 \cdot d1\right)} - d1 \cdot d1 \]

   3. associate--l+ N/A

      \[\leadsto \color{blue}{\left(d1 \cdot d2 - d1 \cdot d3\right) + \left(d4 \cdot d1 - d1 \cdot d1\right)} \]

   4. lift--.f64 N/A

      \[\leadsto \color{blue}{\left(d1 \cdot d2 - d1 \cdot d3\right)} + \left(d4 \cdot d1 - d1 \cdot d1\right) \]

   5. lift-*.f64 N/A

      \[\leadsto \left(d1 \cdot d2 - \color{blue}{d1 \cdot d3}\right) + \left(d4 \cdot d1 - d1 \cdot d1\right) \]

   6. fp-cancel-sub-sign-inv N/A

      \[\leadsto \color{blue}{\left(d1 \cdot d2 + \left(\mathsf{neg}\left(d1\right)\right) \cdot d3\right)} + \left(d4 \cdot d1 - d1 \cdot d1\right) \]

   7. +-commutative N/A

      \[\leadsto \color{blue}{\left(\left(\mathsf{neg}\left(d1\right)\right) \cdot d3 + d1 \cdot d2\right)} + \left(d4 \cdot d1 - d1 \cdot d1\right) \]

   8. associate-+l+ N/A

      \[\leadsto \color{blue}{\left(\mathsf{neg}\left(d1\right)\right) \cdot d3 + \left(d1 \cdot d2 + \left(d4 \cdot d1 - d1 \cdot d1\right)\right)} \]

   9. sum-to-mult N/A

      \[\leadsto \color{blue}{\left(1 + \frac{d1 \cdot d2 + \left(d4 \cdot d1 - d1 \cdot d1\right)}{\left(\mathsf{neg}\left(d1\right)\right) \cdot d3}\right) \cdot \left(\left(\mathsf{neg}\left(d1\right)\right) \cdot d3\right)} \]

   10. add-flip-rev N/A

       \[\leadsto \left(1 + \frac{\color{blue}{d1 \cdot d2 - \left(\mathsf{neg}\left(\left(d4 \cdot d1 - d1 \cdot d1\right)\right)\right)}}{\left(\mathsf{neg}\left(d1\right)\right) \cdot d3}\right) \cdot \left(\left(\mathsf{neg}\left(d1\right)\right) \cdot d3\right) \]

   11. sub-negate-rev N/A

       \[\leadsto \left(1 + \frac{d1 \cdot d2 - \color{blue}{\left(d1 \cdot d1 - d4 \cdot d1\right)}}{\left(\mathsf{neg}\left(d1\right)\right) \cdot d3}\right) \cdot \left(\left(\mathsf{neg}\left(d1\right)\right) \cdot d3\right) \]

   12. lower-unsound-*.f64 N/A

       \[\leadsto \color{blue}{\left(1 + \frac{d1 \cdot d2 - \left(d1 \cdot d1 - d4 \cdot d1\right)}{\left(\mathsf{neg}\left(d1\right)\right) \cdot d3}\right) \cdot \left(\left(\mathsf{neg}\left(d1\right)\right) \cdot d3\right)} \]

3. Applied rewrites 70.4%

   \[\leadsto \color{blue}{\left(1 + \frac{d1 \cdot \left(d2 - \left(d1 - d4\right)\right)}{\left(-d1\right) \cdot d3}\right) \cdot \left(\left(-d1\right) \cdot d3\right)} \]
4. Step-by-step derivation

   1. lift-*.f64 N/A

      \[\leadsto \color{blue}{\left(1 + \frac{d1 \cdot \left(d2 - \left(d1 - d4\right)\right)}{\left(-d1\right) \cdot d3}\right) \cdot \left(\left(-d1\right) \cdot d3\right)} \]

   2. *-commutative N/A

      \[\leadsto \color{blue}{\left(\left(-d1\right) \cdot d3\right) \cdot \left(1 + \frac{d1 \cdot \left(d2 - \left(d1 - d4\right)\right)}{\left(-d1\right) \cdot d3}\right)} \]

   3. lift-+.f64 N/A

      \[\leadsto \left(\left(-d1\right) \cdot d3\right) \cdot \color{blue}{\left(1 + \frac{d1 \cdot \left(d2 - \left(d1 - d4\right)\right)}{\left(-d1\right) \cdot d3}\right)} \]

   4. lift-/.f64 N/A

      \[\leadsto \left(\left(-d1\right) \cdot d3\right) \cdot \left(1 + \color{blue}{\frac{d1 \cdot \left(d2 - \left(d1 - d4\right)\right)}{\left(-d1\right) \cdot d3}}\right) \]

   5. add-to-fraction N/A

      \[\leadsto \left(\left(-d1\right) \cdot d3\right) \cdot \color{blue}{\frac{1 \cdot \left(\left(-d1\right) \cdot d3\right) + d1 \cdot \left(d2 - \left(d1 - d4\right)\right)}{\left(-d1\right) \cdot d3}} \]

   6. associate-*r/ N/A

      \[\leadsto \color{blue}{\frac{\left(\left(-d1\right) \cdot d3\right) \cdot \left(1 \cdot \left(\left(-d1\right) \cdot d3\right) + d1 \cdot \left(d2 - \left(d1 - d4\right)\right)\right)}{\left(-d1\right) \cdot d3}} \]

   7. *-rgt-identity N/A

      \[\leadsto \frac{\left(\left(-d1\right) \cdot d3\right) \cdot \left(1 \cdot \left(\left(-d1\right) \cdot d3\right) + d1 \cdot \left(d2 - \left(d1 - d4\right)\right)\right)}{\color{blue}{\left(\left(-d1\right) \cdot d3\right) \cdot 1}} \]

   8. times-frac N/A

      \[\leadsto \color{blue}{\frac{\left(-d1\right) \cdot d3}{\left(-d1\right) \cdot d3} \cdot \frac{1 \cdot \left(\left(-d1\right) \cdot d3\right) + d1 \cdot \left(d2 - \left(d1 - d4\right)\right)}{1}} \]

   9. *-inverses N/A

      \[\leadsto \color{blue}{1} \cdot \frac{1 \cdot \left(\left(-d1\right) \cdot d3\right) + d1 \cdot \left(d2 - \left(d1 - d4\right)\right)}{1} \]

5. Applied rewrites 100.0%

   \[\leadsto \color{blue}{\mathsf{134\_z0z1z2z3z4}\left(1, \left(d2 - \left(d1 - d4\right)\right), d1, d3, d1\right)} \]

6. Taylor expanded in d4 around inf

   \[\leadsto \color{blue}{d1 \cdot d4} \]
7. Step-by-step derivation

   1. lower-*.f64 31.4%

      \[\leadsto d1 \cdot \color{blue}{d4} \]

8. Applied rewrites 31.4%

   \[\leadsto \color{blue}{d1 \cdot d4} \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2025271 -o generate:evaluate
(FPCore (d1 d2 d3 d4)
  :name "FastMath dist4"
  :precision binary64
  (- (+ (- (* d1 d2) (* d1 d3)) (* d4 d1)) (* d1 d1)))