Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G

Time bar (total: 6.6s)

analyze2.0ms (0%)

Algorithm
1×search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%99.9%0.1%0%0%0%0
100%99.9%0%0.1%0%0%0%1
Compiler

Compiled 11 to 8 computations (27.3% saved)

sample6.2s (93.3%)

Results
791.0ms8253×0valid-sollya
1.5s8253×0valid-rival
0.0ms1×1valid-sollya
0.0ms1×1valid-rival
Bogosity

preprocess363.0ms (5.5%)

Algorithm
1×egg-herbie
Rules
2564×fma-neg
818×unsub-neg
747×fma-define
332×distribute-lft-in
320×distribute-rgt-in
Iterations

Useful iterations: 2 (0.0ms)

IterNodesCost
034328
1120312
2449308
31443308
43917308
55374308
66275308
76394308
86404308
96409308
106484308
116520308
126520308
Stop Event
1×node limit
Calls
Call 1
Inputs
(*.f64 (+.f64 x y) (+.f64 z #s(literal 1 binary64)))
(*.f64 (+.f64 x y) (+.f64 z #s(literal 1 binary64)))
(*.f64 (+.f64 (neg.f64 x) y) (+.f64 z #s(literal 1 binary64)))
(*.f64 (+.f64 x (neg.f64 y)) (+.f64 z #s(literal 1 binary64)))
(*.f64 (+.f64 x y) (+.f64 (neg.f64 z) #s(literal 1 binary64)))
(neg.f64 (*.f64 (+.f64 (neg.f64 x) y) (+.f64 z #s(literal 1 binary64))))
(neg.f64 (*.f64 (+.f64 x (neg.f64 y)) (+.f64 z #s(literal 1 binary64))))
(neg.f64 (*.f64 (+.f64 x y) (+.f64 (neg.f64 z) #s(literal 1 binary64))))
(*.f64 (+.f64 y x) (+.f64 z #s(literal 1 binary64)))
(*.f64 (+.f64 z y) (+.f64 x #s(literal 1 binary64)))
(*.f64 (+.f64 x z) (+.f64 y #s(literal 1 binary64)))
Outputs
(*.f64 (+.f64 x y) (+.f64 z #s(literal 1 binary64)))
(*.f64 (+.f64 x y) (+.f64 z #s(literal 1 binary64)))
(*.f64 (+.f64 (neg.f64 x) y) (+.f64 z #s(literal 1 binary64)))
(*.f64 (+.f64 z #s(literal 1 binary64)) (+.f64 y (neg.f64 x)))
(*.f64 (+.f64 z #s(literal 1 binary64)) (-.f64 y x))
(*.f64 (+.f64 x (neg.f64 y)) (+.f64 z #s(literal 1 binary64)))
(*.f64 (+.f64 z #s(literal 1 binary64)) (-.f64 x y))
(*.f64 (+.f64 x y) (+.f64 (neg.f64 z) #s(literal 1 binary64)))
(*.f64 (+.f64 x y) (+.f64 #s(literal 1 binary64) (neg.f64 z)))
(*.f64 (+.f64 x y) (-.f64 #s(literal 1 binary64) z))
(neg.f64 (*.f64 (+.f64 (neg.f64 x) y) (+.f64 z #s(literal 1 binary64))))
(*.f64 (+.f64 z #s(literal 1 binary64)) (-.f64 x y))
(neg.f64 (*.f64 (+.f64 x (neg.f64 y)) (+.f64 z #s(literal 1 binary64))))
(*.f64 (+.f64 z #s(literal 1 binary64)) (+.f64 y (neg.f64 x)))
(*.f64 (+.f64 z #s(literal 1 binary64)) (-.f64 y x))
(neg.f64 (*.f64 (+.f64 x y) (+.f64 (neg.f64 z) #s(literal 1 binary64))))
(*.f64 (neg.f64 (+.f64 x y)) (+.f64 #s(literal 1 binary64) (neg.f64 z)))
(*.f64 (-.f64 #s(literal 1 binary64) z) (neg.f64 (+.f64 x y)))
(*.f64 (+.f64 x y) (+.f64 z #s(literal -1 binary64)))
(*.f64 (+.f64 y x) (+.f64 z #s(literal 1 binary64)))
(*.f64 (+.f64 x y) (+.f64 z #s(literal 1 binary64)))
(*.f64 (+.f64 z y) (+.f64 x #s(literal 1 binary64)))
(*.f64 (+.f64 y z) (+.f64 x #s(literal 1 binary64)))
(*.f64 (+.f64 x z) (+.f64 y #s(literal 1 binary64)))
Symmetry

(sort x y)

Compiler

Compiled 10 to 7 computations (30% saved)

eval1.0ms (0%)

Compiler

Compiled 3 to 3 computations (0% saved)

prune3.0ms (0%)

Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(*.f64 (+.f64 x y) (+.f64 z #s(literal 1 binary64)))
Compiler

Compiled 20 to 14 computations (30% saved)

simplify3.0ms (0.1%)

Algorithm
1×egg-herbie
Rules
3×1-exp
2×+-commutative
1×*-commutative
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01328
12228
Stop Event
1×saturated
Calls
Call 1
Inputs
(*.f64 (+.f64 x y) (+.f64 z #s(literal 1 binary64)))
Outputs
(*.f64 (+.f64 x y) (+.f64 z #s(literal 1 binary64)))

soundness1.0ms (0%)

Stop Event
1×fuel
Compiler

Compiled 10 to 7 computations (30% saved)

preprocess75.0ms (1.1%)

Remove

(sort x y)

Compiler

Compiled 80 to 56 computations (30% saved)

end0.0ms (0%)

Profiling

Loading profile data...