Metrics for simple fma test

start0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB 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 15 to 10 computations (33.3% saved)

sample1.4s (72.2%)

Memory

1.0MiB live, 694.7MiB allocated; 949ms collecting garbage

Samples

741.0ms	6 125×	1	valid
368.0ms	2 131×	0	valid

Precisions

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

ival-mult!: 375.0ms (53.9% of total)

adjust: 205.0ms (29.5% of total)

ival-add!: 85.0ms (12.2% of total)

ival-sub!: 30.0ms (4.3% of total)

Bogosity

preprocess50.0ms (2.6%)

Memory

1.6MiB live, 47.9MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	37	136
1	155	130
2	587	10
3	2509	10

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	13.3%	(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z)))

Symmetry

(abs x)

(abs y)

(abs z)

(sort x y z)

Compiler

Compiled 24 to 18 computations (25% saved)

series72.0ms (3.7%)

Memory

25.5MiB live, 71.1MiB allocated; 12ms collecting garbage

Counts

9 → 21

Calls

Call 1

Inputs
(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z)))
(fma.f64 x y z)
x
y
z
(+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z))
#s(literal 1 binary64)
(+.f64 (*.f64 x y) z)
(*.f64 x y)

Outputs
#s(approx (- (+ (* x y) z) (+ 1 (+ (* x y) z))) #s(literal -1 binary64))
#s(approx (+ (* x y) z) z)
#s(approx (+ (* x y) z) (+.f64 z (*.f64 x y)))
#s(approx x x)
#s(approx (+ 1 (+ (* x y) z)) (+.f64 #s(literal 1 binary64) z))
#s(approx (+ 1 (+ (* x y) z)) (+.f64 #s(literal 1 binary64) (+.f64 z (*.f64 x y))))
#s(approx (* x y) (*.f64 x y))
#s(approx (+ (* x y) z) (*.f64 x (+.f64 y (/.f64 z x))))
#s(approx (+ 1 (+ (* x y) z)) (*.f64 x (+.f64 y (+.f64 (/.f64 #s(literal 1 binary64) x) (/.f64 z x)))))
#s(approx (+ (* x y) z) (.f64 #s(literal -1 binary64) (.f64 x (fma.f64 #s(literal -1 binary64) y (*.f64 #s(literal -1 binary64) (/.f64 z x))))))
#s(approx (+ 1 (+ (* x y) z)) (.f64 #s(literal -1 binary64) (.f64 x (fma.f64 #s(literal -1 binary64) y (*.f64 #s(literal -1 binary64) (/.f64 (+.f64 #s(literal 1 binary64) z) x))))))
#s(approx y y)
#s(approx (+ (* x y) z) (*.f64 y (+.f64 x (/.f64 z y))))
#s(approx (+ 1 (+ (* x y) z)) (*.f64 y (+.f64 x (+.f64 (/.f64 #s(literal 1 binary64) y) (/.f64 z y)))))
#s(approx (+ (* x y) z) (.f64 #s(literal -1 binary64) (.f64 y (fma.f64 #s(literal -1 binary64) x (*.f64 #s(literal -1 binary64) (/.f64 z y))))))
#s(approx (+ 1 (+ (* x y) z)) (.f64 #s(literal -1 binary64) (.f64 y (fma.f64 #s(literal -1 binary64) x (*.f64 #s(literal -1 binary64) (/.f64 (+.f64 #s(literal 1 binary64) z) y))))))
#s(approx (+ 1 (+ (* x y) z)) (+.f64 #s(literal 1 binary64) (*.f64 x y)))
#s(approx (+ (* x y) z) (.f64 z (+.f64 #s(literal 1 binary64) (/.f64 (.f64 x y) z))))
#s(approx (+ 1 (+ (* x y) z)) (.f64 z (+.f64 #s(literal 1 binary64) (+.f64 (/.f64 #s(literal 1 binary64) z) (/.f64 (.f64 x y) z)))))
#s(approx (+ (* x y) z) (.f64 #s(literal -1 binary64) (.f64 z (-.f64 (.f64 #s(literal -1 binary64) (/.f64 (.f64 x y) z)) #s(literal 1 binary64)))))
#s(approx (+ 1 (+ (* x y) z)) (.f64 #s(literal -1 binary64) (.f64 z (-.f64 (.f64 #s(literal -1 binary64) (/.f64 (+.f64 #s(literal 1 binary64) (.f64 x y)) z)) #s(literal 1 binary64)))))

Calls

9 calls:

Time	Variable	Point
1.0ms	x	inf
1.0ms	x	-inf
1.0ms	y	-inf
1.0ms	y	inf
1.0ms	y	0

rewrite157.0ms (8.1%)

Memory

-14.2MiB live, 86.7MiB allocated; 25ms collecting garbage

Counts

9 → 29

Calls

Call 1

Inputs
(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z)))
(fma.f64 x y z)
x
y
z
(+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z))
#s(literal 1 binary64)
(+.f64 (*.f64 x y) z)
(*.f64 x y)

