  We give a first account of our new parallel SAT solver Gimsatul. Its key
feature is to share clauses physically in memory instead of copying them, which
is the method of other state-of-the-art multi-threaded SAT solvers to exchange
clauses logically. Our approach keeps information about which literals are
watched in a clause local to a solving thread but shares the actual immutable
literals of a clause globally among all solving threads. This design gives
quite remarkable parallel scalability, allows aggressive clause sharing while
keeping memory usage low and produces more compact proofs.
