Metrics for logs (example 3.8)

analyze3.0ms (0.1%)

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 19 to 11 computations (42.1% saved)

Precisions

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

ival-log: 1.0ms (68.4% of total)

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

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

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

const: 0.0ms (0% of total)

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

sample2.6s (84.5%)

Results

1.4s	4296×	1024	valid
444.0ms	2168×	512	valid
246.0ms	509×	2048	valid
131.0ms	1283×	256	valid

Precisions

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

ival-log: 957.0ms (54.1% of total)

ival-mult: 340.0ms (19.2% of total)

ival-sub: 222.0ms (12.5% of total)

ival-add: 124.0ms (7% of total)

ival->: 103.0ms (5.8% of total)

const: 23.0ms (1.3% of total)

Bogosity

preprocess222.0ms (7.3%)

Algorithm

1×	egg-herbie

Rules

1186×	`fma-define`
470×	`fma-neg`
276×	`sub-neg`
225×	`associate-+l-`
206×	`unsub-neg`

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	3243	196
6	4066	196
7	4274	196
8	4290	196
9	4290	196
10	5234	196
11	5236	196
12	5236	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)))))

explain208.0ms (6.9%)

FPErrors

Click to see full error table

Ground Truth	Example	Example	Subexpression
256	-	-	`(-.f64 (.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64)))) (.f64 n (log.f64 n)))`
0	-	-	`(log.f64 (+.f64 n #s(literal 1 binary64)))`
0	-	-	`(*.f64 n (log.f64 n))`
0	-	-	`(log.f64 n)`
0	-	-	`(-.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))`
0	-	-	`(+.f64 n #s(literal 1 binary64))`
0	-	-	`#s(literal 1 binary64)`
0	-	-	`(*.f64 (+.f64 n #s(literal 1 binary64)) (log.f64 (+.f64 n #s(literal 1 binary64))))`
0	-	-	`n`

Results

92.0ms	262×	1024	valid
36.0ms	134×	512	valid
15.0ms	28×	2048	valid
10.0ms	88×	256	valid

Compiler

Compiled 122 to 29 computations (76.2% saved)

Precisions

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

ival-log: 58.0ms (55.8% of total)

ival-mult: 20.0ms (19.2% of total)

ival-sub: 17.0ms (16.4% of total)

ival-add: 8.0ms (7.7% of total)

const: 2.0ms (1.9% of total)

eval0.0ms (0%)

Compiler: Compiled 1 to 1 computations (0% saved)

prune1.0ms (0%)

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)

simplify3.0ms (0.1%)

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%)

Stop Event

1×

fuel

Compiler

Compiled 16 to 10 computations (37.5% saved)

preprocess33.0ms (1.1%)

Compiler: Compiled 114 to 72 computations (36.8% saved)

logs (example 3.8)

analyze3.0ms (0.1%)

sample2.6s (84.5%)

preprocess222.0ms (7.3%)

explain208.0ms (6.9%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify3.0ms (0.1%)

soundness0.0ms (0%)

preprocess33.0ms (1.1%)

end0.0ms (0%)

Profiling