Metrics for logs (example 3.8)

analyze16.0ms (0.2%)

Memory

-10.8MiB live, 5.0MiB allocated

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	23.7%	76.3%	0%	0%	0%	0
0%	0%	23.7%	76.3%	0%	0%	0%	1
50%	11.9%	11.9%	76.3%	0%	0%	0%	2
75%	17.8%	5.9%	76.3%	0%	0%	0%	3
87.5%	20.8%	3%	76.3%	0%	0%	0%	4
93.8%	22.2%	1.5%	76.3%	0%	0%	0%	5
96.9%	23%	0.7%	76.3%	0%	0%	0%	6
98.4%	23.3%	0.4%	76.3%	0%	0%	0%	7
99.2%	23.5%	0.2%	76.3%	0%	0%	0%	8
99.6%	23.6%	0.1%	76.3%	0%	0%	0%	9
99.8%	23.7%	0%	76.3%	0%	0%	0%	10
99.9%	23.7%	0%	76.3%	0%	0%	0%	11
100%	23.7%	0%	76.3%	0%	0%	0%	12

Compiler

Compiled 34 to 21 computations (38.2% saved)

sample7.9s (96.7%)

Memory

-51.3MiB live, 1 894.4MiB allocated

Samples

1.9s	4 332×	1168	valid-baseline
1.2s	4 332×	1168	valid-sollya
1.1s	4 332×	1168	valid-rival
792.0ms	2 449×	584	valid-baseline
529.0ms	2 449×	584	valid-rival
424.0ms	2 449×	584	valid-sollya
283.0ms	1 199×	292	valid-baseline
230.0ms	1 199×	292	valid-rival
102.0ms	1 199×	292	valid-sollya
41.0ms	274×	146	valid-rival
40.0ms	274×	146	valid-baseline
20.0ms	274×	146	valid-sollya
0.0ms	1×	1168	valid-rival+sollya-real
0.0ms	1×	584	valid-rival+baseline-real

Precisions

Click to see Rival histograms. Total time spent on operations: 1.7s

ival-log: 1.1s (66.2% of total)

ival-mult: 204.0ms (11.8% of total)

ival-sub: 137.0ms (7.9% of total)

adjust: 135.0ms (7.8% of total)

ival-add: 94.0ms (5.4% of total)

ival-true: 8.0ms (0.5% of total)

...in/eval/compile.rkt:110:19: 6.0ms (0.3% of total)

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

Precisions

Click to see Base histograms. Total time spent on operations: 2.4s

ival-log: 1.2s (50.7% of total)

ival-mult: 638.0ms (26.7% of total)

ival-sub: 315.0ms (13.2% of total)

ival-add: 190.0ms (7.9% of total)

const: 38.0ms (1.6% of total)

Bogosity

preprocess224.0ms (2.8%)

Memory

5.1MiB live, 21.2MiB allocated

Algorithm

1×	egg-herbie

Rules

1 186×	`fma-define`
470×	`fmm-def`
267×	`sub-neg`
221×	`associate-+l-`
199×	`distribute-rgt-in`

Iterations

Useful iterations: 4 (0.0ms)

Iter	Nodes	Cost
0	23	256
1	61	208
2	161	200
3	505	200
4	1745	196
5	3247	196
6	4060	196
7	4277	196
8	4293	196
9	4293	196
10	5237	196
11	5239	196
12	5239	196

Stop Event

1×

saturated

Calls

Call 1

