Metrics for fabs fraction 2

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.3MiB live, 0.3MiB 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)

sample1.1s (60.9%)

Memory

27.6MiB live, 1 015.2MiB allocated; 247ms collecting garbage

Samples

663.0ms

8 256×

valid

Precisions

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

ival-sub: 129.0ms (38.5% of total)

ival-div: 106.0ms (31.6% of total)

ival-fabs: 85.0ms (25.3% of total)

exact: 9.0ms (2.7% of total)

ival-assert: 4.0ms (1.2% of total)

adjust: 3.0ms (0.9% of total)

Bogosity

explain97.0ms (5.3%)

Memory

-12.3MiB live, 81.8MiB allocated; 12ms 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

58.0ms

512×

valid

Compiler

Compiled 42 to 22 computations (47.6% saved)

Precisions

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

ival-fabs: 25.0ms (63.6% of total)

ival-div: 8.0ms (20.3% of total)

ival-sub: 4.0ms (10.2% of total)

ival-true: 1.0ms (2.5% of total)

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

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

preprocess409.0ms (22.5%)

Memory

-3.6MiB live, 157.1MiB allocated; 17ms 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)

prune1.0ms (0%)

Memory

0.6MiB live, 0.6MiB 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)

series8.0ms (0.4%)

Memory

5.9MiB live, 5.9MiB 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
2.0ms	a	@	inf	((/ (fabs (- a b)) 2) (fabs (- a b)) (- a b) a b 2)
2.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)

rewrite71.0ms (3.9%)

Memory

3.4MiB live, 46.9MiB allocated; 8ms 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: 8.4MiB live, 8.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 584 to 174 computations (70.2% saved)

prune18.0ms (1%)

Memory

-27.0MiB live, 18.0MiB allocated; 5ms collecting garbage

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	47	0	47
Fresh	0	0	0
Picked	0	1	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%	(/.f64 (fabs.f64 (-.f64 a b)) #s(literal 2 binary64))

Compiler

Compiled 12 to 12 computations (0% saved)

simplify90.0ms (5%)

Memory

-2.8MiB live, 52.3MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	6
1	14	6
2	32	6
3	68	6
4	141	6
5	530	6
6	3694	6

Stop Event

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 2 binary64))

derivations0.0ms (0%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 6 to 6 computations (0% saved)

preprocess11.0ms (0.6%)

Memory: 10.3MiB live, 10.3MiB allocated; 0ms collecting garbage
Remove: (sort a b)
Compiler: Compiled 48 to 48 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample1.1s (60.9%)

explain97.0ms (5.3%)

preprocess409.0ms (22.5%)

eval0.0ms (0%)

prune1.0ms (0%)

series8.0ms (0.4%)

rewrite71.0ms (3.9%)

eval5.0ms (0.3%)

prune18.0ms (1%)

simplify90.0ms (5%)

derivations0.0ms (0%)

preprocess11.0ms (0.6%)

end0.0ms (0%)

Profiling