human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "proceedings of the 15th international workshop on the acl2 theorem prover and its applications a toolbox for property checking from simulation using incremental sat extended abstract"):
  Abstract: We present a tool that primarily supports the ability to check bounded properties starting from a sequence of states in a run. The target design is compiled into an AIGNET which is then selectively and iteratively translated into an incremental SAT instance in which clauses are added for new terms and simplified by the assignment of existing literals. Additional applications of the tool can be derived by the user providing alternative attachments of constrained functions which guide the iterations and SAT checks performed. Some Verilog RTL examples are included for reference.

Includes members:
  Member "proceedings twelfth international workshop on the acl2 theorem prover and its applications":
    also connected through other hyperedges:
      (none)
  Member "proceedings international workshop on the acl2 theorem prover and its applications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a macro for reusing abstract functions and theorems")
  Member "verified aig algorithms in acl2":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "incremental sat library integration using abstract stobjs")
  Member "bit blasting acl2 theorems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey on theorem provers in formal methods")
  Member "proceedings 10th international workshop on the acl2 theorem prover and its applications":
    also connected through other hyperedges:
      (none)

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.SE(Software Engineering)