Metrics for FastMath test1

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

Algorithm

1×

Search

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

Compiler

Compiled 9 to 8 computations (11.1% saved)

sample574.0ms (7.9%)

Memory

-21.6MiB live, 249.6MiB allocated; 107ms collecting garbage

Samples

349.0ms

8 256×

valid

Precisions

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

ival-mult!: 126.0ms (75.7% of total)

ival-add!: 39.0ms (23.4% of total)

adjust: 1.0ms (0.6% of total)

Bogosity

preprocess17.0ms (0.2%)

Memory

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

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	11	10
1	33	10
2	86	9
3	98	9

Stop Event

1×

saturated

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.6%	(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))

Symmetry

(negabs d)

Compiler

Compiled 12 to 12 computations (0% saved)

series71.0ms (1%)

Memory

-26.8MiB live, 63.7MiB allocated; 15ms collecting garbage

Counts

6 → 4

Calls

Call 1

Inputs
(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))
(*.f64 d #s(literal 10 binary64))
d
#s(literal 10 binary64)
(*.f64 d #s(literal 20 binary64))
#s(literal 20 binary64)

Outputs
#s(approx (+ (* d 10) (* d 20)) (*.f64 #s(literal 30 binary64) d))
#s(approx (* d 10) (*.f64 #s(literal 10 binary64) d))
#s(approx d d)
#s(approx (* d 20) (*.f64 #s(literal 20 binary64) d))

Calls

3 calls:

Time	Variable		Point	Expression
2.0ms	d	@	-inf	((+ (* d 10) (* d 20)) (* d 10) d 10 (* d 20) 20)
1.0ms	d	@	inf	((+ (* d 10) (* d 20)) (* d 10) d 10 (* d 20) 20)
1.0ms	d	@	0	((+ (* d 10) (* d 20)) (* d 10) d 10 (* d 20) 20)

rewrite3.4s (47.6%)

Memory

-37.9MiB live, 2 156.8MiB allocated; 1.6s collecting garbage

Counts

6 → 33

Calls

Call 1

Inputs
(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))
(*.f64 d #s(literal 10 binary64))
d
#s(literal 10 binary64)
(*.f64 d #s(literal 20 binary64))
#s(literal 20 binary64)

Outputs
(*.f64 (+.f64 #s(literal 20 binary64) #s(literal 10 binary64)) d)
(*.f64 d (+.f64 #s(literal 20 binary64) #s(literal 10 binary64)))
(*.f64 (-.f64 (neg.f64 #s(literal 10 binary64)) #s(literal 20 binary64)) (neg.f64 d))
(*.f64 (neg.f64 d) (-.f64 (neg.f64 #s(literal 10 binary64)) #s(literal 20 binary64)))
(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))
(+.f64 (.f64 d #s(literal 20 binary64)) (.f64 d #s(literal 10 binary64)))
(-.f64 (.f64 d #s(literal 10 binary64)) (neg.f64 (.f64 d #s(literal 20 binary64))))
(-.f64 (.f64 d #s(literal 20 binary64)) (neg.f64 (.f64 d #s(literal 10 binary64))))
(fma.f64 (neg.f64 #s(literal 10 binary64)) (neg.f64 d) (*.f64 d #s(literal 20 binary64)))
(fma.f64 (neg.f64 #s(literal 20 binary64)) (neg.f64 d) (*.f64 d #s(literal 10 binary64)))
(fma.f64 (neg.f64 d) (neg.f64 #s(literal 20 binary64)) (*.f64 d #s(literal 10 binary64)))
(fma.f64 (neg.f64 d) (neg.f64 #s(literal 10 binary64)) (*.f64 d #s(literal 20 binary64)))
(fma.f64 d #s(literal 10 binary64) (*.f64 d #s(literal 20 binary64)))
(fma.f64 d #s(literal 20 binary64) (*.f64 d #s(literal 10 binary64)))
(fma.f64 #s(literal 10 binary64) d (*.f64 d #s(literal 20 binary64)))
(fma.f64 #s(literal 20 binary64) d (*.f64 d #s(literal 10 binary64)))
(neg.f64 (*.f64 (-.f64 (neg.f64 #s(literal 10 binary64)) #s(literal 20 binary64)) d))
(*.f64 d #s(literal 10 binary64))
(*.f64 #s(literal 10 binary64) d)
(*.f64 (neg.f64 #s(literal 10 binary64)) (neg.f64 d))
(*.f64 (neg.f64 d) (neg.f64 #s(literal 10 binary64)))
(neg.f64 (neg.f64 (*.f64 d #s(literal 10 binary64))))
d
(neg.f64 (neg.f64 d))
#s(literal 10 binary64)
(neg.f64 (neg.f64 #s(literal 10 binary64)))
(*.f64 d #s(literal 20 binary64))
(*.f64 #s(literal 20 binary64) d)
(*.f64 (neg.f64 #s(literal 20 binary64)) (neg.f64 d))
(*.f64 (neg.f64 d) (neg.f64 #s(literal 20 binary64)))
(neg.f64 (neg.f64 (*.f64 d #s(literal 20 binary64))))
#s(literal 20 binary64)
(neg.f64 (neg.f64 #s(literal 20 binary64)))

eval3.0ms (0%)

Memory: 5.5MiB live, 5.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 120 to 71 computations (40.8% saved)

prune1.0ms (0%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	30	1	31
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	31	1	32

Accuracy

100.0%

Counts

32 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	#s(approx (+ (* d 10) (* d 20)) (*.f64 #s(literal 30 binary64) d))

Compiler

Compiled 9 to 9 computations (0% saved)

series73.0ms (1%)

Memory

2.5MiB live, 49.2MiB allocated; 5ms collecting garbage

Counts

4 → 2

Calls

Call 1

Inputs
#s(approx (+ (* d 10) (* d 20)) (*.f64 #s(literal 30 binary64) d))
(*.f64 #s(literal 30 binary64) d)
#s(literal 30 binary64)
d

Outputs
#s(approx (+ (* d 10) (* d 20)) (*.f64 #s(literal 30 binary64) d))
#s(approx d d)

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	d	@	-inf	((+ (* d 10) (* d 20)) (* 30 d) 30 d)
1.0ms	d	@	inf	((+ (* d 10) (* d 20)) (* 30 d) 30 d)
1.0ms	d	@	0	((+ (* d 10) (* d 20)) (* 30 d) 30 d)

rewrite3.0s (41.8%)

Memory

75.9MiB live, 1 950.0MiB allocated; 374ms collecting garbage

Counts

4 → 9

Calls

Call 1

Inputs
#s(approx (+ (* d 10) (* d 20)) (*.f64 #s(literal 30 binary64) d))
(*.f64 #s(literal 30 binary64) d)
#s(literal 30 binary64)
d

Outputs
#s(approx (* d (+ 20 10)) (*.f64 #s(literal 30 binary64) d))
(*.f64 #s(literal 30 binary64) d)
(*.f64 d #s(literal 30 binary64))
(*.f64 (neg.f64 #s(literal 30 binary64)) (neg.f64 d))
(*.f64 (neg.f64 d) (neg.f64 #s(literal 30 binary64)))
(neg.f64 (neg.f64 (*.f64 #s(literal 30 binary64) d)))
#s(literal 30 binary64)
d
(neg.f64 (neg.f64 d))

eval1.0ms (0%)

Memory: 0.8MiB live, 0.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 32 to 28 computations (12.5% saved)

prune1.0ms (0%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	7	0	7
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	7	1	8

Accuracy

100.0%

Counts

8 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	#s(approx (+ (* d 10) (* d 20)) (*.f64 #s(literal 30 binary64) d))

Compiler

Compiled 23 to 23 computations (0% saved)

regimes3.0ms (0%)

Memory

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

Accuracy

Total -0.2b remaining (-∞%)

Threshold costs -0.2b (-∞%)

Counts

2 → 1

Calls

Call 1

Inputs
#s(approx (+ (* d 10) (* d 20)) (*.f64 #s(literal 30 binary64) d))
(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))

Outputs
#s(approx (+ (* d 10) (* d 20)) (*.f64 #s(literal 30 binary64) d))

Calls

2 calls:

1.0ms	d
1.0ms	(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))

Results

Accuracy	Segments	Branch
100.0%	1	`(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))`
100.0%	1	`d`

Compiler

Compiled 7 to 7 computations (0% saved)

derivations0.0ms (0%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 9 to 9 computations (0% saved)

preprocess17.0ms (0.2%)

Memory: -32.2MiB live, 13.3MiB allocated; 4ms collecting garbage
Remove: (negabs d)
Compiler: Compiled 36 to 36 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample574.0ms (7.9%)

preprocess17.0ms (0.2%)

series71.0ms (1%)

rewrite3.4s (47.6%)

eval3.0ms (0%)

prune1.0ms (0%)

series73.0ms (1%)

rewrite3.0s (41.8%)

eval1.0ms (0%)

prune1.0ms (0%)

regimes3.0ms (0%)

derivations0.0ms (0%)

preprocess17.0ms (0.2%)

end0.0ms (0%)

Profiling