Outputs
(+.f64 (*.f64 x y) (-.f64 z (+.f64 #s(literal 1 binary64) (fma.f64 x y z))))
(+.f64 (fma.f64 x y z) (neg.f64 (+.f64 #s(literal 1 binary64) (fma.f64 x y z))))
(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (fma.f64 x y z)))
(-.f64 (-.f64 (fma.f64 x y z) #s(literal 1 binary64)) (fma.f64 x y z))
(fma.f64 x y (-.f64 z (+.f64 #s(literal 1 binary64) (fma.f64 x y z))))
(fma.f64 y x (-.f64 z (+.f64 #s(literal 1 binary64) (fma.f64 x y z))))
(neg.f64 (-.f64 (+.f64 #s(literal 1 binary64) (fma.f64 x y z)) (fma.f64 x y z)))
(+.f64 (*.f64 x y) z)
(+.f64 z (*.f64 x y))
(-.f64 (*.f64 x y) (neg.f64 z))
(fma.f64 x y z)
(fma.f64 y x z)
x
y
z
(+.f64 #s(literal 1 binary64) (fma.f64 x y z))
(+.f64 (fma.f64 x y z) #s(literal 1 binary64))
(+.f64 (+.f64 #s(literal 1 binary64) (*.f64 x y)) z)
(-.f64 #s(literal 1 binary64) (neg.f64 (fma.f64 x y z)))
#s(literal 1 binary64)
(cosh.f64 #s(literal 0 binary64))
(exp.f64 #s(literal 0 binary64))
(+.f64 (*.f64 x y) z)
(+.f64 z (*.f64 x y))
(-.f64 (*.f64 x y) (neg.f64 z))
(fma.f64 x y z)
(fma.f64 y x z)
(*.f64 x y)
(*.f64 y x)

eval8.0ms (0.4%)

Memory: 4.9MiB live, 4.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 667 to 154 computations (76.9% saved)

prune3.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	38	1	39
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	39	1	40

Accuracy

100.0%

Counts

40 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	#s(approx (- (+ (* x y) z) (+ 1 (+ (* x y) z))) #s(literal -1 binary64))

Compiler

Compiled 15 to 10 computations (33.3% saved)

series97.0ms (5%)

Memory

-11.5MiB live, 34.9MiB allocated; 7ms collecting garbage

Counts

2 → 1

Calls

Call 1

Inputs
#s(approx (- (+ (* x y) z) (+ 1 (+ (* x y) z))) #s(literal -1 binary64))
#s(literal -1 binary64)

Outputs
#s(approx (- (+ (* x y) z) (+ 1 (+ (* x y) z))) #s(literal -1 binary64))

Calls

9 calls:

Time	Variable	Point
0.0ms	x	0
0.0ms	y	0
0.0ms	x	-inf
0.0ms	z	-inf
0.0ms	y	inf

rewrite128.0ms (6.6%)

Memory

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

Counts

2 → 2

Calls

Call 1

Inputs
#s(approx (- (+ (* x y) z) (+ 1 (+ (* x y) z))) #s(literal -1 binary64))
#s(literal -1 binary64)

Outputs
#s(approx (- (+ (* x y) z) (+ (+ 1 (* x y)) z)) #s(literal -1 binary64))
#s(literal -1 binary64)

eval4.0ms (0.2%)

Memory: -46.6MiB live, 0.2MiB allocated; 5ms collecting garbage
Compiler: Compiled 15 to 11 computations (26.7% saved)

prune1.0ms (0%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	1	0	1
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	1	1	2

Accuracy

100.0%

Counts

2 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	#s(approx (- (+ (* x y) z) (+ 1 (+ (* x y) z))) #s(literal -1 binary64))

Compiler

Compiled 15 to 10 computations (33.3% saved)

regimes5.0ms (0.3%)

Memory

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

Accuracy

Total -55.5b remaining (-∞%)

Threshold costs -55.5b (-∞%)

Counts

2 → 1

Calls

Call 1

Inputs
#s(approx (- (+ (* x y) z) (+ 1 (+ (* x y) z))) #s(literal -1 binary64))
(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z)))

Outputs
#s(approx (- (+ (* x y) z) (+ 1 (+ (* x y) z))) #s(literal -1 binary64))

Calls

4 calls:

1.0ms	y
1.0ms	z
1.0ms	x
1.0ms	(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z)))

Results

Accuracy	Segments	Branch
100.0%	1	`(-.f64 (fma.f64 x y z) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 x y) z)))`
100.0%	1	`x`
100.0%	1	`y`
100.0%	1	`z`

Compiler

Compiled 42 to 34 computations (19% saved)

derivations0.0ms (0%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 15 to 10 computations (33.3% saved)

preprocess16.0ms (0.8%)

Memory

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

Remove

(sort x y z)

(abs z)

(abs y)

(abs x)

Compiler

Compiled 148 to 103 computations (30.4% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample1.4s (72.2%)

preprocess50.0ms (2.6%)

series72.0ms (3.7%)

rewrite157.0ms (8.1%)

eval8.0ms (0.4%)

prune3.0ms (0.1%)

series97.0ms (5%)

rewrite128.0ms (6.6%)

eval4.0ms (0.2%)

prune1.0ms (0%)

regimes5.0ms (0.3%)

derivations0.0ms (0%)

preprocess16.0ms (0.8%)

end0.0ms (0%)

Profiling