< 1665965076 278693 :Soni!~quassel@autistic.space QUIT :Ping timeout: 264 seconds < 1665965556 413588 :int-e!~noone@int-e.eu PRIVMSG #esolangs :... savannah.gnu.org just went down? < 1665965632 499380 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :b_jonas: I bought some fascicles. < 1665965708 342935 :int-e!~noone@int-e.eu PRIVMSG #esolangs :I read some of the pre-fascicles. Not sure yet about buying the book... if anything it'll be a christmas thing I guess. < 1665965734 783130 :int-e!~noone@int-e.eu PRIVMSG #esolangs :I'm definitely not in a hurry < 1665965761 430865 :int-e!~noone@int-e.eu PRIVMSG #esolangs :hmm... apart from kissat, what other sat solver should I throw at this < 1665965819 410792 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :At what? < 1665965838 619728 :int-e!~noone@int-e.eu PRIVMSG #esolangs :I wish http://satcompetition.org/ would list winners for 2019-2021 as well. < 1665965869 289074 :int-e!~noone@int-e.eu PRIVMSG #esolangs :At... I guess something that qualifies as a "hard combinatorial problem" (cf. https://research.ibm.com/haifa/ponderthis/challenges/October2022.html ) < 1665965998 178653 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :From what I remember of the SAT solver competition results, vbs was a very good solver. < 1665966031 146179 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :(Sorry, I don't know which solvers are state-of-the-art these days.) < 1665966060 219515 :int-e!~noone@int-e.eu PRIVMSG #esolangs :(Or the individual competition pages. Sure, the information is there somewhere... result CSVs for the tracks, huge submissions tarballs, proceedings... but they're not accessible) < 1665966121 210035 :int-e!~noone@int-e.eu PRIVMSG #esolangs :Hmm. This maybe? https://github.com/simewu/top-SAT-solvers-2021 < 1665966276 769672 :int-e!~noone@int-e.eu PRIVMSG #esolangs :Oh it's a joke. < 1665966278 540101 :int-e!~noone@int-e.eu PRIVMSG #esolangs :MEH. < 1665966331 160841 :int-e!~noone@int-e.eu PRIVMSG #esolangs :(not the github link; the reference to VBS) < 1665966394 840372 :int-e!~noone@int-e.eu PRIVMSG #esolangs :`? vbs < 1665966397 231858 :HackEso!~h@techne.zem.fi PRIVMSG #esolangs :vbs? ¯\(°​_o)/¯ < 1665966634 240494 :int-e!~noone@int-e.eu PRIVMSG #esolangs :TIL what vivification is in SAT solving < 1665966635 777624 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :Oh, sorry. < 1665966657 330201 :int-e!~noone@int-e.eu PRIVMSG #esolangs :shachaf: It's okay, I just took way longer to realize than I like. < 1665966673 297414 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :I should've been clearer. < 1665966696 980767 :int-e!~noone@int-e.eu PRIVMSG #esolangs :Nah you had reason to believe that I should know that acronym. < 1665966734 101437 :int-e!~noone@int-e.eu PRIVMSG #esolangs :And I have encountered it before. < 1665966755 831530 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :Hmm, I don't know what vivification is. < 1665966835 610543 :int-e!~noone@int-e.eu PRIVMSG #esolangs :It's for removal of redundant literals from clauses... https://home.mis.u-picardie.fr/~cli/clauseVivificationPublishedVersion.pdf is what I looked at. < 1665966995 931545 :int-e!~noone@int-e.eu PRIVMSG #esolangs :The other thing I'm wondering is whether there's anything bad about using a sorting network for encoding a cardinality constraint "at least n out of 148". < 1665967116 666964 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :When is a literal redundant? < 1665967153 245268 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :I guess their answer is "when the clause without that literal is implied by the other clauses". < 1665967160 105372 :int-e!~noone@int-e.eu PRIVMSG #esolangs :shachaf: The criterion they use is that l is redundant in l v C if asserting ~C and unit propagation lead to a conflict. < 1665967185 139091 :b_jonas!~x@adsl-89-134-13-99.monradsl.monornet.hu PRIVMSG #esolangs :I think for just getting 108 on the ponder this you don't need a SAT solver < 1665967240 930432 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :That seems kind of expensive to check! < 1665967241 999456 :int-e!~noone@int-e.eu PRIVMSG #esolangs :b_jonas: Yeah, and not for 110 either. < 1665967244 657626 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :I guess that's the point of this paper. < 1665967261 879573 :int-e!~noone@int-e.eu PRIVMSG #esolangs :shachaf: It is. < 1665967425 878253 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :The thing I said is too general, of course. For example the empty clause is implied by any UNSAT instance. < 1665967457 222908 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :And also by "other clauses" I meant "all clauses". < 1665967459 231349 :int-e!~noone@int-e.eu PRIVMSG #esolangs :"Unfortunately, it is not easy to make clause vivification effective because of its high cost." < 1665967476 738903 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :But if you restrict it to unit propagation -- which still seems hard? -- don't you lose a lot of the benefits? < 1665967541 110278 :int-e!~noone@int-e.eu PRIVMSG #esolangs :Well, as they also point out in that paper, identifying redundant literals is still NP-hard. < 1665967570 207862 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :Right, for example for the reason I said, I imagine. < 1665967611 541103 :int-e!~noone@int-e.eu PRIVMSG #esolangs :While the approximation is polynomial (and mostly linear), and furthermore based on something SAT solvers already do very efficiently. < 1665967638 890644 :int-e!~noone@int-e.eu PRIVMSG #esolangs :Well, the DPLL/CDCL ones anyway. < 1665967692 871000 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :Don't you still need to pick which literal to check? I guess that's bounded by your instance size. < 1665967695 881464 :int-e!~noone@int-e.eu PRIVMSG #esolangs :(Somehow the "DPLL" acronym has disappeared. Or maybe that's just an Armin Biere thing?) < 1665967719 960486 :int-e!~noone@int-e.eu PRIVMSG #esolangs :shachaf: It's also bounded by the clause size. < 1665967735 525098 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :I mean, if you check all your clauses. < 1665967810 541988 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :I can probably excuse people for it being ancient history when no one knew how to do algorithms yet, but it seems a little odd that DPLL is even a named algorithm. < 1665967838 415814 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :I guess people also don't do pure literal elimination, so really no one does DPLL. < 1665967838 869786 :int-e!~noone@int-e.eu PRIVMSG #esolangs :And they actually restrict it further (relying on ordering the clause's literals) so that only one trail (alternating between asserting a negated literal and unit propagation) is created, rather than a (at least partially) new trail for each literal. < 1665967885 437382 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :I should read this in more detail probably. < 1665967898 524482 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :Also I should get back to SAT solvers! I had a great time working on my CDCL solver. < 1665967920 858113 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :I still need to add a better variable ordering heuristic. I think that's the biggest impact thing I can do. < 1665967944 813770 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :Some people do VSIDS but I hear rumors about move-to-front being good. < 1665967952 447189 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :Or also more complicated things. < 1665967968 900427 :int-e!~noone@int-e.eu PRIVMSG #esolangs :Hmm. I don't know whether people do this as an in-processing technique, but one thing you can do to eliminate a variable is to resolve each pair (x v C, -x v D) in the clause set. The pure literal rule is a special case of that. < 1665968003 202710 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :That's the original DP algorithm, right? < 1665968030 820951 :int-e!~noone@int-e.eu PRIVMSG #esolangs :I don't know. < 1665968042 610063 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :This thing: https://en.wikipedia.org/wiki/Davis%E2%80%93Putnam_algorithm < 1665968059 302918 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :Hmm, I guess it has a bunch of other steps. < 1665968069 301565 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :«Today, the term "Davis–Putnam algorithm" is often used synonymously with the resolution-based propositional decision procedure (Davis–Putnam procedure) that is actually only one of the steps of the original algorithm.» < 1665968150 111370 :int-e!~noone@int-e.eu PRIVMSG #esolangs :Yeah, it's the DP procedure there. < 1665968167 817503 :Lord_of_Life!~Lord@user/lord-of-life/x-2819915 QUIT :Ping timeout: 246 seconds < 1665968186 952164 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :I falsely remembered it as the only thing that algorithm did. < 1665968192 492027 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :Now it seems a lot more reasonable. < 1665968240 176759 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :I didn't think of pure literal elimination as a special case of that, that's funny. < 1665968243 4034 :Lord_of_Life!~Lord@user/lord-of-life/x-2819915 JOIN #esolangs Lord_of_Life :Lord < 1665968286 539529 :int-e!~noone@int-e.eu PRIVMSG #esolangs :Oh it's not quite correct. < 1665968327 182037 :int-e!~noone@int-e.eu PRIVMSG #esolangs :Nah, it's correct after all. < 1665968345 990713 :int-e!~noone@int-e.eu PRIVMSG #esolangs :I'm just confusing myself with second thoughts. < 1665968352 120970 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :Right, you resolve and then remove all the clauses containing the original literal. < 1665968357 742376 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :So if there are no negations you just remove all of them. < 1665968363 20884 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :I also confused myself for a bit about it. < 1665968448 763468 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :I have something like a topological sort of a partial order, but with the property that there are a bunch of extra constraints of the form "if a < b, then c < d, e < f, etc." < 1665968467 711289 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :Is there a nice representation of this sort of thing? It seems like it'd get very busy visually, drawing all the hypothetical edges. < 1665968502 869914 :int-e!~noone@int-e.eu PRIVMSG #esolangs :so... putting b before a may be advantageous? < 1665968540 250939 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :It's not really that I want to find an "optimal" order. < 1665968545 171892 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :I just want to explore all the possible orders. < 1665968586 377356 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :Specifically this is about CPU memory ordering. The nodes in this graph are things like "store x is visible at thread t". < 1665968605 107014 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :A directed graph isn't flexible enough for the kinds of constraints you'd want to express. < 1665968628 333915 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :I *think* maybe constraints of the form I gave might be enough. < 1665968666 130 :int-e!~noone@int-e.eu PRIVMSG #esolangs :fancy. you have a digraph on the edges of a digraph < 1665968712 680946 :int-e!~noone@int-e.eu PRIVMSG #esolangs :(if you split "if a < b, then c < d, e < f, etc." into "if a < b, then c < d", "if a < b, then e < f", etc. < 1665968715 684710 :int-e!~noone@int-e.eu PRIVMSG #esolangs :) < 1665968743 169458 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :I see, where the 2-cell structure here is "this edge exists implies that this edge exists". < 1665968815 391196 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :That's an interesting way to look at it. < 1665968964 90597 :int-e!~noone@int-e.eu PRIVMSG #esolangs :b_jonas: anyway, regarding needing a SAT solver... I got 120 edges basically on pen&paper. < 1665968981 589747 :int-e!~noone@int-e.eu PRIVMSG #esolangs :b_jonas: but I'm trying to narrow the gap between the lower and upper bounds that I have. < 1665969030 3322 :int-e!~noone@int-e.eu PRIVMSG #esolangs :b_jonas: partly because the problem *originally* asked for an optimal solution. < 1665969045 589710 :zzo38!~zzo38@host-24-207-14-22.public.eastlink.ca PRIVMSG #esolangs :I do not have any of the TAOCP although I have borrowed the first few temporarily from the inter library loan. I think I might be interested to read, though. < 1665969083 522547 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :It's kind of weird to think of it the way you said because the 1-cell edges might not actually exist, right? < 1665969089 28955 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :Or am I missing a nice way to make that work? < 1665969373 480854 :int-e!~noone@int-e.eu PRIVMSG #esolangs :I guess you kind of need two forms, T ==> a < b (or just a < b) for unconditional orderings, and then the interesting a < b ==> c < d. < 1665969420 670344 :int-e!~noone@int-e.eu PRIVMSG #esolangs :(you can play tricks like a < b ==> P and b < a ==> P exploiting that you're looking for total orders, but that doesn't seem helpful) < 1665969446 590743 :int-e!~noone@int-e.eu PRIVMSG #esolangs :I'm trying to convince myself that this is NP-hard. < 1665969781 131528 :int-e!~noone@int-e.eu PRIVMSG #esolangs :Ah. Yes, it is. You can use a < b for a literal (and b < a for its negation), and then, to encode A | B | C, pick fresh auxiliary variables u,v,w, and encode !A => u < v, !B => v < w, !C => w < u, thereby reducing from 3-SAT. < 1665969870 460205 :int-e!~noone@int-e.eu PRIVMSG #esolangs :(transitivity is a bunch of 3-clauses) < 1665969981 691600 :int-e!~noone@int-e.eu PRIVMSG #esolangs :b_jonas: Oh well I submitted https://savannah.gnu.org/support/index.php?110743 < 1665970169 662710 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :What's the thing that's NP-hard? Finding out whether a topological order exists at all? < 1665970206 732779 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :Hmm, I guess my statement is too general, because they certainly always exist in my case. < 1665970458 460306 :int-e!~noone@int-e.eu PRIVMSG #esolangs :It probably doesn't matter for enumeration (unless the set of valid orderings gets very sparse relative to the n! possible ones) < 1665970628 669042 :int-e!~noone@int-e.eu PRIVMSG #esolangs :NP-hard: Enumeration is, since it has to solve the existence problem to produce the first candidate. < 1665970693 271760 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :Certainly enumeration is NP-hard if existence is. < 1665970702 290218 :int-e!~noone@int-e.eu PRIVMSG #esolangs :shachaf: in your application, do you ever have both a < b and b < a? < 1665970763 400226 :int-e!~noone@int-e.eu PRIVMSG #esolangs :(from the description I'd rather suspect that all pairs a < b are picked from a preexisting partial order) < 1665970851 661124 :int-e!~noone@int-e.eu PRIVMSG #esolangs :(but I'm not sure) < 1665970881 440650 :int-e!~noone@int-e.eu PRIVMSG #esolangs :however... I'll try to catch some sleep < 1665971016 653870 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :What do you mean? < 1665971052 724074 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :Very often the constraints are of the form: "if a_0 < b_0, then a_1 < b_1, a_2 < b_2" and "if b_0 < a_0, then b_1 < a_1, b_2 < a_2" < 1665971102 414611 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :Actually the constraint here is that there's a global order on {a, b, c} such that each cluster {a_i, b_i, c_i} is in the same order. < 1665971104 290023 :int-e!~noone@int-e.eu PRIVMSG #esolangs :Ah! < 1665971109 774854 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :(This isn't the only kind of constraint but it's an important one.) < 1665971196 351539 :int-e!~noone@int-e.eu PRIVMSG #esolangs :Though "if a < b then c < d" and "if d < c then b < a" are equivalent. < 1665971203 450048 :int-e!~noone@int-e.eu PRIVMSG #esolangs :still... sleep < 1665971250 17421 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :So one thing I was imagining was a GUI for exploring simple graphs, where you click on one node at a time to create a particular total order. < 1665971277 884320 :shachaf!~shachaf@user/shachaf PRIVMSG #esolangs :But something for enumerating all possible orders would also be useful. < 1665972738 20736 :b_jonas!~x@adsl-89-134-13-99.monradsl.monornet.hu PRIVMSG #esolangs :zzo38: you can buy them as e-books now < 1665972804 390674 :b_jonas!~x@adsl-89-134-13-99.monradsl.monornet.hu PRIVMSG #esolangs :int-e: a bug report for bash. I see. < 1665973015 498579 :razetime!~quassel@117.193.4.27 JOIN #esolangs * :razetime < 1665974250 270100 :earend1!uid568065@user/utoneq JOIN #esolangs zut :utoneq < 1665976411 951605 :zzo38!~zzo38@host-24-207-14-22.public.eastlink.ca PRIVMSG #esolangs :I would prefer a printed copy, though < 1665977772 16199 :Soni!~quassel@autistic.space JOIN #esolangs SoniEx2 :Genders: Autgender, 💜⬜💚; Soni L. < 1665978144 438521 :b_jonas!~x@adsl-89-134-13-99.monradsl.monornet.hu PRIVMSG #esolangs :zzo38: you can order those too < 1665978216 729072 :b_jonas!~x@adsl-89-134-13-99.monradsl.monornet.hu PRIVMSG #esolangs :they're somewhat more expensive though < 1665978462 190848 :zzo38!~zzo38@host-24-207-14-22.public.eastlink.ca PRIVMSG #esolangs :How much expensive? < 1665979086 931850 :b_jonas!~x@adsl-89-134-13-99.monradsl.monornet.hu PRIVMSG #esolangs :zzo38: https://www.informit.com/promotions/art-of-computer-programming-books-and-ebooks-140521 < 1665979151 758008 :b_jonas!~x@adsl-89-134-13-99.monradsl.monornet.hu PRIVMSG #esolangs :hard to tell because the shipping costs aren't obvious if you're outside the US < 1665979162 541542 :b_jonas!~x@adsl-89-134-13-99.monradsl.monornet.hu PRIVMSG #esolangs :I only bought the e-books < 1665979215 480911 :razetime!~quassel@117.193.4.27 QUIT :Ping timeout: 250 seconds < 1665981341 306444 :razetime!~quassel@117.193.4.27 JOIN #esolangs * :razetime < 1665982171 751437 :sprock!~sprock@user/sprock QUIT :Remote host closed the connection < 1665982490 450991 :sprock!~sprock@user/sprock JOIN #esolangs sprock :maeve (she/her) < 1665982838 313749 :zzo38!~zzo38@host-24-207-14-22.public.eastlink.ca PRIVMSG #esolangs :I am in Canada, which is near United States. < 1665982969 360510 :zzo38!~zzo38@host-24-207-14-22.public.eastlink.ca PRIVMSG #esolangs :Scryfall bulk files has a Oracle bulk file, which seems good to me, but last time, I had problems with it. For example, I should not want any cards that do not have Oracle text (somehow, there are some, even though there should not be), and do not want anything about versions of cards but only the Oracle and legality, that is in common of all versions. < 1665982993 435703 :zzo38!~zzo38@host-24-207-14-22.public.eastlink.ca PRIVMSG #esolangs :Now that there is lights too, I should think that the lights should be given as an array of array of numbers, but it does not do that. < 1665983177 700927 :zzo38!~zzo38@host-24-207-14-22.public.eastlink.ca PRIVMSG #esolangs :Is there a better one available? < 1665983583 421849 :earend1!uid568065@user/utoneq QUIT :*.net *.split < 1665983584 911975 :pikhq!sid394595@user/pikhq QUIT :*.net *.split < 1665983585 61407 :imode!sid553797@user/imode QUIT :*.net *.split < 1665983585 125694 :MizMahem!sid296354@user/mizmahem QUIT :*.net *.split < 1665983585 158987 :integral!sid296274@user/integral QUIT :*.net *.split < 1665983585 214014 :Argorok!sid195487@id-195487.hampstead.irccloud.com QUIT :*.net *.split < 1665983598 868117 :imode!sid553797@user/imode JOIN #esolangs imode :imode < 1665983608 271095 :Argorok!sid195487@id-195487.hampstead.irccloud.com JOIN #esolangs * :Argorok < 1665983632 815328 :earend1!uid568065@id-568065.helmsley.irccloud.com JOIN #esolangs * :utoneq < 1665983654 670543 :MizMahem!sid296354@id-296354.helmsley.irccloud.com JOIN #esolangs * :🐍🐔 < 1665983660 130400 :earend1!uid568065@id-568065.helmsley.irccloud.com CHGHOST uid568065 :user/utoneq < 1665983669 504962 :integral!sid296274@id-296274.lymington.irccloud.com JOIN #esolangs * :bsmith < 1665983670 542104 :pikhq!sid394595@id-394595.uxbridge.irccloud.com JOIN #esolangs * :Ada Worcester < 1665983672 919097 :MizMahem!sid296354@id-296354.helmsley.irccloud.com CHGHOST sid296354 :user/mizmahem < 1665983677 196222 :integral!sid296274@id-296274.lymington.irccloud.com CHGHOST sid296274 :user/integral < 1665983679 435874 :pikhq!sid394595@id-394595.uxbridge.irccloud.com CHGHOST sid394595 :user/pikhq < 1665988036 333894 :Sgeo!~Sgeo@user/sgeo QUIT :Read error: Connection reset by peer < 1665993114 495129 :tromp!~textual@92-110-219-57.cable.dynamic.v4.ziggo.nl JOIN #esolangs * :Textual User < 1665993696 244978 :razetime!~quassel@117.193.4.27 QUIT :Ping timeout: 264 seconds < 1665995198 557889 :razetime!~quassel@117.193.4.27 JOIN #esolangs * :razetime < 1665997519 525139 :razetime!~quassel@117.193.4.27 QUIT :Ping timeout: 250 seconds < 1665997548 981189 :razetime!~quassel@117.193.4.27 JOIN #esolangs * :razetime < 1665998062 196126 :__monty__!~toonn@user/toonn JOIN #esolangs toonn :Unknown < 1666000872 945450 :laerling!~laerling@static.89.231.201.195.clients.your-server.de CHGHOST ~laerling :user/laerling < 1666001154 975808 :razetime!~quassel@117.193.4.27 QUIT :Ping timeout: 248 seconds > 1666001329 580723 PRIVMSG #esolangs :14[[07!lyriclydemoteestablishcommunism!14]]4 10 02https://esolangs.org/w/index.php?diff=103997&oldid=99916 5* 03HungKhanh0106 5* (+76) 10/* Implementation */ > 1666001354 677360 PRIVMSG #esolangs :14[[07!lyriclydemoteestablishcommunism!14]]4 10 02https://esolangs.org/w/index.php?diff=103998&oldid=103997 5* 03HungKhanh0106 5* (+4) 10/* Implementation */ < 1666002424 853606 :razetime!~quassel@117.193.4.27 JOIN #esolangs * :razetime < 1666005759 926270 :Noisytoot!~noisytoot@sourcehut/user/noisytoot QUIT :Quit: ZNC 1.8.2 - https://znc.in < 1666006010 853161 :Noisytoot!~noisytoot@sourcehut/user/noisytoot JOIN #esolangs Noisytoot :Ron < 1666009283 3818 :Noisytoot!~noisytoot@sourcehut/user/noisytoot QUIT :Ping timeout: 248 seconds < 1666009570 119642 :Noisytoot!~noisytoot@sourcehut/user/noisytoot JOIN #esolangs Noisytoot :Ron < 1666010145 731464 :Noisytoot!~noisytoot@sourcehut/user/noisytoot QUIT :Ping timeout: 268 seconds < 1666010935 389127 :Noisytoot!~noisytoot@sourcehut/user/noisytoot JOIN #esolangs Noisytoot :Ron < 1666011469 810740 :Noisytoot!~noisytoot@sourcehut/user/noisytoot QUIT :Ping timeout: 246 seconds < 1666012056 478746 :Noisytoot!~noisytoot@sourcehut/user/noisytoot JOIN #esolangs Noisytoot :Ron < 1666012887 12624 :tromp!~textual@92-110-219-57.cable.dynamic.v4.ziggo.nl QUIT :Quit: My iMac has gone to sleep. ZZZzzz… < 1666013761 739499 :tromp!~textual@92-110-219-57.cable.dynamic.v4.ziggo.nl JOIN #esolangs * :Textual User < 1666014029 153241 :shikhin!~shikhin@offtopia/offtopian NICK :handy < 1666014038 444656 :Sgeo!~Sgeo@user/sgeo JOIN #esolangs Sgeo :realname < 1666014052 448974 :handy!~shikhin@offtopia/offtopian NICK :shikhin < 1666021441 912276 :tromp!~textual@92-110-219-57.cable.dynamic.v4.ziggo.nl QUIT :Quit: My iMac has gone to sleep. ZZZzzz… < 1666022800 167969 :tromp!~textual@92-110-219-57.cable.dynamic.v4.ziggo.nl JOIN #esolangs * :Textual User < 1666023816 691592 :tromp!~textual@92-110-219-57.cable.dynamic.v4.ziggo.nl QUIT :Quit: My iMac has gone to sleep. ZZZzzz… < 1666024438 407181 :tromp!~textual@92-110-219-57.cable.dynamic.v4.ziggo.nl JOIN #esolangs * :Textual User < 1666025243 163684 :tromp!~textual@92-110-219-57.cable.dynamic.v4.ziggo.nl QUIT :Quit: My iMac has gone to sleep. ZZZzzz… < 1666026319 499810 :Noisytoot!~noisytoot@sourcehut/user/noisytoot QUIT :Ping timeout: 252 seconds < 1666026452 457963 :Noisytoot!~noisytoot@sourcehut/user/noisytoot JOIN #esolangs Noisytoot :Ron < 1666026795 687568 :FreeFull!~freefull@user-5-173-156-42.play-internet.pl JOIN #esolangs FreeFull :FreeFull < 1666026803 46089 :Noisytoot!~noisytoot@sourcehut/user/noisytoot QUIT :Remote host closed the connection < 1666026999 582518 :Noisytoot!~noisytoot@sourcehut/user/noisytoot JOIN #esolangs Noisytoot :Ron < 1666030447 341433 :tromp!~textual@92-110-219-57.cable.dynamic.v4.ziggo.nl JOIN #esolangs * :Textual User < 1666030575 565949 :razetime!~quassel@117.193.4.27 QUIT :Quit: https://quassel-irc.org - Chat comfortably. Anywhere. < 1666033616 948070 :zzo38!~zzo38@host-24-207-14-22.public.eastlink.ca PRIVMSG #esolangs :How does name stickers working in Magic: the Gathering if applied to an object that has no name or that has multiple names? > 1666036467 634412 PRIVMSG #esolangs :14[[07Tinytalk14]]4 M10 02https://esolangs.org/w/index.php?diff=103999&oldid=103996 5* 03Rdococ 5* (+50) 10/* Sets */ < 1666040571 836865 :tromp!~textual@92-110-219-57.cable.dynamic.v4.ziggo.nl QUIT :Quit: My iMac has gone to sleep. ZZZzzz… > 1666040687 845853 PRIVMSG #esolangs :14[[07Tinytalk14]]4 M10 02https://esolangs.org/w/index.php?diff=104000&oldid=103999 5* 03Rdococ 5* (-25) 10/* Implementations */ < 1666045154 510600 :__monty__!~toonn@user/toonn QUIT :Quit: leaving < 1666048070 635957 :fungot!~fungot@2a01:4b00:82bb:1341::a QUIT :Ping timeout: 268 seconds > 1666049933 739165 PRIVMSG #esolangs :14[[07Special:Log/newusers14]]4 create10 02 5* 03Lien889 5* 10New user account < 1666050609 176230 :FreeFull!~freefull@user-5-173-156-42.play-internet.pl QUIT :