Inputs
(-.f64 (-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n))) #s(literal 1 binary64))
(-.f64 (-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n))) #s(literal 1 binary64))
(-.f64 (-.f64 (.f64 (+.f64 (neg.f64 n) #s(literal 1 binary64)) (log.f64 (+.f64 (neg.f64 n) #s(literal 1 binary64)))) (.f64 (neg.f64 n) (log.f64 (neg.f64 n)))) #s(literal 1 binary64))
(neg.f64 (-.f64 (-.f64 (.f64 (+.f64 (neg.f64 n) #s(literal 1 binary64)) (log.f64 (+.f64 (neg.f64 n) #s(literal 1 binary64)))) (.f64 (neg.f64 n) (log.f64 (neg.f64 n)))) #s(literal 1 binary64)))

Outputs
(-.f64 (-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n))) #s(literal 1 binary64))
(-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (+.f64 (.f64 n (log.f64 n)) #s(literal 1 binary64)))
(-.f64 (*.f64 (+.f64 n #s(literal 1 binary64)) (log1p.f64 n)) (fma.f64 n (log.f64 n) #s(literal 1 binary64)))
(+.f64 (log1p.f64 n) (fma.f64 n (-.f64 (log1p.f64 n) (log.f64 n)) #s(literal -1 binary64)))
(-.f64 (-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n))) #s(literal 1 binary64))
(-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (+.f64 (.f64 n (log.f64 n)) #s(literal 1 binary64)))
(-.f64 (*.f64 (+.f64 n #s(literal 1 binary64)) (log1p.f64 n)) (fma.f64 n (log.f64 n) #s(literal 1 binary64)))
(+.f64 (log1p.f64 n) (fma.f64 n (-.f64 (log1p.f64 n) (log.f64 n)) #s(literal -1 binary64)))
(-.f64 (-.f64 (.f64 (+.f64 (neg.f64 n) #s(literal 1 binary64)) (log.f64 (+.f64 (neg.f64 n) #s(literal 1 binary64)))) (.f64 (neg.f64 n) (log.f64 (neg.f64 n)))) #s(literal 1 binary64))
(+.f64 (+.f64 (.f64 (+.f64 #s(literal 1 binary64) (neg.f64 n)) (log.f64 (+.f64 #s(literal 1 binary64) (neg.f64 n)))) (.f64 n (log.f64 (neg.f64 n)))) #s(literal -1 binary64))
(+.f64 (fma.f64 (-.f64 #s(literal 1 binary64) n) (log1p.f64 (neg.f64 n)) (*.f64 n (log.f64 (neg.f64 n)))) #s(literal -1 binary64))
(fma.f64 (-.f64 #s(literal 1 binary64) n) (log1p.f64 (neg.f64 n)) (fma.f64 n (log.f64 (neg.f64 n)) #s(literal -1 binary64)))
(fma.f64 n (log.f64 (neg.f64 n)) (fma.f64 (-.f64 #s(literal 1 binary64) n) (log1p.f64 (neg.f64 n)) #s(literal -1 binary64)))
(neg.f64 (-.f64 (-.f64 (.f64 (+.f64 (neg.f64 n) #s(literal 1 binary64)) (log.f64 (+.f64 (neg.f64 n) #s(literal 1 binary64)))) (.f64 (neg.f64 n) (log.f64 (neg.f64 n)))) #s(literal 1 binary64)))
(neg.f64 (+.f64 (+.f64 (.f64 (+.f64 #s(literal 1 binary64) (neg.f64 n)) (log.f64 (+.f64 #s(literal 1 binary64) (neg.f64 n)))) (.f64 n (log.f64 (neg.f64 n)))) #s(literal -1 binary64)))
(neg.f64 (+.f64 (fma.f64 (-.f64 #s(literal 1 binary64) n) (log1p.f64 (neg.f64 n)) (*.f64 n (log.f64 (neg.f64 n)))) #s(literal -1 binary64)))
(-.f64 #s(literal 1 binary64) (fma.f64 n (log.f64 (neg.f64 n)) (*.f64 (-.f64 #s(literal 1 binary64) n) (log1p.f64 (neg.f64 n)))))
(-.f64 #s(literal 1 binary64) (fma.f64 (-.f64 #s(literal 1 binary64) n) (log1p.f64 (neg.f64 n)) (*.f64 n (log.f64 (neg.f64 n)))))

Compiler

Compiled 16 to 9 computations (43.8% saved)

eval0.0ms (0%)

Memory: 0.3MiB live, 0.3MiB allocated
Compiler: Compiled 1 to 1 computations (0% saved)

prune1.0ms (0%)

Memory

1.0MiB live, 1.0MiB allocated

Alt Table

Click to see full alt table

Status	Accuracy	Program
	1.5%	(-.f64 (-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n))) #s(literal 1 binary64))

Compiler

Compiled 32 to 18 computations (43.8% saved)

simplify4.0ms (0%)

Memory

-15.2MiB live, 0.7MiB allocated

Algorithm

1×	egg-herbie

Rules

10×	`neg-mul-1`
9×	`unsub-neg`
8×	`+-commutative`
7×	`*-commutative`
6×	`sub-neg`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	57
1	29	57
2	43	57
3	54	57
4	71	57
5	94	57
6	96	57

Stop Event

1×

saturated

Calls

Call 1

Inputs
(-.f64 (-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n))) #s(literal 1 binary64))

Outputs

(-.f64 (-.f64 (*.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (*.f64 n (log.f64 n))) #s(literal 1 binary64))

(+.f64 (-.f64 (*.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (*.f64 n (log.f64 n))) #s(literal -1 binary64))

soundness0.0ms (0%)

Memory

0.4MiB live, 0.4MiB allocated

Stop Event

1×

fuel

Compiler

Compiled 16 to 10 computations (37.5% saved)

preprocess26.0ms (0.3%)

Memory: 2.3MiB live, 33.3MiB allocated
Compiler: Compiled 114 to 72 computations (36.8% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

analyze16.0ms (0.2%)

sample7.9s (96.7%)

preprocess224.0ms (2.8%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify4.0ms (0%)

soundness0.0ms (0%)

preprocess26.0ms (0.3%)

end0.0ms (0%)

Profiling