Metrics for fabs fraction 2

start0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage

analyze0.0ms (0%)

Memory

0.5MiB live, 0.5MiB allocated; 0ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
100%	99.9%	0%	0.1%	0%	0%	0%	1

Compiler

Compiled 8 to 8 computations (0% saved)

sample804.0ms (50.2%)

Memory

67.4MiB live, 953.1MiB allocated; 246ms collecting garbage

Samples

554.0ms

8 256×

valid

Precisions

Click to see histograms. Total time spent on operations: 218.0ms

ival-fabs: 93.0ms (42.6% of total)

ival-sub: 61.0ms (27.9% of total)

ival-div: 54.0ms (24.7% of total)

exact: 5.0ms (2.3% of total)

ival-assert: 3.0ms (1.4% of total)

adjust: 2.0ms (0.9% of total)

Bogosity

explain56.0ms (3.5%)

Memory

-3.0MiB live, 89.5MiB allocated; 7ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`a`
-	-	`#s(literal 2 binary64)`
-	-	`(fabs.f64 (-.f64 a b))`
-	-	`(-.f64 a b)`
-	-	`b`
-	-	`(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	1

Precision?

0/0

Recall?

0/0

Samples

26.0ms

512×

valid

Compiler

Compiled 42 to 22 computations (47.6% saved)

Precisions

Click to see histograms. Total time spent on operations: 10.0ms

ival-sub: 3.0ms (29.6% of total)

ival-div: 3.0ms (29.6% of total)

ival-fabs: 3.0ms (29.6% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

preprocess273.0ms (17%)

Memory

-8.9MiB live, 131.4MiB allocated; 18ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	19	40
1	41	40
2	62	40
3	120	40
4	240	40
5	419	40
6	1472	40
7	5212	40
0	6	6
0	9	6
1	15	6
2	23	6
3	43	6
4	92	6
5	198	6
6	770	6
7	5212	6
0	8049	6

Stop Event

1×	iter limit
1×	node limit
1×	iter limit
1×	node limit

Calls

Call 1

Inputs
(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))

Outputs
(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))
(*.f64 (fabs.f64 (-.f64 b a)) #s(literal 1/2 binary64))

Symmetry

(sort a b)

Compiler

Compiled 6 to 6 computations (0% saved)

eval0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 2 computations (-∞% saved)

prune0.0ms (0%)

Memory

0.5MiB live, 0.5MiB allocated; 0ms collecting garbage

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))

Compiler

Compiled 6 to 6 computations (0% saved)

series4.0ms (0.3%)

Memory

5.0MiB live, 5.0MiB allocated; 0ms collecting garbage

Counts

6 → 16

Calls

Call 1

Inputs
(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))
(fabs.f64 (-.f64 a b))
(-.f64 a b)
a
b
#s(literal 2 binary64)

Outputs
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (- a b)))))
#s(approx (fabs (- a b)) #s(hole binary64 (fabs (- a b))))
#s(approx (- a b) #s(hole binary64 (* -1 b)))
#s(approx (- a b) #s(hole binary64 (- a b)))
#s(approx a #s(hole binary64 a))
#s(approx (- a b) #s(hole binary64 a))
#s(approx (- a b) #s(hole binary64 (* a (+ 1 (* -1 (/ b a))))))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (neg (+ b (* -1 a)))))))
#s(approx (fabs (- a b)) #s(hole binary64 (fabs (neg (+ b (* -1 a))))))
#s(approx (- a b) #s(hole binary64 (* -1 (* a (- (/ b a) 1)))))
#s(approx (- a b) #s(hole binary64 (+ a (* -1 b))))
#s(approx b #s(hole binary64 b))
#s(approx (- a b) #s(hole binary64 (* b (- (/ a b) 1))))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (+ a (* -1 b))))))
#s(approx (fabs (- a b)) #s(hole binary64 (fabs (+ a (* -1 b)))))
#s(approx (- a b) #s(hole binary64 (* -1 (* b (+ 1 (* -1 (/ a b)))))))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	a	@	inf	((/ (fabs (- a b)) 2) (fabs (- a b)) (- a b) a b 2)
1.0ms	a	@	-inf	((/ (fabs (- a b)) 2) (fabs (- a b)) (- a b) a b 2)
1.0ms	b	@	-inf	((/ (fabs (- a b)) 2) (fabs (- a b)) (- a b) a b 2)
1.0ms	b	@	inf	((/ (fabs (- a b)) 2) (fabs (- a b)) (- a b) a b 2)
1.0ms	b	@	0	((/ (fabs (- a b)) 2) (fabs (- a b)) (- a b) a b 2)

rewrite101.0ms (6.3%)

Memory

-5.8MiB live, 39.9MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	52	178
0	55	161
1	206	158
0	1504	158

Stop Event

1×	iter limit
1×	iter limit
1×	node limit
1×	iter limit

Counts

22 → 53

Calls

Call 1

Inputs
(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))
(fabs.f64 (-.f64 a b))
(-.f64 a b)
a
b
#s(literal 2 binary64)
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (- a b)))))
#s(approx (fabs (- a b)) #s(hole binary64 (fabs (- a b))))
#s(approx (- a b) #s(hole binary64 (* -1 b)))
#s(approx (- a b) #s(hole binary64 (- a b)))
#s(approx a #s(hole binary64 a))
#s(approx (- a b) #s(hole binary64 a))
#s(approx (- a b) #s(hole binary64 (* a (+ 1 (* -1 (/ b a))))))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (neg (+ b (* -1 a)))))))
#s(approx (fabs (- a b)) #s(hole binary64 (fabs (neg (+ b (* -1 a))))))
#s(approx (- a b) #s(hole binary64 (* -1 (* a (- (/ b a) 1)))))
#s(approx (- a b) #s(hole binary64 (+ a (* -1 b))))
#s(approx b #s(hole binary64 b))
#s(approx (- a b) #s(hole binary64 (* b (- (/ a b) 1))))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (+ a (* -1 b))))))
#s(approx (fabs (- a b)) #s(hole binary64 (fabs (+ a (* -1 b)))))
#s(approx (- a b) #s(hole binary64 (* -1 (* b (+ 1 (* -1 (/ a b)))))))

Outputs
(/.f64 (neg.f64 (neg.f64 (fabs.f64 (-.f64 b a)))) #s(literal 2 binary64))
(/.f64 (neg.f64 (fabs.f64 (-.f64 b a))) #s(literal -2 binary64))
(/.f64 (fabs.f64 (-.f64 b a)) #s(literal 2 binary64))
(neg.f64 (/.f64 (neg.f64 (fabs.f64 (-.f64 b a))) #s(literal 2 binary64)))
(neg.f64 (/.f64 (fabs.f64 (-.f64 b a)) #s(literal -2 binary64)))
(*.f64 (sqrt.f64 (-.f64 a b)) (sqrt.f64 (-.f64 a b)))
(pow.f64 (pow.f64 (-.f64 a b) #s(literal 2 binary64)) #s(literal 1/2 binary64))
(/.f64 (fabs.f64 (-.f64 (pow.f64 a #s(literal 3 binary64)) (pow.f64 b #s(literal 3 binary64)))) (fabs.f64 (fma.f64 b (+.f64 b a) (*.f64 a a))))
(/.f64 (fabs.f64 (fma.f64 b b (*.f64 a (neg.f64 a)))) (fabs.f64 (+.f64 b a)))
(/.f64 (fabs.f64 (fma.f64 (pow.f64 a #s(literal 3 binary64)) #s(literal -1 binary64) (pow.f64 b #s(literal 3 binary64)))) (fabs.f64 (fma.f64 (neg.f64 a) (-.f64 (neg.f64 a) b) (*.f64 b b))))
(/.f64 (fabs.f64 (*.f64 (+.f64 b a) (-.f64 a b))) (fabs.f64 (+.f64 b a)))
(sqrt.f64 (pow.f64 (-.f64 a b) #s(literal 2 binary64)))
(fabs.f64 (-.f64 b a))
(fabs.f64 (-.f64 a b))
(/.f64 (fma.f64 b b (*.f64 a (neg.f64 a))) (-.f64 (neg.f64 b) a))
(/.f64 (fma.f64 b b (*.f64 a (neg.f64 a))) (neg.f64 (+.f64 b a)))
(/.f64 (neg.f64 (*.f64 (+.f64 b a) (-.f64 a b))) (neg.f64 (+.f64 b a)))
(/.f64 (neg.f64 (-.f64 (pow.f64 a #s(literal 3 binary64)) (pow.f64 b #s(literal 3 binary64)))) (neg.f64 (fma.f64 b (+.f64 b a) (*.f64 a a))))
(/.f64 (neg.f64 (fma.f64 b b (*.f64 a (neg.f64 a)))) (+.f64 b a))
(/.f64 (neg.f64 (fma.f64 (pow.f64 a #s(literal 3 binary64)) #s(literal -1 binary64) (pow.f64 b #s(literal 3 binary64)))) (fma.f64 (neg.f64 a) (-.f64 (neg.f64 a) b) (*.f64 b b)))
(/.f64 (*.f64 (+.f64 b a) (-.f64 a b)) (+.f64 b a))
(/.f64 (-.f64 (pow.f64 a #s(literal 3 binary64)) (pow.f64 b #s(literal 3 binary64))) (fma.f64 b (+.f64 b a) (*.f64 a a)))
(/.f64 (-.f64 (pow.f64 a #s(literal 3 binary64)) (pow.f64 b #s(literal 3 binary64))) (fma.f64 (neg.f64 a) (-.f64 (neg.f64 a) b) (*.f64 b b)))
(/.f64 (fma.f64 (pow.f64 a #s(literal 3 binary64)) #s(literal -1 binary64) (pow.f64 b #s(literal 3 binary64))) (neg.f64 (fma.f64 (neg.f64 a) (-.f64 (neg.f64 a) b) (*.f64 b b))))
(neg.f64 (-.f64 b a))
(fma.f64 #s(literal -1 binary64) b a)
(fma.f64 b #s(literal -1 binary64) a)
(-.f64 (/.f64 (.f64 a a) (+.f64 b a)) (/.f64 (.f64 b b) (+.f64 b a)))
(-.f64 (/.f64 (pow.f64 a #s(literal 3 binary64)) (fma.f64 b (+.f64 b a) (.f64 a a))) (/.f64 (pow.f64 b #s(literal 3 binary64)) (fma.f64 b (+.f64 b a) (.f64 a a))))
(-.f64 a (*.f64 (neg.f64 b) #s(literal -1 binary64)))
(-.f64 a b)
(+.f64 (/.f64 (pow.f64 a #s(literal 3 binary64)) (fma.f64 b (+.f64 b a) (.f64 a a))) (/.f64 (pow.f64 (neg.f64 b) #s(literal 3 binary64)) (fma.f64 b (+.f64 b a) (.f64 a a))))
(+.f64 (neg.f64 b) a)
(+.f64 a (neg.f64 b))
a
b
#s(literal 2 binary64)
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))
#s(approx (fabs (- a b)) (fabs.f64 (-.f64 b a)))
#s(approx (- a b) (neg.f64 b))
#s(approx (- a b) (-.f64 a b))
#s(approx a a)
#s(approx (- a b) a)
#s(approx (- a b) (*.f64 (-.f64 #s(literal 1 binary64) (/.f64 b a)) a))
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))
#s(approx (fabs (- a b)) (fabs.f64 (-.f64 b a)))
#s(approx (- a b) (*.f64 (-.f64 #s(literal 1 binary64) (/.f64 b a)) a))
#s(approx (- a b) (-.f64 a b))
#s(approx b b)
#s(approx (- a b) (*.f64 (-.f64 (/.f64 a b) #s(literal 1 binary64)) b))
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))
#s(approx (fabs (- a b)) (fabs.f64 (-.f64 b a)))
#s(approx (- a b) (*.f64 (-.f64 #s(literal 1 binary64) (/.f64 a b)) (neg.f64 b)))

eval5.0ms (0.3%)

Memory: 6.9MiB live, 6.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 584 to 174 computations (70.2% saved)

prune2.0ms (0.1%)

Memory

3.4MiB live, 3.4MiB allocated; 0ms collecting garbage

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	46	1	47
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	47	1	48

Accuracy

100.0%

Counts

48 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))

Compiler

Compiled 13 to 11 computations (15.4% saved)

series5.0ms (0.3%)

Memory

8.1MiB live, 8.1MiB allocated; 0ms collecting garbage

Counts

7 → 19

Calls

Call 1

Inputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))
(*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a)))
#s(literal 1/2 binary64)
(fabs.f64 (-.f64 b a))
(-.f64 b a)
b
a

Outputs
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (- a b)))))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (- b a)))))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (- b a))))
#s(approx (- b a) #s(hole binary64 b))
#s(approx (- b a) #s(hole binary64 (+ b (* -1 a))))
#s(approx a #s(hole binary64 a))
#s(approx (- b a) #s(hole binary64 (* -1 a)))
#s(approx (- b a) #s(hole binary64 (* a (- (/ b a) 1))))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (neg (+ b (* -1 a)))))))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (+ b (* -1 a))))))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (+ b (* -1 a)))))
#s(approx (- b a) #s(hole binary64 (* -1 (* a (+ 1 (* -1 (/ b a)))))))
#s(approx (- b a) #s(hole binary64 (- b a)))
#s(approx b #s(hole binary64 b))
#s(approx (- b a) #s(hole binary64 (* b (+ 1 (* -1 (/ a b))))))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (+ a (* -1 b))))))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (neg (+ a (* -1 b)))))))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (neg (+ a (* -1 b))))))
#s(approx (- b a) #s(hole binary64 (* -1 (* b (- (/ a b) 1)))))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	a	@	-inf	((/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) 1/2 (fabs (- b a)) (- b a) b a)
1.0ms	b	@	-inf	((/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) 1/2 (fabs (- b a)) (- b a) b a)
1.0ms	a	@	inf	((/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) 1/2 (fabs (- b a)) (- b a) b a)
1.0ms	b	@	inf	((/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) 1/2 (fabs (- b a)) (- b a) b a)
1.0ms	a	@	0	((/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) 1/2 (fabs (- b a)) (- b a) b a)

rewrite104.0ms (6.5%)

Memory

-40.3MiB live, 62.2MiB allocated; 51ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	64	235
0	68	215
1	238	210
0	1709	210

Stop Event

1×	iter limit
1×	iter limit
1×	node limit
1×	iter limit

Counts

26 → 54

Calls

Call 1

Inputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))
(*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a)))
#s(literal 1/2 binary64)
(fabs.f64 (-.f64 b a))
(-.f64 b a)
b
a
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (- a b)))))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (- b a)))))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (- b a))))
#s(approx (- b a) #s(hole binary64 b))
#s(approx (- b a) #s(hole binary64 (+ b (* -1 a))))
#s(approx a #s(hole binary64 a))
#s(approx (- b a) #s(hole binary64 (* -1 a)))
#s(approx (- b a) #s(hole binary64 (* a (- (/ b a) 1))))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (neg (+ b (* -1 a)))))))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (+ b (* -1 a))))))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (+ b (* -1 a)))))
#s(approx (- b a) #s(hole binary64 (* -1 (* a (+ 1 (* -1 (/ b a)))))))
#s(approx (- b a) #s(hole binary64 (- b a)))
#s(approx b #s(hole binary64 b))
#s(approx (- b a) #s(hole binary64 (* b (+ 1 (* -1 (/ a b))))))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (+ a (* -1 b))))))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (neg (+ a (* -1 b)))))))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (neg (+ a (* -1 b))))))
#s(approx (- b a) #s(hole binary64 (* -1 (* b (- (/ a b) 1)))))

Outputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64)))
(*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64))
(*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 a b)))
#s(literal 1/2 binary64)
(*.f64 (sqrt.f64 (-.f64 b a)) (sqrt.f64 (-.f64 b a)))
(*.f64 (sqrt.f64 (-.f64 a b)) (sqrt.f64 (-.f64 a b)))
(pow.f64 (pow.f64 (-.f64 a b) #s(literal 2 binary64)) #s(literal 1/2 binary64))
(/.f64 (fabs.f64 (*.f64 (+.f64 b a) (-.f64 b a))) (fabs.f64 (+.f64 b a)))
(/.f64 (fabs.f64 (*.f64 (+.f64 b a) (-.f64 a b))) (fabs.f64 (+.f64 b a)))
(/.f64 (fabs.f64 (-.f64 (pow.f64 b #s(literal 3 binary64)) (pow.f64 a #s(literal 3 binary64)))) (fabs.f64 (fma.f64 b b (*.f64 a (+.f64 b a)))))
(/.f64 (fabs.f64 (-.f64 (pow.f64 a #s(literal 3 binary64)) (pow.f64 b #s(literal 3 binary64)))) (fabs.f64 (fma.f64 b (+.f64 b a) (*.f64 a a))))
(sqrt.f64 (pow.f64 (-.f64 a b) #s(literal 2 binary64)))
(fabs.f64 (-.f64 a b))
(fabs.f64 (-.f64 b a))
(/.f64 (neg.f64 (-.f64 (pow.f64 a #s(literal 3 binary64)) (pow.f64 b #s(literal 3 binary64)))) (fma.f64 b (+.f64 b a) (*.f64 a a)))
(/.f64 (neg.f64 (*.f64 (+.f64 b a) (-.f64 a b))) (+.f64 b a))
(/.f64 (neg.f64 (-.f64 (pow.f64 b #s(literal 3 binary64)) (pow.f64 a #s(literal 3 binary64)))) (neg.f64 (fma.f64 b b (*.f64 a (+.f64 b a)))))
(/.f64 (neg.f64 (*.f64 (+.f64 b a) (-.f64 b a))) (neg.f64 (+.f64 b a)))
(/.f64 (*.f64 (+.f64 b a) (-.f64 a b)) (-.f64 (neg.f64 a) b))
(/.f64 (*.f64 (+.f64 b a) (-.f64 a b)) (neg.f64 (+.f64 b a)))
(/.f64 (*.f64 (+.f64 b a) (-.f64 b a)) (+.f64 b a))
(/.f64 (-.f64 (pow.f64 a #s(literal 3 binary64)) (pow.f64 b #s(literal 3 binary64))) (neg.f64 (fma.f64 b (+.f64 b a) (*.f64 a a))))
(/.f64 (-.f64 (pow.f64 b #s(literal 3 binary64)) (pow.f64 a #s(literal 3 binary64))) (fma.f64 b (+.f64 b a) (*.f64 a a)))
(/.f64 (-.f64 (pow.f64 b #s(literal 3 binary64)) (pow.f64 a #s(literal 3 binary64))) (fma.f64 b b (*.f64 a (+.f64 b a))))
(neg.f64 (-.f64 a b))
(fma.f64 #s(literal -1 binary64) a b)
(fma.f64 a #s(literal -1 binary64) b)
(-.f64 (/.f64 (.f64 b b) (+.f64 b a)) (/.f64 (.f64 a a) (+.f64 b a)))
(-.f64 (/.f64 (pow.f64 b #s(literal 3 binary64)) (fma.f64 b b (.f64 a (+.f64 b a)))) (/.f64 (pow.f64 a #s(literal 3 binary64)) (fma.f64 b b (.f64 a (+.f64 b a)))))
(-.f64 b a)
(+.f64 (/.f64 (pow.f64 b #s(literal 3 binary64)) (fma.f64 b b (.f64 a (+.f64 b a)))) (/.f64 (pow.f64 (neg.f64 a) #s(literal 3 binary64)) (fma.f64 b b (.f64 a (+.f64 b a)))))
(+.f64 (neg.f64 a) b)
(+.f64 b (neg.f64 a))
b
a
#s(approx (/ (fabs (- a b)) 2) (*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64)))
#s(approx (* 1/2 (fabs (- b a))) (*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64)))
#s(approx (fabs (- b a)) (fabs.f64 (-.f64 a b)))
#s(approx (- b a) b)
#s(approx (- b a) (-.f64 b a))
#s(approx a a)
#s(approx (- b a) (neg.f64 a))
#s(approx (- b a) (*.f64 (-.f64 (/.f64 b a) #s(literal 1 binary64)) a))
#s(approx (/ (fabs (- a b)) 2) (*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64)))
#s(approx (* 1/2 (fabs (- b a))) (*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64)))
#s(approx (fabs (- b a)) (fabs.f64 (-.f64 a b)))
#s(approx (- b a) (*.f64 (-.f64 #s(literal 1 binary64) (/.f64 b a)) (neg.f64 a)))
#s(approx (- b a) (-.f64 b a))
#s(approx b b)
#s(approx (- b a) (*.f64 (-.f64 #s(literal 1 binary64) (/.f64 a b)) b))
#s(approx (/ (fabs (- a b)) 2) (*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64)))
#s(approx (* 1/2 (fabs (- b a))) (*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64)))
#s(approx (fabs (- b a)) (fabs.f64 (-.f64 a b)))
#s(approx (- b a) (*.f64 (-.f64 #s(literal 1 binary64) (/.f64 a b)) b))

eval5.0ms (0.3%)

Memory: 8.3MiB live, 8.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 872 to 205 computations (76.5% saved)

prune4.0ms (0.2%)

Memory

6.8MiB live, 6.8MiB allocated; 0ms collecting garbage

Pruning

3 alts after pruning (2 fresh and 1 done)

	Pruned	Kept	Total
New	43	2	45
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	43	3	46

Accuracy

100.0%

Counts

46 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))
▶	50.8%	#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a)))))
▶	51.3%	#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))

Status

Accuracy

Program

✓

100.0%

#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))

▶

50.8%

#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a)))))

▶

51.3%

#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))

Compiler

Compiled 44 to 36 computations (18.2% saved)

series4.0ms (0.3%)

Memory

6.5MiB live, 6.5MiB allocated; 0ms collecting garbage

Counts

12 → 20

Calls

Call 1

Inputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))
(*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b)))
#s(literal 1/2 binary64)
(fabs.f64 #s(approx (- b a) b))
#s(approx (- b a) b)
b
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a)))))
(*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a))))
(fabs.f64 #s(approx (- b a) (neg.f64 a)))
#s(approx (- b a) (neg.f64 a))
(neg.f64 a)
a

Outputs
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (- a b)))))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (- b a)))))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (- b a))))
#s(approx (- b a) #s(hole binary64 b))
#s(approx (- b a) #s(hole binary64 (+ b (* -1 a))))
#s(approx (neg a) #s(hole binary64 (* -1 a)))
#s(approx a #s(hole binary64 a))
#s(approx (- b a) #s(hole binary64 (* -1 a)))
#s(approx (- b a) #s(hole binary64 (* a (- (/ b a) 1))))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (neg (+ b (* -1 a)))))))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (+ b (* -1 a))))))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (+ b (* -1 a)))))
#s(approx (- b a) #s(hole binary64 (* -1 (* a (+ 1 (* -1 (/ b a)))))))
#s(approx (- b a) #s(hole binary64 (- b a)))
#s(approx b #s(hole binary64 b))
#s(approx (- b a) #s(hole binary64 (* b (+ 1 (* -1 (/ a b))))))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (+ a (* -1 b))))))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (neg (+ a (* -1 b)))))))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (neg (+ a (* -1 b))))))
#s(approx (- b a) #s(hole binary64 (* -1 (* b (- (/ a b) 1)))))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	a	@	-inf	((/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) 1/2 (fabs (- b a)) (- b a) b (/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) (fabs (- b a)) (- b a) (neg a) a)
1.0ms	b	@	-inf	((/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) 1/2 (fabs (- b a)) (- b a) b (/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) (fabs (- b a)) (- b a) (neg a) a)
1.0ms	a	@	inf	((/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) 1/2 (fabs (- b a)) (- b a) b (/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) (fabs (- b a)) (- b a) (neg a) a)
1.0ms	b	@	inf	((/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) 1/2 (fabs (- b a)) (- b a) b (/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) (fabs (- b a)) (- b a) (neg a) a)
0.0ms	a	@	0	((/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) 1/2 (fabs (- b a)) (- b a) b (/ (fabs (- a b)) 2) (* 1/2 (fabs (- b a))) (fabs (- b a)) (- b a) (neg a) a)

rewrite52.0ms (3.2%)

Memory

5.3MiB live, 50.8MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	70	289
0	75	268
1	256	263
0	1744	263

Stop Event

1×	iter limit
1×	iter limit
1×	node limit
1×	iter limit

Counts

32 → 46

Calls

Call 1

Inputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))
(*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b)))
#s(literal 1/2 binary64)
(fabs.f64 #s(approx (- b a) b))
#s(approx (- b a) b)
b
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a)))))
(*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a))))
(fabs.f64 #s(approx (- b a) (neg.f64 a)))
#s(approx (- b a) (neg.f64 a))
(neg.f64 a)
a
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (- a b)))))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (- b a)))))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (- b a))))
#s(approx (- b a) #s(hole binary64 b))
#s(approx (- b a) #s(hole binary64 (+ b (* -1 a))))
#s(approx (neg a) #s(hole binary64 (* -1 a)))
#s(approx a #s(hole binary64 a))
#s(approx (- b a) #s(hole binary64 (* -1 a)))
#s(approx (- b a) #s(hole binary64 (* a (- (/ b a) 1))))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (neg (+ b (* -1 a)))))))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (+ b (* -1 a))))))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (+ b (* -1 a)))))
#s(approx (- b a) #s(hole binary64 (* -1 (* a (+ 1 (* -1 (/ b a)))))))
#s(approx (- b a) #s(hole binary64 (- b a)))
#s(approx b #s(hole binary64 b))
#s(approx (- b a) #s(hole binary64 (* b (+ 1 (* -1 (/ a b))))))
#s(approx (/ (fabs (- a b)) 2) #s(hole binary64 (* 1/2 (fabs (+ a (* -1 b))))))
#s(approx (* 1/2 (fabs (- b a))) #s(hole binary64 (* 1/2 (fabs (neg (+ a (* -1 b)))))))
#s(approx (fabs (- b a)) #s(hole binary64 (fabs (neg (+ a (* -1 b))))))
#s(approx (- b a) #s(hole binary64 (* -1 (* b (- (/ a b) 1)))))

Outputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 (fabs.f64 #s(approx (- b a) b)) #s(literal 1/2 binary64)))
(*.f64 (fabs.f64 #s(approx (- b a) b)) #s(literal 1/2 binary64))
(*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b)))
#s(literal 1/2 binary64)
(*.f64 (sqrt.f64 #s(approx (- b a) b)) (sqrt.f64 #s(approx (- b a) b)))
(pow.f64 (pow.f64 #s(approx (- b a) b) #s(literal 2 binary64)) #s(literal 1/2 binary64))
(sqrt.f64 (pow.f64 #s(approx (- b a) b) #s(literal 2 binary64)))
(fabs.f64 (neg.f64 (neg.f64 #s(approx (- b a) b))))
(fabs.f64 (neg.f64 #s(approx (- b a) b)))
(fabs.f64 #s(approx (- b a) b))
#s(approx (- b a) b)
b
#s(approx (/ (fabs (- a b)) 2) (*.f64 (fabs.f64 #s(approx (- b a) (neg.f64 a))) #s(literal 1/2 binary64)))
(*.f64 (fabs.f64 #s(approx (- b a) (neg.f64 a))) #s(literal 1/2 binary64))
(*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a))))
(*.f64 (sqrt.f64 #s(approx (- b a) (neg.f64 a))) (sqrt.f64 #s(approx (- b a) (neg.f64 a))))
(pow.f64 (pow.f64 #s(approx (- b a) (neg.f64 a)) #s(literal 2 binary64)) #s(literal 1/2 binary64))
(sqrt.f64 (pow.f64 #s(approx (- b a) (neg.f64 a)) #s(literal 2 binary64)))
(fabs.f64 (neg.f64 (neg.f64 #s(approx (- b a) (neg.f64 a)))))
(fabs.f64 (neg.f64 #s(approx (- b a) (neg.f64 a))))
(fabs.f64 #s(approx (- b a) (neg.f64 a)))
#s(approx (- b a) (neg.f64 a))
(*.f64 #s(literal -1 binary64) a)
(*.f64 a #s(literal -1 binary64))
(neg.f64 a)
a
#s(approx (/ (fabs (- a b)) 2) (*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64)))
#s(approx (* 1/2 (fabs (- b a))) (*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64)))
#s(approx (fabs (- b a)) (fabs.f64 (-.f64 a b)))
#s(approx (- b a) b)
#s(approx (- b a) (-.f64 b a))
#s(approx (neg a) (neg.f64 a))
#s(approx a a)
#s(approx (- b a) (neg.f64 a))
#s(approx (- b a) (*.f64 (-.f64 (/.f64 b a) #s(literal 1 binary64)) a))
#s(approx (/ (fabs (- a b)) 2) (*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64)))
#s(approx (* 1/2 (fabs (- b a))) (*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64)))
#s(approx (fabs (- b a)) (fabs.f64 (-.f64 a b)))
#s(approx (- b a) (*.f64 (-.f64 #s(literal 1 binary64) (/.f64 b a)) (neg.f64 a)))
#s(approx (- b a) (-.f64 b a))
#s(approx b b)
#s(approx (- b a) (*.f64 (-.f64 #s(literal 1 binary64) (/.f64 a b)) b))
#s(approx (/ (fabs (- a b)) 2) (*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64)))
#s(approx (* 1/2 (fabs (- b a))) (*.f64 (fabs.f64 (-.f64 a b)) #s(literal 1/2 binary64)))
#s(approx (fabs (- b a)) (fabs.f64 (-.f64 a b)))
#s(approx (- b a) (*.f64 (-.f64 #s(literal 1 binary64) (/.f64 a b)) b))

eval4.0ms (0.2%)

Memory: 5.8MiB live, 5.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 639 to 126 computations (80.3% saved)

prune4.0ms (0.3%)

Memory

7.7MiB live, 7.7MiB allocated; 0ms collecting garbage

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	37	0	37
Fresh	0	0	0
Picked	0	2	2
Done	0	1	1
Total	37	3	40

Accuracy

100.0%

Counts

40 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))
✓	50.8%	#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a)))))
✓	51.3%	#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))

Status

Accuracy

Program

✓

100.0%

#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))

✓

50.8%

#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a)))))

✓

51.3%

#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))

Compiler

Compiled 94 to 61 computations (35.1% saved)

regimes12.0ms (0.7%)

Memory

-26.7MiB live, 19.0MiB allocated; 3ms collecting garbage

Counts

4 → 1

Calls

Call 1

Inputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a)))))
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))
(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))

Outputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))

Calls

5 calls:

4.0ms	b
2.0ms	a
2.0ms	(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))
2.0ms	(fabs.f64 (-.f64 a b))
2.0ms	(-.f64 a b)

Results

Accuracy	Segments	Branch
100.0%	1	`(-.f64 a b)`
100.0%	1	`(fabs.f64 (-.f64 a b))`
100.0%	1	`(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))`
100.0%	1	`a`
100.0%	1	`b`

Compiler

Compiled 15 to 17 computations (-13.3% saved)

regimes7.0ms (0.4%)

Memory

16.0MiB live, 16.0MiB allocated; 0ms collecting garbage

Counts

2 → 2

Calls

Call 1

Inputs

#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))

#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a)))))

Outputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a)))))
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))

Outputs

#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a)))))

#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))

Calls

5 calls:

1.0ms	(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))
1.0ms	(fabs.f64 (-.f64 a b))
1.0ms	b
1.0ms	a
1.0ms	(-.f64 a b)

Results

Accuracy	Segments	Branch
57.6%	4	`(-.f64 a b)`
57.6%	4	`(fabs.f64 (-.f64 a b))`
57.6%	4	`(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))`
82.0%	2	`a`
83.7%	2	`b`

Compiler

Compiled 15 to 17 computations (-13.3% saved)

regimes5.0ms (0.3%)

Memory

11.9MiB live, 11.9MiB allocated; 0ms collecting garbage

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))

Outputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))

Calls

5 calls:

1.0ms	(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))
1.0ms	a
1.0ms	(fabs.f64 (-.f64 a b))
1.0ms	b
1.0ms	(-.f64 a b)

Results

Accuracy	Segments	Branch
51.3%	1	`(fabs.f64 (-.f64 a b))`
51.3%	1	`(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))`
51.3%	1	`(-.f64 a b)`
51.3%	1	`a`
51.3%	1	`b`

Compiler

Compiled 15 to 17 computations (-13.3% saved)

bsearch60.0ms (3.8%)

Memory

-35.3MiB live, 14.6MiB allocated; 11ms collecting garbage

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
59.0ms	1.7835014602974325e-142	2.3101259303144677e-141

Samples

51.0ms

96×

valid

Compiler

Compiled 195 to 173 computations (11.3% saved)

Precisions

Click to see histograms. Total time spent on operations: 49.0ms

ival-div: 48.0ms (98.2% of total)

ival-sub: 1.0ms (2% of total)

ival-fabs: 1.0ms (2% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

simplify57.0ms (3.6%)

Memory

2.4MiB live, 46.7MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	24	63
1	43	63
2	72	63
3	141	63
4	271	63
5	738	63
6	3979	63

Stop Event

1×	node limit

Calls

Call 1

Inputs

#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))

(if (<=.f64 b #s(literal 7894517309150201/3432398830065304857490950399540696608634717650071652704697231729592771591698828026061279820330727277488648155695740429018560993999858321906287014145557528576 binary64)) #s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a))))) #s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b)))))

#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))

Outputs
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 b a))))
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 (-.f64 a b))))
(if (<=.f64 b #s(literal 7894517309150201/3432398830065304857490950399540696608634717650071652704697231729592771591698828026061279820330727277488648155695740429018560993999858321906287014145557528576 binary64)) #s(approx (/ (fabs (- a b)) 2) (.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) (neg.f64 a))))) #s(approx (/ (fabs (- a b)) 2) (.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b)))))
#s(approx (/ (fabs (- a b)) 2) (*.f64 #s(literal 1/2 binary64) (fabs.f64 #s(approx (- b a) b))))

derivations15.0ms (0.9%)

Memory

23.9MiB live, 23.9MiB allocated; 0ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 63 to 24 computations (61.9% saved)

preprocess20.0ms (1.3%)

Memory: -6.3MiB live, 39.2MiB allocated; 4ms collecting garbage
Remove: (sort a b)
Compiler: Compiled 190 to 104 computations (45.3% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

start0.0ms (0%)

analyze0.0ms (0%)

sample804.0ms (50.2%)

explain56.0ms (3.5%)

preprocess273.0ms (17%)

eval0.0ms (0%)

prune0.0ms (0%)

series4.0ms (0.3%)

rewrite101.0ms (6.3%)

eval5.0ms (0.3%)

prune2.0ms (0.1%)

series5.0ms (0.3%)

rewrite104.0ms (6.5%)

eval5.0ms (0.3%)

prune4.0ms (0.2%)

series4.0ms (0.3%)

rewrite52.0ms (3.2%)

eval4.0ms (0.2%)

prune4.0ms (0.3%)

regimes12.0ms (0.7%)

regimes7.0ms (0.4%)

regimes5.0ms (0.3%)

bsearch60.0ms (3.8%)

simplify57.0ms (3.6%)

derivations15.0ms (0.9%)

preprocess20.0ms (1.3%)

end0.0ms (0%)

Profiling