Metrics for Exp of sum of logs

analyze13.0ms (0.8%)

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
0%	0%	99.9%	0.1%	0%	0%	0%	1
0%	0%	99.9%	0.1%	0%	0%	0%	2
25%	25%	74.9%	0.1%	0%	0%	0%	3
33.3%	25%	50%	0.1%	0%	25%	0%	4
44.4%	25%	31.2%	0.1%	0%	43.7%	0%	5
53.3%	25%	21.9%	0.1%	0%	53.1%	0%	6
64%	25%	14%	0.1%	0%	60.9%	0%	7
71.1%	25%	10.1%	0.1%	0%	64.8%	0%	8
79%	25%	6.6%	0.1%	0%	68.3%	0%	9
83.7%	25%	4.9%	0.1%	0%	70%	0%	10
88.6%	25%	3.2%	0.1%	0%	71.7%	0%	11
91.3%	25%	2.4%	0.1%	0%	72.5%	0%	12

Compiler

Compiled 9 to 7 computations (22.2% saved)

sample1.5s (89.7%)

Results

1.2s	7279×	body	256	valid
170.0ms	977×	body	256	infinite
62.0ms	720×	body	256	invalid

Bogosity

preprocess16.0ms (1%)

Algorithm

2×	egg-herbie

Rules

4×	`exp-sum`
4×	`rem-exp-log`
2×	`swap-a-b`
2×	`+-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	38
1	15	14
2	17	14
0	2	2
1	2	2

Stop Event

1×	unsound
1×	saturated

Calls

Call 1

Inputs
0
1

Outputs
0
1
0

Call 2

Inputs
(exp.f64 (+.f64 (log.f64 a) (log.f64 b)))
(exp.f64 (+.f64 (log.f64 b) (log.f64 a)))

Outputs
(exp.f64 (+.f64 (log.f64 a) (log.f64 b)))
(*.f64 a b)
(exp.f64 (+.f64 (log.f64 b) (log.f64 a)))
(exp.f64 (+.f64 (log.f64 a) (log.f64 b)))
(*.f64 a b)

Symmetry

(sort a b)

Compiler

Compiled 10 to 8 computations (20% saved)

simplify21.0ms (1.3%)

Algorithm

1×	egg-herbie

Rules

4×	`exp-sum`
4×	`rem-exp-log`
2×	`+-commutative`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	9	19
1	13	7
2	16	7

Stop Event

1×

saturated

Counts

1 → 2

Calls

Call 1

Inputs
(exp.f64 (+.f64 (log.f64 a) (log.f64 b)))

Outputs
(exp.f64 (+.f64 (log.f64 a) (log.f64 b)))
(*.f64 a b)

eval0.0ms (0%)

Compiler: Compiled 11 to 7 computations (36.4% saved)

prune1.0ms (0.1%)

Pruning

1 alts after pruning (1 fresh and 0 done)

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

Accurracy

100.0%

Counts

3 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 a b)
▶	100.0%	(*.f64 a b)

Compiler

Compiled 10 to 6 computations (40% saved)

localize26.0ms (1.6%)

Compiler: Compiled 8 to 4 computations (50% saved)

eval0.0ms (0%)

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

prune1.0ms (0.1%)

Pruning

1 alts after pruning (0 fresh and 1 done)

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

Accurracy

100.0%

Counts

1 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(*.f64 a b)

Compiler

Compiled 16 to 10 computations (37.5% saved)

regimes22.0ms (1.3%)

Accuracy

Total -5.0b remaining (-∞%)

Threshold costs -5b (-∞%)

Counts

2 → 1

Calls

Call 1

Inputs
(*.f64 a b)
(exp.f64 (+.f64 (log.f64 a) (log.f64 b)))

Outputs
(*.f64 a b)

Calls

6 calls:

6.0ms	(exp.f64 (+.f64 (log.f64 a) (log.f64 b)))
3.0ms	(log.f64 b)
3.0ms	a
3.0ms	(log.f64 a)
3.0ms	(+.f64 (log.f64 a) (log.f64 b))

Results

Accuracy	Segments	Branch
100.0%	1	`a`
100.0%	1	`b`
100.0%	1	`(exp.f64 (+.f64 (log.f64 a) (log.f64 b)))`
100.0%	1	`(+.f64 (log.f64 a) (log.f64 b))`
100.0%	1	`(log.f64 a)`
100.0%	1	`(log.f64 b)`

Compiler

Compiled 40 to 28 computations (30% saved)

simplify4.0ms (0.2%)

Algorithm

1×	egg-herbie

Rules

2×	`*-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	7
1	6	7

Stop Event

1×	done
1×	saturated

Calls

Call 1

Inputs
(*.f64 a b)

Outputs
(*.f64 a b)

Compiler

Compiled 5 to 3 computations (40% saved)

soundness23.0ms (1.4%)

Rules

4×	`exp-sum`
4×	`rem-exp-log`
2×	`+-commutative`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	9	19
1	13	7
2	16	7

Stop Event

1×

saturated

Compiler

Compiled 23 to 11 computations (52.2% saved)

end41.0ms (2.5%)

Remove: (sort a b)
Compiler: Compiled 46 to 30 computations (34.8% saved)

analyze13.0ms (0.8%)

sample1.5s (89.7%)

preprocess16.0ms (1%)

simplify21.0ms (1.3%)

eval0.0ms (0%)

prune1.0ms (0.1%)

localize26.0ms (1.6%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes22.0ms (1.3%)

simplify4.0ms (0.2%)

soundness23.0ms (1.4%)

end41.0ms (2.5%)

Profiling